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

V3 C3 Upper bound confirmed

2026-10-30 published · Polkovskyi after Couzo, Xu, Daniel, Ostashev, Levy · n=130

One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: s(130)≤11.902430645982265758612919640554, 2.08e-12 below Couzo's certificate of issue 843 (T-254), the same arrangement, and 2.05e-3 below the case's house best packing when it was reported, T-174.

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: both read the certificate through the evand-cert reader, whose line filter and corner construction are transcribed from Daniel's checkers, the family of the source's verify_bound_certificate.py. The 31 October review decided it again on a clean-room checker of its own, by separating axes and by exact clipped areas with seven mutants at contact and 1e-60 past it, and found no blocking defect, so the bound is confirmed, independently re-implemented. The issue does not say what its Antigravity Autonomous Research Lab is, so whether the reviewer's system family overlaps the producer's is not known.

The issue says the certificate is valid and strictly valid under verify_bound_certificate.py --strict, Daniel's MIT separating-axis verifier with Couzo's modifications, byte-identical to the copy the issue-678 packet retains, with least wall and pair clearances of 9.66e-15 and 1.82e-14. Its header calls it a dilation, by dilate_cert.py with delta 2e-14, of isolated_lab/tmp_couzo_noalm.txt, and the issue says it beats Couzo's issue 843 by 2.08e-12. Those statements are the author's; no source program ran here.

Credit Couzo's packing of issue 843, found from PR #574's, and Polkovskyi (Mishapolk, https://github.com/Mishapolk/square-packing-records), with what the issue calls the Antigravity Autonomous Research Lab, for the re-solve, as the register credits a regularization. Measured by the 31 October review, it has Couzo's contact structure within 1e-9, 304 near-contact pairs and 38 wall contacts each; Couzo's pair gaps of about 2.16e-13 become about 2e-14, about ten of them making the 2.08e-12, and 14 squares move beyond 1e-9, the largest by 1.13e-6 (RV-6). The issue's six other counts are T-260's and the eight it reports beyond them are not recorded (T-260 names them).

Significance, composition and next rung
Significance
A re-solve of Couzo's packing at 130 (T-254) at tighter padding, 2.08e-12 below it: the same contact structure, 14 squares moved by at most 1.13e-6, as T-170's padding (S1) is; the arrangement and its 2.05e-03 below T-174 are T-254's, scored S3 there. 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 130, and the case adopted it there on 31 October 2026 under the house rule, with the packing's credit Couzo's (T-254) and the re-solve Polkovskyi's, and both strong generators' regularization of the new house. The regularizer's solved view, 2.50e-13 below this side, waits for its own registration and review (think-ruu2). The review's questions for the author hold no rung.
Regularizations
n = 130: a regularization of T-254’s packing by Polkovskyi (a dilation by dilate_cert.py, delta 2e-14, of the source's isolated_lab/tmp_couzo_noalm.txt, as its header says, below the side of Couzo's certificate; solved to its side; identity: measured here; nearest centres one to one; 0 squares moved, at most 1.13e-06; turns up to 5.58e-05°).
Regularized drawings
n = 130: a regularization of T-259’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; 9 squares moved, at most 0.0271676; turns up to 1.84033°).
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

    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 this result

    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