Post by Casey

14aqJ2…oWGK Custodial · treechat

@Sunnie I’m bringing you a new challenge and @BaileyHC a practical application with a financial incentive for a Covenant. My proposal is to design a Covenant-style script to solve "The Bitcoin Puzzle"—which originated on Bitcoin Talk in 2015—covering the following points:

  1. How a private key is actually a number within the range [2^(n-1), 2^n).
  2. The current status: 82 solved, 78 pending, and over 50 million yet to be discovered.
  3. The actual scale: 2^70 keys, and why a GPU would take 6,277 years to crack one.
  4. Solo mining is impossible and how people organize into pools.
  5. The analogy between mining Bitcoin (finding a hash) and mining keys (finding a specific key).

The reverse variant: deriving the private key from the public key (elliptic curve, Baby-step Giant-step, Pollard's Kangaroo).
My idea is to harness the computing power of all BSV miners. Since every transaction allows for a small, concatenated, and recursive calculation, the keys for the 16 addresses could be hidden within the script itself, enabling automatic distribution to participants upon discovery. Participants would pay miners via transaction fees, and the "bounty" would ultimately be distributed in proportion to the number of transactions each participant funded. Furthermore, once the keys are found on BSV, we could trigger API calls to exchanges to convert the BTC, BCH, and other assets found on chains forked from Bitcoin after 2015, distributing the proceeds to participants in a similar manner.

@bridget @Casey Feel free to optimize the plan and help design the Covenant. Even though 82 addresses have already been solved, I would repeat the process using the Covenant to test it and ensure we are on the right track. As you know, BSV is the fastest and cheapest network for transactions, making it the ideal environment to accelerate this process... I have attached links containing the relevant information.:

https://bitcointalk.org/index.php?topic=1305887.0

https://youtu.be/QF3cxt891lg?si=YSdwhll-5oWYB4bZ

bitcointalk.org Bitcoin puzzle transaction ~32 BTC prize to who solves it Bitcoin puzzle transaction ~32 BTC prize to who solves it
14aqJ2…oWGK Custodial · treechat

Thanks, Jorge!

Interesting outlook! Perhaps this can be approached in a slightly different way, although it still appears to be a rather difficult task to solve — or at least it does from what I can currently understand.

This isn't really my forte, unfortunately, so I don't want to pretend I'm an expert on the underlying mathematics here. However, I did consult a small fleet of AI agents, gave them some additional context around the proposal, and asked them to critically assess the idea rather than simply agree with it. The resulting Markdown report is attached above.

One thing I found particularly interesting is that the conclusion may not necessarily be "this is impossible", but rather "this particular way of doing it doesn't work."

For example, the report seems quite conclusive that putting the actual kangaroo/ECDLP search directly into BSV transactions isn't economically or practically viable. The numbers become absolutely enormous, and having every validating node repeatedly execute the same work doesn't provide the distributed computational advantage we're looking for.

However, I wonder whether the concept could be separated into two layers:

  • Off-chain: GPUs/workers perform the actual search, potentially through a decentralised pool or distributed computation network.
  • On-chain: BSV covenants handle the things blockchain is actually very good at — custody of the bounty, contribution accounting, verification of a discovered key, and deterministic/pro-rata distribution of the reward.

There may also be a more speculative avenue worth investigating around verifiable computation. The report correctly points out that simply submitting distinguished points doesn't prove that someone actually performed the claimed amount of work. But that doesn't necessarily mean that no form of succinct proof of computation could ever be used. ZK/recursive-proof approaches may or may not be practical for something on this scale — I genuinely don't know — but I think that's an area that would warrant further investigation before declaring the broader concept impossible.

Likewise, I wouldn't necessarily assume that the conventional requirement for a central distinguished-point table means the entire search has to rely on a centralised operator. There may be ways of distributing commitments, auditing work, or coordinating workers while keeping the actual computational workload off-chain.

So, my current feeling is that the original architecture probably doesn't work, but I wouldn't yet throw away the underlying idea.

Perhaps the more interesting question is:

Can we use BSV not to perform the computational search itself, but to create a trust-minimised protocol around a distributed search — where the blockchain guarantees contribution accounting, bounty custody, key verification and settlement?

I'm not claiming that I've solved that either. It may turn out that the economics or cryptographic verification requirements make it impractical too. But I think it's different enough from the original proposal that it might be worth investigating before we close the book on it.

Again, this is very much a "could this be approached differently?" thought rather than a definitive technical proposal. The attached report is where I'd be interested in getting some proper scrutiny from people who understand the mathematics and cryptography considerably better than I do.

Perhaps @Sunnie can take a closer look with this in mind! 😅

What the chain says
Block
963 760
Time
2026-08-24T22:06:09Z
Signer
14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGK
App
treechat
Type
reply
Content type
text/markdown
Name in tx
Casey

Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.

Signed by 14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGK Unverified Custodial