// Audit of QUESTIONS.md row 437 (Q-doubling-killrun-0830). Exact arithmetic. const f=(x,n)=>x.toFixed(n); const isP=n=>{if(n<2)return false;for(let i=2;i*i<=n;i++)if(n%i===0)return false;return true;}; const pi=n=>{let c=0;for(let i=2;i<=n;i++)if(isP(i))c++;return c;}; console.log('=== 1. N = pi(2s) - pi(s) and the 2^N floor at the chain rungs ==='); console.log(' s pi(s) pi(2s) N 2^N'); for(const s of [16,32,64]){ const N=pi(2*s)-pi(s); console.log(' '+String(s).padEnd(7)+String(pi(s)).padEnd(8)+String(pi(2*s)).padEnd(9)+String(N).padEnd(5)+Math.pow(2,N)); } console.log(' the row asserts the floor 2^N gbar(s) alone exceeds 8 Ghat(s) at rungs 16, 32, 64;'); console.log(' the N values above are what that rests on, and they are exact.'); console.log('\n=== 2. The floor already beats the TRUTH at s = 16, before any product ==='); const Kstar1=18; // K*+1 at 13#->31#, s = 16; verified cell for cell in my return #75 console.log(' true K*+1 at s = 16 : '+Kstar1+' (attack-kstar-01 section 1; verified in #75)'); console.log(' composed PRODUCT bound : 540 -> loose by '+f(540/Kstar1,1)+'x'); console.log(' composed FLOOR 2^N, N = '+(pi(32)-pi(16))+' : '+Math.pow(2,pi(32)-pi(16))+ ' -> already '+f(Math.pow(2,pi(32)-pi(16))/Kstar1,2)+'x the truth'); console.log(' => the 540 is not what closes the route. The FLOOR does: any composition of'); console.log(' per-fold bounds is at least 2^N, and 2^N alone exceeds K*+1 at s = 16.'); console.log(' The product figure shows how loose the composition is; the floor shows no'); console.log(' tightening of the per-fold bounds can rescue it. Those are different claims,'); console.log(' and the second is the decisive one.'); console.log('\n=== 3. Why the floor closes it for ALL large s, not just the rungs ==='); // N = pi(2s) - pi(s) ~ s/ln s (PNT / Bertrand), so 2^N = exp(N ln 2) is superpolynomial in s. console.log(' s N = pi(2s)-pi(s) s/ln s 2^N'); for(const s of [16,32,64,128,256,512]){ const N=pi(2*s)-pi(s); console.log(' '+String(s).padEnd(7)+String(N).padEnd(18)+f(s/Math.log(s),2).padEnd(11)+ (N>60?('2^'+N):Math.pow(2,N).toExponential(3))); } console.log(' N ~ s/ln s by PNT, so 2^N = exp(N ln 2) = exp(0.693 s/ln s): SUPERPOLYNOMIAL.'); console.log(' Any polynomial ceiling on Ghat is therefore beaten for all large s, which is'); console.log(' the row\'s "beats the cited polynomial ceiling on Ghat for all large s".'); console.log(' VERIFIED as asymptotics; the ceiling itself I take as cited.'); console.log('\n=== 4. The remaining stated figures ==='); console.log(' "540 against 18 at s = 16": ratio '+f(540/18,1)+'x'); console.log(' "8 of 14 enumerable steps starting at s = 9": 8/14 = '+f(8/14*100,1)+' % of the steps'); console.log(' "the weighted run sits at 0.83 of its allowance at s = 16": 0.83 < 1, so the'); console.log(' run itself is INSIDE the allowance - the route fails on the CERTIFICATE, not'); console.log(' on the object. That distinction is the row\'s, and it is the right one: (M8)'); console.log(' is left exactly where it was, OPEN.'); console.log(' "the sum form is false at seven steps and the max form is a floor": consistent'); console.log(' with the product being the only valid composition, which is what makes the'); console.log(' 2^N floor unavoidable.');