k · 2²⁰ + 1
Prime
frontier.
Search fresh Proth candidates and add verified primes to the registry. Use the segmented sieve below to find primes and add them to the shared registry.
YOUR CONTRIBUTION
IDLEPrime workbench
Idle. No browser computation is active.
No lease assigned0 / 0
BATCH TIME—
CANDIDATES / MIN—
BROWSER-LOCAL SCANS0
YOUR VERIFIED PRIMES0
Trust boundary: the server leases work, re-derives each submitted number, and independently tests every claimed prime. Empty or fabricated client reports never advance a trusted total.
Proth numbers
We issue odd k values for k · 2²⁰ + 1. The client may sieve on a GPU, but a CPU performs the deterministic primality test and the server repeats it before recording a discovery.
More experiments
The 64-bit generalized Fermat window is complete and now lives under Other Experiments. This page keeps the active Proth search and registry sieve together.