// Job 2830 / route 135 triage: exact decomposition of #159's max_theta N_new/RHS and a seeded shuffle null. // Tile of x#: residues r with gcd(r(r+2), x#) = 1 (D = prod_{3<=p<=x}(p-2)). Fold x -> q: q copies shifted by x#, // delete n with n = 0 or -2 (mod q). RHS as in research/attack-foldL-03-transport.js tctRHS (LMAX 8, theta grid in 6s). // usage: node null.mjs const [x, q, K, seed] = process.argv.slice(2).map(Number); const PR = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(p => p <= x); const W = PR.reduce((a, p) => a * p, 1); const slots = []; for (let r = 1; r < W; r += 2) { let ok = true; for (const p of PR) if (r % p === 0 || (r + 2) % p === 0) { ok = false; break; } if (ok) slots.push(r); } const D = slots.length; const gaps = new Int32Array(D); for (let i = 0; i < D; i++) gaps[i] = (i + 1 < D ? slots[i + 1] : slots[0] + W) - slots[i]; const LMAX = 8, NB = 4200; const qual = g => { const r = g % q; return r === 0 || r === 2 || r === q - 2; }; function rhsOf(g) { const rhs = new Float64Array(NB), r0 = new Float64Array(NB); for (let i = 0; i < D; i++) { const b = g[i] / 6; if (b < NB) { rhs[b] += q - 2; r0[b] += q - 2; } } for (let i = 0; i < D; i++) { let s = g[i], ok = true; for (let L = 1; L <= LMAX; L++) { if (L >= 2 && !qual(g[(i + L - 1) % D])) ok = false; s += g[(i + L) % D]; if (!ok) break; const b = s / 6; if (b < NB) rhs[b] += 2; } } for (let b = NB - 2; b >= 0; b--) { rhs[b] += rhs[b + 1]; r0[b] += r0[b + 1]; } return { rhs, r0 }; } // fold the word with gaps g (positions start at slots[0]); count new gaps per theta bin; also nu(i,0) sum per bin function newTail(g) { const nn = new Float64Array(NB); let first = -1, prev = -1, pos = slots[0]; const Wq = W % q; for (let k = 0; k < q; k++) { let p = slots[0]; for (let i = 0; i < D; i++) { const n = (p % q + k * Wq) % q; if (n !== 0 && n !== q - 2) { const abs = p + k * W; if (prev >= 0) { const b = (abs - prev) / 6; if (b < NB) nn[b]++; } else first = abs; prev = abs; } p += g[i]; } } { const b = (first + q * W - prev) / 6; if (b < NB) nn[b]++; } for (let b = NB - 2; b >= 0; b--) nn[b] += nn[b + 1]; return nn; } function stat(g) { const { rhs, r0 } = rhsOf(g), nn = newTail(g); let worst = 0, at = 0, viol = 0; for (let b = 1; b < NB; b++) { if (nn[b] === 0 && rhs[b] === 0) continue; const r = rhs[b] === 0 ? Infinity : nn[b] / rhs[b]; if (r > worst) { worst = r; at = b; } if (nn[b] > rhs[b] + 1e-9) viol++; } return { max: worst, theta: at * 6, viol, l0share: r0[at] / rhs[at] }; } // exact L=0 mean-field: sum over gaps >= theta of nu(i,0)/(q-2), nu(i,0) = q - |{0,2,g,g+2} mod q| const nu0 = g => q - new Set([0, 2 % q, g % q, (g + 2) % q]).size; const real = stat(gaps); let s0 = 0, c0 = 0; for (let i = 0; i < D; i++) if (gaps[i] >= real.theta) { s0 += nu0(gaps[i]); c0 += q - 2; } let rng = seed >>> 0; const rand = () => { rng = (rng * 1664525 + 1013904223) >>> 0; return rng / 4294967296; }; const ens = []; for (let k = 0; k < K; k++) { const g = Int32Array.from(gaps); for (let i = D - 1; i > 0; i--) { const j = Math.floor(rand() * (i + 1)); const t = g[i]; g[i] = g[j]; g[j] = t; } ens.push(stat(g).max); } const srt = [...ens].sort((a, b) => a - b), median = srt[Math.floor(K / 2)], at1 = ens.filter(v => v >= 1).length; const mean = ens.reduce((a, b) => a + b, 0) / K, sd = Math.sqrt(ens.reduce((a, b) => a + (b - mean) ** 2, 0) / (K - 1)); console.log(JSON.stringify({ x, q, D, W, real, baseline_uniform: (q - 4 + 4 / q) / (q - 2), nu0_mean_at_argmax: s0 / c0, shuffle: { K, seed, mean, sd, min: Math.min(...ens), max: Math.max(...ens), rank_real_from_top: ens.filter(v => v >= real.max).length + 1, z: (real.max - mean) / sd, median, draws_at_1: at1, q10: srt[Math.floor(K / 10)] } }));