20201208, 10:59  #45  
"Robert Gerbicz"
Oct 2005
Hungary
620_{16} Posts 
Quote:
For comparison in this record size the BBP takes less than a single day, while the whole record computation took 303 days. (ref. https://en.wikipedia.org/wiki/Chrono...tion_of_%CF%80). So with a 50% probability your record claim would fail in a single day. What is not that bad. ps. Or with a much larger probability if we'd ask at each position not a single bit but say 20 consecutive bits, this is not increasing the BBP time too much but you'd fail with much larger chance. 

20201208, 11:18  #46  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
1100100111000_{2} Posts 
Quote:
So you ask for your 20 positional digits. A day later the reply gives the digits. You check them and see no error. Still doesn't prove the claimant computed all the other digits. Only a hash of them all after a full recomputation can do that. 

20201208, 12:25  #47  
"Robert Gerbicz"
Oct 2005
Hungary
2^{5}×7^{2} Posts 
Quote:
"if you're claiming a world record then I would choose 1 million random positions and you should give the bits for each of these positions. The check: select say 2025 positions and verify the bits with BBP. You have an extremely small probability to fake me." I'm requesting the bits for 1 million positions and after receiving your file with bits, checking random(!!!) 2025 positions. If you'd do this with BBP then the overall computation time would be 2500 times larger than what a direct computation of pi would use. You can still select some positions from the list and use BBP for these and/or use known bits of pi (for small positions), but you wouldn't pass the test. Last fiddled with by R. Gerbicz on 20201208 at 12:28 Reason: small typo 

20201208, 12:29  #48  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2^{3}×3×269 Posts 
Quote:


20201209, 03:06  #49 
Romulan Interpreter
"name field"
Jun 2011
Thailand
2×17×293 Posts 
How do you figure? Is BBP so slow that computing one million bits with it (in fact, you compute 4 bits every time, iirc), is 2500 times slower than computing (what's the record? two terradigits?) of pi by the fastest method? (probably some variation of Ramanujan formula?, well, it seems odd to me, but yes, I didn't make any calculation, just gut feeling, and just asking).
Last fiddled with by LaurV on 20201209 at 03:12 
20210106, 17:47  #50  
Sep 2016
101011000_{2} Posts 
Quote:
 There's some preliminary research into a hybrid BBP+Binary Splitting algorithm that may allow M consecutive digits starting from the N'th digit to be computed faster than O(M * N log(N)). (binary digits of course) Such an algorithm could potentially allow for a lowmemory distributed computation of Pi  but only the binary digits and at the cost of a much larger BigO than the classic algorithms. If such an algorithm does come to fruit, then asking for a million digits starting from N may not be sufficient. Last fiddled with by Mysticial on 20210106 at 17:53 

20210817, 09:40  #51 
Sep 2002
Database er0rr
2^{2}·1,033 Posts 
I did not know where to post this in the forum. So here it is: pi calculated to 68.2 trillion digits. Also this article.
Last fiddled with by paulunderwood on 20210817 at 09:43 
20210817, 12:16  #52 
Einyen
Dec 2003
Denmark
CF1_{16} Posts 
62.8 trillion digits, probably * 20 trillion digits.

20210817, 16:32  #53 
Sep 2016
530_{8} Posts 
Been so busy lately that I hadn't had time to process this record yet on my site. haha
I need to give ycruncher a bit of love back. Largely neglected it for almost 2 years now. And lots of unfinished stuff and featurerequests (mostly involving storage scalability) that I still need to deal with. But life gets in the way. Just upgrading the compilers earlier this year took a month of retesting. 
20210817, 20:44  #54 
"Robert Gerbicz"
Oct 2005
Hungary
2^{5}·7^{2} Posts 
And what algorithm has been used? Chudnovsky, or better: https://mersenneforum.org/showpost.p...49&postcount=8 .

20210817, 21:44  #55  
Sep 2016
2^{3}×43 Posts 
Quote:
I'll have to look take a closer look at your ArcTan formula when I get the time. But my first impression is that yes multiple terms can be run in parallel, but it's not necessarily beneficial here.
So for 100 trillion digits of Pi, you're looking at 400 TB of storage using Chudnovsky or the ArcTan terms summed up serially. If you want to run the ArcTan terms in parallel, it would be 400TB x parallelization. While it may be faster, in practice, the #1 of complaint I get from people attempting these records is that they can't source enough storage for it  let alone fast storage. Last fiddled with by Mysticial on 20210817 at 21:45 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
operation trillion digits?  mersenneNoob  Operation Billion Digits  11  20210602 07:37 
Google Cloud Compute 31.4 Trillion Digits of Pi  Mysticial  ycruncher  30  20191011 14:45 
Sum of Digits  davar55  Puzzles  36  20151218 15:47 
How many digits?  kokakola  Information & Answers  23  20091103 05:08 
All 10 Digits  davar55  Puzzles  5  20070618 15:06 