Fast prime generation for Python based on Sieve of Eratosthenes and Trial Division
Project description
Eratosthenes
Fast prime generation for Python based on Sieve of Eratosthenes and Trial Division
Usage
from eratosthenes import sieve, trial_division
# Any of these will produce the prime numbers
# up to the value of their argument.
# This is a Sieve of Eratosthenes ("SoE"),
# with wheel factorization.
p1 = sieve(1000)
# If memory is limited, then SoE can be limited
# to a segment size. Specify it in bits of RAM.
p1 = segmented_sieve(1000, 1 << 36)
# Trial division uses virtually no memory,
# but it's much slower.
p2 = trial_division(1000)
About
Eratosthenes is written in C++17 and bound for Python with pybind11. This makes it faster than just about any native Python implementation of Sieve of Eratosthenes or Trial Division!
Copyright
Copyright (c) Daniel Strano and the Qrack contributors 2017-2024. All rights reserved.
Eratosthenes is provided under an MIT License.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Eratosthenes-1.1.tar.gz
(8.4 kB
view hashes)
Built Distribution
Close
Hashes for Eratosthenes-1.1-cp38-cp38-manylinux2014_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 67497b3ba306f4a28313e2b8f2af5bb3c7880b70df72c272c0e8554876caaf9a |
|
| MD5 | 388abcc7348db512a9ff0f0f67e49bc7 |
|
| BLAKE2b-256 | c6d7fcf6c0de715a9435487d77027b2950feba1888d6849a0acf1b8ba5c49cd2 |
