$n=205$$n=205$

$s(205)$$s(205)$ — open

Exact regularized certificate, 2026-10-12. This project’s regularization pass, Daniel’s exact solver and regularizer run here on this register’s witness, produced an exact rational packing of this arrangement, decided here over $\mathbb{Q}$$\mathbb{Q}$ by two exact checkers: it proves $s(205)\le 14.824451146124088223663726065684$$s(205)\le 14.824451146124088223663726065684$, a bound Daniel’s exact certificate of this packing already proves at the same side (T-101). The verified upper bound is now that side exactly, resting on both certificates (T-101, T-155), and the record still prints it as $14.82445114612409$$14.82445114612409$. Until then the verified upper bound was exactly $14.82445114612409$$14.82445114612409$, the side of Daniel’s exact certificate of this packing rounded up at the printed precision (T-101).

Hosono’s closed form, 14 October 2026. Hosono’s closed form (wand125, 13 October 2026, T-180) states $s(N)\ge a(N)$$s(N)\ge a(N)$ for every non-square $N\ge 49$$N\ge 49$, from a measure of line segments on 34 intervals of the fractional part. At $n=205$$n=205$, $k=14$$k=14$ and interval 7 give $a(205)=14.400000000000000000000000000000\dots$$a(205)=14.400000000000000000000000000000\dots$, so the reported lower bound here is now $s(205)\ge 14.400000000000$$s(205)\ge 14.400000000000$, rounded down, above Nagamochi’s closed form, $14.34166406412$$14.34166406412$. The source replayed its certificate with its own checker; no record of it has been replayed here, so the verified lower bound is unchanged. The source states that its search, certificates, checkers and text were produced with AI assistance (Claude and Codex), under the direction of and reviewed by Hosono.

Exact certificate, 2026-10-06. 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(205)\le 14.82445114612409$$s(205)\le 14.82445114612409$, the verified upper bound from 6 to 12 October 2026 (T-101). Until then the verified upper bound was the trivial grid bound $15$$15$.

Open. The best known packing gives $s(205)\le 14.82445115$$s(205)\le 14.82445115$, and the strongest lower bound independently verified here is $14.329316$$14.329316$ from Karakuş’s general theorem, leaving a gap of $0.4951$$0.4951$. General bound: s(N)≥1/2+N−⌊N​⌋+1/4​$s(N)\ge 1/2+\sqrt{N-\lfloor \sqrt{N}\rfloor +1/4}$.

The regularized exact certificate

This project’s regularization pass of 11 and 12 October 2026 ran Daniel’s exact solver and regularizer (evand/square-packing, MIT, vendored here) on this register’s witness for this count, with the conservative angle policy and coincide placement, which wrote its certificate at the side the solver reached, the solved point scaled by 1+10−20$1+{10}^{-20}$ and the side rounded up. The result is an exact rational packing of the same 205 squares in a square of side $14.824451146124088223663726065684$$14.824451146124088223663726065684$, 1.8×10−15$1.8\times {10}^{-15}$ below the verified upper bound the record held before, which was that same side rounded up at the printed precision: it is the side of Daniel’s certificate of this packing (T-101). Measured against the witness under the box’s eight symmetries, its squares pair one to one with the witness’s; none moves by more than 1×10−3$1\times {10}^{-3}$, and none turns by more than 1×10−6$1\times {10}^{-6}$ as a sine. It draws the same picture as the witness, so the atlas drawing does not change.

Each pair and each 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 both accept it; both refuse it with its tightest pair pushed into overlap and with its box shrunk past its least clearance (certificate). The same two checkers accepted it in the run that made it, so this is a reproduction with the producer’s code. That proves $s(205)\le 14.824451146124088223663726065684$$s(205)\le 14.824451146124088223663726065684$. Daniel’s certificate of this packing already proves the same bound at the same side (T-101), and its replay here, by two checkers that share no code with each other or with the source, is independent of the code that made this view. That side is the exact form of the case’s verified_upper_bound, which cites both certificates (T-101, T-155) and prints it as $14.82445114612409$$14.82445114612409$, the decimal it printed before and an upper display of it. It says nothing about optimality, and the packing stays its finders’.

The earlier exact certificate

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 205 squares, each a rational centre and a rational $t=\tan (\theta /2)$$t=\tan (\theta /2)$, in a square of side $14.8244511461240882237\dots$$14.8244511461240882237\dots$, 8.2×10−15$8.2\times {10}^{-15}$ above the side the Kingbird catalogue prints, $14.82445114612408$$14.82445114612408$. Square for square, its pose lies within 1.5×10−4$1.5\times {10}^{-4}$ of the binary64 pose the atlas pictures for this count. 1 square moves by more than 1×10−8$1\times {10}^{-8}$, one the source lists as carrying no force; every other square’s centre rounds to the witness’s. 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(205)\le 14.82445114612409$$s(205)\le 14.82445114612409$, the verified upper bound until 12 October 2026: 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.”

Its rounded-up side and the printed side 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 Ellsworth in 2024, via an unrecorded method. Improved by Ellsworth in January 2025. Its side length is algebraic of degree 40 over $\mathbb{Q}$$\mathbb{Q}$.

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)≥min(⌈N​⌉,N−2⌊N​⌋+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.

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.