from mpmath import mp
with mp.workdps(140):
m = mp.findroot(lambda t: mp.ellipk(t)-2*mp.ellipe(t),
(mp.mpf(4)/5, mp.mpf(9)/10))
lam = mp.exp(-mp.pi*mp.ellipk(1-m)/mp.ellipk(m))
print(mp.nstr(lam, 100))
print(mp.nstr(1/lam, 100))Halphen's series is evaluated with Arb at 429 bits, including 96 guard bits beyond the requested 100 significant digits. Rational bisection starts in $[1/10,1/9]$ and retains opposite certified endpoint signs until the bracket width is less than $2^{-365}$. If the terms with $k\geq N$ are omitted, their absolute sum is bounded by $\frac98(2N+1)^2 9^{-N(N+1)/2}$ on this bracket. The final bracket is returned as a real ball, and ball division gives its reciprocal. The computed radii are less than $4.8\times10^{-111}$ for $\Lambda$ and $4.1\times10^{-109}$ for $V$.
Independent checks use Arb's complete elliptic integrals at 640 bits to bracket the root of $K(m)-2E(m)$ and evaluate its nome. Controls use the values at $m=0$ and Legendre's relation at $m=1/2$. The divisor-sum series is evaluated independently through $j=240$, with the omitted terms bounded by $\sum_{j\geq241}j^2(1/8)^j$; it gives opposite signs relative to $1/8$ at both endpoints of each stored decimal interval, after inversion for $V$. These checks also test the reciprocal relation and the stated inequalities. The results match all 105 displayed significant digits in [5] and all 101 in [6], and a 150-digit rerun agrees. The attached checks repeat the interval tests on the values read from the database.