$n=129$$n=129$

s(129) — Square Packing Case

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=129$$n=129$, $k=11$$k=11$ and interval 15 give $a(129)=11.442206611833467509308480874205\dots$$a(129)=11.442206611833467509308480874205\dots$, so the reported lower bound here is now $s(129)\ge 11.442206611833$$s(129)\ge 11.442206611833$, rounded down, above Nagamochi’s closed form, $11.39230484541$$11.39230484541$. 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 refinement of Ostashev’s n = 129 packing, as PingYou Ltd refined it (T-186) is now this case’s house: its exact certificate proves $s(129)\le 11.87001385040446435$$s(129)\le 11.87001385040446435$, 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.19×10−19$1.19\times {10}^{-19}$. The earlier ceiling, displayed outward as $11.8700138504044644$$11.8700138504044644$ from Ostashev’s packing (T-162), applied until this adoption and stays retained as history (the certificate).

House adoption, 15 October 2026. Ostashev’s packing (T-162) was this case’s house until 16 October 2026: its exact certificate proves $s(129)\le 11.8700138504044644$$s(129)\le 11.8700138504044644$, the reported and the verified upper bound, 2.02×10−3$2.02\times {10}^{-3}$ below the ceiling the case held until then, $11.8720298490811800$$11.8720298490811800$ from Xu’s packing, improved by Daniel (T-146), which stays retained as history (the certificate).

House adoption, 11 October 2026. Daniel’s display regularization of Xu’s packing (T-146) was this case’s house until 15 October 2026: its exact certificate proves $s(129)\le 11.8720298490811800$$s(129)\le 11.8720298490811800$, the reported and the verified upper bound, 1.31×10−10$1.31\times {10}^{-10}$ below the ceiling the case held until then, $11.8720298492118721$$11.8720298492118721$ from Xu’s packing (T-125), which stays retained as history (the certificate).

The SQUISH Update

Previously, nate Chaoweeraprasit, using SQUISH, reports a tighter bound $s(129)\le 11.8793752067111287$$s(129)\le 11.8793752067111287$, with exact side $834747022819761305154502413903/70268596478725557239871963136$$834747022819761305154502413903/70268596478725557239871963136$. This update is confirmed at V3/C3 by the complete retained dual exact replay and separately prompted scoped AI reviews. It establishes a feasible upper bound; optimality and human oversight have not been established. The author reports the seed as Couzo’s s(131), squares removed. The revision-specific packet retains the source print $11.8793752067111296$$11.8793752067111296$ separately from the safe decimal ceiling. The atlas drawing below uses the update’s exact rational geometry, checked for the drawing independently of the frontier assurance. Earlier certified geometries, evidence and reviews remain retained as historical provenance, separate from this update’s confirmation.

Separately, this repository’s numerical translation screen finds a nontrivial feasible motion in the current update geometry drawn by the atlas. Previously, that numerical assessment concerns this update pose alone; it does not settle the optimum or describe the earlier certified pose.

The Earlier Verified Upper Bound

Previously, nate Chaoweeraprasit (itsnaka), using SQUISH, reports s(129)≤Sn​$s(129)\le S_n$, with Sn​=70268596478725557239871963136834853717316974191611773864459​$S_n=\frac{834853717316974191611773864459}{70268596478725557239871963136}$ in SQUISH’s ten-packing release. The certificate gives rational centres and half-angle parameters for 129 unit squares. The source’s original finite decimal display is $11.8808935876459927$$11.8808935876459927$; the rational fraction states the claimed bound exactly.

The earlier SQUISH packing improves the earlier reported side $11.88130621809000$$11.88130621809000$ from [Kingbird]. This repository confirmed the upper bound by independently re-implemented exact-rational checks: native exact_verify and devtools.check_rational_witness_independent accept every pair and wall of the earlier packing and reject both geometric controls. The verified display is $11.8808935876459918$$11.8808935876459918$, the exact source side rounded upward at sixteen decimals. Both accepted reviews cover the shared half-angle conversion and the complete roster. The submitted certificates establish feasible upper bounds and make no optimality or rigidity claim.

The author credits Ellsworth’s records and tools and states that SQUISH’s solver, verification and issue were written with Claude Opus 5.5 under his direction, management, review and steering. The source packet retains derived packing facts and source metadata.

Earlier Packing

Ellsworth found the earlier packing; Ellsworth improved it. Its reported side was $11.88130621809000$$11.88130621809000$. The earlier certified ceiling $11.88130621809001$$11.88130621809001$ was the verified upper bound before the SQUISH certificate (T-101), supported by Daniel’s certificate packet. This repository replayed Daniel’s two source checkers and independently decided the rational certificate with its own exact-rational routes; the packet records the shared premises and receipts. Any optimality or rigidity observations about that packing concern its own pose.

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.

The Xu construction

Xu reports (T-125) a construction at exact side $29680074623029680074623/2500000000000000000000$$29680074623029680074623/2500000000000000000000$, displayed upward as $11.8720298492118721$$11.8720298492118721$. The pinned factual packet retains the entire source input and complete actual deciding outcomes.

The complete rational source certificate already includes the source’s stated dilation. No additional dilation or coordinate rounding is applied here.

Complete native replay, required full-roster controls and scoped independent review confirm finite feasibility at V3/C3. The source discloses LLM assistance. No global optimum, local-minimum theorem, rigidity or novelty is established. The source’s 191-touching-pair assertion for n51 is unconfirmed and is not admitted.

Evan Daniel’s certificate (T-146)

Daniel’s display regularization of Xu’s packing, reported in his regularized record lists, on no issue, at exact side $371000932783786874179763432249/31250000000000000000000000000$$371000932783786874179763432249/31250000000000000000000000000$, displayed upward as $11.8720298490811800$$11.8720298490811800$ (T-146). The certificate gives a rational side and, for each of the 129 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 and the final review of 11 October 2026 accepted the replay for finite feasibility. That proves $s(129)\le 11.8720298490811800$$s(129)\le 11.8720298490811800$, the verified upper bound until 15 October 2026: confirmed, independently re-implemented. It says nothing about optimality, rigidity or a local minimum.

The certificate regularizes for display the packing T-125 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-146’s regularizations).

The source’s credits say the repository’s work was produced by Claude (Anthropic) under human direction.

The house it replaces, $11.8720298492118721$$11.8720298492118721$ from Xu’s packing (T-125), stays retained with its own replay as history. The other certificates confirmed here at this count, T-127 at $11.8793752067078730$$11.8793752067078730$, T-115 at $11.8793752067111287$$11.8793752067111287$ and T-113 at $11.8808935876459918$$11.8808935876459918$, stay verified and are not selected.

Daniil Ostashev’s certificate (T-162)

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

The issue says the author drives an AI-assisted research loop with his own ideas, the rectangle library and the composition being his, and that AI agents wrote and ran the search, composition and verification code.

The issue says the 129 is cut from the n = 302 house of the time, Daniel’s view of Chaoweeraprasit’s SQUISH packing, and re-optimised, and that the 204 and 303 are new arrangements. Measured here, the 129 pairs square for square with neither Xu’s packing nor T-146’s, though 46 of Xu’s squares lie in place under a quarter turn, and 49 of the 302’s reappear in it by pose; that supports the author’s account and establishes none of it.

The house it replaces, $11.8720298490811800$$11.8720298490811800$ from Xu’s packing, improved by Daniel (T-146), stays retained with its own replay as history. The other certificates confirmed here at this count, T-125 at $11.8720298492118721$$11.8720298492118721$, T-127 at $11.8793752067078730$$11.8793752067078730$, T-115 at $11.8793752067111287$$11.8793752067111287$ and T-113 at $11.8808935876459918$$11.8808935876459918$, stay verified and are not selected. T-174 at $11.8700138504044644$$11.8700138504044644$, 1.18×10−19$1.18\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 refinement of Ostashev’s n = 129 packing, as PingYou Ltd refined it, reported in his repository on 14 October 2026, with no issue, at an exact rational side, displayed upward as $11.87001385040446435$$11.87001385040446435$ (T-186). The certificate gives a rational side and, for each of the 129 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(129)\le 11.87001385040446435$$s(129)\le 11.87001385040446435$, 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, $11.8700138504044644$$11.8700138504044644$ from Ostashev’s packing (T-162), stays retained with its own replay as history. The other certificates confirmed here at this count, T-174 at $11.8700138504044644$$11.8700138504044644$, T-146 at $11.8720298490811800$$11.8720298490811800$, T-125 at $11.8720298492118721$$11.8720298492118721$, T-127 at $11.8793752067078730$$11.8793752067078730$, T-115 at $11.8793752067111287$$11.8793752067111287$ and T-113 at $11.8808935876459918$$11.8808935876459918$, stay verified and are not selected.