\(s (41)\)$s(41)$ — open

Exact certificate, 2026-10-06. Evan Daniel’s square-packing published on 5 October 2026 an exact rational certificate of this packing, decided here over \(\mathbb{Q}\)$\mathbb{Q}$ by two exact checkers that share no code with each other or with the source, and by the source’s own two run here: it proves \(s(41) \le 6.92669309446881\)$s(41)\le 6.92669309446881$, the verified upper bound (T-101). Until then the verified upper bound was the trivial grid bound \(7\)$7$.

External intake, 2026-10-06. wand125’s check2 source reports \(s(41) \ge 271/40 = 6.775\)$s(41)\ge 271/40=6.775$ (T-111), from a density of 376 rectangles of total mass \(4099999/100000 < 41\)$4099999/100000<41$, on a net the certificate declares: core side \(999/1000\)$999/1000$ and 416 half-angle tangents of step \(1/1001\)$1/1001$. Since \(999/1000 \cdot (1 + 1/1001) < 1\)$999/1000·(1+1/1001)<1$, every unit square contains a core at a net angle strictly in its interior. The source ships no record of its C++ checker for it: it accepts it at every direction with its copy of this repository’s sqverify_fast, changed to read a declared net. It is above the reported \(169/25\)$169/25$ (T-068) by \(0.015\)$0.015$. This repository’s clean-room verifier sqverify-fast decided it here on 6 October 2026 at all 416 directions of its net, and refused two mutants scaled below coverage one: confirmed, re-implemented sharing the producer’s components (the source’s check is a copy of the same crate), 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 \(s (41) \ge 169 / 25 = 6.76\)$s(41)\ge 169/25=6.76$, since superseded (T-111), with total mass \(4099/100 = 40.99 < 41\)$4099/100=40.99<41$, accepted by Tokoharu’s unchanged interval checker. The complete 201-direction coverage replay here accepted it again, after this repository’s exact audit checked that the regenerated checker input is the published one and checked the mass and net premises, so it was also verified until 2026-10-06, when the certificate above superseded it in both lanes. 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 \(1351/200 = 6.755\)$1351/200=6.755$ certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass \(4099/100 = 40.99 < 41\)$4099/100=40.99<41$, 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 \(1349/200 = 6.745\)$1349/200=6.745$ certificate for this case, whose reported bound the 2026-09-28 intake above raises, with total mass \(4099/100 = 40.99 < 41\)$4099/100=40.99<41$, 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.

External intake, 2026-09-22. wand125’s retained source reports \(s (40) \ge 13 / 2 = 6.5\)$s(40)\ge 13/2=6.5$ and identifies the monotone consequence at \(n = 41\)$n=41$. The complete exact n40 replay verifies the source premise, so monotonicity verifies the n41 bound.

Open. The best known packing gives \(s(41) \le 6.92669310\)$s(41)\le 6.92669310$, and the verified lower bound is \(s(41) \ge 271/40 = 6.775\)$s(41)\ge 271/40=6.775$, from wand125’s check2 certificate on a declared net (T-111, 2026-10-06, V3/C3), which superseded its rectangle-density certificate of 1 October at \(169/25 = 6.76\)$169/25=6.76$ (T-074), leaving a gap of about \(0.1517\)$0.1517$.

The exact certificate

Evan Daniel’s square-packing published on 5 October 2026 exact rational certificates of the packings this register lists as best known, solved from its own witnesses, and offered those that do not lower a printed side as a replay of the existing bounds, asking for nothing to be registered from them. The certificate for this count holds the same 41 squares, each a rational centre and a rational \(t = \tan(\theta/2)\)$t=\tan (\theta /2)$, in a square of side \(6.9266930944688022317\ldots\)$6.9266930944688022317\dots$, \(2.2 \times 10^{-15}\)$2.2\times {10}^{-15}$ above the side the Kingbird catalogue prints, \(6.92669309446880\)$6.92669309446880$. Square for square, its pose lies within \(1.5 \times 10^{-4}\)$1.5\times {10}^{-4}$ of the binary64 pose the atlas pictures for this count. 2 squares move by more than \(1 \times 10^{-8}\)$1\times {10}^{-8}$, all of them squares the source lists as carrying no force; every other square’s centre rounds to the witness’s. Evan Daniel’s solver moves the binary64 pose to a nearby exact KKT point of the problem of minimizing the side under non-overlap, computed at 80 digits, and rounds it outward to rationals.

This repository decides the certificate exactly. Converted without rounding, every pair and every wall is decided over \(\mathbb{Q}\)$\mathbb{Q}$ twice, by sqpack’s exact separating-axis test and by an independent checker that shares no code with it, and the source’s own two checkers, run here as retained, accept it as well (receipts). That proves \(s(41) \le 6.92669309446881\)$s(41)\le 6.92669309446881$, the verified upper bound: the certificate’s side rounded up at the fourteen decimals the catalogue prints, as the record writes any certificate of a printed side. It says nothing about optimality. On jlevy/squares#375 its author wrote that the solver, its checkers and the batch “were written with Claude (Anthropic) as a coding and research agent, directed and reviewed by me.”

The verified upper bound and the printed side now agree to one unit of the printed side’s last place, the precision at which the record compares them. The printed side itself is not certified here: the certificate’s side lies above it.

The packing

Found by Thomas Schadt in 2025, via simulated annealing. Its side length is algebraic of degree 42 over \(\mathbb{Q}\)$\mathbb{Q}$.

The lower bound

The verified lower bound is \(271/40 = 6.775\)$271/40=6.775$, from wand125’s check2 certificate of 6 October on a declared net (T-111), decided here by sqverify-fast at every direction of its net. Before it, \(169/25 = 6.76\)$169/25=6.76$, from its own n41 rectangle-density certificate of 1 October, replayed in full here (T-074); its certificate of 28 September, \(1351/200 = 6.755\)$1351/200=6.755$ (T-070), held the field earlier on 2 October. Until then it was \(13/2\)$13/2$: the complete n40 exact replay verifies that bound, and deleting one square from any hypothetical packing proves it for n41 too. A second interval implementation or generalized native importer would add confirmation and reuse, but it is not a missing premise of either bound.

Corrected 2 October 2026: Nagamochi’s Lemma 1 is false (Karakuş 2026), so his closed form below is now a reported bound whose published proof is incomplete (review). This register had recorded that proof as verified, its own error, logged as defect D-516. Nagamochi’s earlier general closed form remains part of the evidence history and applies to every \(N \ge 4\)$N\ge 4$:

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.