Voters may vote 0 or 1. We want to aggregate their votes, proving runs efficiently $O(n)$ in number of votes but verifying runs $O(1)$ or $O(\log n)$. Voting has to be cryptographically secure - no double voting. Is there a way to return a tally of the votes for 1 and 0?