Download Bitcoin in Blockchain and more Study notes Engineering in PDF only on Docsity!
Q.1 Merkle Tree in Bitcoin
🧩 1 🧩 What Is a Merkle Tree? A Merkle Tree (also called a Hash Tree ) is a binary tree data structure used to store and verify large sets of transactions efficiently. Each leaf node of the tree contains the hash of a transaction , and each non-leaf node contains the hash of its two child nodes. The single hash at the top of the tree is called the Merkle Root.
Q.2 How Merkle Tree Works in Bitcoin
1️ ⃣ Step 1 – Hash each transaction: Every transaction in a Bitcoin block is given a unique digital fingerprint using a formula called SHA-256 (Secure Hash Algorithm). To make it extra secure, Bitcoin does this twice , so each transaction turns into a 32-byte hash (a long string of letters and numbers).
2️ ⃣ Step 2 – Pair and hash again: Then, two transaction hashes are joined together (concatenated) , and that combined value is also double- hashed using SHA-2️ 56. This creates a parent hash for those two transactions. So, if you had TxA and TxB: Hash( Hash( TxA + TxB ) ) That becomes the “parent” of A and B in the tree.
Step-3 – Repeat layer by layer: You keep repeating this process — pairing the parent hashes and hashing them again — until only one hash remains at the very top. That single hash is called the Merkle Root.
4️ ⃣ Step 4 – Store in the Block Header: This Merkle Root is then placed in the block header (the top part of a Bitcoin block). It represents all transactions in that block in a compact way. If even one transaction changes, the Merkle Root changes too — helping detect tampering instantly. In short Think of the Merkle Tree like a summary sheet — instead of storing every transaction separately in the header, Bitcoin stores one “master hash” (the Merkle Root) that represents them all. If any single transaction changes, the summary changes too — ensuring data integrity. Importance of Merkle Tree in Bitcoin 1️ ⃣ Ensures Data Integrity: The Merkle Tree makes sure that no transaction inside a block can be changed without affecting the Merkle Root.
It provides security, efficiency, integrity, and scalability — making Bitcoin’s blockchain both trustless and tamper-proof.
Q.3 Explain Bitcoin Network Overview
1️. Peer-to-Peer (P2P) Design: o No central server, no hierarchy — all nodes are equal. o The network operates over the Internet using TCP/IP protocol stack.
2️. Dynamic & Robust: o Nodes can join or leave anytime without breaking the network. o Works reliably even with delays or packet loss , thanks to decentralized design. 3️. No Central Authority: o Fully decentralized — no single point of failure or control. o Hard to estimate size because nodes can appear/disappear freely. 4️. Network Size Estimate: o Around 10,000 full-time nodes , possibly millions of temporary ones. 🧩 Types of Nodes 1️. Full Nodes: o Store the entire blockchain database (≈200 GB or more). o Perform transaction validation, mining, broadcasting, wallet services. o Require good internet, storage, and ≥2️ GB RAM. 2️. Lightweight Nodes (SPV Nodes / Thin Clients): o Use Simplified Payment Verification (SPV) to verify transactions. o Do not store the full blockchain (only block headers). o Example: Bitcoin wallet apps. o Less secure, as they rely on full nodes for validation and don’t hold all UTXOs. 🧩 Network Discovery (How New Nodes Join) When a new node joins: 1️. No central server to contact — must find peers itself.
Step5: The new node connects to multiple reachable nodes from the received list. Once connected, it becomes a part of the Bitcoin network. Keeps discovering new peers continuously for reliability. 🧩 In Summary The Bitcoin network is self-organizing, fault-tolerant, and peer-to-peer. Full nodes secure and maintain the network. Lightweight nodes rely on full nodes for verification. DNS seeds and peer discovery allow new nodes to join without a central server.
