In 2009, Dan Goldston, János Pintz, and Yıldırım proved that for any positive number ε there exist primes p and p′ such that the difference between p and p′ is smaller than ε log p.[3] This result was originally reported in 2003 by Goldston and Yıldırım but was later retracted.[4][5] Then Janos Pintz joined the team and they completed the proof in 2005 and developed the so called GPY sieve.