Topic: BitCrack - A tool for brute-forcing private keys - page 73. (Read 76881 times)
Has anyone managed to run cuBitCrack on 30XX?
With a RTX 30xx card? Or a different one? If different, what card are you using?
I use 1070, I was planning to buy 3080, but now I'm thinking.
I still hope that the author will show up.
[/quote]
You may have to change the CUDA version to 11.0 or some other newer version if they make it for the 300xx, change CCAP, and maybe the SDK, but I'm not sure why it wouldn't work.
With a RTX 30xx card? Or a different one? If different, what card are you using?
[/quote]
I use 1070, I was planning to buy 3080, but now I'm thinking.
I still hope that the author will show up.
After installing the new driver version (456.38), bitcrack gives an error (Error: too many resources requested for launch).
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
BitCrack last updated on early of this year, so it's possible it won't be compatible with newer nvidia gpu. Consider use another tools such as https://github.com/JeanLucPons/Kangaroo
I am considering other options, most of all curious is the tool https://github.com/JeanLucPons/BTCCollider, but you cannot specify where, what and how to search on it.
After installing the new driver version (456.38), bitcrack gives an error (Error: too many resources requested for launch).
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
Did you try to adjust the -b -t -p sizes? The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
What speeds do you get with older driver?
At my requests 91-92 Mkey / s, after installing a new driver and reducing the -t parameter to 384, the speed dropped to 74 Mkey / s.
After installing the new driver version (456.38), bitcrack gives an error (Error: too many resources requested for launch).
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
BitCrack last updated on early of this year, so it's possible it won't be compatible with newer nvidia gpu. Consider use another tools such as https://github.com/JeanLucPons/Kangaroo
I am considering other options, most of all curious is the tool https://github.com/JeanLucPons/BTCCollider, but you cannot specify where, what and how to search on it.
After installing the new driver version (456.38), bitcrack gives an error (Error: too many resources requested for launch).
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
Did you try to adjust the -b -t -p sizes? The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
What speeds do you get with older driver?
At my requests 91-92 Mkey / s, after installing a new driver and reducing the -t parameter to 384, the speed dropped to 74 Mkey / s.
After installing the new driver version (456.38), bitcrack gives an error (Error: too many resources requested for launch).
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
Did you try to adjust the -b -t -p sizes? The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
What speeds do you get with older driver?
developer is missing, hope he is enjoying cracked address and now forget his community 
a lot of people don't want to believe the enormous size of the private key to search and the impossibility of ever succeeding in finding anything in that vast space so they waste a lot of time for a while before they realize it. besides the "puzzle" this was supposed to solve is also starting to get real hard even though it is still at the very low key ranges so that also isn't going anywhere.
After installing the new driver version (456.38), bitcrack gives an error (Error: too many resources requested for launch).
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
The problem is solved by rolling back to the previous version, but the question arises about the new 30XX line of nVidia.
when --count is coming ?
developer is missing, hope he is enjoying cracked address and now forget his community
and how gpu is checking 100m/sec keys with --stride that is confusing
lets say --stride is 2 and gpu calculations is 100/sec than GPU will work like this
so in one second = 2,4,6,8,10,12,14,16,18,20,22,24,26...............190,192,194,196,198,200
next second will be = 202,204,206,208,210,212,214,216...............390,392,394,396,398,400
right?
lets say --stride is 2 and gpu calculations is 100/sec than GPU will work like this
so in one second = 2,4,6,8,10,12,14,16,18,20,22,24,26...............190,192,194,196,198,200
next second will be = 202,204,206,208,210,212,214,216...............390,392,394,396,398,400
right?
when --count is coming ?
No it's a brainless application.
You need fast indexing of the targets and a more directional approach.
Filter off the dust and the file will be ~120 Megs.
In it's current state it's just a heater and it's not going to find anything, not now not ever.
You need fast indexing of the targets and a more directional approach.
Filter off the dust and the file will be ~120 Megs.
In it's current state it's just a heater and it's not going to find anything, not now not ever.
bro hope you have car, which one model/year you have ?
No it's a brainless application.
You need fast indexing of the targets and a more directional approach.
Filter off the dust and the file will be ~120 Megs.
In it's current state it's just a heater and it's not going to find anything, not now not ever.
You need fast indexing of the targets and a more directional approach.
Filter off the dust and the file will be ~120 Megs.
In it's current state it's just a heater and it's not going to find anything, not now not ever.
currently bitcrack running features like if stride is 100
count+stride+count+stride = 1+100+1+100 = total 202
looking update with new switch --count as define by user ( --count 200) and stride 100 ( user count is checking keys)
user-count + stride + user-count+ stride + user- count = 300+100+300+100+300 = total 1100
addons if --keyspace is 1:3000, new switch --loop --count 2000 --stride 100
user-count + stride + user-count+ stride + user- count = 2000+100+2000(its reach at end but still countin in loop from 1(startkey))+100+2000 continue loop
--count will be keys need to be check and stride
hope this feature will make bitcrack more effective and attractive
Thankx
count+stride+count+stride = 1+100+1+100 = total 202
looking update with new switch --count as define by user ( --count 200) and stride 100 ( user count is checking keys)
user-count + stride + user-count+ stride + user- count = 300+100+300+100+300 = total 1100
addons if --keyspace is 1:3000, new switch --loop --count 2000 --stride 100
user-count + stride + user-count+ stride + user- count = 2000+100+2000(its reach at end but still countin in loop from 1(startkey))+100+2000 continue loop
--count will be keys need to be check and stride
hope this feature will make bitcrack more effective and attractive
Thankx
Promising tool,
However even with 1080TI, you still need 25472017000000 years to complete a full priv key check.
So only possiblity is luck and you reeeeeeeeeeeeeeeeeeeeeeeaaaaaaaaaaaaalllllllllllyyyyyyyyyyy need to be lucky
However even with 1080TI, you still need 25472017000000 years to complete a full priv key check.
So only possiblity is luck and you reeeeeeeeeeeeeeeeeeeeeeeaaaaaaaaaaaaalllllllllllyyyyyyyyyyy need to be lucky
Of course, what did you expect?
By default stride = 1, which means you check numbers ...,3,4,5,6,7.....
but if you specify stride 5, program checks 5,10,15,20,25... Why you expect to have number 9 or 11 checked?
If your public key is generated from number 20, it will be found, if from 21 - not. It is obvious.
By default stride = 1, which means you check numbers ...,3,4,5,6,7.....
but if you specify stride 5, program checks 5,10,15,20,25... Why you expect to have number 9 or 11 checked?
If your public key is generated from number 20, it will be found, if from 21 - not. It is obvious.
ok wait do you mean if my gpu is checking 20m keys /sec with 5 jump
so in normal this will be 1,2,3,4,5,6.......20000000
but with 5 Jump this will be 5,10,15,20,25,30........100000000
right?
Of course, what did you expect?
By default stride = 1, which means you check numbers ...,3,4,5,6,7.....
but if you specify stride 5, program checks 5,10,15,20,25... Why you expect to have number 9 or 11 checked?
If your public key is generated from number 20, it will be found, if from 21 - not. It is obvious.
By default stride = 1, which means you check numbers ...,3,4,5,6,7.....
but if you specify stride 5, program checks 5,10,15,20,25... Why you expect to have number 9 or 11 checked?
If your public key is generated from number 20, it will be found, if from 21 - not. It is obvious.
Everyone knows that bitcrack only goes by consecutive keys.
Not really. You may specify your own 'distance' between key.
For example:
Code:
--stride F4240
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 Gpu is only searching for one address when you will give stride range jump in command and will find key than this will start search for 2nd address , please clarify
Everyone knows that bitcrack only goes by consecutive keys.
Not really. You may specify your own 'distance' between key.
For example:
Code:
--stride F4240
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
Everyone knows that bitcrack only goes by consecutive keys.
Not really. You may specify your own 'distance' between key.
For example:
Code:
--stride F4240
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
Jump to: