mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Open Projects > y-cruncher

Reply
 
Thread Tools
Old 2020-11-20, 07:01   #34
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

2·7·227 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
Hmm, rings a bell.
That girl has problems, bein' heard ain't one of 'em .
-- Ethel Merman, referring to Janis Joplin
He was probably refering to:
Got 99 problems and a bitch ain't one
- Ice-T 1993
ATH is offline   Reply With Quote
Old 2020-12-03, 15:52   #35
mackerel
 
mackerel's Avatar
 
Feb 2016
UK

23·5·11 Posts
Default

Quote:
Originally Posted by storm5510 View Post
Y-Cruncher seems to prefer vast amounts of swap/storage space on drives over lot of RAM.
Only just saw this, forgot this forum was here. Y-cruncher would love as much ram as is needed, but in reality no consumer attainable system can possibly have enough ram for the bigger runs. We're talking well into the TB that not even high end servers can reach. And that's putting aside the cost of that much ram even if you could put it in a single system. So the practicality of it is, you have to use some form of swap as a less insane cost substitute, and that is where the optimisation needs to go.
mackerel is offline   Reply With Quote
Old 2020-12-03, 15:57   #36
Xyzzy
 
Xyzzy's Avatar
 
Aug 2002

5×1,663 Posts
Default

To prove that you computed x digits of pi, couldn't you store only a checksum of all of the digits and keep the last digit "for fun"?

Xyzzy is offline   Reply With Quote
Old 2020-12-03, 16:32   #37
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

2AD216 Posts
Default

Quote:
Originally Posted by Xyzzy View Post
To prove that you computed x digits of pi, couldn't you store only a checksum of all of the digits and keep the last digit "for fun"?

Don't see why not. Computing the last digit is much cheaper than computing them all.
xilman is offline   Reply With Quote
Old 2020-12-05, 14:28   #38
Xyzzy
 
Xyzzy's Avatar
 
Aug 2002

100000011110112 Posts
Default

Quote:
Originally Posted by xilman View Post
Don't see why not. Computing the last digit is much cheaper than computing them all.
Would the NT community accept the last digit and a checksum as a record? (Say you ran it twice with a different algorithm each time and both checksums matched.)

Xyzzy is offline   Reply With Quote
Old 2020-12-05, 16:58   #39
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101Γ—103 Posts

22·23·109 Posts
Default

The last 10 digits and a 128 bit check-sum would be enough, I would suppose.
Uncwilly is offline   Reply With Quote
Old 2020-12-05, 17:10   #40
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

33·233 Posts
Default

Digit extraction algorithms exist. So merely producing a few trailing digits wouldn't be enough to prove you computed all the digits up to that point.

A hash of all digits up to your claimed last digit would be suitable IMO.
retina is offline   Reply With Quote
Old 2020-12-05, 18:08   #41
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

5·13·23 Posts
Default

Quote:
Originally Posted by Xyzzy View Post
Would the NT community accept the last digit and a checksum as a record? (Say you ran it twice with a different algorithm each time and both checksums matched.)

Quote:
Originally Posted by retina View Post
Digit extraction algorithms exist. So merely producing a few trailing digits wouldn't be enough to prove you computed all the digits up to that point.
There is no BBP type formula for Pi in base ten [though there could be], https://en.wikipedia.org/wiki/Bailey...louffe_formula .
But even giving only the last few bits would enable to provide a fake proof, just give the exact bits from BBP and give a trash hash value. [notice that even giving say hundred consecutive bits of Pi is "easy"].

Much better: 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 20-25 positions and verify the bits with BBP. You have an extremely small probability to fake me. This is assuming that when you need multiple bits of Pi then there is no faster method than to use the BBP formula for each position.
R. Gerbicz is offline   Reply With Quote
Old 2020-12-07, 07:41   #42
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

34×112 Posts
Default

Group the bytes by 32 or 64 and compute a SHA256 or SHA512 of it. I don't believe anybody would contest that.
LaurV is offline   Reply With Quote
Old 2020-12-07, 14:05   #43
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

5·13·23 Posts
Default

Quote:
Originally Posted by LaurV View Post
Group the bytes by 32 or 64 and compute a SHA256 or SHA512 of it. I don't believe anybody would contest that.
So you would accept any(?) hash value as a proof, say claiming 256T digits of Pi, and giving only sha256 as:
Code:
a19a6c3a75783b6b5deee64777873ae207764837e769eedbe9b4c485d94b2986

Last fiddled with by R. Gerbicz on 2020-12-07 at 14:05 Reason: typo
R. Gerbicz is offline   Reply With Quote
Old 2020-12-08, 07:01   #44
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

34×112 Posts
Default

Yep. After I remake the calculus to see if I get the same value...
I assume somebody verifies this things, anyhow... Or not?

Last fiddled with by LaurV on 2020-12-08 at 07:03
LaurV is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
operation trillion digits? mersenneNoob Operation Billion Digits 11 2021-06-02 07:37
Google Cloud Compute 31.4 Trillion Digits of Pi Mysticial y-cruncher 30 2019-10-11 14:45
Sum of Digits davar55 Puzzles 36 2015-12-18 15:47
How many digits? kokakola Information & Answers 23 2009-11-03 05:08
All 10 Digits davar55 Puzzles 5 2007-06-18 15:06

All times are UTC. The time now is 16:09.


Thu Oct 28 16:09:44 UTC 2021 up 97 days, 10:38, 0 users, load averages: 1.50, 1.57, 1.52

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.