T-156: s(290)≤17.5355339059327376…, by monotonicity from T-155, with its own exact certificate

V3 C3 Upper bound confirmed

2026-10-13 established · Levy after Daniel · n=290

s(290)≤17.53553390593273762200422181052425, which is 70142135623730950488016887242097/4000000000000000000000000000000 exactly, by monotonicity from T-155 (a packing of 291 unit squares contains a packing of 290): T-155 certifies n=291 at exactly this side. It is also the exact side of a rational packing that this project made from the register's known-best witness at n=290 with its grid-slack regularizer, its port of Daniel's coincidence placement, and decided here over Q, a certificate of the catalogue's own packing of 290 squares at that side. Measured here, it is the witness's packing.

The bound is not new. It has followed from T-155's certificate at n=291 since 12 October 2026, when T-155 registered that count at this side; what this result adds is n=290's verified upper bound moved onto the side, and the second certificate, which is of n=290's own packing.

The side is the witness's own, the 36-digit rational promotion of the decimal witness at centre dilation 1. It lies 2.4e-15 below the verified upper bound the record held, 17.53553390593274 exactly, the side of Daniel's exact certificate of the same packing rounded up at the fourteen decimals the catalogue prints (T-101), and 1.8e-19 below that certificate's own side. It is now the exact form of the case's verified upper bound, which the case record still prints as 17.53553390593274.

This is not a new packing: it is the same construction certified at a tighter rational side. The catalogue gives the packing's side as 14 + (5/2)sqrt(2), an irrational number 4.8e-33 below the certificate's side, which no rational certificate reaches, so the ceiling still trails the report there.

The certificate was decided here on 13 October 2026, every pair and every wall over Q, by sqpack.witness.exact_verify and devtools.check_rational_witness_independent, which share no geometry or verification code with each other: valid under both, 41905 pair decisions each. These are the checkers the regularization run decided the view with, so the replay reproduces that decision with the producer's code.

Both refuse the certificate with its tightest pair pushed into overlap and with its box shrunk by one unit of its side's denominator, 2.5e-31: it touches a wall and a neighbour exactly, so that shrink is also the shrink past its least top or right clearance, and the three controls are two distinct mutants.

Measured against the witness's exact frame under the box's eight symmetries, the certificate pairs one to one with the witness by nearest centres, the largest move is 6.0e-31 and none turns by more than 1e-6 as a sine. It draws the same picture as the witness, so the atlas drawing does not change.

The packing is the one the Kingbird catalogue lists, as T-101 records it, and the regularization below names that result. The regularizer is this project's port of Daniel's coincidence placement (https://github.com/evand/square-packing, MIT), devtools.regularize_grid_slack; the run, the exact re-solve, the exact decisions and the registration are this project's. No optimality, local minimum or rigidity is claimed.

Significance, composition and next rung
Significance
The bound already followed from T-155's certificate at n=291 by monotonicity; what this adds is n=290's verified ceiling moved from a fourteen-place round-up onto that side, 2.4e-15 lower, and a certificate of n=290's own packing there: bookkeeping and a routine consequence, S1. No new packing, no new bound, no reported side moved and no theorem; the method is Daniel's, ported here.
Composition
Two certificates prove the bound at the same side. Derived: the minimum over T-155 and the monotonicity step, which is one recorded line (any packing of 291 unit squares contains a packing of 290) carried in the evidence limitations and the n-290 case body. T-155's certificate at n=291 was made by a different generator, Daniel's regularizer through devtools.regularize_evand, and decided by the same two checkers; T-155 sits at V3/C3.

Direct: one machine entry decides n=290's own certificate at the case's verified value, the exact decision here by two checkers that share no code with each other (exact-algebraic), the checkers the producing run used, so reproduced with the producer's code. That is C3 with one machine method, and either route alone keeps the rungs. The identity measurement, the drawing decision and the comparisons with the earlier ceiling, the next count's ceiling, the printed side and the closed form are recorded values and set no rung.
Next rung
V4 and C4 need two adversarial AI reviews of the claim by distinct reviewers and a human oversight record; none is retained. A method-distinct second route, such as the half-angle area route on the certificate, would be shown beside the rung. The catalogue's side is an irrational closed form, which the verified upper bound reaches only through an exact algebraic certificate of the packing at that side.
Regularizations
n = 290: a regularization of T-101’s packing by Levy (regularize_grid_slack/1: Daniel's coincidence placement (evand/square-packing search/regularize reg.coincidences and reg.place, MIT), ported to start from the witness's exact frame and to keep its contacts, then the same-side exact re-solve, through devtools.regularize_grid_slack; the project’s modifications: port of his coincidence placement (regularize_grid_slack/1) rather than his code, same-side exact re-solve (devtools.regularize_same_side); at its own side; identity: measured here; nearest centres one to one; 0 squares moved, at most 5.97e-31; turns up to 8.418e-35°).
Novelty
apparently-novel Not found in the recorded search, subject to its stated gaps

The case

Case record

n=290

17.0317.536
171819
17.02918.029
nn+1

Proven

17.03027≤s(290)≤17.535534

  • exact

Citation record n-290

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

upperFriedman & Ellsworth, Squares in Squares (reported)

Open

  • optimality

The case record

Results on the case

6 results in the register on n=290, 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-156

    Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register

  5. 2026-10-13 established T-156 this result

    s(290)≤17.5355339059327376…, by monotonicity from T-155, with its own exact certificate

    V3 C3 Upper bound confirmed

    Levy after Daniel · register

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