VOOPA GOLDBACH LAB · SEQUENTIAL COMPUTATION
Infinity Check
one even number at a time.
A finite, resumable run through the even integers, starting at 4. For each completed value, the lab records one prime pair and the primality-check method. The frontier can grow without a preset end, but every published checkpoint remains finite and does not prove the conjecture for all even numbers.
Consecutive frontier checked
This run, including Pause, Reset, and Export, affects only this browser. It does not pause or change another visitor’s run. The page independently rechecks each returned pair with a second deterministic 64-bit verifier. Only the latest 100 pair rows are retained locally; this is not a stored ECPP/Pratt certificate archive or a replay of the full history.
Consecutive Goldbach records
| Even number | Prime pair | Prime checks |
|---|---|---|
| No computation recorded yet. Start the run to create the first checkpoint. | ||
The table keeps the latest 100 records on screen. The local checkpoint stores the frontier and these recent rows; it is not a complete archive of every pair.
WHAT THIS RUN ESTABLISHES
A finite frontier,
with explicit limits.
Each completed row is one checked example. Progress counts only consecutive even numbers from 4 for which a pair was found.
Search in order
The worker starts at 4 and advances by 2. It does not skip an even number when updating the frontier.
Use a stated primality test
For values below 2⁶⁴, the app uses the fixed-base deterministic Miller–Rabin test. This is an algorithmic primality decision, not a portable ECPP certificate.
Keep the claim finite
The browser runner stops before 2⁶⁴. Continuing past that boundary requires a different, independently verifiable certificate workflow and durable compute service.