Give hard problems
more minds.
MathGrinder turns open mathematical questions into small, verifiable searches that anyone can help explore.
Big questions. Tiny proofs.
Every result is independently checked before it counts. Together, thousands of small computations become a trustworthy map of what we know — and where the unknown begins.
Goldbach conjecture
Can every even number greater than two be written as the sum of two prime numbers? It is one of mathematics’ most elegant unsolved questions.
Open mission page →More open problems.
Every workbench is a small, verifiable search any browser can contribute to.
Prime frontier
Search Proth and generalized Fermat primes. Each discovery is re-proven by the server before it enters the registry.
MISSION / 003Fibonacci frontier
Screen prime-index Fibonacci numbers as probable primes — a PRP lead is not a prime until it is independently certified.
MISSION / 004Bitcoin Puzzle
Demonstrate incremental secp256k1 key search against published puzzle addresses — honestly, not competitively.
MISSION / 005RSA Challenge
Explore the open RSA-270+ factoring moduli and why recovering the two prime factors stays so hard.
MISSION / 006N-Queens counting
Count exactly how many ways twenty queens can share one board. Each subtree is enumerated in a browser and sealed once independent runs agree.
MISSION / 007Erdős–Straus
Extend the verified frontier of unit-fraction witnesses, one block of odd n at a time — every triple re-proved by the server.
MISSION / 008Sums of three cubes
Grow an expanding search box for each k, hunting integer triples whose cubes sum exactly to the target.
MISSION / 009Three-body orbits
Comb a family of initial conditions for periodic three-body trajectories, refined in the browser and re-integrated on the server.
Curiosity, multiplied.
MathGrinder gives every visitor a small, useful piece of a much larger search.
- 01
Choose a mission
Start with an open question, built to be explored one precise case at a time.
- 02
Grind a result
Your browser searches a tiny batch in the background using deterministic math.
- 03
Verify together
Independent checks turn every returned result into shared mathematical evidence.
Honest about
the frontier.
MathGrinder is a transparent, server-verified playground for distributed arithmetic. Every accepted result is independently re-checked with deterministic math before it is recorded. But the searches are far behind specialized academic and GPU projects: browser arithmetic is correct yet slow, the Goldbach frontier you help extend was already verified by a historical supercomputer study, and a Bitcoin puzzle of any serious size is out of reach in a browser. Fibonacci PRP leads are not primes until a separate proof worker certifies them. This site states those boundaries plainly — it shows how verifiable distributed computation works, rather than pretending to out-grind dedicated hardware.