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 →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.