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

That changes a lot. Because using totally random key every time would be harder to crack than some deterministic wallet. Now, the big question is: which deterministic wallet was used? Because there are some of them, and they use different algorithms to derive keys.

To better illustrate, why cracking some deterministic wallet may be easier, consider this example: we start from the master private key, and then we use addition to derive keys. We use some hash that contains the master public key, and some nonce, representing the index of our child key. What does it mean in that case?

For example, a very simple, but unsafe method, is to use "childKey=masterKey+SHA-256(masterPubKey||index)", in practice something stronger is used in real implementations, but let's start from that. Then, by inspecting revealed private and public keys, it is possible to focus on that master key, instead of trying to crack child keys alone. Also note that all public keys from 160-256 range are revealed, we can assume that those keys also follow the pattern. And even if there are no coins, then still, we can use those public keys as an additional information in our algorithms.

Let's assume that our masterKey is equal to SHA-256("master"), just to have some deterministic-but-randomly-looking hash to work with:


Then, we can go further and further, by trying to generate child keys, and checking how close we are to the keys from the puzzle. For example, the first 10 keys from this example, looks like that:


And then, we can compare our example with real keys:


And there is more: there is no need to brute force every combination here. If we assume some kind of algorithm, we can make optimizations just for that. So, if we assume that keys are added to the master key, and if mask is calculated with modulo and sum, then we can check selected keys, and create requirements for that master key.

For example, modulo addition, and modulo multiplication, has a nice property, that we can use any order. So, if we have "a+b", or "b+a", then "(a+b)%n" and "(b+a)%n" is also the same. We can also use those rules for multiplication. Then, we don't have to check every single master private key. We can simply assume that if keys are added, then the master key modulo N is in a given range. Then, we can create specific master keys, and skip many of them.

It means they were able to set the bit range "difficulty" by masking the leading characters of the private key.

JLPs Kangaroo program does it like this:


Now that is for distinguished points, but the concept is the same.

So if you run a -dp of say 40, then the leading 10 characters (of the xpoint) would be 0s (zeros). I imagine it would be easy to implement something similar in wallet software or a script to generate private keys, and change the masking to mask the leading characters of the private key.

What does masked with leading 000...0001 to set difficulty mean? I mean how would someone add that to a program?

Wonder no more big man, if you could find and sweep them all don't forget us, we're strongly outnumbered group of puzzle hunters with our primitive hardware licking the tip of the iceberg hoping to melt it down, lol.
"Care & share" you know? 😉

https://bitcointalksearch.org/topic/m.18765941

I wonder if keys were generated by some deterministic wallet first, and then truncated to N bits. Because in that case, it could be possible to recover the master key, and then sweep coins from all of them, while it would not mean that ECDSA is broken (because HD keys could be non-hardened).

Maybe this person can tell us who found #120: https://bitcointalksearch.org/user/666msn666-1285555  (just a hunch)

I would agree. If they are a regular in the discussion of this challenge, they'd at least let peeps know the priv key once all forks have been taken care of, especially if they follow on here and know people like to know the priv keys to try and "create" a pattern with the challenges.
Also, if it's somebody not on this forum, it seems like they would at least come forward (on some venue) as this is a new world record. Maybe sooner or later they will. Time will tell...

I see it exactly the opposite way. There are numerous reasons why the true and happy finder would never want to disclose this information here in the forum, if this person is active here in the forum at all. I even claim that there are more logical reasons to hide it than to hang it on the big bell and supposedly brag about it.

This assumption can also be reflected analogously to a block find where a solo miner collects the reward but wants to remain anonymous. There are dozens of reasons for that.

Because I had my bets that they'd be celebrating about it on this thread by now if that were the case. Pretty safe educated guess to make if you ask me.

How can you know that ?

Nobody knows the private key except the guy who solved it. And there's nothing to force them to go to bitcointalk (or anywhere else) and post it here. What I do know, is that it wasn't someone from this forum.

so, send the private key
who solved ? which tools useing to crack keyhunt or BitCrack

Actually you just gave me a idea haha. What if people plugged their GPUs into a renewable energy source while cracking the keys so that they save on electricity fees?

BTC being at $23,000 currently, the rewards gained recently were around $10K or two each, but I wonder how much electricity they had to pay to achieve this? Nevermind the initial hardware investment as it's a 1 time thing.

in your search scripts, you have mistakes, by mistake or you know why ?

value="0x20000000000000000:0x3ffffffffffffffff:D7F207850C19B7B763B10D0A1AB049CF466B8FAE">Puzzle #66
value="0x40000000000000000:0x7ffffffffffffffff:739437BB3DD6D1983E66629C5F08C70E52769371">Puzzle #67

for puzzle 66, you mention hash160 for search is about pre define privatekey is for 0x20000000000000000
for puzzle 67, hash160, OK, but have lot of other mistakes inside your scripts, so dont try to waste time your self and others
correct all mistakes and get proved by testing professionals, and then launch your subject
thankx

Make a new thread, note that CPU is useless for this purpose.

this is totaly out of the blue btw but i agree with defending PoW. People are trying to use renewable enrgey so that they can earn more for not paying/paying as much for electricity

I made a Web Tool to scan for the keys. https://newbtcbruterandom.grantrocks.repl.co its a random btc key checker (this one is new and it uses all possible cores on your cpu-1 so that it can update the gui). It features a select tool so that all you have to do is choose a puzzle that is somewhat possible to get randomly and click start. I get about 100000 keys per thread on a AMD Ryzen 7 5700G running at 4.4Ghz. I use 14 threads. so thats about 1.4 Million keys every 20 seconds that are randomly checked. Its also focused on performance and im constantly updating it. Please leave some feedback for me so i know where and how to improve. Im currently trying to speed up the hashing so any help with that would be much appreciated!

I also made a non random scanner https://32btcbrute.grantrocks.repl.co to scan for specified btc puzzles. this one is quite fast and allows you to customize where to search.


EDIT
im hoping to use a lib like gpu.js in the future to greatly speed up the tool. However i have no idea how to do this and it will take me a while to figure out.

Meanwhile, #66 is chilling out and waiting for someone to find it, or maybe it will be found so quickly just like the other two in rapid succession.

Someone is really throwing good hardware at this challenge.

absolutely. That's what it is all about. 

You misunderstood the situation. You and walletrecovery were arguing over a useless things, which is of course okay for us.


BUT what made me post this and previous message is that the fact that walletrecovery insulted you for thing that is really not worth it. Like who cares which puzzle was first solved?


Exactly. Thank you for pointing that @citb0in. I mean we are here as a community to help develop new ideas and to help eachother. Like come on.