{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-16-reinhardt-conjecture-proof-claim-fei-xue-chatgpt/","md":"https://postcutoff.com/e/2026-11-16-reinhardt-conjecture-proof-claim-fei-xue-chatgpt/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-16-reinhardt-conjecture-proof-claim-fei-xue-chatgpt","date":"2026-11-16","date_precision":"day","short_title":"Reinhardt conjecture: claimed proof (ChatGPT-assisted)","deck":null,"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.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.21470: A proof of the Reinhardt conjecture (Fei Xue)","url":"https://arxiv.org/abs/2611.21470","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Hales and Vajjha, Packings of smoothed polygons (arXiv 2405.04331)","url":"https://arxiv.org/abs/2405.04331","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"Hales, The Reinhardt conjecture as an optimal control problem (arXiv 1703.01352)","url":"https://arxiv.org/abs/1703.01352","type":"paper","group":"primary","domain":"arxiv.org"}],"official":3,"filed":"2026-11-17","updated":"2026-11-17","orgs":["OpenAI","independent researchers"],"title":"Fei Xue claims a proof of Reinhardt's 1934 conjecture that the smoothed octagon packs worst, with ChatGPT 6.1 Sol credited for the proofs of the remaining cases","summary":"arXiv 2611.21470 (math.MG, 16 Nov 2026), Fei Xue: \"We prove the Reinhardt conjecture: among centrally symmetric convex disks in the plane, the smoothed regular octagon has the least optimal lattice packing density\", with equality only for its affine images. The proof bounds the number of control arcs in Hales's optimal-control formulation and verifies the remaining switching types by rigorous finite computation. The acknowledgments credit ChatGPT with the exploration of local cost bounds and the proofs of the six remaining cases. Unrefereed; no expert reaction found by 17 Nov.","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"],"key_numbers":[],"tags":["math","discrete-geometry","packing","reinhardt-conjecture","chatgpt","gpt-6-1-sol","computer-assisted-proof","arxiv"],"science":{"field":"mathematics","subfield":"discrete geometry / packing","problem":"Reinhardt conjecture (1934): the smoothed octagon minimizes the optimal lattice packing density among centrally symmetric convex disks","result":"Claimed full proof, with equality only for affine images of the smoothed octagon","open_since":"1934","ai_system":["ChatGPT 6.1 Sol","ChatGPT"],"human_role":"Author proposed the finite arc bound and the overall reduction; ChatGPT explored local cost bounds and carried out the proofs of six remaining cases and the organization of the manuscript","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint with computer-assisted finite verification; not checked independently"},"status":"pending","shock":""},"body_md":"## What happened\n\nOn 16 Nov 2026 Fei Xue posted a preprint claiming a proof of Reinhardt's conjecture, one of the classical open problems on\npacking convex shapes. Thomas Hales had reformulated it as an optimal-control problem, and with Koushik Vajjha proved that a\nminimizer uses only finitely many switches. The new paper bounds those switches explicitly and checks the remaining cases with\ncertified computations. The author says the model did the sustained work on the local bounds and the proofs of the last six\ncases; he writes that he hopes later work \"will lead to a shorter and more beautiful proof\".\n\n## Why it matters\n\nReinhardt's problem is the planar analogue of the question of which convex body packs worst. It has been open since 1934 and\nHales has worked on it for 15 years. A proof of this length that rests partly on model-written case analysis will need expert\nchecking before it is accepted.","disputed":[{"label":"Verification","text":"Unrefereed preprint with computer-assisted finite verification; not checked independently","sources":[]}],"related":[{"id":"2026-11-17-ai-assisted-results-november-17-listing","url":"https://postcutoff.com/e/2026-11-17-ai-assisted-results-november-17-listing/","date":"2026-11-17","date_precision":"day","short_title":"AI-assisted results, 17 Nov","deck":null,"takeaway":"The sweep listed 407 arXiv papers with AI statements (262 new on 17 Nov), 82 conjecture papers without one, 72 Hexagon works, 17 result-repo commits and 4 watched repos. Every line was read; PDFs were checked at the AI statement. Eight results got their own entries, five existing entries were extended, and 127 arXiv papers and 44 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":9,"official":9,"filed":"2026-11-17","updated":"2026-11-17","orgs":["OpenAI","Anthropic","Google","Axiom","various researchers"]}],"people":[{"id":"thomas-hales","name":"Thomas Hales","url":"https://postcutoff.com/person/thomas-hales/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-17","type":"filed","text":"Created (science agent; the acknowledgments name ChatGPT)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-17","run":null,"sources_read":null,"updated":"2026-11-17","human_review":null,"version":{"date":"2026-11-17"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":169,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":139,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":230,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":169,"in_training_data":false}],"short_url":"https://postcutoff.com/s/reinhardt-conjecture-proof"}