hi @BitCrack
Will you consider releasing a server-client version of bitcrack ?
Yes, I have been working on it for a little while.
Great news
don't forget to merge this
https://github.com/brichard19/BitCrack/issues/256 if it is not already done.
And thanks a lot.
anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features
if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community
--stride 1000:52000
where 1000 key check, and 52000 key bypass(no check)
--loop 500
count total keys of --keyspace * 500 = total keys
example 1 to 100 + 1 to 100 + 1 to 100
cuurent stride work only fixed like --stride 1:52000 or 1:123456
Brichard19 refuse to further work at bitcrack
I'm trying to follow what you are saying/wanting the program to do.
It checks 1000 keys, and then skips 52000 keys?
I didn't know the current stride function could be used as --stride1:52000; I only used --stride and a single number. But I do know the stride function is broken when you try to use it with the continue function. If you use a number higher than 9, say --stride 11 with --continue, it works first time around but changes the stride second time around. It doesn't parse/calculate numbers above 10(A) correctly.
actual func is --stride 52000, 52000 define by user, its skip 52000 and check 1 key, as i think its fixed inside first key and next key,
in program by default only 1 is fixed for check, should be create func for check keys define by user
and loop function
i design reverse kangaroo inside bitcrack, mean i created pubkeys inside bit range, as per kangaroo jump
and checking and skips calculation will find solution in loop, in this senerio, no need highest rams, and hdd spaces, and no dead kangaroo, and by default save/continuous func save your work just 1 click
? 
