=open
Proven
- exact
Citation record n-108
lowerHosono after Tokoharu and Levy 2026, GitHub (confirmed T-216)
upperXu et al., GitHub (confirmed T-174)
Open
- optimality
Bounds
10.90482101…
10.90482101232035643- Found by
- Xu 2026
- Improved by
- Couzo, PingYou Ltd
- Construction
- —
- Source
- [PingYou PR 574 certificates 2026-10-13]
- Evidence
E-pingyou-574-certificate-report
10.90482101…
10.90482101232035643The reported value, verified here.
- Evidence
E-pingyou-574-exact-feasibility
- Proved by
- Hosono 2026
- Kind
- counting
- Scope
- Unrestricted unit-square packing with independent rotations and disjoint interiors.
- Note
- The mixed_n108_L1062 rectangle measure has total mass 10799999/100000 < 108. The retained maintained sqverify-fast census verifies coverage one at all 201 declared-net directions, with whole-net controls and accepted certificate-specific mathematical reviews. The full verifier shares the producer's sqverify_fast components; the separate exact audits decide premises and saved points, not an independent full coverage theorem.
- Source
- [wand125 fine-net lower bounds 2026-10-16]
- Evidence
E-wand125-fine-net-n108-1062-report
The reported value, verified here.
0.28482101…
Verified upper minus verified lower.
Results in the register
T-007 V0 C1 Nagamochi · 2026-08-31 · 321 cases
for
T-083 V3 C3 Karakuş · 2026-10-02 · 301 cases
for every nonsquare
T-085 V3 C3 Karakuş; Vlasenko · 2026-10-02 · 315 cases
Nagamochi 2005, Lemma 1 is false for every container with and
T-101 V3 C3 Daniel after Couzo, de Winter, Ellsworth, Levy · 2026-10-06 · 77 cases
Exact certificates of 77 catalogue packings:
s(n) ≤ S',1.2e-16to9.8e-15above each sideT-113 V3 C3 Chaoweeraprasit after Ellsworth · 2026-10-07 · 10 cases
at ten counts, to 303, from new SQUISH rational packings
T-116 V3 C3 Chaoweeraprasit after Ellsworth, Couzo and SQUISH · 2026-10-07 · 9 cases
at nine counts, from the second SQUISH update’s new rational packings
T-125 V3 C3 Xu · 2026-10-08 · 25 cases
Complete rational construction reports at 25 counts
T-127 V3 C3 Gupta after Chaoweeraprasit, Daniel · 2026-10-08 · 17 cases
Fourteen rational refinements, seventeen complete source cases
T-128 V3 C3 Couzo after Xu, Chaoweeraprasit, Gupta, Ellsworth, Daniel, Levy · 2026-10-08 · 8 cases
Eight complete rational refinements from Couzo
T-138 V3 C3 Polkovskyi after Stenlund, Friedman, Ellsworth, Chaoweeraprasit, Couzo, Xu, Levy · 2026-10-10 · 16 cases
Exact witnesses at Mishapolk's printed ceilings, the smallest known at 103 and 258 when registered
T-174 V3 C3 PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · 2026-10-14 · 68 cases
Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own
T-180 V0 C1 Hosono · 2026-10-14 · 264 cases
Closed-form lower bound for every non-square , reported
T-216 V3 C3 Hosono after Tokoharu and Levy · 2026-10-17 · n = 108
Mixed rectangle-measure lower bound verified, on the 201-direction net
Claim and records
- Claim
- A rectangle measure of wand125/square-packing, published on 16 October 2026 and reported in jlevy/squares#446, proves = 10.62.
The certificate, mixed_n108_L1062, is a density of 823 uniform rectangles in D4 orbits, and no point mass, of total mass 10799999/100000 < 108. Its declared net has 201 half-angle tangents of step 83/40000 at core side 9977/10000. Since 9977/10000 (1 + 83/40000) = 399908091/400000000 < 1, and the last tangent 83/200 is past tan(pi/8), every unit square contains a closed concentric core at a net angle strictly inside its interior. The search started from a published certificate at a smaller count, mapped to this side and re-solved by linear programming; lifting describes the search, not a premise of the proof.
The maintained sqverify-fast census decided the retained candidate at all 201 directions, with summary VERIFIED and return code 0. Its whole-net control receipt records CONTROLS_REFUSED: the 99/100 mass mutant is refused at every direction, and the near-threshold mutant is refused at the least-bound leaf. The exact premise and saved-point audit recomputed all 201 refusal witnesses and their original captures. Two separately prompted mathematical reviews accepted the certificate's implication and exact premises; the second used the strongest tier at maximum reasoning required by the import runbook. The audits read the retained complete replay; they did not rerun the native engine.
The verified lower lane rises from 10.4121138007... (Karakuş's strip bound, T-083 and T-084) to 10.62, and the reported lane from T-180's closed form, 10.484093855851..., to the same value. The bound is confirmed by a re-implementation sharing the producer's components. The producer's sqverify-proof-net is a copy of this repository's sqverify_fast crate with its declared-net reader changed, so agreement supplies no independent full implementation or second method and establishes no optimality.
wand125 after Tokoharu and Levy, square-packing. The source reports AI assistance under human direction. - Significance
- The strongest verified and reported lower bound on record at , 0.1359 above the previous reported lane and 0.2079 above the verified lane, by the certificate kind and standard net of T-082, T-090 and T-091, with no new technique, at S3 as T-176 to T-178 are.
- Novelty
- previously-published Present in an identified source
- Records
n = 108registerevidence 1evidence 2evidence 3evidence 4sourcereview
upper: replayed here; lower: replayed here
—
not rigid, numerically checked, numerical multiprecision
Evidence: E-translation-escape-not-rigid
Scope
Square 34 of the retained witness (witness id 35) translates 0.023333 along (0.793642, -0.608386) with the packing still valid, so the configuration admits a non-trivial feasible motion; 6 of its 108 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.
Drawn as published: the layer's regularized view does not improve on the packing as published (it ties the house drawing on every goal of the improvement rule), so the house drawing is drawn (regularization policy, section 12). The view was regularized by the Squares Project with its own axis tool (regularize_axis_components/2). A drawing of T-174's packing at the witness's own side: a pure regularization, which proves no new bound, so not a result. The house is itself its source's regularization of T-128's packing (PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy), registered as T-174 for the upper bound its exact side proves.
- Priority: Prior reported s(108) <= 10.9206589394033085 from [SQUISH ten packings 2026-10-07]; its geometry, evidence and finder credit remain in the earlier packet and case history. (Chaoweeraprasit)
- Priority: Earlier source ceiling 10.9099400734448775 from [SQUISH second update 2026-10-07]; full prior geometry and record remain retained in the packet. (Chaoweeraprasit)
- Priority: Earlier house 10.9048247851109049 from [ry-xu square packing 2026], the case’s ceiling until 11 October 2026; its certificate and replay remain retained. (Xu)
- Priority: Earlier house 10.9048210123203565 from [Couzo exact refinements 2026-10-08], the case’s ceiling from 11 October 2026 until 17 October 2026; its certificate and replay remain retained. (Xu, Couzo)
28 evidence entries
E-squish-ten-packings-2026-10-07-report, E-evand-exact-ceilings-2026-10-05-report, E-evand-exact-ceilings-2026-10-05-exact-replay, E-evand-exact-ceilings-2026-10-05-source-replay, E-kingbird-upper-register, E-nagamochi-lower, E-basic-grid-upper, E-karakus-strip-lower, E-karakus-strip-measure-interval, E-nagamochi-lemma1-counterexample, E-squish-ten-packings-2026-10-07-exact-replay, E-squish-second-update-2026-10-07-report, E-squish-second-update-2026-10-07-exact-replay, E-ryxu-432-rational-report, E-ryxu-432-rational-feasibility, E-pingyou-574-certificate-report, E-pingyou-574-exact-feasibility, E-couzo-451-rational-report, E-couzo-451-exact-feasibility, E-mishapolk-470-pose-report, E-mishapolk-470-exact-feasibility, E-gupta-438-rational-report, E-gupta-438-exact-feasibility, E-wand125-closed-form-report, E-wand125-fine-net-n108-1062-report, E-wand125-fine-net-n108-1062-sqverify-fast-replay, E-n108-review-max-premises, E-n108-review-max-captures
- [ry-xu square packing 2026] upper bound report
- [SQUISH second update 2026-10-07] upper bound report
- [SQUISH ten packings 2026-10-07] upper bound report
- [evand exact optima 2026-10-05] formal certificate
- [Kingbird] record catalogue
- [Nagamochi 2005] lower bound proof
- [Friedman DS7] survey
- [Karakuş 2026] lower bound proof
- [Couzo exact refinements 2026-10-08] upper bound report
- [wand125 closed form 2026-10-14] lower bound proof
- [PingYou PR 574 certificates 2026-10-13] upper bound report
- [wand125 fine-net lower bounds 2026-10-16] lower bound proof
s(108) — Square Packing Case
Fine-net lower bound, 18 October 2026. The certificate mixed_n108_L1062, published
by Hosono on 16 October, raises both lower lanes to . Its
exact nonnegative rectangle measure has total mass . The retained
maintained sqverify-fast census verifies capture at every centre in all 201
declared-net directions, and its whole-net control receipt refuses the scaled mutants.
The two accepted mathematical reviews check the certificate’s implication and premises;
the separate exact audits check saved points.
No native verifier was rerun during those reviews or this adoption.
The producer’s checker and the maintained replay share sqverify_fast components, so
this is shared component confirmation.
It establishes neither independent full confirmation nor optimality.
The upper lanes remain unchanged.
Hosono’s closed form, 14 October 2026. Hosono’s closed form (wand125, 13 October 2026, T-180) states for every non-square , from a measure of line segments on 34 intervals of the fractional part. At , and interval 23 give , so the reported lower bound here was , rounded down, above Nagamochi’s closed form, . The source replayed its certificate with its own checker; no record of it has been replayed here; it remains a historical reported bound. 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, 17 October 2026. PingYou Ltd’s refinement of Couzo’s refinement of Xu’s packing (T-174) is now this case’s house: its exact certificate proves , 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 . The earlier ceiling, displayed outward as from Xu’s packing, improved by Couzo (T-128), applied until this adoption and stays retained as history (the certificate).
House adoption, 11 October 2026. Couzo’s refinement of Xu’s packing (T-128) was this case’s house until 17 October 2026: its exact certificate proves , the reported and the verified upper bound, below the ceiling the case held until then, from Xu’s packing (T-125), which stays retained as history (the certificate).
The second SQUISH update
Previously, nate Chaoweeraprasit, using SQUISH, reports this packing: , with exact side . Two independently implemented exact rational SAT routes accepted the complete packing and rejected both complete-roster controls. Two separately prompted AI reviews accepted the mathematical inputs and full receipt bindings. The author reports the seed as SQUISH’s own s(110), two squares removed, then nearby search.
The revision-specific packet retains the source print separately from the verified upward decimal ceiling. The exact side is unchanged; this certifies feasibility and an upper bound, without optimality, rigidity or human oversight claims. Earlier source geometry, certificates, credit and verification lanes remain historical evidence for their own packings.
The Upper Bound
Previously, nate Chaoweeraprasit (itsnaka), using SQUISH, reports , with in SQUISH’s ten-packing release. The certificate gives rational centres and half-angle parameters for 108 unit squares. The source’s original finite decimal display is ; the rational fraction states the claimed bound exactly.
The new packing improves the earlier reported side 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 new packing and reject both geometric controls.
The verified display is , 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.
Separately, this repository’s
numerical translation screen finds
a nontrivial feasible motion in the retained configuration.
That numerical assessment concerns this configuration alone; it does not settle the
optimum or all packings at this side.
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
Hajba found the earlier packing; Ellsworth improved it. Its reported side was . The earlier certified ceiling 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 current verified lower bound is , from Hosono’s fine-net measure and the maintained replay described above. That confirmation shares the producer’s verifier components.
Karakuş’s general bound supplied the earlier verified lower bound. It applies to every nonsquare :
Correction, 2 October 2026. Until that date the verified lower bound here was Nagamochi’s general closed form, , which stood above that earlier Karakuş bound and was 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.
| bound | evidence | run | code | programs |
|---|---|---|---|---|
| verified lower | E-wand125-fine-net-n108-1062-sqverify-fast-replay |
replayed here | shared components | V-sqverify-fast (first-party); V-audit-fine-net-receipt (first-party, premises) |
| verified upper | E-pingyou-574-exact-feasibility |
replayed here | independent | V-sqpack-verify, V-check-rational-witness-independent, V-check-half-angle-area (first-party); V-evand-arrangement-receipts, V-upper-bound-reports, V-evand-exact-certificates (first-party, premises) |
The Xu construction
Xu reports (T-125) a construction at exact side , displayed upward as . 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.
Francisco Couzo’s certificate (T-128)
Couzo’s refinement of Xu’s packing, reported on jlevy/squares#451, at exact side , displayed upward as (T-128). The certificate gives a rational side and, for each of the 108 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 10 October 2026
and the
final review of 11 October 2026
accepted the replay for finite feasibility.
That proves , the verified upper bound until 17 October
2026: confirmed, independently re-implemented.
It says nothing about optimality, rigidity or a local minimum.
The house it replaces, from Xu’s packing (T-125), stays retained with its own replay as history. The other certificates confirmed here at this count, T-138 at , T-127 at , T-116 at and T-113 at , stay verified and are not selected. T-174 at , 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.
PingYou Ltd’s certificate (T-174)
PingYou Ltd’s refinement of Couzo’s refinement of Xu’s packing, reported in pull request #574, at an exact rational side, displayed upward as (T-174). The certificate gives a rational side and, for each of the 108 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 , the verified upper bound: 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-128 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, from Xu’s packing, improved by Couzo (T-128), stays retained with its own replay as history. The other certificates confirmed here at this count, T-138 at , T-125 at , T-127 at , T-116 at and T-113 at , stay verified and are not selected.