T-221: Daniel's smaller n308 packing, started from Chaoweeraprasit's 307 packing, certified exactly
V3 C3 Upper bound confirmed
One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: .
The certificate and its duplicate-square and outside-container controls were decided here on 20 October 2026 by both maintained exact routes, and the frozen comparison rebuilt; no route here is the source's code, so the replay is independently re-implemented. The 20 October review found no blocking defect.
Issue 689 reports a packing found by Daniel's chained explorer, which inserted one square into the register's packing, Chaoweeraprasit's (itsnaka's) #481 packing (T-136), and by his basin explorer, which descended from there; it asks that #481's packing be credited as the ultimate start, places the packing in the family of Fang's #484 and Daniel's #489, mirrored, and says it is not a refinement of #489 and descends from neither. Measured here pose by pose, the packing is another arrangement of the two-wedge design the case's earlier house best packing holds, found from #481's 307 as the source describes.
The author reports that his two exact checkers accept the certificate and its 29-group regularized view at the same side, and a KKT local minimum strict modulo 47 exact flat motions, with 242 corner-corner contacts, no corner-corner MILP descent, 5 rattlers and 102 tilted squares; those are numerical evidence at 80 digits, not proofs. The source's credits say the work was done with Claude (Anthropic) under Daniel's direction.
Significance, composition and next rung
- Significance
- Another arrangement of the two-wedge design at 308, 1.12e-03 below the case and every report there, to a new KKT point with 15 squares moved beyond a tenth of #489's packing and 102 tilted squares against its 112, as T-218 at 236 is; well above T-188's 9.29e-06 (S2); 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.
- Regularized drawings
- n = 308: a regularization of T-221’s packing by Levy (regularize_grid_slack/1: Daniel's coincidence placement (evand/square-packing search/regularize reg.coincidences and reg.place, MIT), ported to start from the witness's exact frame and to keep its contacts, then the same-side exact re-solve, through devtools.regularize_grid_slack; the project’s modifications: port of his coincidence placement (regularize_grid_slack/1) rather than his code, same-side exact re-solve (devtools.regularize_same_side); at its own side; identity: measured here; nearest centres one to one; 33 squares moved, at most 0.312828; no square turned).
- Novelty
- previously-published Present in an identified source
The case
As published
Proven
- exact
Citation record n-308
lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)
upperDaniel 2026, GitHub (confirmed T-221)
Open
- optimality
The case record
Results on the case
9 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-29 published T-083
for every nonsquare
V3 C3 Lower bound confirmed
Karakuş · Karakuş 2026 · source · register
2026-10-07 published T-124
Reported non-strict local minima for 178 source configurations
V0 C0 Restricted optimality recorded
Daniel after Couzo · Daniel exact and local reports 2026 · packet · register
2026-10-10 published T-135
A packing of 308 squares below the grid, from Fang
V3 C3 Upper bound confirmed superseded by T-221
Fang after Arslanov, Mustafin, Shangitbayev, Ellsworth, Stead · Fang two-wedge certificates 2026-10-10 · packet · register
2026-10-10 published T-141
Exact rational certificates at 132 and 308 from Daniel's third record hunt
V3 C3 Upper bound confirmed superseded by T-221
Daniel after Fang, Arslanov, Mustafin, Shangitbayev, Couzo, Levy · Daniel record hunt 3 2026-10-10 · 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-221
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-19 published T-221 this result
Daniel's smaller n308 packing, started from Chaoweeraprasit's 307 packing, certified exactly
V3 C3 Upper bound confirmed
Daniel after Chaoweeraprasit, Levy · Daniel n308 2026-10-19 · packet · register
Links
- On this site
- Case record, · Frontier row, · T-221 in the results table
On GitHub, at main
- Register
- T-221 in
results.yaml, line 30238 - Evidence
E-evand-689-n308-report·E-evand-689-n308-exact-feasibility- Proofs and certificates
- certificate
candidates - Sources
- Daniel n308 2026-10-19 (its own site, retained copy)
- Source packet
resources/web/evand-n308-2026-10-19/README.md- Artifacts
10 artifacts and controls
resources/web/evand-n308-2026-10-19/README.mdresources/web/evand-n308-2026-10-19/acquisition/claims.jsonresources/web/evand-n308-2026-10-19/source/search/packer/candidates/s308_d308.certresources/web/evand-n308-2026-10-19/receipts/exact-certification.json.xzdevtools/upper_bound_reports.pydocs/project/reviews/review-2026-10-20-upper-bound-imports-689-694.mdresources/web/evand-n308-2026-10-19/review/review-2026-10-20/README.mdtests/test_upper_bound_reports.pytests/test_upper_bound_reports_689_694.pyresources/web/evand-n308-2026-10-19/receipts/exact-certification.json.xz- Case file
frontier/n-308.md(verified lower, verified upper, reported lower, reported upper)