NotAThether, was thinking, not a programmer.
but can someone make pollard kangaroo, with thinking about the manually inputted lesser divisor, like 32 bits less, or whatever bit,
"range" so this would require user input, then start the kangaroo search, while this lower point found fast, beep, notification whatsoever,
directly calculate the higher divised pubkey without user input, putting those correct pk's inside file found, and on screen,
sound great doesn't it.
guessing would require some work, but seeing what you guys calculate for fun here, guess would be possible.
but can someone make pollard kangaroo, with thinking about the manually inputted lesser divisor, like 32 bits less, or whatever bit,
"range" so this would require user input, then start the kangaroo search, while this lower point found fast, beep, notification whatsoever,
directly calculate the higher divised pubkey without user input, putting those correct pk's inside file found, and on screen,
sound great doesn't it.
guessing would require some work, but seeing what you guys calculate for fun here, guess would be possible.
Yeah this is definitely possible. Hell, the division-splitting can even be integrated right into JLP Kangaroo (and then you can just use Birthday paradox to search for a handful of public keys at once), eliminating the need for another script.
dont forget you will have only one key in 5 bit below range
other all keys will be on the curve but not below of 5 bit , in this case you need to load all 33 keys in the program and start searching but expect only one key to be hit. chances to hit one key in big range is fool idea, so my suggestion is if loading multiple keys will not impact speed of your program do the divisor for 30 (33554432) bit down and load all keys , still one key will be below 30 bit but you will have less total keys in range as compared to original target range ~~~ perhaps this will increase the chance.
brainless talked about reducing the number of keys but he never shared how can we (working script) , perhaps i will figure out something better soon
IAcan use all coders, ssxb, got system with tons of memory, and nice gpu settings here, will bsgs on that one in a minute all the way up to 80 bits, or use jlp kangs. or kangrand from iceland, to find all keys at one go.
math is beautiful 
, nice try with the speed doctoring WP.