T-103: Mixed rectangle-measure lower bound verified at n=19, on the finest declared net yet

V3 C3 lower bound confirmed

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

A rectangle density of wand125/square-packing-bounds, checked at coverage one on a net it declares and published on 6 October 2026, proves s(19)≥193/40 = 4.825.

The certificate is a density of 341 uniform rectangles in D4 orbits, and no point mass, of total mass 1899999/100000, on a net it declares itself, finer than any it declared before: core side 4999/5000 and 2073 half-angle tangents of step 1/5002. Since 4999/5000 (1 + 1/5002) = 25009997/25010000 < 1, and the last tangent 1036/2501 is past tan(pi/8), every unit square contains a concentric core at a net angle strictly in its interior.

The source reports every such core capturing mass at least one at all 2073 directions, by sqverify-proof-net, its copy of this repository's sqverify_fast changed to read the declared net, and ships no record of its C++ checker for this certificate.

The value is above the 48229/10000 = 4.8229 of T-100, the source's earlier certificate and the reported and verified lower bound at n=19 before it, by 0.0021, and supersedes it.

The certificate was decided here on 6 October 2026 by sqverify-fast, this repository's clean-room measure verifier, at all 2073 directions of the net the candidate declares, and two mutants scaled below coverage one were refused: confirmed, re-implemented sharing the producer's components. The source's check is a copy of the same crate with one change, so the two share the sqverify_fast crate; their records agree direction by direction, and their agreement is not a second implementation. The source's C++ checker, the producer's own code but sharing none with the crate, verified the candidate here at threshold one at nodes 1021 and 2072, the least-bound node of the source's run among them, and was not run in full: samples that decide those nodes only.

wand125 after Tokoharu and Levy, square-packing-bounds. No registration was requested: an intake pass of the source found it. 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=19, by 0.0021 above T-100, and the strongest reported. The certificate kind of T-099 on a declared net, checked at the source by a copy of this repository's verifier rather than its C++ checker; no new technique, at S3 as T-096, T-099 and T-100 are.
Composition
One primary certificate on its reported entry and its replay entry. The replay is sqverify-fast at all 2073 directions of the net the retained candidate declares: one interval-certified method, replayed here by an implementation that shares the producer's components, C3, on the census route, whose conditions for a declared net this certificate meets. The source's own check is a copy of the same crate, and its C++ checker was run here at sampled directions only, so no second implementation and no second method 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. A complete run of the source's C++ checker over all 2073 directions (devtools.audit_wand125_declared_net cpp-sample, about 97 CPU-hours at the samples' rate) would add a check that shares no code with sqverify_fast beside the rung, though it is the producer's own code.
Novelty
previously-published Present in an identified source

The case

Case record

n=19

4.824.886
456
4.3595.359
nn+1

Proven

4.82500≤s(19)≤4.885619

  • exact

Citation record n-019

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

upperWainwright 1979, Squares in Squares

Open

  • optimality

The case record

LowerUpper
Gap423−7340≈ 0.06061808…

Results on the case

13 results in the register on n=19, 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-103

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-08-21 published T-016

    s(n)≥22529/5000 for n=18,19, by monotonicity from T-015

    V3 C3 lower bound confirmed superseded by T-103

    Massaccesi after Burns · Burns–Massaccesi n17 · packet · register

  3. 2026-09-04 established T-019

    s(n)≥459/100=4.59 for n=17,18,19

    V3 C3 lower bound confirmed superseded by T-103

    Levy after Burns, Massaccesi · register

  4. 2026-09-04 established T-020

    s(n)≥24/5=4.80 for n=19,20,21

    V3 C3 lower bound confirmed superseded by T-103

    Levy after Burns, Massaccesi · register

  5. 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

  6. 2026-09-27 published T-045

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

    V3 C3 lower bound confirmed superseded by T-103

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

  7. 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-103

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

  8. 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

  9. 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-103

    Karakuş · Karakuş 2026 · source · register

  10. 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-103

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

  11. 2026-10-01 published T-074

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

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

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

  12. 2026-10-06 published T-100

    Mixed rectangle-measure lower bound verified at n=19, past the best 18-square packing

    V3 C3 lower bound confirmed superseded by T-103

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

  13. 2026-10-06 published T-103 this result

    Mixed rectangle-measure lower bound verified at n=19, on the finest declared net yet

    V3 C3 lower bound confirmed

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