T-188: A tighter exact certificate for 211 squares from Francisco Couzo, of Daniil Ostashev's arrangement
V3 C3 Upper bound confirmed
One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: .
All three retained jobs, the certificate with its duplicate-square and outside-container controls, were decided again here on 16 October 2026 by both maintained exact routes and equal their retained rows, and the frozen comparison rebuilt equal. One maintained route is the verifier the source reports running; the independent rational corner checker is independently re-implemented, and the replay rests on it. The 16 October review found no blocking defect.
The author published it in square-packing on 14 October 2026, "Land verified bounds through n=1024", with no issue. Its metadata (certificates/n211.json at the pin) calls the certificate an exact optimum, found by the author's hop search (job 97342) from his own 211 and seeded from Ostashev's certificate, which it links to issue 501 but whose side it states, 14.99369418658324..., is that of Ostashev's issue-575 certificate (T-175).
Its README lists it as best known, "seeded from Ostashev". The author reports that this repository's sqpack verify.py and Daniel's verify_cert.py accept his certificates in exact rational arithmetic. Those statements are the author's; no source program ran here.
Credit Couzo (https://github.com/franciscouzo/square-packing) with this further arrangement at 211 of Ostashev's issue-575 design (T-175), continuing it as the author's own issue-583 and issue-586 certificates did (T-181, T-182); measured pose by pose by the 16 October review, five squares move beyond a tenth against T-182 and five against T-175, so it is another arrangement of that design, not a refinement in the record's sense (RT-1); the author's README and metadata keep Ostashev's construction credit.
Daniel's optimizer, contact solver and verifier and this repository's exact verifier were used. The pinned files state nothing about AI assistance; the author's issues 583 and 586 of 13 October and 607 of 14 October state that he used OpenAI Codex for the search and verification orchestration, that earlier search work used Claude Code, and that he directed the work.
Significance, composition and next rung
- Significance
- A further arrangement of Ostashev's design at , 9.29e-06 below the case ceiling, five squares moved beyond a tenth: more than the exact re-solves of T-168 and T-169, less than T-172's step; 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 16 October, is retained.
- Regularized drawings
- n = 211: a regularization of T-188’s packing by Levy (Daniel's search/regularize (MIT), evand/square-packing@675a5ea, conservative, coincide, through devtools.regularize_evand; the project’s modifications: same-side exact re-solve (devtools.regularize_same_side); at its own side; 3 free squares straightened, 12 free angles moved; identity: measured here; nearest centres one to one; 67 squares moved, at most 0.269211; turns up to 0.381777°).
- Novelty
- previously-published Present in an identified source
The case
As published
Proven
- 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
Results on the case
13 results in the register on , oldest first, each with what it established and how it stands now.
2005 published T-007
for
V0 C1 Lower bound incomplete on this case, superseded by T-083 and T-180 (reported)
2026-09-04 published T-085
Nagamochi 2005, Lemma 1 is false for every container with and
V3 C3 Correction confirmed
Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register
2026-09-16 published T-057
, the first packing of 211 squares below the grid on record
V3 C3 Upper bound confirmed superseded by T-188
2026-09-29 published T-083
for every nonsquare
V3 C3 Lower bound confirmed
Karakuş · Karakuş 2026 · source · register
2026-10-05 published T-098
Exact optima of 48 known-best packings:
s(n) ≤ S',3.5e-13to5.0e-11below each printed sideV3 C3 Upper bound confirmed on this case, superseded by T-188
Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register
2026-10-11 published T-149
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
2026-10-12 published T-163
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-188
Fang after Arslanov, Mustafin, Shangitbayev, Ellsworth, Stead, de Winter, Daniel, Couzo · Fang excess theorem 2026-10-13 · packet · register
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-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
2026-10-13 published 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-188
Ostashev after Nakajima, Daniel, de Winter, Couzo, Levy, Xu · Ostashev merged bands 2026-10-13 · packet · register
2026-10-13 published T-180
Closed-form lower bound for every non-square , reported
V0 C1 Lower bound reviewed
Hosono · wand125 closed form 2026-10-14 · packet · packet · register
2026-10-13 published T-181
Exact rational certificates at 211, 241 and 302 from Couzo
V3 C3 Upper bound confirmed superseded by 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
2026-10-13 published T-182
Exact rational certificates at 154, 211 and 241 from Couzo
V3 C3 Upper bound confirmed on this case, superseded by T-188
Couzo after Daniel, Ostashev, BuddenPing, Fang, Ellsworth, Levy · Couzo certificates 2026-10-13 · packet · register
2026-10-14 published T-188 this result
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
Links
- On this site
- Case record, · Frontier row, · T-188 in the results table
On GitHub, at main
- Register
- T-188 in
results.yaml, line 25960 - Evidence
E-couzo-487b058-certificate-report·E-couzo-487b058-exact-feasibility- Proofs and certificates
- certificate
certificates - Sources
- Couzo verified bounds 2026-10-14 (its own site, retained copy)
- Source packet
resources/web/couzo-verified-bounds-2026-10-14/README.md- Artifacts
6 artifacts and controls
resources/web/couzo-verified-bounds-2026-10-14/README.mdresources/web/couzo-verified-bounds-2026-10-14/acquisition/claims.jsonresources/web/couzo-verified-bounds-2026-10-14/source/certificates/n211.certdevtools/upper_bound_reports.pydocs/project/reviews/review-2026-10-16-upper-bound-imports-506-607.mdtests/test_upper_bound_reports.py- Case file
frontier/n-211.md(verified lower, verified upper, reported lower, reported upper)