Hashing, Key Derivation and Cryptographic Primitives
Click on each step to reveal the cryptographic processes and roles.
Concept: Key Generation & Encoding. High-entropy random data (128-256 bits) is generated and encoded into human-readable words (12-24 words) using a standard dictionary. This provides a user-friendly backup. The mnemonic is then converted into a 512-bit seed via PBKDF2 (key stretching).
Generation (BIP-39): Creating raw entropy from a true random number generator. It happens once.
Derivation (BIP-32/44): Deterministically calculating mathematical child keys from a master parent key using hash functions. If you have the parent, you can always recover the children.
Public-Key Crypto (secp256k1): Asymmetric cryptography. It works in pairs (Private/Public) and allows digital signatures. Reversing is hard due to ECDLP, but structured.
Hashing (Keccak-256): A one-way algorithmic grinder. Takes any input and destroys structure to produce a fixed-length output. Used to hide the public key.
Encoding changes the format of data for representation (e.g., Hexadecimal `0x` turns bits into readable characters). A Checksum (EIP-55) introduces redundancy to detect errors: it uses the Keccak hash of the address itself to capitalize certain letters, ensuring a typo immediately invalidates the address.
While historically related, they are not identical.
Why not use one algorithm? Because each step solves a different problem with specific statistical requirements: