T-171: An exact contact refinement of SQUISH's packing of 272 squares

V3 C3 Upper bound confirmed superseded by T-174

2026-10-12 published · PingYou Ltd after Chaoweeraprasit, Daniel, Levy · n=272

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

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 exact separating-axis and rational polygon-intersection implementations accept all 272 squares, 1,088 wall conditions and 36,856 pairs, for the new witness, the prior certificate and a pre-stationarity projection, with duplicate and outside controls refused and the conversion to its corners Witness/v2 lossless; 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 this contact refinement, as the source asks, of Chaoweeraprasit's SQUISH n272 (T-151, issue 500), whose components the source names as SQUISH's s(240) and the former Kingbird s(182) catalogue construction, with Daniel's exact contact solver. The issue states: 'Computation, checking and submission preparation were AI-assisted; the requested attribution is as stated above.' The pinned source makes no statement about AI assistance.

Measured pose by pose by that review, it is Chaoweeraprasit's SQUISH packing (T-151) re-solved, no square moved beyond 2e-07. At 272 PR 574's certificate (T-174) is smaller, by 1.70e-99, and the house rule of 16 October 2026, which lifted the hold of 15 October, made T-174 the house there, and the adoption of 17 October 2026 (think-3mry) moved the case to it. This entry held the case until then, the smallest certificate there that the hold left in.

Significance, composition and next rung
Significance
A re-solve 5.26e-16 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 = 272: a regularization of T-151’s packing by PingYou Ltd (exact contact refinement with Daniel's exact contact solver; solved to its side; identity: measured here; nearest centres one to one; 0 squares moved, at most 1.146e-07; turns up to 1.423e-05°).
Novelty
previously-published Present in an identified source

The case

Case record
Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, Chaoweeraprasit 2026 [PingYou PR 574 certificates 2026-10-13]

n=272

16.5016.966
161718
16.49217.492
nn+1

Proven

16.50781≤s(272)≤16.965587

  • exact

Citation record n-272

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

upperChaoweeraprasit & PingYou Ltd, GitHub (confirmed T-174)

Open

  • optimality

The case record

LowerUpper
Gap0.45777588…

Results on the case

11 results in the register on n=272, 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-174

    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-03 published T-092

    Smaller packings again at seven counts from n=208 to 306, each certified two independent ways

    V3 C3 Upper bound confirmed superseded by T-174

    Couzo · franciscouzo square-packing 2026-10-03 · packet · register

  6. 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-174

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

  7. 2026-10-07 published T-119

    Three exact feasible upper bounds at n=266,270,272 from new source arrangements

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

    Daniel after Levy, Ellsworth, Couzo, Stead · Daniel new arrangements 2026-10-07 · packet · register

  8. 2026-10-11 published T-151

    Nine exact rational packings from SQUISH's fourth request

    V3 C3 Upper bound confirmed superseded by T-174

    Chaoweeraprasit after Couzo, Gupta, Ellsworth, Friedman, Levy · SQUISH fourth request 2026-10-11 · packet · register

  9. 2026-10-12 published T-171 this result

    An exact contact refinement of SQUISH's packing of 272 squares

    V3 C3 Upper bound confirmed superseded by T-174

    PingYou Ltd after Chaoweeraprasit, Daniel, Levy · PingYou n272 refinement 2026-10-12 · 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

    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