A WORKSHOP FOR YOUR BIGGEST NUMBERS
How far can a prime grow?
Choose a summit. Watch the proofs stack up. Take a remarkable number home.
A LITTLE HIGHER. THEN A LOT HIGHER.
Beyond the summit.
Let the tower carry on into thousands of digits. Every new prime is proved, every rung becomes a base camp, and you can pause whenever you like. No coin budget up here.
toward 1,000
Start with M31, a small proven prime. Choose your summit and watch the expedition grow.
0 candidates tried on this rung
Progress stays in this browser. Each proven rung is saved.
Bigger primes take longer—sometimes many minutes, depending on your device and the climb. Leaving this tab pauses the work; return and press Resume. The final prime may land a few digits beyond your goal.
Peek inside the proof & prime
Each rung is N = 2kq + 1, built from the proven prime q below. We keep q above √N, then check a modular power and a gcd: Pocklington’s theorem proves N prime. Keep the certificate to replay every rung with pytoolz.
Start fresh or bring a certificate
Choose expedition words for a repeatable new climb. Keep your current certificate before starting fresh.