T-190: A tighter exact certificate for 237 squares from Francisco Couzo, below his issue-607 certificate
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 15 October 2026, "Update all verified bounds for n < 1024", with no issue, and it is unchanged at the pinned head.
The author's index (certificates/best/manifest.json at the pin) reports that his standard-library checker verify_bound_certificate.py, which uses Daniel's exact rational separating-axis geometry, accepts the certificate under both its closed-box and strict contracts (3,214 candidate pairs), and that this repository's sqpack verify.py is the first route of the index. The certificate's metadata calls it an exact optimum seeded from Polkovskyi's issue-593 certificate and found by the author's fq search. Those statements are the author's; no source program ran here.
Credit Couzo (https://github.com/franciscouzo/square-packing) with this refinement at 237 of Polkovskyi's issue-593 certificate (T-183), from which the certificate's metadata says the author's fq search was seeded, and whose credit he asks to keep; the index names Chaoweeraprasit (itsnaka) as the construction's origin. Daniel's solver and verifier and this repository's exact verifier were used. The pinned files state nothing about AI assistance; issue 607, filed the day before for the author's earlier certificate at 237 (T-189), states that he used OpenAI Codex for search and verification orchestration, that earlier search work used Claude Code, and that he directed the work.
Significance, composition and next rung
- Significance
- A refinement of issue 607's packing at to a new smallest side, 2.40e-11 below it and 1.01e-04 below the case ceiling, as T-165 is; not padding; 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.
- Regularizations
- n = 237: a regularization of T-183’s packing by Couzo (exact optimum from the author's fq search, which its metadata seeds from Polkovskyi's issue-593 certificate; solved to its side; identity: measured here; 42 squares moved, at most 0.06593).
- Regularized drawings
- n = 237: a regularization of T-190’s packing by Levy (regularize_axis_components/2; at its own side; identity: measured here; nearest centres one to one; 3 squares moved, at most 0.139365; turns up to 0.00480146°).
- Novelty
- previously-published Present in an identified source
The case
As published
Proven
- exact
Citation record n-237
lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)
upperChaoweeraprasit et al., GitHub (confirmed T-190)
Open
- optimality
The case record
Results on the case
16 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-27 published T-056
Smaller packings for 49 counts from to , each certified two independent ways
V3 C3 Upper bound confirmed superseded by T-190
Couzo · franciscouzo square-packing 2026-09-27 · packet · register
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-190
Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register
2026-10-07 published T-115
at twelve counts, from the SQUISH update’s new and smaller rational packings
V3 C3 Upper bound confirmed superseded by T-190
Chaoweeraprasit after Couzo and Ellsworth · SQUISH update 2026-10-07 · packet · register
2026-10-08 published T-127
Fourteen rational refinements, seventeen complete source cases
V3 C3 Upper bound confirmed on this case, superseded by T-190
Gupta after Chaoweeraprasit, Daniel · Gupta rational refinements 2026-10-08 · packet · register
2026-10-09 published T-134
Six exact rational certificates from Couzo
V3 C3 Upper bound confirmed on this case, superseded by T-190
Couzo after Polkovskyi, Chaoweeraprasit, Gupta, Xu, Daniel, Ellsworth, Levy · Couzo exact certificates 2026-10-09 · packet · register
2026-10-09 published T-136
Seventeen exact rational packings from SQUISH's third request
V3 C3 Upper bound confirmed on this case, superseded by T-190
Chaoweeraprasit after Couzo, Xu, Göbel, Schadt, Ellsworth, Hajba, Levy · SQUISH third request 2026-10-09 · packet · register
2026-10-10 published T-140
Six more exact rational certificates from Couzo
V3 C3 Upper bound confirmed superseded by T-190
Couzo after Chaoweeraprasit, Polkovskyi, Xu, Daniel, Ellsworth, Levy · Couzo certificates 2026-10-10 · packet · register
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-190
Couzo after Ostashev, Chaoweeraprasit, Fang, Daniel, Ellsworth, Levy · Couzo certificates 2026-10-12 · 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-190
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-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-183
Polkovskyi's certificate for 237 squares, the smallest known side there when registered
V3 C3 Upper bound confirmed superseded by T-190
Polkovskyi after Friedman, Daniel, Xu, Chaoweeraprasit, Barnett, Couzo, Ostashev, Ellsworth, Fang, Levy · Mishapolk records 2026-10-14 · packet · register
2026-10-14 published T-189
Couzo's refinement of Polkovskyi's 237, and fifteen beyond-horizon bounds
V3 C3 Upper bound confirmed superseded by T-190
Couzo after Polkovskyi, Fang, Daniel, Ellsworth, Levy · Couzo certificates 2026-10-14 · packet · register
2026-10-15 published T-190 this result
A tighter exact certificate for 237 squares from Couzo, below his issue-607 certificate
V3 C3 Upper bound confirmed
Couzo after Polkovskyi, Chaoweeraprasit, Daniel, Levy · Couzo n237 2026-10-15 · packet · register
Links
- On this site
- Case record, · Frontier row, · T-190 in the results table
On GitHub, at main
- Register
- T-190 in
results.yaml, line 26408 - Evidence
E-couzo-4e4c8ce-n237-certificate-report·E-couzo-4e4c8ce-n237-exact-feasibility- Proofs and certificates
- certificate
certificates - Sources
- Couzo n237 2026-10-15 (its own site, retained copy)
- Source packet
resources/web/couzo-n237-2026-10-15/README.md- Artifacts
6 artifacts and controls
resources/web/couzo-n237-2026-10-15/README.mdresources/web/couzo-n237-2026-10-15/acquisition/claims.jsonresources/web/couzo-n237-2026-10-15/source/certificates/n237.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-237.md(verified lower, verified upper, reported lower, reported upper)