This is a C++ implementation of J. P. Sorenson's Pseudosquares Prime Sieve algorithm, which is one of the few prime sieving algorithms that is well suited for generating primes > $2^{64}$. The ...

We don't need to check all even numbers, we can make the sieve excluding even numbers and adding 2 to the primes list by default.

abstract: We present a representation of the positive integers in which every composite number is forced to reveal at least one non-trivial factor in time strictly linear in its bit length. The method ...

TAOCP Algorithm P (Print table of 500 primes), GCC -O3 and hand-tuned ARM Assembly performance comparison The Setup: Algorithm: The Art of Computer Programming Vol.1, Algorithm P (Print table of 500 ...