Skip to content

Releases

Lean proof of seventeen-square optimality

Choose a tag to compare

@ofitzharding ofitzharding released this 12 Oct 22:06

Complete Lean proof of optimality for packing seventeen unit squares in a square, with arbitrary rotations and boundary contact allowed.

The theorem Sq17.square17_optimality proves, for every real L:

PlainPacking L ↔ EndpointGeometry.side ≤ L

The endpoint is the exact algebraic side length of Bidwell's packing, approximately 4.675530093604551. The theorem includes existence at the endpoint and impossibility below it, with no remaining certificate-acceptance or case-exclusion premises.

A fresh Linux source rebuild passed with Lean 4.34.1: all 4,951 modules in the theorem's import closure, an exact match of the final axiom report, and both optional controls. Verification receipts and the full axiom report are committed under verification/.

Download all three source archives below into certificates/ and follow README.md. They contain Lean source, not precompiled proof objects; manifest.json records the archive and individual source hashes.

Finite certificate checks use native_decide. The explicit trust boundary includes the Lean compiler, native evaluator and C toolchain. The axiom report contains the three standard axioms and 13,343 native-check facts, with no sorryAx. This is not a kernel-only computation claim.

MIT license. Credits, related work and substantial Claude/Codex assistance are documented in the README.