You can install C++ Clang tools for Windows on the community addition also

Anyway, there certainly is some issues with the openCL version as cuBitcrack found nearly 3 times as many keys in the same range.

I have joined the TTD pool anyway, I didn't realize there was one, better to share my hash and we all get something out of it.

Already noticed a difference, similar speeds but scanned over double the number of keys in a single keyrange. It was scanning around 700,000,000,000 with clBitrack, currently on 1,481,528,836,096 and still going.id say that is now capturing the keys it was not before and makes sense that clBitCrack was not working correctly.

Thank You, I will take a look.

I have actually made a program in python that splits the keyspace into chunks and I can either start at a set place or randomly choose chunks until they are all complete. To run through the first I split the range into 200 chunks which takes about 12 - 15 minutes to run each chunk.

But yeah, I wish I knew C++/C more and I would try and make any optimizations.

So how would you go about brute-forcing the whole range between 2^63 and 2^64 even if it does take much longer? or do I just re-scan the whole range again, will it skip different keys?

Not disagreeing with you, but the hex ranges I showed above are correct right? Why would clBitcrack state "[Info] Reached end of keyspace" unless there is some bug or those are not the correct ranges. maybe I missed a 0 or two?

Appreciate the explanation.

edit: I see 2^64 = 18,446,744,073,709,551,616 in decimal. Whereas the difference between the two hex ranges is 9,223,372,036,854,775,808 so I am guessing the 64 bit range that the puzzle is in is anywhere from 2^1 -> 2^64? Whereas I have just scanned 2^63 -> 2^64 which is just a single segment of the whole range?

I wonder if the cuBitcrack would work well under Windows Subsystem for Linux with Linux binary. I might try that, I am more comfortable in Linux, The only reason I started this on Windows is so that I could stop it if I wanted to watch TV or play games on my PC.

D
Thanks,

Do you know if anyone has compiled a Cuda version of Bitcrack for Windows that will work with the 3070 and Cuda 11.2? I have tried compiling myself by changing the props files but I am having no luck, I never really worked with C++ or VS.

Not the entire, just the 64-bit range.
 
If that is the case then why does clBitcrack on my RTX 3070 say the range has been completed. from decimal 18446744073709551615 to 9223372036854775808? Using clBitcrack as cuBitcrack dont work on my 3070, I'm doing around 1100MKey/s?

I have inputted the hex ranges:

0000000000000000000000000000000000000000000000008000000000000000
000000000000000000000000000000000000000000000000ffffffffffffffff

Altogether it has taken around 2 days (~42 hours) to search non-stop.

Does BitCrack always find keys or can it miss?

I have searched the whole of the puzzle 64 range and not been able to find the key 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

0x0000000000000000000000000000000000000000000000008000000000000000
0x000000000000000000000000000000000000000000000000ffffffffffffffff

https://privatekeys.pw/puzzles/bitcoin-puzzle-tx

Thank you for the clarification. As the public key is not available for some of these puzzle transactions some will need to be brute-forced using the base58-check address right?

Unless we know the public key kangaroo cant help as much faster as it is.

Does this mean that the puzzle transactions are not in the keyspaces that privatekeys.pw shows? but could be anywhere?

https://privatekeys.pw/puzzles/bitcoin-puzzle-tx

Puzzle 64 - Keyspace 8000000000000000...ffffffffffffffff    ?

Hi,

I am very new to Bitcoin and just learning a lot of the terminology and technologies which make it run. I see in the services forum there are a lot of Bitcoin Mixers, I know what they are for but I was wondering exactly how they worked?

Ideally, you would send your BTC to the mixer and it would forward you on the same amount - fee from a completely separate transaction chain of Bitcoins so that it cant be traced, but in reality, can it work like that unless the mixer has a lot of BTC. If the Mixer has little BTC or is new they might not have funds on another chain to send to you and then they just forward your BTC back to you which has the same trail.

Could someone explain if that is likely the case in this scenario? or are there other technologies at work here?

doh, Thank You!!

I am currently trying to split an address range for a puzzle (64) into different chunks, add to a python list and randomly choose the chunks until they are all complete without sequentially cracking the range. I have a problem with some keyspaces though where I get an error from bitcrack.

for example

--keyspace 00000000000000000000000000000000000000000000000085ffffffffffffff:000000000000000000000000000000000000000000000000857fffffffffffff

Which are the decimals:

Start: 9655717601082343423
End: 9619688804063379455

Bitcrack errors with:  [Error] Error --keyspace: Invalid argument

Any idea why?

Hi,

I often see this image of the sun burning out and "bitcoin can't be brute-forced" being thrown around on threads like this a lot (scroll down you will most likely see someone post it).

My question is:

With today's technology, with governments and their agencies with nearly unlimited funds, could they not generate every address and key. store this in a distributed database (however many nodes) and search for whatever key they need. Surely with AWS, Azure, GoogleCloud companies could have the money to run the required infrastructure. or is the number of keys so large that even with 1 million servers with database nodes this could not be done?

Sorry for my lack of understanding on the matter, I know there is 115792089237316195423570985008687907852837564279074904382605163141518161494336 Keys but could this be done?

Hi,

I am struggling to find any resources on keyspace and bitcoin addressing. Recently after looking at the puzzle transactions some questions came to mind. https://privatekeys.pw/puzzles/bitcoin-puzzle-tx

• What is keyspace exactly? is this refering to SHA256 keyspace?
• How is it that the puzzle transactions were created in different keyspaces?
• Can you create a bitcoin address in a specific keyspace?
• When bitcoin addresses are made is the keyspace they are in random, or is there a preferable or more pseudorandom range that they are likely to appear in?

Thanks for answering any questions.

Hi Pooya87,

Just so I can steal some knowledge from you. Does this mean that even if I find a HD key (xprv) it might not be the master xprv of a wallet but the xprv of an address that could be way down the hierarchy of addresses in a particular wallet? My initial concept was to try and find Wallets rather than just addresses.

I found this which you may find interesting

https://bitcoin.stackexchange.com/questions/51724/is-it-feasible-to-derive-the-root-key-of-an-hd-wallet-from-a-large-sample-of-chi