@fxsniper
Here is how my random "BitCrack" works. I call it Randomonium or VanBitKraken (since it is based off of VanitySearch and BitCrack). It can regenerate random points every so many keys based off of user input or user can decide to just let the program create random points throughout a range and search sequentially from each point generated.
With the flags/setup you see below, I am telling the program to search for 1Be2U address, generate new random points every 1600 Mkeys checked. I am also tell the program to search in the 36 bit range (900000000) via the boomT flag and setting the bits via the bitz flag to 32. So all random points will start with a 9 and random 32 bits, as evident by the keys below. I have it to stop once it finds the key, that's why the program stopped. Just a small sample size to show you how it works. I know there are some versions of BitCrack out there that have a random feature but I do not know which ones work. I think BitCrack generates x amount of points (based off of your -b -t -p settings) and spreads those points over the range you have identified in the --keyspace flag, but I could be wrong.
Thank you WanderingPhilospher
BitCrack is fast to generate bitcoin address to brute-force fast
For solve puzzle, all leave address
Can possible Forked BitCrack to use Pollard's kangaroo pattern
but may be easy for you help modify Forked Pollard's kangaroo to brute-force from bitcoin key
if kangaroo require pubkey for calculate x y may be can apply using from private key generate by same rank (or give sample) but target check change to bitcoin address
may be need to add function covert private key to address for check
I don't know high technical and deep programming. it scan possible, just think idea for looking way better brute-force
because on leave of puzzle, many address not have pubkey for use reference to brute-force
I think for now use BitCrack for high bits may be use very long time for brute-force , should be have some strategy for attack
I think kangaroo method is good algorithm