#!/usr/bin/env python3
"""Independent exact classic-Q8 Euler coefficients through 5000, with prime audit."""
from pathlib import Path
import json
from cypari2 import Pari
R=Path(__file__).resolve().parent;p=Pari();M=5000
ref=json.loads((R/'q8-magma-results.json').read_text());P=ref['lmfdb_polynomial'];p(f'P={P};NF=nfinit(P);')
spf=list(range(M+1))
for q in range(2,M+1):
 if spf[q]==q:
  for n in range(q*q,M+1,q):
   if spf[n]==n:spf[n]=q
bad=set(int(x) for x in p('factor(NF.index)')[0]);local={};audit=[]
for q in range(2,M+1):
 if spf[q]!=q:continue
 if q in (5,41):
  local[q]=[1]+[0]*M.bit_length();audit.append(dict(prime=q,ramified=True,local_factor=1));continue
 if q in bad:degrees=[int(x) for x in p(f'[v.f|v<-idealprimedec(NF,{q})]')];source='maximal order prime decomposition'
 else:
  f=p.factormod(p('P'),q);degrees=[int(f[j,0].poldegree()) for j in range(f.nrows())];source='exact modular factorization'
 assert len(set(degrees))==1 and degrees[0] in (1,2,4)
 ap={1:2,2:-2,4:0}[degrees[0]];powers=[1,ap];v=q*q
 while v<=M:powers.append(ap*powers[-1]-powers[-2]);v*=q
 local[q]=powers;audit.append(dict(prime=q,trace=ap,degrees=degrees,source=source))
a=[0]*(M+1);a[1]=1
for n in range(2,M+1):
 q=spf[n];v=n;e=0
 while v%q==0:v//=q;e+=1
 a[n]=local[q][e]*a[v]
assert a[1:3001]==ref['certificate']['coefficients']
p('G=galoisinit(NF);TC=galoischartable(G);L=lfunartin(NF,G,TC[1][,5],TC[2]);')
assert a[1:]==[int(v) for v in p(f'lfunan(L,{M})')]
(R/'q8-coefficients-results.json').write_text(json.dumps(dict(label=ref['label'],cutoff=M,polynomial=P,coefficients=a[1:],prime_audit=audit,independent=True),indent=2)+'\n')
print('PASS 5000 exact Euler coefficients, independent prime-factor audit and PARI cross-check')
