Merkle Tally Tree

This is an implementation of Merkle Tally Tree in Rust. Merkle Tally Trees provide an efficent tally of an electronic vote. It scales to millions of votes, while still being able to prove efficently 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 witholding).

The reference documentation describes how proofs are designed.

See the whitepaper as part of the Blockchain Voting Techniques article of Bitcoin Unlimited.

Reference Documentation

Example

License

This project is MIT licensed.

Contact

This project is part of Bitcoin Unlimited. Join the Bitcoin Unlimited telegram channel.

Contributing

Merge requests welcome. It is suggested to contact project maintainer (dagurval) before making larger changes.