\(s (271)\)$s(271)$ — open

Open. The best known published packing, Francisco Couzo’s at Evan Daniel’s exact optimum (T-098), gives \(s(271) \le 16.9508207926249587865\ldots\)$s(271)\le 16.9508207926249587865\dots$, and the strongest lower bound independently verified here is \(16.476545\)$16.476545$ from Karakuş’s general theorem, leaving a gap of \(0.4743\)$0.4743$. General bound: s(N) >= 1/2 + sqrt(N - floor(sqrt(N)) + 1/4).

The exact optimum

Evan Daniel’s square-packing published on 5 October 2026 an exact rational certificate of this packing at its exact optimum (T-098): the same 271 squares in a square of side \(16.9508207926249587865\ldots\)$16.9508207926249587865\dots$, \(8.9 \times 10^{-12}\)$8.9\times {10}^{-12}$ below the side Francisco Couzo prints. Square for square, its pose lies within \(4.9 \times 10^{-7}\)$4.9\times {10}^{-7}$ of the binary64 pose the atlas pictures for this count. 81 squares move by more than \(1 \times 10^{-8}\)$1\times {10}^{-8}$, none of them listed by the source as free, each by at most \(4.9 \times 10^{-7}\)$4.9\times {10}^{-7}$; every other square moves by at most \(2.2 \times 10^{-9}\)$2.2\times {10}^{-9}$. The known-best witness this record lists is that binary64 pose, posed at its finder’s larger side; the side above is witnessed by the certificate itself. 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, each square a rational centre and a rational \(t = \tan(\theta/2)\)$t=\tan (\theta /2)$.

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(271) \le 16.9508207926249587865\ldots\)$s(271)\le 16.9508207926249587865\dots$, the verified upper bound; it says nothing about optimality. The source reports the exact point as a KKT local minimum: multipliers that keep it in equilibrium, a reduced Hessian positive definite once its exact flat motions are set aside (its per-count report), and no first-order descent across corner-to-corner contacts, each computed numerically at that point; none of that is verified here, and it bears on this packing alone, not on \(s(271)\)$s(271)$. 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

Francisco Couzo’s square-packing reports a packing of side \(16.950820792633813\)$16.950820792633813$ for this count, dated 26 September 2026 and unchanged when this record retained the repository on 27 September 2026 (T-056). Its first packing for this count, of side \(16.951280889236397\)$16.951280889236397$, is dated 24 September 2026. The repository names no method and no tolerance, and itself states no AI assistance; its author said on issue #227 that he found the 102 and 103 packings “with the help of Claude”.

This repository certifies it exactly. The retained decimal pose rounds to an exact rational packing at centre dilation 1, of side \(16.9508207926338124111\ldots\)$16.9508207926338124111\dots$, no larger than the printed side, and every pair and every wall is decided over \(\mathbb{Q}\)$\mathbb{Q}$ twice, by the promotion’s exact separating-axis test and by an independent checker that shares no code with it (receipt). That proves \(s(271) \le 16.950820792633813\)$s(271)\le 16.950820792633813$, which was the verified upper bound until Evan Daniel’s exact optimum above replaced it; it says nothing about optimality. Interval arithmetic on the printed pose itself, with each angle’s true cosine and sine and no rational rounding, decides every pair and wall again and gives the same bound (interval route).

Griffin Casson’s square-packing, dated 23 September 2026 and made with the help of Claude as its README says, reports a packing of side \(16.95479445810086716\)$16.95479445810086716$ for this count, larger than Couzo’s by \(0.00397366546705416\)$0.00397366546705416$. Casson’s is the earlier of the two by the timestamps this record’s priority notes keep: Couzo’s first packing for this count, of side \(16.951280889236397\)$16.951280889236397$, is dated 24 September 2026. The record states both dates and infers nothing about whether either packing derives from the other.

The previous best known packing

Before this intake the best known packing was the Kingbird catalogue’s, of side \(16.95509447506437\)$16.95509447506437$.

Found by David Ellsworth in 2026, via simulated annealing.

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.

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.