← Knowledge Trees · Nestor G Pestelos Jr
Bitcoin Protocol Knowledge Tree
Prerequisite graph based on Satoshi Nakamoto's 2008 whitepaper: Bitcoin: A Peer-to-Peer Electronic Cash System.
Authoritative Backbone
Follows the 12 numbered sections of the original 2008 whitepaper. Each node represents a mechanism and testable mathematical or protocol capability, verifying how proof-of-work consensus removes the need for trusted intermediaries.
Phase 1 — The Problem & Chain of Ownership 2 / 2 Mastered
The Double-Spending Problem
Test: Explain why digital cash without a trusted third party requires solving double-spending, and why merchant reversibility costs matter.
Inspect Evidence
Transactions as a Chain of Digital Signatures
Test: Draw the chain-of-signatures diagram for 3 transfers; explain what a payee verifies and what signatures alone cannot prevent.
Inspect Evidence
Phase 2 — Ordering & Proof-of-Work 2 Mastered, 1 Frontier
Timestamp Server
Test: Explain how a hash-chain of timestamps proves data existed before a given point, and why each timestamp includes the previous one.
Hashcash-Style Proof-of-Work
Test: Explain how nonce-incrementing to find target-prefix hashes makes blocks costly to alter, and why difficulty retargets to fix block rate.
Inspect Evidence
One-CPU-One-Vote & Longest-Chain Rule
Test: Explain why proof-of-work solves the vote-counting problem in open broadcast networks, and why consensus power is economic weight rather than node count.
Inspect Evidence
Phase 3 — Network Operation & Incentives Locked
Network Steps & Fork Resolution
Test: List the 6 network steps in order and explain how simultaneous-block forks resolve when different nodes see different branches first.
Block Reward & Fee Incentive
Test: Explain the coinbase transaction's dual role (distribution and security incentive) and miner revenue once issuance ends.
Phase 4 — Scalability Mechanisms 3 / 3 Mastered
Merkle Tree Pruning
Test: Explain how Merkle roots allow old transaction data to be pruned while preserving block-hash integrity, and reproduce storage calculations.
Inspect Evidence
Simplified Payment Verification (SPV)
Test: Explain how lightweight clients verify transactions using headers and Merkle branches, and name the failure mode under attacker-controlled networks.
Inspect Evidence
Combining & Splitting Value (UTXO Model)
Test: Explain multiple inputs and outputs, change generation, and why transaction dependency trees remain manageable.
Inspect Evidence
Phase 5 — Security Calculations & Synthesis 1 Mastered, 2 Locked
Privacy Through Anonymous Public Keys
Test: Contrast Bitcoin privacy with traditional banking privacy; explain why key reuse across transactions leaks identity links.
Attacker Catch-Up Probability
Test: Compute or explain Gambler's Ruin q_z formula; specify why 6-confirmations convention assumes an attacker hashrate ceiling.
Inspect Evidence
Synthesis: Eliminating Trusted Third Parties
Test: Construct an argument synthesizing how signatures, proof-of-work, and economic incentives collectively remove trusted intermediaries.