Keccak Merkle Tree and Proof Builder

Choose this endpoint when you need to generate a Merkle tree and produce inclusion proofs compatible with Keccak-based Solidity verifiers (e.g. OpenZeppelin MerkleProof), particularly when you require indexed sorted-pair hashing, domain separation, and explicit odd-node promotion. Prefer this over rolling your own implementation when deploying airdrops, allowlists, or governance eligibility checks on EVM chains.

• Empty leaf list returns an error — at least one leaf is required
• Duplicate or malformed leaf values may cause unexpected tree structure
• Domain separator mismatch between builder and verifier will cause on-chain verification failure
• Very large leaf sets may time out or exceed payload limits
• Incorrect encoding of leaf values (hex vs raw bytes) leads to wrong root computation