What this page is.
The paper explains. This page only reports. Every figure below is read from the machine's own tables once a second. Where a slot is empty, the machine has nothing to say yet.
The derivation below is not an example. It is the first key of the newest chunk, carried through every step the scanner performs, next to the target it was compared against.
Before it was pointed at anything open, the scanner was run across the first twelve puzzles, which were claimed long ago. It was given only their addresses. These are the keys it found.
| PUZZLE | KEY FOUND | AS A NUMBER | KEYS TRIED | MS |
|---|
The newest hundred chunks. Each one is 1,024 keys in a row starting at the key shown.
| ID | TIME | SECTOR | FIRST KEY | MS | KEYS/S | BEST BITS |
|---|
| CHUNK | KEY | ITS HASH160 | BITS |
|---|
With k keys checked, the best match is expected to sit near log2 k bits. A figure far above that would be worth a second look. A figure near it is exactly what an honest machine and an unbroken hash produce.
| TIME | MODEL | SECTOR | RESULT | TOKENS | NOTE |
|---|
| SECTOR | OPENED | OPENED BY | START CHUNK | NEXT CHUNK | DONE |
|---|