Distant decimals of $π$: Formal proofs of some algorithms computing them and guarantees of exact computation

Yves Bertot 1 Laurence Rideau 1 Laurent Théry 1
1 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We describe how to compute very far decimals of $π$ and how to provide formal guarantees that the decimals we compute are correct. In particular, we report on an experiment where 1 million decimals of $π$ and the billionth hexadecimal (without the preceding ones) have been computed in a formally verified way. Three methods have been studied, the first one relying on a spigot formula to obtain at a reasonable cost only one distant digit (more precisely a hexadecimal digit, because the numeration basis is 16) and the other two relying on arithmetic-geometric means. All proofs and computations can be made inside the Coq system. We detail the new formalized material that was necessary for this achievement and the techniques employed to guarantee the accuracy of the computed digits, in spite of the necessity to work with fixed precision numerical computation.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [37 references]  Display  Hide  Download

Contributor : Yves Bertot <>
Submitted on : Monday, December 11, 2017 - 11:44:38 AM
Last modification on : Monday, September 3, 2018 - 10:56:02 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NoDerivatives 4.0 International License


  • HAL Id : hal-01582524, version 2
  • ARXIV : 1709.01743



Yves Bertot, Laurence Rideau, Laurent Théry. Distant decimals of $π$: Formal proofs of some algorithms computing them and guarantees of exact computation. Journal of Automated Reasoning, Springer Verlag, In press, pp.1-45. ⟨hal-01582524v2⟩



Record views


Files downloads