Post
Topic
Board Bitcoin Discussion
Re: == Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==
by
WanderingPhilospher
on 09/03/2021, 17:38:27 UTC
if scan all it use a time too much

Depent of your speed, i made some calculations based on the speed, the time is for scan all the range in that bit space:

Code:
Puzzle 120 @ 1 Terakeys/s :     21074771622667996 years
Puzzle 120 @ 1 Petakeys/s :     21074771622667 years
Puzzle 120 @ 1 Exakeys/s :      21074771622 years
Puzzle 120 @ 1 Zettakeys/s :    21074771 years
Puzzle 120 @ 1 Yottakeys/s :    21074 years
Puzzle 160 @ 1 Terakeys/s :     23171956451847141650870193314 years
Puzzle 160 @ 1 Petakeys/s :     23171956451847141650870193 years
Puzzle 160 @ 1 Exakeys/s :      23171956451847141650870 years
Puzzle 160 @ 1 Zettakeys/s :    23171956451847141650 years
Puzzle 160 @ 1 Yottakeys/s :    23171956451847141 years
Puzzle 256 @ 1 Terakeys/s :     1835871531540401373407708412745559168131740612197318060720 years
Puzzle 256 @ 1 Petakeys/s :     1835871531540401373407708412745559168131740612197318060 years
Puzzle 256 @ 1 Exakeys/s :      1835871531540401373407708412745559168131740612197318 years
Puzzle 256 @ 1 Zettakeys/s :    1835871531540401373407708412745559168131740612197 years
Puzzle 256 @ 1 Yottakeys/s :    1835871531540401373407708412745559168131740612 years


Is this speed based upon bitcrack or kangaroo?

It's based off of his BSGS version written in C# which is slower than JLPs version. Everyone who comes up with meet in middle or baby step giant step always claims high numbers, meanwhile, JLPs BSGS just keeps on being the fastest, with no hype  Cool