T-223: Couzo's smaller packings at 204 and 260, the two in the corpus of issue 678's 85 bounds

V3 C3 Upper bound confirmed superseded by T-225

2026-10-18 published · Couzo after de Winter, Polkovskyi, Daniel, Fang, PingYou Ltd, Levy · n=204,260

Two complete rational source certificates prove finite upper bounds at the exact sides they state: s(204)≤141654921219558922887849/9565692327860000000000; s(260)≤146417594016514621500994169/8796093022208000000000000.

Issue 678 reports 85 upper bounds for n=204 to 998 by 83 exact rational certificates in Couzo's square-packing repository (https://github.com/franciscouzo/square-packing), committed on 18 October 2026, each printed side its certificate's header side rounded up at 12 places. This entry registers the two in the case corpus; the 83 beyond it are dated beyond-horizon rows of the couzo-issue678-2026-10-18 source.

Both were confirmed here, re-implemented sharing named components: the packet's filtered exact replay decided each on two routes that share the certificate parser, the half-angle map, the sqrt-2 pair filter and Fraction arithmetic, one of them sqpack.verify's predicates, the corner verifier the source reports running. The maintained all-pairs kernel decided every pair at both counts, the source's own checker accepted both, and the 20 October review's checker, sharing only Fraction, agreed at every number. The review found no blocking defect.

The source credits Polkovskyi's construction at 204, and de Winter's (issue 668) at 260, seeded from Daniel's exact-form certificate of it, published on 17 October 2026 in his square-packing repository (https://github.com/evand/square-packing). The source checks its certificates with this project's verification code and Daniel's checker as modified by Couzo with Codex. No arrangement identity, local minimum or optimum is established.

Significance, composition and next rung
Significance
A new arrangement at each count. At 204 it is 2.04e-05 below the case ceiling and T-193's algebraic side, with 14 of 204 squares beyond a tenth of T-186's packing (87 within 1e-04): the scale of T-224 at 270 (3.47e-05, 15 squares, S3), well above T-188's 9.29e-06 at 211 (five squares, S2). At 260 it is 2.56e-05 below T-196, from a search seeded with T-196's exact form, but 24 squares lie beyond a tenth of it, so not a same-arrangement step like T-199's 1.32e-05 at 229 (S2); T-196's own S3, for moving 260 below 11 + 4 sqrt 2, is not inherited. Either count alone carries S3, as T-220, T-221 and T-222 do at single counts; no lower bound or optimum.
Next rung
None for the bound. V4 and C4 need a second accepted adversarial review by a distinct reviewer and a retained human oversight record; one AI review, of 20 October, is retained.
Novelty
previously-published Present in an identified source

The cases

Case record

n=204

14.2914.809
141516
14.28315.283
nn+1

Proven

14.29311≤s(204)≤14.808643

  • exact

Citation record n-204

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

upperCouzo & Daniel, GitHub (confirmed T-225)

Open

  • optimality

The case record

LowerUpper
Gap0.51552861…
Case record

n=260

16.1216.646
161718
16.12517.125
nn+1

Proven

16.12849≤s(260)≤16.645754

  • exact

Citation record n-260

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

upperCouzo & Daniel, GitHub (confirmed T-225)

Open

  • optimality

The case record

Results on these cases

16 results in the register on n=204,260, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007 · n=204,260

    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=204,260

    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 · n=204,260

    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 · n=204,260

    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 these cases, superseded by T-225

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

  5. 2026-10-12 established T-155 · n=204,260

    Exact regularized sides at 59 counts, 5.4e-20 to 9.9e-15 below the ceilings they replace

    V3 C3 Upper bound confirmed on these cases, superseded by T-225

    Levy after Daniel · register

  6. 2026-10-12 published T-162 · n=204

    New packings of 129, 204 and 303 squares, a cut-out and two compositions, each certified exactly

    V3 C3 Upper bound confirmed superseded by T-225

    Ostashev after Nakajima, Chaoweeraprasit, Daniel, Xu, Levy · Ostashev compositions 2026-10-12 · packet · register

  7. 2026-10-13 published T-174 · n=204

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

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

  8. 2026-10-13 published T-180 · n=204,260

    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

  9. 2026-10-14 published T-186 · n=204

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

    V3 C3 Upper bound confirmed on these cases, superseded by T-225

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

  10. 2026-10-16 published T-193 · n=204

    Exact algebraic sides at sixteen counts from Daniel, of packings the record credits

    V3 C3 Upper bound confirmed on these cases, superseded by T-225

    Daniel after Xu, Chaoweeraprasit, Ostashev, Couzo, PingYou Ltd, Gupta, Polkovskyi, Levy · Daniel exact current records 2026-10-16 · packet · register

  11. 2026-10-17 published T-196 · n=260

    de Winter reports three smaller rational upper bounds at 227, 229 and 260

    V3 C3 Upper bound confirmed superseded by T-225

    de Winter after Levy · de Winter upper bounds 2026-10-17 · packet · register

  12. 2026-10-17 published T-226 · n=204

    Couzo's 204 of #670, below Polkovskyi's T-186, since superseded by his own #675 and #678

    V0 C0 Upper bound recorded superseded by T-225

    Couzo after Polkovskyi, Daniel, Levy · Couzo issue 670 2026-10-17 · packet · packet · register

  13. 2026-10-18 published T-223 this result · n=204,260

    Couzo's smaller packings at 204 and 260, the two in the corpus of issue 678's 85 bounds

    V3 C3 Upper bound confirmed superseded by T-225

    Couzo after de Winter, Polkovskyi, Daniel, Fang, PingYou Ltd, Levy · Couzo issue 678 2026-10-18 · packet · register

  14. 2026-10-18 published T-228 · n=204

    Couzo's 204 of #675, below his #670, since superseded by his #678

    V0 C0 Upper bound recorded superseded by T-225

    Couzo after Polkovskyi, Daniel, Levy · Couzo issue 675 2026-10-18 · packet · packet · register

  15. 2026-10-20 published T-225 · n=204,260

    Daniel's solved, regularized views at 204, 227, 229 and 260, each the smallest side reported there

    V3 C3 Upper bound confirmed

    Daniel after Couzo, de Winter, Polkovskyi, Levy · Daniel regularized lists 2026-10-20 · packet · register

  16. 2026-10-22 published T-229 · n=204

    Polkovskyi's re-solves of the house packings at 105 and 204, below T-174 and T-225

    V0 C0 Upper bound recorded

    Polkovskyi after Couzo, Muglich, Daniel, Xu, PingYou Ltd, Levy · Mishapolk issue 719 2026-10-22 · packet · register