T-256: Couzo's packings from Kaggle notebook packings at 232, 260 and 307, below T-186, T-225 and T-174

V3 C3 Upper bound confirmed

2026-10-28 published · Couzo after Chilton, ntumlnoob, Lavrentev, Ellsworth, Daniel, Levy · n=232,260,307

Three complete rational source certificates report finite upper-bound improvements at the exact sides they state: s(232)≤7617348902520572307222120733/483283363059000000000000000, s(260)≤104381051573626493618357957479/6274019722347000000000000000 and s(307)≤2707897969116659515550794271467451840032974544063449693/150612387934832692306604131393579915999000000000000000. They are 2.51e-3, 8.72e-3 and 1.61e-3 below the houses, T-186 at 232, T-225 at 260 and T-174 at 307, and at 260 and 307 below the author's certificates of 28 October (T-255).

The three certificates and their duplicate-square and outside-container controls were decided here on 31 October 2026 by both maintained exact routes. Those routes share components with the producer: the sqpack route decides through sqpack/verify.py, the checker the source's manifest names first, and both read the certificates through the evand-cert reader. The 31 October review decided them again on a clean-room checker of its own, by separating axes and by exact clipped areas with ten controls each, by a Claude agent, a system family the producer also used, and found no blocking defect, so the bounds are confirmed, independently re-implemented. At 260 issue 845's certificate is 3.05e-3 lower (T-257) and is the house; this one is recorded only there.

The issue says both of the source's exact checkers accept all three certificates in exact rational arithmetic, valid and strictly valid with positive wall and pair margins: verify_bound_certificate.py, Daniel's MIT separating-axis verifier with modifications by Couzo with Codex, byte-identical to the copy the issue-678 packet retains, and exact_finish.py, an exact corner replay. The source's commit of 28 October ends with a Co-Authored-By trailer naming Claude, and the issue says Claude did the certification, the comparison and the report at the author's direction. Those statements are the author's; no source program ran here.

Credit the starting packings to their Kaggle authors, as the issue does: at 232 Alex Chilton's notebook 'Fault-line DP + Basin Hopping - LB 22.2990' (run 362691257, side 15.763381419802), and at 260 and 307 ntumlnoob's notebook 'First 22.268681355 Public Code With Explanation' (version 3, run 362957087, sides 16.638533455862 and 17.979253973651), whose SOURCE_NOTICES.md credits Alex Chilton, Ellsworth, Daniel and public Kaggle portfolios.

Couzo (https://github.com/franciscouzo/square-packing) is credited with the refinements at 232 and 307 and, at 260, with a new arrangement found from ntumlnoob's packing, through his refinement of it of 28 October (T-255): 1.72e-3, 1.50e-3 and 2.7e-6 of the improvements, by code the issue names: at 232 GPU basin hopping with the overlap-energy kernel of Lavrentev's (lightningv08) Kaggle notebook 'CUDA Packing Search' (Apache-2.0) and an Daniel fq polish; at 260 an Ellsworth-style structural move modelled on Ellsworth's tools, the author's SLP (HiGHS) and the web app's fq; at 307 the web app's fq, a browser adaptation of Daniel's fq optimizer (MIT). The issue calls 307 a refinement and leaves 232 and 260 to the record.

Measured by the 31 October review, at 260 the source's own lineage starts from his certificate of 28 October (T-255), and one Ellsworth-style structural move and about 200 SLP steps move 170 squares beyond 0.1 of it with no symmetry pairing the two, so the record calls 260 a new arrangement found from ntumlnoob's packing (F-3); at 232 the starting packing is not published and the record keeps the source's word; at 307 the packing is that of 28 October mirrored and refined. Kaggle per-puzzle sides the issue quotes below all three state no packing and are no report.

Significance, composition and next rung
Significance
New arrangements relative to the record at 232 and 260, 2.51e-03 and 8.72e-03 below the houses (T-186, T-225), one to one with no recorded packing under any symmetry, as T-162's (S3) are. At 307, the author's packing of 28 October (T-255) refined by 4.56e-12. No lower bound or optimum.
Next rung
None for the bound. V4 and C4 need a second accepted adversarial review by a distinct reviewer and a retained human oversight record; one AI review, of 31 October, is retained. It is the smallest validated side at 232 and 307, and the case adopted it there on 31 October 2026 under the house rule, with both strong generators' regularization of each new house; at 260 issue 845's certificate (T-257) is lower and was adopted instead. The regularizer's solved view at 307, below this side, waits for its own registration and review (think-ruu2). The review's questions for the author (260 as a new arrangement, the starting packings, the rotation sense) hold no rung.
Regularized drawings
n = 232: a regularization of T-256’s packing by Levy (regularize_grid_slack/2: Daniel's coincidence placement (evand/square-packing search/regularize reg.coincidences and reg.place, MIT), ported to start from the witness's exact frame, over its number field where it has one, and to keep its contacts, then the same-side exact re-solve, through devtools.regularize_grid_slack; the project’s modifications: port of his coincidence placement (regularize_grid_slack/2) rather than his code, same-side exact re-solve (devtools.regularize_same_side); at its own side; identity: measured here; nearest centres one to one; 37 squares moved, at most 0.0549979; turns up to 0.869803°).

n = 307: a regularization of T-256’s packing by Levy (regularize_axis_components/2; at its own side; identity: measured here; nearest centres one to one; 17 squares moved, at most 0.200471; no square turned).
Novelty
previously-published Present in an identified source

The cases

Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, in its source’s pose, Alex Chilton 2026 [Couzo issue 844 2026-10-28]

n=232

15.2315.762
151617
15.23216.232
nn+1

Proven

15.23940≤s(232)≤15.761662

  • exact

Citation record n-232

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperChilton & Couzo, GitHub (confirmed T-256)

Open

  • optimality

The case record

LowerUpper
Gap0.52225878…
Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, in its source’s pose, Daniel 2026 [Daniel issue 845 2026-10-29]

n=260

16.1216.634
161718
16.12517.125
nn+1

Proven

16.12849≤s(260)≤16.633983

  • exact

Citation record n-260

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperDaniel 2026, GitHub (confirmed T-257)

Open

  • optimality

The case record

Case record
Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, in its source’s pose, ntumlnoob 2026 [Couzo issue 844 2026-10-28]

n=307

17.5317.979
171819
17.52118.521
nn+1

Proven

17.53672≤s(307)≤17.979252

  • exact

Citation record n-307

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperntumlnoob & Couzo, GitHub (confirmed T-256)

Open

  • optimality

The case record

LowerUpper
Gap0.44252624…

Results on these cases

22 results in the register on n=232,260,307, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007 · n=232,260,307

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

    V0 C1 Lower bound incomplete on these cases, superseded by T-083 and T-180 (reported)

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085 · n=232,260,307

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

    V3 C3 Correction confirmed

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

  3. 2026-09-27 published T-056 · n=307

    Smaller packings for 49 counts from n=68 to 307, each certified two independent ways

    V3 C3 Upper bound confirmed superseded by T-256

    Couzo · franciscouzo square-packing 2026-09-27 · packet · register

  4. 2026-09-29 published T-083 · n=232,260,307

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

    V3 C3 Lower bound confirmed

    Karakuş · Karakuş 2026 · source · register

  5. 2026-10-05 published T-098 · n=307

    Exact optima of 48 known-best packings: s(n) ≤ S', 3.5e-13 to 5.0e-11 below each printed side

    V3 C3 Upper bound confirmed on these cases, superseded by T-256

    Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register

  6. 2026-10-05 published T-101 · n=232,260

    Exact certificates of 77 catalogue packings: s(n) ≤ S', 1.2e-16 to 9.8e-15 above each side

    V3 C3 Upper bound confirmed on these cases, superseded by T-256 and T-257

    Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register

  7. 2026-10-09 published T-136 · n=232,307

    Seventeen exact rational packings from SQUISH's third request

    V3 C3 Upper bound confirmed superseded by T-256

    Chaoweeraprasit after Couzo, Xu, Göbel, Schadt, Ellsworth, Hajba, Levy · SQUISH third request 2026-10-09 · packet · register

  8. 2026-10-12 established T-155 · n=260

    Exact regularized sides at 59 counts, 5.4e-20 to 9.9e-15 below the ceilings they replace

    V3 C3 Upper bound confirmed on these cases, superseded by T-257

    Levy after Daniel · register

  9. 2026-10-12 published T-158 · n=232

    New packings of 175, 232 and 264 squares built on a new 38-square rectangle, each certified exactly

    V3 C3 Upper bound confirmed superseded by T-256

    Ostashev after Nakajima, Ellsworth, Schadt, Friedman, de Winter, Daniel, Levy, Xu · Ostashev records 2026-10-12 · packet · register

  10. 2026-10-12 published T-163 · n=307

    s(n² − n + 1) < n for every n ≥ 15, and n² − n + F(n) squares below side n, from Fang

    V3 C1 Upper bound reviewed superseded by T-256

    Fang after Arslanov, Mustafin, Shangitbayev, Ellsworth, Stead, de Winter, Daniel, Couzo · Fang excess theorem 2026-10-13 · packet · packet · packet · source 1 · source 2 · register

  11. 2026-10-12 published T-261 · n=232,260

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

    V3 C1 Restricted optimality incomplete

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

  12. 2026-10-13 published T-174 · n=232,307

    Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own

    V3 C3 Upper bound confirmed on these cases, superseded by T-256

    PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · PingYou PR 574 certificates 2026-10-13 · packet · register

  13. 2026-10-13 published T-180 · n=232,260,307

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

    V0 C1 Lower bound reviewed

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

  14. 2026-10-14 published T-186 · n=232

    Exact certificates at twelve counts from Polkovskyi, tightening the smallest reported there

    V3 C3 Upper bound confirmed on these cases, superseded by T-256

    Polkovskyi after Ostashev, Couzo, PingYou Ltd, Levy · Mishapolk KKT refinements 2026-10-14 · packet · register

  15. 2026-10-16 published T-193 · n=232

    Exact algebraic sides at sixteen counts from Daniel, of packings the record credits

    V3 C3 Upper bound confirmed on these cases, superseded by T-256

    Daniel after Xu, Chaoweeraprasit, Ostashev, Couzo, PingYou Ltd, Gupta, Polkovskyi, Levy · Daniel exact current records 2026-10-16 · packet · register

  16. 2026-10-17 published T-196 · n=260

    de Winter reports three smaller rational upper bounds at 227, 229 and 260

    V3 C3 Upper bound confirmed superseded by T-257

    de Winter after Levy · de Winter upper bounds 2026-10-17 · packet · register

  17. 2026-10-18 published T-223 · n=260

    Couzo's smaller packings at 204 and 260, the two in the corpus of issue 678's 85 bounds

    V3 C3 Upper bound confirmed superseded by T-257

    Couzo after de Winter, Polkovskyi, Ostashev, Daniel, Fang, PingYou Ltd, Levy · Couzo issue 678 2026-10-18 · packet · register

  18. 2026-10-18 published T-236 · n=307

    Daniel reports Lean proofs of Fang's Theorems 1 and 2, s(n2−n+1)<n for n≥15

    V0 C0 Formalization recorded

    Daniel after Fang, Arslanov, Mustafin, Shangitbayev, Levy · Daniel Fang and Ryu Lean 2026-10-18 · packet · source · register

  19. 2026-10-20 published T-225 · n=260

    Daniel's solved, regularized views at 204, 227, 229 and 260, each the smallest side reported there

    V3 C3 Upper bound confirmed on these cases, superseded by T-257

    Daniel after Couzo, de Winter, Polkovskyi, Ostashev, PingYou Ltd, Levy · Daniel regularized lists 2026-10-20 · packet · register

  20. 2026-10-28 published T-255 · n=260,307

    Couzo's certificates of ntumlnoob's Kaggle packings at 260 and 307, below T-225 and T-174

    V3 C3 Upper bound confirmed superseded by T-256 and T-257

    Couzo after ntumlnoob, Daniel, Levy · Couzo a5a5d76 2026-10-28 · packet · packet · register

  21. 2026-10-28 published T-256 this result · n=232,260,307

    Couzo's packings from Kaggle notebook packings at 232, 260 and 307, below T-186, T-225 and T-174

    V3 C3 Upper bound confirmed

    Couzo after Chilton, ntumlnoob, Lavrentev, Ellsworth, Daniel, Levy · Couzo issue 844 2026-10-28 · packet · register

  22. 2026-10-29 published T-257 · n=260

    Daniel's new packings of 172, 204, 260 and 293 squares, 1.64e-4 to 1.18e-2 below each house

    V3 C3 Upper bound confirmed

    Daniel after Chaoweeraprasit, Gupta, Ostashev, kirilltym, Friedman · Daniel issue 845 2026-10-29 · packet · register