Crate prime_formula 

A high-performance prime number generator implementing a novel prime formula.

This library enables efficient finding of prime numbers and prime constellations (twin primes, triplets, etc.) using The Periodic Table of Primes which is a novel theory that claims that all primes are descendants of just 48 Prime Roots, and that these descendants are in the form root + k×210.

The implementation leverages:

• Bitwise storage for compact representation
• Rayon-based parallelism for multi-core scaling
• Three distinct search modes optimized for different number ranges

The core algorithm operates by eliminating composite candidates using precomputed prime root relationships rather than checking every potential divisor. The library implements theory proposed by Han-Lin Li, Shu-Cherng Fang & Way Kuo.

For more info, see https://ssrn.com/abstract=4742238

Modules

common

Common library for generating prime numbers

prime

Library for generating likely primes in the range 10^9 to 10^38

sieve

Provides a sieve based on prime-formula

Functions

count_primes

Parallel prime counter for a range

get_primes

Parallel prime number generator for a range