The world's first theorem-guided cryptographic prime generator. 66% fewer primality tests. Formally proved security. Drop-in replacement for standard RSA prime generation.
Theorem 7 Verified 66% Fewer Tests arXiv: tesfaderethStandard RSA prime generation works by picking random odd numbers and testing each one for primality — an expensive operation. TesfahSec generates candidates directly in the two valid residue classes mod 6 (proved by Theorem 7 of the Tesfa Grid), then extends this with the 2310-wheel to eliminate 79.2% of all integers before any primality test runs.
The result is 64–68% fewer Miller-Rabin primality test invocations — confirmed across three independent benchmark runs. For cloud infrastructure generating millions of RSA keys per year, this translates to millions of dollars in saved compute.
HSM / hardware licensing available — contact us for $50K+ one-time license.
Theorem 7 (Tesfa Grid, 2026): All prime gaps g = p_{n+1} − p_n satisfy g ≡ 0, 2, or 4 (mod 6) for all p_n > 3. Equivalently, all primes p > 3 satisfy p ≡ 1 or 5 (mod 6). Verified: zero violations in 348,511 gaps.
Security: By Dirichlet's theorem on primes in arithmetic progressions, primes are equidistributed in {1 mod 6} and {5 mod 6}. TesfahSec output is computationally indistinguishable from uniform random prime generation. No cryptographic security is sacrificed.