Twin Prime Conjecture Explained: Is It Proven?
Quick answer: The twin prime conjecture says that infinitely many pairs of prime numbers differ by exactly 2, such as 11 and 13. As of November 21, 2026, it remains unproved. Bounded-gap results establish infinitely many pairs of consecutive primes within a fixed distance, most recently claimed at 186 and then 182 in 2026 manuscripts, but they have not established infinitely many gaps of exactly 2.
Below 100 there are eight twin-prime pairs: (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61) and (71, 73). Finding more examples adds evidence. Proving that the pairs never run out requires an argument that covers arbitrarily large numbers, and that argument has never been found. You can find the pairs yourself with our Prime Number Checker.
2026 update: OpenAI reported a prime-gap bound of 186, and a later manuscript posted by mathematician Romyar Sharifi reports 182. The table below explains what each claim is and how far it has been verified.
What Is a Twin Prime?
A twin prime pair is two primes that differ by 2. Both numbers must be prime: (11, 13) qualifies, but (23, 25) does not, because \(25 = 5 \times 5\). Apart from (3, 5), every twin pair has the form \((6n – 1,\; 6n + 1)\), since any prime above 3 is one more or one less than a multiple of 6. But the form alone is not enough, as (23, 25) shows.
| Below \(x\) | Twin-prime pairs with both primes below \(x\) |
|---|---|
| 100 | 8 |
| 1,000 | 35 |
| 10,000 | 205 |
| 100,000 | 1,224 |
| 1,000,000 | 8,169 |
Hardy and Littlewood (1923) made a conjectural prediction for how many pairs lie below \(x\): about \(1.32\,x/(\ln x)^2\). It is an asymptotic prediction that matches the data well, not an exact counting formula, and it has never been proved.
Three Different “Records”
News stories mix up three separate things:
- Largest known twin primes: \(2996863034895 \cdot 2^{1290000} \pm 1\), found in 2016, each with 388,342 digits.
- Largest observed gaps between primes: long stretches with no primes, found by computer searches.
- Bounded-gap results: proofs that some fixed gap size recurs forever. This is the record that changed in 2026.
What Does the Prime-Gap Bound of 186 Mean?
Let \(p_n\) be the \(n\)th prime. A bound of \(N\) means
\[ \liminf_{n\to\infty}\,(p_{n+1} – p_n) \le N, \]
so infinitely many pairs of consecutive primes are at most \(N\) apart. A bound of 186 does not mean every prime gap is at most 186, and it does not mean a gap of exactly 186 repeats forever. The twin prime conjecture is the much stronger statement that gaps of exactly 2 repeat forever.
Bounded Prime Gaps: Proven Results and 2026 Claims
| Bound | Who | Date and status |
|---|---|---|
| 70,000,000 | Yitang Zhang | 2013, published |
| 600 | James Maynard | 2013, published |
| 246 | Polymath8 collaboration | 2014, published |
| 240 | Julia Stadlmann | August 31, 2026 preprint |
| 212 | Axiom Math team | Early September 2026 draft; its formal certificate assumes analytic and numerical inputs |
| 186 | OpenAI (GPT-6 Astra) | Released early September 2026; its Lean development keeps three explicit mathematical inputs as axioms |
| 182 | GPT-6 Astra, prompted by Romyar Sharifi | September 2026 claim; the formal development is conditional on stated inputs |
Zhang’s 2013 result was the first time anyone proved any finite bound, and it made him famous almost overnight. The 246 record then stood for twelve years. The 2026 claims are manuscripts, not peer-reviewed papers, and their formal checks rely on stated inputs. An established theorem used as an input is not conjectural; it simply has not been proved inside that particular formal development. Several mathematicians told Science News that the junior researcher whose ideas started the run deserved more careful treatment.
Why Is Reaching a Gap of 2 So Difficult?
Even assuming a strong unproved hypothesis called the generalized Elliott-Halberstam conjecture, the Polymath sieve method only reaches a bound of 6. The obstacle is the parity barrier: these methods cannot reliably tell apart numbers with an odd number of prime factors from those with an even number, counting repeated factors. Proving the twin prime conjecture requires getting past that barrier with a genuinely new idea.
Other Partial Progress
- Brun (1919): the sum of the reciprocals of twin primes converges (to about 1.902), so twins are rare compared with all primes.
- Chen (1973): there are infinitely many primes \(p\) such that \(p + 2\) is prime or a product of two primes.
Evidence Versus Proof
Computers have found enormous numbers of twin primes, and the counts match predictions. But a statement about infinitely many numbers cannot be settled by checking finitely many cases. The Riemann Hypothesis received a Lean-certified proof in November 2026, but that result does not settle the twin prime conjecture, which remains open.
Watch: Twin Primes Explained in Video
If you learn better by watching, these videos are worth your time.
Check Your Understanding
Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.
Answer each question and press Submit to see your result right away.
Frequently Asked Questions
Has the twin prime conjecture been proven?
No. As of November 21, 2026, it is still open. Mathematicians have proved that some gap of at most 246 occurs infinitely often, and 2026 manuscripts claim lower bounds of 240, 212, 186 and 182, but proving that gaps of exactly 2 occur forever remains out of reach.
Does the 186 prime-gap bound prove twin primes?
No. It shows that infinitely many pairs of consecutive primes are at most 186 apart. The twin prime conjecture needs infinitely many gaps of exactly 2.
Why do some sources still list 246 as the record?
246, from the Polymath8 project in 2014, is the last bound published in a peer-reviewed journal. The 2026 bounds of 240, 212, 186 and 182 come from manuscripts whose review and formal checks are still in progress.
What are twin primes?
Twin primes are two prime numbers that differ by 2, such as 3 and 5, 11 and 13, or 59 and 61. Both numbers must be prime.
Keep Exploring
- Riemann Hypothesis Solved? What’s Verified in 2026
- Quasi-Riemann Hypothesis Explained: OpenAI’s Proof
- Twin Primes (Math Dictionary)
- Prime Numbers Chart and List
Sources and Further Reading
Related to This Article
More math articles
- Temperance, Schools, Prisons and Asylums: Reform and Institutional Power
- “Great Resignation” Regret: People Who Want Their Old Jobs Back
- The Second Industrial Revolution and the National Market
- Grade 3 Math: Introduction to Division
- GED Social Studies Practice Questions: 10 Skills to Check Before Test Day
- Presidential nomination process
- 7th Grade STAAR Math Practice Test Questions
- Affordable Online Accounting Degree Programs
- 7th Grade Math: Topics, Standards, and Free Practice
- 8th Grade RISE Math Worksheets: FREE & Printable


What people say about "Twin Prime Conjecture Explained: Is It Proven? - Effortless Math"?
No one replied yet.