{
 "study": "prime-testing-grh",
 "title": "How encryption software tests for prime numbers, and what a proof of the generalized Riemann hypothesis would change",
 "publisher": "Gridlock App LLC",
 "checked_on": "2026-11-20",
 "schema": {
  "libraries[].rounds": "Miller-Rabin rounds run on a candidate that keeps passing, when generating one RSA prime of 512, 1024, 1536 or 2048 bits (for RSA keys of 1024, 2048, 3072 and 4096 bits) with default settings. null: the library does not use a fixed number of probabilistic rounds.",
  "libraries[].kind": "probabilistic | provable | delegates",
  "libraries[].sources[].sha256_prefix": "first 16 hex digits of the SHA-256 of the file as downloaded from the branch head on the read date",
  "standard": "FIPS 186-5 Table B.1, minimum Miller-Rabin rounds for the RSA primes p and q",
  "computation": "output of code/prime-testing-grh.py (see that file for what is measured and what is extrapolated)"
 },
 "standard": {
  "name": "FIPS 186-5, Digital Signature Standard, Table B.1",
  "published": "2023-02-03",
  "url": "https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-5.pdf",
  "read": "2026-11-20",
  "rows": [
   {
    "prime_bits": 1024,
    "rounds_2_100": 4,
    "rounds_matched": 5,
    "matched_error": "2^-112"
   },
   {
    "prime_bits": 1536,
    "rounds_2_100": 3,
    "rounds_matched": 4,
    "matched_error": "2^-128"
   },
   {
    "prime_bits": 2048,
    "rounds_2_100": 2,
    "rounds_matched": 4,
    "matched_error": "2^-144"
   }
  ],
  "note": "The standard requires an RSA modulus of at least 2048 bits, so it has no row for 512-bit primes. It allows Miller-Rabin alone or Miller-Rabin followed by one Lucas test, and also provable primes."
 },
 "libraries": [
  {
   "id": "openssl",
   "name": "OpenSSL",
   "kind": "probabilistic",
   "test": "Miller-Rabin after trial division",
   "rounds": {
    "512": 64,
    "1024": 5,
    "1536": 4,
    "2048": 4
   },
   "stated_error": "The 64-round path is commented as giving a false positive rate of 2^-128 (128 rounds above 2048 bits: 2^-256). The 5 and 4 round counts are taken from FIPS 186-5 Table B.1.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "Standard two-prime keys of 2048 bits or more with a public exponent above 65536 use the FIPS 186-5 routine: 5 rounds for a modulus under 3072 bits, 4 from 3072 bits. Smaller keys and multi-prime keys use the older routine, which runs the minimum of 64 rounds (128 above 2048 bits). BN_check_prime, for numbers of unknown origin, uses the same 64 or 128.",
   "sources": [
    {
     "url": "https://github.com/openssl/openssl/blob/master/crypto/rsa/rsa_gen.c",
     "file": "crypto/rsa/rsa_gen.c",
     "repository": "openssl/openssl",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "d59d98345f045dc1",
     "note": ""
    },
    {
     "url": "https://github.com/openssl/openssl/blob/master/crypto/bn/bn_rsa_fips186_5.c",
     "file": "crypto/bn/bn_rsa_fips186_5.c",
     "repository": "openssl/openssl",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "b412ba089fb04954",
     "note": ""
    },
    {
     "url": "https://github.com/openssl/openssl/blob/master/crypto/bn/bn_prime.c",
     "file": "crypto/bn/bn_prime.c",
     "repository": "openssl/openssl",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "62c952e20d4213e2",
     "note": ""
    }
   ]
  },
  {
   "id": "boringssl",
   "name": "BoringSSL",
   "kind": "probabilistic",
   "test": "Miller-Rabin after trial division",
   "rounds": {
    "512": 5,
    "1024": 5,
    "1536": 4,
    "2048": 4
   },
   "stated_error": "Round counts are generated from the formula in FIPS 186-5 for a stated security level per size (80 bits at 476 to 851 bits, 112 bits from 852, 128 bits from 1080). Checking a prime supplied by someone else uses 64 rounds, stated as at most 2^-128.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "The count is the number of uniformly random bases. To hide timing, the loop runs at least 16 iterations on a number that keeps passing, so the two secret primes see 16 or more.",
   "sources": [
    {
     "url": "https://github.com/google/boringssl/blob/main/crypto/fipsmodule/bn/prime.cc.inc",
     "file": "crypto/fipsmodule/bn/prime.cc.inc",
     "repository": "google/boringssl",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "992f0b8830cc37ad",
     "note": ""
    },
    {
     "url": "https://github.com/google/boringssl/blob/main/include/openssl/bn.h",
     "file": "include/openssl/bn.h",
     "repository": "google/boringssl",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "1f7f56bc337438d5",
     "note": ""
    },
    {
     "url": "https://github.com/google/boringssl/blob/main/crypto/fipsmodule/rsa/rsa_impl.cc.inc",
     "file": "crypto/fipsmodule/rsa/rsa_impl.cc.inc",
     "repository": "google/boringssl",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "41b73cbca743bf84",
     "note": ""
    }
   ]
  },
  {
   "id": "libressl",
   "name": "LibreSSL",
   "kind": "probabilistic",
   "test": "Baillie-PSW: Miller-Rabin base 2, one random-base round, strong Lucas-Selfridge",
   "rounds": {
    "512": 2,
    "1024": 2,
    "1536": 2,
    "2048": 2
   },
   "stated_error": "None stated in the files read for the generation path.",
   "lucas_test": true,
   "fermat_base2_first": false,
   "bases": "base 2, then random",
   "notes": "Prime generation calls the Baillie-PSW test with one extra random-base round: 2 Miller-Rabin rounds in all (base 2 plus one random base), then a Lucas test. BN_is_prime_ex with the default setting adds 5 or 4 random rounds by size instead of one.",
   "sources": [
    {
     "url": "https://github.com/openbsd/src/blob/master/lib/libcrypto/bn/bn_prime.c",
     "file": "lib/libcrypto/bn/bn_prime.c",
     "repository": "openbsd/src",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "909d0bc20f371f1d",
     "note": ""
    },
    {
     "url": "https://github.com/openbsd/src/blob/master/lib/libcrypto/bn/bn_bpsw.c",
     "file": "lib/libcrypto/bn/bn_bpsw.c",
     "repository": "openbsd/src",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "21f30e6acde90b79",
     "note": ""
    },
    {
     "url": "https://github.com/openbsd/src/blob/master/lib/libcrypto/bn/bn.h",
     "file": "lib/libcrypto/bn/bn.h",
     "repository": "openbsd/src",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "0af9c0da5bef8946",
     "note": ""
    },
    {
     "url": "https://github.com/openbsd/src/blob/master/lib/libcrypto/rsa/rsa_gen.c",
     "file": "lib/libcrypto/rsa/rsa_gen.c",
     "repository": "openbsd/src",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "2040e981eb406b29",
     "note": ""
    }
   ]
  },
  {
   "id": "nettle",
   "name": "Nettle (used by GnuTLS)",
   "kind": "provable",
   "test": "Provable primes: Maurer's algorithm with Pocklington's theorem",
   "rounds": {
    "512": null,
    "1024": null,
    "1536": null,
    "2048": null
   },
   "stated_error": "Not applicable: the construction yields a proof that the number is prime.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "n/a",
   "notes": "RSA key generation calls nettle_random_prime, which builds each prime from a smaller proven prime. GnuTLS calls this routine by default; in FIPS mode or with the provable flag it uses the FIPS 186-4 provable-prime construction instead.",
   "sources": [
    {
     "url": "https://github.com/gnutls/nettle/blob/master/bignum-random-prime.c",
     "file": "bignum-random-prime.c",
     "repository": "gnutls/nettle",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "62782d1c6e6a9695",
     "note": ""
    },
    {
     "url": "https://github.com/gnutls/nettle/blob/master/rsa-keygen.c",
     "file": "rsa-keygen.c",
     "repository": "gnutls/nettle",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "6270bf4409789186",
     "note": ""
    },
    {
     "url": "https://github.com/gnutls/gnutls/blob/master/lib/nettle/pk.c",
     "file": "lib/nettle/pk.c",
     "repository": "gnutls/gnutls",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "7905de6879ff22da",
     "note": ""
    }
   ]
  },
  {
   "id": "libgcrypt",
   "name": "Libgcrypt (used by GnuPG)",
   "kind": "probabilistic",
   "test": "Fermat test base 2, then Miller-Rabin",
   "rounds": {
    "512": 5,
    "1024": 5,
    "1536": 5,
    "2048": 5
   },
   "stated_error": "None stated for the standard path. The FIPS path cites FIPS 186-4 Table C.2. Checks of numbers that may not be random use 64 rounds.",
   "lucas_test": false,
   "fermat_base2_first": true,
   "bases": "base 2, then random",
   "notes": "The first Miller-Rabin round uses base 2, the rest random bases. The FIPS path asks for 5 rounds up to 1024 bits and 4 above, but the test routine raises any count below 5 to 5.",
   "sources": [
    {
     "url": "https://github.com/gpg/libgcrypt/blob/master/cipher/primegen.c",
     "file": "cipher/primegen.c",
     "repository": "gpg/libgcrypt",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "36c503b59c5deeca",
     "note": ""
    },
    {
     "url": "https://github.com/gpg/libgcrypt/blob/master/cipher/rsa.c",
     "file": "cipher/rsa.c",
     "repository": "gpg/libgcrypt",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "1b47ac9c0f4282f9",
     "note": ""
    }
   ]
  },
  {
   "id": "nss",
   "name": "Mozilla NSS",
   "kind": "probabilistic",
   "test": "Fermat test base 2, then Miller-Rabin after sieving",
   "rounds": {
    "512": 7,
    "1024": 5,
    "1536": 4,
    "2048": 3
   },
   "stated_error": "None stated as a number. The comment says the counts come from the Handbook of Applied Cryptography, table 4.4, with the FIPS 186 tables C.2 and C.3.",
   "lucas_test": false,
   "fermat_base2_first": true,
   "bases": "random",
   "notes": "RSA key generation calls generate_prime, which calls mpp_make_prime with securely random bases.",
   "sources": [
    {
     "url": "https://github.com/nss-dev/nss/blob/master/lib/freebl/mpi/mpprime.c",
     "file": "lib/freebl/mpi/mpprime.c",
     "repository": "nss-dev/nss",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "9951f7c2aef96ba4",
     "note": ""
    },
    {
     "url": "https://github.com/nss-dev/nss/blob/master/lib/freebl/rsa.c",
     "file": "lib/freebl/rsa.c",
     "repository": "nss-dev/nss",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "06f2f3dae5fe082b",
     "note": ""
    },
    {
     "url": "https://github.com/nss-dev/nss/blob/master/lib/freebl/secmpi.c",
     "file": "lib/freebl/secmpi.c",
     "repository": "nss-dev/nss",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "fc0f0908f1f4052c",
     "note": ""
    }
   ]
  },
  {
   "id": "go",
   "name": "Go crypto/rsa",
   "kind": "probabilistic",
   "test": "Miller-Rabin after trial division",
   "rounds": {
    "512": 5,
    "1024": 5,
    "1536": 4,
    "2048": 4
   },
   "stated_error": "The comment cites a worst-case false positive rate of 1/4 per round and says 64 rounds would be needed for adversarial input; the lower counts rely on the candidate being random. It points to BoringSSL for the formula.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "Trial division by the odd primes up to 1619 first. The general-purpose big.Int.ProbablyPrime(n) is a different routine: n Miller-Rabin rounds plus a Baillie-PSW test, documented as 100% accurate below 2^64.",
   "sources": [
    {
     "url": "https://github.com/golang/go/blob/master/src/crypto/internal/fips140/rsa/keygen.go",
     "file": "src/crypto/internal/fips140/rsa/keygen.go",
     "repository": "golang/go",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "d933331d08ff87c5",
     "note": ""
    },
    {
     "url": "https://github.com/golang/go/blob/master/src/math/big/prime.go",
     "file": "src/math/big/prime.go",
     "repository": "golang/go",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "783e8e94c38db53b",
     "note": ""
    }
   ]
  },
  {
   "id": "openjdk",
   "name": "OpenJDK (BigInteger)",
   "kind": "probabilistic",
   "test": "Miller-Rabin, then a Lucas-Lehmer test",
   "rounds": {
    "512": 8,
    "1024": 2,
    "1536": 2,
    "2048": 2
   },
   "stated_error": "The documentation of probablePrime says the chance that the result is composite does not exceed 2^-100.",
   "lucas_test": true,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "The RSA key pair generator calls BigInteger.probablePrime, which uses certainty 100. The comment says the round counts follow the draft standard ANSI X9.80.",
   "sources": [
    {
     "url": "https://github.com/openjdk/jdk/blob/master/src/java.base/share/classes/java/math/BigInteger.java",
     "file": "src/java.base/share/classes/java/math/BigInteger.java",
     "repository": "openjdk/jdk",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "6d69a1356a1c389b",
     "note": ""
    },
    {
     "url": "https://github.com/openjdk/jdk/blob/master/src/java.base/share/classes/sun/security/rsa/RSAKeyPairGenerator.java",
     "file": "src/java.base/share/classes/sun/security/rsa/RSAKeyPairGenerator.java",
     "repository": "openjdk/jdk",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "fa310fd948917e04",
     "note": ""
    }
   ]
  },
  {
   "id": "bouncycastle",
   "name": "Bouncy Castle (Java)",
   "kind": "probabilistic",
   "test": "Miller-Rabin after a small-factor check",
   "rounds": {
    "512": 5,
    "1024": 5,
    "1536": 4,
    "2048": 12
   },
   "stated_error": "Expressed as a certainty: 80 for keys up to 1024 bits, 112 for 2048, 128 for 3072, 144 for 4096 (cited to FIPS 186-4 Table C.1). Rounds follow FIPS 186-4 tables C.2 and C.3, with extra rounds at the worst-case rate above them.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "Counts are for the provider's default certainty at each key size. A caller of the low-level class can pass a different certainty.",
   "sources": [
    {
     "url": "https://github.com/bcgit/bc-java/blob/main/core/src/main/java/org/bouncycastle/crypto/generators/RSAKeyPairGenerator.java",
     "file": "core/src/main/java/org/bouncycastle/crypto/generators/RSAKeyPairGenerator.java",
     "repository": "bcgit/bc-java",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "5a8232f775d61887",
     "note": ""
    },
    {
     "url": "https://github.com/bcgit/bc-java/blob/main/prov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/PrimeCertaintyCalculator.java",
     "file": "prov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/PrimeCertaintyCalculator.java",
     "repository": "bcgit/bc-java",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "1cb1a6b58b16b558",
     "note": ""
    },
    {
     "url": "https://github.com/bcgit/bc-java/blob/main/prov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/KeyPairGeneratorSpi.java",
     "file": "prov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/KeyPairGeneratorSpi.java",
     "repository": "bcgit/bc-java",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "7fe5b17559bdfcf9",
     "note": ""
    }
   ]
  },
  {
   "id": "wolfssl",
   "name": "wolfSSL",
   "kind": "probabilistic",
   "test": "Miller-Rabin after trial division by the first 256 primes",
   "rounds": {
    "512": 8,
    "1024": 8,
    "1536": 8,
    "2048": 8
   },
   "stated_error": "None stated as a number in the file read.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "The same 8 rounds with random bases for every key size.",
   "sources": [
    {
     "url": "https://github.com/wolfSSL/wolfssl/blob/master/wolfcrypt/src/rsa.c",
     "file": "wolfcrypt/src/rsa.c",
     "repository": "wolfSSL/wolfssl",
     "branch": "master",
     "read": "2026-11-20",
     "sha256_prefix": "66fd6be87a73ea53",
     "note": ""
    }
   ]
  },
  {
   "id": "mbedtls",
   "name": "Mbed TLS (TF-PSA-Crypto)",
   "kind": "probabilistic",
   "test": "Miller-Rabin after a small-factor check",
   "rounds": {
    "512": 8,
    "1024": 6,
    "1536": 4,
    "2048": 4
   },
   "stated_error": "2^-80 for keys up to 1024 bits and 2^-100 for larger keys, with counts cited to the Handbook of Applied Cryptography (table 4.4 and fact 4.48).",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "random",
   "notes": "RSA key generation asks for the lower error rate when the modulus is longer than 1024 bits.",
   "sources": [
    {
     "url": "https://github.com/Mbed-TLS/TF-PSA-Crypto/blob/development/drivers/builtin/src/bignum.c",
     "file": "drivers/builtin/src/bignum.c",
     "repository": "Mbed-TLS/TF-PSA-Crypto",
     "branch": "development",
     "read": "2026-11-20",
     "sha256_prefix": "e990c5ff7cbc0240",
     "note": ""
    },
    {
     "url": "https://github.com/Mbed-TLS/TF-PSA-Crypto/blob/development/drivers/builtin/src/rsa.c",
     "file": "drivers/builtin/src/rsa.c",
     "repository": "Mbed-TLS/TF-PSA-Crypto",
     "branch": "development",
     "read": "2026-11-20",
     "sha256_prefix": "9d96c8b1858817f2",
     "note": ""
    }
   ]
  },
  {
   "id": "pyca",
   "name": "Python cryptography",
   "kind": "delegates",
   "test": "Calls OpenSSL",
   "rounds": {
    "512": null,
    "1024": null,
    "1536": null,
    "2048": null
   },
   "stated_error": "See OpenSSL.",
   "lucas_test": false,
   "fermat_base2_first": false,
   "bases": "n/a",
   "notes": "RSA key generation calls the OpenSSL library the package is built against, so the test is whatever that library does.",
   "sources": [
    {
     "url": "https://github.com/pyca/cryptography/blob/main/src/rust/src/backend/rsa.rs",
     "file": "src/rust/src/backend/rsa.rs",
     "repository": "pyca/cryptography",
     "branch": "main",
     "read": "2026-11-20",
     "sha256_prefix": "f64954f743437f37",
     "note": ""
    }
   ]
  }
 ],
 "computation": {
  "seed": 20261120,
  "sizes": [
   {
    "bits": 512,
    "bach_bound": 251895,
    "integer_bases": 251894,
    "prime_bases": 22194,
    "round_seconds_median": 5.94744999489194e-05,
    "round_seconds_mean": 6.138817000532982e-05,
    "deterministic_prime_bases_seconds": 1.3996144289999393,
    "deterministic_how": "measured",
    "bases_timed": 22194,
    "seconds_per_small_base": 6.306273898350632e-05,
    "deterministic_all_bases_seconds": 15.88512557351134,
    "tested_prime_hex": "0xdc36fc902248cd706ca4a1a9f5b19f71ec7ac8ad1b2ba06b6ae12c972399d29db61e6ba536824dd6b80469b84b2d451c62f746b484e61ceb95bd447e7184d515"
   },
   {
    "bits": 1024,
    "bach_bound": 1007582,
    "integer_bases": 1007581,
    "prime_bases": 79060,
    "round_seconds_median": 0.0003571900000451933,
    "round_seconds_mean": 0.00036012322999113167,
    "deterministic_prime_bases_seconds": 32.45862408000016,
    "deterministic_how": "measured",
    "bases_timed": 79060,
    "seconds_per_small_base": 0.0004105568439160152,
    "deterministic_all_bases_seconds": 413.6692753497425,
    "tested_prime_hex": "0xf890954552a54063000b87b31f8dd3165062b076930b6785f80f7677bb3fdf773220f66be9be5ac1cde83ce715d542e542e2c7a261f7670cf44847ce722019b98ca2ffb06e76a766b2c2098736ded4d8804da7d99728cd9946d3d0b1669985134f4426817dc5a9c1dd178d70b1890312ae8af406bc29cd0fa56c9349c67b3709"
   },
   {
    "bits": 1536,
    "bach_bound": 2267061,
    "integer_bases": 2267060,
    "prime_bases": 167264,
    "round_seconds_median": 0.0012084495000408424,
    "round_seconds_mean": 0.0012128468899970813,
    "deterministic_prime_bases_seconds": 188.33410394600014,
    "deterministic_how": "measured",
    "bases_timed": 167264,
    "seconds_per_small_base": 0.0011259691502415352,
    "deterministic_all_bases_seconds": 2552.639621746575,
    "tested_prime_hex": "0xca048f71ec9fa02b05c4079f25c47d923265d965dbf7db8d4fa5bb81bdbdc4368ed478dd2457dd6898937132cc825c41a595fd71eb1e0ed834a0bcc58ff1da06da5d8d6cc7e17675fdc976ddf557cf7a67140c5543604480ddda92244f32432379a53c5c35330af7e7127e65a771fd27393d7bf7533404a0f653428e75280af98fface7e259f1c8536c88c5e0212e519fd8725a8ad679db51c6c60d4ccb3d643aff83bf96d27aa44a44855076ecf933802ecd00f4c954596654bce06872cd5ad"
   },
   {
    "bits": 2048,
    "bach_bound": 4030331,
    "integer_bases": 4030330,
    "prime_bases": 285150,
    "round_seconds_median": 0.0027092479999737407,
    "round_seconds_mean": 0.0026421276499945636,
    "deterministic_prime_bases_seconds": 731.9295912990001,
    "deterministic_how": "measured",
    "bases_timed": 285150,
    "seconds_per_small_base": 0.0025668230450604946,
    "deterministic_all_bases_seconds": 10345.143923198662,
    "tested_prime_hex": "0xd27af6b835408bff81bd52a11ca8dfac14ae6ece4762bfe0946b92c180908e1503cdd799390a3651d89cafa4f822abe448903bf80813687fc9cdb61a4fbeb820fc14ce08e13fef12b5539129b09076a11560470a294ef873baa210ae14d1d5be7868ecce6d1e56f5492c6741da25740e393ae0f70f2d9afeef95fba819189f3b6dd7f579a6f7d6328ee9459db15ec3dc23eb14ac8bcf4d07ef3c83d0f987e99162bba5cf9bd121bb1c56b75280e2f0646e89ff8907fcc8c7462bb041ceabe2519b7050db67e374bcd7249b5499a3dafedbbbdfbefd26be00a81478261efe86e5dbfd6ff34b6aba2bfda393c1faab802759e26f331a4afbffcb7488d3db61d747"
   },
   {
    "bits": 3072,
    "bach_bound": 9068246,
    "integer_bases": 9068245,
    "prime_bases": 606682,
    "round_seconds_median": 0.008012352500145425,
    "round_seconds_mean": 0.008149097544983306,
    "deterministic_prime_bases_seconds": 5192.1341720196415,
    "deterministic_how": "extrapolated",
    "bases_timed": 2003,
    "seconds_per_small_base": 0.008558246613579505,
    "deterministic_all_bases_seconds": 77608.27706235928,
    "tested_prime_hex": "0xf09cb504b3867abfa4072c8de351257a3d1e062de49968bb5ddec875ba4670a51a12f664e5db8647efda70856757784a69b50311dfc46205bebc6b0d561cdbb4f249e31ed096878a76e97ab52c1c28a86e7d440b4b5e32a81bdd97dd1c6eb7ffacfcedfc23417c255c0d8bfca4b15e50140485eb63d8da0a526177f3892defd5865fdc7ae3bcc8851a63faf1d000b3b1595603f0ac96c3dbf9b8f51f79cebf355a9a53e71d0ab4742e92ca1bc700217b360b16ea94a34567b9a77f089d94d1e3ff7dc9915b86221e8135c19a915cf2c45a5b86e3c2b1e128e02b7144bb712a260ff303f2640668b4e0c8de45db3eb25e266f25607377f14fa08677f5010b6a41a650d36cf56d1c1920b7e23d10894abd33285e12ce349475284ed0eb43995af9e7b37175787b4ed7b25aa647ce67dbad9397e5d704573b52c93c8c40e0989ce20a7a597d5b79666f0d5b220ae9939b7db81036aeb7e95c5b9f93df6556ba2ddcb1896643ece72d1cd11977ec7f7915e2ad1d9fd5097195e1289de23eb84799b9"
   },
   {
    "bits": 4096,
    "bach_bound": 16121327,
    "integer_bases": 16121326,
    "prime_bases": 1038400,
    "round_seconds_median": 0.01793187149996811,
    "round_seconds_mean": 0.018683540310012178,
    "deterministic_prime_bases_seconds": 19122.70414076253,
    "deterministic_how": "extrapolated",
    "bases_timed": 2001,
    "seconds_per_small_base": 0.01841554713093464,
    "deterministic_all_bases_seconds": 296883.038766162,
    "tested_prime_hex": "0xf47b92a2548906285785a8b55e3ac6f0454bd104fa451688aa5befa717b035d26a5681e6347565c87bc3fac8afa9bf0e7f4967adba3d214c3b2c12381582a2681ab70e0158bcc992be271a4de2150ec5e5948429a434410212b189dc79f19fcf3fe2aefdb8f7dff48e143cc45f3a9ac76f299d7336979a2d1c5b7c68f91e106dfe4a93ea90c56552e2a1cb03199b7f8b332e74f5cb818919935c6a27d3edaed9399fb94f86f12f27c696c93540f51bda9bc41482a6a941c0b665ec6385243d358790f5e6bd51b8bde6318cf8ed56b00de6dd4f5e6591b9b9918534bc223b056873bd7985dc84bc5491880d565da96f084a9bb7fa98fece7947edd66734888399e1cc97da5ae8dc00228e5218f36d85608ede0c419964be354301e672946e134daf0d925100d3f4777d9675d9efd3e77a8717a35cfed4ea8180ce93b9918264dfd106d82d7aa3f7d35ff9feb1acbbab4a7839a6606c3f463ed4d9dd852475d9f9f5944906d641c697b2aef2a29c8d2036eff04c807ced8ae94487ecd013b284de9a61d2957b7e3d673e0b6b94e8fdb72aa0f29d3c0e2e58be0f10e2c5e651e573867af86a13bac72be221758d632a8fa444b4b8fd27857cd76ae2ffc9e349acd2f748cf7ace14a9e2daa904b080cae4a2eba2a6c0d662c35750f6073df669b29923d0ae26ed2b3069a97dbe0c9afdeea37c4e5a25b7052b5ed1ff5bc51b2de7e7"
   }
  ],
  "machine": {
   "cpu": "Intel(R) Xeon(R) Processor @ 2.10GHz",
   "cores": 2,
   "python": "3.13.18",
   "gmpy2": "2.3.2",
   "gmp": "GMP 6.3.0",
   "load_1min": {
    "start": 0.4140625,
    "max": 1.43017578125,
    "end": 1.0,
    "after_each_size": [
     0.4140625,
     0.646484375,
     1.43017578125,
     1.0,
     1.0,
     1.0
    ]
   }
  },
  "run_date": "2026-11-21",
  "full_sizes": [
   512,
   1024,
   1536,
   2048
  ],
  "sample_bases": 2000
 }
}