← Thursday, October 8, 2026ResearchPaper

Lean verifies an optimal packing of 11 squares with no admissions

github.com Editor score 8/10

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.

What

Lean verifies the optimal packing of 11 squares with arbitrary orientations, legal boundary contact, and disjoint open interiors.

Method

All 7,920 local Lean modules passed; the audit found zero admissions, with selected exact numerical checks using native_decide.

Why it matters

Engineers can inspect a formal optimality result while accounting for its stated trust in Lean's kernel and native compiler.

Read on github.com → Hacker News · 53 comments

Headline, summary, brief and diagram are written by a model from the source's own text; the link, byline and numbers come from the source. Read the original before relying on a claim.