T-165: A tighter certificate at 176 from Couzo, published with no issue

V3 C3 Upper bound confirmed superseded by T-186

2026-10-12 published · Couzo after Daniel, Ostashev, BuddenPing, Fang, Ellsworth, Levy · n=176

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

All 42 retained jobs of the packet, its fourteen certificates with their duplicate-square and outside-container controls, were decided again here on 14 and 15 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 retained file to its upstream bytes, fetched at the pin. No route here is the source's code; the author's runs of this repository's sqpack verifier are his and decide nothing here, so the replay is independently re-implemented. The 14 October review found no blocking defect.

Couzo published it in his repository on 12 October with no issue, 2.54e-10 below his issue-561 certificate (T-161); it is unchanged at the revision issue 586 pins, where the couzo-certificates-2026-10-13 packet retains it, and the certificates README there prints 13.807637226803 and calls it an exact optimum from Daniel's exact contact solver. No source says whether it is a new packing or a refinement of issue 561's; measured pose by pose by the 14 October review, it refines issue 561's packing (T-161): every square pairs with one of that packing's within 3.8e-03, none turned beyond 0.17 degrees, and the side is 2.54e-10 smaller.

Both maintained exact routes accept it here and refuse its two controls.

Credit Couzo (https://github.com/franciscouzo/square-packing); issue 561 credits Ostashev's arrangement as the start of its 176. The commit makes no statement about AI assistance; the author's issues of 12 and 13 October say OpenAI Codex assisted the search and verification and that he directed the work.

At 176 PR 574's certificate (T-174) is smaller, by 1.18e-02, and was held for the owner from 15 October until the house rule of 16 October 2026 lifted the hold. Meanwhile this entry held the case, the smallest certificate there that the hold left in. The adoption of 16 October 2026 (PR #657) made Polkovskyi's T-186, smaller than T-174, the house.

Significance, composition and next rung
Significance
A refinement of issue 561's packing (T-161) at n=176, 2.54e-10 below it and 5.22e-03 below the case ceiling, as T-139 and T-137 are; 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 = 176: a regularization of T-161’s packing by Couzo (the author's exact re-solve of his issue-561 packing, measured here; solved to its side; identity: measured here; nearest centres one to one; 106 squares moved, at most 0.003795; turns up to 0.166°).
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, Ostashev 2026 [Mishapolk KKT refinements 2026-10-14]

n=176

13.2713.796
131415
13.26614.266
nn+1

Proven

13.27693≤s(176)≤13.795873

  • exact

Citation record n-176

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

upperOstashev et al., GitHub (confirmed T-186)

Open

  • optimality

The case record

LowerUpper
Gap0.51893997…

Results on the case

10 results in the register on n=176, 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-186

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

  5. 2026-10-11 published T-151

    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

  6. 2026-10-12 published T-161

    Exact rational certificates at 156, 176, 237 and 271 from Couzo

    V3 C3 Upper bound confirmed superseded by T-186

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

  7. 2026-10-12 published T-165 this result

    A tighter certificate at 176 from Couzo, published with no issue

    V3 C3 Upper bound confirmed superseded by T-186

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

  8. 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, superseded by T-186

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

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

  10. 2026-10-14 published T-186

    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