Research Paper
Lean verifies an optimal packing of 11 squares with no admissions
The verification run accepted 7,920 Lean modules and reports zero admissions; selected exact numerical checks use native_decide, so the claim is not kernel-only. The proof and explicit trust boundary make this a concrete reference for formal verification workflows.
- WhatLean verifies the optimal packing of 11 squares with arbitrary orientations, legal boundary contact, and disjoint open interiors.
- MethodAll 7,920 local Lean modules passed; the audit found zero admissions, with selected exact numerical checks using native_decide.
- Why it mattersEngineers can inspect a formal optimality result while accounting for its stated trust in Lean's kernel and native compiler.