Bengali Typing - Merkle Tree

Merkle Tree is a binary hash tree used in blockchain to efficiently summarize and verify large sets of transactions within a block.

Core Explanation (Exam-Focused)

1. Hierarchical Structure
   Transactions are hashed and paired recursively to form a tree.

2. Merkle Root
   The final top hash represents all transactions in the block.

3. Efficient Verification
   Allows verification of a single transaction without downloading the full block.

4. Data Integrity
   Any change in a transaction alters the Merkle root.

5. Logarithmic Proof Size
   Verification requires only a small number of hashes.

6. Tamper Detection
   Unauthorized changes are easily detectable.

Role in Blockchain

• Stored in block headers

• Enables light node verification (SPV)

• Improves scalability and efficiency

Example

• Used in Bitcoin and Ethereum blocks to verify transactions.

One-Line Definition (Exam Use)

A Merkle tree is a cryptographic data structure that efficiently verifies and summarizes transactions in a blockchain block using hash-based hierarchies.