Case record
The best packing known for 68 squares, side 8.79879523…, Couzo 2026. Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, Couzo 2026 [PingYou PR 574 certificates 2026-10-13]

n=68

=open

853100≤s(68)≤8.79879523…

8.538.799
8910
8.2469.246
nn+1

Proven

8.53000≤s(68)≤8.798796

  • exact

Citation record n-068

lowerHosono after Tokoharu and Levy 2026, GitHub (confirmed T-205)

upperCouzo et al., GitHub (confirmed T-174)

Open

  • optimality

Bounds

Best known packing

8.79879523…

8.7987952372182839025766809670213940835210190302278792632403696
Found by
Couzo 2026
Improved by
Rehwaldt, PingYou Ltd
Construction
—
Source
[PingYou PR 574 certificates 2026-10-13]
Evidence
E-pingyou-574-certificate-report
Verified upper bound

8.79879523…

8.7987952372182839025766809670213940835210190302278792632403696

The reported value, verified here.

Evidence
E-pingyou-574-exact-feasibility
Reported lower bound

853100

Proved by
Hosono 2026
Kind
counting
Scope
Unrestricted unit-square packing with independent rotations and disjoint interiors.
Note
T-205: complete maintained 201-direction native replay and accepted mathematical review; confirmed by a re-implementation sharing components with the producer's checker, Hosono's adaptation of this repository's sqverify_fast crate, apart from the declared-net readers. Saved-point audits decide no universal coverage.
Source
[wand125 fine-net lower bounds 2026-10-16]
Evidence
E-wand125-fine-net-n68-853-report
Verified lower bound

853100

The reported value, verified here.

Evidence
E-wand125-fine-net-n68-853-sqverify-fast-replay
Gap

0.26879523…

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-044 V3 C3 Hosono after Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-09-29 · 17 cases

    Weighted point lower bounds for ten counts in n=26…72, plus seven from the same files

  • T-046 V0 C0 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-09-29 · 48 cases

    Rectangle-density lower bounds reported for 48 counts in n=18…95

  • T-056 V3 C3 Couzo · 2026-09-29 · 49 cases

    Smaller packings for 49 counts from n=68 to 307, each certified two independent ways

  • T-058 V3 C3 Hosono after Tokoharu, Daniel · 2026-09-29 · 100 cases

    Rectangle-certificate ceiling α·UB(n) proved for n=1..100; B·UB(n) on 64 grid rows

  • T-068 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-01 · 34 cases

    Rectangle-density lower bounds verified at 34 counts in n=19…95

  • T-070 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-02 · 25 cases

    Rectangle-density lower bounds replayed at 25 counts in n=29…95

  • T-074 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-02 · 31 cases

    Rectangle-density lower bounds replayed at 31 counts in n=19…95

  • 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-098 V3 C3 Daniel after Couzo, de Winter, Ellsworth, Levy · 2026-10-05 · 48 cases

    Exact optima of 48 known-best packings: s(n) ≤ S', 3.5e-13 to 5.0e-11 below each printed side

  • T-118 V3 C3 Rehwaldt after Couzo and earlier contributors · 2026-10-07 · n = 68

    Exact rational ceiling refinements at n=68

    Claim and records
    Claim
    Complete exact replay, reproduced with the producer's code, confirms the finite rational upper-bound refinement at n=68. Only finite feasibility enters; no optimality claim is registered.
    Significance
    The same at n=68: a refinement of Couzo's packing by about 4.3e-12, a re-solve at the scale of its rounding, S2 as T-117 and T-098 are. Confirmed on 11 October.
    Novelty
    previously-published Present in an identified source
    Records

    n = 68registerevidence 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-205 V3 C3 Hosono after Tokoharu and Levy · 2026-10-17 · n = 68

    Mixed rectangle-measure lower bound s(68)≥853/100 verified, on the 201-direction net

    Claim and records
    Claim
    A rectangle measure of wand125/square-packing, published on 16 October 2026 and reported in jlevy/squares#446, proves s(68)≥853/100 = 8.53.

    The certificate, mixed_n68_L853, is a density of 726 uniform rectangles in D4 orbits, 5796 distinct rectangles after expansion, and no point or segment, of total mass 6799999/100000 < 68. Its declared net has 201 half-angle tangents of step 83/40000 at core side 9977/10000. The strict core extent 399908091/400000000 < 1 and the last tangent 83/200, past tan(pi/8), supply the reviewed net-and-shrink implication.

    The retained maintained sqverify-fast capture verifies all 201 directions at threshold one, under the qualified Mac release build of Rust 1.98.0. Its whole-net controls record 197 coverage refusals and verified mutant directions 46, 47, 48 and 49, and the near-threshold mutant is refused. The mathematical review accepts the implication and independently recomputed the saved-point captures. The outer capture exit was unobserved after supervisor loss; the complete recovered native result exited 0, and the later check and control outer commands exited 0.

    This raises the verified and reported lower lanes from 851/100 to 853/100. The bound is confirmed by a re-implementation sharing components with the producer's checker, sqverify-proof-net, which is Hosono's adaptation of this repository's sqverify_fast crate: the two share the crate apart from their declared-net readers. The exact audits check premises and saved poses, not coverage between poses; no independent full implementation, second method, proof-assistant check or optimality theorem is claimed.

    wand125 after Tokoharu and Levy, square-packing. The source says parts of the work were produced with AI assistance under human direction.
    Significance
    The strongest verified and reported lower bound on record at n=68, 1/50 above the prior lanes, by the certificate kind and standard net of T-082, T-090 and T-091, with no new technique, at S3 as T-176 to T-178 and T-216 are.
    Novelty
    previously-published Present in an identified source
    Records

    n = 68registerevidence 1evidence 2sourcereview

Verification

upper: replayed here; lower: replayed here

—

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.374713 along (1, 0) with the packing still valid, so the configuration admits a non-trivial feasible motion; 16 of its 68 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 its own axis tool (regularize_axis_components/2). A drawing of T-174's packing at the witness's own side: a pure regularization, which proves no new bound, so not a result. The house is itself its source's regularization of T-118's packing (PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy), registered as T-174 for the upper bound its exact side proves.

Open questions
  • Blocker (source evidence): Green's reported lower-bound proof, cited as private communication by Friedman, has not been recovered or independently replayed. E-green-ds7-theorem9-reported-lower
  • Blocker (source evidence): The v1.2 root-existence, full-geometry and same-root restricted-family claims await independent mathematical review and replay. E-rehwaldt-n68-root-feasibility-v12-report, E-rehwaldt-n68-restricted-attainment-v12-report
  • Priority: Earlier reported ceiling 8.798795237218283902664668919394 from [evand exact optima 2026-10-05]; earlier construction and exact verification evidence remain historical. (Couzo)
  • Priority: Earlier house 8.79879523721828390257668096702139408352101903022787926324037 from [Rehwaldt n68 refinement 2026-10-07], the case’s ceiling until 17 October 2026; its certificate and replay remain retained. (Couzo, Rehwaldt)
Evidence and sources
27 evidence entries

E-wand125-fine-net-n68-853-report, E-wand125-fine-net-n68-853-sqverify-fast-replay, E-n068-fine-net-review-premises, E-n068-fine-net-review-captures, E-evand-exact-optima-2026-10-05-report, E-evand-exact-optima-2026-10-05-exact-replay, E-evand-exact-optima-2026-10-05-source-replay, E-n068-wand125-rect-851-sqverify-fast-replay, E-wand125-rectangle-2026-10-01-source-replay, E-wand125-rectangle-2026-09-28-source-replay, E-wand125-rectangle-2026-10-01-report, E-franciscouzo-2026-09-27-report, E-franciscouzo-2026-09-27-exact-replay, E-franciscouzo-2026-09-27-interval-replay, E-wand125-rectangle-2026-09-28-report, E-wand125-rectangle-report, E-wand125-n068-derived-lower, E-unitsquare-release1-report, E-nagamochi-lower, E-basic-grid-upper, E-green-ds7-theorem9-reported-lower, E-rehwaldt-n68-refinement-2026-10-07-report, E-rehwaldt-n68-refinement-2026-10-07-exact-replay, E-rehwaldt-n68-root-feasibility-v12-report, E-rehwaldt-n68-restricted-attainment-v12-report, E-pingyou-574-certificate-report, E-pingyou-574-exact-feasibility

s(68) — open

Fine-net validation, 19 October 2026 (T-205). The retained candidate mixed_n68_L853 raises both lower lanes from 851/100 to 853/100. The complete 201-direction maintained native replay and mathematical review confirm it by a re-implementation sharing components with the producer’s checker, Hosono’s adaptation of this repository’s sqverify_fast crate, apart from the declared-net readers. The exact audits check premises and saved poses only. The original 18 source reports and historical native receipts remain retained.

House adoption, 17 October 2026. PingYou Ltd’s refinement of Rehwaldt’s refinement of Couzo’s packing (T-174) is now this case’s house: its exact certificate proves s(68)≤8.7987952372182839025766809670213940835210190302278792632403696, 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 4.58×10−61. The earlier ceiling, displayed outward as 8.79879523721828390257668096702139408352101903022787926324037 from Couzo’s packing, improved by Rehwaldt (T-118), applied until this adoption and stays retained as history (the certificate).

Held for the owner, 15 October 2026; lifted 16 October 2026. T-174 at 8.7987952372182840, 4.58×10−61 below this case’s verified ceiling, 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.

External intake, 2026-10-01. Hosono’s rectangle-density source reports s(68)≥851/100=8.51, with total mass 6799/100=67.99<68, accepted by Tokoharu’s unchanged interval checker. The complete 201-direction coverage replay here accepted it again, after this repository’s exact audit checked that the regenerated checker input is the published one and checked the mass and net premises, so it is also verified. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-09-28. Hosono’s rectangle-density source reports a direct 1699/200=8.495 certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass 6799/100=67.99<68, accepted by Tokoharu’s unchanged interval checker. This repository’s exact audit checks that the regenerated checker input is the published one, and checks the mass and net premises; the complete coverage replay has not yet run here, so the verified lower bound is unchanged. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-09-27. Hosono’s rectangle-density source reports a direct 423/50=8.46 certificate for this case, whose reported bound the 2026-09-28 intake above raises, with total mass 6799/100=67.99<68, accepted by Tokoharu’s unchanged interval checker. This repository’s exact audit checks that the regenerated checker input is the published one, and checks the mass and net premises; the complete coverage replay has not yet run here, so the verified lower bound is unchanged.

Before the 7 October refinement, the best known published packing, Couzo’s at Daniel’s exact optimum (T-098), gives s(68)≤8.7987952372182839027…, and the strongest verified lower bound then was 851/100=8.51, from Hosono’s rectangle-density certificate of 1 October (T-074), leaving a gap of about 0.2888. Before it the verified bound was 1691/200=8.455, from Hosono’s n67 rectangle-density certificate by monotonicity (T-070), and until 2026-10-02 841/100, from the complete exact replay of Hosono’s n69 point certificate and its stricter mass budget, which already excludes 68 squares. The exact optimum remains open.

The earlier exact packing

Daniel’s square-packing published on 5 October 2026 an exact rational certificate of this packing at its exact optimum (T-098): the same 68 squares in a square of side 8.7987952372182839027…, 4.3×10−12 below the side Couzo prints. Square for square, Daniel’s pose lay within 4.3×10−4 of the binary64 pose the atlas pictured at that time. In that source comparison, 4 squares moved by more than 1×10−8, all of them squares the source listed as carrying no force; every other square moved by at most 5.8×10−12. The known-best witness listed then was that binary64 pose at its finder’s larger side; Daniel’s certificate witnessed the earlier ceiling above. The current known-best witness is the 7 October exact rational refinement. Daniel’s solver moves the binary64 pose to a nearby exact KKT point of the problem of minimizing the side under non-overlap, computed at 80 digits, and rounds it outward to rationals, each square a rational centre and a rational t=tan(θ/2).

This repository decides the certificate exactly. Converted without rounding, every pair and every wall is decided over ℚ twice, by sqpack’s exact separating-axis test and by an independent checker that shares no code with it, and the source’s own two checkers, run here as retained, accept it as well (receipts). That replay established the earlier verified ceiling 8.7987952372182839027…; it says nothing about optimality. The source reports the exact point as a KKT local minimum: multipliers that keep it in equilibrium, a reduced Hessian positive definite once its exact flat motions are set aside (its per-count report), and no first-order descent across corner-to-corner contacts, each computed numerically at that point; none of that is verified here, and it bears on this packing alone, not on s(68). On jlevy/squares#375 its author wrote that the solver, its checkers and the batch “were written with Claude (Anthropic) as a coding and research agent, directed and reviewed by me.”

The packing

Couzo’s square-packing reports a packing of side 8.798795237222592 for this count, dated 26 September 2026 and unchanged when this record retained the repository on 27 September 2026 (T-056). The repository names no method and no tolerance, and itself states no AI assistance; its author said on issue #227 that he found the 102 and 103 packings “with the help of Claude”.

This repository certifies it exactly. The retained decimal pose rounds to an exact rational packing at centre dilation 1, of side 8.7987952372225919633…, no larger than the printed side, and every pair and every wall is decided over ℚ twice, by the promotion’s exact separating-axis test and by an independent checker that shares no code with it (receipt). That proves s(68)≤8.798795237222592, which was the verified upper bound until Daniel’s exact optimum above replaced it; it says nothing about optimality. Interval arithmetic on the printed pose itself, with each angle’s true cosine and sine and no rational rounding, decides every pair and wall again and gives the same bound (interval route).

The previous best known packing

Before this intake the best known packing was the UnitSquare Project’s, of side 8.803383074716108386903836683375989697670063329, below the Kingbird catalogue’s 8.80345993651653.

The UnitSquare Project’s 29 July 2026 release improves the public Brendberg-Schadt-Ellsworth parent by 0.0000768618004216131. The release classifies the result as a construction-only upper bound and says it used outward-rounded interval arithmetic, a 300-digit zero-tolerance recomputation, and an independent published checker. The public release does not include the interval boxes, governed receipt, or replayable checker needed to inspect the formal claim. This repository recorded the value as reported. The formal lane held the exact 9×9 grid construction until this intake.

The lower bound

The verified floor is a local deduction from Hosono’s retained cert_n69_L841.json. The native exact verifier completed all 201 directions and all five certificate conditions successfully; its exact total mass is 846701027/12500000<68. The count enters only through the strict mass inequality, so replacing the source file’s target 69 by 68 changes no geometric premise. The remaining mass margin is 3298973/12500000. The replay log and mathematical review retain the evidence and derivation. This is a local consequence of the external certificate, with no claim of priority; the upstream README announces n69 rather than n68.

The selected literal external report, [Friedman DS7], gives the lower-bound expression 22+71/13 for s(68) (approximately 8.289965586285). Friedman’s DS7 survey, Theorem 9, k=8, reports this bound at n=65; reference [8] is Green’s private communication (2000). The source proof has not been recovered. The unavoidable-set argument DS7’s Figure 34 illustrates does not prove it: at k=8 that point pattern leaves a unit square empty (review). Inherited at n=68 by monotonicity. That value remains in the reported field, separate from the stronger locally derived verified floor. The source audit compares the exact theorem expressions separately from opaque table decimals. Nagamochi’s general bound 1+53 remains valid historical evidence and is superseded as this case’s strongest verified floor. Corrected 2 October 2026: its published proof rests on Nagamochi’s Lemma 1, which Karakuş showed false, so it is now a reported bound (review). This register had recorded that proof as verified, its own error, logged as defect D-516.

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-wand125-fine-net-n68-853-sqverify-fast-replay replayed here shared components V-sqverify-fast (first-party)
verified upper E-pingyou-574-exact-feasibility replayed here independent V-sqpack-verify, V-check-rational-witness-independent, V-check-half-angle-area (first-party); V-evand-arrangement-receipts, V-upper-bound-reports, V-evand-exact-certificates (first-party, premises)

The 7 October rational refinement

Rehwaldt reports the finite rational witness (T-118) at exact side 879879523721828390257668096702139408352101903022787926324037/100000000000000000000000000000000000000000000000000000000000, whose complete terminating decimal is 8.79879523721828390257668096702139408352101903022787926324037. The pinned source refines Couzo’s existing construction with disclosed OpenAI Codex assistance. The complete finite witness is now exact-replayed here at V3/C3 after scoped review and public recovery of all original scientific evidence. Earlier ceilings and verification remain historical evidence for their own geometries. No unrestricted lower bound, optimality or rigidity claim is added. The earlier rigidity screen belongs to the earlier geometry and is preserved in the packet’s prior-state record; the current numerical translation screen is separate from the exact feasibility evidence.

The exact side is below Daniel’s retained rational ceiling even though an 18-place upward-rounded display is larger. The full rational and terminating decimal, rather than that rounded display, determine this comparison.

The v1.2 Exact-Root and Restricted-Family Report

Rehwaldt’s separate v1.2 packet attributes exact-root feasibility and attainment inside a specified contact family. Independent mathematical review and replay remain pending. The root packing is distinct from the finite rational witness above. Neither v1.2 statement changes the standing upper or lower lanes, and restricted-family attainment supplies no unrestricted optimum.

PingYou Ltd’s certificate (T-174)

PingYou Ltd’s refinement of Rehwaldt’s refinement of Couzo’s packing, reported in pull request #574, at an exact rational side, displayed upward as 8.7987952372182839025766809670213940835210190302278792632403696 (T-174). The certificate gives a rational side and, for each of the 68 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(68)≤8.7987952372182839025766809670213940835210190302278792632403696, the verified upper bound: 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-118 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, 8.79879523721828390257668096702139408352101903022787926324037 from Couzo’s packing, improved by Rehwaldt (T-118), stays retained with its own replay as history.