AI-Assisted Square Packing Breakthroughs: Optimality Proof for n=11, New Bounds Up to 53
ctjlewis · x · 2026-10-07
The Squares Project, started by Joshua Levy in August 2026, catalogs an explosion of AI-assisted results on the square packing problem: new lower bounds for n=11,17–20, a certified 31/8 bound by Kleddamag, Queuingtheorydotcom's landmark optimality proof for the famous 11-square case, and Evan Daniel's proof of the whole family s(k²−3)=k for k≥6 plus exact values at 21, 32, 45. Proofs and certificates are AI-assistedly verified, with a browser for best known packings.
Related event: AI-Assisted Team Proves Optimality of 11-Square Packing, Formalized in Lean(9 posts)→
More from Research
- GroundedSLAM debuts, decisively beating all methods on Meta's egocentric SLAM benchmark — Scobleizer · 2026-10-07
- HCI researcher begs authors to stop claiming 'reflexive' thematic analysis without reflexivity — IanArawjo · 2026-10-07
- Reza Zadeh claims faster matrix multiplication algorithm, suspects labs near exponent 2 — Reza_Zadeh · 2026-10-07
- Redditor proposes graph-based deterministic modeling to make LLM finance agents trustworthy — jonnylegs · 2026-10-07
- COLM 2026 poster presents scaling test-time compute for agentic coding — dan_fried · 2026-10-07
- COLM 2026 Efficient Reasoning workshop lands Friday, with panel featuring top researchers — tydsh · 2026-10-07