Thank you for the clarification. I wanted to understand the difference between a keyhant and a kangaroo. as for the fastest algorithm, I meant which is the fastest at the moment, not in theory.
I have an idea and I would really like someone to tell me about kangaroo's work. need the core of the algorithm and not much information to change the jumping mechanics. also need an algorithm for calculating the bitcoin address.
Can you help me ?
How are the kangaroo starting points calculated? what data (values) does the program use? what value is the public key converted from?
You will want to look at papers published for a deeper understanding or look at the kangaroo discussions on here but for basic understanding kangaroo has 2 types tames and wilds together they are a herd usually 1 tame and 2 wilds you can look at jeanlucpons or retiredC's readme for what they chose, tames jump to a random point then increment sequentially recording every point they land on while wilds jump from random point to random point not recording anything until they run into a tame then they hash and if the public key matches wow you found the key but if not then you get a dead kangaroo.
thanks for your reply. in my opinion, this is not a very reasonable approach. I wrote the code about two weeks ago. I looked at it and didn't like something about it, so I abandoned it. and a couple of days ago I remembered about him and came up with an idea. I didn't refine much, I checked on small ranges (up to 40 bits, since the speed is very low) - the result surprised me. if I tell you about the values I received, none of you will believe it. and it doesn't make sense yet. I'm currently looking for someone to help me write or give a kangaroo version so that I can modify the jumping math.