BitCrack - A tool for brute-forcing private keys

[fxsniper]

2. What is the simple mathematical problem? Finding private key if someone reuse k value?

What is that? Is it similar to this: https://allprivatekeys.com/random-vulnerability

Exactly same with link you share. Here's similar topic which mention k value, https://bitcoin.stackexchange.com/q/35848

Then don't worry. Last month I've checked all of bitcoin addresses for this and found like 1000 addresses with this vulnerability and only 3 with balances. All 3 <500 sats. So, you won't find anything new...

I know, it's just problem with the implementation, not the cryptography itself.

a lot of people know how to from this article already 9a lot of people copy article it can found on google search multiple blog)

check sample transaction have r s z value, all zero balance already

Unfortunately all address list on puzzle can not find z value or have only 1 z value, not enough to useful
still very hard to calculate with that method

however good article and knowledge

[nioctib.co]

I was thinking the same thing however, my Vega 7s get no where close to that speed nor my 1660Tis. Who knows...

Yeah, his speed is like 4 times the speed my 3080s do and afaik these do top-speed atm on opencl version.
But I mean, AMD & openCL do work better together. But THIS good? 

I guess ROG Zephyrus G14 he had mentioned with 1660 Tis is GA401l-U, which also using Vega 7 except GA401l-V with 2060 is Vega 8. But 5900++ mkey/sec are just insane number. Even clbitcrack 0.31 that couldn't find key will not show that kind of speed. Not sure what he shown were accurate speed. If it does, then really worth buying. I don't think AMD with openCL that good, I have both Nvidia and AMD card, pretty sure that cubitcrack outperform clbitcrack even with lower performance Nvidia card.

[nioctib.co]

I was thinking the same thing however, my Vega 7s get no where close to that speed nor my 1660Tis. Who knows...

Yeah, his speed is like 4 times the speed my 3080s do and afaik these do top-speed atm on opencl version.
But I mean, AMD & openCL do work better together. But THIS good?  

I guess ROG Zephyrus G14 he had mentioned with 1660 Tis is GA401l-U, which also using Vega 7 except GA401l-V with 2060 is Vega 8. But 5900++ mkey/sec are just insane number. Even clbitcrack 0.31 that couldn't find key will not show that kind of speed. Not sure what he shown were accurate speed. If it does, then really worth buying. I don't think AMD with openCL that good, I have both Nvidia and AMD card, pretty sure that cubitcrack outperform clbitcrack even with lower performance Nvidia card.

Anyone have the same laptop to test it out? I am considering to buy a new laptop, so if the speed he shown were accurate, then I can consider to buy it. From what I know on clbitcrack 0.31, the speed were accurate as 0.30 but it can't find keys, especially if you use --continue flag, it will shows you different keyspace that has completed way ahead from where you stop. I did the math according to his search time since he didn't stop at all, indeed it was 5900++ Mkey/sec and not faulty keyspace meter.

[willi9974]

is it possible to run the software with a AMD card? Or exist a kind if this software that is working with ADM driver / cards?

[WanderingPhilospher]

is it possible to run the software with a AMD card? Or exist a kind if this software that is working with ADM driver / cards?

You'd have to run it with the clBitcrack (versus the cuBitcrack) but I have seen mixed reviews on it's ability to find key; I know the latest release (31, I think, doesn't seem to work with clBitcrack; I would try one version down from the latest one, and try to find a key in a small range first, to make sure it works.

[nioctib.co]

is it possible to run the software with a AMD card? Or exist a kind if this software that is working with ADM driver / cards?

You'd have to run it with the clBitcrack (versus the cuBitcrack) but I have seen mixed reviews on it's ability to find key; I know the latest release (31, I think, doesn't seem to work with clBitcrack; I would try one version down from the latest one, and try to find a key in a small range first, to make sure it works.

I tried and it works perfect on 0.30 clbitcrack, but not on 0.31. 0.31 only can find the first couple puzzle keys. I have tested both 63 and 62, it will miss the private key with Reached End of Keyspace.

[fxsniper]

Can I compile bitcrack use on visual studio 2019 community edition?

what module on visual studio 2019 need to be install

just world like to try compiled bitrack new one on windows 10

[WanderingPhilospher]

Can I compile bitcrack use on visual studio 2019 community edition?

what module on visual studio 2019 need to be install

just world like to try compiled bitrack new one on windows 10

Yes, that is the Visual Studio I use and I have compiled bitcrack using it. You may have to change the CUDA props in the .vcxproj file; I can't remember but if you get an error stating it can only be compiled with an older version of VS, then change the props to say 10.2; I know that one works.  
There will be two lines that you need to change the CUDA props, example looks like this:

Code:

Import Project="$(VCTargetsPath)\BuildCustomizations\CUDA 10.2.targets"

With that said, you will have to download the applicable CUDA, i.e. 10.2, 10.1, 11.0, etc. for whichever CUDA you decide to compile with.

[fxsniper]

Done bitcrack do brute-forcing with use algorithm like this


https://www.educba.com/brute-force-algorithm/
http://www.people.vcu.edu/~gasmerom/MAT131/brutefrc.html
https://www.chegg.com/homework-help/use-brute-force-method-find-optimal-solution-complete-weight-chapter-14.3-problem-4cp-solution-9780321867322-exc
https://www.quora.com/What-is-a-brute-force-algorithm-with-an-example
https://www.youtube.com/watch?v=xRVpT-7c0Rw

[fxsniper]

I am not programmer

hope so someone forked bitcrack to have more option or upgrade to next generation bitcrack


now bitcrack is do brute force straight directly by random

I think bitcrack random private key first and convert to address and check meet target or not right?
(may be random hex 64 digits)

What version think may be better?

bitcrack private keys with random split key space to small under limited size 2^41 to small
like from large areal split to small area and scan one by one or random area and finish one by one may be each area use time 1 hour each (or max 5 hour)

bitcrack private keys with use Pollard's kangaroo calculate and jump number on key space
may be can like kangaroo curve and move
may be just use some part but not use wild tame meet

bitcrack private keys with use Baby Step Giant Step calculate and move step number on key space

bitcrack private keys with use pub key convert to x y and use it multiply to on key space

bitcrack private keys with use formula like  K((z1*s2 - z2*s1)/(r*(s1-s2))) or other formula and scan around

not yet think about on detail and how can possible to do, just think an idea only.
just think about how can upgrade bitcrack to better

may be need to make it split to new one program not incudes with standard version

high bits is area that very large too much it is need to calculate key space before search


other idea
if not modify bitcrack direcly
make some program algorithm or strategy search to call bitcrack to work (may be make it slow works use two program work)
but bitcrack build-in system may be work faster than
or put new algorithm to bitcrack require to modify

[NotATether]

Done bitcrack do brute-forcing with use algorithm like this

~

The brute forcing here is just incrementing the private key and using ECC to turn it into a public key and then a SHA256 hash.

I think bitcrack random private key first and convert to address and check meet target or not right?
(may be random hex 64 digits)

It really depends on the RNG, I think searching linearly sucks because nobody's going to have a private key that's between 0 and say 2^200 and this is the range being searched first which is a gigantic waste of time, of course you can use the keyspace option to exclude that range but then you have 2^200 more ranges of numbers in different places in he middle that can't be excluded like that.

Random is the best way to get keys, seeded with the current time and some other stuff at least. It does not have to be cryptographically secure. It needs to be a fast pseudo-random generator because it will be called on each iteration (or caches every 1,000,000 random numbers)

bitcrack private keys with use Pollard's kangaroo calculate and jump number on key space
may be can like kangaroo curve and move
may be just use some part but not use wild tame meet

bitcrack private keys with use Baby Step Giant Step calculate and move step number on key space

I am wary of using Pollard's Kangaroo here because the point of this program is to find private keys in the entire range and not a closed range. Pollard's Rho is like Kangaroo but it does search the whole range (and is faster than BSGS but obviously slower than Kangaroo).

bitcrack private keys with use pub key convert to x y and use it multiply to on key space

This is pretty much what it does already.

bitcrack private keys with use formula like  K((z1*s2 - z2*s1)/(r*(s1-s2))) or other formula and scan around

There are some signatures with reused r-values so that could be taken into account to make some kind of equation (or at least an approximation) for the private key that also searches keys around it.

We also already have equations that find a private key that is related to another by mK+n, I am certain there is one for higher orders too but I haven't had time to find them.

[COBRAS]

Done bitcrack do brute-forcing with use algorithm like this

~

The brute forcing here is just incrementing the private key and using ECC to turn it into a public key and then a SHA256 hash.

I think bitcrack random private key first and convert to address and check meet target or not right?
(may be random hex 64 digits)

It really depends on the RNG, I think searching linearly sucks because nobody's going to have a private key that's between 0 and say 2^200 and this is the range being searched first which is a gigantic waste of time, of course you can use the keyspace option to exclude that range but then you have 2^200 more ranges of numbers in different places in he middle that can't be excluded like that.

Random is the best way to get keys, seeded with the current time and some other stuff at least. It does not have to be cryptographically secure. It needs to be a fast pseudo-random generator because it will be called on each iteration (or caches every 1,000,000 random numbers)

bitcrack private keys with use Pollard's kangaroo calculate and jump number on key space
may be can like kangaroo curve and move
may be just use some part but not use wild tame meet

bitcrack private keys with use Baby Step Giant Step calculate and move step number on key space

I am wary of using Pollard's Kangaroo here because the point of this program is to find private keys in the entire range and not a closed range. Pollard's Rho is like Kangaroo but it does search the whole range (and is faster than BSGS but obviously slower than Kangaroo).

bitcrack private keys with use pub key convert to x y and use it multiply to on key space

This is pretty much what it does already.

bitcrack private keys with use formula like  K((z1*s2 - z2*s1)/(r*(s1-s2))) or other formula and scan around

There are some signatures with reused r-values so that could be taken into account to make some kind of equation (or at least an approximation) for the private key that also searches keys around it.

We also already have equations that find a private key that is related to another by mK+n, I am certain there is one for higher orders too but I haven't had time to find them.

K((z1*s2 - z2*s1)/(r*(s1-s2)))

Hi. Sach formulas work especialy with vulnerable sighnatures  for ex with nonce<p, etc... not so easy this method too..

[fxsniper]

K((z1*s2 - z2*s1)/(r*(s1-s2)))

Hi. Sach formulas work especialy with vulnerable sighnatures  for ex with nonce<p, etc... not so easy this method too..

right this formula very hard to use I see a lot of talk with this formula  on this forum still not success to use

[WanderingPhilospher]

K((z1*s2 - z2*s1)/(r*(s1-s2)))

Hi. Sach formulas work especialy with vulnerable sighnatures  for ex with nonce<p, etc... not so easy this method too..

right this formula very hard to use I see a lot of talk with this formula  on this forum still not success to use

Cobras struggles with the formula, many people do. The fact is, their are bots monitoring for these types of things and the funds will be snatched up immediately if a vulnerable signature is found.

[eye3raj]

I am looking for random version, so every key is is generated random, is there any version.

@escobol told me off-forum that he had someone make such a version for him so you might want to PM him for access to that.

How do I contact him facebook, twitter, telegram

[WanderingPhilospher]

I am looking for random version, so every key is is generated random, is there any version.

@escobol told me off-forum that he had someone make such a version for him so you might want to PM him for access to that.

How do I contact him facebook, twitter, telegram

Go to messages. Select New Messages, Select Find Members. Enter escobol. Select his name when it pops up. Or enter "escobol" into To block.

[NotATether]

I am looking for random version, so every key is is generated random, is there any version.

@escobol told me off-forum that he had someone make such a version for him so you might want to PM him for access to that.

How do I contact him facebook, twitter, telegram

Go to messages. Select New Messages, Select Find Members. Enter escobol. Select his name when it pops up. Or enter "escobol" into To block.

Wait - sorry, I got names mixed up   it was elisacat who told me that he has the program, not escobol, and it was on Telegram - I never even talked to escobol on TG.

I may have a copy of it myself, but I have to search my chats for it (it's a python script wrapper around Bitcrack).

EDIT: yeah, it's not in my chats  

[escobol]

I am looking for random version, so every key is is generated random, is there any version.

@escobol told me off-forum that he had someone make such a version for him so you might want to PM him for access to that.

How do I contact him facebook, twitter, telegram

Go to messages. Select New Messages, Select Find Members. Enter escobol. Select his name when it pops up. Or enter "escobol" into To block.

Wait - sorry, I got names mixed up   it was elisacat who told me that he has the program, not escobol, and it was on Telegram - I never even talked to escobol on TG.

I may have a copy of it myself, but I have to search my chats for it (it's a python script wrapper around Bitcrack).

Yes, not me.

BTW
„This code also incorporates the popular but now removed pikachunakapika fork containing random mode along with the other tweaks.”
https://github.com/djarumlights/BitCrack

[eye3raj]

I am looking for random version, so every key is is generated random, is there any version.

@escobol told me off-forum that he had someone make such a version for him so you might want to PM him for access to that.

How do I contact him facebook, twitter, telegram

Go to messages. Select New Messages, Select Find Members. Enter escobol. Select his name when it pops up. Or enter "escobol" into To block.

Wait - sorry, I got names mixed up   it was elisacat who told me that he has the program, not escobol, and it was on Telegram - I never even talked to escobol on TG.

I may have a copy of it myself, but I have to search my chats for it (it's a python script wrapper around Bitcrack).

Yes, not me.

BTW
„This code also incorporates the popular but now removed pikachunakapika fork containing random mode along with the other tweaks.”
https://github.com/djarumlights/BitCrack

I am looking for random version so every key is random , pikachunakapika only give random point

[BHWallet]

Normally Bitcrack finds all the keys, it never skips any, but --stride option is not working for me. I put 20 keys randomly where there should be a collision, bitcrack finds the first ones but as it goes through the whole range it skips keys.
Also it finishes the scan way too fast, so I know it doesn't scan the whole range as instructed.


Example:
clBitCrack.exe -i addresses.txt -o keys.txt  --stride 4C4B40 --keyspace 0000000000000000000000000000000000000000000000008000000000000000:0000000000000000000000000000000000000000000000010000000000000000

Stride is 5mil and range is 2**63 - 2**64

What am I doing wrong?