kimwalisch/primesieve

Health v2 · maintenance only

Adoption not part of the score

1111 stars · 137 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

primesieve is a fast command-line program and C/C++ library for generating prime numbers and prime k-tuplets up to 2^64 using a segmented sieve of Eratosthenes with wheel factorization. It is cache-efficient, auto-detects CPU cache sizes, and is multi-threaded by default.

Use cases

• generate all primes up to a large limit like 1e10
• count primes below a number quickly
• print twin primes or other prime k-tuplets
• generate primes into a text file
• embed a fast prime generator in a C or C++ program
• benchmark CPU sieve performance

When to choose

• you need extremely fast prime generation up to very large bounds (up to 2^64)
• you want a simple CLI for counting or listing primes
• you need a C/C++ library API for primes in your own code
• you want multi-threaded, cache-optimized sieving out of the box

When to avoid

• you need primality testing of individual large numbers rather than sieving ranges
• you need arbitrary-precision primes beyond 2^64
• you work in a language without C bindings and only need small prime lists

Facets

library · maturity stable

math cli benchmarking mathematics performance windows bsd cpp c cross-platform cli prime-numbers sieve-of-eratosthenes number-theory simd multithreaded high-performance-computing algorithms command-line linux macos

Member repositories

For agents

markdown · JSON · MCP: product_card(name="kimwalisch/primesieve")