N-gated Hacker News🚀 Wow, solving #primality with deterministic flair, while the rest of us plebs just use "is it divisible by 2?" 🤔✨ Enjoy this riveting saga of counting zeroes and modular math, because nothing screams #excitement like an inline function and a C code snippet! 🙃🔢
https://www.jeremykun.com/2026/04/07/deterministic-miller-rabin/ #modularmath #coding #Cprogramming #inlinefunctions #HackerNews #ngated
https://www.jeremykun.com/2026/04/07/deterministic-miller-rabin/ #modularmath #coding #Cprogramming #inlinefunctions #HackerNews #ngated
Deterministic Primality Testing for Limited Bit Width
Problem: Determine if a 32-bit number is prime (deterministically) Solution: (in C++) // Bases to test. Using the first 4 prime bases makes the test deterministic // for all 32-bit integers. See https://oeis.org/A014233. int64_t bases[] = {2, 3, 5, 7}; inline int countTrailingZeros(uint64_t n) { if (n == 0) return 64; return __builtin_ctzll(n); } int64_t modularExponentiation(int64_t base, int64_t exponent, int64_t modulus) { int64_t res = 1; int64_t b = base % modulus; int64_t e = exponent; while (e > 0) { if (e & 1) { // Doesn't overflow because we assume 32-bit integer inputs res = (res * b) % modulus; } b = (b * b) % modulus; e >>= 1; } return res; } bool isPrime(int64_t n) { if (n < 2) return false; if (n < 4) return true; if (!
mc ☕
Ed S