Trillion-Scale Goldbach Verification on Consumer Hardware -novel Algorithm [pdf]
16 hours ago
- #High-Throughput Computing
- #Goldbach Conjecture
- #Prime Verification
- Introduces a high-throughput engine for empirical verification of the even Goldbach conjecture at a trillion-scale.
- Uses a fixed set of small primes ("gear") to reduce verification to a single streaming pass with O(1) cost per even number.
- Supports two modes: segmented-sieve for fast verification up to 10^11 and 64-bit deterministic Miller-Rabin for numbers near 10^18.
- Implemented in C#/.NET, designed for parallel execution on CPUs, with open-source code under Apache 2.0 license.
- Demonstrates universal coverage with the first 300 primes as gear, with no exceptions observed at trillion-scale intervals.
- Prioritizes reproducibility and accessibility, enabling verification on consumer hardware without external funding.