n = 76 open ★=
Proven
- new result
- exact
Citation record n-076
lowerwand125 after Tokoharu, Levy et al. 2026, GitHub (confirmed T-091)
Open
- optimality
Bounds
- Proved by
- wand125 2026
- Kind
- counting
- Scope
- Unrestricted unit-square packing with independent rotations and disjoint interiors.
- Note
- wand125's square-packing-bounds (4 October 2026) reports from a density of 312 uniform rectangles of total mass 7599999/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 224/25 this case reported, from the source's mixed_n76_L896 (T-082). sqverify-fast decided it here on 5 October 2026 at all 201 net directions.
- Source
- [wand125 mixed bounds evening 2026-10-04]
- Evidence
E-n076-wand125-mixed-8965-report
The reported value, verified here.
= 0.035
Verified upper minus verified lower.
Results in the register
T-007 V0 C1 Nagamochi · 2026-08-31 · 321 cases
for
T-045 V3 C3 wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-09-29 · 15 cases
Rectangle-density lower bounds replayed at 15 counts in
T-046 V0 C0 wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-09-29 · 48 cases
Rectangle-density lower bounds reported for 48 counts in
T-058 V3 C3 wand125 after Tokoharu, Daniel · 2026-09-29 · 100 cases
Rectangle-certificate ceiling
α·UB(n)proved for ..100;B·UB(n)on 64 grid rowsT-068 V3 C3 wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-01 · 34 cases
Rectangle-density lower bounds verified at 34 counts in
T-072 V3 C3 wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-02 · n = 76
Mixed rectangle-measure lower bound replayed at
Claim and records
- Claim
- = 8.94, by a rectangle density of wand125/square-packing-bounds checked at coverage one, published on 2 October 2026.
The certificate is a density of 317 uniform rectangles with no point mass, of total mass 7599999/100000, at core side 9977/10000 on 201 net half-angles of step 83/40000, such that the shrunken core of every rotated unit square at each net direction captures mass at least one. The source reports it accepted at every oblique net angle by code/mixed_rotated_verify.cpp, the research copy of Tokoharu's verify.cpp that its certificate (T-048) and the certificates of T-069 and T-071 use, which accepts coverage at least 1 where Tokoharu's requires 10001/10000, and at angle zero by exact integer tables. The least oblique lower bound it records is 1.00000000051.
The value exceeds the source's rectangle certificate at this count, 357/40 = 8.925 (T-068), which it says it supersedes, and Nagamochi's 1 + sqrt(61) = 8.8102....
Here the exact premises were recomputed from the retained bytes, and the certificate passed a complete replay on 2 October 2026 of the source's unchanged checker and per-angle functions on the 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#282. The source says parts of the work were produced with AI assistance under human direction. - Composition
- One claim on one certificate. E-n076-wand125-mixed-894-source-replay replays it in full with the source's own checker: one interval-certified method, replayed here, C3. Coverage is decided by the source's C++ checker alone, and the axis tables are a second implementation for one direction and not a second method.
- Next rung
- V4 and C4 need two adversarial AI reviews by distinct reviewers and a human oversight record; one adversarial review is retained. A second machine method would be a method-distinct decision of rotated coverage; the replay here runs the source's own checker. The checker's controls were made on the certificate of the same kind; a control on this certificate, devtools.audit_wand125_point_and_mixed mixed-control n76, would bind them to this measure as well.
- Significance
- Raised the verified lower bound at by 0.05, over wand125's rectangle certificate by monotonicity (T-045), by the certificate kind of T-048, T-069 and T-071: a further size from one generator, a substantive case result at S3. The 2 October review of the certificate confirmed the draft.
- Novelty
- previously-published Present in an identified source
- Records
T-082 V3 C3 wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-03 · 22 cases
Mixed rectangle-measure lower bounds verified at 22 counts in
T-083 V3 C3 Karakuş · 2026-10-02 · 301 cases
for every nonsquare
T-085 V3 C3 Karakuş; chelokot · 2026-10-02 · 315 cases
Nagamochi 2005, Lemma 1 is false for every container with and
T-091 V3 C3 wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-05 · 17 cases
Mixed rectangle-measure lower bounds verified at 17 counts in
upper: replayed here; lower: replayed here
—
not rigid, numerically checked, numerical multiprecision
Evidence: E-translation-escape-not-rigid
Scope
Square 67 of the retained witness (witness id 68) translates 1 along (0, 1) with the packing still valid, so the configuration admits a non-trivial feasible motion; 6 of its 76 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.
14 evidence entries
E-n076-wand125-mixed-8965-sqverify-fast-replay, E-n076-wand125-mixed-896-sqverify-fast-replay, E-n076-wand125-mixed-894-source-replay, E-n076-wand125-mixed-894-report, E-n076-wand125-rect-8925-sqverify-fast-replay, E-wand125-rectangle-source-replay, E-wand125-rectangle-2026-10-01-report, E-wand125-rectangle-2026-09-28-report, E-wand125-rectangle-report, E-kingbird-upper-register, E-nagamochi-lower, E-basic-grid-upper, E-karakus-strip-lower, E-nagamochi-lemma1-counterexample
- [wand125 mixed bounds evening 2026-10-04] lower bound proof
- [wand125 mixed bounds 2026-10-03] lower bound proof
- [wand125 mixed bounds n76 2026-10-02] lower bound proof
- [wand125 rectangle bounds 2026-10-01] lower bound proof
- [wand125 rectangle bounds 2026-09-28] lower bound proof
- [wand125 rectangle bounds 2026] lower bound proof
- [Kingbird] record catalogue
- [Nagamochi 2005] lower bound proof
- [Friedman DS7] survey
- [Karakuş 2026] lower bound proof
— open
External intake, 2026-10-05. wand125’s
mixed-certificate source
reports (T-091), from a density of 312 rectangles of total
mass , accepted there at every net angle by its research copy of
Tokoharu’s checker at threshold one.
It is above the this case reported, by . It supersedes the source’s
mixed_n76_L896. sqverify-fast, this repository’s clean-room verifier, decided it here
on 5 October 2026 at all 201 net directions, so it is also the verified lower bound:
confirmed, independently re-implemented.
wand125’s README says parts of the work were produced with AI assistance under human
direction.
External intake, 2026-10-03. wand125’s
mixed-certificate source
reports the mixed certificate mixed_n76_L896 at side (T-082), since
superseded (T-091), from a density of 341 rectangles of total mass
, accepted there at every net angle by its research copy of
Tokoharu’s checker at threshold one.
It is above the this case reported, by , and supersedes the source’s
mixed_n76_L894. 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.
wand125’s README says parts of the work were produced with AI assistance under human
direction.
External intake, 2026-10-02. wand125’s mixed-certificate source reports (T-072), since superseded (T-091), from a density of 317 rectangles of total mass , accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It supersedes the rectangle certificate of the 2026-10-01 intake below. Its complete replay here on 2 October 2026, of the source’s unchanged checker on the pinned bundle, returned the certificate’s own record at all 201 directions, so it is also the verified lower bound. wand125’s README says parts of the work were produced with AI assistance under human direction.
External intake, 2026-10-01. wand125’s rectangle-density source reports a direct certificate for this case, whose reported bound the 2026-10-02 intake above raises, with total mass , accepted by Tokoharu’s unchanged interval checker. The replayed n75 certificate carried here by monotonicity, the verified lower bound until the 2026-10-02 intake above. wand125’s README says parts of the work were produced with AI assistance under human direction.
External intake, 2026-09-28. wand125’s rectangle-density source reports a direct certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass , 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. wand125’s README says parts of the work were produced with AI assistance under human direction.
External intake, 2026-09-27. wand125’s rectangle-density source reports a direct certificate for this case, whose reported bound the 2026-09-28 intake above raises, with total mass , 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 , and the verified lower bound is , from wand125’s mixed rectangle-density certificate of 4 October, leaving a gap of .
The packing
The record catalogue does not picture : no arrangement has ever been found that beats the trivial 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-n076-wand125-mixed-8965-sqverify-fast-replay, V3/C3) of
wand125’s mixed certificate of 4 October by sqverify-fast, this repository’s clean-room
measure verifier: all 201 net directions of the retained candidate on 5 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.
The certificate that held the field before it,
mixed_n76_L894, is a
density of 317 uniform rectangles with no point mass, of total mass
, at core side on 201 net half-angles of step
, such that the shrunken core of every rotated unit square at each net
direction captures mass at least . The source’s research copy of Tokoharu’s interval
checker, which accepts coverage at least , decides the oblique directions, and exact
integer tables the axis direction.
Until 5 October 2026 the verified field rested on a complete replay here
(E-n076-wand125-mixed-894-source-replay, V3/C3): the pinned bundle
fetched and checked by digest, and all 201 directions replayed with the source’s
unchanged checker and per-angle functions on 2 October, each returning the certificate’s
own record (3.64 CPU-hours).
It runs the source’s own algorithm, so it confirms the source’s run rather than deciding
coverage a second way.
The checker refuses two mutated copies of the source’s certificate of the same
kind, and the
review
of 2 October found no defect in this one.
Earlier lower bounds
wand125’s n75 rectangle-density certificate, replayed here, gave by monotonicity, which was the verified lower bound until 2 October 2026. Before 2026 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 , applies to every nonsquare :
Correction, 2 October 2026. Until that date the verified lower bound here was Nagamochi’s general closed form, , which is stronger at this 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-n076-wand125-mixed-8965-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) |