I use a very fast algorithm for computing primality. It is based on a "primal library." Once built, a primal library provides the fastest possible method of finding prime numbers. I use a miniature library, capable of searches up to 1e+8 (100,000,000).