Tech deep dive · On the roadmap
Bloom Filters
How light clients probabilistically request relevant transactions without revealing which addresses they own.
This page isn’t written yet. It’s on the roadmap.
Read now
Live content on this subject, available today.
More planned in Cryptographic Primitives
- Planned
How Hashing Works
What a cryptographic hash is, how SHA-256 digests a block, and why the avalanche effect makes hashes tamper-evident.
- Planned
Nonces & Mining Math
The nonce field, the astronomical odds of finding a valid hash, and why miners iterate quintillions of guesses.
- Planned
Merkle Trees
How hashing transactions into a tree yields a compact root, and how SPV wallets prove inclusion without the full block.
- Planned
Merkle Patricia Tries
Ethereum's state structure — how Merkle tries store accounts, storage, and receipts and enable fast state proofs.
- Planned
Hash Commitments & Preimages
How committing to a hash hides a value until reveal, and where commitments underpin protocols and proofs.
- Planned
Key Derivation (BIP32/39/44)
From mnemonic seed to master key to child keys — the HD wallet derivation paths behind every modern wallet.
- Planned
The Quantum Threat
How Shor's and Grover's algorithms threaten ECDSA and hashes, and the post-quantum signature migration ahead.