T-097: Mixed rectangle-measure lower bound verified at n=66

V3 C3 lower bound confirmed

2026-10-05 published · wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · n=66

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.

wand125 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, composition and next rung
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.
Composition
One primary certificate on its reported entry and its replay entry. The replay is sqverify-fast at all 201 net directions of the retained candidate: one interval-certified method, replayed here by an independent implementation, C3, on the census route whose per-certificate conditions the review of 5 October of that route set and this certificate meets. The source's checker was replayed at 12 directions and its axis tables were not run here, so no second method and no complete reproduction with the producer's code stands beside it.
Next rung
V4 and C4 need two adversarial AI reviews of this result by distinct reviewers and a human oversight record. One is retained, the review of 5 October that read the certificate; the review of the census route that day read T-094's certificates and not this one. A complete replay of the source's own checker, devtools.audit_wand125_point_and_mixed mixed-replay n66-L843 over the 189 directions not yet replayed and mixed-merge (think-0fkt, about 14 CPU-hours), would add a reproduction with the producer's code beside the rung; a second machine method would be a method-distinct decision of rotated coverage.
Novelty
previously-published Present in an identified source

The case

Case record

n=66

8.438.657
8910
8.1249.124
nn+1

Proven

8.43000≤s(66)≤8.656855

  • exact

Citation record n-066

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

upperStenlund 1980, Squares in Squares

Open

  • optimality

The case record

LowerUpper
Gap42−543100≈ 0.22685424…

Results on the case

8 results in the register on n=66, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007

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

    V0 C1 lower bound incomplete on this case, superseded by T-097

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085

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

    V3 C3 correction confirmed

    Karakuş; chelokot · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  3. 2026-09-27 published T-046

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

    V0 C0 lower bound recorded superseded by T-097

    wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026 · wand125 rectangle bounds 2026-09-28 · packet · packet · register

  4. 2026-09-29 published T-058

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

    V3 C3 method limit confirmed

    wand125 after Tokoharu, Daniel · wand125 tools 2026 · packet · register

  5. 2026-09-29 published T-083

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

    V3 C3 lower bound confirmed on this case, superseded by T-097

    Karakuş · Karakuş 2026 · source · register

  6. 2026-10-01 published T-068

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

    V3 C3 lower bound confirmed on this case, superseded by T-097

    wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-10-01 · packet · source · review · register

  7. 2026-10-01 published T-069

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

    V3 C3 lower bound confirmed on this case, superseded by T-097

    wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 mixed bounds 2026-10-01 · packet · source · review · register

  8. 2026-10-05 published T-097 this result

    Mixed rectangle-measure lower bound verified at n=66

    V3 C3 lower bound confirmed

    wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 mixed bounds finer net 2026-10-05 · packet · source · review · register