Case record
The best packing known for 84 squares, side 9.69793479…, Xu 2026

n=84

=open

3769400≤s(84)≤9.69793479…

9.429.698
91011
9.16510.165
nn+1

Proven

9.42250≤s(84)≤9.697935

  • exact

Citation record n-084

lowerHosono after Tokoharu and Levy 2026, GitHub (confirmed T-206)

upperXu et al., GitHub (confirmed T-174)

Open

  • optimality

Bounds

Best known packing

9.69793479…

9.69793479901492131
Found by
Xu 2026
Improved by
Couzo, PingYou Ltd
Construction
—
Source
[PingYou PR 574 certificates 2026-10-13]
Evidence
E-pingyou-574-certificate-report
Verified upper bound

9.69793479…

9.69793479901492131

The reported value, verified here.

Evidence
E-pingyou-574-exact-feasibility
Reported lower bound

3769400

Proved by
Hosono 2026
Kind
counting
Scope
Unrestricted unit-square packing with independent rotations and disjoint interiors.
Note
T-206: complete maintained 201-direction native replay and accepted mathematical review; confirmed by a re-implementation sharing components with the producer's checker, Hosono's adaptation of this repository's sqverify_fast crate, apart from the declared-net readers. Saved-point audits decide no universal coverage.
Source
[wand125 fine-net lower bounds 2026-10-16]
Evidence
E-wand125-fine-net-n84-94225-report
Verified lower bound

3769400

The reported value, verified here.

Evidence
E-wand125-fine-net-n84-94225-sqverify-fast-replay
Gap

0.27543479…

Verified upper minus verified lower.

Results in the register

  • T-007 V0 C1 Nagamochi · 2026-08-31 · 321 cases

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

  • T-058 V3 C3 Hosono after Tokoharu, Daniel · 2026-09-29 · 100 cases

    Rectangle-certificate ceiling α·UB(n) proved for n=1..100; B·UB(n) on 64 grid rows

  • T-071 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-02 · n = 84–87

    Mixed rectangle-measure lower bounds replayed at n=84…87

    Claim and records
    Claim
    Two rectangle densities of wand125/square-packing-bounds, checked at coverage one and published on 2 October 2026, prove s(84)≥47/5 = 9.4 and s(85)≥471/50 = 9.42. The n=85 certificate's mass is below 86 and 87 too, so it gives s(86)≥471/50 and s(87)≥471/50 as well: four counts in all.

    Each certificate is a density of uniform rectangles with no point mass, of total mass n - 1/100000, at core side 9977/10000 on 201 net half-angles of step 83/40000: 661 rectangles at n=84 and 587 at n=85. Each is accepted at every oblique net angle by code/mixed_rotated_verify.cpp, the research copy of Tokoharu's verify.cpp that the source's s(50) certificate (T-048) and the five certificates of T-069 use, which accepts coverage at least 1 where Tokoharu's requires 10001/10000, and at angle zero by exact integer tables. The least oblique lower bounds are 1.00000000089 at n=84 and 1.0000000017 at n=85.

    Both values exceed Green's reported 2 sqrt(2) + (247 + 12 sqrt(2))/41 = 9.2667335..., which this record holds at both counts by monotonicity from n=82, by more than 0.1332 and 0.1532; the source's own improvement figures are measured from 9.2667, below Green's value, and are not lower bounds. At n=86 and 87 the n=85 value is also above the rectangle certificates T-068 reports there, 1873/200 and 941/100.

    Each certificate passed a complete replay here on 2 October 2026 of the source's unchanged checker and per-angle functions on its pinned tarball: all 201 directions, each returning the certificate's own record. The replays run the source's own algorithm and are not an independent decision of coverage.

    Hosono after Tokoharu and Levy, square-packing-bounds. Registration was requested in a comment of 2 October 2026 on jlevy/squares#282. The source says parts of the work were produced with AI assistance under human direction.
    Significance
    Raised the verified lower bound at four counts, n=84 to 87, past Green's reported value at n=84 and 85 by the widest margins over it on record, by the certificate kind of T-048 and T-069. Further sizes from one generator at S3; the 2 October review of these certificates proposed S3, which the replays leave standing.
    Novelty
    previously-published Present in an identified source
    Records

    n = 84n = 85n = 86n = 87registerevidence 1evidence 2evidence 3evidence 4sourcereview

  • T-083 V3 C3 Karakuş · 2026-10-02 · 301 cases

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

  • T-085 V3 C3 Karakuş; Vlasenko · 2026-10-02 · 315 cases

    Nagamochi 2005, Lemma 1 is false for every container with a>3 and b>2

  • T-090 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-05 · 17 cases

    Mixed rectangle-measure lower bounds verified at 17 counts in n=42…96

  • T-094 V3 C3 Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · 2026-10-05 · n = 67, 84

    Mixed rectangle-measure lower bounds verified at n=67 and 84

    Claim and records
    Claim
    Two rectangle densities of wand125/square-packing-bounds, checked at coverage one and published on 5 October 2026, prove s(67)≥212/25 = 8.48 and s(84)≥9411/1000 = 9.411.

    Each is a density of uniform rectangles in D4 orbits, 536 at n=67 and 686 at n=84, and no point mass, of total mass n - 1/100000, at core side 9977/10000 on 201 net half-angles of step 83/40000, of the kind and checker of T-082, T-090 and T-091. The source reports each accepted at all 200 oblique net angles by code/mixed_rotated_verify.cpp, its research copy of Tokoharu's verify.cpp at coverage threshold one, and at the axis by exact integer tables. Both supersede the source's certificates of T-090 at the same count, mixed_n67_L8475 and mixed_n84_L94075.

    Both values are above what the record held at their counts: the verified 1691/200 and 47/5, by 0.025 and 0.011, and T-090's reported 339/40 and 3763/400, by 0.005 and 0.0035. A packing of n + 1 squares contains one of n, but at n=68 and 85 the record already holds more in both lanes (851/100 and 473/50), so neither carries further.

    Each certificate was decided here on 5 October 2026 by sqverify-fast, this repository's clean-room measure verifier, at all 201 net directions of the retained candidate, and two mutants of each scaled below coverage one were refused: confirmed, independently re-implemented. The verifier shares no code with the source's checker and runs the same net-and-shrink method, so it is a second implementation and not a second method. The source's own checker was not run here.

    Hosono after Tokoharu and Levy, square-packing-bounds. Registration was requested in two comments of 5 October 2026 on jlevy/squares#282. The source says parts of the work were produced with AI assistance under human direction.
    Significance
    The strongest verified lower bounds on record at n=67 and 84, above the replayed rectangle and mixed certificates that held them by 0.025 and 0.011. Further sizes from the generator and checker of T-069, T-071, T-072, T-075, T-082, T-090 and T-091, with no new technique, at S3 as those are. The review of 5 October confirmed S3: that they are the source's first certificates verified here by an independently re-implemented replay is a fact about this repository's confirmation, not about the result.
    Novelty
    previously-published Present in an identified source
    Records

    n = 67n = 84registerevidence 1evidence 2evidence 3evidence 4sourcereview

  • T-125 V3 C3 Xu · 2026-10-08 · 25 cases

    Complete rational construction reports at 25 counts

  • T-130 V3 C3 Couzo after Xu, Daniel, Ellsworth, Levy · 2026-10-09 · 5 cases

    Five follow-up 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 s(N)≥a(N) for every non-square N≥49, reported

  • T-206 V3 C3 Hosono after Tokoharu and Levy · 2026-10-17 · n = 84

    Mixed rectangle-measure lower bound s(84)≥3769/400 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 s(84)≥3769/400 = 9.4225.

    The certificate, mixed_n84_L94225, is a density of 815 uniform rectangles in D4 orbits, 6464 distinct rectangles after expansion, and no point or segment, of total mass 8399999/100000 < 84. Its declared net has 201 half-angle tangents of step 83/40000 at core side 9977/10000. The strict core extent 399908091/400000000 < 1 and the last tangent 83/200, past tan(pi/8), supply the reviewed net-and-shrink implication.

    The retained maintained sqverify-fast capture verifies all 201 directions at threshold one, under the qualified Mac release build of Rust 1.98.0. Its whole-net controls record 201 coverage refusals and no verified mutant direction, and the near-threshold mutant is refused. The mathematical review accepts the implication and independently recomputed the saved-point captures. The outer capture, check and control commands all have observed exit 0.

    This raises the verified and reported lower lanes from 9411/1000 to 3769/400. The bound is confirmed by a re-implementation sharing components with the producer's checker, sqverify-proof-net, which is Hosono's adaptation of this repository's sqverify_fast crate: the two share the crate apart from their declared-net readers. The exact audits check premises and saved poses, not coverage between poses; no independent full implementation, second method, proof-assistant check or optimality theorem is claimed.

    wand125 after Tokoharu and Levy, square-packing. The source says parts of the work were produced with AI assistance under human direction.
    Significance
    The strongest verified and reported lower bound on record at n=84, 23/2000 above the prior lanes, 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 and T-216 are.
    Novelty
    previously-published Present in an identified source
    Records

    n = 84registerevidence 1evidence 2sourcereview

Verification

upper: replayed here; lower: replayed here

—

Rigidity

not rigid, numerically checked, numerical multiprecision

Evidence: E-translation-escape-not-rigid

Scope

Square 6 of the retained witness (witness id 7) translates 0.062242 along (0.707107, -0.707107) with the packing still valid, so the configuration admits a non-trivial feasible motion; 17 of its 84 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.

Regularization

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-130'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.

Open questions
  • Blocker (source evidence): Green's reported lower-bound proof, cited as private communication by Friedman, has not been recovered or independently replayed. E-green-ds7-theorem9-reported-lower
  • Priority: Earlier source ceiling 9.70710678118654 from [Kingbird]; full prior geometry and record remain retained in the packet. (Stenlund)
  • Priority: Earlier house 9.6980520605096981 from [ry-xu square packing 2026], the case’s ceiling until 11 October 2026; its certificate and replay remain retained. (Xu)
  • Priority: Earlier house 9.6979347990149214 from [Couzo follow-up refinements 2026-10-08], the case’s ceiling from 11 October 2026 until 17 October 2026; its certificate and replay remain retained. (Xu, Couzo)

s(84) — open

Fine-net validation, 19 October 2026 (T-206). The retained candidate mixed_n84_L94225 raises both lower lanes from 9411/1000 to 3769/400. The complete 201-direction maintained native replay and mathematical review confirm it by a re-implementation sharing components with the producer’s checker, Hosono’s adaptation of this repository’s sqverify_fast crate, apart from the declared-net readers. The exact audits check premises and saved poses only. The original 18 source reports and historical native receipts remain retained.

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 s(84)≤9.69793479901492131, 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 9.70×10−20. The earlier ceiling, displayed outward as 9.6979347990149214 from Xu’s packing, improved by Couzo (T-130), applied until this adoption and stays retained as history (the certificate).

House adoption, 11 October 2026. Couzo’s refinement of Xu’s packing (T-130) was this case’s house until 17 October 2026: its exact certificate proves s(84)≤9.6979347990149214, the reported and the verified upper bound, 1.17×10−4 below the ceiling the case held until then, 9.6980520605096981 from Xu’s packing (T-125), which stays retained as history (the certificate).

External intake, 2026-10-05 (certificate of 5 October). Hosono’s mixed-certificate source reports s(84)≥9411/1000=9.411 (T-094), from a density of 686 rectangles of total mass 8399999/100000<84, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the source’s 3763/400 of the day before, by 0.0035, and the verified 47/5 by 0.011. It supersedes the source’s mixed_n84_L94075 (T-090). sqverify-fast, this repository’s clean-room verifier, decided it here on 5 October 2026 at all 201 net directions, so it is also the verified lower bound: confirmed, independently re-implemented. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-10-05 (certificate of 4 October). Hosono’s mixed-certificate source reports the mixed certificate mixed_n84_L94075 at side 3763/400=9.4075 (T-090), since superseded (T-094), from a density of 569 rectangles of total mass 8399999/100000<84, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above the 47/5 this case reported, by 0.0075. It supersedes the source’s mixed_n84_L940. sqverify-fast, this repository’s clean-room verifier, decided it here on 6 October 2026 at all 201 net directions: confirmed, independently re-implemented. The verified lower bound is unchanged, the certificate above being higher. Hosono’s README says parts of the work were produced with AI assistance under human direction.

External intake, 2026-10-02. Hosono’s mixed-certificate source reports the mixed certificate mixed_n84_L940 at side 47/5=9.4 (T-071), since superseded (T-090), from a density of 661 rectangles of total mass 8399999/100000<84, accepted there at every net angle by its research copy of Tokoharu’s checker at threshold one. It is above Green’s reported 9.2667335…, which this case held by monotonicity, by more than 0.1332. Its complete replay here on 2 October 2026 returned the certificate’s own record at all 201 directions, so it was the verified lower bound until 5 October. Hosono’s README says parts of the work were produced with AI assistance under human direction.

Previously, the packing gave s(84)≤9.70710679, and the verified lower bound then was s(84)≥9411/1000=9.411, from Hosono’s mixed rectangle-density certificate of 5 October, leaving a gap of 0.2961.

The packing

Found by Göbel in 1979, via a diagonal-strip construction — the strip family at a=8, whose side is 9+2/2 exactly. cases/gobel_strip builds it and verifies it exactly over Q(sqrt 2), which is what moved verified_upper_bound from the grid ceiling onto the exact side. The retained witness declares that side rounded down at its own digits — about 4.85×10−30 below the exact value — and a different slack choice for the strip, so the certificate carries the construction’s coordinates rather than the witness’s (D-398).

The lower bound

Before 2 October the selected external report was [Friedman DS7], which gives the lower-bound expression 942/41+247/41 for s(84) (approximately 9.266733533246). Friedman’s DS7 survey, Theorem 9, k=9, reports this bound at n=82; 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=9 that point pattern leaves a unit square empty (review). Inherited at n=84 by monotonicity. That changed the reported source field only; the verified field now holds Hosono’s replayed mixed certificate. The source audit compares the exact theorem expressions separately from opaque table decimals.

The verified field rests on a complete decision here (E-n084-wand125-mixed-9411-sqverify-fast-replay, V3/C3) of Hosono’s mixed certificate of 5 October by sqverify-fast, this repository’s clean-room measure verifier: all 201 net directions of the retained candidate on 5 October 2026, with two mutants scaled below coverage one refused. It shares no code with the source’s checker, so it decides coverage a second way with the same method; the source’s own checker was not run here.

From 2 October 2026 until this decision the verified field rested on a complete replay here (E-n084-wand125-mixed-940-source-replay) of the source’s certificate mixed_n84_L940, at 47/5: the source’s unchanged checker and per-angle functions on the pinned bundle, all 201 directions, each returning the certificate’s own record.

Until 2 October 2026 the verified lower bound was Nagamochi’s general closed form, now a reported bound (see the correction below). Karakuş’s general bound, independently verified here and below this certificate at this n, applies to every nonsquare N≥8:

s(N)≥12+N−⌊N⌋+14

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), 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.

See the Frontier corpus summary for the current aggregate count; source-reported bounds are recorded separately.

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-n84-94225-sqverify-fast-replay replayed here shared components V-sqverify-fast (first-party)
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 19396104121019396104121/2000000000000000000000, displayed upward as 9.6980520605096981. 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-130)

Couzo’s refinement of Xu’s packing, reported in a comment on pull request #460, at exact side 9697934799014921307163820128651/1000000000000000000000000000000, displayed upward as 9.6979347990149214 (T-130). The certificate gives a rational side and, for each of the 84 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 s(84)≤9.6979347990149214, 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, 9.6980520605096981 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 9.697934799017, stay verified and are not selected. T-174 at 9.6979347990149214, 9.70×10−20 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 9.69793479901492131 (T-174). The certificate gives a rational side and, for each of the 84 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(84)≤9.69793479901492131, 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-130 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, 9.6979347990149214 from Xu’s packing, improved by Couzo (T-130), stays retained with its own replay as history. The other certificates confirmed here at this count, T-138 at 9.697934799017 and T-125 at 9.6980520605096981, stay verified and are not selected.