Prime Counts
Compares exact browser-capped prime counts with the simple `n / log(n)` approximation.
RiemannX
RiemannX collects numerical experiments around zeta zeros, prime-counting approximations, and Keiper-Li coefficients. These are diagnostics, not proof certificates.
Browser Prime Inspector
Enter an integer to test primality, find nearby primes, and compare exact capped prime counts with the simple n / log(n) approximation.
Prime-Count Curve
browser capVerified Run Artifact
Metadata-complete run output for the public demo. Verified here means reproducible metadata and bounded inputs, not a theorem.
What It Computes
Zero Diagnostics
Records numerical zeta-zero and spacing diagnostics in Python experiments where configured.
Coefficient Signals
Explores Keiper-Li-style numerical signals as search diagnostics, subject to precision limits.
Numerical diagnostics can suggest what to inspect. They do not prove the Riemann Hypothesis.