∑MATHGRINDER
← Back to MathGrinderACTIVE MISSION / 001
2n = p + q

Goldbach
conjecture.

Every even integer greater than two should be the sum of two primes. Help investigate the frontier beyond what has already been checked.

CONTIGUOUS FRONTIER4,000,000,000,000,000,000largest server-verified even integer
SERVER-VERIFIED TOTAL0all verified batches are contiguous
ACTIVE WORKERS0heartbeat window: 35 seconds
YOUR CONTRIBUTION

Goldbach workbench

IDLE

CPU mode runs deterministic 64-bit primality checks in a dedicated Web Worker.

Idle. No browser computation is active.

No batch assigned0 / 0
BATCH TIME—
WITNESSES / MIN—
YOUR VERIFIED0
PRIME CANDIDATES0
VERIFICATION PROTOCOL

Result acceptance

For each even integer n, the worker returns p and q. The server accepts it only when p + q = n and both terms pass deterministic 64-bit primality testing.

Built for trust

GPU mode sieves thousands of candidate pairs in parallel, then the CPU performs authoritative checks on every survivor. Every valid result advances our shared frontier.