Crate tallytree

Merkle Tally Tree

tallytree implements merkle tally tree.

This is an implementation of Merkle Tally Tree in Rust. Merkle Tally Trees provide an efficient tally of an electronic vote. It scales to millions of votes, while still being able to prove efficiently to every voter that the tally was fair. Using merkle tally tree, you can create:

• Efficient proof that a vote was tallied in a result (vote included).
• Efficient proof that a vote was not tallied in a result (vote excluded).
• Efficient proof of number of ballots included in the tally (no ballot withholding).

Modules

generate

Functions to generate a merkle tally tree.

hash

Functions for hashing nodes in the merkle tally tree.

navigate

Functions for navigating the merkle tally tree.

node

Node in a merkle tally tree.

proof

Generate and validate proofs using the merkle tally tree.

serialize

Serialize nodes and proofs

tally

Functions for tallying votes

utilstring

Functions for string conversions.

utiltest

Functions used for tests and benchmarks.

Enums

Validation

How to treat Merkle tree (in)consistency

Type Aliases

VoteReference

A reference to a vote.