Chudnovsky Algorithm
   HOME

TheInfoList



OR:

The Chudnovsky algorithm is a fast method for calculating the digits of , based on Ramanujan's formulae. Published by the
Chudnovsky brothers David Volfovich Chudnovsky (born January 22, 1947) and Gregory Volfovich Chudnovsky (born April 17, 1952) are American mathematicians and engineers known for their world-record mathematical calculations and developing the Chudnovsky algorithm us ...
in 1988, it was used to calculate to a billion decimal places. It was used in the
world record A world record is usually the best global and most important performance that is ever recorded and officially verified in a specific skill, sport, or other kind of activity. The book ''Guinness World Records'' and other world records organizatio ...
calculations of 2.7 trillion digits of in December 2009, 10 trillion digits in October 2011, 22.4 trillion digits in November 2016, 31.4 trillion digits in September 2018–January 2019, 50 trillion digits on January 29, 2020, 62.8 trillion digits on August 14, 2021, 100 trillion digits on March 21, 2022, 105 trillion digits on March 14, 2024, and 202 trillion digits on June 28, 2024. Recently, the record was broken yet again on April 2nd 2025 with 300 trillion digits of pi. This was done through the usage of the algorithm on y-cruncher.


Algorithm

The algorithm is based on the negated
Heegner number In number theory Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from int ...
d = -163 , the ''j''-function j \left(\tfrac\right) = -640320^3, and on the following rapidly convergent generalized hypergeometric series: \frac = 12 \sum_^ This identity is similar to some of Ramanujan's formulas involving , and is an example of a Ramanujan–Sato series. The
time complexity In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations ...
of the algorithm is O\left(n (\log n)^3\right).


Optimizations

The optimization technique used for the world record computations is called binary splitting.


See also

* Bailey–Borwein–Plouffe formula * Borwein's algorithm *
Approximations of π Approximation#Mathematics, Approximations for the mathematical constant pi () in the history of mathematics reached an accuracy within 0.04% of the true value before the beginning of the Common Era. In Chinese mathematics, this was improved to ...


References

{{reflist Pi algorithms