Info about a POD entry for inclusion in a ZK circuit. The proof
is always a proof for the entry's name, while the entry's
value can be found as the first sibling. Every entry has a name hash
and value hash as included in the Merkle tree. The plaintext value
is only included for numeric values which can be directly represented
in a single circuit signal.
Info about a POD entry for inclusion in a ZK circuit. The proof is always a proof for the entry's name, while the entry's value can be found as the first sibling. Every entry has a name hash and value hash as included in the Merkle tree. The plaintext value is only included for numeric values which can be directly represented in a single circuit signal.