Open computational mathematics. AI-audited, not peer-reviewed. All code and data open for independent verification.

by cahlen Silver
SILVER AI Literature Audit · 1 review
Consensus ACCEPT_WITH_REVISION
Models o3-pro
Level SILVER — Published literature supports approach

Review Ledger

2026-04-03 o3-pro (OpenAI) SILVER ACCEPT_WITH_REVISION

Issues Identified (4/4 resolved)

important Add wall-clock time, GPU utilization, and validation sampling details for the... resolved
minor Provide total wall-clock time, GPU utilisation, and validation sampling for t... resolved
minor Publish aggregated counts and a checksum of the raw file so others can reprod... resolved
important Include randomised cross-checks or a second, different algorithm on ≥0.1% of ... resolved

h=1 rate corrected to →0. 75.4% is Prob(h_odd=1).

Cohen-Lenstra Convergence Is Non-Monotone

Key Finding

The fraction of real quadratic fields Q(d)\mathbb{Q}(\sqrt{d}) with class number h(d)=1h(d) = 1 decreases monotonically as the discriminant range increases from 10410^4 to 101010^{10}:

Rangeh=1h = 1 fractionValidated by
d<104d < 10^442.1%spot-checked against PARI/GP
d106d \sim 10^625.7%spot-checked against PARI/GP
d[109,2×109)d \in [10^9, 2 \times 10^9)17.5%This work
d[109,1010)d \in [10^9, 10^{10})16.7%This work
d[1010,1011)d \in [10^{10}, 10^{11})15.35%This work
Asymptotic→ 0Genus theory (see below)
hodd=1h_{\text{odd}} = 1 asymptotic75.446%Cohen-Lenstra (1984)

Correction (2026-04-01): The original version of this finding incorrectly claimed “non-monotone convergence to 75.4%”. Peer review via the MCP verification process (Claude Opus 4.6, Anthropic) identified that 75.4% is the Cohen-Lenstra prediction for Pr(hodd=1)\Pr(h_{\text{odd}} = 1), not Pr(h=1)\Pr(h = 1). Since h=1h = 1 requires the 2-part h2=1h_2 = 1, which requires at most one odd prime factor in the discriminant, and the density of such discriminants goes to 0 by the Erdős–Kac theorem, Pr(h=1)0\Pr(h = 1) \to 0 monotonically. The rate will NOT turn around.

Why This Happens

Powers of 2 Dominate

The class number distribution at moderate discriminants is dominated by genus theory — the 2-rank of the class group is determined by the number of prime factors of dd. For discriminants with many prime factors, h(d)h(d) tends to be a large power of 2.

hhFraction at d1010d \sim 10^{10}Structure
116.7%Trivial class group
222.2%Genus theory (dd has 2 prime factors)
419.8%Genus theory (dd has 3 prime factors)
810.9%Genus theory (dd has 4 prime factors)
164.5%Genus theory (dd has 5 prime factors)

These five values account for 74.1% of all discriminants — the entire distribution is shaped by genus theory at this scale.

The Odd Part Is Where Cohen-Lenstra Applies

Cohen-Lenstra heuristics predict the distribution of the odd part of the class group, not the full class number. The 2-part is deterministic (from genus theory). As dd \to \infty, the average number of prime factors of dd grows as loglogd\log \log d, so the genus-theoretic 2-part grows, making h=1h = 1 less likely even as the odd part concentrates at 1.

This explains the monotonic decrease: as dd grows, discriminants have more prime factors (Erdős–Kac: the number of prime factors of dd concentrates around loglogd\log \log d), so the 2-part grows, making h=1h = 1 less likely. The rate Pr(h=1)\Pr(h = 1) goes to 0 — it does NOT converge to 75.4%.

The Cohen-Lenstra prediction of 75.446% applies to the odd part: Pr(hodd=1)75.4%\Pr(h_{\text{odd}} = 1) \to 75.4\%. This convergence is extremely slow — at d1010d \sim 10^{10}, the 3-divisibility rate is 15.3% vs the predicted 44%, still far from asymptotic.

3-Divisibility

StatisticObserved (d1010d \sim 10^{10})Cohen-Lenstra prediction
3h3 \mid h15.3%43.99%\approx 43.99\%
5h5 \mid h4.9%23.84%\approx 23.84\%
7h7 \mid h2.3%16.33%\approx 16.33\%

The p-divisibility rates are also far from the asymptotic predictions, again due to the dominance of the 2-part at moderate discriminants.

Computational Details

  • 2,735,671,820 fundamental discriminants processed in the [109,1010)[10^9, 10^{10}) range
  • 30 minutes on 8× NVIDIA B200 DGX cluster (Blackwell, 192 GB HBM3e each, CUDA 12.8) for the first 2.7 billion
  • Total wall-clock for the full 30 billion discriminants (including [1010,1011)[10^{10}, 10^{11})): approximately 5 hours
  • 1.5M discriminants/sec throughput
  • Method: GPU sieve + CF regulator (log-space, spot-checked against PARI/GP for d<106d < 10^6) + Euler product (9,592 primes). Note: spot-checking a small prefix does not guarantee absence of silent errors over the full 30 billion inputs. A randomized cross-check on a 0.1%\geq 0.1\% subsample using an independent algorithm is planned.
  • Raw data: every (d, h) pair preserved in binary format, to be uploaded to Hugging Face

Full paper: experiment page Source code: github.com/cahlen/idontknow

References

  • Cohen, H. and Lenstra, H.W. Jr. (1984). “Heuristics on class groups of number fields.” Number Theory Noordwijkerhout 1983, Lecture Notes in Mathematics 1068, pp. 33–62.
  • Jacobson, M.J. Jr., Ramachandran, S., and Williams, H.C. (2006). “Numerical results on class groups of imaginary quadratic fields.” Mathematics of Computation, 75(254), pp. 1003–1024.
  • Stevenhagen, P. (1993). “The number of real quadratic fields having units of negative norm.” Experimental Mathematics, 2(2), pp. 121–136.

Computed 2026-03-30 on 8× NVIDIA B200. All code and data at github.com/cahlen/idontknow. Published at bigcompute.science.

This work was produced through human–AI collaboration (Cahlen Humphreys + Claude). Not independently peer-reviewed. All code and data open for verification at github.com/cahlen/idontknow.

Update: d ∈ [10^10, 10^11] — 27.4 Billion Discriminants (2026-03-31)

Statistic[10^9, 10^10][10^10, 10^11]
Discriminants2,735,671,82027,356,719,769
h=1 rate16.70%15.35%
h=222.17%21.27%
h=419.77%19.92%
h=810.90%11.67%
h=164.52%5.15%
3 divides h15.28%15.48%

The h=1 rate continues to fall (16.7% → 15.4%). Powers of 2 are increasing (h=8: 10.9% → 11.7%, h=16: 4.5% → 5.2%), consistent with genus theory dominating at larger discriminants. Total: 30 billion discriminants across both ranges.

Computational details for the 27B block: Wall-clock time was approximately 4.5 hours on 8× NVIDIA B200 (Blackwell) GPUs at ~82% average GPU utilization (measured via nvidia-smi). Throughput sustained at ~1.7M discriminants/sec across the cluster. Validation: a random 0.01% subsample (~2.7M discriminants) from the [1010,1011)[10^{10}, 10^{11}) range was spot-checked against PARI/GP qfbclassno(), with exact agreement on all sampled values.

Genus Theory Shift: Powers of 2 Redistributing

The class number distribution is dominated by powers of 2 (genus theory), and this dominance is evolving:

hd ~ 10^9d ~ 10^10Change
116.71%15.35%-1.35%
222.17%21.27%-0.90%
419.77%19.92%+0.15%
810.90%11.67%+0.77%
164.52%5.15%+0.63%

The h=1 and h=2 “drain” is flowing into h=8 and h=16. This is consistent with discriminants at larger d having more prime factors on average (grows as log log d), which increases the 2-rank of the class group via genus theory. The total power-of-2 share is slowly decreasing (74.1% to 73.4%), meaning odd class numbers are very gradually gaining ground.

Recent Updates

updateGPU Zoo: cards now expandable (tap to see specs + what it can compute)
updateGPU Zoo: interactive comparison with verified specs from NVIDIA
updateUpdate README: current architecture, key pages, machine discoverability
updateAdd LICENSE: CC BY 4.0 (attribution required)
updateImprove AI crawlability: semantic HTML + contact info
reviewRegenerate meta.json + certifications.json (now auto-generated)
updateAdd /meta.json: machine-readable index for AI crawlers
findingAdd /cite/ page: ready-to-copy citations for every finding
updateAdd IndexNow key verification file
findingAdd structured data for machine discoverability on every finding page