Case record
The best packing known for 308 squares, side 17.99714912…, Daniel 2026. Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, Daniel 2026 [Daniel n308 2026-10-19]

n=308

= corrects Nagamochi 2005open

17.56604816…≤s(308)≤17.99714912…

17.5617.997
171819
17.55018.550
nn+1

Proven

17.56604≤s(308)≤17.997150

  • exact

Citation record n-308

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

upperDaniel 2026, GitHub (confirmed T-221)

Open

  • optimality

Bounds

Best known packing

17.99714912…

17.9971491212709088
Found by
Daniel 2026
Construction
—
Source
[Daniel n308 2026-10-19]
Evidence
E-evand-689-n308-report
Verified upper bound

17.99714912…

17.9971491212709088

The reported value, verified here.

Evidence
E-evand-689-n308-exact-feasibility
Reported lower bound

17.61662010…

17.616620106628
Proved by
Hosono 2026
Kind
counting
Scope
Unrestricted unit-square packing with independent rotations and disjoint interiors.
Note
Hosono's closed form (wand125, 13 October 2026, T-180): s(N) >= a(N) for every non-square N >= 49, from a measure of line segments on 34 intervals of the fractional part. At n=308, k = 17 and interval 28 give a(308) = 17.616620106628016467339740238257..., here rounded down at 12 and 30 places. The source replayed its certificate with its own checker; no replay has run here.
Source
[wand125 closed form 2026-10-14]
Evidence
E-wand125-closed-form-report
Verified lower bound

17.56604816…

17.5660481658
Corrects
Nagamochi 2005 (T-007)
Evidence
E-karakus-strip-lower, E-karakus-strip-measure-interval
Gap

0.43110095…

Verified upper minus verified lower.

Results in the register

  • T-007 V0 C1 Nagamochi · 2026-08-31 · 321 cases

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

  • T-083 V3 C3 Karakuş · 2026-10-02 · 301 cases

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

  • T-085 V3 C3 Karakuş; Vlasenko · 2026-10-02 · 315 cases

    Nagamochi 2005, Lemma 1 is false for every container with a>3 and b>2

  • T-124 V0 C0 Daniel after Couzo · 2026-10-07 · 178 cases

    Reported non-strict local minima for 178 source configurations

  • T-135 V3 C3 Fang after Arslanov, Mustafin, Shangitbayev, Ellsworth, Stead · 2026-10-10 · n = 308

    A packing of 308 squares below the grid, from Fang

    Claim and records
    Claim
    One complete rational source certificate by Fang, reported on jlevy/squares#484, proves a finite upper bound at the exact side it states: s(308)≤496906684150483564257053639569689586211617178631487101147707692165192097/27606985387162255916575391130373464080218179016903156277167119960899584.

    The same release states s(343)≤789017423383549575129979982295456201/41538374868278621028243970633760768 and s(344)≤262204097424407923560664994905454377606094204426897481135606818230728643/13803492693581127593573619627880932674597656005283617050019749892718592, beyond the case corpus; the source register tracks those as beyond-horizon rows.

    Each certificate gives a rational side and, for each unit square, a rational centre and the tangent of its half-angle, in Daniel's format, with the same packing in SQUISH's JSON layout. The author reports that Daniel's verify_cert.py, Ellsworth's check_packing.py on 40-digit exports and the author's own verify.py accept all three; their outputs are retained.

    All nine retained jobs, the three positives with their duplicate-square and outside-container controls, were decided again here on 10 October 2026 by both maintained exact routes and equal their retained rows, and a third exact route, half-extent containment and exact intersection area, decided the three with six controls each and found each text certificate equal to its JSON copy. No route here is the source's code, so the replay is independently re-implemented. The 10 October review found no blocking defect.

    The side at 308 was the first below the grid's 18, which the case held in both lanes. On 11 October 2026 the case record adopted the smaller side of issue 489 (T-141), Daniel's move of this construction, and this certificate stays verified and is not selected.

    Credit Fang (https://github.com/TheSnakeFang/squarepack-certs). The packings extend the k^2 - k + 1 two-wedge family of Arslanov, Mustafin and Shangitbayev (Electronic Journal of Combinatorics 28(4), P4.22, 2021) one k up and one square past it, grown from Ellsworth's and Stead's packings of 273 and 307 squares on the Kingbird table; the certificate format is Daniel's and the JSON layout SQUISH's. The search, the verifier and the bundle were written with Claude under the author's direction.
    Significance
    A smaller finite construction side at n=308, 6.90e-04 below the case ceiling; no lower bound or optimum.
    Novelty
    previously-published Present in an identified source
    Records

    n = 308registerevidence 1evidence 2

  • T-141 V3 C3 Daniel after Fang, Arslanov, Mustafin, Shangitbayev, Couzo, Levy · 2026-10-10 · n = 132, 308

    Exact rational certificates at 132 and 308 from Daniel's third record hunt

    Claim and records
    Claim
    Two complete rational source certificates by Daniel, reported on jlevy/squares#489, prove finite upper bounds at the exact sides they state: s(132)≤11.985680198845808811522231964102 and s(308)≤17.998269879526255875387992744507.

    The same release states s(343)≤18.978232523635611279730512106023 and s(344)≤18.994450514277401521114135796864, beyond the case corpus; the source register tracks those as beyond-horizon rows, proved by the same evidence.

    Each certificate gives a rational side and, for each unit square, a rational centre and the tangent of its half-angle, in Daniel's format, each side printed in full. The author reports that his two exact rational checkers, verify_cert.py and verify_cert2.py, with different geometry, pass all four, with least certified clearances of 1e-20 for pairs and 5e-21 for walls. Each side is an 80-digit KKT point with positive multipliers on the load-bearing contacts, a reduced Hessian positive semidefinite modulo exact flat motions and a jammed first-order MILP in every corner-corner branch; those are numerical evidence, as the source says, not proofs.

    All 15 retained jobs of the release's five-count replay, the four positives with their duplicate-square and outside-container controls among them, were decided again here on 10 October 2026 by both maintained exact routes and equal their retained rows, and a third exact route, half-extent containment and exact intersection area, decided the four with six controls each. No route here is the source's code, so the replay is independently re-implemented. The 10 October review found no blocking defect.

    Each side was below the ceiling its case held, at 308 the grid's 18. On 11 October 2026 the case records adopted both as the house.

    Credit Daniel (https://github.com/evand/square-packing), whose quality-diversity basin explorer with a two-parent crossover move found all four. The packings at 308, 343 and 344 build on Fang's packings from issue 484 in the Arslanov-Mustafin-Shangitbayev two-wedge family, and the author asks that the construction be credited to him: 344 is his packing polished and moved by a corner-corner descent, 308 his packing polished and moved seven explorer steps, and 343 his 344 less one square, in a different basin from his 343. The packing at 132 is the author's own lineage from issue 465. The search code and the request were written with Claude under the author's direction.
    Significance
    Smaller finite construction sides at n=132 and 308, 1.73e-03 to 5.65e-03 below the case ceilings; no lower bound or optimum.
    Novelty
    previously-published Present in an identified source
    Records

    n = 132n = 308registerevidence 1evidence 2

  • T-174 V3 C3 PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · 2026-10-14 · 68 cases

    Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own

  • T-180 V0 C1 Hosono · 2026-10-14 · 264 cases

    Closed-form lower bound s(N)≥a(N) for every non-square N≥49, reported

  • T-221 V3 C3 Daniel after Chaoweeraprasit, Levy · 2026-10-20 · n = 308

    Daniel's smaller n308 packing, started from Chaoweeraprasit's 307 packing, certified exactly

    Claim and records
    Claim
    One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: s(308)≤17.997149121270908735153160752315.

    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 s(307) packing, Chaoweeraprasit's (itsnaka's) #481 packing (T-136), and by his basin explorer, which descended from there; it asks that #481's s(307) 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
    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.
    Novelty
    previously-published Present in an identified source
    Records

    n = 308registerevidence 1evidence 2

Verification

upper: replayed here; lower: external proof (read here), audited here

formal lower differs from report

Rigidity

not rigid, numerically checked, numerical multiprecision

Evidence: E-translation-escape-not-rigid

Scope

Square 0 of the retained witness (witness id 1) translates 0.206368 along (-1, 0) with the packing still valid, so the configuration admits a non-trivial feasible motion; 43 of its 308 squares do. Every constraint is exactly affine in the slide parameter, so the arithmetic carries no linearization error, but the coordinates are the witness's own finite-precision transcription: this settles the retained configuration, not the true optimum. Rigidity and optimality are independent, and this bears only on the former.

Regularized drawing

Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT), with 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). A drawing of T-221's packing at the witness's own side: a pure regularization, which proves no new bound, so not a result.

Open questions
  • Priority: Earlier house 18.0 from [Kingbird], the case’s ceiling until 11 October 2026; its certificate and replay remain retained.
  • Priority: Earlier house 17998269879526255875387992744507/1000000000000000000000000000000 from T-141 (reported as 17.998269879526255875387992744507 from [Daniel record hunt 3 2026-10-10]), the case’s ceiling from 11 October 2026 until 17 October 2026; its certificate and replay remain retained. (Fang, Daniel)
  • Priority: Earlier house 17.9982698795262558753 from [PingYou PR 574 certificates 2026-10-13], the case’s ceiling from 17 October 2026 until 20 October 2026; its certificate and replay remain retained. (Daniel, PingYou Ltd)

s(308) — open

Hosono’s closed form, 14 October 2026. Hosono’s closed form (wand125, 13 October 2026, T-180) states s(N)≥a(N) for every non-square N≥49, from a measure of line segments on 34 intervals of the fractional part. At n=308, k=17 and interval 28 give a(308)=17.616620106628016467339740238257…, so the reported lower bound here is now s(308)≥17.616620106628, rounded down, above Nagamochi’s closed form, 17.58312395177. The source replayed its certificate with its own checker; no record of it has been replayed here, so the verified lower bound is unchanged. The source states that its search, certificates, checkers and text were produced with AI assistance (Claude and Codex), under the direction of and reviewed by Hosono.

House adoption, 20 October 2026. Daniel’s arrangement of Fang’s two-wedge design in a search started from Chaoweeraprasit’s n = 307 packing (T-221) is now this case’s house: its exact certificate proves s(308)≤17.9971491212709088, the reported and the verified upper bound, rounded outward from its exact side. The exact certificate side improves the previous verified exact side by about 1.12×10−3. The earlier ceiling, displayed outward as 17.9982698795262558753 from Daniel’s packing, improved by PingYou Ltd (T-174), applied until this adoption and stays retained as history (the certificate).

Reported certificate, 2026-10-19. Daniel reported a 308-square certificate at container side 17.997149121271, rounded upward from the retained exact certificate. The exact rational side is registered in the result register. Its V0/C0 registration left both case upper lanes, the house witness and its drawing unchanged until the house adoption of 20 October 2026, and until then the rigidity and arrangement notes below described that retained house.

The source calls this a new arrangement, found by inserting one square into Chaoweeraprasit’s 307-square packing of #481 and descending with its explorer, and says it neither refines nor descends from Fang’s #484 or Daniel’s #489, whose packing the house refined until 20 October 2026. Its original and regularized display certificates have the same side and yield one result. The registration asserted no measured packing identity or lineage; the review of 20 October 2026 measured it pose by pose: under a quarter turn, 15 of the 308 squares lie beyond a tenth of #489’s packing and 293 within one, so the packing is another arrangement of the two-wedge design, as its certificate’s section says.

House adoption, 17 October 2026. PingYou Ltd’s refinement of Daniel’s packing based on Fang’s two-wedge construction (T-174) was this case’s house until 20 October 2026: its exact certificate proves s(308)≤17.9982698795262558753, the reported and the verified upper bound, rounded outward from its exact side. The exact certificate side improves the previous verified exact side by about 1.80×10−19. The earlier exact ceiling, 17998269879526255875387992744507/1000000000000000000000000000000 from Fang’s packing, improved by Daniel (T-141), applied until this adoption and stays retained as history; the reported upper bound it replaces, 17.998269879526255875387992744507 from [Daniel record hunt 3 2026-10-10], lies 1.80×10−19 above the new side (the certificate).

House adoption, 11 October 2026. Daniel’s move of Fang’s two-wedge construction (T-141) was this case’s house until 17 October 2026: its exact certificate proves s(308)≤17.9982698795262559, the reported and the verified upper bound, 1.73×10−3 below the ceiling the case held until then, 18.0 from the trivial grid, which stays retained as history (the certificate).

Open. Previously, the best known packing gave s(308)≤18, and the strongest lower bound independently verified here is 17.566048 from Karakuş’s general theorem, leaving a gap of 0.434. General bound: s(N)≥1/2+N−⌊N⌋+1/4.

The packing

The record catalogue does not picture n=308: until October 2026 no arrangement was known that beats the trivial ⌈308⌉=18 grid, and the catalogue’s conjecture that the grid is optimal here was a statement about what had been searched, not a proof. Fang’s two-wedge construction (T-135, issue 484) beat it first, and Daniel’s move of that construction (T-141, issue 489) is smaller again, and his arrangement of the same design (T-221, issue 689), the house from 20 October 2026, smaller still; the grid stays retained as history.

The lower bound

The strongest lower bound independently verified in this record is Karakuş’s general bound, which applies to every nonsquare N≥8:

s(N)≥12+N−⌊N⌋+14

Correction, 2 October 2026. Until that date the verified lower bound here was Nagamochi’s general closed form, s(N)≥min(⌈N⌉,N−2⌊N⌋+1+1), which is stronger at this n and is now recorded as a reported bound. Its published proof rests on Nagamochi’s Lemma 1, which Karakuş showed false; nothing is disproved, and no packing beating it is known (review of 2 October 2026). This register had recorded that proof as verified, its own error, logged as defect D-516.

Source-reported bounds are recorded separately from this independently verified theorem.

Verification Code

The programs behind this case’s verified bounds, by their evidence. The code column says how the code that ran stands to the code its producer used. VERIFIERS.md says what each program is and whose it is.

bound evidence run code programs
verified lower E-karakus-strip-lower a published proof no code no verification code
verified lower E-karakus-strip-measure-interval audited here independent V-check-karakus-strip-measure (first-party)
verified upper E-evand-689-n308-exact-feasibility replayed here independent V-sqpack-verify, V-check-rational-witness-independent (first-party); V-evand-arrangement-receipts, V-upper-bound-reports, V-evand-exact-certificates (first-party, premises)

Evan Daniel’s certificate (T-141)

Daniel’s move of Fang’s two-wedge construction, reported on jlevy/squares#489, at exact side 17998269879526255875387992744507/1000000000000000000000000000000, displayed upward as 17.9982698795262559 (T-141). The certificate gives a rational side and, for each of the 308 unit squares, a rational centre and the tangent of its half-angle; the retained packet holds it with the complete native jobs that decided it.

Both maintained exact routes decided it here, sqpack’s exact separating-axis verifier and the independent rational corner checker, with its duplicate-square and outside-container controls, and a third exact route, half-extent containment and exact intersection area, decided it again. No route here is the source’s code, so the replay is independently re-implemented. The review of 10 October 2026 and the final review of 11 October 2026 accepted the replay for finite feasibility. That proves s(308)≤17.9982698795262559, the verified upper bound until 17 October 2026: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The author says the search code and the request were written with Claude under his direction.

The house it replaces, 18.0 from the trivial grid, stays retained with its own replay as history. The other certificates confirmed here at this count, T-135 at 17.9993098551627480, stay verified and are not selected. T-174 at 17.9982698795262559, 1.80×10−19 below this house, is confirmed here and accepted by the review of 14 October 2026. From 15 October 2026 until the owner’s house rule of 16 October 2026 lifted the hold, PR #574’s houses were held for the owner, since their witnesses would add about 18.5 MB to a checkout and their custody inputs about 5.8 MB to every worker’s snapshot.

PingYou Ltd’s certificate (T-174)

PingYou Ltd’s refinement of Daniel’s packing based on Fang’s two-wedge construction, reported in pull request #574, at an exact rational side, displayed upward as 17.9982698795262558753 (T-174). The certificate gives a rational side and, for each of the 308 unit squares, a rational centre and the tangent of its half-angle; the retained packet holds it with the complete native jobs that decided it.

Both maintained exact routes decided it here, sqpack’s exact separating-axis verifier and the independent rational corner checker, with its duplicate-square and outside-container controls, and a third exact route, half-extent containment and exact intersection area, decided it again. The source ran both maintained routes itself on its corners witnesses; those runs are its own, and the replay here is independently re-implemented. The review of 14 October 2026 accepted the replay for finite feasibility. That proves s(308)≤17.9982698795262558753, the verified upper bound until 20 October 2026: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The certificate is PingYou Ltd’s tightening of the packing T-141 records, that packing by the source’s statement, not decided here (T-174’s regularizations), so the packing keeps its finder’s credit and PingYou Ltd is credited with the certificate.

The source makes no statement about AI assistance in this pull request; for its #503 and #504 certificates the author said on 12 October 2026 that they were AI assisted by ‘PY’, an unreleased agentic AI offering by PingYou Ltd.

The house it replaces, 17998269879526255875387992744507/1000000000000000000000000000000 from Fang’s packing, improved by Daniel (T-141), stays retained with its own replay as history. The other certificates confirmed here at this count, T-135 at 17.9993098551627480, stay verified and are not selected.

Evan Daniel’s certificate (T-221)

Daniel’s arrangement of Fang’s two-wedge design in a search started from Chaoweeraprasit’s n = 307 packing, reported on jlevy/squares#689, at exact side 3599429824254181747030632150463/200000000000000000000000000000, displayed upward as 17.9971491212709088 (T-221). The certificate gives a rational side and, for each of the 308 unit squares, a rational centre and the tangent of its half-angle; the retained packet holds it with the complete native jobs that decided it.

Both maintained exact routes decided it here, sqpack’s exact separating-axis verifier and the independent rational corner checker, with its duplicate-square and outside-container controls, and a third exact route, half-extent containment and exact intersection area, decided it again. No route here is the source’s code, so the replay is independently re-implemented. The review of 20 October 2026 accepted the replay for finite feasibility. That proves s(308)≤17.9971491212709088, the verified upper bound: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The source’s credits say its work was done with Claude (Anthropic) under human direction, and the commit that publishes the certificate names Claude Opus 5.5 as co-author and says Daniel approved it.

The author’s chained explorer inserted one square into Chaoweeraprasit’s n = 307 packing of #481, the register’s witness for 307, and his basin explorer descended from there to this packing; the issue asks that the 307 packing be credited as the ultimate start, and says the packing neither refines nor descends from Fang’s #484 or Daniel’s #489. Measured by the 20 October review, square by square, the best assignment against #489’s packing under a quarter turn moves 15 squares beyond a tenth, at most 0.708, and keeps 293 within one, and 263 of the 307 squares of #481’s packing lie within a tenth of this one: another arrangement of the two-wedge design that #484, #489 and #481’s 307 share, found from #481’s 307 by the source’s account (T-221).

The house it replaces, 17.9982698795262558753 from Daniel’s packing, improved by PingYou Ltd (T-174), stays retained with its own replay as history. The other certificates confirmed here at this count, T-141 at 17.9982698795262559 and T-135 at 17.9993098551627480, stay verified and are not selected.