\(s (86)\)$s(86)$ — open

External intake, 2026-10-05. wand125’s mixed-certificate source reports \(s(86) \ge 9503/1000 = 9.503\)$s(86)\ge 9503/1000=9.503$ (T-090), from a density of 533 rectangles of total mass \(8599999/100000 < 86\)$8599999/100000<86$, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the \(19/2\)$19/2$ this case reported, by \(0.003\)$0.003$. It supersedes the source’s mixed_n86_L950. sqverify-fast, this repository’s clean-room verifier, decided it here on 6 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_n86_L950 at side \(19/2 = 9.5\)$19/2=9.5$ (T-082), since superseded (T-090), from a density of 509 rectangles of total mass \(8599999/100000 < 86\)$8599999/100000<86$, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the \(473/50\)$473/50$ this case reported, by \(0.04\)$0.04$. 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.

Reported from \(n = 85\)$n=85$, 2026-10-02 (afternoon). wand125’s mixed-certificate source reports \(s(85) \ge 473/50 = 9.46\)$s(85)\ge 473/50=9.46$ (T-075), from a density of total mass \(8499999/100000 < 86\)$8499999/100000<86$. It is above this count’s own certificates, and a packing of 86 squares contains one of 85, so it gave \(s(86) \ge 473/50 = 9.46\)$s(86)\ge 473/50=9.46$ by monotonicity, the reported lower bound until the intakes above. Its complete replay here on 2 October 2026 returned the certificate’s own record at all 201 directions, so it was also the verified lower bound here until 6 October. wand125’s README says parts of the work were produced with AI assistance under human direction.

Verified from \(n = 85\)$n=85$, 2026-10-02. wand125’s \(s(85) \ge 471/50 = 9.42\)$s(85)\ge 471/50=9.42$ (T-071) is above this count’s own certificate, and a packing of 86 squares contains one of 85, so it bounds this case as well. Its complete replay passed here on 2 October, so it carried \(471/50 = 9.42\)$471/50=9.42$ here as the verified lower bound until the afternoon intake above. Until the afternoon intake above, the reported field kept this count’s own certificate, which is lower.

External intake, 2026-10-01. wand125’s rectangle-density source reports a direct \(1873/200 = 9.365\)$1873/200=9.365$ certificate for this case, whose reported bound the \(n = 85\)$n=85$ certificate above raises, with total mass \(8599/100 = 85.99 < 86\)$8599/100=85.99<86$, 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-28. wand125’s rectangle-density source reports a direct \(1871/200 = 9.355\)$1871/200=9.355$ certificate for this case, whose reported bound the 2026-10-01 intake above raises, with total mass \(8599/100 = 85.99 < 86\)$8599/100=85.99<86$, 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.

Open. The best known packing gives \(s(86) \le 9.82287566\)$s(86)\le 9.82287566$, and the verified lower bound is \(s(86) \ge 9503/1000 = 9.503\)$s(86)\ge 9503/1000=9.503$, from wand125’s mixed rectangle-density certificate of 4 October (T-090), leaving a gap of \(0.3199\)$0.3199$.

The packing

Friedman’s 1997 generalisation of the \(n = 18\)$n=18$ packing, at the same DS7-named tilt, for which the survey states the angle but no generating rule. cases/lifted_q7 lifts the retained witness’s every coordinate into Q(sqrt 7) at small height — the repository’s first exact verification outside Q(sqrt 2) — and verifies the lifted pose exactly, which is what moved verified_upper_bound from the grid ceiling onto the published exact side. The lift is a candidate generator and the exact verifier is the proof (D-398, and the operation D-402 does not foreclose).

The lower bound

The verified field rests on a complete decision here (E-n086-wand125-mixed-9503-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 6 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 6 October 2026 the verified field rested on the complete replay here of wand125’s mixed certificate for 85 squares (E-n085-wand125-mixed-946-source-replay, V3/C3): all 201 directions on 2 October 2026, each returning the certificate’s own record. Its mass, \(8499999/100000\)$8499999/100000$, is below 86, so a packing of 86 at a side below \(473/50\)$473/50$ would capture at least 86 from it.

From the morning of 2 October 2026 until that replay the verified lower bound was \(471/50\)$471/50$, by the replay of the source’s earlier \(n = 85\)$n=85$ certificate (E-n085-wand125-mixed-942-source-replay).

Before the replayed rectangle certificate of 28 September, which held it until 2 October 2026, the verified lower bound was Nagamochi’s general closed form, now a reported bound (see the correction below). Karakuş’s general bound, independently verified here and below these certificates at this \(n\)$n$, applies to every nonsquare \(N \ge 8\)$N\ge 8$:

Correction, 2 October 2026. Until that date the verified lower bound here was Nagamochi’s general closed form, \(s(N) \ge \min(\lceil\sqrt{N}\rceil, \sqrt{N - 2\lfloor\sqrt{N}\rfloor + 1} + 1)\)$s(N)\ge min(\lceil \sqrt{N}\rceil ,\sqrt{N-2\lfloor \sqrt{N}\rfloor +1}+1)$, which is stronger at this \(n\)$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, 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.