T-166: A tighter rational realization of PingYou Ltd's packing of 153 squares

V3 C3 Upper bound confirmed superseded by T-173

2026-10-12 published · PingYou Ltd after Xu, Daniel, Levy · n=153

One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: s(153)≤12.870013850407034002770080892.

All three retained jobs, the positive with its duplicate-square and outside-container controls, were decided again here on 14 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 each and held the derived fact to the pinned file it is derived from, fetched at the pin. No route here is the source's code; the source's runs of this repository's two maintained routes on its corners witnesses are its own and decide nothing here, so the replay is independently re-implemented. The 14 October review found no blocking defect.

The author reports that three exact checkers, its own rational polygon-projection checker and Daniel's unchanged verify_cert.py and verify_cert2.py, accept all 153 squares, 612 wall conditions and 11,628 pairs; that its package replays the recorded rational construction and checks the lossless conversion to its corners Witness/v2; and that this repository's sqpack exact_verify and check_rational_witness_independent, run unchanged, accept that witness. Those statements are the author's; no source program ran here.

Credit PingYou Ltd (https://github.com/BuddenPing/square-packing-certificates) with the n153 construction and this refinement of its certificate, as the source asks; by the source's account the construction starts from Xu's n70 construction (ry-xu, issue 432), taken from Daniel's exact n70 certificate, its contacts reclosed at a new angle. The source names SQUISH's n153 (issue 481) only as its earlier comparison. The pinned source makes no statement about AI assistance; the author's statement on issue 503 of 12 October, 'Both solutions were AI assisted by "PY", an unreleased agentic AI offering by PingYou Ltd.', covers the n153 construction.

Measured pose by pose by that review, it is PingYou Ltd's T-148 packing with two squares moved, by at most 0.090. At 153 Polkovskyi's issue 573 (T-173) is smaller and has held the case since 15 October 2026.

Significance, composition and next rung
Significance
The same packing at less padding, 1.00e-14 below the case ceiling, as T-155; 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 14 October, is retained.
Regularizations
n = 153: a regularization of T-148’s packing by PingYou Ltd (tighter rational realization of the source's own packing at a smaller padding; solved to its side; identity: measured here; nearest centres one to one; 2 squares moved, at most 0.08979; no square turned).
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, PingYou Ltd 2026 [Mishapolk exact certificates 2026-10-12]

n=153

12.3812.870
121314
12.36913.369
nn+1

Proven

12.38486≤s(153)≤12.870014

  • exact

Citation record n-153

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

upperPingYou Ltd & Mishapolk, GitHub (confirmed T-173)

Open

  • optimality

The case record

LowerUpper
Gap0.48514952…

Results on the case

14 results in the register on n=153, 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-101

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

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

  5. 2026-10-07 published T-114

    s(153)≤7250614903299225/562949953421312, from a SQUISH rational packing

    V3 C3 Upper bound confirmed superseded by T-173

    Chaoweeraprasit after Ellsworth · SQUISH n153 2026-10-07 · packet · packet · register

  6. 2026-10-08 published T-125

    Complete rational construction reports at 25 counts

    V3 C3 Upper bound confirmed superseded by T-173

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

  7. 2026-10-08 published T-127

    Fourteen rational refinements, seventeen complete source cases

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

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

  8. 2026-10-09 published T-136

    Seventeen exact rational packings from SQUISH's third request

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

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

  9. 2026-10-10 published T-146

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

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

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

  10. 2026-10-11 published T-148

    A packing of 153 squares built from Xu's packing of 70, its contacts reclosed at a new angle

    V3 C3 Upper bound confirmed superseded by T-173

    PingYou Ltd after Xu, Daniel, Levy · PingYou n153 certificate 2026-10-11 · packet · register

  11. 2026-10-12 published T-166 this result

    A tighter rational realization of PingYou Ltd's packing of 153 squares

    V3 C3 Upper bound confirmed superseded by T-173

    PingYou Ltd after Xu, Daniel, Levy · PingYou n153 refinement 2026-10-12 · packet · register

  12. 2026-10-12 published T-173

    Polkovskyi's packings of 153 and 207 squares, each below the earlier refinements there

    V3 C3 Upper bound confirmed

    Polkovskyi after Xu, Chaoweeraprasit, Levy · Mishapolk exact certificates 2026-10-12 · packet · register

  13. 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, pending adoption

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

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