CUDA (GPU) implementation of the sieve of Eratosthenes.
-
Updated
Apr 27, 2026
CUDA (GPU) implementation of the sieve of Eratosthenes.
University project mainly involving Mersenne numbers.
A simple yet very fast optimized version of the Segmented Sieve Algorithm based on the Sieve of Eratosthene
Passive Container Segmented Sieve GC-60. A structurally independent approach to prime sieving based on blind pattern translation over fixed mod-60 residues. V3.0.0 reference implementation for research and experimentation.
segmented prime sieve. uses a sliding window accumulating primes in a binary file.discovering primes with impressive range.
Fast Prime Counting (π(x)) with Fine-Grained Prefix Table
rust implementation of window sieve a windowed prime sieve.
High-performance Goldbach conjecture verifier — 206 M/s integers at 10 ^12 in range 10^18
Add a description, image, and links to the segmented-sieve topic page so that developers can more easily learn about it.
To associate your repository with the segmented-sieve topic, visit your repo's landing page and select "manage topics."