T-114: s(153)≤7250614903299225/562949953421312, from a SQUISH rational packing

V3 C3 Upper bound confirmed superseded by T-173

2026-10-07 published · Chaoweeraprasit after Ellsworth · n=153

Chaoweeraprasit (itsnaka), using SQUISH, establishes s(153) <=

7250614903299225/562949953421312, about 12.8796793733329640, in the supplement to

jlevy/squares#401 on 7 October 2026, about 0.0019874 below the earlier reported upper bound

here. Each certificate supplies rational centres and rational half-angle parameters for

closed unit squares in the rational container.

The claim establishes only upper bounds, with no optimality or rigidity conclusion. The

author credits Ellsworth’s records and tools and states human-directed Claude Opus 5.5

assistance.

This repository confirmed the upper bounds by independently re-implemented exact-rational

checks: sqpack.witness.exact_verify and devtools.check_rational_witness_independent accept

every pair and container wall of each certificate, with both geometric controls rejected.

Significance, composition and next rung
Significance
New packings reduce the recorded upper bounds at n=153 by about 0.00199, substantive case-bound improvements. They settle no exact optimum and introduce no proved general packing theorem.
Composition
Each source rational triple is converted without rounding to exact unit-square corners, at the source’s unchanged rational side. Both native exact_verify and the independently written rational-corner checker decide every pair and wall; the source-to-witness conversion and complete scope are accepted by the retained mathematical review. The wrapper binds the receipt to the decided witness, checks the full roster and upward decimal display, and replays both geometric controls. This is an independently re-implemented confirmation, sharing no verification code with the producer; the two first-party routes share the converted corners, YAML and Python rational arithmetic.
Next rung
V4 and C4 need a retained human oversight record for the claim, certificate, assumptions, two deciding implementations, controls and accepted adversarial AI reviews. The two separately prompted project AI reviews are retained; human oversight is not. Rung 5 needs a proof-assistant formalization with the open replay and two human expert reviews. No local or global optimality claim is made by these upper-bound certificates.
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 this result

    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

    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