TIL if you do Miller-Rabin with the first 12 prime bases, you have a fast, exact primarily test for all 64-bit integers.
Cf. https://oeis.org/A014233 which gives the upper bound on the two-sided correctness of Miller-Rabin given that you tested on the first k bases.
Jeremy Kun
npub1pe…4h36q
2026-01-27 20:20:51 UTC
Author Public Key
npub1pe67uceztjyefem3xmphw05e65200df0hrrv60464v6w8xjtgvgqp4h36qSeen on
wss://relay.ditto.pubPublished at
2026-01-27 20:20:51 UTCEvent JSON
{
"id": "8f8d99b6030221b6a807794c93a918a1ff7684d746c4ccc59abb08180f1db117",
"pubkey": "0e75ee63225c8994e77136c3773e99d514f7b52fb8c6cd3ebaab34e39a4b4310",
"created_at": 1769545251,
"kind": 1,
"tags": [
[
"proxy",
"https://mathstodon.xyz/users/j2kun/statuses/115968917611819608",
"activitypub"
],
[
"client",
"Mostr",
"31990:6be38f8c63df7dbf84db7ec4a6e6fbbd8d19dca3b980efad18585c46f04b26f9:mostr",
"wss://relay.ditto.pub"
]
],
"content": "TIL if you do Miller-Rabin with the first 12 prime bases, you have a fast, exact primarily test for all 64-bit integers.\n\nCf. https://oeis.org/A014233 which gives the upper bound on the two-sided correctness of Miller-Rabin given that you tested on the first k bases.",
"sig": "3e4327e16a1038f5c4b4e71ea492624c4d2b89d926999adb00689d37b40596c02b1b69e88e96a27338c96ee5381c64f33dbaae09d38d8cd2e007919b3a74c6d0"
}