primesieve
Primes
Our great sponsors
primesieve | Primes | |
---|---|---|
8 | 45 | |
898 | 2,362 | |
- | 1.4% | |
9.4 | 7.0 | |
10 days ago | about 2 months ago | |
C++ | C# | |
BSD 2-clause "Simplified" License | - |
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
-
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.
Primes
- Primes – A Software Drag Race
- Is this an efficient way to check if a number is prime number?
- I need some help on a project!!!
-
Has anyone solved the prime number problem on SPOJ yet using pure python?
Take a look at Dave Plummer’s Prime Sieve project.
- Top 5 Fastest Programming Languages: Rust, C++, Swift, Java, and 90 more compared!
-
Zig wins Dave Plummer's prime sieve benchmark ... but via a problematic metric
There's a dedicated and quite cool website where you can browse the benchmark results: https://github.com/PlummersSoftwareLLC/Primes
- Since when did Python haters spread out everywhere? Maybe DNF5 would be faster because of ditched it, maybe.
- creating a vec takes forever?
-
Python vs. Nodejs vs. Lua
Should look into Software Drag Racing https://github.com/PlummersSoftwareLLC/Primes
-
We wouldn’t even consider writing back-end code for a website CMS in anything other than C, and we certainly wouldn’t use any of the interpreted languages that have sprung up in the last couple of decades and positioned themselves as the de facto go-to standards for web development.
Compiler WTF??? Can't you just use xxd to turn a hexdump into a binary like a real programmer would do?!?
What are some alternatives?
primecount - 🚀 Fast prime counting function implementations
PrimesResult - The results of the Dave Plummer's Primes Drag Race
prime-spirals - Creates images of prime numbers in various spiral patterns.
RoaringBitmap - A better compressed bitset in Java: used by Apache Spark, Netflix Atlas, Apache Pinot, Tablesaw, and many others
QuantLib - The QuantLib C++ library
Mudlet - ⚔️ A cross-platform, open source, and super fast MUD client with scripting in Lua
Riecoin - Riecoin Core repository. Riecoin Whitepaper: https://riecoin.xyz/Whitepaper
LMRTFY - Let Me Run That For You: A C++20 Thread Pool Library
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
nimpylib - Some python standard library functions ported to Nim
rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266
pictoprime - Generate prime numbers from pictures!