The Kepler Conjecture

Walk past any fruit stand and you will see the answer to a 400-year-old math problem. Oranges are piled in a neat pyramid, each layer nestled into the dimples of the one below. Cannonballs were stacked the same way for centuries. It looks obviously efficient — but is it really the best you can do?

In 1611 the astronomer Johannes Kepler wrote down the claim: among all ways of packing identical spheres into space, none is denser than this pyramid stack. The wasted gaps fill the rest, and the spheres themselves occupy about 74.05% of the volume — precisely $\frac{\pi}{\sqrt{18}}$.

It sounds like something you could check in an afternoon. Instead it became one of the most stubborn problems in mathematics, resisting proof for nearly four centuries.

Packing is easiest to feel in two dimensions, where circles stand in for spheres. Lay circles on a square grid and there are wide gaps; shift every other row so circles nestle into the dips and you get the hexagonal packing — the flat cousin of the grocer's pyramid. The demo computes the fraction of area each layout actually covers.

<p class="hint">{{hint}}</p>
<div class="btns">
  <button id="square" type="button">{{btn_square}}</button>
  <button id="hex" type="button">{{btn_hex}}</button>
</div>
<canvas id="cv" width="360" height="240"></canvas>
<div class="status" id="status"></div>

* { box-sizing: border-box; }
body { font-family: system-ui, sans-serif; color: #222; margin: 0; }
.hint { font-size: .9rem; color: #444; margin: 0 0 .7rem; line-height: 1.45; }
.btns { display: flex; gap: .5rem; flex-wrap: wrap; margin-bottom: .6rem; }
button { font: 600 14px system-ui, sans-serif; padding: .45rem .9rem; border: 1px solid #1d3557;
         background: #fff; color: #1d3557; border-radius: 8px; cursor: pointer; }
button.active { background: #1d3557; color: #fff; }
canvas { border: 1px solid #cdd9e3; border-radius: 8px; background: #f4f7fa; display: block; max-width: 100%; }
.status { font-size: 1rem; font-weight: 600; margin: .6rem 0; min-height: 1.4em; color: #0a7d33; }

// Code not found

Switch between the two arrangements and watch the number move. The square grid fills about 78.5% of the plane; the hexagonal one reaches 90.7% — provably the best possible for circles (Thue, 1910). Spheres in 3D tell the same story, with the optimum dropping to 74.05%. The pattern is easy to see and easy to believe. Proving that nothing beats it is the hard part.

Why was something so visually obvious so hard to nail down?

• It's an optimization over infinitely many arrangements. A packing of all of space is an infinite object, and you must rule out every alternative — including clever irregular ones that locally look denser. The grocer's stack (called face-centered cubic) is not even unique: infinitely many "close packings" tie at 74.05%.
• Density is deceptive locally. Around a single sphere you can fit twelve neighbors several ways, some momentarily roomier. Only the global average settles the question, and counting that average rigorously is brutal.
• It's PROVEN — solved, not open. In 1998 Thomas Hales announced a proof: he reduced the infinite problem to a finite list of a few thousand configurations, then used a computer to bound each one by linear programming and interval arithmetic — about 250 pages plus gigabytes of output.
• Then it was formally verified. Referees could not fully certify the code by hand, so Hales led the Flyspeck project, which re-derived the entire proof inside the HOL Light and Isabelle proof assistants. It finished in 2014: every logical step machine-checked.

So the precise status is settled: $\frac{\pi}{\sqrt{18}} \approx 0.7405$ is the maximum, full stop. Like the four-color theorem, it is a landmark example of a result humans believed for centuries but could only prove with a machine — a cousin of the computational limits behind P vs NP.

"Pack as much as possible into limited space" shows up far beyond the fruit stand:

• Error-correcting codes. Reliable digital messages are points spread as far apart as possible in high-dimensional space — exactly a sphere-packing problem. Denser packings mean more codewords per unit of noise tolerance.
• Crystallography and materials. Many metals crystallize in the face-centered-cubic arrangement precisely because it is the densest; packing geometry shapes density, strength and conductivity.
• Chemistry and biology. How atoms, colloids and even virus shells arrange themselves is governed by the same drive to fill space efficiently.
• Storage and logistics. Loading granular material, arranging fibers, or stacking goods all chase the same elusive maximum.

The higher-dimensional cousins are still being conquered: in 2016 Maryna Viazovska solved sphere packing in dimensions 8 and 24, work that helped earn her a Fields Medal. The geometry that decides the best packing also underlies the lattices behind modern cryptography.

The Kepler conjecture is a quiet triumph of mathematics meeting reality. The greengrocer was right all along: stack identical spheres any way you like, and you will never beat the pyramid's 74.05%. What took a moment to guess took Thomas Hales nearly a decade to prove (1998) and an international team until 2014 to verify line by line.

It is a reminder that "obvious" and "proven" live in different worlds, and that some of the deepest certainty we have now comes with a machine's signature on it. The next time you pass a pile of oranges, you are looking at a settled theorem — and a hint of the computational limits that shape what mathematics can know.