"""Independent Fano-tensor construction and exhaustive RREF-subspace sieve.
Unlike compute.py's cyclic-closure joins, enumerates all 417199 subspaces.
Shared input only: exact order lattice bases and Fano orientation convention.
"""
from pathlib import Path
import json,itertools
import numpy as np
from sympy import Matrix,Rational,ZZ
from sympy.matrices.normalforms import hermite_normal_form,smith_normal_form
R=Path(__file__).resolve().parent
D=json.loads((R/'results.json').read_text())
F=np.zeros((8,8,8),dtype=np.int64)
for i in range(8):F[0,i,i]=F[i,0,i]=1
for i in range(1,8):F[i,i,0]=-1
for i in range(7):
 a,b,c=i+1,(i+1)%7+1,(i+3)%7+1
 for x,y,z in ((a,b,c),(b,c,a),(c,a,b)):F[x,y,z]=1;F[y,x,z]=-1

def tensor(B):
 B=Matrix([[Rational(s) for s in row] for row in B]);inv=B.inv();C=np.zeros((8,8,8),dtype=np.int64)
 for i,j in itertools.product(range(8),repeat=2):
  z=Matrix(1,8,[sum(B[i,a]*B[j,b]*int(F[a,b,k]) for a,b in itertools.product(range(8),repeat=2)) for k in range(8)])*inv
  assert all(t.q==1 for t in z);C[i,j]=list(z)
 return C

def sieve(C):
 # Maps applied to bit-coded vectors: no use of compute.py's multiplication table.
 vs=((np.arange(256)[:,None]>>np.arange(8))&1)
 Rs=[];Ls=[]
 for j in range(8):
  Rs.append(((vs@C[:,j,:]%2)*(1<<np.arange(8))).sum(axis=1))
  Ls.append(((vs@C[j,:,:]%2)*(1<<np.arange(8))).sum(axis=1))
 counts=[0]*9;two=0;total=0
 for d in range(9):
  for piv in itertools.combinations(range(8),d):
   free=[(r,k) for r,p in enumerate(piv) for k in range(p) if k not in piv]
   n=1<<len(free);total+=n;seq=np.arange(n,dtype=np.int64)
   B=np.tile(np.array([1<<p for p in piv],dtype=np.int64),(n,1))
   for t,(r,k) in enumerate(free):B[:,r]|=((seq>>t)&1)<<k
   for side,ops in enumerate((Rs,Ls)):
    for op in ops:
     X=op[B]
     for r in range(d-1,-1,-1):X^=((X>>piv[r])&1)*B[:,r,None]
     good=~X.any(axis=1);B=B[good]
     if not len(B):break
    if side==0:counts[8-d]+=len(B)
    else:two+=len(B)
 assert total==417199
 return counts,two,total

out={}
for name,d in D['orders'].items():
 C=tensor(d['basis']);A=np.einsum('ijm,mkn->ijkn',C,C)-np.einsum('jkm,imn->ijkn',C,C)
 H=hermite_normal_form(Matrix(A.reshape(512,8).T.tolist()));S=smith_normal_form(H,domain=ZZ)
 snf=[abs(int(S[i,i])) for i in range(min(S.shape)) if S[i,i]]
 counts,two,total=sieve(C)
 assert snf==d['associator_smith'];assert counts==d['right_ideals_by_codimension'];assert two==d['two_sided_ideal_count']
 out[name]={'right_ideals_by_codimension':counts,'two_sided_ideal_count':two,'all_subspaces_sieved':total,'independent_tensor_HNF_SNF':snf}
 print(name,counts,two,flush=True)
# An explicit deeper-lift check: T_m=Z*1+2^m O, m=1,2.
# Same square-zero radical reduction F2 + F2^7. Normalized cyclic index-8
# right quotients are algebra characters to Z/8 with phi(1)=1, phi(u_i) even.
B=Matrix([[Rational(t) for t in row] for row in D['orders']['E8']['basis']]);u=Matrix([[1,0,0,0,0,0,0,0]])*B.inv();p=next(i for i in range(8) if abs(u[i])==1)
newB=[['1','0','0','0','0','0','0','0']]+[[str(t) for t in B.row(i)] for i in range(8) if i!=p]
C=tensor(newB);vals=np.ones((4**7,8),dtype=np.int64);seq=np.arange(4**7)
for j in range(7):vals[:,j+1]=2*((seq>>(2*j))&3)
cc={}
for m in (1,2):
 Cm=C.copy();Cm[1:,1:,0]*=2**(2*m);Cm[1:,1:,1:]*=2**m
 actual=np.einsum('ijk,nk->nij',Cm,vals)%8;wanted=vals[:,:,None]*vals[:,None,:]%8
 good=(actual==wanted).all(axis=(1,2));cc[str(m)]=int(good.sum())
assert cc=={'1':0,'2':128}
out['same_mod2_deeper_lift_counterexample']={'T_m':'Z*1+2^m E8','normalized_cyclic_index8_right_quotients':cc,'mod2_algebra':'F2 plus a seven-dimensional square-zero ideal'}
(R/'independent-verification.json').write_text(json.dumps(out,indent=2)+'\n')
print('Independent tensor, complete subspace sieve and deeper-lift counterexample PASS')
