#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why.
I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time.
The luck was 25% in my case. Very good luck. I apologize for my English.
would it become available to use for us, wish it was made available for use with gpu, then again,
do you have a readme cause 6609y 8m 12d 19:32:04s this is not working> for me.
thanks man reading a lot and learning a lot here. greetz.