primesieve
🚀 Fast prime number generator (by kimwalisch)
Riecoin
Riecoin Core repository. Riecoin Whitepaper: https://riecoin.xyz/Whitepaper (by RiecoinTeam)
Our great sponsors
primesieve | Riecoin | |
---|---|---|
8 | 2 | |
898 | 12 | |
- | - | |
9.4 | 0.0 | |
9 days ago | 10 days ago | |
C++ | C++ | |
BSD 2-clause "Simplified" License | MIT License |
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.
Riecoin
Posts with mentions or reviews of Riecoin.
We have used some of these posts to build our list of alternatives
and similar projects.
-
Riecoin Core 22.03 and new RIC software released, halving, 1,000,000 RIC Bounty
Riecoin Core 22.03 is out. This version ports the Bitcoin 22.0 improvements and adds a code generator, which can be used for passwordless or 2-factor authentication. It also includes the Bitcoin's Pull Requests 21500 (for exporting Descriptors) and 24058 (for initial Bip 322 message signing support). New wallets can only be Descriptor Wallets, though old Legacy Wallets are still supported.
-
Riecoin Core 0.20.0 released, hard fork information, and new Forum
In order to finalize the fork, the stable version of Riecoin Core 0.20 has been released, and a Mainnet fork block has this time been set. The Riecoin network will hard fork at Block 1482768, or around March 29, which should give plenty of time for anyone still using old versions. Please upgrade to 0.20 as soon as possible! Find the latest binaries here. Exchanges and other services like Block Explorers will directly be notified about the fork.
What are some alternatives?
When comparing primesieve and Riecoin you can also consider the following projects:
Primes - Prime Number Projects in C#/C++/Python
xmrig - RandomX, KawPow, CryptoNight and GhostRider unified CPU/GPU miner and RandomX benchmark
primecount - 🚀 Fast prime counting function implementations
prime-spirals - Creates images of prime numbers in various spiral patterns.
QuantLib - The QuantLib C++ library