Does every even integer above 2 have a pair of primes?
We investigate Goldbach’s 1742 conjecture through reproducible computation. Voopa World Engine and Signal Lab research helps us explore patterns and questions; the pair searches and primality checks shown here use the methods described below. Every computed example is finite evidence; the conjecture remains unproved.
01 / EXPLORE
Choose an even number
64-BIT CHECK · EXTENDED SEARCH
All pairs are listed through 1,000,000. Larger values below 2⁶⁴ show up to 10,000 pairs; bigger inputs run an experimental, stoppable probable-prime search.
Exact browser arithmetic · no account required
YOUR RESULT
A closer look at 100
6 PAIRS
SELECTED PAIR01
3+97=100
✓3 is primeFound using the demo sieve
✓97 is primeFound using the demo sieve
i
Prime certificate
Generate a portable Pratt certificate for both primes in the selected pair.
Quickest: one-file Python checkDownload a self-contained record and separate verifier; Python 3 only, no packages to install.Open Terminal in the downloaded file’s folder, paste this command, then press Return.
python3 goldbach-100-verify.py
More verification optionsSeparate Python script and JSONpython3 verify_pratt.py certificate.jsonDownload standalone verifierOptional PARI/GP ECPP cross-check; install PARI/GP first, then use the same verifier file
python3 goldbach-100-verify.py --pari
NOT CERTIFIED
ALL DISTINCT PAIRSSMALLER PRIME FIRST
Select any pair to certify it.
1–6 of 6
A pair verifies this input only. A finite collection of verified examples does not prove the conjecture for every even number.
HOW THE LAB WORKS
From a search to a checkable result.
The interface separates pair search from the bounded primality checks, so the strength of each result stays visible.
01
Search
List all pairs for smaller inputs. For larger inputs, scan smaller-prime candidates up to 10,000,000 and display at most the first 10,000 pairs.
↗02
Check
Smaller pairs can receive Pratt certificates. Inputs below 2⁶⁴ use a deterministic test; larger values are labeled probable only and can be independently screened again in Python.
◇03
Publish the evidence
Keep the input, pair, method, software versions, and verification result together for inspection.
⌁
THE RESEARCH BOUNDARY
Evidence for cases. A question for all.
For one even number, a certified prime pair proves that number has a Goldbach representation. Checking more numbers extends the verified range. Neither step alone proves the statement for infinitely many even numbers.