primesieve
🚀 Fast prime number generator (by kimwalisch)
prime-spirals
Creates images of prime numbers in various spiral patterns. (by rjrosati)
Our great sponsors
| primesieve | prime-spirals | |
|---|---|---|
| 8 | 3 | |
| 898 | 3 | |
| - | - | |
| 9.4 | 1.8 | |
| 9 days ago | about 3 years ago | |
| C++ | C++ | |
| BSD 2-clause "Simplified" License | Creative Commons Zero v1.0 Universal |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
primesieve
Posts with mentions or reviews of primesieve.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-07-02.
-
The Sieve of Atkin
This is a fascinating Q&A where user GordonBGood analyzes the performance of the Sieve of Atkin and compares it to that of Eratosthenes with a view to practical implementations.
The fast prime generator project primesieve is also relevant: https://github.com/kimwalisch/primesieve
- Primesieve: Fast Prime Number Generator
-
How to implement wheel factorisation?
I've come across this excellent prime sieve on GitHub, and I just want to find out how it generally works. Yes, it's written in C but I plan to make a Python version that uses some of its methods to make a fairly quick prime sieve. However, I'm really not sure how it has implemented wheel factorisation, and no matter how hard I look online, I can't find a good execution of it that works with its segmented approach. Does anyone have any idea how the wheel factorisation is implemented? To my understanding it's a modulus array that tells you which numbers modulo n are definitely not prime leaving you with the candidate primes to check, but I'm not sure how you would implement this inside a segment so that you only check the candidate primes. In the prime sieve on GitHub it somehow finds the next multiple of the prime using its lookup tables, which I cannot decipher.
-
Dave's Garage: Sieve of Eratoshenes Competition
Implementation: https://github.com/kimwalisch/primesieve/wiki/Segmented-sieve-of-Eratosthenes
-
https://np.reddit.com/r/programming/comments/o0x6pk/i_made_a_63_line_prime_number_finder_in_rust_over/h1yev0g/
Here another version that still run fast (between 15 and 20ms). A better implementation of the sieve of Eratosthenes is primesieve. You could also use the sieve of Atkin.
-
I built a prime number finder for fun (over 3000 primes found .3 seconds)
Well, that's fine and all, but factually, its very slow: - https://github.com/kimwalisch/primesieve achieve over a billion prime in the same amount of time
-
high precision text-data-files for Phi, Pi and e ?
The list of primes at primes.utm.edu contains just 50 million primes. A program like Primesieve by Kim Walisch can compute them in a fraction of a second.
-
I understand why the borrow checker won't allow this. But what's my Rust-idiomatic alternative?
There are approximately 193 million primes under 232 which is the square root of 264, you quickly generate a list of all primes using https://github.com/kimwalisch/primesieve - and then do trial division in paralelle on your input set using rayon.
prime-spirals
Posts with mentions or reviews of prime-spirals.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-02-19.
-
[OC] Prime numbers plotted on polar coordinates
Here are a couple of other spirals from a little C++ app I wrote a few years ago: https://imgur.com/a/8QTyxCj On the left are prime numbers spiraled, on the right are random numbers with the same density as the primes. https://github.com/rjrosati/prime-spirals
What are some alternatives?
When comparing primesieve and prime-spirals you can also consider the following projects:
Primes - Prime Number Projects in C#/C++/Python
calc - C-style arbitrary precision calculator
primecount - 🚀 Fast prime counting function implementations
Spiral Framework - High-Performance PHP Framework
QuantLib - The QuantLib C++ library
Riecoin - Riecoin Core repository. Riecoin Whitepaper: https://riecoin.xyz/Whitepaper