Pages:
Author

Topic: BitCrack - A tool for brute-forcing private keys - page 47. (Read 76850 times)

newbie
Activity: 28
Merit: 1
has it any effect if i use more than 1 target some people use 10 some 80.000 do it need longer with more targets? with 1 target it will count 20mio keys/s with 10 targets also 20mio keys/s or dont i see anything?

and can someone told me what exactly BitCracker does? many tools are using a password database for the passphrase other only generate 12 or 24 words.

and one more question in the beginning of btc how mutch words was used for a wallet?
Yes, the amount of addresses you are searching for does have an effect on speed.  But to start seeing a decline in speed, you will have to have thousands of addresses loaded in input file.

Bitcrack searches private keys, sequentially, one by one, from your start range until your end range, whatever you input as start/end ranges - using the --keyspace option.

Bitcrack has nothing to do with databases or passprhases.

is it better to use more than 1 target? for example if i use one target and it needs 1 year to crack and then i let it work on the 2nd one and it also needs 1 year will it found 2 targets together in maybe 2 years or faster?
then it cracks from 20 targets one of them in 20 years? (only example)

and it is possible to run the script offline?
member
Activity: 275
Merit: 20
the right steps towerds the goal
why this will happen when i run 2 windows in same time then close the other one then speed will boost for few seconds  Huh




https://imgur.com/coMnsp7  https://imgur.com/tVHZL84
member
Activity: 275
Merit: 20
the right steps towerds the goal
Excellent job  Shocked Shocked Shocked please give us the compiled beta version for various benchmarks. it may helps you to get things done..

Compiled binary? Pffft. Then the next guy won't be able to speed up Bitcrack  Wink I'll just put the source on GitHub once I'm find the optimal level of tuning.

Source code is useless for me as i am a noob in those programming Except little bit in python and can't able to compile too  Cry  

Whether you're using Linux or Windows the compilation process is actually straightforward. On Linux you just open a terminal and run make BUILD_CUDA=1, and I have an autodetection script that will detect the compute cap of the GPUs.

On Windows you go to Visual Studio > Build Solution, and I believe there's an environment variable for the CUDA compute cap you can set from the Properties, however I haven't compiled Windows stuff in a while so I need to recheck where it is.

In all seriousness though, it is better not to make a compiled binary because assembly for all of the CUDA compute caps have to be included in the binary and that takes a long time to make, longer than just building against one compute cap.

(Though I think I see your point about Windows compilation, VS is a pain in the ass to download, so maybe there will be a compiled Windows version, but for Linux this is infeasible unless I find out how to make an AppImage).

I don't care if I use it later or earlier. There are many people in our community who can compile it in the Windows version. I will use it after that, I am very happy to see that People like you share their works and help each other. This is definitely the identity of a good community. I really appreciate all of you Those who carry out such a difficult tasks. hats off  Kiss Kiss
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
Excellent job  Shocked Shocked Shocked please give us the compiled beta version for various benchmarks. it may helps you to get things done..

Compiled binary? Pffft. Then the next guy won't be able to speed up Bitcrack  Wink I'll just put the source on GitHub once I'm find the optimal level of tuning.

Source code is useless for me as i am a noob in those programming Except little bit in python and can't able to compile too  Cry  

Whether you're using Linux or Windows the compilation process is actually straightforward. On Linux you just open a terminal and run make BUILD_CUDA=1, and I have an autodetection script that will detect the compute cap of the GPUs.

On Windows you go to Visual Studio > Build Solution, and I believe there's an environment variable for the CUDA compute cap you can set from the Properties, however I haven't compiled Windows stuff in a while so I need to recheck where it is.

In all seriousness though, it is better not to make a compiled binary because assembly for all of the CUDA compute caps have to be included in the binary and that takes a long time to make, longer than just building against one compute cap.

(Though I think I see your point about Windows compilation, VS is a pain in the ass to download, so maybe there will be a compiled Windows version, but for Linux this is infeasible unless I find out how to make an AppImage).
member
Activity: 275
Merit: 20
the right steps towerds the goal
Excellent job  Shocked Shocked Shocked please give us the compiled beta version for various benchmarks. it may helps you to get things done..

Compiled binary? Pffft. Then the next guy won't be able to speed up Bitcrack  Wink I'll just put the source on GitHub once I'm find the optimal level of tuning.

Source code is useless for me as i am a noob in those programming Except little bit in python and can't able to compile too  Cry 
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
Excellent job  Shocked Shocked Shocked please give us the compiled beta version for various benchmarks. it may helps you to get things done..

Compiled binary? Pffft. Then the next guy won't be able to speed up Bitcrack  Wink I'll just put the source on GitHub once I'm find the optimal level of tuning.
member
Activity: 275
Merit: 20
the right steps towerds the goal
Well boys, I think I may have just fixed RTX 30xx compatibility  Smiley



No debug switch used - speed is awful because I'm using tiny -t -p and -b settings. I didn't want to wait several minutes to see if it worked.

That being said, there's no optimization in this program either. I guess the optimization was too aggressive and it broke things. Maybe I will inch it up a few increments to see the highest that'll work without crashing.

Code and benchmarks tomorrow - I'm dead tired now.

Excellent job  Shocked Shocked Shocked please give us the compiled beta version for various benchmarks. it may helps you to get things done..
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
Amazing job sir. A hero we all needed within this chaos.
Optimize can’t be set per file base? Split the code that can’t be optimized?

Can’t wait to see this.  Grin

GCC's .cpp files are already compiled with -O2, and here are the NVCC flags I put in the Makefile:

NVCCFLAGS=-std=c++11 --ptxas-options="-v --opt-level 0" -Xcicc -O0 --compile --compiler-options -O2 -gencode=arch=compute_${COMPUTE_CAP},code=sm_${COMPUTE_CAP}

So the C++ files are compiled with -O2 but I completely disabled cicc and ptxas optimization. This resulted in several more CUDA functions being included in the Cubin (versus about 6 when the default optimization level 3 is used).

I want to see if t behaves properly under optimization levels 1 and 2 first. At 20 MKey/s it looks like there's still more work to do though I am aware that I can't push the optimization all the way up, so speed's never going to be as fast as it should be.

(Default block thread and points settings this time)

full member
Activity: 1162
Merit: 237
Shooters Shoot...
has it any effect if i use more than 1 target some people use 10 some 80.000 do it need longer with more targets? with 1 target it will count 20mio keys/s with 10 targets also 20mio keys/s or dont i see anything?

and can someone told me what exactly BitCracker does? many tools are using a password database for the passphrase other only generate 12 or 24 words.

and one more question in the beginning of btc how mutch words was used for a wallet?
Yes, the amount of addresses you are searching for does have an effect on speed.  But to start seeing a decline in speed, you will have to have thousands of addresses loaded in input file.

Bitcrack searches private keys, sequentially, one by one, from your start range until your end range, whatever you input as start/end ranges - using the --keyspace option.

Bitcrack has nothing to do with databases or passprhases.
newbie
Activity: 28
Merit: 1
has it any effect if i use more than 1 target some people use 10 some 80.000 do it need longer with more targets? with 1 target it will count 20mio keys/s with 10 targets also 20mio keys/s or dont i see anything?

and can someone told me what exactly BitCracker does? many tools are using a password database for the passphrase other only generate 12 or 24 words.

and one more question in the beginning of btc how mutch words was used for a wallet?
full member
Activity: 1162
Merit: 237
Shooters Shoot...
If you had a quantum computer, you could decipher anything and steal all the cryptocurrency...
If if was a fifth, the whole world would be drunk
jr. member
Activity: 36
Merit: 3
Well boys, I think I may have just fixed RTX 30xx compatibility  Smiley



No debug switch used - speed is awful because I'm using tiny -t -p and -b settings. I didn't want to wait several minutes to see if it worked.

That being said, there's no optimization in this program either. I guess the optimization was too aggressive and it broke things. Maybe I will inch it up a few increments to see the highest that'll work without crashing.

Code and benchmarks tomorrow - I'm dead tired now.

Amazing job sir. A hero we all needed within this chaos.
Optimize can’t be set per file base? Split the code that can’t be optimized?

Can’t wait to see this.  Grin
full member
Activity: 1162
Merit: 237
Shooters Shoot...
I have a question about the commands i found here many times: -b 64 -t 128 -p 256
i have an old GTX 660 OC II with 960 Shader-Units / 80 TMUs / 24ROPs. How must i config the commans -b -t and -p with my GPU?

With the cudaInfo it will give me this info:
ID:  0
Name: GeForce GTX 660
Capability: 3.0
MP: 5
Cores: 960 (192 per MP)
Memory: 2048MB

for now i have 17.79Mkeys/s i thinks i must be more than this for normal because it have also CUDA.
And another Question if i have some adresses i want to can why i must start with 0000000000000000000000000000000000000000000000000000000000000001 is that only a count number or have it something to do with the Private key?
I Only want to use it for education that i can see if there is really a way to hack my wallet and if bitcoin is secure.

thx


To be honest, you will have to play with those settings to see what gives your card, and hardware, the best results.

You do not have to start with 000....0001; use the --keyspace option with a start and end range.

--keyspace 400000000:FFFFFFFF; that tells the program to start at key 400000000 and end at FFFFFFFF

Also, there is a "counting by" option and maybe that is what you saw with the 000....0001. If that's the case, that is normal/default to count keys sequentially, by 1. 
newbie
Activity: 28
Merit: 1
I have a question about the commands i found here many times: -b 64 -t 128 -p 256
i have an old GTX 660 OC II with 960 Shader-Units / 80 TMUs / 24ROPs. How must i config the commans -b -t and -p with my GPU?

With the cudaInfo it will give me this info:
ID:  0
Name: GeForce GTX 660
Capability: 3.0
MP: 5
Cores: 960 (192 per MP)
Memory: 2048MB

for now i have 17.79Mkeys/s i thinks i must be more than this for normal because it have also CUDA.
And another Question if i have some adresses i want to can why i must start with 0000000000000000000000000000000000000000000000000000000000000001 is that only a count number or have it something to do with the Private key?
I Only want to use it for education that i can see if there is really a way to hack my wallet and if bitcoin is secure.

thx

legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
Well boys, I think I may have just fixed RTX 30xx compatibility  Smiley



No debug switch used - speed is awful because I'm using tiny -t -p and -b settings. I didn't want to wait several minutes to see if it worked.

That being said, there's no optimization in this program either. I guess the optimization was too aggressive and it broke things. Maybe I will inch it up a few increments to see the highest that'll work without crashing.

Code and benchmarks tomorrow - I'm dead tired now.
member
Activity: 406
Merit: 47
OK,
I would like to search vanity with keyspace.
VanitySearch search to full key 256 bit and VanitySearch  can not control keyspace search
bitCrack can search by options keyspace

How can use VanitySearch for search Vanity by limited keyspace search?


Why would you want to do that? By reducing the keyspace, you are making it harder for it to find a vanity address since there are now less possible addresses that are in that keyspace.

No need Vanity bitCrack anymore because bitCrack are scan every key from 1234...99.100
I want to test by random
now I want test VanitySearch that can use option keyspace search
Can seed option on VanitySearch use custom keyspace?
anybody know please  advice
member
Activity: 406
Merit: 47
OK,
I would like to search vanity with keyspace.
VanitySearch search to full key 256 bit and VanitySearch  can not control keyspace search
bitCrack can search by options keyspace

How can use VanitySearch for search Vanity by limited keyspace search?


Why would you want to do that? By reducing the keyspace, you are making it harder for it to find a vanity address since there are now less possible addresses that are in that keyspace.


Just do some experiment
for search puzzle #64
member
Activity: 275
Merit: 20
the right steps towerds the goal
Doesn't work. The 30 series problem is code related, not a PTX compile issue.

I will receive my first 30 series card in a week or so. Will fix then.

Bitcrack sp-mod #5 (https://github.com/sp-hash)


[2021-03-30.14:27:51] [Info] Compression: compressed
[2021-03-30.14:27:51] [Info] Starting at: 000000000000000000000000000000000000000000000000800000000AE55034
[2021-03-30.14:27:51] [Info] Ending at:   000000000000000000000000000000000000000000000000FFFFFFFFFFFFFFFF
[2021-03-30.14:27:51] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000010000000
[2021-03-30.14:27:51] [Info] Initializing GeForce RTX 3060 Ti
[2021-03-30.14:27:54] [Info] Generating 33,554,432 starting points (1280.0MB)
[2021-03-30.14:27:58] [Info] 10.0%
[2021-03-30.14:27:58] [Info] 20.0%
[2021-03-30.14:27:58] [Info] 30.0%
[2021-03-30.14:27:58] [Info] 40.0%
[2021-03-30.14:27:59] [Info] 50.0%
[2021-03-30.14:27:59] [Info] 60.0%
[2021-03-30.14:27:59] [Info] 70.0%
[2021-03-30.14:27:59] [Info] 80.0%
[2021-03-30.14:27:59] [Info] 90.0%
[2021-03-30.14:27:59] [Info] 100.0%
[2021-03-30.14:27:59] [Info] Done
[2021-03-30.14:27:59] [Info] Error: misaligned address
Execution time = 8 seconds

Same Problem

Can you make these improvements for ClBitcrack including --random ?
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
OK,
I would like to search vanity with keyspace.
VanitySearch search to full key 256 bit and VanitySearch  can not control keyspace search
bitCrack can search by options keyspace

How can use VanitySearch for search Vanity by limited keyspace search?


Why would you want to do that? By reducing the keyspace, you are making it harder for it to find a vanity address since there are now less possible addresses that are in that keyspace.
member
Activity: 406
Merit: 47

Hi,

How can I modify bitcrack  (CLbitCrack.exe) to search vanity?

https://github.com/Telariust/VanitySearch-bitcrack/releases/tag/1.15.4

You DON'T.

You use this program if you want to search for vanity:

https://github.com/JeanLucPons/VanitySearch

OK,
I would like to search vanity with keyspace.
VanitySearch search to full key 256 bit and VanitySearch  can not control keyspace search
bitCrack can search by options keyspace

How can use VanitySearch for search Vanity by limited keyspace search?
Pages:
Jump to: