11-Square Packing Optimality Proved and Formalized in Lean With Help From Astra and Claude
ctjlewis · x · 2026-10-07
The optimality of packing 11 squares (s(11) = 3.87708359…) has been proven and formalized in Lean with the help of Astra and Claude. The construction dates to Walter Trump's 1979 hand-built packing; the proof uses counting arguments plus geometric exclusions and exact symmetry, with tilt angles tied to a degree-8 polynomial. Independent auditors replayed the pinned source inputs to verify the result, working around four stale cached audit digests in the public release.
More from Research
- MIT NeurIPS Paper Adds Uncertainty Quantification with Probabilistic Guarantees to Robot Memory — lucacarlone1 · 2026-10-07
- NeurIPS 2026 paper 'Follow the Winners': imitate winning trajectories instead of PPO/GRPO — lawrennd · 2026-10-07
- NeurIPS paper adds probabilistic uncertainty quantification to robot memory for better retrieval — lucacarlone1 · 2026-10-07
- EVA from UTokyo revives VAEs for sequence generation with a single extra linear layer — RichmanRonald · 2026-10-07
- Pantheon built a 1M+ task UMI dataset in 8 weeks, adding 45k tasks daily — hamostaf04 · 2026-10-07
- Anthropic reportedly paying mathematicians to verify and polish AI-assisted proofs — mathemagic1an · 2026-10-07