Download the self-contained lookup
Two A4 pages contain the complete 2,048-word English BIP39 list as a nested paper decision tree. Die one chooses page A or B; dice two through five drill down through the same six positions until one word remains.
Download Lookup PDFChoose a recording worksheet
Use the lookup for the first 11 or 23 words. The final row is reserved for the checksum-bearing word calculated with a verified offline tool.
Five rolls, one paper path
- 1Set the dice reading order before rolling. Do not choose the order after seeing the results.
- 2Roll five dice. A first roll of 1–3 selects page A; 4–6 selects page B.
- 3For each remaining roll, choose its position inside the current rectangle: 1/2 top, 3/4 middle, 5/6 bottom.
- 4Write down the final word and repeat. If the path reaches grey space, discard all five rolls and restart that word.
Why grey paths exist: five dice across two pages create 2,592 equally likely paper paths, while BIP39 contains 2,048 words. The unused paths must be rejected to keep every word equally likely. Rerolling only the final die introduces bias.
Calculate the final word offline
The last BIP39 word is partly fresh entropy and partly a SHA-256 checksum. The lookup deliberately does not pretend the first 11 or 23 words uniquely determine it. Use a trusted offline device or a verified standalone tool.
Original English tool inspired by David Hedqvist’s Bitcoin.se five-dice paper lookup.