Sieve of Atkin

A modern primality sieve that uses modular arithmetic and quadratic residue conditions to identify candidate primes up to a limit N, followed by sieving out squares to leave primes; often faster than the classical sieve for large limits with optimized implementations.