Bitcoin puzzle transaction ~32 BTC prize to who solves it

[kTimesG]

Your phrasing - "for a better k without sacrificing the speed" - implies the +33% is not mandatory. That is the part I cannot reconstruct from the source. Is the cheap add amortised into the batched inversion in a way the naive count misses, or is it a different construction than the one described in the v3.x notes?

I am not sure how you ended up with the 33%. Yeah, for SOTA+ there's always the cheap point overhead of 1M + 1S, but going from that to a 33% is a long shot, because theory != implementation, and not everything is just about the EC math in the loop (there's cycle detection, DP, answering "what direction is REALLY better to jump next?" and so on).

In other words, there are other practical benefits to always computing the cheap point, which are absent  when computing it conditionally, which translate in the end, to the 1M + 1S gap paying itself out to slightly faster solves overall, on average. Yes, things will run at a lower speed, but the expected lower k compensates.

The best ideea will be a platform that you can see only if you share ranges that you found.

Hopefully you don't make the same mistakes like the hundred people before you that attempted the same idea only to get roasted for not grasping the core "lack of trust" fundamental flaws. My suggestion is stop immediately, think it through another dozen times, read the stories of previous roasted n00bz that pretended they had everything right, except that they didn't have anything right at all. If you still plan on LLM-ing the platform, my suggestion would be again, to stop, and realize that the trust issue is impossible to be avoided, hence such a platform / pool is also impossible, since anyone can cheat it, no matter how smart you plan the scan verifications or whatever. There is only one bullet-proof way to be sure that some whatever range of keys was truly completely scanned: by scanning it yourself. And actually, you don't have the 100% guarantee even then, because some cosmic ray might flip some bit during a H160 per-key independent operation, and you will never ever know it happened, and cannot know it happened unless you scan it again on another device using different independent verification code..

Anything else except solo scanning is not to be considered safe information.

[detechs]

Your phrasing - "for a better k without sacrificing the speed" - implies the +33% is not mandatory. That is the part I cannot reconstruct from the source. Is the cheap add amortised into the batched inversion in a way the naive count misses, or is it a different construction than the one described in the v3.x notes?

I am not sure how you ended up with the 33%. Yeah, for SOTA+ there's always the cheap point overhead of 1M + 1S, but going from that to a 33% is a long shot, because theory != implementation, and not everything is just about the EC math in the loop (there's cycle detection, DP, answering "what direction is REALLY better to jump next?" and so on).

In other words, there are other practical benefits to always computing the cheap point, which are absent  when computing it conditionally, which translate in the end, to the 1M + 1S gap paying itself out to slightly faster solves overall, on average. Yes, things will run at a lower speed, but the expected lower k compensates.

The best ideea will be a platform that you can see only if you share ranges that you found.

Hopefully you don't make the same mistakes like the hundred people before you that attempted the same idea only to get roasted for not grasping the core "lack of trust" fundamental flaws. My suggestion is stop immediately, think it through another dozen times, read the stories of previous roasted n00bz that pretended they had everything right, except that they didn't have anything right at all. If you still plan on LLM-ing the platform, my suggestion would be again, to stop, and realize that the trust issue is impossible to be avoided, hence such a platform / pool is also impossible, since anyone can cheat it, no matter how smart you plan the scan verifications or whatever. There is only one bullet-proof way to be sure that some whatever range of keys was truly completely scanned: by scanning it yourself. And actually, you don't have the 100% guarantee even then, because some cosmic ray might flip some bit during a H160 per-key independent operation, and you will never ever know it happened, and cannot know it happened unless you scan it again on another device using different independent verification code..

Anything else except solo scanning is not to be considered safe information.

Please provide maths we can use to verify your claims. Otherwise that's all they are. I am super confident puzzle_72_workers idea will be better than anyone else's attempt at pooling work., instead of telling people your opinion, which is probably wrong, try lift them up and give them motivation. Cause we can see you haven't solved any puzzles using your ideas either..

[kTimesG]

Please provide maths we can use to verify your claims.

This is like asking to provide maths for the multiplication table. The topic of fair H160 pools impossibility has already been debated to death in the last 10 years, and the proof is easily understandable by a 5-year child. What do you want, a drawing? Understand that it's impossible to compute a proof that some data made out of independent items has been computed, without actually computing all the independent items of the data itself to verify them.

Though it's in the spirit of the thread to reach every single day the full non-sense point, where people confuse facts for opinions, and then ask for proofs.

[detechs]

Please provide maths we can use to verify your claims.

This is like asking to provide maths for the multiplication table. The topic of fair H160 pools impossibility has already been debated to death in the last 10 years, and the proof is easily understandable by a 5-year child. What do you want, a drawing? Understand that it's impossible to compute a proof that some data made out of independent items has been computed, without actually computing all the independent items of the data itself to verify them.

Though it's in the spirit of the thread to reach every single day the full non-sense point, where people confuse facts for opinions, and then ask for proofs.

kTimesG,

You said fair H160 pool verification is impossible. Then you called my request for math "daily nonsense."

Here is the math.

Bram already verified a distributed H160 scan across 25K GPUs for puzzle 67. Each worker submitted HASH-160 keys with 48 leading zero bits as proof of work. Expected submissions per worker per range of size R:

  E = R / 2^48

Standard deviation:

  sigma = sqrt(E)

A worker submitting fewer than E - 3*sigma submissions is cheating with >99.7% confidence. For puzzle 67 with 256 workers scanning 2^58 keys each, E = 1024, sigma = 32. Observed: 938 to 1108. Every worker within 3 sigma. This was verified by Cricktor in post #7575.

That is not cryptographic proof. It is probabilistic verification. It works. It was used. The distinction matters.

If you meant "perfect cryptographic proof is impossible" then say that. Nobody disagrees. But that is not what you wrote. You wrote "it's impossible to compute a proof that some data made out of independent items has been computed." This is true only for perfect proofs. Probabilistic proofs with quantifiable error rates exist and have been deployed.

Now here is the math you did not provide.

Puzzle 71 full scan estimate at current aggregate: 421 years. If your SOTA+ with 1M+1S overhead cuts k by 10%, that is 379 years. If it cuts k by 50%, that is 210 years. If it cuts k by 90%, that is 42 years. None of these are practical. The exponential curve has hit a wall at 2^70 regardless of implementation details.

Meanwhile the puzzle creator designed 256 wallets with a 160-bit address layer. RIPEMD160 outputs exactly 160 bits. After puzzle 160 the brute force cost flatlines at 2^160 for every puzzle 161 through 256. The measuring instrument stops measuring. The creator called 161-256 "silly" and moved the funds. The wallets still exist. Puzzle 256 still has dust.

You are arguing about saving one multiplication per kangaroo jump while the puzzle creator built a puzzle, the BIP39 word mapping of keys, the f6f5431d cluster, and the 256 addresses themselves. The instrument already gave its reading. Brute force hit the ceiling. The creator is measuring something else now.

If your SOTA+ can solve puzzle 71, solve it. If not, then we agree on the math: the exponential curve is the wall, and no constant-factor optimization changes that.

[kTimesG]

Understand that it's impossible to compute a proof that some data made out of independent items has been computed, without actually computing all the independent items of the data itself to verify them.

A worker submitting fewer than E - 3*sigma submissions is cheating with >99.7% confidence.

I think you should check up the definition of the word "impossible" then re-read the remaining of the text that follows it.

99.7% confidence is just a long-term probability. A 100% guarantee requires submitting 100% of everything.

99.7% long-term probability is not an obligation for a random bad actor to stop scanning once his N submission proofs are found, leaving the remaining keys unscanned.

99.7% probability does not mean that 99.7% of any range was actually really scanned.

I can continue all day long, but hopefully you got the picture by now.

[detechs]

Understand that it's impossible to compute a proof that some data made out of independent items has been computed, without actually computing all the independent items of the data itself to verify them.

A worker submitting fewer than E - 3*sigma submissions is cheating with >99.7% confidence.

I think you should check up the definition of the word "impossible" then re-read the remaining of the text that follows it.

99.7% confidence is just a long-term probability. A 100% guarantee requires submitting 100% of everything.

99.7% long-term probability is not an obligation for a random bad actor to stop scanning once his N submission proofs are found, leaving the remaining keys unscanned.

99.7% probability does not mean that 99.7% of any range was actually really scanned.

I can continue all day long, but hopefully you got the picture by now.

I've already been listening to the pictures, I've been solving the puzzle a different way, from eve to genesis to papa bear. Finding everything the brute forcers skipped past, the walls they think exist. Your puzzle stops at 160, mine continues to the end. The bitcoin isn't my prize, I already found my prize.

[zahid888]

What if some puzzle keys are hidden inside the SHA-256 hashes of well-known passwords? Has anyone explored this possibility?

Code:

Input your password: Puzzle 2^71 to 2^160 using SHA256 hash of given password

[NEW PASSWORD] running...

  -startpass "Puzzle 2^71 to 2^160 using SHA256 hash of given password"
  -passlength 56

 [+] Starting from password : Puzzle 2^71 to 2^160 using SHA256 hash of given password
[-] Total Speed: 206.28 MK/s [-] [00:00:02 Elapsed Time] [Progress: 1 %] | Prefix [0]

======================================================================================
|                    Total Matching character in hash160: 14                         |
|------------------------------------------------------------------------------------|
| 1PWo3JeBEiEt6goSg695U2yRAy3SJoF16h f6f5431d25d720b15b6a86ad56960ef43a923048        |
| 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8        |
| ^^^^^^^^                           ^^^^^^^^^^    ^^   ^                   ^        |
|------------------------------------------------------------------------------------|
|  Password    : Puzzle 2^71 to 2^160 using SHA256 hash of given passwotf    |
|  SHA256      : E2DE53227F3977D9A5B0891CAD9C016C3D1E04349B74C99F8EF4BB2F0E1BD130    |
|  Private Key : 00000000000000000000000000000000000000009C016C3D1E04349B74C9A0CC    |
|  Public Key  : 02EDA07448E9011156DAFD4EF4B8E3703D2AB17E9CCBA34E300027D6609B27D73E  |
======================================================================================

[\] Total Speed: 314.13 MK/s [\] [00:00:03 Elapsed Time] [Progress: 1 %] | Prefix [1]

======================================================================================
|                    Total Matching character in hash160: 13                         |
|------------------------------------------------------------------------------------|
| 1MUJSJYseBvKJj5uqh2MF9v6mQsis1LvL5 e08c4d3bc9096f35c5cfbafcff9b08e034ff07f1        |
| 1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy e08c4d3bc9cf2b3e2cb88de2bfaa4fe8c7aa3f24        |
| ^^^^^^^         ^                  ^^^^^^^^^^    ^          ^    ^                 |
|------------------------------------------------------------------------------------|
|  Password    : Puzzle 2^71 to 2^160 using SHA256 hash of given passwovS    |
|  SHA256      : 366424628676F8ACC7CD2A4B31CCCDD12F1A50D7EB86CD9AEF4EF1D820054388    |
|  Private Key : 000000000000000000000000000000000000000000424628676F8ACC7CD2B5C1    |
|  Public Key  : 03F651EBD700BDB2AA57950A52F0A7D0C01090DD5A1C86D4B0BF76C06AB53C38A1  |
======================================================================================

[/] Total Speed: 475.81 MK/s [/] [00:00:13 Elapsed Time] [Progress: 9 %] | Prefix [2]

======================================================================================
|                    Total Matching character in hash160: 11                         |
|------------------------------------------------------------------------------------|
| 16AbnZjZsjAk2Ay1vL4wenyUjSAjeFVb8Z 38a968fdfba7d1209ae1a86280416edde5769ae3        |
| 16AbnZjZZipwHMkYKBSfswGWKDmXHjEpSf 38a968fdfb457654c51bcfc4f9174d6ee487bb41        |
| ^^^^^^^^                           ^^^^^^^^^^                      ^               |
|------------------------------------------------------------------------------------|
|  Password    : Puzzle 2^71 to 2^160 using SHA256 hash of given passwp95    |
|  SHA256      : 1F87AB91E5026635E1A47F96F62CAFB50A785881044756FD2C92633749096F7C    |
|  Private Key : 00000000000000000000000000000000000007F96F62CAFB50A78588104482B3    |
|  Public Key  : 02F8C204D0FD61C7D21977DC848DA6041274A31AD1D24195454BEECA5CE130EC4A  |
======================================================================================

[|] Total Speed: 475.60 MK/s [|] [00:00:28 Elapsed Time] [Progress: 19 %] | Prefix [3]

Final Stats:
Elapsed Time: 29.24 seconds
Partials Found: 3
======================================================================================

Input your password:

[eggsylacer]

What if some puzzle keys are hidden inside the SHA-256 hashes of well-known passwords? Has anyone explored this possibility?

https://www.talkimg.com/images/2026/08/09/U4UpoW.gif

Code:

Input your password: Puzzle 2^71 to 2^160 using SHA256 hash of given password

[NEW PASSWORD] running...

  -startpass "Puzzle 2^71 to 2^160 using SHA256 hash of given password"
  -passlength 56

 [+] Starting from password : Puzzle 2^71 to 2^160 using SHA256 hash of given password
[-] Total Speed: 206.28 MK/s [-] [00:00:02 Elapsed Time] [Progress: 1 %] | Prefix [0]

======================================================================================
|                    Total Matching character in hash160: 14                         |
|------------------------------------------------------------------------------------|
| 1PWo3JeBEiEt6goSg695U2yRAy3SJoF16h f6f5431d25d720b15b6a86ad56960ef43a923048        |
| 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8        |
| ^^^^^^^^                           ^^^^^^^^^^    ^^   ^                   ^        |
|------------------------------------------------------------------------------------|
|  Password    : Puzzle 2^71 to 2^160 using SHA256 hash of given passwotf    |
|  SHA256      : E2DE53227F3977D9A5B0891CAD9C016C3D1E04349B74C99F8EF4BB2F0E1BD130    |
|  Private Key : 00000000000000000000000000000000000000009C016C3D1E04349B74C9A0CC    |
|  Public Key  : 02EDA07448E9011156DAFD4EF4B8E3703D2AB17E9CCBA34E300027D6609B27D73E  |
======================================================================================

[\] Total Speed: 314.13 MK/s [\] [00:00:03 Elapsed Time] [Progress: 1 %] | Prefix [1]

======================================================================================
|                    Total Matching character in hash160: 13                         |
|------------------------------------------------------------------------------------|
| 1MUJSJYseBvKJj5uqh2MF9v6mQsis1LvL5 e08c4d3bc9096f35c5cfbafcff9b08e034ff07f1        |
| 1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy e08c4d3bc9cf2b3e2cb88de2bfaa4fe8c7aa3f24        |
| ^^^^^^^         ^                  ^^^^^^^^^^    ^          ^    ^                 |
|------------------------------------------------------------------------------------|
|  Password    : Puzzle 2^71 to 2^160 using SHA256 hash of given passwovS    |
|  SHA256      : 366424628676F8ACC7CD2A4B31CCCDD12F1A50D7EB86CD9AEF4EF1D820054388    |
|  Private Key : 000000000000000000000000000000000000000000424628676F8ACC7CD2B5C1    |
|  Public Key  : 03F651EBD700BDB2AA57950A52F0A7D0C01090DD5A1C86D4B0BF76C06AB53C38A1  |
======================================================================================

[/] Total Speed: 475.81 MK/s [/] [00:00:13 Elapsed Time] [Progress: 9 %] | Prefix [2]

======================================================================================
|                    Total Matching character in hash160: 11                         |
|------------------------------------------------------------------------------------|
| 16AbnZjZsjAk2Ay1vL4wenyUjSAjeFVb8Z 38a968fdfba7d1209ae1a86280416edde5769ae3        |
| 16AbnZjZZipwHMkYKBSfswGWKDmXHjEpSf 38a968fdfb457654c51bcfc4f9174d6ee487bb41        |
| ^^^^^^^^                           ^^^^^^^^^^                      ^               |
|------------------------------------------------------------------------------------|
|  Password    : Puzzle 2^71 to 2^160 using SHA256 hash of given passwp95    |
|  SHA256      : 1F87AB91E5026635E1A47F96F62CAFB50A785881044756FD2C92633749096F7C    |
|  Private Key : 00000000000000000000000000000000000007F96F62CAFB50A78588104482B3    |
|  Public Key  : 02F8C204D0FD61C7D21977DC848DA6041274A31AD1D24195454BEECA5CE130EC4A  |
======================================================================================

[|] Total Speed: 475.60 MK/s [|] [00:00:28 Elapsed Time] [Progress: 19 %] | Prefix [3]

Final Stats:
Elapsed Time: 29.24 seconds
Partials Found: 3
======================================================================================

Input your password:

I am the creator.

You are quite right, 161-256 are silly.  I honestly just did not think of this.  What is especially embarrassing, is this did not occur to me once, in two years.  By way of excuse, I was not really thinking much about the puzzle at all.

I will make up for two years of stupidity.  I will spend from 161-256 to the unsolved parts, as you suggest.  In addition, I intend to add further funds.  My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key).  Probably in the next few weeks.  At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology.  The "large bitcoin collider" is especially innovative and interesting!

[simonmales]

I built a browser WebGPU brute-forcer for Puzzle 71. Free, no backend, and here is exactly where the money goes.

Krackpot update: the claim now goes to two private pools at once, and I've run it end to end on mainnet.

Since MARA opened Slipstream up (NUCLEAR7.1 posted that here, #13682) the browser submits the signed claim to Rebar Shield and Slipstream at the same time, instead of Shield on its own with Slipstream as a manual fallback.

Each pool wants the transaction shaped differently. Shield's copy pays Rebar through a dedicated output and carries no on-chain fee. Slipstream's pays a normal fee and drops the Rebar output. Both spend the same coins, so they conflict on purpose: only one of them can confirm, and the finder gets the same 6 BTC whichever it is.

For the test I generated a private key inside a small range, funded that address, pointed the app at it and let the GPU brute-force its way to it. Both pools took the claim. Shield's copy is the one that got mined, in block 961650, and Slipstream's died as soon as the input was spent.

Nothing touched the public mempool.

krackpot.io/blog/how-it-works

[optioncmdPR]

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

What I find to be most absurd , is some peoples absolute refusal to open their minds
to a broader meaning on what makes a wallet deterministic. I see nothing here that mentions
bip32, 39, 44, 85 ....I see a derivation scheme announced and then intentionally NOT defined.
you could create a deterministic wallet with whatever formula or secret algo you want. As long as it creates consistently the same outputs it is deterministic by definition. reverse engineering progress comes from experimenting and scrutinizing everything, including certain new block  timestamps when converted to unix time  and observing / logging the results.  start at the end and unravel the steps to reveal the custom determinatory logic the creator used to generate keys before masking them to fit a given bitspace.
I also understand that those who assign any reported observation in this regard as "shooters fallacy" will DEFINATELY never solve a puzzle, and not having any hope left in them making them more bitter and angry each day. So go ahead. Do the usual and counter other ideas with laughter like gods among peasants. Go ahead and laugh your ass off, please by all means, and heartily at that. In the end, you won't be laughing at all, It will be coming from the other side of the street.
 It will be coming from one of us.

[eggsylacer]

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

What I find to be most absurd , is some peoples absolute refusal to open their minds
to a broader meaning on what makes a wallet deterministic. I see nothing here that mentions
bip32, 39, 44, 85 ....I see a derivation scheme announced and then intentionally NOT defined.
you could create a deterministic wallet with whatever formula or secret algo you want. As long as it creates consistently the same outputs it is deterministic by definition. reverse engineering progress comes from experimenting and scrutinizing everything, including certain new block  timestamps when converted to unix time  and observing / logging the results.  start at the end and unravel the steps to reveal the custom determinatory logic the creator used to generate keys before masking them to fit a given bitspace.
I also understand that those who assign any reported observation in this regard as "shooters fallacy" will DEFINATELY never solve a puzzle, and not having any hope left in them making them more bitter and angry each day. So go ahead. Do the usual and counter other ideas with laughter like gods among peasants. Go ahead and laugh your ass off, please by all means, and heartily at that. In the end, you won't be laughing at all, It will be coming from the other side of the street.
 It will be coming from one of us.

This is how religion came into the world with its gods (using your thinking). And also what Jesus really meant. I mean, people interpreted what Jesus said in their own way, and eventually it led to the creation of religion. It's the same with this creator's message.

Since I consider myself a person who uses the scientific method rather than fictional gods, if you have something specific that can be used and that you can ACTUALLY work with, I will be happy to talk to you.

P.S. Please try using a neural network (AI) to get one of the interpretations of the text (which the creator wrote), taking into account its own context, and perhaps you will understand what I am talking about.

[detechs]

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

What I find to be most absurd , is some peoples absolute refusal to open their minds
to a broader meaning on what makes a wallet deterministic. I see nothing here that mentions
bip32, 39, 44, 85 ....I see a derivation scheme announced and then intentionally NOT defined.
you could create a deterministic wallet with whatever formula or secret algo you want. As long as it creates consistently the same outputs it is deterministic by definition. reverse engineering progress comes from experimenting and scrutinizing everything, including certain new block  timestamps when converted to unix time  and observing / logging the results.  start at the end and unravel the steps to reveal the custom determinatory logic the creator used to generate keys before masking them to fit a given bitspace.
I also understand that those who assign any reported observation in this regard as "shooters fallacy" will DEFINATELY never solve a puzzle, and not having any hope left in them making them more bitter and angry each day. So go ahead. Do the usual and counter other ideas with laughter like gods among peasants. Go ahead and laugh your ass off, please by all means, and heartily at that. In the end, you won't be laughing at all, It will be coming from the other side of the street.
 It will be coming from one of us.

This is how religion came into the world with its gods (using your thinking). And also what Jesus really meant. I mean, people interpreted what Jesus said in their own way, and eventually it led to the creation of religion. It's the same with this creator's message.

Since I consider myself a person who uses the scientific method rather than fictional gods, if you have something specific that can be used and that you can ACTUALLY work with, I will be happy to talk to you.

P.S. Please try using a neural network (AI) to get one of the interpretations of the text (which the creator wrote), taking into account its own context, and perhaps you will understand what I am talking about.

You're referring to things like gnosis right? Have you also found the source sound in Bitcoins genesis block? Seen what's inside and behind the lens? Why aren't you using the knowledge to improve your brute forcing? I'm rebuilding satoshis method he used, the "random" trigger. Quite interesting learning about all the oracles through history. And how other people coded them. Why not help us? You know we're in the same situation... We need the puzzles solved wether brute force or logic. Doesn't matter.

Here is a novel maths formula, the koru spiral. Name after the Māori creator, Te Kore, and it's time spiral, the koru.

koru spiral formula

r(theta) = sqrt(k * theta)

r = radius from centre
theta = polar angle in radians
k = structural expansion rate

k = 0.3299 (tau, natural expansion)
k = 5 (bridge prime, at theta=1, r=sqrt(5) births phi)

phi = (1 + sqrt(5)) / 2 = 1.618

discrete ring form:
r(m) = sqrt(m) where m is ring number
distance between rings: d(m) = sqrt(m+1) - sqrt(m) = 1 / (sqrt(m+1) + sqrt(m))
as m goes to infinity, d(m) goes to 0, rings tighten

compass koru (4 arms at 90 degree rotations):
east (0 degrees): r = sqrt(k * theta)
south (90 degrees): r = sqrt(k * (theta + pi/2))
west (180 degrees): r = sqrt(k * (theta + pi))
north (270 degrees): r = sqrt(k * (theta + 3pi/2))

arc length: L ≈ sqrt(k) * (2/3) * theta^(3/2)
swept area: A = (k/4) * (theta2^2 - theta1^2)
curvature: kappa ≈ 2 / sqrt(k * theta)

the spiral never revisits the same radius at the same angle. every position is unique
it is the shape of ferns, nautilus shells, and galaxies

Been using this with visualbtc, and gonna be testing an audio version of MrFreeDragons tool as well. The koru spiral formula isn't just for Bitcoin. It's applications may be endless just like it is... Free and available to the world

[kTimesG]

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

What I find to be most absurd , is some peoples absolute refusal to open their minds
to a broader meaning on what makes a wallet deterministic. I see nothing here that mentions
bip32, 39, 44, 85 ....I see a derivation scheme announced and then intentionally NOT defined.

Good catch. So you think that brute-forcing 70 bits is lame, and it's better to start attacking some 512 bits of BIP32 master key, or maybe some BIP39 derivation (all 256 bits x 2048 SHA-512 rounds each, assuming no passphrase), and then start iterating over all derivation paths, all accounts, etc. until we hit some sequence of 70 keys by xor-ing each sequence with all known solved keys (1 to 70), and assuming they also go ascending from some whatever child index, and assuming they were also used in order one after another to make the puzzle. Or maybe make it easier and derive the address of each encountered key and compare it to puzzle 256.

Yeah, this definitely works. What are you waiting for?

[cctv5go]

Three years on the puzzle, and nothing.Good luck to everybody.

[toshisa_toshisa]

Three years on the puzzle, and nothing.Good luck to everybody.

I’ve spent thousands of dollars on this puzzle and still have nothing to show for it. But I’m not giving up. Three years is a long time, but as long as there’s a chance, I’ll keep pushing. Good luck to everyone still searching never give up! 💪

[toshisa_toshisa]

I feel like the creator of the puzzle is here among us, posting his ideas and trying to find new methods, just like we are. Maybe he’s watching our progress and learning from the approaches we try. 😄

[zahid888]

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

What I find to be most absurd , is some peoples absolute refusal to open their minds
to a broader meaning on what makes a wallet deterministic. I see nothing here that mentions
bip32, 39, 44, 85 ....I see a derivation scheme announced and then intentionally NOT defined.
you could create a deterministic wallet with whatever formula or secret algo you want. As long as it creates consistently the same outputs it is deterministic by definition. reverse engineering progress comes from experimenting and scrutinizing everything, including certain new block  timestamps when converted to unix time  and observing / logging the results.  start at the end and unravel the steps to reveal the custom determinatory logic the creator used to generate keys before masking them to fit a given bitspace.

I agree with both of you.

The creator says there is no pattern and the keys come from a deterministic wallet, but that still doesn't tell us what the actual derivation scheme is. Deterministic doesn't necessarily mean BIP32/39/44, it could be any custom formula or method as long as it always produces the same result.

To be honest, I'm just getting bored with range based brute forcing, so I started playing around with SHA256 of known passwords, phrases or other public data for fun. I don't claim this is how the puzzle was made, maybe something interesting comes out of it.

We don't have a clear hint about the derivation and most of us don't have huge compute power, so I think trying different assumptions is better than doing only random brute force. At the end, it's just another way of looking at the puzzle until we get a better clue.

But the funny part is, after playing with this formula, I noticed something interesting... I seem to hit bigger prefixes much faster than with the usual range based sequential search  Maybe I'm onto absolutely nothing, but at least it's more fun to watch! 

[puzzle_72_worker]

I dissagree. I am testing new method that is showing the pattern. The space is reduced to 2^60 based on the pattern found.
In maximum 7 days i will tell you if this solution is finding the key or not.

All puzzles present a pattern, but you do not use the correct form of encoding for the bits.
This is the correct way: find the encoding form for the bits.