n = 73 open ★=

88131000≤s(73)≤9

The best packing known for 73 squares, side 9,
8.8139
8910
8.5449.544
nn+1

Proven

8.813000≤s(73)≤9

  • new result
  • exact

Citation record n-073

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

Open

  • optimality

Bounds

Best known packing

9

Construction
grid
Tilt angles
0∘
Source
[Kingbird]
Evidence
E-kingbird-upper-register
Verified upper bound

9

The reported value, verified here.

Evidence
E-basic-grid-upper
Reported lower bound

88131000

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 s(73)≥8813/1000 from a density of 462 uniform rectangles of total mass 7299999/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 8809/1000 this case reported, from the source's mixed_n73_L8809 (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-n073-wand125-mixed-8813-report
Verified lower bound

88131000

The reported value, verified here.

Evidence
E-n073-wand125-mixed-8813-sqverify-fast-replay
Gap

1871000= 0.187

Verified upper minus verified lower.

Results in the register

Verification

upper: replayed here; lower: replayed here

—

Rigidity

not rigid, numerically checked, numerical multiprecision

Evidence: E-translation-escape-not-rigid

Scope

Square 64 of the retained witness (witness id 65) translates 1 along (0, 1) with the packing still valid, so the configuration admits a non-trivial feasible motion; 9 of its 73 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.

s(73) — open

External intake, 2026-10-05. wand125’s mixed-certificate source reports s(73)≥8813/1000=8.813 (T-091), from a density of 462 rectangles of total mass 7299999/100000<73, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 8809/1000 this case reported, by 0.004. It supersedes the source’s mixed_n73_L8809. 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_n73_L8809 at side 8809/1000=8.809 (T-082), since superseded (T-091), from a density of 450 rectangles of total mass 7299999/100000<73, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 439/50 this case reported, by 0.029. 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-01. wand125’s rectangle-density source reports the rectangle certificate rect_n73_L878 at side 439/50=8.78, since superseded (T-082), with total mass 7299/100=72.99<73, accepted by Tokoharu’s unchanged interval checker. The replayed n71 certificate carries s(73)≥1737/200=8.685 here by monotonicity, which was the verified lower bound until 5 October. 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 the rectangle certificate rect_n73_L878 at side 439/50=8.78, since superseded (T-082),, with total mass 7299/100=72.99<73, 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 437/50=8.74 certificate for this case, whose reported bound the 2026-09-28 intake above raises, with total mass 7299/100=72.99<73, 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(73)≤9, and the verified lower bound is s(73)≥8813/1000=8.813, from wand125’s mixed rectangle-density certificate of 4 October, leaving a gap of 0.187.

The packing

The record catalogue does not picture n=73: no arrangement has ever been found that beats the trivial ⌈73⌉=9 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-n073-wand125-mixed-8813-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. Until this decision the verified lower bound was 1737/200 (E-wand125-rectangle-2026-09-28-source-replay).

From 2 October until that decision the verified lower bound was wand125’s replayed rectangle-density certificate for 71 squares, carried here by monotonicity (T-070). It superseded wand125’s exact weighted point certificate for n=72, replayed here in full (T-044) and carried to n=73 the same way: deleting one square from a packing of 73 leaves a packing of 72, so s(73)≥s(72)≥861/100=8.61, which was the strongest registered bound once Nagamochi’s formula left the verified lane. Karakuş’s general bound gives only 8.577747 here.

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 (review of 2 October 2026). This register had recorded that proof as verified, its own error, logged as defect D-516. Nagamochi’s value had masked the registered bound above. The review’s text would put Karakuş’s weaker bound here; the record keeps the strongest registered verified bound instead.

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-n073-wand125-mixed-8813-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)