Merkle proof of an entry's membership in a POD. The entry proofs returned
by this class are always proofs for the entry's name, while the entry's
value can be found as the first sibling.
POD proofs use the Lean-IMT datastructure from @zk-kit/imt, which allows
shorter proofs for partially-filled subtrees.
Merkle proof of an entry's membership in a POD. The entry proofs returned by this class are always proofs for the entry's name, while the entry's value can be found as the first sibling.
POD proofs use the Lean-IMT datastructure from @zk-kit/imt, which allows shorter proofs for partially-filled subtrees.