Question 1

What is a Merkle tree?

Accepted Answer

A Merkle tree is a hash-based data structure where each leaf is a hash of data and each non-leaf node is a hash of its children. The root hash uniquely represents all the data. It is widely used in blockchain for efficient and secure verification of large data sets.

Question 2

What is a Merkle proof?

Accepted Answer

A Merkle proof is a set of hashes that allows you to verify that a specific piece of data is part of the tree without needing to know the entire tree. You only need the sibling hashes along the path from your leaf to the root.

Question 3

How is this used for airdrops and whitelists?

Accepted Answer

Projects compute a Merkle tree from a list of eligible addresses. The Merkle root is stored on-chain. Users can claim by providing a Merkle proof that their address is in the tree, which the smart contract verifies efficiently.

Question 4

What hash function is used?

Accepted Answer

This tool uses SHA-256 via the Web Crypto API (crypto.subtle). For Ethereum-style Merkle trees, keccak256 is typically used, but SHA-256 provides a good general-purpose demonstration.

머클 트리 생성기

머클 트리 생성기 사용 가이드

머클 트리란?

에어드랍/화이트리스트 활용

FAQ

Related Tools

Also Used Together