∑MATHGRINDER
← Back to MathGrinderACTIVE MISSION / 002
k · 2²⁰ + 1

Prime
frontier.

Search structured families where every candidate can be reproduced, checked, and independently verified — without pretending browser work is proof.

NEXT PROTH k0dispatched, not a claimed proof frontier
SERVER-VERIFIED PRIMES0only independently validated discoveries
ACTIVE SEARCHERS0heartbeat window: 35 seconds
YOUR CONTRIBUTION

Prime workbench

IDLE

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.

WHY THIS IS TRUSTWORTHY

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.

Fermat numbers

The Fermat mode proves each Fₙ = 2^(2ⁿ) + 1 with Pépin's test — a deterministic multiprecision proof: Fₙ is prime exactly when 3^((Fₙ−1)/2) ≡ −1 (mod Fₙ). The audit covers F₀ through F₁₄; larger indices are computationally infeasible here.