T-118: Exact rational ceiling refinements at n=68

V3 C3 Upper bound confirmed superseded by T-174

2026-10-07 published · Rehwaldt after Couzo and earlier contributors · n=68

Complete exact replay, reproduced with the producer's code, confirms the finite rational upper-bound refinement at n=68. Only finite feasibility enters; no optimality claim is registered.

Significance, composition and next rung
Significance
The same at n=68: a refinement of Couzo's packing by about 4.3e-12, a re-solve at the scale of its rounding, S2 as T-117 and T-098 are. Confirmed on 11 October.
Composition
The exact half-angle map gives unit frames; translating each already repaired source center by S/2 gives the lower-left frame. The complete rational side is authoritative and no coordinate or side is rounded.
Next rung
C4 requires two distinct accepted confirming adversarial reviews and an actual human oversight record; neither publication nor input admission supplies them.
Novelty
previously-published Present in an identified source

The case

Case record
Regularized by the Squares Project with its own axis tool (regularize_axis_components/2)
As published
The packing as published, Couzo 2026 [PingYou PR 574 certificates 2026-10-13]

n=68

8.538.799
8910
8.2469.246
nn+1

Proven

8.53000≤s(68)≤8.798796

  • exact

Citation record n-068

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

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

Open

  • optimality

The case record

LowerUpper
Gap0.26879523…

Results on the case

15 results in the register on n=68, 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-205

    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-22 published T-044

    Weighted point lower bounds for ten counts in n=26…72, plus seven from the same files

    V3 C3 Lower bound confirmed superseded by T-205

    Hosono after Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 point bounds 2026 · packet · source · review · register

  4. 2026-09-27 published T-046

    Rectangle-density lower bounds reported for 48 counts in n=18…95

    V0 C0 Lower bound recorded superseded by T-205

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026 · wand125 rectangle bounds 2026-09-28 · packet · packet · register

  5. 2026-09-27 published T-056

    Smaller packings for 49 counts from n=68 to 307, each certified two independent ways

    V3 C3 Upper bound confirmed superseded by T-174

    Couzo · franciscouzo square-packing 2026-09-27 · packet · register

  6. 2026-09-28 published T-070

    Rectangle-density lower bounds replayed at 25 counts in n=29…95

    V3 C3 Lower bound confirmed superseded by T-205

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-09-28 · packet · packet · source · review · register

  7. 2026-09-29 published T-058

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

    V3 C3 Method limit confirmed

    Hosono after Tokoharu, Daniel · wand125 tools 2026 · packet · register

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

    Karakuş · Karakuş 2026 · source · register

  9. 2026-10-01 published T-068

    Rectangle-density lower bounds verified at 34 counts in n=19…95

    V3 C3 Lower bound confirmed on this case, superseded by T-205

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-10-01 · packet · source · review · register

  10. 2026-10-01 published T-074

    Rectangle-density lower bounds replayed at 31 counts in n=19…95

    V3 C3 Lower bound confirmed on this case, superseded by T-205

    Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-10-01 · packet · packet · source · review · register

  11. 2026-10-05 published T-098

    Exact optima of 48 known-best packings: s(n) ≤ S', 3.5e-13 to 5.0e-11 below each printed 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

  12. 2026-10-07 published T-118 this result

    Exact rational ceiling refinements at n=68

    V3 C3 Upper bound confirmed superseded by T-174

    Rehwaldt after Couzo and earlier contributors · Rehwaldt n68 refinement 2026-10-07 · packet · register

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

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

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

  15. 2026-10-16 published T-205

    Mixed rectangle-measure lower bound s(68)≥853/100 verified, on the 201-direction net

    V3 C3 Lower bound confirmed

    Hosono after Tokoharu and Levy · wand125 fine-net lower bounds 2026-10-16 · packet · source · review · register