Uploaded February 2022 | Updated September 2026, 1 week ago
The first big demo for my homebrew cpu generated prime numbers using a variant of the Sieve of Eratosthenes. Ever since then I’ve had a various comments and requests for more information about the algorithm. This video explains the Sieve and it’s variants with a leaning towards practical implementation, I do cover a few specifics about why I chose this for a first demo but it should serve as a good introduction to the algorithm on it’s own.
This video covers the Sieve, the Segmented Sieve and the Incremental Sieve.
The painting of Eratosthenes I’ve used is “Eratosthenes teaching in Alexandria by Bernardo Strozzi (1635)”
The first big demo for my homebrew cpu generated prime numbers using a variant of the Sieve of Eratosthenes. Ever since then I’ve had a various comments and requests for more information about the algorithm. This video explains the Sieve and it’s variants with a leaning towards practical implementation, I do cover a few specifics about why I chose this for a first demo but it should serve as a good introduction to the algorithm on it’s own.
This video covers the Sieve, the Segmented Sieve and the Incremental Sieve.
The painting of Eratosthenes I’ve used is “Eratosthenes teaching in Alexandria by Bernardo Strozzi (1635)”
