@fx; the quick version. The kangaroo program basically creates wild and tame kangaroos. Both are set out to look for the distinguish point size you designate. So let's say you set dp to 20 (that will be a pubkey that has 5 leading zeros 0x00000; 5x4 = 20). Each time a dp is found, it is recorded in a hash table (the location and the distance traveled), if a tame visits a dp and a wild visits the same dp, then the key is solved. The kangaroos keep hopping around until a "collision" occurs when a tame and wild visit same dp (location).
Now, you talk about modifying it to not make it a kangaroo program, what would you want or change? Might be a better program to tweak to suit what you are looking for.
Thank you very very much WanderingPhilospher
you explain quick version and with image illustration on JeanLucPons Kangaroo github page now I understand better
https://raw.githubusercontent.com/JeanLucPons/Kangaroo/master/DOC/paths.jpgfirst time I just read code and try understand
good to know how tools it works (better than use tools only)
How can we know what happen with higher bits or large range ?
may be start point long too much difference
I try to find what problem and fix that point
I think may be try to write code to save data to can read like image illustration plot graph
How 2 public point X, Y (from public key) use to calculate on Kangaroo?
I think I need to more learn fundamental basic and help can figure out