T-175: New packings of 211, 241 and 304 squares, two with merged tilted bands, each certified exactly

V3 C3 Upper bound confirmed superseded by T-182, T-186 and T-188

2026-10-13 published · Ostashev after Nakajima, Daniel, de Winter, Couzo, Levy, Xu · n=211,241,304

Three complete rational source certificates report finite upper-bound improvements at the exact sides they state: s(211)≤149936941865832465706359181817612514235389167555807511399813149936941865832465706359181817612514235389167555807511399813/10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, s(241)≤9991958905656775259135410873409821230409663792812755550161009991958905656775259135410873409821230409663792812755550161/625000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 and s(304)≤358588555161503499313326522779782297248782400899192783432303585885551615034993133265227797822972487824008991927834323/20000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.

All 12 retained jobs, four certificates with their 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 three certificates this entry cites with six controls each and held each retained file to its upstream bytes, fetched at the pin. No route here is the source's code, and the source ran none of them, so the replay is independently re-implemented. The 14 October review found no blocking defect.

The author reports that each packing passes its own C++ checker (sqverify --precise --certify, MPFR then GMP rationals) at delta = 1e-60, that sqverify --check-cert certifies the shipped certificates in GMP rationals with no dilation and no tolerance, and that a separately written 80-digit mpmath cross-check finds least separations of 5e-21 at 211 and 241 and 4.995e-21 at 176 and 304; the issue states that all three checkers are the author's, written with AI assistance, the first two sharing the C++ parser and geometry.

It also states that each side is the exact first-order optimum of its contact topology, with nonnegative KKT multipliers at a 60-digit solution reached by two routes that agree, and the load-bearing squares scaled by 1 + 1e-20. Those statements are the author's; no source program ran here.

Credit Ostashev (https://github.com/dostashev/square-packing) with the packings and their certificates, which the issue says are new arrangements.

At 176, 211 and 241 a packing whose tilted squares form two bands was re-hardened on a GPU with every square soft and the box held (soft-to-rigid, after Nakajima's idea), and the two bands merged into one V: at 176 seeded from the author's earlier composition of issue 528's 38-square piece and issue 562's 44-square piece, at 211 from Daniel's exact optimum of de Winter's packing, and at 241 from Daniel's exact optimum of Couzo's packing, the case's house. At 304 the same re-hardening relaxed the author's composition of a 55-square (h + 8) x h piece and a 68-square (h + 7) x h piece without forming a V. Each was solved to the exact optimum of its contact topology.

The 211 is a different packing from the author's T-149, which it replaces in his repository. The author asks that the seeds' authors (Couzo, Daniel, de Winter) and the composition pieces' sources be acknowledged.

The issue states AI assistance: an AI-assisted research loop the author drives with his own ideas, merging the bands at the junction being his; AI agents wrote and ran the search and verification code, and an agent extended the move from his compositions to published two-band packings.

Measured pose by pose by that review, the 211 and 304 are new arrangements and the 241 rebuilds the seed's design, every square paired and 15 moved beyond a tenth. On 15 October 2026 the case record at 304 adopted this entry as its house, its reported and verified upper bounds moving together and Couzo's certificate (T-152) kept as history; private-worker custody was closed in the same change (packing/devtools/house-custody-2026-10-11.json). At 211 and 241 Couzo's issue 586 (T-182) is smaller and holds the cases.

Significance, composition and next rung
Significance
Three new arrangements, 1.38e-04 to 2.64e-03 below the case ceilings, as T-158 is; 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.
Novelty
previously-published Present in an identified source

The cases

Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, Ostashev 2026 [Couzo verified bounds 2026-10-14]

n=211

14.5414.994
141516
14.52615.526
nn+1

Proven

14.54457≤s(211)≤14.993550

  • exact

Citation record n-211

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

upperOstashev & Couzo, GitHub (confirmed T-188)

Open

  • optimality

The case record

LowerUpper
Gap0.44897772…
Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, Ostashev 2026 [Couzo certificates 2026-10-13]

n=241

15.5415.987
151617
15.52416.524
nn+1

Proven

15.54160≤s(241)≤15.987118

  • exact

Citation record n-241

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

upperOstashev & Couzo, GitHub (confirmed T-182)

Open

  • optimality

The case record

LowerUpper
Gap0.44550813…
Case record
Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, Ostashev 2026 [Mishapolk KKT refinements 2026-10-14]

n=304

17.4417.929
171819
17.43618.436
nn+1

Proven

17.44845≤s(304)≤17.929428

  • exact

Citation record n-304

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

upperOstashev & Mishapolk, GitHub (confirmed T-186)

Open

  • optimality

The case record

LowerUpper
Gap0.48097650…

Results on these cases

17 results in the register on n=211,241,304, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007 · n=211,241,304

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

    V0 C1 Lower bound incomplete on these cases, superseded by T-083 and T-180 (reported)

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085 · n=211,241,304

    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-16 published T-057 · n=211

    s(211)≤14.99796070496771500150<15, the first packing of 211 squares below the grid on record

    V3 C3 Upper bound confirmed superseded by T-188

    de Winter · de Winter n211 2026-09-16 · packet · register

  4. 2026-09-27 published T-056 · n=241,304

    Smaller packings for 49 counts from n=68 to 307, each certified two independent ways

    V3 C3 Upper bound confirmed superseded by T-182 and T-186

    Couzo · franciscouzo square-packing 2026-09-27 · packet · register

  5. 2026-09-29 published T-083 · n=211,241,304

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

    V3 C3 Lower bound confirmed

    Karakuş · Karakuş 2026 · source · register

  6. 2026-10-05 published T-098 · n=211,241,304

    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 these cases, superseded by T-182, T-186 and T-188

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

  7. 2026-10-11 published T-149 · n=211

    New packings of 155, 156 and 211 squares, each with an exact rational certificate

    V3 C3 Upper bound confirmed superseded by T-188

    Ostashev after Nakajima, Levy, Xu · Ostashev records 2026-10-11 · packet · register

  8. 2026-10-11 published T-151 · n=304

    Nine exact rational packings from SQUISH's fourth request

    V3 C3 Upper bound confirmed superseded by T-186

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

  9. 2026-10-11 published T-152 · n=304

    Exact rational refinements of SQUISH's Mondrian packings of 304 and 305 squares

    V3 C3 Upper bound confirmed superseded by T-186

    Couzo after Chaoweeraprasit, Fang, Daniel, Ellsworth, Levy · Couzo certificates 2026-10-11 · packet · register

  10. 2026-10-12 published T-163 · n=211,241

    s(n² − n + 1) < n for every n ≥ 15, and n² − n + F(n) squares below side n, from Fang

    V2 C1 Upper bound reviewed superseded by T-182 and T-188

    Fang after Arslanov, Mustafin, Shangitbayev, Ellsworth, Stead, de Winter, Daniel, Couzo · Fang excess theorem 2026-10-13 · packet · register

  11. 2026-10-13 published T-174 · n=211,241,304

    Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own

    V3 C3 Upper bound confirmed on these cases, superseded by T-182, T-186 and T-188

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

  12. 2026-10-13 published T-175 this result · n=211,241,304

    New packings of 211, 241 and 304 squares, two with merged tilted bands, each certified exactly

    V3 C3 Upper bound confirmed superseded by T-182, T-186 and T-188

    Ostashev after Nakajima, Daniel, de Winter, Couzo, Levy, Xu · Ostashev merged bands 2026-10-13 · packet · register

  13. 2026-10-13 published T-180 · n=211,241,304

    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

  14. 2026-10-13 published T-181 · n=211,241

    Exact rational certificates at 211, 241 and 302 from Couzo

    V3 C3 Upper bound confirmed superseded by T-182 and T-188

    Couzo after Daniel, Ostashev, Fang, Ellsworth, Levy; Couzo after Daniel, Ostashev, BuddenPing, Fang, Ellsworth, Levy · Couzo issue-583 certificates 2026-10-13 · Couzo certificates 2026-10-13 · packet · packet · register

  15. 2026-10-13 published T-182 · n=211,241

    Exact rational certificates at 154, 211 and 241 from Couzo

    V3 C3 Upper bound confirmed

    Couzo after Daniel, Ostashev, BuddenPing, Fang, Ellsworth, Levy · Couzo certificates 2026-10-13 · packet · register

  16. 2026-10-14 published T-186 · n=304

    Exact certificates at twelve counts from Polkovskyi, tightening the smallest reported there

    V3 C3 Upper bound confirmed

    Polkovskyi after Ostashev, Couzo, PingYou Ltd, Levy · Mishapolk KKT refinements 2026-10-14 · packet · register

  17. 2026-10-14 published T-188 · n=211

    A tighter exact certificate for 211 squares from Couzo, of Ostashev's arrangement

    V3 C3 Upper bound confirmed

    Couzo after Ostashev, Daniel, Levy · Couzo verified bounds 2026-10-14 · packet · register