T-187: A smaller packing of 146 squares from Daniel's chain search, started from Xu's packing

V3 C3 Upper bound confirmed

2026-10-14 published · Daniel after Xu · n=146

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

All three retained jobs, the certificate with its duplicate-square and outside-container controls, were decided again here on 16 October 2026 by both maintained exact routes and equal their retained rows, and the frozen comparison rebuilt equal. No route here is the source's code, so the replay is independently re-implemented. The 16 October review found no blocking defect.

The author reports that his two exact rational checkers, verify_cert.py (separating axes) and verify_cert2.py (polygon intersection), accept the certificate and its regularized drawing. The side is the 80-digit KKT point S* = 12.58378219015186034216... scaled by 1 + 1e-20 about the origin corner; the source reports a local minimum strict modulo 59 exact flat motions, 69 corner-corner contacts with no corner-corner MILP descent, and 13 rattlers, and measures it against #505's packing as a different local minimum that agrees to about 1e-7 except a cluster of 10 squares tilted near 42 degrees. Those are numerical evidence, as the source says, not proofs. No source program ran here.

Credit Daniel (https://github.com/evand/square-packing), whose chain search found the packing in a time-travel test started from the public packings of 10 October, and credit Xu's packing of 146 (issue 432, T-125) as its start, as the author asks: two random large perturbations of it and a re-polish, then one exact descent step. The author names Barnett's refinement (T-150, issue 505) as the record it improves and calls the result a different local minimum from it.

Measured pose by pose by the 16 October review, the 146 pairs one to one with Xu's packing under the identity, nine squares moving beyond a tenth (at most 0.478) and 137 staying within one, and the same with Barnett's T-150 (at most 0.453): another arrangement of Xu's design and a refinement of neither, which agrees with the author's start and his different local minimum. Issue 606 states: "The search, the checks and this request were done with Claude (Claude Code). Daniel directed and reviewed the work."

Significance, composition and next rung
Significance
Another arrangement of Xu's design at n=146, a new packing 1.38e-08 below the case ceiling and below every report there, as T-167 is; 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 16 October, is retained.
Regularized drawings
n = 146: a regularization of T-187’s packing by Levy (Daniel's search/regularize (MIT), evand/square-packing@675a5ea, conservative, coincide, through devtools.regularize_evand; the project’s modifications: same-side exact re-solve (devtools.regularize_same_side); at its own side; 8 free squares straightened, 5 free angles moved; identity: measured here; nearest centres one to one; 50 squares moved, at most 0.478386; turns up to 1.06929°).
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, Daniel 2026 [Daniel n146 2026-10-14]

n=146

12.0812.584
121314
12.08313.083
nn+1

Proven

12.08663≤s(146)≤12.583783

  • exact

Citation record n-146

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperDaniel 2026, GitHub (confirmed T-187)

Open

  • optimality

The case record

Results on the case

12 results in the register on n=146, 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

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

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

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

  6. 2026-10-10 published T-146

    Exact rational certificates at fifteen counts from Daniel's regularized record lists

    V3 C3 Upper bound confirmed on this case, superseded by T-187

    Daniel after Xu, Chaoweeraprasit, Polkovskyi, Levy · Daniel regularized lists 2026-10-10 · packet · register

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

    Barnett after Xu, Daniel, Levy · Barnett refinements 2026-10-11 · packet · register

  8. 2026-10-12 published T-168

    A further exact refinement of Xu's packing of 146 squares, after Barnett's

    V3 C3 Upper bound confirmed superseded by T-187

    PingYou Ltd after Xu, Barnett, Daniel, Levy · PingYou n146 refinement 2026-10-12 · packet · register

  9. 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 on this case, superseded by T-187

    PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · PingYou PR 574 certificates 2026-10-13 · packet · register

  10. 2026-10-13 published T-179

    Linear-measure lower bound s(n)≥306/25=12.24 for n=145…149, reported

    V0 C1 Lower bound reviewed

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 linear n145 2026-10-13 · packet · register

  11. 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 on this case, superseded by T-083

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

  12. 2026-10-14 published T-187 this result

    A smaller packing of 146 squares from Daniel's chain search, started from Xu's packing

    V3 C3 Upper bound confirmed

    Daniel after Xu · Daniel n146 2026-10-14 · packet · register