Why not add the ability to search by ripemd160 [...] to speed up
ripemd160(base16) <--> btcaddr(base58) <--> Int/Dec(base10) <--> Hex(base16) <--> Binary(base2)
it's the same thing, just the bases are different, converting
Why not add the ability to search by [...] known public key to speed up
Matching against pubkey would be handy (if it doesn't already do this?)
..because main target(puzzle) assumes a public key unknown (only its ripemd160 hash is known).
and if pubkey is known then sequential key search in a limited space (which uses bitcrack) is the stupidest and slowest way to search compared to baby-step-gigant-step algo and pollard-rho/kangaroo algo
when BitCrack compute 10M keys, its checked 10M keys
when BSGS/Pollard compute 10M keys, its checked (10M)^2 = 100000000M keys (!!!..undestand?)
And which bitcrack version supports random key space function ?
This fork
https://github.com/pikachunakapika/BitCrack-r, --random
Each point will start in random KEYSPACE