\(s (227)\)$s(227)$ — 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(227) \le 15.57106781186548\)$s(227)\le 15.57106781186548$, the verified upper bound (T-101). Until then the verified upper bound was the trivial grid bound \(16\)$16$.

Open. The best known packing gives \(s(227) \le 15.57106782\)$s(227)\le 15.57106782$, and the strongest lower bound independently verified here is \(15.068802\)$15.068802$ from Karakuş’s general theorem, leaving a gap of \(0.5023\)$0.5023$. General bound: s(N) >= 1/2 + sqrt(N - floor(sqrt(N)) + 1/4).

The verified upper bound is a ceiling

verified_upper_bound for this case is \(15.57106781186548\)$15.57106781186548$, proved by Evan Daniel’s exact rational certificate of this packing (E-evand-exact-ceilings-2026-10-05-exact-replay, T-101). It is larger than the best known \(15.57106781186547\)$15.57106781186547$ two fields above it, by \(1 \times 10^{-14}\)$1\times {10}^{-14}$.

It is not the value of \(s(227)\)$s(227)$ and not a different packing: it is the certificate’s own side, \(15.5710678118654752442\ldots\)$15.5710678118654752442\dots$, rounded up at the fourteen decimals the catalogue prints. The catalogue gives the packing’s side exactly, as \((17 / 2) + 5 \sqrt{2}\)$(17/2)+5\sqrt{2}$, and the certificate’s side lies \(1.6 \times 10^{-19}\)$1.6\times {10}^{-19}$ above that: its squares are rational and each is kept clear of its neighbours and the walls, so it bounds the exact side from above and does not reach it. That side is irrational, so no rational certificate reaches it. The mathematics blocker in the frontmatter records the difference. Read reported_upper_bound for the best known side length.

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 227 squares, each a rational centre and a rational \(t = \tan(\theta/2)\)$t=\tan (\theta /2)$, in a square of side \(15.5710678118654752442\ldots\)$15.5710678118654752442\dots$, \(5.2 \times 10^{-15}\)$5.2\times {10}^{-15}$ above the side the Kingbird catalogue prints, \(15.57106781186547\)$15.57106781186547$. 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. 3 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(227) \le 15.57106781186548\)$s(227)\le 15.57106781186548$, 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 packing

Found by David Ellsworth in 2025, via an unrecorded method.

The lower bound

The strongest lower bound independently verified in this record is Karakuş’s general bound, which 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.

Source-reported bounds are recorded separately from this independently verified theorem.

The reported lower-bound expression for \(s(227)\)$s(227)$ is \(7 \sqrt{30} / 113 + 2 \sqrt{2} + 1357 / 113\)$7\sqrt{30}/113+2\sqrt{2}+1357/113$ (approximately \(15.17657384178\)$15.17657384178$). Friedman’s DS7 survey, Theorem 9, k=15, reports this bound at n=226; reference [8] is Green’s private communication (2000). The source proof has not been recovered. The unavoidable-set argument DS7’s Figure 34 illustrates does not prove it: at k=15 that point pattern leaves a unit square empty (devtools.check_green_ds7). Inherited at n=227 by monotonicity. This is a source-reported lower bound; it does not replace the verified bound above. The exact specialization and comparison are retained by audit_ds7_lower_bounds.

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.