{"id":28323149,"url":"https://github.com/lzyrapx/pi-miniature-calculation","last_synced_at":"2025-06-26T15:32:29.762Z","repository":{"id":192773394,"uuid":"130683184","full_name":"lzyrapx/Pi-Miniature-Calculation","owner":"lzyrapx","description":"☕️ A Miniature Program","archived":false,"fork":false,"pushed_at":"2018-05-02T06:35:55.000Z","size":447,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-06-01T23:41:19.908Z","etag":null,"topics":["algorithm"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lzyrapx.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2018-04-23T10:59:15.000Z","updated_at":"2020-05-29T19:03:45.000Z","dependencies_parsed_at":"2023-09-06T01:33:56.940Z","dependency_job_id":null,"html_url":"https://github.com/lzyrapx/Pi-Miniature-Calculation","commit_stats":null,"previous_names":["lzyrapx/pi-miniature-calculation"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/lzyrapx/Pi-Miniature-Calculation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lzyrapx%2FPi-Miniature-Calculation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lzyrapx%2FPi-Miniature-Calculation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lzyrapx%2FPi-Miniature-Calculation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lzyrapx%2FPi-Miniature-Calculation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lzyrapx","download_url":"https://codeload.github.com/lzyrapx/Pi-Miniature-Calculation/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lzyrapx%2FPi-Miniature-Calculation/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261567040,"owners_count":23178078,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm"],"created_at":"2025-05-25T15:10:59.987Z","updated_at":"2025-06-23T22:31:05.425Z","avatar_url":"https://github.com/lzyrapx.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Pi-Miniature-Calculation\n### 1. Main algorithm ：[Chudnovsky algorithm](https://en.wikipedia.org/wiki/Chudnovsky_algorithm)\n\n### 2. Description\n- **The Chudnovsky algorithm is a fast method for calculating the digits of π.** \n- **It was published by the Chudnovsky brothers in 1989, and was used in the world record calculations of 2.7 trillion digits of π in December 2009, 5 trillion digits in August 2010, 10 trillion digits in October 2011, 12.1 trillion digits in December 2013 and 22.4 trillion digits of π in November 2016.** \n- **The time complexity of the algorithm is `O(N*log(N)^3)` where N as N digits of Pi.**\n\n### 3. TestCase (No optimizations On my old laptop)\n- **N = 10, Time elapsed = 0.006s**\n- **N = 100, Time elapsed = 0.019s**\n- **N = 1000, Time elapsed = 0.197s**\n- **N = 10000, Time elapsed = 2.599s**\n- **N = 100000, Time elapsed = 40.793s**\n- **N = 1000000, Time elapsed = 700.538s**\n- **......**\n\n### 4. Program implements\n- **[Fast Fourier transform](https://en.wikipedia.org/wiki/Fast_Fourier_transform)**\n- **[Newton's method](https://en.wikipedia.org/wiki/Newton%27s_method)**\n- **[Binary_splitting method](https://en.wikipedia.org/wiki/Binary_splitting)**\n\n### 5. Editorial:\n- **[FFT based multiplication of large numbers](http://numbers.computation.free.fr/Constants/Algorithms/fft.html)**\n- **[Binary splitting method](http://numbers.computation.free.fr/Constants/Algorithms/splitting.html#Brent76)**\n- **[Newton's method and high order iterations](http://numbers.computation.free.fr/Constants/Algorithms/newton.html)**\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flzyrapx%2Fpi-miniature-calculation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flzyrapx%2Fpi-miniature-calculation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flzyrapx%2Fpi-miniature-calculation/lists"}