Today for AI
HOT RADAR
llmHEAT 16.4°

AI CLUSTERED EVENT · 10/7/2026

AI-Assisted Formal Proof of Optimal 11-Square Packing

1 reports archived1 independent sourcesupdated 10/7/2026, 2:10:55 PM
Synthesis & Latest Updates
1 Sources Cross-Validated

Researchers used AI assistance to complete a formal proof of optimal packing for 11 squares in the Lean prover, verified across 7,920 modules. The work establishes an exact algebraic expression for the optimal side length but relies on `native_decide` for numerical certificates, extending the trust boundary to Lean's kernel and native compiler.

LATEST/Researchers used AI assistance to complete a formal proof of optimal packing for 11 squares in the Lean prover, verified across 7,920 modules. The work establishes an exact algebraic expression for the optimal side length but relies on `native_decide` for numerical certificates, extending the trust boundary to Lean's kernel and native compiler.

TIMELINECoverage timeline

Total 1 reports · Latest first
  1. Hacker News AIT2·68 pts

    AI-Assisted Formal Proof of Optimal 11-Square Packing

    Original: AI-assisted proof of optimal packing for 11 squares

    • AI-assisted Lean proof passed verification of 7,920 modules with zero rejections, solving the long-standing geometric optimization problem of packing 11 squares.
    • Provides an exact algebraic solution for the optimal side length (based on the unique root of an octic polynomial), surpassing previous approximate numerical results.
    • Key numerical checks use `native_decide`, meaning the final theorem's trust depends on Lean's kernel and native compiler, not pure logical kernel verification.