a sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all. erdos and rado in 1960 proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$, with at least about $w^w$ sets, must contain a sunflower. the famous sunflower conjecture is that the bound on the number of sets can be improved to $c^w$ for some constant $c$. despite much research, the best bounds until recently were all of the order of $w^{cw}$ for some constant c. in this work, we improve the bounds to about $(log w)^w$. there are two main ideas that underlie our result. the first is a structure vs pseudo-randomness paradigm, a commonly used paradigm in combinatorics. this allows us to either exploit structure in the given family of sets, or otherwise to assume that it is pseudo-random in a certain way. the second is a duality between families of sets and dnfs (disjunctive normal forms). dnfs are widely studied in theoretical computer science. one of the central results about them is the switching lemma, which shows that dnfs simplify under random restriction. we show that when restricted to pseudo-random dnfs, much milder random restrictions are sufficient to simplify their structure. joint work with ryan alweiss, kewen wu and jiapeng zhang.