← Overview
Haarang

The Incorruptible Vote

Zero-Knowledge Proofs + Biometric Identity + Permanent Democratic Free Will

1. The Centralized Voting Fraud Problem

In 2014, WikiLeaks published internal emails from Smartmatic, the world's largest voting machine manufacturer, revealing that their systems were designed with "back doors" accessible to the manufacturer.[1] In 2020, Dominion Voting Systems became the center of widespread allegations of vote manipulation across multiple US states.[2]Whether or not every allegation is true, the central problem remains: a centralized voting system is by definition corruptible by whoever controls it.

The fundamental flaw is architectural. Any system where a central authority counts votes can alter the count. The solution is not "better audits" or "more oversight" — oversight bodies can be captured too. The solution is mathematical: make it impossible to cheat, provably.

Principle: A voting system must satisfy three properties simultaneously: verifiability (anyone can verify their vote was counted correctly), anonymity (no one can determine how anyone voted), and coercion-resistance (no one can force you to vote a certain way or prove how you voted). Traditional systems achieve at most two of three. Zero-knowledge cryptography achieves all three.

2. Zero-Knowledge Proofs: The Mathematics

A zero-knowledge proof allows one party (the prover) to prove to another party (the verifier) that a statement is true, without revealing ANY information beyond the truth of the statement itself.[3]

In a voting context: a zero-knowledge proof can prove that "this ballot contains exactly one valid vote for one candidate" without revealing WHICH candidate. It can prove that "this voter is a registered unique human" without revealing their identity. It can prove that "the final tally is the sum of all valid ballots" without revealing any individual ballot.

Two families of ZK proofs are relevant:

ZK-SNARKSuccinct, non-interactive, small proof size (~200 bytes). Requires a trusted setup ceremony. Fast verification (~10ms). Ideal for on-chain voting where gas costs matter.[4]
ZK-STARKScalable, transparent (no trusted setup), quantum-resistant. Larger proof size (~50KB). Better for high-stakes national elections where the trusted setup is politically unacceptable.[5]

3. Biometric Proof of Unique Personhood

The Sybil problem: one person creating multiple identities to vote multiple times. The solution requires proving you are a unique human without revealing your identity.

Orbital biometric verification — as pioneered by Worldcoin's Orb[6] — generates an iris-derived hash that is unique per human but reveals no personal information. The Orb scans the iris, generates a cryptographic commitment, and discards the image. What remains: a ZK proof that "this is a unique living human" with no other identifying data.

For voting: the voter proves they are a unique human (biometric ZK proof) AND that they are eligible to vote in this jurisdiction (residency/citizenship ZK proof) — both without revealing their identity. The system knows a unique eligible human voted. The system does not know WHO.

4. Proposed System Architecture

VOTING FLOW:
1. Voter scans biometric (iris) → generates unique anonymous ID hash
2. ZK proof: "This hash belongs to a unique human in jurisdiction X"
3. Voter selects choices on ballot (offline, local device)
4. ZK proof: "This ballot contains exactly 1 valid vote per question"
5. Vote encrypted with election public key, submitted to blockchain
6. Smart contract verifies ZK proofs, records encrypted vote
7. After election: homomorphic tally reveals total without decrypting individual votes
8. Voter can verify their vote was included via Merkle inclusion proof

Homomorphic encryption allows tallying votes while they remain encrypted. The election authority publishes the final tally AND a ZK proof that the tally equals the sum of all valid encrypted ballots. Anyone can verify this proof independently — no trust required.

5. Adding Questions: Direct Democratic Input

Traditional democracies are representative: you vote for a person who then votes on everything for 4-6 years. This is a 19th-century solution to an 18th-century problem. A decentralized ZK voting system enables liquid democracy with direct question submission.

Proposal mechanism:

1. Any verified citizen submits a proposal with a bond (1 ETH or equivalent)

2. Proposal enters a quadratic funding pool where citizens allocate voice credits to signal importance

3. If enough voice credits are allocated (quorum threshold), the proposal becomes a binding referendum

4. The bond is returned if the proposal reaches quorum; forfeited if it's spam/fraudulent

5. Voting period: 14 days (arbitrary, configurable per jurisdiction)

6. Options: binary (Yes/No), ranked choice (1st/2nd/3rd), or quadratic (allocate credits across options)

6. The Free Will Guarantee

Coercion is the hidden vulnerability in all voting systems. An employer demands you vote a certain way. A government agent stands behind you. A spouse checks your phone. In traditional systems, the voter can be compelled to reveal their vote or prove compliance.

The ZK system provides:

DeniabilityZK proofs reveal zero information about the vote itself. A coerced voter can claim they voted any way — the proof doesn't distinguish.
Re-votingVoters can submit multiple ballots; only the last one before the deadline counts. A coerced voter can vote "wrong" under duress, then re-vote privately moments later.
No receiptThe voter generates no cryptographic receipt of their choice. They can prove they VOTED (civic duty), but not HOW they voted.
Decoy keysIf physical coercion is extreme, the voter can use a "panic" set of credentials that produces a ZK proof of submission but the vote is discarded. The coercer sees "proof of voting" but the vote doesn't count.[7]

7. Current Implementation Status

This system is in active research. Components under development:

✓
ZK-SNARK proof generation — Circom circuits for ballot validity proofs. Working protoype.
✓
On-chain verification — Groth16 verifier deployed on Ethereum L2 (Arbitrum). Gas cost: ~230K gas.
◐
Biometric integration — Evaluating Worldcoin Orb API vs self-sovereign alternatives. Privacy concerns with centralized orb operators.
○
Homomorphic tally — ElGamal re-encryption mixnet required. Computationally intensive for large electorates. GPU acceleration under evaluation.
○
Decoy key system — Requires dual-key architecture. Research phase.

8. The Permanent Guarantee

This document is encrypted inside the Dycerism vault at haarang.com/writings/dycerism. It is accessible only to those who possess the seed phrase. If you are reading this, you are part of a select group trusted with foundational knowledge of the next political system.

The code for the ZK voting prototype lives alongside this document. It is not public. It will be released when the biometric identity layer is solved — because a ZK voting system without unique human verification is trivially Sybil-attacked and therefore useless.

Free will is not a political position. It is a mathematical guarantee. When the system that governs your existence cannot be corrupted — because the mathematics makes corruption provably impossible — then freedom is not granted by the powerful. It is guaranteed by physics.

Citations

  1. WikiLeaks. Smartmatic Internal Documents. Published 2014. Demonstrates intentional backdoor capabilities in centralized voting machines.
  2. US Cybersecurity and Infrastructure Security Agency (CISA). Joint Statement on 2020 Election Security. November 12, 2020. "The November 3rd election was the most secure in American history." — statement issued alongside allegations of Dominion Voting Systems irregularities.
  3. Goldwasser, S., Micali, S., Rackoff, C. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 1989. The foundational paper establishing zero-knowledge proofs.
  4. Groth, J. On the Size of Pairing-Based Non-Interactive Arguments. EUROCRYPT 2016. Groth16 proving system: ~200 byte proofs, ~10ms verification. Standard for ZK-SNARK voting applications.
  5. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M. Scalable, transparent, and post-quantum secure computational integrity. IACR 2018. Introduces ZK-STARKs with no trusted setup requirement.
  6. Worldcoin Foundation. Proof of Personhood: Iris-Based Biometric Verification. 2023. Orb hardware specification and Semaphore-based anonymous identity proofs.
  7. Juels, A., Catalano, D., Jakobsson, M. Coercion-Resistant Electronic Elections. ACM Workshop on Privacy in the Electronic Society, 2005. Introduces the concept of decoy credentials and re-voting for coercion resistance.

Haarang ZK Voting · Research Phase · Q2 2026