import numberdb.sage as numberdb
from sage.rings.rational_field import QQ
from sage.rings.real_arb import RealBallField
from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
from sage.libs.pari import pari
r = 1 # any positive integer; the stored reference slice is 1 through 10
S = PolynomialRing(QQ, 'x'); x = S.gen()
A = PolynomialRing(S, 'm'); m = A.gen()
H = S(pari(-4*r).polclass()); h = H.degree()
E = sum((H[i]*(m+16)**(3*i)*m**(h-i) for i in range(h+1)), A(0))
F = S(E.resultant(256*x**4*m-m**2-128*m-4096))
B = RealBallField(600); q = (-2*B.pi()*B(r).sqrt()).exp()
N = 100
v = sum(((1+q**n).log() for n in range(1,N+1)), B(0))
v = v.add_error(q**(N+1)/(1-q))
R = (-24*v).exp()/q
t = ((R+128+4096/R)/256).sqrt().sqrt()
factors = [f.monic() for f,e in F.factor()]
chosen = [f for f in factors if f(t).contains_zero()]
assert t.is_finite() and t > 1 and t.accuracy() > 450 and len(chosen) == 1
chosen[0] # x^4 - 81/32 for r=1The generator uses PARI polclass with its default j invariant [5], exact rational resultants and irreducible factorization. A bounded eta product at 600 bits identifies the positive embedding and excludes every other factor; exact rational endpoint signs and a derivative enclosure certify a unique simple root.
The attached checks use a different elimination through the modular lambda function and independently bounded theta series for all ten entries, together with inverse-period AGM and exact lattice pairings. Exactness concerns the polynomial coefficients, while the root enclosures are auxiliary certificates. These build checks share PARI class polynomials and Sage/Arb; they are not an independent review verdict.