Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 223. (Read 229618 times)

So I was thinking, puzzle keys are not sequentially generated and masked with 0s, what if for example, for a range which is supposed to start with 1like 0x10000:0xfffff , the key generated randomly had 0x2 or 0x3 at 5th character from the right? Then Satoshi would have needed to use another key.

Example:
ae65342fff1ec7f98cade1a14fe45d0ec1778a5102b9d56cbbaa8c67f6466fda

Note, the 6 in bold, since I need my key to start with 1, I can't mask this key with leading zeros, so I would discard it and would use another one.

---

So don't waste your time by looking for deterministic wallet patterns, or comparing the solved keys with unsolved keys as I said and Satoshi himself said it, there is no pattern, not because we don't want people to solve them, but because we don't want them to waste their time.

What we all should focus on is the puzzles with known public keys, I'd suggest everyone to dive into the vast ocean of public keys, while we all will drown and die eventually, it will be a hell of a swim! Lol.

After seeing ten folding of the pot, I have lost my focus, I can't think throughly because now the competition has more incentive!🤣

what makes you guys thinking that?

Raising the reward is good and bad at the same time, I don't understand the creator's thought but it even seems illogical to me, increasing the price will only attract rich people with great computing power, which will make them take the money and as a consequence it could be lose interest leaving the puzzle barred for decades.
someone capable of spending 812BTC on this certainly has the ability to support the developers of the post by giving them a pinch of it.
1 btc alone would change the lives of many here, if not all, someone who writes from a dell e6420 tells you.
I'm not in the creator's mind and maybe I'm wrong, but this one seems to be telling a hungry person to look for a unique grain of sand on the beach.
"He who has everything ignores what others lack."

I've been doing this for days and I find it fascinating because I like programming and mathematics, I'll investigate from time to time if there are signs of reducing my range, so far I've managed to reduce it by 95% (or that's what I think comparing it with the solved ones) but that range on my laptop is still overwhelming.

to give an example
puzzle 65 in my data start 304-306, and so they are all from 1-65, 70, 75.... so it can't be a coincidence. however it is still overwhelming my resources.
I'll wait a while, if I can't narrow down the range, I'll post it in the hope that a good Samaritan will tip me.

hmmm 140 bits. So you basically think 1393796574908163946345982392040522594123776 private keys is doable with Kangaroo on a supercomputer?

The most optimistic scenario is 44 years with the fastest device. We need either group-search or (even better) quantum search. AI also can step in, as in train a model to study the solved puzzles to extract a pattern within the chaos. This pattern could then be used to narrow down our focus by generating highest probability ranges to search within. Here is what my bot thinks:
---
Okay, let's analyze the Bitcoin address puzzle #66:

The puzzle states the key (private key) used to sign the transaction starts with 02 or 03.
So that limits the key to lie within the range 02000000 to 03FFFFFF.

It also specifies a checksum of 02.  So the key must be such that when hashed with SHA-256 and the first 2 bytes taken, it equals 02.

Based on these clues, here is how I would reason the highest probability ranges for the key:

1) Since the key starts with 02 or 03, the ranges 02100000 to 03099999 have the highest probability. The keys in the 030 range will have slightly higher prob as 03 values are more common.

2) Within those ranges, the keys that end in 00, 40, 80 and C0 have a higher chance of having a SHA-256 hash that starts with 02. This is because when those values are hashed, the carries are more likely to propagate to the first 2 bytes.

3) Some specific ranges I would focus on are:

02080000 to 02088000
02100000 to 02110000
03048000 to 03058000
03068000  to 03070000

4) Of these, the 03048000 to 03058000 and 03068000  to 03070000 ranges have the highest density of keys that may satisfy the 02 checksum.

So in summary, I would say the key for puzzle #66 has the highest probability of lying in the ranges:

03080000 to 03088000
03090000 to 03098000
030A0000 to 030A8000
030B0000 to 030B8000

---

Reanalyze by knowing the following: puzzle #66 will only be within the hex private key  range 0x20000000000000000:0x3ffffffffffffffff

---

Great, that additional information helps narrow down the search space significantly.

Knowing the key must be in the hex range 0x20000000000000000 to 0x3ffffffffffffffff, the highest probability ranges are:

0x30C4000000000000  to  0x30C4000000000001
This range is closer to the 0x30.. section which may be easier to meet the 02 checksum. Probably 1-3% better than average odds.

0x2FE0B80008000000  to  0x2FE0B800080000FF
This range contains repeating patterns (0x0B800) which could make finding a key more likely. Roughly 2-4% improved probability.

0x3131012345678999  to  0x31310123456789FF
Chosen at random from the middle of the range with maybe a 1-2% boost in odds due to proximity to 0x313.. section.

0x2FDEADBEEF000000  to  0x2FDEADBEEF00000F
Contains byte patterns that some keys may end/start with, increasing odds by 1-3%. Selected randomly from that perspective.

0x304080C03005000A  to  0x304080C03005000F
Selected at random from the 0x304080C0 segment which has a higher density of possibilities. Roughly 1-2% improved probability.

----

So what was the cost of sequential search for #66?, was it more than 6.6 BTC? If renting GUPs is going to cost less than 6 bitcoin for #66, then who ever does it first is going to win big time! But I think Satoshi has already calculated the cost and he already knows it will cost more than that.

Or something has happened recently that spooked him and this increase of the prize is merely a distraction! Lol.

I'm only good at making up conspiracy theories. Now chop chop good devs of bitcointalk, please get to work and give us more powerful tools, not that it matters for me, having the most powerful software won't make a difference on a home laptop, we need Satoshi's supercomputer which is the fastest supercomputer in Japan and probably in the world, imagine using kangaroo on that, it could eat up to 140 in a week! 😉

If we construct the pool, this will be done. I've seen it in older pools.

maybe soon someone will write a faster tool and create a software that communicates with a website that stores the scanned ranges (only the ranges not the pk) and that this is displayed on the website, this way the scanning would be avoided of ranges already scanned by others, which would considerably decrease the time to solve each piece of the puzzle.
obviously with the code on github for assembly and transparency.

Too slow, an average gpu can finish scanning these keys in 30 minutes. But the website is popular and helpful enough in other areas



Agreed, conventional private key cracking won't work on these high bits. Even with public keys revealed it's gonna be a torture until any of these puzzles get cracked open.

new methods are needed

I think the puzzle creator should reveal the public keys for all the keys bigger than 120bit

Have you tried messing with a stride function with vanitysearch? If I had that, I think I could solve 125 faster than kangaroo...

I need to implement GPU stride function for vanitysearch/keyhunt-cuda

Hi, there is no need to write in Spanish i can read English without need to translate it, so if you want to speak in Spanish you can do it in PM or telegram.

Regards

Guys! Add me to discord, we can work together.
I'm working with python, C++ and Rust.
Need help with some coding functions, and more power will really help.

 

DaMonsterAJ#4341


Alberto igual podrías escribirme de favor! hay funciones y experiencia que tú tienes que nos pueden beneficiar.


 

Agree with you, but how can you explain maths behind this puzzle? It is really hard and this will cost to you a lot of headache while you find a solution (if it exists). As I can see, sequence seems to be casual, there isn't any

math behind it. The only thing to do if you don't want to use tools, is to try with bit 0 and 1 and be lucky.

Using tools will take much more time, this needs to be solved by math and by hands.😉

Just converting a public key to an address will not help here, as there are already specialized programs in C++ and other faster, multithreaded languages, that can do that.

You don't need to compute base58 or bech32 in order to compare the addresses. Comparing the address hashes directly also works and saves an extra (expensive) computation, such that most of the work is pooled into making an efficient SHA256 algorithm OR optimizing the process of making private keys from public keys.

Probably time for me to stop by Cornell university's internet arxiv for some more finite field research papers.

Lol he did more than enough. The cracking method is on us to figure out.

OMG !!! 😱😱😱😱😱 Yesterday, I was thinking that I should give up now, but this has turned into a great motivation. need only one message from the puzzle creator in this situation, it would be the icing on the cake 👍🏼 👍🏼

Wrong, the entire range of puzz #66 contains 36.8 million trillion keys, half that range is obviously 18.44 million trillion keys.

Also the calc is misleading. With 1billion keys/sec, you need a little over 1000 years to scan the entire range sequentially.

With collective effort, we can go as far as 90 bits. Then from there, Quantum code should step in. But that's another level.