about prime number generation

[Paul Zimmermann]

> Thank you for your reply! It is useful. However, I need to get primes up to 10^12 (about 2^40), hence my question. I know there are deterministic versions of Miller Rabin that do this, but I don’t know what variety of primality testing you are using, hence the question I posed. If you know this, it would be great to know. Thank you indeed! If I succeed in what I want to do, then I will require many larger primes. But all primes under 2^40 would be great.

some useful information (for GMP 6.1.2) can be found in the file
utils/gmp_aux.c from cado-nfs (comment just before ulong_isprime).

Best regards,
Paul Zimmermann