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

2026-10-12 published · PingYou Ltd after Xu, Barnett, Daniel, Levy · n=261

One complete rational source certificate reports a finite upper-bound improvement at the exact side it states: s(261)≤60221701896183155925623822067552396531186006689382586124901485272245038570679102391768853738640845762968885190194646113914622817225143520151264873514153447594856784993916447668795594139686908064452561271291314933291180992874044736240078222111748672780052136222253269408041817329591669640100566654264077488796569417423990746316944258046820136508658141713282417630107002587683964892225712832132809051198459587754731837534654563549531425572967566922458827712106584551155379606891894276892745499879038466854033251780879739643554702103280446489851484546104056691503474152741213554587705922412237998514260452502621555989906039903465080299767718489292438151410266412241443553912996153501809246611773602786410917605511496451072010703261644140260354724734077108181090405074464644068238476104240402870056122000746777426989961280021283237882422984517186879213359668962009071281220892663202830388800939868731631999073946444449/3610677900079007969706765943565336768719447884288352204035356284560922367257758833639504829783888314773470186559856651703840826986312510315164755650194437807425149383349412670053592606596086384850274071672011088362441130659512400319497229936794767986753014863986710537052753629434552337631447921268887522107208292732259544414433641519431486273344988404799773016119041232200157601295450248940554312915607588240758183597134737218881654441888759199840243417937275746123252418387728815666095108047599852739142587192176714235571601282650194803742120186930924408146376687967975698205674166080147009184200896016800571473933793928015380986107693008261921638483793126847396768411768614291571832645828780798475334365381997818684448262987968974484285109167302223926052090540071153696848666844652463042625831311185308825340533519645238451116030713985979718105294854931486199059291092660241441782826348588921333492299220000000.

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

Case record
Regularized by the Squares Project with Daniel's regularizer (evand/square-packing, MIT)
As published
The packing as published, Xu 2026 [PingYou PR 574 certificates 2026-10-13]

n=261

16.1616.679
161718
16.15517.155
nn+1

Proven

16.16045≤s(261)≤16.678780

  • 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

LowerUpper
Gap0.51832011…

Results on the case

9 results in the register on n=261, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007

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

    V0 C1 Lower bound incomplete on this case, superseded by T-083 and T-180 (reported)

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085

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

    V3 C3 Correction confirmed

    Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  3. 2026-09-29 published T-083

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

    V3 C3 Lower bound confirmed

    Karakuş · Karakuş 2026 · source · register

  4. 2026-10-05 published T-101

    Exact certificates of 77 catalogue packings: s(n) ≤ S', 1.2e-16 to 9.8e-15 above each side

    V3 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

  5. 2026-10-08 published T-125

    Complete rational construction reports at 25 counts

    V3 C3 Upper bound confirmed superseded by T-174

    Xu · ry-xu square packing 2026 · packet · register

  6. 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

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

  8. 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

  9. 2026-10-13 published T-180

    Closed-form lower bound s(N)≥a(N) for every non-square N≥49, reported

    V0 C1 Lower bound reviewed

    Hosono · wand125 closed form 2026-10-14 · packet · packet · register