T-159: Another arrangement of Xu's design for 102 squares, certified exactly from its decimal layout

V3 C3 Upper bound confirmed superseded by T-146

2026-10-11 published · Calle after Xu, Levy · n=102

An exact rational certificate derived here from Calle's decimal layout of 102 unit squares, reported on jlevy/squares#529, proves a finite upper bound at the side the layout prints: s(102)≤10.605828696455852.

The source's file is a layout, not a certificate: each centre and each rotation in radians is printed to 18 significant digits, and a rotation printed in radians has no rational cosine and sine. The certificate is this repository's: the printed side with no dilation, every centre as printed, and each half-angle tangent rounded down at 40 places, which turns a square by less than 2e-40 radians against margins of 2e-12.

The author reports that a 60-digit decimal separating-axis check of his own, run once here from scratch and reproducing its two gaps, finds least gaps of 1.9e-12 between squares and 2.0e-12 to the walls, and that his search engine's exact rational-interval certificate accepts the layout; the engine is not public and that certificate cannot be rerun.

All three retained jobs, the positive with its duplicate-square and outside-container controls, were decided again here on 12 October 2026 by both maintained exact routes and equal their retained rows. A third exact route, half-extent containment and exact intersection area, decided the certificate with six controls and derived it again from the layout fetched at the pin with its own reader and arithmetic, square for square. The certificate is the project's derivation and no route is the source's code, so the replay is independently re-implemented. The 12 October review found no blocking defect.

The side is above the certificate the case holds, Daniel's regularization of Xu's packing (T-146), by 2.43e-11, and below Xu's own certificate (T-125), the case's ceiling until 11 October 2026 and the one the issue compares with, by 5.48e-11, the issue's figure; so it moves no case, the house at 102 is unchanged, and the entry is superseded by T-146 from the day it was registered.

Credit Calle (https://github.com/riocalle/my-repo, University of New Hampshire) with this arrangement and its layout, found by his own search engine from scratch, and Xu (T-125) with finding the design and width first, as the issue asks: Xu published on 8 October 2026 and the author's search finished its first packing of the design about ten hours later. Measured pose by pose, every square pairs with one of Xu's under a half turn of the box, 40 within 1e-9 and none turned, and 62 moved, 19 of them beyond a tenth of a unit and the largest by 0.494, 11 turned by up to about 43 degrees: another arrangement of the design, not a refinement or a regularization of Xu's packing.

The issue and README state AI assistance: the author designed and directed the project and its experiments, and Claude wrote and ran the code, the GPU search, the exact finishing step, the refinement search and both checkers.

Significance, composition and next rung
Significance
A certified side at n=102, 2.43e-11 above the case's ceiling (T-146) and 5.48e-11 below Xu's certificate (T-125), of another arrangement of Xu's design: a citable detail of the case that moves no bound and no theorem, S2 as T-120, T-137 and T-150 are; no lower bound or optimum.
Next rung
V4 and C4 need a second accepted adversarial review by a distinct reviewer and a retained human oversight record; one AI review, of 12 October, is retained.
Novelty
previously-published Present in an identified source

The case

Case record

n=102

10.2810.606
101112
10.10011.100
nn+1

Proven

10.28000≤s(102)≤10.605829

  • exact

Citation record n-102

lowerHosono after Tokoharu, Levy et al. 2026 (confirmed T-073, T-080)

upperXu & Daniel, GitHub (confirmed T-146)

Open

  • optimality

The case record

LowerUpper
Gap0.32582869…

Results on the case

14 results in the register on n=102, 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-073 and T-080

    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-146

    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 on this case, superseded by T-073 and T-080

    Karakuş · Karakuş 2026 · source · register

  5. 2026-10-02 published T-073

    Linear-measure lower bounds replayed at n=83 and n=101…105

    V3 C3 Lower bound confirmed

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 linear certificates 2026-10-02 · packet · source · review · register

  6. 2026-10-02 published T-080

    Linear-measure lower bound replayed at n=101…105

    V3 C3 Lower bound confirmed

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 linear certificates 2026-10-02 · packet · source · review · register

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

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

  8. 2026-10-07 published T-120

    Reported s(102) ≤ alpha_102 with a degree-8 exact side form

    V0 C0 Upper bound recorded superseded by T-146

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

  9. 2026-10-08 published T-125

    Complete rational construction reports at 25 counts

    V3 C3 Upper bound confirmed superseded by T-146

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

  10. 2026-10-10 published T-146

    Exact rational certificates at fifteen counts from Daniel's regularized record lists

    V3 C3 Upper bound confirmed

    Daniel after Xu, Chaoweeraprasit, Polkovskyi, Levy · Daniel regularized lists 2026-10-10 · packet · register

  11. 2026-10-11 published T-159 this result

    Another arrangement of Xu's design for 102 squares, certified exactly from its decimal layout

    V3 C3 Upper bound confirmed superseded by T-146

    Calle after Xu, Levy · Calle n102 2026-10-12 · packet · register

  12. 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-146

    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

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

    V0 C1 Lower bound reviewed on this case, superseded by T-073 and T-080

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

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