@d_rift well sure but i was thinking p >= (q - 1)/2 or at worst p >= sqrt(q) would be appropriate as opposed to DEMANDING 2p + 1
@d_rift i'm not terribly sure if it's "slower" to iterate over large primes and require q = 2p + 1 vs something like (q - 1)/2 because you'd be somewhat trading off the number of iterations for the slightly smaller prime with iterations for the slightly larger prime
best Xbox One games available as a physical disc