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
Usage
from eratosthenes import sieve, count, segmented_sieve, segmented_count
# This is a Sieve of Eratosthenes with wheel factorization.
primes = sieve(1000)
# This uses the same logic to count primes up the argument.
num_primes = count(1000)
# This segmented sieve only uses up to 128 KB main memory
primes = segmented_sieve(1000)
num_primes = segmented_count(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-3.0.11.tar.gz
(8.3 kB
view hashes)
Built Distribution
Close
Hashes for Eratosthenes-3.0.11-cp38-cp38-manylinux2014_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c5625dd6fe823d96b6addaf86e2a2678c2ec29114d46e6dabab6ddd46a2de47e |
|
| MD5 | 3858dc1b5175427fa8edfccb0602d7bf |
|
| BLAKE2b-256 | 83e8096516774d0a1fa5f3348ae4c24432a835f14cff2faa443556e9d888bd71 |
