BitCrack - A tool for brute-forcing private keys - page 97.

butka

full member

Activity: 434

Merit: 246

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions: https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

For all those (like me) wondering what the heck these puzzle transactions are, here is a link to an older tread trying to explain that:

https://bitcointalksearch.org/topic/bitcoin-puzzle-transaction-32-btc-prize-to-who-solves-it-1306983

Now at least you would have a clue what the OP is trying to achieve.

BitCrack

jr. member

Activity: 30

Merit: 122

Quote from: ?? on ??

Good project idea.

How to deploy this to 100 CUDA cards?

thanks

It doesn't have distributed processing right now but it's on the to-do list.

For now you'll need to run it for each GPU on each machine. It shouldn't be too difficult if you have SSH access to your machines.

MrCrank

sr. member

Activity: 1330

Merit: 258

This is good idea.
Do you think is it possible?
For this need many years.. or create worldwide GPU online pool

monkeydominicorobin

full member

Activity: 294

Merit: 104

✪ NEXCHANGE | BTC, LTC, ETH & DOGE ✪

Quote from: BitCrack on June 12, 2018, 08:56:38 PM

Quote from: arulbero on June 11, 2018, 02:50:10 AM

Other (more or less) similar projects :

https://bitcointalksearch.org/topic/large-bitcoin-collider-thread-20-1877935

https://bitcointalksearch.org/topic/faster-and-autonomous-large-bitcoin-collider-fork-3102823

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

Try with other software to have a comparison.

I'm not touching LBC, as the client source code is not available.

My machine is getting ~1 million keys per second with oclVanityGen. Not sure if it's not using my GPU or not picking optimal parameters.

Quote from: monkeydominicorobin on June 12, 2018, 08:12:58 PM

Assuming that you are successful. What is the use of cracking keys when you are not scanning for balances. This is just another BIP39 social engineering clone tool. Yes BIP39 is a cool improvement but don't use it to fool the non-programmers.

I imagine people would check the balance for an address before trying to crack it. But like I said, it's main purpose is for the puzzle addresses, which have balances.

It's not social engineering anything. It's simply a brute-force tool.

Once you try to get people involved in a crusade like yours. It is social engineering. Your asking them to use your tool which is wasting computing resources. How can you brute force something that has combinations that almost rivals the number of atoms in our universe which is sha256.

Coin-1

legendary

Activity: 2618

Merit: 2304

Quote from: BitCrack on June 12, 2018, 08:56:38 PM

My machine is getting ~1 million keys per second with oclVanityGen. Not sure if it's not using my GPU or not picking optimal parameters.

Yes, your program might be useful for creating a "beautiful" Bitcoin-addresses using VanityGen, but only for that.

Quote from: BitCrack on June 12, 2018, 08:56:38 PM

It's not social engineering anything. It's simply a brute-force tool.

Please don't waste your time and resources to brute force a Bitcoin private key. Let's calculate how much time you need to crack one Bitcoin-address on your machine.

You said that your performance is 9 million BTC-addresses per second, i.e. approximately 2²³ BTC-addresses per second. Thus the brute forcing will take 2^160-23 = 2¹³⁷ seconds! I guess it is more than septillion (10²⁴) years!

Note that this calculating is very approximate, because actually the private key length is 2²⁵⁶, but I think it is enough to stop making an attempts to crack Bitcoin-addresses.

BitCrack

jr. member

Activity: 30

Merit: 122

Quote from: arulbero on June 11, 2018, 02:50:10 AM

Other (more or less) similar projects :

https://bitcointalksearch.org/topic/large-bitcoin-collider-thread-20-1877935

https://bitcointalksearch.org/topic/faster-and-autonomous-large-bitcoin-collider-fork-3102823

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

Try with other software to have a comparison.

I'm not touching LBC, as the client source code is not available.

My machine is getting ~1 million keys per second with oclVanityGen. Not sure if it's not using my GPU or not picking optimal parameters.

Quote from: monkeydominicorobin on June 12, 2018, 08:12:58 PM

Assuming that you are successful. What is the use of cracking keys when you are not scanning for balances. This is just another BIP39 social engineering clone tool. Yes BIP39 is a cool improvement but don't use it to fool the non-programmers.

I imagine people would check the balance for an address before trying to crack it. But like I said, it's main purpose is for the puzzle addresses, which have balances.

It's not social engineering anything. It's simply a brute-force tool.

monkeydominicorobin

full member

Activity: 294

Merit: 104

✪ NEXCHANGE | BTC, LTC, ETH & DOGE ✪

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

Hi all,

I've been working on a tool for brute-forcing Bitcoin private keys. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions: https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

Screenshot:

It is open-source under the MIT licence and requires no external dependencies other than the CUDA toolkit. It builds on Windows using Visual Studio 2015, and Linux using Make (you might have to edit the Makefile and point it towards your CUDA toolkit directory).

It can search for compressed/uncompressed keys or both.

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

Note:
-Currently it is CUDA only.
-It can only search one target key at a time

Features I would like to add if there is enough interest for the project:

-Support for searching multiple target keys at one time
-OpenCL/AMD device support
-CPU with AVX/AVX2/SHA support
-Checkpoints/Stop and resume
-Vanity address generation

Source and Win32/Win64 binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases/tag/v0.0.6

Thoughts?

Thanks!

Assuming that you are successful. What is the use of cracking keys when you are not scanning for balances. This is just another BIP39 social engineering clone tool. Yes BIP39 is a cool improvement but don't use it to fool the non-programmers.

Thirdspace

hero member

Activity: 1232

Merit: 738

Mixing reinvented for your privacy | chipmixer.com

Quote from: arulbero on June 11, 2018, 04:01:08 AM

LBC will search any key in sub-55 bit space, its main goal is not related to the puzzle transaction.

on stats page, they put up a notice "Time to hit #55 of the puzzle transaction (1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa)"
so I thought they're aiming for those addresses listed in that puzzle transaction
https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

@OP can your program work collectively in a pool?
running it individually without any means of cooperative works would be somewhat useless and waste of resources

arulbero

legendary

Activity: 1932

Merit: 2077

Quote from: Thirdspace on June 11, 2018, 03:19:19 AM

I just noticed 1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa has just been found recently! on May 29th
However LBC site still show the task for finding its key Huh

Did someone else find it? or was LBC site just slow on updating its stats page?

LBC will search any key in sub-55 bit space, its main goal is not related to the puzzle transaction.

Gerci

member

Activity: 87

Merit: 10

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

Hi all,

I've been working on a tool for brute-forcing Bitcoin private keys. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions: https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

Screenshot:

It is open-source under the MIT licence and requires no external dependencies other than the CUDA toolkit. It builds on Windows using Visual Studio 2015, and Linux using Make (you might have to edit the Makefile and point it towards your CUDA toolkit directory).

It can search for compressed/uncompressed keys or both.

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

Note:
-Currently it is CUDA only.
-It can only search one target key at a time

Features I would like to add if there is enough interest for the project:

-Support for searching multiple target keys at one time
-OpenCL/AMD device support
-CPU with AVX/AVX2/SHA support
-Checkpoints/Stop and resume
-Vanity address generation

Source and Win32/Win64 binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases/tag/v0.0.6

Thoughts?

Thanks!

A set of tools for Bitcoin private keys that destroy. Currently the project requires a CUDA GPU. The main purpose of this project is to contribute to solving Bitcoin puzzle transactions: A transaction with 32 addresses becomes increasingly difficult to solve.

Currently this project is only CUDA, but I would like to bring it to another architecture if there is enough interest in the project.

Thirdspace

hero member

Activity: 1232

Merit: 738

Mixing reinvented for your privacy | chipmixer.com

Quote from: arulbero on June 11, 2018, 02:50:10 AM

https://bitcointalksearch.org/topic/large-bitcoin-collider-thread-20-1877935

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

I've been working on a tool for brute-forcing Bitcoin private keys. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions:

that's the main group effort for this btc puzzle, however the program is closed-source (cmiiw) Sad

OP is trying to do the same effort, but without collective efforts this will be redundant

Quote from: HCP on June 10, 2018, 11:15:31 PM

The Bitcoin puzzle transactions were setup as an exercise to see how tough it is bruteforce BTC... and is essentially what the LBC is attempting to cash in on (aside from other "collateral damage" of people with weak keys).

What is interesting is that the addresses in the middle range of amounts (0.056 to 0.16 BTC), which were theoretically "easier" than the addresses with the larger amounts, have not yet been "cracked"??!?

I think the higher amounts that already spent was not 'cracked' but moved by the creator
and I just noticed 1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa has just been found recently! on May 29th
However LBC site still show the task for finding its key Huh

Did someone else find it? or was LBC site just slow on updating its stats page?

Quote from: https://lbc.cryptoguru.org/stats

Time to hit #55 of the puzzle transaction (1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa) 0 to 112 days at current speed in sub-55bit search space.

arulbero

legendary

Activity: 1932

Merit: 2077

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

I've been working on a tool for brute-forcing Bitcoin private keys. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions: https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

Other (more or less) similar projects :

https://bitcointalksearch.org/topic/large-bitcoin-collider-thread-20-1877935

https://bitcointalksearch.org/topic/faster-and-autonomous-large-bitcoin-collider-fork-3102823

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

Try with other software to have a comparison.

HCP

legendary

Activity: 2086

Merit: 4361

Quote from: bitmover on June 10, 2018, 10:43:01 PM

what I am going to say is purely theoretical, as I have never tried to brute force private keys.

I don´t think you will have any success doing this.

I think you misunderstand what it is that the OP is attempting to achieve...

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions: https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

The Bitcoin puzzle transactions were setup as an exercise to see how tough it is bruteforce BTC... and is essentially what the LBC is attempting to cash in on (aside from other "collateral damage" of people with weak keys).

What is interesting is that the addresses in the middle range of amounts (0.056 to 0.16 BTC), which were theoretically "easier" than the addresses with the larger amounts, have not yet been "cracked"??!?

bitmover

legendary

Activity: 2352

Merit: 6089

bitcoindata.science

Quote from: BitCrack on June 10, 2018, 09:39:00 PM

Hi all,

I've been working on a tool for brute-forcing Bitcoin private keys.

.....

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

....

Thoughts?

Thanks!

what I am going to say is purely theoretical, as I have never tried to brute force private keys.

I don´t think you will have any success doing this.
If you have enough hash power, you would probably make more money working as an honest node, mining.

Bitcoin protocol is secure enough. If it were brute force-able, bitcoin wouldn't be worth anything.

What i think you could do is to find a collision. If someone made an insecure private key, by just hashing some passphrase... maybe you could have some luck. I tried to do this once, but never found anything. I tried those terms like "wallet" "bitcoin". I found some addresses which used to have balances, but not anymore. But I was doing manually, like 1 address/3 minutes lol

If you could somehow at the same time check if any of those 9.4 million keys/sec have any balance in btc/bch/btg etc...

But I don't think any of that will work, and will be a waste of time and resources.

BitCrack

jr. member

Activity: 30

Merit: 122

Hi all,

I've been working on a tool for brute-forcing Bitcoin private keys. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions: https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

Screenshot:

It is open-source under the MIT licence and requires no external dependencies other than the CUDA toolkit. It builds on Windows using Visual Studio 2015, and Linux using Make (you might have to edit the Makefile and point it towards your CUDA toolkit directory).

It can search for compressed/uncompressed keys or both.

The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.

Note:
-Currently it is CUDA only.
-It can only search one target key at a time

Features I would like to add if there is enough interest for the project:

~~-Support for searching multiple target keys at one time~~ Done
-OpenCL/AMD device support
-CPU with AVX/AVX2/SHA support
-Checkpoints/Stop and resume
-Vanity address generation

Source and Win32/Win64 binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases/tag/v0.0.6

Thoughts?

Thanks!

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