"""Structural count for Lambda_Z = Z_3 + 3O (right ideals). See note for the bijection proof.
P_O(x) = C1(x) + C2(x); Z(x) = 1 + x P_O(x)/(1-x^8)."""
import pickle, itertools, json, sys, random
from zorn import mul, E
from lat import hnf, solve_rows, index_exp
from ts import rref, T, N
p=3; MOD=3**6
def gauss(n,k):
    if k<0 or k>n: return 0
    num=1;den=1
    for i in range(k): num*=p**(n-i)-1; den*=p**(i+1)-1
    return num//den
data=pickle.load(open('scratch/ts_data.pkl','rb'))
ts_by_dim={}
for W,(t,tts,TW) in data.items(): ts_by_dim[len(W)]=ts_by_dim.get(len(W),0)+1
C1={}
def add(D,k,v): D[k]=D.get(k,0)+v
for w in range(1,9):
    add(C1,8-w,gauss(8,w)-ts_by_dim.get(w,0))      # non-t.s. W: only K=O
for W,(t,tts,TW) in data.items():
    w=len(W)
    for kb in range(t,9):
        add(C1,16-kb-w,gauss(8-t,kb-t)*p**(w*(8-kb)))
def deep_count(W):
    x=list(W[0]); Sig=T(W); TS=T(Sig)
    assert len(Sig)==4 and len(TS)==7
    # K' = lift(TS)+3O ; z: vector outside TS (mod 3)
    Kp=hnf([list(r) for r in TS]+[[3*(i==j) for i in range(8)] for j in range(8)],8,MOD)
    z=next(E[j] for j in range(8) if solve_rows(Kp,E[j]) is None)
    Kp_basis=[list(r) for r in Kp]
    good=0; Kcount=0
    for cs in itertools.product(range(3),repeat=4):
        gens=[[s[i]+3*c*z[i] for i in range(8)] for s,c in zip(Sig,cs)]+[[3*v for v in r] for r in Kp_basis]
        K=hnf(gens,8,MOD); Kcount+=1
        assert index_exp(K,p)==5
        # reps of K'/K: choose basis vectors of K' independent mod K
        reps=[];cur=K
        for b in Kp_basis:
            if solve_rows(cur,b) is None:
                reps.append(b); cur=hnf(list(cur)+[b],8,MOD)
        assert len(reps)==4 and cur==Kp
        # base point x0 in K with x0 = x mod 3O (x = sum a_i sigma_i mod 3, rref basis => a_i = x[pivot_i])
        piv=[next(j for j in range(8) if s[j]) for s in Sig]
        a=[x[pc] for pc in piv]
        x0=[sum(ai*g[i] for ai,g in zip(a,gens[:4])) for i in range(8)]
        assert all((x0[i]-x[i])%3==0 for i in range(8)) and solve_rows(K,x0) is not None
        for co in itertools.product(range(3),repeat=4):
            xt=[x0[i]+3*sum(c*r[i] for c,r in zip(co,reps)) for i in range(8)]
            if all(solve_rows(K,mul(xt,E[j])) is not None for j in range(8)): good+=1
    return good
if __name__=='__main__':
    lines=[W for W in data if len(W)==1]
    mode=sys.argv[1] if len(sys.argv)>1 else 'sample'
    if mode=='sample':
        random.seed(0); S=random.sample(lines,12)
        for W in S: print(W[0],'trace',(W[0][0]+W[0][7])%3,'deep',deep_count(W),flush=True)
    else:
        tot=0;hist={}
        for i,W in enumerate(lines):
            g=deep_count(W); tot+=g; hist[g]=hist.get(g,0)+1
            if i%100==0: print(i,tot,hist,flush=True)
        C2={12:tot}
        PO=dict(C1); add(PO,12,tot)
        json.dump({'C1':{str(k):v for k,v in sorted(C1.items())},'C2_total':tot,'deep_hist':{str(k):v for k,v in hist.items()},'P_O':{str(k):v for k,v in sorted(PO.items())}},open('results-Z-struct.json','w'),indent=1)
        print('C1',sorted(C1.items())); print('C2',tot,hist)
