Case record
The best packing known for 76 squares, side 9,

n=76

=open

1793200≤s(76)≤9

8.969
8910
8.7189.718
nn+1

Proven

8.96500≤s(76)≤9

  • exact

Citation record n-076

lowerHosono after Tokoharu, Levy et al. 2026, GitHub (confirmed T-091)

Open

  • optimality

Bounds

Best known packing

9

Construction
grid
Tilt angles
0∘
Source
[Kingbird]
Evidence
E-kingbird-upper-register
Verified upper bound

9

The reported value, verified here.

Evidence
E-basic-grid-upper
Reported lower bound

1793200

Proved by
Hosono 2026
Kind
counting
Scope
Unrestricted unit-square packing with independent rotations and disjoint interiors.
Note
Hosono's square-packing-bounds (4 October 2026) reports s(76)≥1793/200 from a density of 312 uniform rectangles of total mass 7599999/100000, at core side 9977/10000 on 201 net half-angles, accepted there at every angle by its research copy of Tokoharu's verify.cpp at threshold one. It is above the 224/25 this case reported, from the source's mixed_n76_L896 (T-082). sqverify-fast decided it here on 5 October 2026 at all 201 net directions.
Source
[wand125 mixed bounds evening 2026-10-04]
Evidence
E-n076-wand125-mixed-8965-report
Verified lower bound

1793200

The reported value, verified here.

Evidence
E-n076-wand125-mixed-8965-sqverify-fast-replay
Gap

7200= 0.035

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

    Rectangle-density lower bounds replayed at 15 counts in n=18…78

  • 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-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-072 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-02 · n = 76

    Mixed rectangle-measure lower bound replayed at n=76

    Claim and records
    Claim
    s(76)≥447/50 = 8.94, by a rectangle density of wand125/square-packing-bounds checked at coverage one, published on 2 October 2026.

    The certificate is a density of 317 uniform rectangles with no point mass, of total mass 7599999/100000, at core side 9977/10000 on 201 net half-angles of step 83/40000, such that the shrunken core of every rotated unit square at each net direction captures mass at least one. The source reports it accepted at every oblique net angle by code/mixed_rotated_verify.cpp, the research copy of Tokoharu's verify.cpp that its s(50) certificate (T-048) and the certificates of T-069 and T-071 use, which accepts coverage at least 1 where Tokoharu's requires 10001/10000, and at angle zero by exact integer tables. The least oblique lower bound it records is 1.00000000051.

    The value exceeds the source's rectangle certificate at this count, 357/40 = 8.925 (T-068), which it says it supersedes, and Nagamochi's 1 + sqrt(61) = 8.8102....

    Here the exact premises were recomputed from the retained bytes, and the certificate passed a complete replay on 2 October 2026 of the source's unchanged checker and per-angle functions on the pinned tarball: all 201 directions, each returning the certificate's own record. The replay runs the source's own algorithm and is not an independent decision of coverage.

    Hosono after Tokoharu and Levy, square-packing-bounds. Registration was requested in a comment of 2 October 2026 on jlevy/squares#282. The source says parts of the work were produced with AI assistance under human direction.
    Significance
    Raised the verified lower bound at n=76 by 0.05, over Hosono's n=75 rectangle certificate by monotonicity (T-045), by the certificate kind of T-048, T-069 and T-071: a further size from one generator, a substantive case result at S3. The 2 October review of the certificate confirmed the draft.
    Novelty
    previously-published Present in an identified source
    Records

    n = 76registerevidence 1evidence 2sourcereview

  • T-082 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-03 · 22 cases

    Mixed rectangle-measure lower bounds verified at 22 counts in n=51…96

  • 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-091 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-05 · 17 cases

    Mixed rectangle-measure lower bounds verified at 17 counts in n=53…95

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

    Reported non-strict local minima for 178 source configurations

  • 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-184 V3 C1 Greff after Daniel, Hosono · 2026-10-14 · n = 76

    s(76)=9, by a mixed cover of points and grid-line segments

    Claim and records
    Claim
    Greff reports s(76)=9: the lower half by a mixed cover, the upper half by the 9×9 grid. It is the case k = 9 of the k^2 - 5 series.

    The cover is 41,633 weighted points and 9,744 axis-parallel segments of [0,9]^2 in Daniel's mixed format, total 3788361049/50000000 = 75.76722098 < 76, exactly D4-invariant. Every closed unit square in [0,9]^2 captures mass at least one, so a packing of 76 at side below 9, scaled up to side 9, would capture at least 76.

    The source reports the covering statement decided by two of Daniel's checkers: zmx2, in outward-rounded binary64, on 8,096 of the 8,100 root cells of the D4 region, and zm_mixed.py, in exact rationals, on the 64 cells that tile the other four. Its Lean wrapper on Daniel's Sqpack takes the covering statement as a hypothesis. Those statements are the author's.

    At retention here the cover's data facts were recomputed, zmx2 was replayed over all 8,100 roots and zm_mixed.py over the 64 sub-roots from the bytes the source pins, each equal to the source's records, with two mutations refused by zmx2. The two checkers' runs are read as one decision over the D4 region, every cell certified once: a reproduction with the producer's code, counted as a confirmation once zm_mixed.py's mutated-certificate controls are held. The review of 16 October found no mathematical defect.

    Credit Greff (https://github.com/bengreff/s76-certificate), building on Daniel's method at margin zero, mixed format, checkers and Lean library, and on Hosono's s(59)=8 cover, reused for the corners, and band-insertion construction. Registration was requested in jlevy/squares#594. The source says the search, LP and verification pipeline were built and run with Claude (Anthropic) as an AI assistant, under the author's direction.
    Significance
    An exact value for a case that was open, by Daniel's recipe at a new count, as T-066 settled s(59)=8: a substantive case result, not a new technique or a family. The 16 October review confirmed the draft.
    Novelty
    previously-published Present in an identified source
    Records

    n = 76registerevidence 1evidence 2evidence 3sourcereview

Verification

upper: replayed here; lower: replayed here

—

Rigidity

not rigid, numerically checked, numerical multiprecision

Evidence: E-translation-escape-not-rigid

Scope

Square 67 of the retained witness (witness id 68) translates 1 along (0, 1) with the packing still valid, so the configuration admits a non-trivial feasible motion; 6 of its 76 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.

s(76) — open

External intake, 2026-10-05. Hosono’s mixed-certificate source reports s(76)≥1793/200=8.965 (T-091), from a density of 312 rectangles of total mass 7599999/100000<76, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 224/25 this case reported, by 0.005. It supersedes the source’s mixed_n76_L896. sqverify-fast, this repository’s clean-room verifier, decided it here on 5 October 2026 at all 201 net directions, so it is also the verified lower bound: confirmed, independently re-implemented. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-10-03. Hosono’s mixed-certificate source reports the mixed certificate mixed_n76_L896 at side 224/25=8.96 (T-082), since superseded (T-091), from a density of 341 rectangles of total mass 7599999/100000<76, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 447/50 this case reported, by 0.02, and supersedes the source’s mixed_n76_L894. sqverify-fast, this repository’s clean-room verifier, decided it here on 6 October 2026 at all 201 net directions: confirmed, independently re-implemented. The verified lower bound is unchanged, the certificate above being higher. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-10-02. Hosono’s mixed-certificate source reports s(76)≥447/50=8.94 (T-072), since superseded (T-091), from a density of 317 rectangles of total mass 7599999/100000<76, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It supersedes the rectangle certificate of the 2026-10-01 intake below. Its complete replay here on 2 October 2026, of the source’s unchanged checker on the pinned bundle, returned the certificate’s own record at all 201 directions, so it is also the verified lower bound. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-10-01. Hosono’s rectangle-density source reports a direct 357/40=8.925 certificate for this case, whose reported bound the 2026-10-02 intake above raises, with total mass 7599/100=75.99<76, accepted by Tokoharu’s unchanged interval checker. The replayed n75 certificate carried 889/100=8.89 here by monotonicity, the verified lower bound until the 2026-10-02 intake above. 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 223/25=8.92 certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass 7599/100=75.99<76, 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 89/10=8.9 certificate for this case, whose reported bound the 2026-09-28 intake above raises, with total mass 7599/100=75.99<76, 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.

Open. The best known packing gives s(76)≤9, and the verified lower bound is s(76)≥1793/200=8.965, from Hosono’s mixed rectangle-density certificate of 4 October, leaving a gap of 0.035.

The packing

The record catalogue does not picture n=76: no arrangement has ever been found that beats the trivial ⌈76⌉=9 grid, so the grid is still the best known packing. That is a statement about what has been searched, not a proof.

The lower bound

The verified field rests on a complete decision here (E-n076-wand125-mixed-8965-sqverify-fast-replay, V3/C3) of Hosono’s mixed certificate of 4 October by sqverify-fast, this repository’s clean-room measure verifier: all 201 net directions of the retained candidate on 5 October 2026, with two mutants scaled below coverage one refused. It shares no code with the source’s checker, so it decides coverage a second way with the same method; the source’s own checker was not run here.

The certificate that held the field before it, mixed_n76_L894, is a density of 317 uniform rectangles with no point mass, of total mass 7599999/100000<76, at core side 9977/10000 on 201 net half-angles of step 83/40000, such that the shrunken core of every rotated unit square at each net direction captures mass at least 1. The source’s research copy of Tokoharu’s interval checker, which accepts coverage at least 1, decides the oblique directions, and exact integer tables the axis direction.

Until 5 October 2026 the verified field rested on a complete replay here (E-n076-wand125-mixed-894-source-replay, V3/C3): the pinned bundle fetched and checked by digest, and all 201 directions replayed with the source’s unchanged checker and per-angle functions on 2 October, each returning the certificate’s own record (3.64 CPU-hours). It runs the source’s own algorithm, so it confirms the source’s run rather than deciding coverage a second way. The checker refuses two mutated copies of the source’s n=37 certificate of the same kind, and the review of 2 October found no defect in this one.

Earlier lower bounds

Hosono’s n75 rectangle-density certificate, replayed here, gave s(76)≥889/100=8.89 by monotonicity, which was the verified lower bound until 2 October 2026. Before 2026 it was Nagamochi’s general closed form, now a reported bound (see the correction below). Karakuş’s general bound, independently verified here and below this certificate at this n, 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.

See the Frontier corpus summary for the current aggregate count; source-reported bounds are recorded separately.

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-n076-wand125-mixed-8965-sqverify-fast-replay replayed here independent V-sqverify-fast (first-party)
verified upper E-basic-grid-upper replayed here independent V-check-basic-bounds (first-party)