T-254: Couzo's new packing of 130 squares from PR #574's, 2.05e-3 below T-174

V3 C3 Upper bound confirmed superseded by T-259

2026-10-27 published · Couzo after Chaoweeraprasit, Gupta, PingYou Ltd, Levy · n=130

One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: s(130)≤466915711841738962256077475351530705109199164124122993/39228601764570445403995003040207131754000000000000000. It is 2.05e-3 below the case's house best packing, PingYou Ltd's certificate of Chaoweeraprasit's packing (T-174), and below every earlier report at 130.

The certificate and its 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 it again on a clean-room checker of its own, by separating axes and by exact clipped areas with ten controls, by a Claude agent, a system family the producer also used, and found no blocking defect, so the bound is confirmed, independently re-implemented.

Polkovskyi's issue 846 re-solves the same arrangement 2.08e-12 lower (T-259), and the case adopts that certificate under the house rule, with this packing's credit.

The issue says both of the source's exact checkers accept the certificate in exact rational arithmetic: 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 (valid and strictly valid, 1,624 candidate pairs), and exact_finish.py, an exact corner replay; both read the same certificate format. The source's commit of 27 October says the packing was read from a database salvaged after a host crash of 26 October and ends with a Co-Authored-By trailer naming Claude; 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 Couzo (https://github.com/franciscouzo/square-packing), after the packing his searches started from, PR #574's at 130: found by Chaoweeraprasit (itsnaka), improved by Gupta and PingYou Ltd, as the issue asks. The issue says thirteen successive improvements of his live searches of 24 and 25 October took the side from 11.904483032516 to this one, ten by the web app's fq quench (a browser adaptation of Daniel's fq optimizer), two by its basin hopping and one by native SLP, all on his own computers, and that matched one to one against PR #574's packing the largest move is 0.704, 11 squares move beyond 0.1 and 26 beyond 0.01, so it calls it a new packing found from #574's.

A Kaggle per-puzzle side the issue quotes, 11.902430646006 for the team Cats and boxes, states no packing and is no report.

Significance, composition and next rung
Significance
A new arrangement at 130 found from PR #574's packing, 2.05e-03 below the house (T-174), one to one with it under no symmetry, 11 squares beyond a tenth and one turned 44.7 degrees, as T-162's 2.02e-03 to 1.42e-02 (S3) are. 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. The review's questions for the author (refinement or new packing, the thirteen intermediate packings, the rotation sense) hold no rung. Issue 846's certificate of the same arrangement is 2.08e-12 lower (T-259), so the case adopted that certificate at 130 on 31 October 2026, with this packing's credit, and never this one.
Novelty
previously-published Present in an identified source

The case

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, Couzo 2026 [Mishapolk issue 846 2026-10-30]

n=130

11.4211.902
111213
11.40212.402
nn+1

Proven

11.42016≤s(130)≤11.902431

  • exact

Citation record n-130

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

upperCouzo & Mishapolk, GitHub (confirmed T-259)

Open

  • optimality

The case record

LowerUpper
Gap0.48226581…

Results on the case

12 results in the register on n=130, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007

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

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

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085

    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

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

    V3 C3 Upper bound confirmed superseded by T-259

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

  4. 2026-09-29 published T-083

    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-07 published T-113

    s(n)≤Sn at ten counts, n=108 to 303, from new SQUISH rational packings

    V3 C3 Upper bound confirmed superseded by T-259

    Chaoweeraprasit after Ellsworth · SQUISH ten packings 2026-10-07 · packet · register

  6. 2026-10-07 published T-129

    Three dated Daniel certificate reports with historical source custody

    V0 C0 Upper bound recorded superseded by T-259

    Daniel after Couzo, Levy · Daniel dated certificates 105 and 130 2026-10-07 · Daniel dated certificate 292 2026-10-07 · packet · packet · packet · register

  7. 2026-10-08 published T-125

    Complete rational construction reports at 25 counts

    V3 C3 Upper bound confirmed superseded by T-259

    Xu · ry-xu square packing 2026 · packet · register

  8. 2026-10-08 published T-127

    Fourteen rational refinements, seventeen complete source cases

    V3 C3 Upper bound confirmed on this case, superseded by T-259

    Gupta after Chaoweeraprasit, Daniel · Gupta rational refinements 2026-10-08 · packet · register

  9. 2026-10-13 published T-174

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

    V3 C3 Upper bound confirmed on this case, superseded by T-259

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

  10. 2026-10-13 published T-180

    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

  11. 2026-10-27 published T-254 this result

    Couzo's new packing of 130 squares from PR #574's, 2.05e-3 below T-174

    V3 C3 Upper bound confirmed superseded by T-259

    Couzo after Chaoweeraprasit, Gupta, PingYou Ltd, Levy · Couzo n130 2026-10-27 · packet · packet · register

  12. 2026-10-30 published T-259

    Polkovskyi's re-solve of Couzo's packing of 130 squares, 2.08e-12 below T-254

    V3 C3 Upper bound confirmed

    Polkovskyi after Couzo, Xu, Daniel, Ostashev, Levy · Mishapolk issue 846 2026-10-30 · packet · register