DISTRIBUTED VERIFICATION NODE
Goldbach computation network
This browser is assigned consecutive even integers and searches for a prime-pair witness for each. The coordinator independently validates every returned witness before advancing the contiguous frontier.
You can contribute to mathematical discovery by leaving this page open in your browser.
WORK EXECUTION
IDLELocal worker
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
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 Miller–Rabin testing for the 64-bit range. A client cannot advance the network state with an invalid witness.
Execution modes
CPU mode performs the entire search with BigInt. GPU / hybrid mode sends thousands of candidate pairs to a WebGPU shader, which rejects pairs divisible by small primes in parallel. Every survivor is then checked by the CPU with the full deterministic 64-bit test. This is a real GPU acceleration path, not a mathematical proof on the GPU; if WebGPU is unavailable it falls back to CPU and tells you.
Why begin after 4 × 1018?
This network starts immediately after 4,000,000,000,000,000,000 because that is the upper bound of the strongest peer-reviewed, exhaustive computational verification of the binary (strong) Goldbach conjecture: every even integer through that bound was confirmed to be a sum of two primes by Tomás Oliveira e Silva, Siegfried Herzog, and Silvio Pardi.
The authors’ verification project reports that its results were double-checked through 4 × 1017. Their published paper details a full final re-check through 3 × 1017, with targeted and sampled re-checks above that.
Oliveira e Silva, T., Herzog, S., & Pardi, S. (2014). Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4 · 1018. Mathematics of Computation, 83(288), 2033–2060. The article was published online November 18, 2013.