Prime numbers play an important role in pure mathematics and its applications. Knowing whether close pairs of primes go on forever would tell us how tightly primes can keep clustering; work on this has already produced new methods and an online collaboration among mathematicians.
What we know
Since 2013 we know there are infinitely many pairs of primes separated by a bounded gap; the bound was 246, and a 2026 preprint lowers it to 240.
What blocks us
Bringing the gap down to 2 seems to need fundamentally new ideas.
Current leads
Refinements of sieve methods.
Sub-questions
Can the 'parity problem' be overcome? Sieve methods alone cannot push the gap below 6.
Is the generalized Elliott–Halberstam conjecture, about how evenly primes are spread out, true? It would bring the bound down to 6.
How short can an interval be and still contain three or more primes infinitely often?