Appendix Appendix C

Specimens and References

Every real-world anchor this book leans on, with the chapter where it appears. Items marked • are primary sources.

• Claude Shannon, A Mathematical Theory of Communication (Bell System Technical Journal, 1948) — entropy and the bit. (Chapter 4)
• John Tukey coined "bit" (1947); Christian Kramp introduced \(n!\) in Élémens d'arithmétique universelle (1808); the Chevalier de Méré's dice question to Pascal (1654) began probability theory. (Chapters 1, 2, 4)
• • Satoshi Nakamoto, on the Bitcoin client's random seed, BitcoinTalk forum (2010): performance counters, the OS entropy collector, mouse and disk timing. (Chapter 6)
• Cloudflare, "LavaRand in Production: The Nitty-Gritty Technical Details," The Cloudflare Blog (November 2017) — the wall of lava lamps in the San Francisco lobby, filmed for seed material. (Chapter 6)
• R. Landauer, "Irreversibility and Heat Generation in the Computing Process" (1961) — the per-bit energy floor. (Chapter 8)
• mempool.space network hashrate observations (2026) — the mid-2020s network grinding around \(10^{21}\) hashes per second (one zettahash). (Chapter 8)
• • palkeo, "How to steal Bitcoins" (March 2014), palkeo.com/code/stealing-bitcoin.html (now offline; archived at the Wayback Machine) — brainwallet sweeps seconds after funding; nearly 10,000 once-used phrase addresses; the private-key-1 address; a theft bot's on-chain comment. (Chapter 9)
• • Bitcoin.org, "Android Security Vulnerability" alert (11 August 2013) — the wounded SecureRandom, the affected wallets, the key-rotation response. (Chapters 9, 10)
• • fail0verflow, "Console Hacking 2010," 27th Chaos Communication Congress (December 2010) — Sony's static nonce and the recovered signing key. (Chapter 10)
• RFC 6979, T. Pornin, Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA) (August 2013) — the deterministic-nonce fix. (Chapter 10)
• BIP 39, M. Palatinus, P. Rusnak, A. Voisine, S. Bowe, Mnemonic code for generating deterministic keys (2013) — the wordlist, the checksum, the test vectors. (Chapter 11)
• The RockYou breach (December 2009) and the Imperva analysis Consumer Password Worst Practices (2010) — 32 million passwords, 123456 on top. (Chapter 5)
• • Unciphered's KeyBleed research (2023) — industrial-scale low-entropy key sweeps. (Chapter 9)
• • Bitcoin Stack Exchange #113432, "How much entropy is lost alphabetising your mnemonics?" (2022) — the half-billion-fold speedup for 12 sorted words; the 24-word margin. (Chapter 11)
• • Mempool fee-race observations (2024–2025), documented by watcher @mononautical and discussed in BitDevs Socratic Seminar notes — bots outbidding each other for coins landing on weak addresses. (Chapter 9)
• Companion volumes: The Curve That Powers Bitcoin (secp256k1, key derivation, ECDSA and Schnorr in full) and On Hashing (SHA-256, the birthday problem, the avalanche) — the two neighbor subjects this book deliberately touches only at cross-reference depth. (Chapter 7; the curve volume returns in Chapter 10)