T-139: A more precise certificate of Xu's 126-square arrangement, from Daniel

V3 C3 Upper bound confirmed

2026-10-09 published · Daniel after Xu, Chaoweeraprasit · n=126

One complete rational source certificate by Daniel, published in his repository and reported by no issue, proves a finite upper bound at the exact side it states: s(126)≤11.742640687119285146522492579501.

The certificate gives a rational side and, for each unit square, a rational centre and the tangent of its half-angle, in Daniel's format. It certifies Xu's arrangement as Daniel reconstructed it from a picture and polished it: 58 of its 126 squares sit where Xu's certificate (T-125) puts them and 68 are displaced by up to 0.06, so it is a more precise certificate of the same arrangement, not T-125's poses refined in place. The source reports that its two exact checkers accept it and that its exactsolve finds the packing a local minimum at 15/2 + 3 sqrt 2, strict modulo exact flat motions; the certificate's side is 1.17e-19 above that closed form, which nothing here certifies.

All three retained jobs, the positive with its duplicate-square and outside-container controls, were decided again here on 10 October 2026 by both maintained exact routes and equal their retained rows, and a third exact route, half-extent containment and exact intersection area, decided the certificate with six controls. No route here is the source's code, so the replay is independently re-implemented. The 10 October review found no blocking defect.

The side is 9.25e-11 below the ceiling the case held, Xu's certificate (T-125). On 11 October 2026 the case record adopted it as the house, crediting Xu's arrangement and Daniel's reconstruction.

Credit Xu (ry-xu, https://github.com/ry-xu/square_packing, issue 432) with the arrangement, and Daniel (https://github.com/evand/square-packing) with its reconstruction from a picture and the rational certificate. The same commit reconstructs two packings of Chaoweeraprasit's SQUISH, phases 14 and 10, at larger sides. The source says the packings are other people's and makes no claim; the commit names Claude Opus 5.5 as co-author.

Significance, composition and next rung
Significance
A smaller finite construction side at n=126, 9.25e-11 below the case ceiling, a more precise certificate of the same arrangement; no lower bound or optimum.
Next rung
V4 and C4 need a retained human oversight record: two accepted adversarial reviews by distinct AI reviewers are retained, the 10 October review and the 11 October final review (docs/project/reviews/review-2026-10-11-final-upper-bounds.md). The source's local minimum at 15/2 + 3 sqrt 2 would need an interval enclosure of its exactsolve point, which bears on the packing and not on the bound.
Regularized drawings
n = 126: a regularization of T-139’s packing by Levy (Daniel's search/regularize (MIT), evand/square-packing@675a5ea, conservative, coincide, through devtools.regularize_evand; the project’s modifications: same-side exact re-solve (devtools.regularize_same_side); at its own side; 10 free squares straightened, 3 free angles moved; identity: measured here; nearest centres one to one; 59 squares moved, at most 0.190334; turns up to 28.4472°).
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, Xu 2026 [Daniel trio126 2026-10-09]

n=126

11.2311.743
111213
11.22512.225
nn+1

Proven

11.23545≤s(126)≤11.742641

  • exact

Citation record n-126

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

upperXu & Daniel, GitHub (confirmed T-139)

Open

  • optimality

The case record

LowerUpper
Gap0.50718541…

Results on the case

12 results in the register on n=126, 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-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

  4. 2026-10-05 published T-098

    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 this case, superseded by T-139

    Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · 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-139

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

  6. 2026-10-07 published T-115

    s(n)≤Sn at twelve counts, from the SQUISH update’s new and smaller rational packings

    V3 C3 Upper bound confirmed superseded by T-139

    Chaoweeraprasit after Couzo and Ellsworth · SQUISH update 2026-10-07 · packet · register

  7. 2026-10-08 published T-125

    Complete rational construction reports at 25 counts

    V3 C3 Upper bound confirmed superseded by T-139

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

  8. 2026-10-09 published T-139 this result

    A more precise certificate of Xu's 126-square arrangement, from Daniel

    V3 C3 Upper bound confirmed

    Daniel after Xu, Chaoweeraprasit · Daniel trio126 2026-10-09 · packet · register

  9. 2026-10-10 published T-144

    Linear-measure lower bound s(n)≥563/50=11.26 for n=122…126, reported

    V0 C0 Lower bound recorded on this case, superseded by T-180 (reported)

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 linear n122 2026-10-10 · packet · register

  10. 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-139

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

  11. 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

  12. 2026-10-16 published T-193

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

    V3 C3 Upper bound confirmed

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