Case record
The best packing known for 95 squares, side 10,

n=95

=open

1993200≤s(95)≤10

9.9610
91011
9.74710.747
nn+1

Proven

9.96500≤s(95)≤10

  • exact

Citation record n-095

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

Open

  • optimality

Bounds

Best known packing

10

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

10

The reported value, verified here.

Evidence
E-basic-grid-upper
Reported lower bound

1993200

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(95)≥1993/200 from a density of 480 uniform rectangles of total mass 9499999/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 249/25 this case reported, from the source's mixed_n95_L996 (T-082). sqverify-fast decided it here on 6 October 2026 at all 201 net directions.
Source
[wand125 mixed bounds 2026-10-04]
Evidence
E-n095-wand125-mixed-9965-report
Verified lower bound

1993200

The reported value, verified here.

Evidence
E-n095-wand125-mixed-9965-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-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-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-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-090 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=42…96

  • 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-191 V3 C1 Greff after Daniel, Hosono · 2026-10-15 · n = 95

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

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

    The cover is 48,352 weighted points and 11,438 axis-parallel segments of [0,10]^2 in Daniel's mixed format, total 3791753447/40000000 = 94.793836175 < 95, exactly D4-invariant. Every closed unit square in [0,10]^2 captures mass at least one, so a packing of 95 at side below 10, scaled up to side 10, would capture at least 95.

    The source reports the covering statement decided by two of Daniel's checkers: zmx2, in outward-rounded binary64, on 9,981 of the 10,000 root cells of the D4 region, and zm_mixed.py, in exact rationals, on the 304 cells that tile the other 19. 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 10,000 roots and zm_mixed.py over the 304 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/s95-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#610. The source's README states: "Greff directed the work. The search, LP and verification pipeline were built and run with Claude (Anthropic) as an AI assistant."
    Significance
    An exact value for a case that was open, by Daniel's recipe at a new count, as T-066 and T-184 settled s(59)=8 and s(76)=9: a substantive case result, not a new technique or a family. The third instance of the k^2 - 5 series does not make it a family: each cross is re-optimised by LP, and nothing carries to another k. The 16 October review confirmed the draft.
    Novelty
    previously-published Present in an identified source
    Records

    n = 95registerevidence 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 85 of the retained witness (witness id 86) translates 1 along (0, 1) with the packing still valid, so the configuration admits a non-trivial feasible motion; 6 of its 95 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(95) — open

Verified from n=94, 6 October 2026. Hosono’s s(94)≥199/20=9.95 (T-091), decided here by sqverify-fast at all 201 net directions, is above this count’s verified 49259/5000, and a packing of 95 squares contains one of 94, so it bounded this case as well: the verified lower bound until this count’s own certificate below was decided here later that day.

External intake, 2026-10-05. Hosono’s mixed-certificate source reports s(95)≥1993/200=9.965 (T-090), from a density of 480 rectangles of total mass 9499999/100000<95, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 249/25 this case reported, by 0.005. It supersedes the source’s mixed_n95_L996. sqverify-fast, this repository’s clean-room verifier, decided it here on 6 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_n95_L996 at side 249/25=9.96 (T-082), since superseded (T-090), from a density of 438 rectangles of total mass 9499999/100000<95, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 49259/5000 this case reported, by 0.1082. 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-01. Hosono’s rectangle-density source reports s(95)≥49259/5000=9.8518, since superseded (T-091), with total mass 9499/100=94.99<95, 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 49209/5000=9.8418 certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass 9499/100=94.99<95, 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.

Open. The best known packing gives s(95)≤10, and the verified lower bound is s(95)≥1993/200=9.965, from Hosono’s mixed rectangle-density certificate of 4 October for this count (T-090), leaving a gap of 0.035.

The packing

The record catalogue does not picture n=95: no arrangement has ever been found that beats the trivial ⌈95⌉=10 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-n095-wand125-mixed-9965-sqverify-fast-replay, V3/C3) of Hosono’s mixed certificate of 4 October for this count by sqverify-fast, this repository’s clean-room measure verifier: all 201 net directions of the retained candidate on 6 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.

Earlier on 6 October 2026 the verified field rested on a complete decision here (E-n094-wand125-mixed-995-sqverify-fast-replay, V3/C3) of Hosono’s mixed certificate of 4 October for 94 squares, whose mass, 9399999/100000, is below 95, by sqverify-fast, this repository’s clean-room measure verifier: all 201 net directions of the retained candidate on 6 October 2026, with two mutants scaled below coverage one refused. Before that the verified lower bound was 49259/5000 (E-wand125-rectangle-2026-10-01-source-replay).

Nagamochi’s general closed form, the verified lower bound before this certificate, is 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-n095-wand125-mixed-9965-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)