The Reinhardt conjecture, formalized in Lean 4
Source: github.com/vltanh/lean4-smoothed-octagon/tree/9ba6bf8630c70…
The Reinhardt problem asks for the centrally symmetric convex disk in the plane whose densest packing by congruent copies is least dense. Karl Reinhardt (1934) and, independently, Kurt Mahler (1947) found the smoothed octagon, a regular octagon whose corners are cut off by arcs of hyperbolas, each asymptotic to the next two side lines, with greatest packing density delta_oct = (8 - 4 sqrt 2 - log 2)/(2 sqrt 2 - 1) = 0.902414..., and Reinhardt conjectured that no centrally symmetric convex disk packs worse. The conjecture has been open since 1934; Thomas Hales cast it as a problem of Bolza in…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-09-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'