I am having difficulty correctly implementing Pollard’s rho algorithm for the secp256k1 curve, I have already done tests with smaller ranges such as 25, 30, 35 bits, but the program runs infinitely, and in my tests it went through 8 billion steps without success in finding the log through the public key, if anyone has more in-depth knowledge, I will leave the link to the repository here, your help will be greatly appreciated.

text

Furthermore, at times I receive the ‘segmentation fault’ error due to the derivation of points on the curve.