TWELVE RUNGS. ONE SEED PRIME. NO PROBABLE-PRIME TEST ANYWHERE.
Build primes. Don't hunt them.
Start from M31 = 2³¹−1. Each rung offers five candidates N = 2kq+1 off the prime q below. Weigh them on the wheel for a coin, prove one with a witness for five, and climb.
THE TOWERRUNG 1 / 12
150 COINS
▲
A tower of proven primes.
Five candidate numbers wait on every rung, and at least one is prime. Weighing costs one coin and catches the easy fakes; proving costs five and settles it. Coins run out; digits do not. Leap while the numbers are small to double your height.
31 BITS · 10 DIGITS1–5 WEIGH · SHIFT 1–5 PROVE · L LEAPROLL IT UP
THE RACK · FIVE CANDIDATES, AT LEAST ONE PRIME
A rung is proved when q | N−1, q > √N, a^(N−1) ≡ 1 and gcd(a^((N−1)/q) − 1, N) = 1: Pocklington, 1914, with Euclid's +1 doing the work.
A DIFFERENT TOWER
Words choose every candidate on every rung; the same words build the same tower for anyone.
THE CLIMB, REPLAYED
Certificates download in the slip format of Lars Rocha's lars_approves_of_pocklington_walk (verify_certificate_json), and the receipt shows the same chain the way pytoolz.numtools.verify_certificate wants it.