#100 - af55fc59c335c8ec67ed24826
Lucky with only 69% of the expected time - 1d 22:49:48 of the 2d 19:46:27 expected.
Great! zielar can fill in the #100 entry in the table in the OP. Congrats on your 1 BTC (approx $10,000) bounty!
For private key 000000000000000000000000000000000000000af55fc59c335c8ec67ed24826
I get:
Uncompressed Bitcoin Address: 1Bv8fD7w52gWTRpnAMTLPvMrsfpX6bySpe
Compressed Bitcoin Address:
1KCgMv8fo2TPBpddVi9jqmMmcne9uSNJ5FWhat is your expected time for #105 (approx another $10,500)?
My "back of the envelope" estimate for the estimated times, assuming you can afford or have access to the required hardware:
#100 = 50.0 bits of security was estimated at about 3 days
#105 = 52.5 bits of security will be about 3 x 2
2.5 = about 17 days
#110 = 55.0 bits of security will be about 3 x 2
5.0 = about 96 days
#115 = 57.5 bits of security will be about 3 x 2
7.5 = about 543 days = 1.49 years
#120 = 60.0 bits of security will be about 3 x 2
10.0 = about 3,072 days = 8.41 years
*** #125 = 62.5 bits of security will be about 3 x 2
12.5 = about 17,378 days = 47.56 years
#130 = 65.0 bits of security will be about 3 x 2
15.0 = about 98,304 days = 269.14 years
The last one would be:
#160 = 80.0 bits of security will be about 3 x 2
30.0 = about 3,221,225,472 days = 8,819,234 years
*** From what I understand 120 bits would be a new world record for "cracking" an EC key pair.
On 2 December 2016, Daniel J. Bernstein, Susanne Engels, Tanja Lange, Ruben Niederhagen, Christof Paar, Peter Schwabe, and Ralf Zimmermann announced the solution of a generic 117.35-bit elliptic curve discrete logarithm problem on a binary curve, using an optimized FPGA implementation of a parallel version of Pollard's rho algorithm. The attack ran for about six months on 64 to 576 FPGAs in parallel.[30]
From
https://en.wikipedia.org/wiki/Discrete_logarithm_records