| Crates.io | prime-formula |
| lib.rs | prime-formula |
| version | 0.3.1 |
| created_at | 2025-05-06 23:15:29.06894+00 |
| updated_at | 2025-05-12 23:16:54.063981+00 |
| description | High-performance prime number generation and constellation finding using novel wheel factorization |
| homepage | |
| repository | https://github.com/cottrela/prime-formula |
| max_upload_size | |
| id | 1663063 |
| size | 130,656 |
A Rust implementation of the Formula of Primes (FOP) using insights from the Periodic Table of Primes (PTP).
For millennia, prime numbers have eluded precise prediction, their distribution remaining one of mathematics' greatest mysteries. This project implements groundbreaking research that establishes a Periodic Table of Primes (PTP) – a revolutionary framework for understanding prime numbers and their patterns.
Periodic Table of Primes (PTP)
Formula of Primes (FOP)
Counting Functions
Rust CLI & Library Implementation
# For library use
cargo init
cargo add prime-formula
Will initialize a new rust project and pull in the prime-formula library.
# For CLI use
cargo install prime-formula
Will install the binary locally to get started quickly.
# Generate primes using prime-formula CLI
prime-formula 0 1e6
Will count primes in the range 0 - 1,000,000.
prime-formula --dist 1e3 -c 2
Will count twin primes in the range 0 - 1,000.
prime-formula 1e12 --dist 1e3 -p
Will find primes that are at least 1×1012 in size with a window size of 1,000.
This implementation bridges theoretical number theory with practical computation, offering:
A predictive framework for prime distribution
New tools for twin prime conjecture analysis
Efficient algorithms leveraging PTP's structural insights
"Each prime is an offspring of the 48 integers on the PTP – finally giving us a periodic law for primes."