Complete Lean proof of s(17) optimality: registration request

Open
#565 1 comment 0 reactions 0 assignees View on GitHub

Maintainers usually reply within 1 day

Nobody has claimed this yet.

Assessment

Difficulty
2/5
Estimated time
1-3 hours
Newbie friendliness
48/100
Issue type
Documentation
Clarity
Clearly specified
Activity status
Active
Domain
documentation

Research direction

Start by reading the n=17 case page and issue #405, then verify the supplied Lean repository and pinned v1.0.0 release links. Register the result under Oscar Fitzharding and link the proof from the case page and #405; done when both references are present and accurate.

Written by the indexing model from the issue text.

Description

blocked:owner-reply intake n-17

I've released the first complete Lean proof of global optimality for Bidwell's 17-unit-square packing, addressing the target in #405.

Credit: Oscar Fitzharding (@ofitzharding).

Claim: For every real container side L,

PlainPacking L ↔ EndpointGeometry.side ≤ L

This allows arbitrary rotations and boundary contact and proves both existence at the exact algebraic endpoint (approximately 4.675530093604551) and impossibility below it. No certificate-acceptance or case-exclusion hypotheses remain.

Source: Repository, v1.0.0 certificate sources, pinned commit 0a7167efa8dcae7fa73855890630fb7e2de550ed. MIT licensed.

Verification: A fresh Linux source rebuild passed for all 4,951 modules, with Lean 4.34.1, an exact match of the final axiom report, and two positive controls. Receipts and full axiom report; reproduction commands are in the README.

Trust and review scope: Geometric soundness is proved in Lean. Finite checks use native_decide: three standard axioms plus 13,343 native-check facts, no sorryAx; the compiler/native evaluator and C toolchain are trusted. The local and Linux builds use the same proof/checker sources. External independent reproduction and expert review are still welcome.

Lineage and assistance: John Bidwell supplied the 1998 construction. The s(11) proof and Lean formalization were useful methodological references for finite exclusion, capture and the local endpoint argument. Thanks also to the Squares Project's contributors and the Lean/Mathlib communities. Development used Claude and Codex assistance.

Related work: Marc Overbeck also published a candidate proof of s(17) optimality today (12 October 2026), using Python and JavaScript certificate checkers. This proof was developed independently, takes a different computational route, and formalizes the geometric arguments, checker soundness, and final optimality theorem in Lean.

Please register the result under my name and link the proof from the n=17 case page and #405. I'm happy to help with reproduction and statement review.

Dominant language
Python
Stars
54
Forks
6
Avg merge
9h 11m
Merged PRs (30d)
239

Getting set up

  • No Dockerfile or Docker Compose file
  • Has a pull request template
  • No contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from jlevy/squares

All issues in jlevy/squares

Similar issues

More Python issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.