$n=227$$n=227$

$s(227)$$s(227)$ — open

House adoption, 22 October 2026. Daniel’s display regularization of de Winter’s packing as refined in Couzo’s #672 report (T-225) is now this case’s house: its exact certificate proves $s(227)\le 15.5636256523251491$$s(227)\le 15.5636256523251491$, the reported and the verified upper bound, rounded outward from its exact side. The exact certificate side improves the previous verified exact side by about 1.71×10−4$1.71\times {10}^{-4}$. The earlier ceiling, displayed outward as $15.5637967036692680$$15.5637967036692680$ from de Winter’s packing (T-196), applied until this adoption and stays retained as history (the certificate).

House adoption, 20 October 2026. de Winter’s packing (T-196) was this case’s house until 22 October 2026: its exact certificate proves $s(227)\le 15.5637967036692680$$s(227)\le 15.5637967036692680$, the reported and the verified upper bound, rounded outward from its exact side. The exact certificate side improves the previous verified exact side by about 7.27×10−3$7.27\times {10}^{-3}$. The earlier exact ceiling, $19463834764831844055010554526310613/1250000000000000000000000000000000$$19463834764831844055010554526310613/1250000000000000000000000000000000$ from Ellsworth’s packing (T-155), applied until this adoption and stays retained as history; the reported upper bound it replaces, $15.57106781186547$$15.57106781186547$ from [Kingbird], lies 7.27×10−3$7.27\times {10}^{-3}$ above the new side (the certificate).

Reported certificate, 2026-10-17. de Winter reported a 227-square certificate at container side $15.563796703670$$15.563796703670$, rounded upward from the retained exact certificate. The exact rational side is registered in the result register. Its V0/C0 registration left both case upper lanes, the house witness and its drawing unchanged until the house adoption of 20 October 2026, and until then the rigidity and arrangement notes below described that retained house. On 20 October 2026 both of this project’s maintained exact routes decided the certificate and refused its two controls, which raised T-196 to V3/C3, independently re-implemented: no route is the source’s code. Couzo’s later #672 reported a smaller side here.

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(227)\le 15.5710678118654752440084436210484904$$s(227)\le 15.5710678118654752440084436210484904$, the verified upper bound until 20 October 2026 (T-155), which the record printed as $15.57106781186548$$15.57106781186548$. Until then the verified upper bound was exactly $15.57106781186548$$15.57106781186548$, the side of Daniel’s exact certificate of this packing rounded up at the printed precision (T-101).

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

Open. Previously, the best known packing gave $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+N−⌊N​⌋+1/4​$s(N)\ge 1/2+\sqrt{N-\lfloor \sqrt{N}\rfloor +1/4}$.

The earlier verified ceiling

Until 20 October 2026 the verified upper bound here was $15.5710678118654752440084436210484904$$15.5710678118654752440084436210484904$, exactly, proved by the exact regularized certificate of this packing (E-regularized-bounds-2026-10-12-exact-decision, T-155), and the record prints it as $15.57106781186548$$15.57106781186548$. As printed it was larger than the catalogue’s printed side $15.57106781186547$$15.57106781186547$, then the best known, by 1×10−14$1\times {10}^{-14}$.

It was not the value of $s(227)$$s(227)$ and not a different packing: it is the certificate’s own exact side. The catalogue gives the packing’s side exactly, as (17/2)+52​$(17/2)+5\sqrt{2}$, and the certificate’s side lies 7.2×10−36$7.2\times {10}^{-36}$ above that, so it bounds the exact side from above and does not reach it. That side is irrational, so no rational certificate reaches it. A mathematics blocker in the frontmatter recorded the difference until de Winter’s certificate (T-196) replaced both lanes.

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, and this project’s same-side re-solve then fixed the result’s tight contacts over $\mathbb{Q}$$\mathbb{Q}$ at the witness’s own side. The result is an exact rational packing of the same 227 squares in a square of side $15.5710678118654752440084436210484904$$15.5710678118654752440084436210484904$, 4.8×10−15$4.8\times {10}^{-15}$ below the verified upper bound the record held before, and 1.6×10−19$1.6\times {10}^{-19}$ below the side of Daniel’s certificate of this packing (T-101): it is the witness’s own side. Measured against the witness under the box’s eight symmetries, its squares pair one to one with the witness’s; 1 moves by more than 1×10−3$1\times {10}^{-3}$, the largest by 2.9×10−1$2.9\times {10}^{-1}$, and none turns by more than 1×10−6$1\times {10}^{-6}$ as a sine. It redraws the packing visibly, and is drawn only once the regularized layer admits it under the regularization policy.

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(227)\le 15.5710678118654752440084436210484904$$s(227)\le 15.5710678118654752440084436210484904$, the verified upper bound until 20 October 2026 (T-155), then the exact form of the case’s verified_upper_bound, which printed it as $15.57106781186548$$15.57106781186548$, 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 227 squares, each a rational centre and a rational $t=\tan (\theta /2)$$t=\tan (\theta /2)$, in a square of side $15.5710678118654752442\dots$$15.5710678118654752442\dots$, 5.2×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×10−4$1.5\times {10}^{-4}$ of the binary64 pose the atlas pictures for this count. 3 squares move by more than 1×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. 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 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.”

The packing

Found by 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)≥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.

The reported lower-bound expression for $s(227)$$s(227)$ is 730​/113+22​+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.

Joost de Winter’s certificate (T-196)

de Winter’s packing, reported on jlevy/squares#668, at an exact rational side, displayed upward as $15.5637967036692680$$15.5637967036692680$ (T-196). The certificate gives a rational side and, for each of the 227 unit squares, a rational centre and the cosine and sine of its rotation; the retained packet holds it with the complete native jobs that decided it.

Both maintained exact routes decided it here, sqpack’s exact separating-axis verifier and the independent rational corner checker, with its duplicate-square and outside-container controls, and a third exact route, half-extent containment and exact intersection area, decided it again. No route here is the source’s code, so the replay is independently re-implemented. The review of 20 October 2026 accepted the replay for finite feasibility. That proves $s(227)\le 15.5637967036692680$$s(227)\le 15.5637967036692680$, the verified upper bound until 22 October 2026: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The issue says the search, numerical optimization, rational certificates, checkers and figures were made with OpenAI Codex agents under de Winter’s direction, and that Claude (Anthropic) replayed the checkers and prepared the repository for publication.

The issue says the search started from this repository’s catalogue, whose credits for the former packings apply, and built asymmetric Young-corner fills around slipped tilted ribbons, then restored the supports and angles; the three counts are one construction family, and the 229-square packing descends from the 260-square one. None of this lineage is measured here (T-196).

The house it replaces, $19463834764831844055010554526310613/1250000000000000000000000000000000$$19463834764831844055010554526310613/1250000000000000000000000000000000$ from Ellsworth’s packing (T-155), stays retained with its own replay as history.

Evan Daniel’s certificate (T-225)

Daniel’s display regularization of de Winter’s packing as refined in Couzo’s #672 report, published in his regularized record lists, on no issue, at exact side $7781812826162574542396221861851/500000000000000000000000000000$$7781812826162574542396221861851/500000000000000000000000000000$, displayed upward as $15.5636256523251491$$15.5636256523251491$ (T-225). The certificate gives a rational side and, for each of the 227 unit squares, a rational centre and the tangent of its half-angle; the retained packet holds it with the complete native jobs that decided it.

Both maintained exact routes decided it here, sqpack’s exact separating-axis verifier and the independent rational corner checker, with its duplicate-square and outside-container controls, and the 21 October review’s clean-room checker decided it again on two routes of its own, in integers alone and in rationals with exact intersection area on the pairs whose boxes overlap; its sharp controls at 10−30${10}^{-30}$ found both maintained routes exact at the far wall, the near wall and the least-gap pair. No route here is the source’s code, so the replay is independently re-implemented. The review of 21 October 2026 accepted the replay for finite feasibility. That proves $s(227)\le 15.5636256523251491$$s(227)\le 15.5636256523251491$, the verified upper bound: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The certificate regularizes for display the packing T-227 records, at the side the source reports as that packing’s exact optimum, so the packing stays with its finder and Daniel is credited with the regularization and the certificate. That the two are one packing is the source’s claim, measured here and not decided (T-225’s regularizations).

The source’s credits say the repository’s work was produced by Claude (Anthropic) under human direction, and the commit that publishes the certificate names Claude Opus 5.5 as co-author and says Daniel approved it.

The source names Couzo’s #672 packing (T-227), the refinement of de Winter’s #668 packing (T-196) that #672 reports, as the one it regularizes and calls the certificate not a new bound: Daniel solved that packing to its exact side, 1.76×10−11$1.76\times {10}^{-11}$ below #672’s certificate, and regularized it for display at that side. Measured by the import and again by the 21 October review, nearest centres pair the two one to one under a half turn; 194 of the 227 squares lie within 10−6${10}^{-6}$ of T-227’s, 16 move beyond 10−3${10}^{-3}$ and 3 beyond a tenth, at most 0.168, and one square turns by 2.54° (T-225). #672’s packing moves no square beyond a tenth from de Winter’s (T-227).

The house it replaces, $15.5637967036692680$$15.5637967036692680$ from de Winter’s packing (T-196), stays retained with its own replay as history.