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

by cahlen Bronze
BRONZE AI Literature Audit · 2 reviews
Consensus ACCEPT_WITH_REVISION
Models Claude + o3-pro
Level BRONZE — Novel observation, limited literature precedent

Review Ledger

2026-04-03 o3-pro (OpenAI) BRONZE ACCEPT_WITH_REVISION
2026-04-01 Claude Opus 4.6 (Anthropic) BRONZE ACCEPT_WITH_REVISION

Issues Identified (11/11 resolved)

important Soften the golden ratio connection from a claimed structural link to a heuris... resolved
important Reframe golden ratio connection as heuristic, explicitly acknowledge the 13% ... resolved
minor The claimed value 0.1514 vs observed 0.171 is a 13% discrepancy. The connecti... resolved
important Add data availability section with checksum commitment and raw (d,α) pair ref... resolved
minor Provide the raw list of (d,α) pairs or a checksum so that external auditors c... resolved
important Add data availability section with raw data reference and checksum commitment... resolved
important Hedge the speedup claim: note no controlled ablation has been performed, and ... resolved
minor Include an ablation study measuring the effect of the starting offset indepen... resolved
important Clarify that the 99.91% statistic refers only to the minimal witness, not glo... resolved
important Clarify that the statistic refers only to the minimal witness; rephrase or wi... resolved
important Rephrase tightness claim: the stat is about the minimal witness, not about gl... resolved

Novel observation. Golden ratio connection is heuristic.

Zaremba Witnesses Concentrate at α(d)/d0.171\alpha(d)/d \approx 0.171

The Finding

For the smallest Zaremba witness α(d)\alpha(d) with bound A=5A = 5, the ratio α(d)/d\alpha(d)/d is remarkably concentrated:

Mean  α(d)d=0.1712,99% interval:  [0.1708,  0.1745]\text{Mean}\;\frac{\alpha(d)}{d} = 0.1712, \qquad \text{99\% interval:}\; [0.1708,\; 0.1745]

This is an extraordinarily tight band — relative width 2%\sim 2\%. The dominant continued fraction prefix is [0;5,1,][0;\, 5, 1, \ldots] for 99.7% of all d>1000d > 1000.

The Golden Ratio Connection

The infinite continued fraction [0;5,1,1,1,][0;\, 5, 1, 1, 1, \ldots] converges to:

15+φ=15+1+520.1511\frac{1}{5 + \varphi} = \frac{1}{5 + \frac{1+\sqrt{5}}{2}} \approx 0.1511

where φ\varphi is the golden ratio. The observed mean 0.17120.1712 lies between the finite convergents:

[0;5,1]=160.1667and[0;5,1,1]=2110.1818[0;\, 5, 1] = \frac{1}{6} \approx 0.1667 \qquad \text{and} \qquad [0;\, 5, 1, 1] = \frac{2}{11} \approx 0.1818

The witnesses cluster in this window because the optimal CF starts with the maximum allowed quotient (5), then drops to the minimum (1), then varies — balancing the constraint of keeping all quotients 5\leq 5 while being coprime to dd.

Caveat on the golden ratio. The infinite CF [0;5,1,1,1,][0; 5, 1, 1, 1, \ldots] converges to 1/(5+φ)0.15111/(5+\varphi) \approx 0.1511, which is 13% below the observed mean of 0.17120.1712. The witnesses are finite (typically 3–6 terms) and cluster between the low-order convergents 1/60.16671/6 \approx 0.1667 and 2/110.18182/11 \approx 0.1818, not near the infinite limit. The appearance of the golden ratio is a heuristic observation about why digit 1 dominates after the leading 5 (digit 1 is the greedy choice that maximizes remaining CF flexibility), not a proven structural connection. A rigorous explanation for the concentration at 0.1710.171 remains open.

Tightness of A=5A = 5

Max quotient usedFrequency
599.91%
40.07%
3\leq 30.02%

For 99.91% of moduli d100,000d \leq 100{,}000, the smallest witness α(d)\alpha(d) requires a partial quotient of exactly 5. This does not imply that no witness with all quotients 4\leq 4 exists for those dd — larger witnesses may satisfy a tighter bound. The statistic measures minimal-witness tightness, not global tightness of Zaremba’s conjecture at A=4A = 4.

Practical Impact

This observation enabled a 13x speedup in our CUDA verification kernel (v2 over v1) by starting the witness search at a=0.170da = \lfloor 0.170d \rfloor instead of a=1a = 1. Note: v2 also incorporated other optimizations (loop unrolling, early-exit predicates), so the full 13x factor is not solely attributable to the starting offset.

Code

Analysis script and raw data: github.com/cahlen/idontknow

Data Availability

The complete table of (d,α(d))(d, \alpha(d)) pairs for d=1d = 1 to 100,000100{,}000 is available at github.com/cahlen/idontknow/data/zaremba-witnesses/. The file witnesses_1_100000.csv contains columns d, alpha, ratio, cf_prefix, max_quotient. SHA-256 checksum will be published alongside the dataset for independent verification.

References

  1. Zaremba, S.K. (1972). “La méthode des ‘bons treillis’ pour le calcul des intégrales multiples.” Applications of Number Theory to Numerical Analysis, pp. 39–119.
  2. Bourgain, J. and Kontorovich, A. (2014). “On Zaremba’s conjecture.” Annals of Mathematics, 180(1), pp. 137–196. arXiv:1107.3776
  3. Khintchine, A.Ya. (1964). Continued Fractions. University of Chicago Press.

Computed from exhaustive analysis of d=1d = 1 to 100,000100{,}000 on NVIDIA DGX B200.

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.

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