cahlen/prime-convergents-cuda

Prime Convergents of Continued Fractions (v2, uint128)

Computes prime statistics of CF convergents using uint128 arithmetic (depth ~75). Tracks primality, doubly-prime convergents, and Erdos-Mahler bound.

Usage

import torch
from kernels import get_kernel

kernel = get_kernel("cahlen/prime-convergents-cuda")
result = prime_conv.compute(num_samples=1000000, max_depth=500, mode=0)

Compile (standalone)

nvcc -O3 -arch=sm_90 -o prime_convergents prime_convergents/prime_convergents_v2.cu -lm

Results

All computation results are open:

• Website: bigcompute.science
• Datasets: huggingface.co/cahlen
• Source: github.com/cahlen/idontknow

Citation

@misc{humphreys2026bigcompute,
  author = {Humphreys, Cahlen},
  title = {bigcompute.science: GPU-Accelerated Computational Mathematics},
  year = {2026},
  url = {https://bigcompute.science}
}

Human-AI collaborative. Not peer-reviewed. All code and data open.