T-169: A further exact refinement of Xu's packing of 261 squares, after Barnett's
V3 C3 Upper bound confirmed superseded by T-174
One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: .
All three retained jobs, the positive with its duplicate-square and outside-container controls, were decided again here on 14 October 2026 by both maintained exact routes and equal their retained rows. A third exact route, half-extent containment and exact intersection area, decided the certificate with six controls each and held the derived fact to the pinned file it is derived from, fetched at the pin. No route here is the source's code; the source's runs of this repository's two maintained routes on its corners witnesses are its own and decide nothing here, so the replay is independently re-implemented. The 14 October review found no blocking defect.
The author reports that its exact separating-axis checker and a separate rational polygon-intersection checker accept all 261 squares, every wall and all 33,930 pairs, that every one of the 34,974 declared support inequalities holds, with duplicate and outside controls refused and the conversion to its corners Witness/v2 lossless; and that this repository's sqpack exact_verify and check_rational_witness_independent, run unchanged, accept that witness. Those statements are the author's; no source program ran here.
Credit PingYou Ltd (https://github.com/BuddenPing/square-packing-certificates) with this further refinement, as the source asks, of Barnett's refinement (T-150, issue 505) of Xu's packing of 261 (ry-xu, issue 432); the source credits Daniel with the contact-solver source. The pinned source makes no statement about AI assistance.
Measured pose by pose by that review, it is Barnett's packing (T-150) re-solved, no square moved beyond 2e-06; squares touch the box and the closest pair touches, which the closed box allows. At 261 PR 574's certificate (T-174) is smaller, by 1.99e-21, and the house rule of 16 October 2026, which lifted the hold of 15 October, made T-174 the house there, and the adoption of 17 October 2026 (think-3mry) moved the case to it. This entry held the case until then, the smallest certificate there that the hold left in.
Significance, composition and next rung
- Significance
- An exact re-solve 2.98e-13 below the case ceiling, as T-146 and T-150 are; no lower bound or optimum.
- Next rung
- V4 and C4 need a second accepted adversarial review by a distinct reviewer and a retained human oversight record; one AI review, of 14 October, is retained.
- Regularizations
- n = 261: a regularization of T-150’s packing by PingYou Ltd (further exact refinement of Barnett's certificate with Daniel's contact solver; solved to its side; identity: measured here; nearest centres one to one; 0 squares moved, at most 1.414e-06; turns up to 1.185e-06°).
- Novelty
- previously-published Present in an identified source
The case
As published
Proven
- exact
Citation record n-261
lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)
upperXu et al., GitHub (confirmed T-174)
Open
- optimality
The case record
Results on the case
9 results in the register on , oldest first, each with what it established and how it stands now.
2005 published T-007
for
V0 C1 Lower bound incomplete on this case, superseded by T-083 and T-180 (reported)
2026-09-04 published T-085
Nagamochi 2005, Lemma 1 is false for every container with and
V3 C3 Correction confirmed
Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register
2026-09-29 published T-083
for every nonsquare
V3 C3 Lower bound confirmed
Karakuş · Karakuş 2026 · source · register
2026-10-05 published T-101
Exact certificates of 77 catalogue packings:
s(n) ≤ S',1.2e-16to9.8e-15above each sideV3 C3 Upper bound confirmed on this case, superseded by T-174
Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register
2026-10-08 published T-125
Complete rational construction reports at 25 counts
V3 C3 Upper bound confirmed superseded by T-174
2026-10-11 published T-150
Exact rational refinements of Xu's packings of 146 and 261 squares
V3 C3 Upper bound confirmed superseded by T-174
Barnett after Xu, Daniel, Levy · Barnett refinements 2026-10-11 · packet · register
2026-10-12 published T-169 this result
A further exact refinement of Xu's packing of 261 squares, after Barnett's
V3 C3 Upper bound confirmed superseded by T-174
PingYou Ltd after Xu, Barnett, Daniel, Levy · PingYou n261 refinement 2026-10-12 · packet · register
2026-10-13 published T-174
Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own
V3 C3 Upper bound confirmed
PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · PingYou PR 574 certificates 2026-10-13 · packet · register
2026-10-13 published T-180
Closed-form lower bound for every non-square , reported
V0 C1 Lower bound reviewed
Hosono · wand125 closed form 2026-10-14 · packet · packet · register
Links
- On this site
- Case record, · Frontier row, · T-169 in the results table
On GitHub, at main
- Register
- T-169 in
results.yaml, line 21373 - Evidence
E-pingyou-567-certificate-report·E-pingyou-567-exact-feasibility- Proofs and certificates
- certificate
facts - Sources
- PingYou n261 refinement 2026-10-12 (its own site, retained copy)
- Source packet
resources/web/pingyou-n261-refinement-2026-10-12/README.md- Artifacts
8 artifacts and controls
resources/web/pingyou-n261-refinement-2026-10-12/README.mdresources/web/pingyou-n261-refinement-2026-10-12/acquisition/claims.jsonresources/web/pingyou-n261-refinement-2026-10-12/facts/n-261.yaml.gzdevtools/upper_bound_reports.pydevtools/check_half_angle_area.pydocs/project/reviews/review-2026-10-14-upper-bound-imports-561-593.mdtests/test_upper_bound_reports.pytests/test_check_half_angle_area.py- Case file
frontier/n-261.md(verified lower, verified upper, reported lower, reported upper)