Worked solution: Viazovska's modular form solution to sphere packing in dimensions 8 and 24
Sphere packing asks the simple childhood question — how do you arrange identical balls to fill as much space as possible without overlapping — but in dimensions far beyond the three we can see. Before 2016, mathematicians had only ever nailed down the exact best answer in dimensions , , and (the last being Kepler's conjecture, proved in 1998); dimensions and were suspicious because two exceptionally symmetric structures, the lattice and the Leech lattice, packed balls almost unbelievably well there, and computer bounds had shown they were within a whisker of optimal — but 'within a whisker' is not a proof.
The sphere packing constant is the supremum, over all packings of non-overlapping unit balls in , of the fraction of space the balls occupy. It was known exactly only for (trivial), (the hexagonal packing, A. Thue and L. Fejes Tóth), and (the face-centred cubic packing, T. Hales's 1998 proof of the Kepler conjecture). Cohn and Elkies's 2003 linear programming method produced numerical upper bounds for that came astonishingly close to the densities of the lattice in and the Leech lattice in — within a factor of about for — strongly suggesting, but not proving, that these two highly symmetric lattices were optimal.
In 2016 Maryna Viazovska proved , the exact density of the -lattice packing (Steps 2–5 below sketch her method); the very next week she, Henry Cohn, Abhinav Kumar, Stephen D. Miller, and Danylo Radchenko adapted the same technique to prove , the density of the Leech lattice (Step 6). These remain, together with dimensions , , and , the only dimensions in which the sphere packing problem is fully solved.