What is Merkle Tree?
Merkle Tree คือโครงสร้างข้อมูลที่บีบชุดบันทึกขนาดใหญ่ให้เป็น fingerprint สั้นๆ มันทำให้คุณพิสูจน์ได้ว่าสินทรัพย์อยู่ในรายการขนาดใหญ่อย่างไรด้วยการตรวจสอบเพียงส่วนเล็กๆ ไม่ใช่ทั้งหมด ลองนึกถึงตระกูลที่พ่อแม่แต่ละคนสรุปสืบเชื้อสายของบุตรทั้งหมด แล้วล้วนมารวมเป็นบรรพบุรุษสุดท้ายหนึ่งคน
Merkle Tree “stores” all the transactions itself. Not quite. It stores only compact fingerprints of them, and the tree can be rebuilt from the raw records whenever needed.
How Merkle Tree works
Imagine a block of payments that needs a quick, verifiable summary. Here’s the Merkle Tree play in plain talk:
- Step 1: Start with a list of items like transactions, each one a leaf in the tree.
- Step 2: Turn each item into a short fingerprint using a hash function.
- Step 3: Pair adjacent fingerprints, mash each pair together, and hash again to create their parent.
- Step 4: Repeat the pairing and hashing ladder until a single top fingerprint remains. That’s the Merkle root of this set.
- Step 5: To prove one item is in the set, you only need that item plus a short path of sibling fingerprints. Quick and tiny.
That’s the idea: small proofs, big confidence.
Why Merkle Tree Matters
By summarizing huge piles of transaction data into one compact fingerprint, Merkle Tree makes verification fast and cheap.
- Benefit: You can check inclusion without downloading the whole block, saving time and bandwidth.
- Perspective: It fits the mood of the internet right now: trust but verify, Rolex meets Reddit threads.
- Relevance: You’ll bump into it in Bitcoin blocks, Ethereum receipts, NFT allowlists, airdrops, and rollups.
If the number of leaves is odd, many designs duplicate the last one before hashing up the tree. Also, double check the exact hashing process your chain or library uses, since tiny rule differences can change proofs.
Key Characteristics of Merkle Tree
Here’s what makes it special and handy:
- Efficiency: Proofs stay small even as the data set grows huge, so light clients stay light.
- Integrity: Change one byte in a leaf and the change ripples to the top, making tampering obvious.
- Root: Everything collapses into a single Merkle root that can be stored or signed for later checks.
Variations
Merkle Tree has a few popular flavors you’ll bump into:
- Binary: The classic pair based tree, used in Bitcoin blocks.
- Merkle Patricia: A trie based take for key value data, used in Ethereum state and receipts.
- Sparse: A huge indexed tree where most leaves are empty, great for succinct membership and non membership proofs.
- Verkle: A newer cousin with shorter proofs for very large branching, explored for future upgrades.
Merkle Tree proofs are only as trustworthy as the header or checkpoint you accept. If you trust the wrong root, the cleanest proof still says nothing.
Example
A Bitcoin style light wallet can verify your payment by checking a short path of hashes from your transaction up to the block header, without downloading the whole transaction history.
Fun Fact
Ralph Merkle sketched this idea in the late seventies as a student project, and it sat in academic circles for years before Satoshi used it in Bitcoin. Proof that good ideas age well.
Wrap-Up
Bottom line? Merkle Tree gives you quick, tiny proofs that something belongs in a big set, no drama, no heavy downloads.