primes

Efficient, purely functional generation of prime numbers

http://github.com/sebfisch/primes

LTS Haskell 23.1:0.2.1.0
Stackage Nightly 2024-12-26:0.2.1.0
Latest on Hackage:0.2.1.0

See all snapshots primes appears in

BSD-3-Clause licensed and maintained by Sebastian Fischer
This version can be pinned in stack with:primes-0.2.1.0@sha256:94885df2e13153e439ca9c6eb1893726776ca7022128fe860278294bad49d6a9,954

Module documentation for 0.2.1.0

Depends on 1 package(full list with versions):
base
Used by 2 packages in nightly-2024-10-08(full list with versions):
monoid-subclasses, real-dice

This Haskell library provides an efficient lazy wheel sieve for prime generation inspired by Lazy wheel sieves and spirals of primes by Colin Runciman and The Genuine Sieve of Eratosthenes by Melissa O'Neil.