Veritasium
June 14, 2026
TL;DR
Yitang Zhang, a previously unknown mathematician, proved the existence of infinitely many pairs of primes within a bounded gap of 70 million by overcoming a mathematical barrier that experts believed was impossible to cross.
“There could be this fast conspiracy that every time a number N decides to be prime, it has some secret agreement with its neighbor N plus two saying you're not allowed to be prime anymore.”
— Terry Tao
“If they could get to bounded gaps, then they had another method to attack the conjecture. The only problem was that it seemed like their tool ran into a wall.”
— Derek
“I was a young graduate student, I was very lucky to get to go to this meeting. You're surrounded by the world's top experts on this subject... and the upshot of this week was basically that it's impossible.”
— Interviewee discussing the 2005 AIM meeting
“Maybe it's because he was in isolation that he didn't have the group think that the rest of us did.”
— Interviewee reflecting on Zhang
1. The Twin Prime Conjecture and Prime Distribution
Introduction to the twin prime conjecture (primes separated by 2, like 11 and 13) and exploration of how prime gaps behave statistically. Despite growing average gaps, enormous twin primes have been computationally discovered, but computational verification cannot prove infinite existence.
2. Hardy-Littlewood Heuristic and Prime Number Theorem
Hardy and Littlewood developed a heuristic estimate for twin prime counts using the prime number theorem, showing the probability of twin primes near N is roughly 1/(ln N)². This heuristic accurately predicts observed counts but cannot guarantee infinite existence.
3. The Sieve of Eratosthenes and Brun's Adaptation
Viggo Brun adapted the ancient sieve of Eratosthenes to count twin primes, using inclusion-exclusion principles. However, exponentially growing error terms limit the method; Brun proved infinitely many pairs exist where each has at most 9 prime factors, later improved to 2 (Chen, 1973).
4. Bounded Gaps and the GPY Method
Goldston, Pintz, and Yildirim (2005) proved arbitrarily small gaps between primes infinitely often using a weighted averaging machine and arithmetic progression analysis, but hit a ceiling at the 0.5 level of distribution, preventing proof of bounded gaps.
5. Yitang Zhang's Breakthrough (2013)
Unknown mathematician Yitang Zhang, who worked at Subway while pursuing mathematics, proved bounded gaps of 70 million exist by focusing on special arithmetic progressions with only small prime factors, cleverly reorganizing error terms to exceed the 0.5 barrier by 1/584.
6. James Maynard's Orthogonal Approach
James Maynard discovered that the 0.5 level of distribution was a red herring, developing a method requiring only small positive exponents. His approach proved multiple primes fit in bounded windows, reducing the gap to 246 and earning the 2022 Fields Medal.
7. Conditional Results and Current Limits
Assuming the Elliott-Halberstam conjecture reduces the gap to 12; stronger versions reduce it to 6. Without assumptions, 246 remains the best unconditional result as of the video's production.
8. The Role of Isolation and Belief in Progress
Zhang's isolation from the mathematical consensus that the problem was impossible may have enabled his innovation, echoing Bannister's four-minute mile where proving possibility opened doors for others. Uncertainty can be valuable for breakthroughs.