This project runs two independent search strategies against the Bitcoin puzzle addresses below. Keraunos (kangaroo-based discrete-log search) can only target a puzzle whose public key is already exposed on-chain. Potamos (sequential range scan) doesn't need that, so it can work any puzzle in the list regardless of whether Keraunos also can -- a puzzle can be searched by one, the other, or both at once. Ranges searched are intentionally not published; only aggregate progress is shown.
| Puzzle | Address | Status | Distinguished points found | Estimated keys searched (all hosts combined) | Estimated progress | Contributing hosts |
|---|---|---|---|---|---|---|
| #140 | 1QKBaU6WAeycb3DbKbLBkX7vJiaS8r42Xo | searching | 14,433 | 968,582,234,112 | <0.01% | 40 |
| Puzzle | Address | Status | Completed chunks | Estimated keys searched (all hosts combined) | Progress | Contributing hosts |
|---|---|---|---|---|---|---|
| #71 | 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU | searching | 1,414 | 6.07 trillion | <0.01% | 28 |
These are aggregate statistics (distinguished-point spacing for Keraunos, completed-chunk counts for Potamos), not exact range maps, and deliberately don't reveal which sub-ranges have been covered.