Blockchain Study Guide

📖 Core Concepts Blockchain – a distributed digital ledger where each block contains a cryptographic hash of the previous block, a timestamp, and transaction data (often stored as a Merkle tree). Hash linking – the hash of block i‑1 is included in block i; changing any data forces all later hashes to change, making retro‑active edits practically impossible. Consensus algorithm – the rule set (e.g., Proof‑of‑Work, Proof‑of‑Stake) that nodes use to agree on the next valid block. Public vs. Private (permissioned) chains – public chains are open to anyone for reading, writing, and validating; private chains restrict participation to approved entities. Finality – the degree of confidence that a block will never be reverted; PoW/P​oS give probabilistic finality (deeper = safer), some PoS designs claim absolute finality once a super‑majority of validators sign. 📌 Must Remember Genesis block – the first block (Block 0) with no predecessor. Block time – average time to create a block (≈ 10 min for Bitcoin, 14‑15 s for Ethereum). 51 % attack – when an entity controls > ½ of the network’s hashing (PoW) or stake (PoS) power, enabling double‑spending. Hard fork – a non‑backward‑compatible protocol change that splits the chain; all nodes must upgrade to stay on the new chain. Orphan block – a valid block that is not part of the main chain because another competing block was chosen. Merkle root – single hash summarizing all transactions in a block; enables efficient inclusion proofs. 🔄 Key Processes Block creation (PoW) Gather pending transactions → compute Merkle root. Build block header (previous hash + Merkle root + timestamp + nonce). Vary the nonce until hash(header) < target difficulty. Broadcast the new block; network validates and adds it to its chain. Block creation (PoS) – Validators lock up stake. A deterministic or random selection picks a proposer. Proposer creates block, other validators attest (sign). Once a super‑majority attests, the block is finalized. Fork resolution When two blocks appear at the same height, nodes follow the longest‑chain rule (most cumulative difficulty). The losing block becomes an orphan; its transactions are returned to the mempool. Finality increase Each additional block added on top reduces the reversal probability: $$P{\text{reversal}} \approx \left(\frac{q}{p}\right)^{z}$$ where p = attacker’s share of hash power, q = honest share, z = number of confirming blocks. 🔍 Key Comparisons Public vs. Private blockchains Public: permissionless, open participation, economic incentives (e.g., Bitcoin). Private: permissioned, access controlled, often used for enterprise supply‑chain or finance. Proof‑of‑Work vs. Proof‑of‑Stake PoW: security via computational work, high energy use, probabilistic finality. PoS: security via locked stake, low energy, can achieve (near) absolute finality. Hard fork vs. Soft fork Hard fork: protocol change not backward compatible → chain splits if not all upgrade. Soft fork: backward compatible; non‑upgraded nodes still recognize new blocks as valid. ⚠️ Common Misunderstandings “Blockchain = Bitcoin” – blockchain is a generic data‑structure; many non‑financial applications exist (supply‑chain, identity, etc.). “Transactions are instant” – confirmation depends on block time and number of confirmations; Bitcoin can take > 10 min per block. “Proof‑of‑Stake eliminates all attacks” – PoS still faces attacks (e.g., nothing‑at‑stake, long‑range attacks) if protocol design is weak. “Orphan blocks are lost forever” – they may be re‑included in a later block if still in the mempool. 🧠 Mental Models / Intuition Chain as a linked list of “tamper‑evidence stamps” – each block’s hash is a stamp proving the entire history up to that point. Consensus as “crowd voting” – nodes collectively pick the version of history that the majority (or weighted majority) agrees on. Finality as “depth of snow” – the deeper a block is buried under newer blocks, the harder it is for a blizzard (attacker) to uncover it. 🚩 Exceptions & Edge Cases Hybrid blockchains – combine public validation with private data access; not purely permissionless nor fully closed. Sidechains – run their own consensus; assets move between main chain and sidechain via lock‑unlock contracts, which can introduce bridge vulnerabilities. Lightweight blockchains for IoT – sacrifice full decentralization for speed; may rely on a small validator set. 📍 When to Use Which Choose PoW when you need maximum proven security and are willing to accept high energy cost (e.g., Bitcoin‑style store of value). Choose PoS for new platforms requiring scalability, lower energy, and faster finality (e.g., Ethereum 2.0, Cardano). Public chain when openness and censorship resistance are essential (cryptocurrencies, decentralized apps). Private/Consortium chain for enterprise contexts needing data privacy, compliance, and controlled participation (supply‑chain, banking). Sidechain when you need custom features or higher throughput without overhauling the main chain. 👀 Patterns to Recognize “Longer chain = correct chain” – look for cumulative difficulty or stake weight, not just the number of blocks. “Merkle proof = inclusion proof” – a small set of sibling hashes can verify a transaction’s presence without revealing the whole block. “Fork after protocol upgrade” – hard forks often coincide with major feature releases (e.g., Ethereum’s “The Merge”). “Energy‑heavy = PoW” – statements about massive electricity consumption signal a PoW system. 🗂️ Exam Traps Distractor: “Private blockchains are completely decentralized.” – they are permissioned and typically have fewer nodes, reducing decentralization. Misleading choice: “Hard forks always improve security.” – a fork can split the community and reduce hash power, temporarily weakening security. Trap: “Finality means a block can never be reorganized.” – most PoW/P​oS systems offer probabilistic finality; only certain PoS designs claim absolute finality. Confusing “orphan” with “stale” – orphan blocks are valid but not in the main chain; stale blocks may be invalid due to consensus rules. Incorrect formula for reversal probability – forgetting to raise the attacker‑to‑honest hash‑power ratio to the power of the number of confirmations. --- Study tip: Review the Core Concepts first, then practice Key Processes with a simple block‑creation example (both PoW and PoS). Use the Comparisons and Exam Traps to test yourself with multiple‑choice style questions. Good luck!