Quote from: Telariust on August 14, 2019, 03:55:07 AM

Quote from: avw on August 13, 2019, 09:38:31 AM

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

Quote from: avw on August 13, 2019, 09:38:31 AM

Why not add the ability to search by [...] known public key to speed up

Quote from: almightyruler on August 13, 2019, 10:02:17 AM

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?)

Quote from: avw on August 13, 2019, 09:38:31 AM

And which bitcrack version supports random key space function ?

This fork https://github.com/pikachunakapika/BitCrack

Code:

-r, --random
Each point will start in random KEYSPACE

Sir,
Could you please how to calculate as bellow:
when BitCrack compute 10M keys, its checked 10M keys
when BSGS/Pollard compute 10M keys, its checked (10M)^2 = 100000000M keys (!!!..undestand?)