Worked solution: Viazovska's modular form solution to sphere packing in dimensions 8 and 24
With the magic function in hand, satisfying every sign condition and achieving equality exactly at the vectors, the Cohn–Elkies machine from Step 2 finishes the job automatically: it converts the mere existence of into a proof that nothing beats 's density, and — because equality can only happen when the packing's vectors are exactly the zero set of and — into a proof that is essentially the only periodic packing that achieves it.
Since and constructed in Steps 4–5 vanish (to double order) at exactly the nonzero vectors of and respectively, and , the chain of inequalities from Step 3 becomes a chain of equalities, so the Cohn–Elkies bound is attained exactly by the -lattice packing, giving . Combining this with the general uniqueness argument for Cohn–Elkies bounds (equality forces the packing's difference set to equal the zero set of ), is not merely a densest packing but the unique periodic packing of maximal density, up to scaling and isometry — the theorem announced in Viazovska's 2016 preprint and published in the Annals of Mathematics in 2017.