Analysis updated 2026-07-17 · repo last pushed 2020-12-11
Run a simulated election with a configurable number of voters to see end-to-end verification in action.
Study how encrypted receipts let voters confirm their vote counted without revealing their choice.
Understand the Rabin-Rivest end-to-end verifiable voting design by seeing it implemented in code.
Use as a teaching example for cryptography or election-security coursework.
| keyan/e2e_voting | 0xallam/posthog | 0xustaz/streamgate | |
|---|---|---|---|
| Stars | 1 | 1 | 1 |
| Language | Python | Python | Python |
| Last pushed | 2020-12-11 | 2026-03-26 | — |
| Maintenance | Dormant | Maintained | — |
| Setup difficulty | moderate | moderate | hard |
| Complexity | 4/5 | 3/5 | 4/5 |
| Audience | researcher | pm founder | developer |
Figures from each repo's GitHub metadata at analysis time.
It's an educational Python simulation, not production-ready voting software.
A Python simulation of an end-to-end verifiable voting system, letting voters confirm their vote counted correctly while keeping their choice private.
Mainly Python. The stack also includes Python.
Dormant — no commits in 2+ years (last push 2020-12-11).
Setup difficulty is rated moderate, with roughly 30min to a first successful run.
Mainly researcher.
This repo across BitVibe Labs
Verify against the repo before relying on details.