A prime sieve or prime number sieve is a fast type of algorithm for finding primes.
A prime sieve works by creating a list of all integers up to a desired limit and progressively removing composite numbers (which it directly generates) until only primes are left.