T-093: s(17)>18641771/4000000=4.66044275

V3 C3 lower bound confirmed

2026-09-30 published · Guzhou0806 after Kleddamag, Mira, Levy · n=17

s(17)>18641771/4000000 = 4.66044275, by Guzhou0806 / N17 project's R071 release of 30 September 2026, on the charge of R068 (T-043). It raised the verified bound by exactly 11/4000000 over T-043's 116511/25000 and leaves 0.0150873 to Bidwell's 4.67553009.

The certificate keeps every point orbit, rule orbit and weight of R068, and its budget of 17000448944 units of 10^-9, and rebuilds every strict core for the smaller parent side 18452000/18641771 in the container 4613/1000, over 5,114 parent-angle intervals that refine R068's 4,991. The source reports a least core charge of 1000026844 over all 5,114 intervals, so seventeen cores exceed the budget by 7404. It refines R070 of the day before, s(17)>46604427/10000000 = 4.6604427 over 5,107 intervals, which it supersedes.

It was replayed here in full on 5 October 2026, the first replay of it outside its source: the source retains a completion summary of its own run and says the row records are missing, and its GitHub Actions replay passed unobserved by its publisher. The source's run_public.js ran Guzhou0806's C++ checker and Kleddamag's Node BigInt checker over every interval, and devtools.audit_guzhou_r071 found the two fresh ledgers identical row for row, every row at 1000026844; the two checkers are T-043's byte for byte and one event-cell method. Both refuse two mutated certificates.

Guzhou0806 / N17 project, n17-square-packing, on R068's continuation of Kleddamag's 4.66001 charge. The package credits Kleddamag for the 4.66001 framework, proof and BigInt checker (Kleddamag building on Squares Project (Joshua Levy), Mira and Guzhou0806), and discloses AI assistance.

Significance, composition and next rung
Significance
The case's verified lower bound, 2.75 x 10^-6 above T-043 from T-043's charge unchanged, a finer catalogue and rebuilt cores: the construction of T-042, which is S2, adding no orbit, rule, weight or method. T-043's step was 156 times this one and T-039's, the S3 precedent the draft weighed, 83 times; R070's obstruction shows the charge cannot reach 1/40000000 further, so this is the end of a recipe rather than an opening. Holding the verified field is a fact about the frontier, not the claim; a reader who weighs it above the size of the step would score S3 by T-039, and the score gates nothing.
Next rung
V4 and C4 need a second adversarial AI review by a distinct reviewer and a human oversight record, as T-043's next_rung says; a second machine method needs the native parent-core route to read the weighted and winning-subset features, which it still cannot. The r071-bound artifact of the source's CI run, which expires on 2026-12-29 and could not be fetched here, holds a third ledger that could be compared row by row with the fresh ones; it would add a comparison, not a rung. R070's obstruction puts the reach of this charge below 186417711/40000000 (review RF-7), so a higher bound needs a new charge or an argument across parents. Rung 5 needs a proof-assistant formalization reviewed by human experts.
Novelty
previously-published Present in an identified source

The case

Case record

n=17

4.664.676
456
4.1235.123
nn+1

Proven

4.66044≤s(17)≤4.675531

  • exact

Citation record n-017

lowerGuzhou0806 after Kleddamag et al. 2026, GitHub (confirmed T-093)

upperBidwell 1998, Squares in Squares (confirmed T-065)

Open

  • optimality

The case record

Results on the case

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

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-08-21 published T-015

    s(17)≥22529/5000=4.5058

    V3 C3 lower bound confirmed superseded by T-093

    Massaccesi after Burns · Burns–Massaccesi n17 · packet · register

  3. 2026-08-31 established T-001

    s(17)≥4426213/1000000=4.426213, from a sixteen-point unavoidable set

    V3 C3 lower bound confirmed superseded by T-093

    Levy after Bentz · register

  4. 2026-08-31 established T-003

    The sixteen-point set's unavoidability ceiling lies in [4426213/1000000,4427/1000)

    V3 C3 method limit confirmed

    Levy after Bentz · register

  5. 2026-09-04 established T-019

    s(n)≥459/100=4.59 for n=17,18,19

    V3 C3 lower bound confirmed superseded by T-093

    Levy after Burns, Massaccesi · register

  6. 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ş; chelokot · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  7. 2026-09-20 published T-032

    s(17)≥461300/99999=4.61304613…, and beneath it Mira's s(17)≥4613/1000

    V3 C3 lower bound confirmed superseded by T-093

    Guzhou0806, Mira after Levy, Burns, Massaccesi · n17 weighted certificates 2026-09-20 · packet · register

  8. 2026-09-21 published T-038

    s(17)>461300/99853=4.6197910929…

    V3 C3 lower bound confirmed superseded by T-093

    Kleddamag after Levy, Mira, Guzhou0806 · Kleddamag n17 certified bound · packet · source · review · register

  9. 2026-09-21 published T-065

    s(17)≤4.6755300936045509…, Bidwell's packing certified exactly

    V3 C3 upper bound confirmed

    Kleddamag after Levy, Mira, Guzhou0806 · Kleddamag n17 certified bound · packet · source · review · register

  10. 2026-09-25 published T-039

    s(17)>231001/50000=4.62002

    V3 C3 lower bound confirmed superseded by T-093

    Guzhou0806 after Kleddamag, Mira, Levy · Guzhou0806 n17 R052 · packet · source · review · register

  11. 2026-09-26 published T-040

    s(17)>232001/50000=4.64002

    V3 C3 lower bound confirmed superseded by T-093

    Kleddamag after Levy, Mira, Guzhou0806 · Kleddamag n17 4.640020 · packet · source · review · register

  12. 2026-09-27 published T-041

    s(17)>466001/100000=4.66001

    V3 C3 lower bound confirmed superseded by T-093

    Kleddamag after Levy, Mira, Guzhou0806 · Kleddamag n17 4.66001 · packet · source · review · register

  13. 2026-09-28 published T-042

    s(17)>233009/50000=4.66018

    V3 C3 lower bound confirmed superseded by T-093

    Guzhou0806 after Kleddamag, Mira, Levy · Guzhou0806 n17 R067 · packet · source · review · register

  14. 2026-09-28 published T-043

    s(17)>116511/25000=4.66044

    V3 C3 lower bound confirmed superseded by T-093

    Guzhou0806 after Kleddamag, Mira, Levy · Guzhou0806 n17 R068 · packet · source · review · register

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

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

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

    Karakuş · Karakuş 2026 · source · register

  17. 2026-09-30 published T-093 this result

    s(17)>18641771/4000000=4.66044275

    V3 C3 lower bound confirmed

    Guzhou0806 after Kleddamag, Mira, Levy · Guzhou0806 n17 R071 · packet · source · review · register