Merkle Membership
Ex4-style membership: prove an element is in a set of leaves given only the Merkle root — the same shape as a rollup state tree, after the Pedersen / range demos.
Proof size is O(log n) (e.g. 1000 leaves → about 10 sibling hashes).
Leaves
Comma-separated list of values. Padded to next power of 2 with zeros.
Merkle root
—Generate Proof
Leaf value
—Sibling path
—Verify (Step-by-step)
Given (leaf, index, path, root), recompute up the tree.
—