$n=156$$n=156$

$s(156)$$s(156)$ — open

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=156$$n=156$, $k=12$$k=12$ and interval 27 give $a(156)=12.591233265143578179003501158359\dots$$a(156)=12.591233265143578179003501158359\dots$, so the reported lower bound here is now $s(156)\ge 12.591233265143$$s(156)\ge 12.591233265143$, rounded down, above Nagamochi’s closed form, $12.53256259467$$12.53256259467$. 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.

House adoption, 16 October 2026. Polkovskyi’s tighter certificate of Couzo’s continuation of Ostashev’s n = 156 packing, after PingYou Ltd’s (T-186) is now this case’s house: its exact certificate proves $s(156)\le 12.97916585383427646$$s(156)\le 12.97916585383427646$, 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.30×10−19$1.30\times {10}^{-19}$. The earlier ceiling, displayed outward as $12.9791658538342765$$12.9791658538342765$ from Ostashev’s packing, improved by Couzo (T-161), applied until this adoption and stays retained as history (the certificate).

House adoption, 15 October 2026. Couzo’s continuation of Ostashev’s n = 156 packing (T-161) was this case’s house until 16 October 2026: its exact certificate proves $s(156)\le 12.9791658538342765$$s(156)\le 12.9791658538342765$, the reported and the verified upper bound, 6.76×10−6$6.76\times {10}^{-6}$ below the ceiling the case held until then, $12.9791726136444261$$12.9791726136444261$ from Ostashev’s packing (T-149), which stays retained as history (the certificate).

House adoption, 11 October 2026. Ostashev’s packing (T-149) was this case’s house until 15 October 2026: its exact certificate proves $s(156)\le 12.9791726136444261$$s(156)\le 12.9791726136444261$, the reported and the verified upper bound, 2.91×10−3$2.91\times {10}^{-3}$ below the ceiling the case held until then, $12.982082698516893102076828502036$$12.982082698516893102076828502036$ from Couzo’s packing, improved by Daniel (T-098), which stays retained as history (the certificate).

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

The exact optimum

Daniel’s square-packing published on 5 October 2026 an exact rational certificate of this packing at its exact optimum (T-098): the same 156 squares in a square of side $12.9820826985168931021\dots$$12.9820826985168931021\dots$, 3.5×10−12$3.5\times {10}^{-12}$ below the side Couzo prints. Square for square, its pose lies within 5.0×10−12$5.0\times {10}^{-12}$ of the binary64 pose the atlas pictures for this count. 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. 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(156)\le 12.9820826985168931021\dots$$s(156)\le 12.9820826985168931021\dots$, the verified upper bound until 11 October 2026; 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(156)$$s(156)$. 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

Couzo’s square-packing reports a packing of side $12.982082698520427$$12.982082698520427$ for this count, dated 26 September 2026 and unchanged when this record retained the repository on 27 September 2026 (T-056). 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 $12.9820826985204274$$12.9820826985204274$, 4.000×10−16$4.000\times {10}^{-16}$ above 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(156)\le 12.982082698520428$$s(156)\le 12.982082698520428$, which was the verified upper bound until 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).

Casson’s square-packing, dated 23 September 2026 and made with the help of Claude as its README says, reports a packing of side $12.98208269973811824$$12.98208269973811824$ for this count, larger than Couzo’s by 1.21769124×10−9$1.21769124\times {10}^{-9}$. 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 $12.982082698520427$$12.982082698520427$, is dated 26 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 $12.98219172354800$$12.98219172354800$.

Found by Arslanov, Mustafin and Shangitbayev in 2019. Improved by Ellsworth in December 2024. Improved by Cantrell in March 2025. Improved by Ellsworth in January 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)≥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.

Daniil Ostashev’s certificate (T-149)

Ostashev’s packing, reported on jlevy/squares#501, at an exact rational side, displayed upward as $12.9791726136444261$$12.9791726136444261$ (T-149). The certificate gives a rational side and, for each of the 156 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 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 11 October 2026 accepted the replay for finite feasibility. That proves $s(156)\le 12.9791726136444261$$s(156)\le 12.9791726136444261$, the verified upper bound until 15 October 2026: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The source states nothing about AI assistance.

The house it replaces, $12.982082698516893102076828502036$$12.982082698516893102076828502036$ from Couzo’s packing, improved by Daniel (T-098), stays retained with its own replay as history.

Francisco Couzo’s certificate (T-161)

Couzo’s continuation of Ostashev’s n = 156 packing, reported on jlevy/squares#561, at exact side $12979165853834276453965882038847/1000000000000000000000000000000$$12979165853834276453965882038847/1000000000000000000000000000000$, displayed upward as $12.9791658538342765$$12.9791658538342765$ (T-161). The certificate gives a rational side and, for each of the 156 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 a third exact route, half-extent containment and exact intersection area, decided it again. One maintained route is the verifier the source ran; the independent rational corner checker and the third route are independently re-implemented. The review of 14 October 2026 accepted the replay for finite feasibility. That proves $s(156)\le 12.9791658538342765$$s(156)\le 12.9791658538342765$, the verified upper bound until 16 October 2026: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The author states that OpenAI Codex assisted the continuing search, the application work, the source audit, the verification orchestration and the request, that earlier search code and submissions were prepared with Claude Code, and that he directed the work.

The house it replaces, $12.9791726136444261$$12.9791726136444261$ from Ostashev’s packing (T-149), stays retained with its own replay as history. T-174 at $12.9791658538342765$$12.9791658538342765$, 1.30×10−19$1.30\times {10}^{-19}$ below this house, is confirmed here and accepted by the review of 14 October 2026. From 15 October 2026 until the owner’s house rule of 16 October 2026 lifted the hold, PR #574’s houses were held for the owner, since their witnesses would add about 18.5 MB to a checkout and their custody inputs about 5.8 MB to every worker’s snapshot.

Mykhailo Polkovskyi’s certificate (T-186)

Polkovskyi’s tighter certificate of Couzo’s continuation of Ostashev’s n = 156 packing, after PingYou Ltd’s, reported in his repository on 14 October 2026, with no issue, at an exact rational side, displayed upward as $12.97916585383427646$$12.97916585383427646$ (T-186). The certificate gives a rational side and, for each of the 156 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 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 16 October 2026 accepted the replay for finite feasibility. That proves $s(156)\le 12.97916585383427646$$s(156)\le 12.97916585383427646$, the verified upper bound: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The certificate is Polkovskyi’s tightening of the packing T-174 records, measured here pose by pose as that packing (T-186’s regularizations), so the packing keeps its finder’s credit and Polkovskyi is credited with the certificate.

The commit makes no statement about AI assistance; the author’s issue 593 discloses Gemini assistance with solver scripting, precision checks and formatting.

The house it replaces, $12.9791658538342765$$12.9791658538342765$ from Ostashev’s packing, improved by Couzo (T-161), stays retained with its own replay as history. The other certificates confirmed here at this count, T-174 at $12.9791658538342765$$12.9791658538342765$ and T-149 at $12.9791726136444261$$12.9791726136444261$, stay verified and are not selected.