Merkle tree, merkle root and proofs
merkle_treeBuild a Merkle tree for an allowlist or airdrop and get the root and a proof per entry, OpenZeppelin-compatible: values ABI-encoded by types (address,uint256 for airdrops), double-keccak leaves, sorted pairs, so proofs verify with MerkleProof.verify and the dump loads in StandardMerkleTree.load. Up to 2,000 values; proofs for the first 256 or the one you ask for. Ready bytes32 leaves work too. Use to set up a claim contract or check a list. Price $0.01/call via x402 USDC or a card key (/credits), first 25 free; failed calls free. Reads or computes only and changes nothing; each call is charged, so repeats are not free.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| types | No | Solidity types of each row's fields, comma-separated (default: read from the rows: address,uint256 or address or bytes32 leaves) | |
| values | Yes | The entries: a JSON array of rows ([["0xabc…","100"],…]) or one row per line, fields comma-separated | |
| proofFor | No | Only the proof for this entry: its 0-based index or its first field (an address) |