Case record
The best packing known for 66 squares, side 3+42, Stenlund 1980. Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, Stenlund 1980 [Kingbird]

n=66

=open

843100≤s(66)≤3+42

8.438.657
8910
8.1249.124
nn+1

Proven

8.43000≤s(66)≤8.656855

  • exact

Citation record n-066

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

upperStenlund 1980, Squares in Squares

Open

  • optimality

Bounds

Best known packing

3+42

8.65685424949238
Found by
Stenlund 1980
Construction
hand
Source
[Kingbird]
Evidence
E-kingbird-upper-register, E-lifted-q2-upper
Verified upper bound

3+42

8.65685424949238019520675489683879

The reported value, verified here.

Evidence
E-lifted-q2-upper
Reported lower bound

843100

Proved by
Hosono 2026
Kind
counting
Scope
Unrestricted unit-square packing with independent rotations and disjoint interiors.
Note
Hosono's square-packing-bounds (5 October 2026) reports s(66)≥843/100 from a density of 713 uniform rectangles of total mass 6599999/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 421/50 of the source's mixed_n66_L842 (T-069), which it supersedes. sqverify-fast decided it here on 6 October 2026 at all 201 net directions.
Source
[wand125 mixed bounds finer net 2026-10-05]
Evidence
E-n066-wand125-mixed-843-report
Verified lower bound

843100

The reported value, verified here.

Evidence
E-n066-wand125-mixed-843-sqverify-fast-replay
Gap

42−543100≈ 0.22685424…

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-069 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-01 · 5 cases

    Mixed rectangle-measure lower bounds replayed at n=37,65,66,90,92

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

    Mixed rectangle-measure lower bound verified at n=66

    Claim and records
    Claim
    A rectangle density of wand125/square-packing-bounds, checked at coverage one and published on 5 October 2026, after those of T-094, proves s(66)≥843/100 = 8.43.

    The certificate is a density of 713 uniform rectangles in D4 orbits, and no point mass, of total mass 6599999/100000, at core side 9977/10000 on 201 net half-angles of step 83/40000, of the kind and checker of T-069 and later. The source reports it accepted at all 200 oblique net angles by code/mixed_rotated_verify.cpp, its research copy of Tokoharu's verify.cpp at coverage threshold one, and at the axis by exact integer tables. It supersedes the source's mixed_n66_L842 (T-069).

    The value is above T-069's 421/50 = 8.42, the reported and verified lower bound at n=66 before it, by 0.01. A packing of 67 squares contains one of 66, but at n=67 the record already holds more in both lanes (212/25), so it does not carry further.

    The certificate was decided here on 6 October 2026 by sqverify-fast, this repository's clean-room measure verifier, at all 201 net directions of the retained candidate, and two mutants scaled below coverage one were refused: confirmed, independently re-implemented. The verifier shares no code with the source's checker and runs the same net-and-shrink method, so it is a second implementation and not a second method. The source's own checker was replayed here at 12 of the 201 directions, each returning the certificate's own record, and not in full.

    Hosono after Tokoharu and Levy, square-packing-bounds. Registration was requested in a comment of 5 October 2026 on jlevy/squares#282. The source says parts of the work were produced with AI assistance under human direction.
    Significance
    The strongest verified lower bound on record at n=66, above the replayed mixed certificate that held it (T-069) by 0.01. A further size from the generator and checker of T-069 and later, with no new technique, at S3 as those are. The review of 5 October that read the certificate confirmed S3.
    Novelty
    previously-published Present in an identified source
    Records

    n = 66registerevidence 1evidence 2sourcereview

  • 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

Verification

upper: replayed here; lower: replayed here

—

Rigidity

not rigid, numerically checked, numerical multiprecision

Evidence: E-translation-escape-not-rigid

Scope

Square 4 of the retained witness (witness id 5) translates 0.025126 along (0.707107, -0.707107) with the packing still valid, so the configuration admits a non-trivial feasible motion; 27 of its 66 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: same-side exact re-solve (devtools.regularize_same_side). A drawing at the witness's own side: a pure regularization, which proves no new bound, so not a result; no registered result holds the packing.

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

s(66) — open

External intake, 2026-10-05. Hosono’s mixed-certificate source reports s(66)≥843/100=8.43 (T-097), from a density of 713 rectangles of total mass 6599999/100000<66, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the source’s 421/50 of 1 October, which was also the verified lower bound, by 0.01, and supersedes its mixed_n66_L842 (T-069). 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-01. Hosono’s mixed-certificate source reports s(66)≥421/50=8.42 (T-069), since superseded (T-097), from a density of 631 rectangles of total mass 6599999/100000<66, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. Its complete replay here on 2 October 2026 returned the certificate’s own record at all 201 directions, which made it the verified lower bound until 6 October. 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 67/8=8.375 certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass 6599/100=65.99<66, 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 1669/200=8.345 certificate for this case, whose reported bound the 2026-09-28 intake above raises, with total mass 6599/100=65.99<66, 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(66)≤8.65685425, and the verified lower bound is s(66)≥843/100=8.43, from Hosono’s mixed rectangle-density certificate of 5 October, leaving a gap of 0.2269.

The packing

Stenlund’s diagonal strip of width three (1980), for which the survey states no generating rule — only the figure. cases/lifted_q2 lifts the retained witness’s every coordinate into Q(sqrt 2) at small height and verifies the lifted pose exactly, which is what moved verified_upper_bound from the grid ceiling onto the published exact side. The lift is a candidate generator and the exact verifier is the proof; the certificate is the witness’s own geometry, made exact (D-398, and the operation D-402 does not foreclose).

The lower bound

The earlier external report, [Friedman DS7], gives the lower-bound expression 22+71/13 for s(66) (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=66 by monotonicity. Hosono’s rectangle-density certificate above has since replaced it in the reported field; the verified field now holds Hosono’s mixed certificate of 5 October. The source audit compares the exact theorem expressions separately from opaque table decimals.

The verified field rests on a complete decision here (E-n066-wand125-mixed-843-sqverify-fast-replay, V3/C3) of Hosono’s mixed certificate of 5 October 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 run here at 12 of the 201 directions, each returning the certificate’s record, and not in full.

From 2 October 2026 until this decision the verified lower bound was 421/50, from a complete replay here (E-n066-wand125-mixed-842-source-replay) of Hosono’s mixed certificate of 1 October: the source’s unchanged checker and per-angle functions on the pinned bundle, all 201 directions, each returning the certificate’s own record. Before that 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-n066-wand125-mixed-843-sqverify-fast-replay replayed here independent V-sqverify-fast (first-party)
verified upper E-lifted-q2-upper replayed here independent V-sqpack-verify (first-party)