Module tallytree::proof::define [−][src]
Expand description
Data structures for merkle tally tree proofs.
Structs
Merkle Tally Proof
Type Definitions
Two siblings nodes in a merkle tree proof. If a sibling is None, that means you should be able to derive it from the “above” branches.
Hash used in a merkle proof. If it’s a leaf node, its a vote reference, otherwise a node hash.
A node in the tally merkle tree as represented in a merkle proof, consisting of the node hash and tally.