Id: palomar/PALOMAR-2026-11-09-000008 Url: https://github.com/vltanh/lean4-smoothed-octagon/tree/9ba6bf8630c70d6a0f11ecfef15021cb83df8c40 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000008-v1.json Repo: https://github.com/vltanh/lean4-smoothed-octagon Tags: math.MG, math.OC, msc:52C15, msc:52A10, msc:52A40, msc:49K15, msc:68V20 Score: 0 Title: The Reinhardt conjecture, formalized in Lean 4 Trust: high Domain: math.MG Source: palomar Authors: The-Anh Vu-Le Reviews: 0 Subject: math.MG Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-09 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-09-000008 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…