BitCrack - A tool for brute-forcing private keys

[albert0bsd]

This is good idea I think, but real hard.

It is what the BSGS algorithm internally do.

[COBRAS]

This is good idea I think, but real hard.

It is what the BSGS algorithm internally do.

Thanks boss, I will try this. Yes, then B > A, so range in positive this good thing, and C = B - A, I think mast be < B too

[fxsniper]

Did I understand correct?
before puzzle 120 address. it is one of 119 bit address and then next bit double or add will be puzzle 120 address right?

[kknd]

GeForce RTX 3060 Laptop GPU


cuBitCrack.exe

-b 64 -t 512 -p 1024
564.09 MKey/s [00:00:32]

-b 96 -t 128 -p 1024
605.41 MKey/s [00:00:30]

-b 128 -t 256 -p 1024
666.64 MKey/s [00:00:27]

-b 82 -t 256 -p 2096
704.18 MKey/s [00:00:25]

clBitCrack.exe

-b 128 -t 256 -p 1024
613.69 MKey/s [00:00:29]

-b 128 -t 256 -p 756
609.83 MKey/s [00:00:29]

-b 128 -t 256 -p 1024
618.68 MKey/s [00:00:29]

-b 82 -t 256 -p 2096
620.38 MKey/s [00:00:29]

[coolindark]

qq= Which version of Cubitcrack are you using for 3xxx Nvidia?

GeForce RTX 3060 Laptop GPU


cuBitCrack.exe

-b 64 -t 512 -p 1024
564.09 MKey/s [00:00:32]

-b 96 -t 128 -p 1024
605.41 MKey/s [00:00:30]

-b 128 -t 256 -p 1024
666.64 MKey/s [00:00:27]

-b 82 -t 256 -p 2096
704.18 MKey/s [00:00:25]

clBitCrack.exe

-b 128 -t 256 -p 1024
613.69 MKey/s [00:00:29]

-b 128 -t 256 -p 756
609.83 MKey/s [00:00:29]

-b 128 -t 256 -p 1024
618.68 MKey/s [00:00:29]

-b 82 -t 256 -p 2096
620.38 MKey/s [00:00:29]

[PawGo]

GeForce RTX 3060 Laptop GPU


cuBitCrack.exe

-b 82 -t 256 -p 2096
704.18 MKey/s [00:00:25]

Do you mean build-in card or eGPU?

I have eGPU RTX 3060 and with these settings I have 800Mkey in peak, stable 780-790:


I use https://github.com/PawelGorny/BitCrack-3000 (forked from NotATether)

[NotATether]

Do you mean build-in card or eGPU?

I have eGPU RTX 3060 and with these settings I have 800Mkey in peak, stable 780-790:

I use https://github.com/PawelGorny/BitCrack-3000 (forked from NotATether)

On a related note: I'm assuming that my "workaround" for misaligned address bug on 2xxx and 3xxx series cards is working for you? (I never had thes cards, so I couldn't check myself). I'm assuming it's working for you because you published speed specs, but I just want to make sure it doesn't crash mid-computation.

[PawGo]

Do you mean build-in card or eGPU?

I have eGPU RTX 3060 and with these settings I have 800Mkey in peak, stable 780-790:

I use https://github.com/PawelGorny/BitCrack-3000 (forked from NotATether)

On a related note: I'm assuming that my "workaround" for misaligned address bug on 2xxx and 3xxx series cards is working for you? (I never had thes cards, so I couldn't check myself). I'm assuming it's working for you because you published speed specs, but I just want to make sure it doesn't crash mid-computation.

Honestly speaking I did not launch very long computations, so I cannot say if it crashes after one or seven hours, but for a few minutes it works smoothly
I think I just wanted to have a ready solution to be build with newer cuda and for the higher ccap.

[WanderingPhilospher]

Do you mean build-in card or eGPU?

I have eGPU RTX 3060 and with these settings I have 800Mkey in peak, stable 780-790:

I use https://github.com/PawelGorny/BitCrack-3000 (forked from NotATether)

On a related note: I'm assuming that my "workaround" for misaligned address bug on 2xxx and 3xxx series cards is working for you? (I never had thes cards, so I couldn't check myself). I'm assuming it's working for you because you published speed specs, but I just want to make sure it doesn't crash mid-computation.

Honestly speaking I did not launch very long computations, so I cannot say if it crashes after one or seven hours, but for a few minutes it works smoothly
I think I just wanted to have a ready solution to be build with newer cuda and for the higher ccap.

Honest question, why are people still using bitcrack with rtx 30xx or 20xx cards? Performance is "horrible" compared to software that does same thing...unless it's for the "stride" function, which is hit and miss if searching for an actual private key.

[PawGo]

Do you mean build-in card or eGPU?

I have eGPU RTX 3060 and with these settings I have 800Mkey in peak, stable 780-790:

I use https://github.com/PawelGorny/BitCrack-3000 (forked from NotATether)

On a related note: I'm assuming that my "workaround" for misaligned address bug on 2xxx and 3xxx series cards is working for you? (I never had thes cards, so I couldn't check myself). I'm assuming it's working for you because you published speed specs, but I just want to make sure it doesn't crash mid-computation.

Honestly speaking I did not launch very long computations, so I cannot say if it crashes after one or seven hours, but for a few minutes it works smoothly
I think I just wanted to have a ready solution to be build with newer cuda and for the higher ccap.

Honest question, why are people still using bitcrack with rtx 30xx or 20xx cards? Performance is "horrible" compared to software that does same thing...unless it's for the "stride" function, which is hit and miss if searching for an actual private key.

Which software you talk about? Is there any other reliable "sequential key checker"?
Talking about stride - of course some people used it as a "random shortcut" and it is stupid, I agree. But for a long time it was also the fastest tool for WIF solving with characters missing at the beginning. Times they are a-changin', that's right, now we have WifSolverCuda and that other tool which is told to be faster than BitCrack, but still it is a good piece of software.

[WanderingPhilospher]

Do you mean build-in card or eGPU?

I have eGPU RTX 3060 and with these settings I have 800Mkey in peak, stable 780-790:

I use https://github.com/PawelGorny/BitCrack-3000 (forked from NotATether)

On a related note: I'm assuming that my "workaround" for misaligned address bug on 2xxx and 3xxx series cards is working for you? (I never had thes cards, so I couldn't check myself). I'm assuming it's working for you because you published speed specs, but I just want to make sure it doesn't crash mid-computation.

Honestly speaking I did not launch very long computations, so I cannot say if it crashes after one or seven hours, but for a few minutes it works smoothly
I think I just wanted to have a ready solution to be build with newer cuda and for the higher ccap.

Honest question, why are people still using bitcrack with rtx 30xx or 20xx cards? Performance is "horrible" compared to software that does same thing...unless it's for the "stride" function, which is hit and miss if searching for an actual private key.

Which software you talk about? Is there any other reliable "sequential key checker"?
Talking about stride - of course some people used it as a "random shortcut" and it is stupid, I agree. But for a long time it was also the fastest tool for WIF solving with characters missing at the beginning. Times they are a-changin', that's right, now we have WifSolverCuda and that other tool which is told to be faster than BitCrack, but still it is a good piece of software.

Is it sequential? I thought it spread out the threads according to -b - t- -p numbers...I am sure it does spread out, then check sequentially. The other software is the modified vanity search and keyhunt.
Any who, I was just wandering...lol, it's been forever since I quit using bitcrack due to the errors and drivers (I would have to roll back drivers to use it). Biggest advantage to bitcrack was it allowed the use of amd cards, but even that was buggy. Bitcrack developer is a great programmer; he has made some impressive tools to pool resources for brute force and kangaroo. I would still love to get Brichard's source code for his kangaroo program!

[NotATether]

Is it sequential? I thought it spread out the threads according to -b - t- -p numbers...I am sure it does spread out, then check sequentially. The other software is the modified vanity search and keyhunt.
Any who, I was just wandering...lol, it's been forever since I quit using bitcrack due to the errors and drivers (I would have to roll back drivers to use it). Biggest advantage to bitcrack was it allowed the use of amd cards, but even that was buggy. Bitcrack developer is a great programmer; he has made some impressive tools to pool resources for brute force and kangaroo. I would still love to get Brichard's source code for his kangaroo program!

That is exactly the operation of bitcrack, yes. There were mods by pika to introduce a genuine random search option but they don't really speed up anything - as far as finding the correct bits is concerned, its just as chaotic as searching them sequentially (chaos theory in action).

[PawGo]

Which software you talk about? Is there any other reliable "sequential key checker"?

Is it sequential? I thought it spread out the threads according to -b - t- -p numbers...I am sure it does spread out, then check sequentially. The other software is the modified vanity search and keyhunt.

You talk about technical implementation, I was talking about the way how it works. Of course if you have 2 threads, work must be somehow divided, but the idea is to check each key from A to B. Then there is stride, where you do not check "each" key, but still you decide which ones should be tested. I bet you see the difference comparing for example to Kangaroo, where tests are random (where BTW I have also implemented stride, for WIF solving).
Using "stride" or "random" mode as a shortcut to finding a key is just a playing a lottery.
I did not check yet VanBitCracken, but as I briefly see it is not a piece of brand new software, just a modified/patched version of old programs. Hard to say as there are no sources.

[WanderingPhilospher]

Which software you talk about? Is there any other reliable "sequential key checker"?

Is it sequential? I thought it spread out the threads according to -b - t- -p numbers...I am sure it does spread out, then check sequentially. The other software is the modified vanity search and keyhunt.

You talk about technical implementation, I was talking about the way how it works. Of course if you have 2 threads, work must be somehow divided, but the idea is to check each key from A to B. Then there is stride, where you do not check "each" key, but still you decide which ones should be tested. I bet you see the difference comparing for example to Kangaroo, where tests are random (where BTW I have also implemented stride, for WIF solving).
Using "stride" or "random" mode as a shortcut to finding a key is just a playing a lottery.
I did not check yet VanBitCracken, but as I briefly see it is not a piece of brand new software, just a modified/patched version of old programs. Hard to say as there are no sources.

I was not referring to VanBitCracken, it is "outdated"; I was talking about new mods for VS and KeyHunt cuda; both many times faster than bitcrack. That is all.

As you know, Kangaroo starting points are random but once they start, they are no longer random.

Pawgo, you know we have talked in the past and I have tested your programs and posted results; I honestly do not know how the kangaroo stride version could help speed up search time or how to really implement it to work better than original kangaroo, as far as time finding key.

[PawGo]

Pawgo, you know we have talked in the past and I have tested your programs and posted results; I honestly do not know how the kangaroo stride version could help speed up search time or how to really implement it to work better than original kangaroo, as far as time finding key.

Kangaroo with stride is not for puzzles or other search, but for solving WIFs with missing beginning, you tested that: https://bitcointalk.org/index.php?topic=5315607.msg56300590#msg56300590
This is the situation where you know that answer is in the range A - B, but you do not test each key - stride is equal 58^x, where x depends on position of missing character.
It works, it solves given problem - but noone (at least not me) stated that it is somehow better or faster than original one. It is just an add-on.

[fxsniper]

Can any body help to create tools brute-forcing by using GPU NVidia from random Public ECDSA Key to RIPEMD-160 Hash and vanity search
RIPEMD-160 Hash
just test random idea to brute-forcing puzzle 64 and use kangaroo solve it ( I know it is not work, but would be test to know it sure to not work)

[WanderingPhilospher]

Pawgo, you know we have talked in the past and I have tested your programs and posted results; I honestly do not know how the kangaroo stride version could help speed up search time or how to really implement it to work better than original kangaroo, as far as time finding key.

Kangaroo with stride is not for puzzles or other search, but for solving WIFs with missing beginning, you tested that: https://bitcointalk.org/index.php?topic=5315607.msg56300590#msg56300590
This is the situation where you know that answer is in the range A - B, but you do not test each key - stride is equal 58^x, where x depends on position of missing character.
It works, it solves given problem - but noone (at least not me) stated that it is somehow better or faster than original one. It is just an add-on.

Gotcha, I was referring to your comment:

When we talk about pure private key solving, it works well. Which means you my try puzzle #120 with a custom stride if you do not want to wait to long and believe in yours luck

I remember thinking on how or what parameters one would use. But it's like you said, it's just a lottery...

[WanderingPhilospher]

Can any body help to create tools brute-forcing by using GPU NVidia from random Public ECDSA Key to RIPEMD-160 Hash and vanity search
RIPEMD-160 Hash
just test random idea to brute-forcing puzzle 64 and use kangaroo solve it ( I know it is not work, but would be test to know it sure to not work)

You want a program to randomly create a public key and then search for it's corresponding H160?

[fxsniper]

You want a program to randomly create a public key and then search for it's corresponding H160?

Yes, please
maybe puzzle 64-100 without pubkey can be useful to solve

free stye to code as you want or easy to code (with GPU)

problem with full calculate like bitcrack it is calculated puzzle#64 from first bit to bit 64  (or any bit 356) it uses to may loop over 200 to calculate double and add multiply, made it slow to brute-forcing

maybe someone can use this too found it (dot point trillion one percent possible)

my idea try to calculate sort can possible
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search

I am not sure I write step correct or not

With GPU calculate How many pubkey scans can do per minute?

option may be up to you code begins with easy first for open testing and then modify to option later
option
1. absolute random
2. random in the range
3. run number X (+1 next like bitcrack)

for check match RIPEMD-160 search
1. full match with "3EE4133D991F52FDF6A25C9834E0745AC74248A4"
2. vanity math like  "3EE4133D991F5"   (from 3EE4133D991F52FDF6A25C9834E0745AC74248A4)

[WanderingPhilospher]

my idea try to calculate sort can possible
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search

So you want:

random privkey
calculate pubkey from random privkey
sha
and then RIPEMD160

Correct?

There are programs out there that search for H160 already. The problem becomes the "pure" randomness.

I know albertobsd's keyhunt program will allow you to load a H160 to search for and it has the random (CPU cores are better/faster with the "absolute" randomness) option.

Programs like vanitysearch and bitcrack, take the inputted address and convert it to H160 and that's what it searches for, but it's hard to do a true (absolute as you call it), check one random key and then jump to another random key with a GPU; most programs will/can put a GPU thread on a random point but it normally checks thousands or millions of consecutive keys before rekeying or re-randomizing the GPU threads.