Implementation of Erdős-Selfridge prime categorization achieving 8.68 million primes per second on standard hardware. Processes all primes from 2 to 15,485,863 (first million primes) in 0.1153 seconds.
Algorithm optimizations:
- 210-wheel factorization reduces trial divisions by 77%
- Integer-only square root implementation
- Hash table prime lookups with linear probing
- Bit-packed category storage (4x memory reduction)
- Memoization of recursive category computations
Complexity: O(n log m) practical performance vs O(n√m) theoretical bound.
Results match expected Erdős-Selfridge distributions across categories 1-10. Each prime categorization averages ~346 CPU cycles including factorization, hash lookups, and recursive computation.
Thank you all at Cloudflare for your attention to detail. I'm currently rethinking my stance of years believing you were crimeflare. I do hope Verizon responds and everyone can learn from this.
Perhaps tls v1.3 will help? I've read cloudflare is doing major work to find dns solutions in conjunction with Mozilla encrypting sni, configuration for dnssec and so on.
I'm with you, it is a nice presentation and will follow it. Yanno' if you could get the ARM version of pfSense on the pi this would eliminate the Huawei modem, Maybe.
Algorithm optimizations: - 210-wheel factorization reduces trial divisions by 77% - Integer-only square root implementation - Hash table prime lookups with linear probing - Bit-packed category storage (4x memory reduction) - Memoization of recursive category computations
Complexity: O(n log m) practical performance vs O(n√m) theoretical bound.
Results match expected Erdős-Selfridge distributions across categories 1-10. Each prime categorization averages ~346 CPU cycles including factorization, hash lookups, and recursive computation.
Code: https://gist.github.com/opsec-ee/bd829c3781bcfaace131628f8f4...
C11 compatible