The fastest way is probably a fixed N search.
At least thats what it used to be when i was searching for primes. I don't know about changes in sieving, but fixed N sieving used to be much faster. Besides, the size of the number doesn't grow (much) if you don't find a prime.
Just my 2 cents
|