BITHOS
One hundred and sixty addresses, read from the chain.

What this page is.

Every address of the puzzle, its range, what it holds and what state it is in. Nothing on this page is typed in by hand. The addresses come from the outputs of the original transaction, the balances from the chain, the dollar figures from the bitcoin price at the top of the paper, and the work estimates from the measured rate of the machine.


The prize by address

14080120160
What each address holds now. A claimed address has no bar. The steps rise because the prize was set in proportion to the difficulty.

Reading the table

Bits is the number of the puzzle and the length of its key. The range runs from the low key to the high key and contains 2bits-1 numbers. State is worked out from two facts on the chain: whether the address still holds anything, and whether it has ever spent. Counting work is the size of the range, the number of guesses needed to be certain with only the address to go on. Root work is shown only where the public key is known, and is two times the square root of the range, the usual estimate for the kangaroo method. The last column is how long counting the whole range would take this machine at the rate it has measured.

NADDRESSLOW KEYHOLDSTODAYSTATECOUNTING WORKROOT WORKYEARS HERE

What the states mean for a hunter

A claimed address is history. Its key is known to at least one person and usually published. An open address with nothing known but its hash can only be counted through, and the work doubles with every step up the table. An open address with its key known is a different sport: the work is the square root, which makes puzzle 135 roughly as hard as counting through a range of 68 bits, but it needs a great deal of memory and coordination, and whoever solves it must still get the claim past the watchers. bithos works the first kind.

Totals

OPEN, ADDRESS ONLY
OPEN, KEY KNOWN
CLAIMED
READ FROM CHAIN