V· VOOPA CORP.GOLDBACH LAB
RESEARCH PREVIEW Infinity Check ECPP-certified counter Methodology

VOOPA GOLDBACH LAB · COMPUTATIONAL NUMBER THEORY

Does every even integer above 2
have a pair of primes?

We investigate Goldbach’s 1742 conjecture through reproducible computation: search for prime pairs, examine the evidence, and extend finite verification carefully. 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
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.