T-076: Linear-measure lower bound replayed at n=82

V3 C3 lower bound confirmed

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

A measure of points, segments and rectangles that wand125/square-packing-bounds published on 2 October 2026 proves s(82)≥233/25 = 9.32. The measure is of the kind and checker of T-073: point masses, segments of uniform density and rectangles of uniform density, in D4 orbits with exact rational geometry, of total mass 82 - 1/100000, at core side 9977/10000 on 201 net half-angles of step 83/40000, with 86 point, 222 segment and 774 rectangle orbits. They are those of T-073's n=83 certificate, every coordinate scaled by exactly 932/935, with the masses solved again.

The source reports it accepted at all 201 net angles, the axis included, by code/unified_linear_verify.cpp, byte for byte the verifier of T-073, in 153,579,479 nodes, and says the full replay was run again from the published tarball by the same implementation. The value exceeds Green's reported 2 sqrt(2) + (247 + 12 sqrt(2))/41 = 9.2667335..., the value this record reported at n=82, by 0.0532664..., and does not rest on Green's argument, which jlevy/squares#308 reports the published material does not establish for k >= 4. Its mass is below 83, where T-075's 937/100 is higher.

It passed a complete replay here on 3 October 2026 of the source's unchanged checker and replay functions on its 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.

wand125 after Tokoharu and Levy, square-packing-bounds. Registration was requested in a comment of 2 October 2026 on jlevy/squares#294. The source says parts of the work were produced with AI assistance under human direction.

Significance, composition and next rung
Significance
Raised the verified lower bound at n=82 from Nagamochi's closed form past Green's reported value, the one count from 82 to 85 where the record still reported Green's value, by a certificate of T-073's kind that does not rest on Green's argument. A further size from one generator and checker, at S3 as T-073 is; the 2 October review of the afternoon certificates proposed S3, which the replay leaves standing. Nagamochi's closed form has been a reported bound since Karakuş's finding (T-085, merged 2026-10-03); on the merged record the verified floor this replay raised at n=82 was Karakuş's general bound (T-083), lower still.
Composition
One claim from one certificate, on its reported entry and its replay entry. The replay runs the source's C++ checker unchanged: one interval-certified method, replayed here, C3. Coverage is decided by that checker alone, which the 2 October review of the linear certificates read function by function.
Next rung
V4 and C4 need two adversarial AI reviews by distinct reviewers and a human oversight record; the review of these certificates was the retaining lane's own, and the checker's separately prompted review is T-073's. A second machine method would be a method-distinct decision of rotated coverage for a linear measure; the replay here runs the source's own checker. linear-control n82 would put a negative control on this certificate itself; the checker's controls are n=101's.
Novelty
previously-published Present in an identified source

The case

Case record

n=82

9.329.536
91011
9.05510.055
nn+1

Proven

9.32000≤s(82)≤9.535534

  • exact

Citation record n-082

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

upperGöbel 1979, Squares in Squares

Open

  • optimality

The case record

LowerUpper
Gap522−8325≈ 0.21553390…

Results on the case

5 results in the register on n=82, 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-076

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

  4. 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-076

    Karakuş · Karakuş 2026 · source · register

  5. 2026-10-02 published T-076 this result

    Linear-measure lower bound replayed at n=82

    V3 C3 lower bound confirmed

    wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 linear n82 2026-10-02 · packet · source · review · register