![]() Stay tuned for a future blog about the algorithm. While it was the fastest thing in 2008, it unfortunately did not age very well. Yes, the Hybrid NTT that started the entire y-cruncher project is now gone. The loss of performance for the oldest processors is primarily due to the removal of the Hybrid NTT. Work actually began more than 3 years ago, but very little progress was made until this year where I'm on garden leave and therefore not working.Īs of today, enough has been done to get some preliminary in-memory benchmarks: Processor More than 400,000 of code will be touched. The implication of this will be performance gains on newer processors and regressions on older processors. Algorithms that are useful on modern processors are getting redesigned and rewritten from scratch while the rest will be completely removed from the codebase. In an effort to clean up and modernize the project, most of the large multiply algorithms are getting either refreshed or removed. Upcoming Changes for v0.8.x: (June 7, 2023). 5 trillion digits - August 2010 (Shigeru Kondo).10 trillion digits - October 2011 (Shigeru Kondo).12.1 trillion digits - December 2013 (Shigeru Kondo).13.3 trillion digits - October 2014 (Sandon Van Ness "houkouonchi").22.4 trillion digits - November 2016 (Peter Trueb).31.4 trillion digits - January 2019 (Emma Haruka Iwao).50 trillion digits - January 2020 (Timothy Mullican).62.8 trillion digits - August 2021 (UAS Grisons).100 trillion digits - June 2022 (Emma Haruka Iwao).Y-cruncher has been used to set several world records for the most digits of Pi ever computed. ![]() Ever since its launch in 2009, it has become a common benchmarking and stress-testing application for overclockers and hardware enthusiasts. It is the first of its kind that is multi-threaded and scalable to multi-core systems. Y-cruncher is a program that can compute Pi and other constants to trillions of digits. The first scalable multi-threaded Pi-benchmark for multi-core systems.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |