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

An earlier post states that 17 of the 24 words were revealed, so only 6 words need to be brute forced.

If the positions of the revealed words are known then you could recover up to 187 bits of the 256 bit key, and instead you would brute force the unknown bits.

2 trillion keys per second?

Okay, so which state funded supercomputer shall we use to embarrass this guy?

If it's a 2048 word list, then 6 words is 2048^6 = 2^66 possible combinations. Not impossible. That is just over 1 year at 2 trillion keys per second.

How hard would it be to be able to brute force find a private key from a seed phrase given some number of words?

I was on twitter recently and Jameson Lopp inadvertently revealed 17 of 24 words of a seed phrase by posting a picture of the back of his recovery phrases which he was burning.

https://twitter.com/mechanikalk/status/1062388232804069376

It is likely possible to intuit some information for the remaining 6 words that would drastically decrease the space. Jameson has stated that this is a 3 of 5 seed, so if that is true the money behind the account is safe.  However, finding the address would potentially dox Jameson's account which could be interesting.

This is a bug in CUDA. It doesn't know what the latest version of Visual Studio is. Edit /9.2/include/crc/host_config.h so that the header matches your Visual Studio version. e.g.:

Code:

#if _MSC_VER < 1600 || _MSC_VER > 1911

becomes:

Code:

#if _MSC_VER < 1600 || _MSC_VER > 1915

those vanity addresses are most likely burn addresses
such addresses can be generated without knowing their private keys
to proof my point, I just created these using a tool 
1Va1idAddressesCanBeCreatedupoTas
1WithoutKnowingPrivateKeyst2H8dDk

Has anyone tried to build this on Linux?

I have CUDA devices, and looked at the Makefile.  CUDA 9.2.  Installed that, but I'm not getting anything.  No errors, just no binaries.  The libraries seem to get built.  By default they go in CUR_DIR/bin CUR_DIR/lib.

Does anyone know what I can do to try and build the project on Linux?  As far as I know, there shouldn't be any real issues with differing CUDA versions 8 to 9.2.

Thanks,  looks interesting.  Nice rewards for trying the puzzles.  I wonder if there's a better method than just brute-forcing more and more?  Unless there is no point; they're just there to be claimed later as a measurement of compute power over the years and how quickly the BTC gets moved.  In that sense, not a real puzzle.  Just, how long until this gets cracked?

Interestingly, larger amounts have been claimed.  Ones in the middle not claimed yet.  Perhaps not worth the effort to figure out if there is a real method to the madness, or not enough reward for compute effort.

Thanks, if you've managed to compile on Ubuntu, and what did you have to tweak to get it working...

Nope, look at the other transactions from those addresses, all are to the vanity addresses, quite long vanity... Someone must be found really fast way to brute-force the BC PBKs.

I am not surprised the OP did a much better job than me with this What does surprise me is that the donation address is a 1x, I expected a Segwit address from such a sophisticated user. Or is it a case of his 1x address really being a Segwit or script of some kind, last year I remember researching you could translate a 3x to a 1x, but I cannot remember how

I am also not surprised  I cannot compile out of the box on my VS 2017, all kinds of errors. What does surprise me though is that some code in there, perhaps from the Cuda Toolkit, even tells me "this code will only work in VS 2010.... 2017", so it does not recognize my VS version, WTF!

this one is part of bitcoin puzzle
but the last recent three addresses looked like moved by the puzzle maker rather than cracked
1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa - (Spent) 0.055 BTC
17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi - (Spent) 0.056 BTC
15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz - (Spent) 0.057 BTC
fund on these three addresses moved to 1AqEgLuT4V2XL2yQ3cCzjMtu1mXtJLVvww

who hacked 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz

I didn't say that, I said that is simple to get the private keys for 10000000 addresses if you know one private key and if that addresses are related in some way. "Consecutive keys" are only an example.

he said his method of generation is "through certain numerical coordinates"
but he doesn't explain how he produced these numerical coordinates or its origin
his 10,000,000 addresses are not generated sequentially as you thought

This doesn't make any sense.
It is very simple to do what TrumenPack says, in this way:

1) I generate a random public key P1 (P1 is a point of secp256k1 curve)
    

2) Then I generate 10,000,000 consecutive public keys in this way:

    P2 = P1 + G
    P3 = P2 + G (= P1 + 2*G)
    P4 = P3 + G (= P1 + 3*G)
    ....
    P27589 = P1 + 27588*G
    ….
    P10000000 = P1 + 9999999*G

3) I get from each public key the address:

   address1 = hash160 (P1)
   address2 = hash160 (P2)
   address3 = hash160 (P3)
   ....
   address10000000 = hash160 (P10000000)


Let's say now that address27589 = "18HPzD22qaUvJL69yjF3vUXx7Kfg7o5q7F". If (it is a very big if) you find out that the private key is "100A" (hex format, try to put this value here --> http://gobittest.appspot.com/Address, i. e. private key = 1*2^12 +10 = 4106), then it would be very simple to get the private keys of all the other addresses*** too:


private key of address1 = (private key of address27589 - 27588)  mod n
.....
private key of address27588 = private key of address27589 - 1 = 4105
private key of address27589 = 4106
private key of address27590 = private key of address27589 + 1 = 4107
private key of address27591 = private key of address27589 + 2 = 4108
.....
private key of address10000000 = private key of address27589 + 9.972.411 = 9.976.517


***this is true only if you find the private key to the public key P27589. There are about 2^96 different valid private keys for the address27589!

Did you even read this thread ?

What you are trying is NOT POSSIBLE. You won't be able to achieve what you are trying.

I don't know how often you need to hear it until you finally accept it. It already has been mentioned in your thread.


Your only option would be to try out every single possible private key (2^256) and check whether it resolves to your address.
But since the number is way too high to just test a fraction of the keyspace, you should just give up.

Your 'scientific work' is crap.

Greetings to All! If there are people who can help me? My task is to use the “BitCrack” program to find one private key from 10,000,000 Bitcoin Addresses. This is my scientific work. I created a theme and described:
https://bitcointalksearch.org/topic/m.47651430

cudart32_80.dll is part of the CUDA toolkit. Do you have it installed?

If not, get it from nvidia.com (https://developer.nvidia.com/cuda-downloads?target_os=Windows)

Greetings to all !!! I had a problem with the launch ((when I ran the first time through the BitCrack.exe console I got an error:



As I understand it, the error was related to the video card. I updated my nvideo

 
I have Windows 10 / 32bit / I use NVIDEO GeForce GT 650M

The error did not disappear !!

Something very much confused! How to fix it?
Be kindly help please with the launch!

next to zero - still disturbing that seems to be the goal here  for some - I get for others it is just the puzzle part of it. but when I see people asking how to target specific high value keys...

Which is even worse!!! Do you know what the likelyhood is of getting 1 right out of 256 bit(well, slightly less than that) keys is?