You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hiroaki Hosono's closed form (wand125, 13 October 2026, T-180): s(N) >= a(N) for every non-square N >= 49, from a measure of line segments on 34 intervals of the fractional part. At n = 182, k = 13 and interval 27 give a(182) = 13.582913235247782126819715568384..., here rounded down at 12 and 30 places. The source replayed its certificate with its own checker; no replay has run here.
Unrestricted unit-square packing with independent rotations and disjoint interiors.
E-wand125-closed-form-report
value
exact_form
evidence
13.5096118312
1/2 + sqrt(182 - floor(sqrt(182)) + 1/4)
E-karakus-strip-lower
E-karakus-strip-measure-interval
property
assurance
method
scope
certificate
replay
evidence
not-rigid
numerically-checked
numerical-multiprecision
Square 5 of the retained witness (witness id 6) translates 0.033032 along (1, 0) with the packing still valid, so the configuration admits a non-trivial feasible motion; 49 of its 182 squares do. Every constraint is exactly affine in the slide parameter, so the arithmetic carries no linearization error, but the coordinates are the witness's own finite-precision transcription: this settles the retained configuration, not the true optimum. Rigidity and optimality are independent, and this bears only on the former.
atlas/known-best/translation-escape-screen.json
uv run --frozen --all-extras --group dev python -m devtools.screen_translation_escape --check
E-translation-escape-not-rigid
claim
claimed_by
published
year
s(182) <= 13.97409071444282525, Griffin Casson's packing, larger than the reported side
Earlier house 13.974090713121439007150130032772 from [evand exact optima 2026-10-05], the case’s ceiling until 17 October 2026; its certificate and replay remain retained.
Francisco Couzo
Evan Daniel
2026-10-05
2026
claim
claimed_by
published
year
Earlier house 13.9740907131214390071 from [PingYou PR 574 certificates 2026-10-13], the case’s ceiling from 17 October 2026 until 25 October 2026; its certificate and replay remain retained.
Regularized by the Squares Project with Evan Daniel's regularizer (evand/square-packing, MIT), with the project's modifications: same-side exact re-solve (devtools.regularize_same_side). A drawing of T-243's packing at the witness's own side: a pure regularization, which proves no new bound, so not a result.
by
credit
generator
modifications
side
of
view
project
Regularized by the Squares Project with Evan Daniel's regularizer (evand/square-packing, MIT)
Hiroaki Hosono’s closed form, 14 October 2026. Hiroaki Hosono’s closed form
(wand125, 13 October 2026, T-180) states $s(N) \ge a(N)$ for every non-square
$N \ge 49$, from a measure of line segments on 34 intervals of the fractional part.
At $n = 182$, $k = 13$ and interval 27 give
$a(182) = 13.582913235247782126819715568384\ldots$, so the reported lower bound here is
now $s(182) \ge 13.582913235247$, rounded down, above Nagamochi’s closed form,
$13.52996408614$. 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 Hiroaki Hosono.
House adoption, 25 October 2026. Evan Daniel’s packing from an L-cut of Francisco
Couzo’s n = 211 packing, an arrangement of Daniil Ostashev’s design (T-243) is now this
case’s house: its exact certificate proves $s(182) \le 13.9709164362146788$, 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
3.17e-03. The earlier ceiling, displayed outward as $13.9740907131214390071$ from
Francisco Couzo’s packing, improved by Evan Daniel and PingYou Ltd (T-174), applied
until this adoption and stays retained as history
(the certificate).
House adoption, 17 October 2026. PingYou Ltd’s refinement of Evan Daniel’s exact
optimum of Francisco Couzo’s packing (T-174) was this case’s house until 25 October
2026: its exact certificate proves $s(182) \le 13.9740907131214390071$, 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.40e-19. The earlier ceiling, displayed outward as
$13.974090713121439007150130032772$ from Francisco Couzo’s packing, improved by Evan
Daniel (T-098), applied until this adoption and stays retained as history
(the certificate).
Held for the owner, 15 October 2026; lifted 16 October 2026. T-174 at
$13.9740907131214391$, 1.40e-19 below this case’s verified ceiling, 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.
Open. Previously, the best known published packing, Francisco Couzo’s at Evan Daniel’s
exact optimum (T-098), gives $s(182) \le 13.9740907131214390072\ldots$, and the
strongest lower bound independently verified here is $13.509611$ from Karakuş’s general
theorem, leaving a gap of $0.4645$. 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 182 squares in a square of side $13.9740907131214390072\ldots$,
3.4e-12 below the side Francisco Couzo prints.
Square for square, its pose lies within 1.5e-4 of the binary64 pose the atlas pictures
for this count. 1 square moves by more than 1e-8, all of them squares the source lists
as carrying no force; every other square moves by at most 4.8e-12. 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)$.
This repository decides the certificate exactly.
Converted without rounding, every pair and every wall is decided over $\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(182) \le 13.9740907131214390072\ldots$, the verified upper bound until 17
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(182)$. On #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 $13.974090713124822$ 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 $13.9740907131248218004\ldots$, no larger than the printed side, and every pair and
every wall is decided over $\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(182) \le 13.974090713124822$, 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 $13.97409071444282525$ for this count, larger than Couzo’s by 1.31800325e-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 $13.974090713124822$, 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
$13.97442960739443$.
Found by M.Z. Arslanov, S.A. Mustafin and Z.K. Shangitbayev in 2019. Improved by David
Ellsworth in December 2024. Improved by David 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$:
s(N) ≥ ½ + √(N − ⌊√N⌋ + ¼)
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)$, which
is stronger at this $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.
PingYou Ltd’s refinement of Evan Daniel’s exact optimum of Francisco Couzo’s packing,
reported in pull request #574, at an exact
rational side, displayed upward as $13.9740907131214390071$ (T-174). The certificate
gives a rational side and, for each of the 182 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.
The source ran both maintained routes itself on its corners witnesses; those runs are
its own, and the replay here is independently re-implemented.
The
review of 14 October 2026
accepted the replay for finite feasibility.
That proves $s(182) \le 13.9740907131214390071$, the verified upper bound until 25
October 2026: confirmed, independently re-implemented.
It says nothing about optimality, rigidity or a local minimum.
The certificate is PingYou Ltd’s tightening of the packing T-098 records, that packing
by the source’s statement, not decided here (T-174’s regularizations), so the packing
keeps its finder’s credit and PingYou Ltd is credited with the certificate.
The source makes no statement about AI assistance in this pull request; for its #503 and
#504 certificates the author said on 12 October 2026 that they were AI assisted by ‘PY’,
an unreleased agentic AI offering by PingYou Ltd.
The house it replaces, $13.974090713121439007150130032772$ from Francisco Couzo’s
packing, improved by Evan Daniel (T-098), stays retained with its own replay as history.
Evan Daniel’s certificate (T-243)
Evan Daniel’s packing from an L-cut of Francisco Couzo’s n = 211 packing, an arrangement
of Daniil Ostashev’s design, reported on
jlevy/squares#806, at exact side
$13970916436214678735385725854133/1000000000000000000000000000000$, displayed upward as
$13.9709164362146788$ (T-243). The certificate gives a rational side and, for each of
the 182 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 25 October review’s clean-room checker decided it
again in rationals, by separating axes and by the exact clipped area of every pair; its
controls at $10^{-30}$ refused the side lowered past the far walls, the packing moved
past the near walls, the closest pair moved past contact and a square enlarged past a
wall and past its neighbour.
Both routes read the certificate through an adapter whose line filter and corner
construction are transcribed from Evan Daniel’s own checkers, the ones the certificate
names, so the replay shares the producer’s components.
The review’s checker shares no code with either maintained route or the source, and the
independent re-implementation rests on it.
The
review of 25 October 2026
accepted the replay for finite feasibility.
That proves $s(182) \le 13.9709164362146788$, the verified upper bound: confirmed,
independently re-implemented, by a Claude agent, a system family the producer also used.
It says nothing about optimality, rigidity or a local minimum.
The source’s commit names Claude as co-author, and its credits say the repository’s work
was produced by Claude (Anthropic) under human direction.
The issue says the packing came from one L-cut job of a search across counts: a strip of
29 squares, a row and a column along two walls, removed from the register’s s(211)
packing and the rest relaxed, then a local search.
Measured by the 25 October review, square by square, the 29 squares the 182 do not use
are the right column and top row of Francisco Couzo’s 211 packing (T-188), an
arrangement of Daniil Ostashev’s design (T-175), which the certificate follows where the
two differ; of the other 182, 17 move beyond a tenth, at most 0.464. Against T-174’s
packing, this case’s house best packing before this adoption, no symmetry pairs nearest
centres one to one and 44 squares lie beyond a tenth, so it is another arrangement than
T-174’s. The issue claims the upper bound, and reports a local minimum of the side from
numerical checks that are not interval proofs.
The house it replaces, $13.9740907131214390071$ from Francisco Couzo’s packing, improved
by Evan Daniel and PingYou Ltd (T-174), stays retained with its own replay as history.