VOOPA GOLDBACH LAB · SERVER-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
The worker runs on the server independently of open browsers. PostgreSQL stores one prime pair per even number and simple pass markers for the local and PARI/GP checks. Certificate files are not stored; people can download the pair records and check them with the Lab’s independent tools.
Consecutive Goldbach records
| Even number | Prime pair | Prime checks |
|---|---|---|
| No computation recorded yet. Start the run to create the first checkpoint. | ||
The table shows the latest 100 rows. The download contains every saved pair through this frontier, one compact JSON record per line, with the two check markers.
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 deterministic stream stops at 2⁶⁴. The separate ECPP stream can continue with proof certificates, subject to compute time.