T-251: Hosono reports a Lean kernel proof of Daniel's ValidTilt9, so s(k2−4)=k for every k≥8

V0 C0 Formalization recorded

2026-10-16 published · Hosono after Daniel, Levy, Burns, Massaccesi · 11 cases, n=60 to 320

Hosono (wand125) reports a Lean 4 kernel proof of Daniel's finite premise ValidTilt9, and with Daniel's reduction a proof that s(k^2 - 4) = k for every integer k >= 8: a formalization of T-081 at k >= 8, which this record holds as reported, on two reported runs of ValidTilt9 and a build here of the reduction. Its theorems, in namespace SquarePacking.LemmaELeaf of the generated Sqpack/V9/Main.lean, are validTilt9 : Bentz4.ValidTilt9, valid9 : Bentz4.Valid9 and bentz4 : ∀ k : ℕ, 8 ≤ k → minSide (k ^ 2 - 4) = k.

This entry's scope is that theorem's projection onto the cases this record holds, k = 8 to 18: s(60)=8, s(77)=9, s(96)=10, s(117)=11, s(140)=12, s(165)=13, s(192)=14, s(221)=15, s(252)=16, s(285)=17 and s(320)=18.

The proof checks Daniel's k2m4 certificate qxzm_full on the box cover K4_k008_box9.txt, 16,200 per-root certificates in the release validtilt9-lean-v1, as 1,275,911 generated Lean files the repository lists by digest and does not store, with Bridge.lean identifying the cover with Bentz4.box9Cover and Tilt.lean deriving ValidTilt9 from the tree. The source's receipts report the axioms propext, Classical.choice and Quot.sound, no sorry and no native_decide, about 7,390 CPU-hours of kernel checks and Main.lean's assembly at 230 GB resident. Nothing here has built it.

Every definition the theorems' statements use is the record's own: the 16 modules and 3 build files of the closure the evand-square-packing-2026-10-03 packet retains, among them S32.lean (minSide), ValidSplit9.lean and Bentz4.lean, match the digests of the source's library list, the files of the record's 3 October build of the reduction.

Hosono after Daniel, square-packing, 16 October 2026. The commits name Claude as co-author.

Significance, composition and next rung
Significance
A machine-checked proof, by another author, of the finite premise of a bound family the record holds only as reported: with it s(k^2 - 4) = k for every k >= 8 is in Lean, unconditional, and once built it would settle the family's open cases k = 10 to 18. A machine audit, S3, below T-081's S4 because it proves no new bound; the 16 October triage drafted S4 on the open cases, which the review may take.
Composition
One cited entry, the source's report (E-k2m4-wand125-validtilt9-lean-report), which claims the exact values in Lean at k >= 8, the grid inside the reduction. T-081's runs and its reduction build are not cited: they are T-081's evidence. No build is retained here, so V0; no review has read it, so C0.
Next rung
C1 needs the stage 4 mathematical review of validTilt9, Bridge.lean, Tilt.lean, the changed LemmaEKM.lean and RowMinN.lean, read from the retained packet. V3 and C3 need a complete build here or by a third party retained here (think-rw3i): about 7,400 CPU-hours and 230 GB for Main.lean by the source's receipts, held above the owner's 40 CPU-hour item cap and this host. Rung 5 needs a human expert's review of the formalization beside it.
Unfinished confirmations
C1 (think-jh0n): the stage 4 mathematical review of validTilt9, valid9 and bentz4, Bridge.lean, Tilt.lean, RowMinN.lean and LemmaEKM.diff, read from the retained packet. Not priced.

C3 (think-rw3i): a complete build of the 1,275,911 generated modules from v9-certs.tar.zst, checked against SOURCES.sha256, Main.lean and Axioms9.lean, with the axiom receipt, here or by a third party whose build is retained here. About 7390 CPU-hours, up to about 7567 (priced 2026-10-26).
Novelty
previously-published Present in an identified source

The cases

This result concerns 11 cases, too many to draw one by one. Each is listed with the film’s bounds, the proved lower bound and the best known side, and links to its case record, where its packing and number line are drawn.

nProved lowerBest knownGapStatusRecords
60880provedO=frontier n-060.md
7799frontier n-077.md
961010frontier n-096.md
11710.856157110.14384241…open=frontier n-117.md
14011.868817120.13118299…frontier n-140.md
16512.879418130.12058159…frontier n-165.md
19213.888427140.11157216…frontier n-192.md
22114.896180150.10381995…frontier n-221.md
25215.902921160.09707819…frontier n-252.md
28516.908839170.09116091…frontier n-285.md
32017.914074180.08592523…frontier n-320.md

Results on these cases

18 results in the register on these cases, oldest first
  1. 2005 published T-007 · 11 of these cases

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

    Lower bound incomplete on these cases, superseded by T-062, T-067, T-081 (reported), T-083 and T-191

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085 · 11 of these cases

    Nagamochi 2005, Lemma 1 is false for every container with a>3 and b>2

    Correction confirmed

    Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  3. 2026-09-27 published T-045 · case 77

    Rectangle-density lower bounds replayed at 15 counts in n=18…78

    Lower bound confirmed superseded by T-067

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026 · packet · packet · source · review · register

  4. 2026-09-27 published T-046 · cases 60, 77

    Rectangle-density lower bounds verified at 48 counts in n=18…95

    Lower bound confirmed superseded by T-062 and T-067

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026 · wand125 rectangle bounds 2026-09-28 · packet · packet · source · review · register

  5. 2026-09-28 published T-062 · case 60

    s(60)=8, by a mixed cover of points and grid-line segments

    Optimality confirmed

    Daniel after Burns, Massaccesi · evand square-packing 2026-10-01 · packet · source · review · register

  6. 2026-09-28 published T-070 · case 60

    Rectangle-density lower bounds replayed at 25 counts in n=29…95

    Lower bound confirmed superseded by T-062

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-09-28 · packet · packet · source · review · register

  7. 2026-09-29 published T-058 · cases 60, 77, 96

    Rectangle-certificate ceiling α·UB(n) proved for n=1..100; B·UB(n) on 64 grid rows

    Method limit confirmed

    Hosono after Tokoharu, Daniel · wand125 tools 2026 · packet · register

  8. 2026-09-29 published T-083 · 11 of these cases

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

    Lower bound confirmed

    Karakuş · Karakuş 2026 · source · register

  9. 2026-10-01 published T-067 · case 77

    s(77)=9, by a mixed cover extended from Daniel's s(60) cover

    Optimality confirmed

    Hosono after Daniel, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 exact covers 2026-10-01 · packet · source · review · register

  10. 2026-10-02 published T-075 · case 96

    Mixed rectangle-measure lower bounds replayed at nine counts in n=83…96

    Lower bound confirmed on these cases, superseded by T-081 (reported) and T-191

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 mixed bounds afternoon 2026-10-02 · packet · source 1 · source 2 · review · register

  11. 2026-10-03 published T-081 · 11 of these cases

    s(k2−4)=k for every integer k from 5 up; k=5…18 are the cases held here

    Optimality reviewed

    Daniel after Burns, Massaccesi · evand square-packing 2026-10-03 · packet · packet · source · review · register

  12. 2026-10-03 published T-082 · case 96

    Mixed rectangle-measure lower bounds verified at 22 counts in n=51…96

    Lower bound confirmed on these cases, superseded by T-081 (reported) and T-191

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 mixed bounds 2026-10-03 · packet · packet · source · review · register

  13. 2026-10-04 published T-090 · case 96

    Mixed rectangle-measure lower bounds verified at 17 counts in n=42…96

    Lower bound confirmed on these cases, superseded by T-081 (reported) and T-191

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 mixed bounds 2026-10-04 · packet · source · review · register

  14. 2026-10-07 published T-124 · 11 of these cases

    Reported non-strict local minima for 178 source configurations

    Restricted optimality recorded

    Daniel after Couzo · Daniel exact and local reports 2026 · packet · register

  15. 2026-10-12 published T-261 · 11 of these cases

    Reported grade-C local minima for 233 source configurations of field degree at most 4

    Restricted optimality incomplete

    Daniel after Schadt, Ellsworth, Levy · Daniel exact and local reports 2026-10-12 · packet · packet · register

  16. 2026-10-13 published T-180 · 11 of these cases

    Closed-form lower bound s(N)≥a(N) for every non-square N≥49, reported

    Lower bound reviewed on these cases, superseded by T-062, T-067, T-081 (reported), T-083 and T-191

    Hosono · wand125 closed form 2026-10-14 · packet · packet · register

  17. 2026-10-15 published T-191 · case 96

    s(95)=10, by a mixed cover of points and grid-line segments

    Optimality confirmed

    Greff after Daniel, Hosono · bengreff s95 certificate 2026-10-15 · packet · source · review · register

  18. 2026-10-16 published T-251 this result · 11 of these cases

    Hosono reports a Lean kernel proof of Daniel's ValidTilt9, so s(k2−4)=k for every k≥8

    Formalization recorded

    Hosono after Daniel, Levy, Burns, Massaccesi · wand125 ValidTilt9 Lean 2026-10-16 · packet · source · register