130-bit is solvable in time complexity of 2**64.5 steps
I'm asking for a proper solution from a community developer or a github the can vouch for that everyone knows, like wandering/alberto/digaran etc....
I could brag that I managed to write from scratch a completely working Kangaroo that currently works 6x (six times) faster
I never got further than 2**50 steps. Somewhere on 2**45 it starts to slow down.
Try to make SECPK1 6x (six times) faster first.
The fastest implementation for secp256k1 code that I ever see and use it is already inside of kangaroo tool.
https://github.com/JeanLucPons/Kangaroo/tree/master/SECPK1I would like to see some new ideas here.
