There is a factor known as “Bitcoin Puzzles” the place somebody (nameless) has positioned comparatively giant quantities of bitcoin beneath non-public keys and publicly marketed that these keys are mostly-all-bits-zero. So the sport is to find the mostly-zero non-public key by brute pressure, after which declare the bitcoin.
However after all claiming the bitcoin requires submitting a transaction to the pool, and that transaction goes to incorporate the corresponding public key; and (for math causes I’ve not investigated personally) if the general public key then the problem of brute-forcing the non-public key goes from 2^{ok} all the way down to one thing like 2^{ok/2} — i.e., instantaneous, for the variety of nonzero bits we’re speaking about in these puzzles.
So, when Bitcoin Puzzle #66 was lately solved, it was rapidly rumored that what had actually occurred was:
Idea #1, the intelligent bot
- Some poor man spends years brute-forcing a 66-bit non-public key.
- He submits a transaction, together with the general public key, asking for six.6BTC to be transferred from the prize deal with to himself.
- Some random bot has been watching the pool for years for precisely this second. The bot takes just a few tens of seconds to brute-force the now-effectively-33-bit non-public key, and submits its personal transaction consuming the identical enter however with a better transaction charge
- The bot’s transaction thus replaces the poor man’s transaction, and is mined, giving the prize cash to the bot. Poor man spent years of brute-force time for nothing.
However after all there are at the least two competing theories:
Idea #2, the boring one
- Some man spends years brute-forcing a 66-bit non-public key. He submits the transaction; no one front-runs him; he simply made $400,000. The tip.
Idea #3, the puzzlemaster cheated
- The nameless puzzlemaster, who is aware of all of the non-public keys by definition, might have submitted his personal transaction to take out the cash at any time (say, to purchase one other home). That will look the identical as if anybody else brute-forced the puzzle legitimately; so so far as proof goes, Idea #3 is indistinguishable from Idea #2.
The entire Bitcoin Puzzle addresses are (apparently) listed right here:
https://privatekeyfinder.io/bitcoin-puzzle
That is the deal with for Bitcoin Puzzle #66:
https://www.blockchain.com/explorer/addresses/btc/13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
And that is the profitable transaction (IIUC):
https://www.blockchain.com/explorer/transactions/btc/57a88f47e4c047740b782a5562fca143ce85de0373cbff3a7d406e9ae7fc2f5f
My query is, Is there any “bodily proof” remaining that may corroborate which concept is right? Particularly, if there have been one thing like blockchain.com/explorer for unconfirmed transactions, then we might have a look at it and say “Oh, that is attention-grabbing; an unconfirmed transaction towards the prize deal with at 18:57:00 with a 50000-sat charge, adopted by one other unconfirmed transaction at 18:59:20 with a 75000-sat charge, after which a confirmed transaction at 18:59:39 with a 76400-sat charge, after which a number of extra invalid transactions within the 5 minutes after that.” — That would be sturdy proof for Idea #1 (IIUC); however so far as I do know, there is not any public (or dependable non-public) file that may have the ability to present that type of data — proper?
…Truly, I simply discovered this stacker.information story, which factors to an unconfirmed transaction 8c8ec6b and hyperlinks to a web page on mempool.house/tx as corroboration of Idea #1. That web page is… nicely, it is gone now. And it was by no means archived by the Wayback Machine nor by archive.is. So I assume I may be asking whether or not there’s some other historic file of the knowledge ephemerally obtainable on mempool.house; or maybe some subset of such data “of historic curiosity.”