The Man Who Worked At Subway, Then Made The Biggest Prime Breakthrough in Decades

Anonymous submission stuns editors

On April 17, 2013, the Annals of Mathematics received a 50-page proof from an unknown author claiming to solve a critical aspect of the twin prime conjecture.

Unexpected validation

Editors anticipated finding errors within an afternoon but instead confirmed a legitimate breakthrough after finding no mistakes in the fragile sections where such proofs typically collapse.

The infinite pairs conjecture

Twin primes are pairs separated by exactly 2 (e.g., 11 and 13), and the conjecture posits that infinitely many such pairs exist despite primes becoming increasingly rare at higher numbers.

Hardy-Littlewood heuristic

In 1923, G.H. Hardy and John Littlewood developed a formula estimating twin prime counts as N/(ln N)², which predicts growth with 99.999% accuracy up to 1 trillion but cannot mathematically guarantee infinite existence.

Brun's error term explosion

Viggo Brun adapted the Sieve of Eratosthenes for twin primes but encountered error terms growing roughly as 4^K, which overwhelmed the main term and prevented proving the infinity of twin primes.

Chen's 1973 near-miss

Chen Jingrun proved there are infinitely many primes P where P+2 has at most two prime factors, representing the closest possible result to the conjecture without proving both numbers are prime.

Arbitrarily small gaps proven

In 2005, Goldston, Pintz and Yildirim proved that gaps between consecutive primes can be made arbitrarily small fractions (approaching 0%) of the average logarithmic gap infinitely often.

Theoretical barrier encountered

While the GPY technique suggested bounded gaps were possible, it hit a theoretical wall that prevented establishing any concrete finite bound between prime pairs until the 2013 submission.