Reinhardt conjecture: claimed proof (ChatGPT-assisted)
Awaiting review
Importance: major (4 of 5)The takeaway
A single-author preprint of more than 470 pages claims Reinhardt’s conjecture: among centrally symmetric convex disks, the smoothed octagon has the lowest optimal lattice packing density. The author proposed the finite reduction; ‘ChatGPT 6.1 Sol carried out the proofs of the six remaining types’. Unrefereed.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Preprint only
- Importance
- Major (4 of 5)
- Last verified
- 17 November 2026
Your AI and this story
- GPT-6.2 Astra169 days after its cutoff
- Claude Opus 5.5139 days after its cutoff
- Gemini 4 Hydrogen230 days after its cutoff
- Grok 4.7169 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 139 days before it.
Key facts
- Claim (abstract): the smoothed regular octagon has the least optimal lattice packing density among centrally symmetric convex disks; equality holds precisely for its nonsingular affine images. Reinhardt proposed it in 1934
- Method (abstract): ‘explicit bounds on the number of control arcs, local cost inequalities and rigorous finite verification of the remaining switching types’, building on Hales’s optimal-control formulation and the Hales–Vajjha finiteness theorem (arXiv 2405.04331)
- AI statement (acknowledgments, verbatim): ‘The author proposed the argument giving an explicit finite upper bound for the number of control arcs. ChatGPT dot carried out the sustained exploration of local cost lower bounds. ChatGPT 6.1 Sol carried out the proofs of the six remaining types R01–R06 and the organization of the manuscript.’
- Length: running page numbers reach at least 472; a reader archive with algorithms and fixed data accompanies the finite checks
- The author thanks Chuanming Zong and Thomas Hales for seminar discussions around 2015 that introduced him to the problem
- Status: unrefereed preprint, no Lean formalization; the sweep’s PDF scan missed the AI statement (it sits in the acknowledgments without the usual wording), found on manual re-scan 17 Nov
What happened
On 16 Nov 2026 Fei Xue posted a preprint claiming a proof of Reinhardt’s conjecture, one of the classical open problems on packing convex shapes. Thomas Hales had reformulated it as an optimal-control problem, and with Koushik Vajjha proved that a minimizer uses only finitely many switches. The new paper bounds those switches explicitly and checks the remaining cases with certified computations. The author says the model did the sustained work on the local bounds and the proofs of the last six cases; he writes that he hopes later work “will lead to a shorter and more beautiful proof”.
Why it matters
Reinhardt’s problem is the planar analogue of the question of which convex body packs worst. It has been open since 1934 and Hales has worked on it for 15 years. A proof of this length that rests partly on model-written case analysis will need expert checking before it is accepted.
What is disputed or not yet verified
| Verification | Unrefereed preprint with computer-assisted finite verification; not checked independently |
|---|
Sources
3 sources from 1 site. Numbers match the chips in the text.
3 sources: 3 primary
Primary
Changes
- Filed (science agent; the acknowledgments name ChatGPT)