Merkle Trees: Pairing Hashes Level by Level, the Odd Leaf, the Root and a Proof Path
This lesson is part of the course
In this lesson
You build a Merkle tree over six transaction hashes, pair the odd node with itself, compute the root and walk a three-step proof that Tx 5 is in the block without looking at the other transactions.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- A Shared Ledger: Balances from a Transaction Log, Running Balances in Order and Double Spends Locked
- Toy Hashes & Chained Blocks: MOD Hashes, Previous-Hash Links and Spotting a Tampered Block Locked
- Merkle Trees: Pairing Hashes Level by Level, the Odd Leaf, the Root and a Proof Path Locked
- Proof-of-Work: Targets, a Given Nonce Table, the First Valid Nonce and Expected Tries Locked
- Difficulty Adjustment: Actual vs Target Block Times over a Window and a Clamped New Difficulty Locked
- Unspent Outputs: Wallet Balances, Spending Whole Outputs, Change and the Implied Fee Locked
- Fee Markets: Fee Rates, Ranking the Waiting Pool, Packing a Block and Waiting Blocks Locked
- Capstone – Issuance & Costs: Halving Rewards, Cumulative Supply, Reward Value vs Energy Cost and a Chart Locked