Everyone knows that bitcrack only goes by consecutive keys.
Not really. You may specify your own 'distance' between key.
For example:
Code:
--stride F4240
will do 1000000 keys long 'jump' between tries.That's still consecutive not random
how you are calculating --stride F4240 = 1m
how about for 1 billion or for 50billion? please tell me how to calculate any guide
http://jfgi.herokuapp.com/https://www.google.com/search?q=decimal+to+hex+calculator
https://www.rapidtables.com/convert/number/decimal-to-hex.html
1000000000 = 3B9ACA00
50000000000 = BA43B7400
this one is very strange check this out
clBitCrack.exe --stride BA43B7400 -b 52 -t 512 -p 1024 --compression both --keyspace 0100000000000000000000000000000000000000000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140 -i 1.txt -o 01.txt
i loaded these addresses to check this one is working or not and guess what if i load 6 or 8 address its working as i expect but if i load more than 6 addressess it is not working ,
1CTGjE4t65gvTzGRCP2rr1UmwYRHRwR2gB
1Bst22LeSjptwhSbAe4XXArjBpnnKDF42X
1FoWHbebHzAuNzg4sX8R2bxBDBCdFQejTv
1CTkWpdNYsM7u9zw3DTiJhEZFA1YJTzBcU
16MAA9YeMSp7VtnQsBSYXgEGg6f1dFdwR1
1B8XXy9YykVF1qk6qm9N3HZ5Bx55mmjDpW
14B12QMdUbtnpAVv7wkowQtG1B94GP2Sa9
1Ap9DW4YjtuGxxVR9hL3CLjMTM8z1kQZfE
1KDpXzUdjcxkbC7NhTL8T7DiVNh1ERAmEs
some addresses i chose as they are coming in stride range jump and some i chose right after or before stride jump , so question is if GPU doing stride jump and than calculating million of addresses this should also show address right after stride jump or right before stride jump, but in all cases it is showing only exact jump address only nothing before or nothing after . and my guess is GPU is checking first only compress range and than non compress range , strange thing lol. and in my guess cpu is only searching for one address when you will give stride range jump in command and gpu will find key than this will start search for 2nd address , please clarify