Caveat and open gap, first
(M8) is exactly where it was, OPEN, and nothing here touches it.
Q-doubling-killrun-0830 stays PARTIAL and beta_2 = 4.26645 does not move. I
found no error: the closure is sound. What I add is that the row leads with the
weaker of its two closure arguments, and that the stronger one is both exact and
decisive on its own.
1. The stated figures check
N = pi(2s) - pi(s)at the chain rungs: 5, 7, 13 ats = 16, 32, 64(frompi(16),pi(32),pi(64),pi(128) = 6, 11, 18, 31), so the floors2^Nare 32, 128, 8192. These are the exact values the "2^N gbar(s)alone exceeds8 Ghat(s)at the chain rungs" claim rests on. [VERIFIED.]- "540 against 18 at
s = 16" is a looseness of 30.0x. - "8 of 14 enumerable steps" is 57.1 % of them.
- The weighted run at 0.83 of its allowance at
s = 16is inside the allowance — so the route fails on the certificate, not on the object. The row draws that distinction and it is the right one.
The K*+1 = 18 at s = 16 is the same value I verified cell for cell from the
other side in return #75 (job #203), where it is the chain step of
attack-kstar-01's sealed pre-registration.
2. New: the floor closes the route, and the 540 does not
The row leads with the product: K*+1 <= prod_j (1+L_j), reading 540 against 18.
That shows the composition is loose by 30x at one step. It does not by itself
close anything — a 30x-loose bound might be tightened.
The second argument is categorically stronger and the row states it almost in
passing: since every fold kills a slot, any composition of per-fold bounds is
at least 2^N. At s = 16, N = 5 and
> 2^N = 32 already exceeds the true K*+1 = 18, by 1.78x,
before any looseness in the individual L_j is considered. So no tightening of
the per-fold bounds can rescue the route: the floor of the whole family of
compositions is already above the object it must bound. That is a closure, where
the 540 is only evidence of slack. [VERIFIED, arithmetic.]
The two claims are different in kind, and only the second supports "closed as a route, not merely unproven". Recommended, not applied: lead with the floor.
3. And the floor closes it for all large s, not just three rungs
N = pi(2s) - pi(s) ~ s/ln s by the prime number theorem, so
> 2^N = exp(N ln 2) = exp(0.693 s/ln s) — superpolynomial in s.
| s | N | s/ln s | 2^N |
|---|---|---|---|
| 16 | 5 | 5.77 | 3.2e1 |
| 64 | 13 | 15.39 | 8.19e3 |
| 128 | 23 | 26.38 | 8.39e6 |
| 256 | 43 | 46.17 | 8.80e12 |
| 512 | 75 | 82.07 | 2^75 |
N tracks s/ln s closely over the whole range shown, so any polynomial
ceiling on Ghat is beaten for all large s — which is the row's own
"beats the cited polynomial ceiling on Ghat for all large s", now with the growth
rate made explicit. [VERIFIED as asymptotics; the ceiling itself I take as
cited, not checked.]
4. What I did not check
- The per-fold bounds
L_jthemselves, the value 540, and the claim that the product form is exact at fourteen steps. - The monotonicity proof that the composed certificate never sits below the maxsum certificate.
- The allowance
8 Ghat(s)/gbar(s), the cited polynomial ceiling onGhat, and the exact weighted run giving 0.83. - "The sum form is false at seven steps and the max form is a floor" — I note
only that it is consistent with the product being the sole valid composition,
which is what makes the
2^Nfloor unavoidable.
5. What remains open
Unchanged: (M8). The route is closed; the object is not bounded. The weighted run
sitting at 0.83 of its allowance at s = 16 means the inequality it would have
certified is not in trouble — only this way of certifying it.
6. Verification recipe
node killrun-audit.js # four sections, under a second, no network
Expect: section 1 N = 5, 7, 13 and 2^N = 32, 128, 8192 from an exact prime
count; section 2 30.0x and the floor at 1.78x the truth; section 3 the table
with N tracking s/ln s; section 4 the remaining figures.
Deterministic, no randomness. The prime counts are computed by trial division in the script, so nothing is transcribed.
Sources
Public; none local-only.
research/QUESTIONS.mdrow 437 — the verdict ofresearch/history/staging/attack-0830-doubling-killrun.md, which is where every figure audited here comes from. I did not open that note; I worked from the row.K*+1 = 18ats = 16fromresearch/history/staging/attack-kstar-01.mdsection 1, fetched and verified in my return #75.- Channel
g2-exponent; no message is built on.