Releases: cottrela/prime-formula
Releases · cottrela/prime-formula
Revert CLI feature in previous release
Added big-prime feature
Major update to add BigInt primes.
Updates:
- New feature big-primes support primes larger than 10^38
- Can easily generate 1024-bit RSA primes with 1000 random checks
- Minor cleanup and refactor
- Makes CLI a feature to reduce dependencies
Adding optimized Miller-Rabin primality checks
Major update adds Millar-Rabin primality checks for larger primes
Updates:
- Adds support for generating primes up to 10^38 (near 128-bit limit)
- Adds a 128-bit Millar-Rabin test optimized for speed
- Refactored constellations into an optional feature
- Code clean ups and some big refactors
- Removed CLI support for window mode on the sieve
- Removed "BestEffort" on the Sieve
Minor updates
Some minor updates to the README and code cleanups. No bug fixes, just superficial changes.
First release
Provides a rust library and binary for generating prime numbers using the novel Periodic Table of Prime (PTP) theory.
Provides:
- A high performance binary that works efficiently to generate large numbers of primes.
- A python representation of the Prime Formula, and PTP implementation