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! 😅