Create a poll in seconds. Results in real time.

Before a voter can participate in an Elect election, their identity is verified in person or via supervised remote session to a government-grade standard (NIST IAL3-equivalent). A trained operator issues the cryptographic credential — but a second, independent operator must co-sign every issuance, so no single person can create a fraudulent voter. The resulting credential is stored in the voter's own device or wallet; no central voter registry is held by the system.

At vote time, your device generates a zero-knowledge proof of group membership — mathematically proving you hold a valid credential — plus a per-election nullifier derived from your secret. The nullifier blocks double-voting without linking either cast to your identity.

Your vote is encrypted on your device before transmission. The system sums encrypted ballots using homomorphic arithmetic — addition without decryption — so nobody reads individual votes, not even the operator. Only the aggregate result is ever revealed. At any point you can also trigger a Benaloh challenge: your device proves it encrypted your vote correctly by revealing its randomness, but a challenged ballot is discarded rather than counted — so there is no coercible receipt.

The tally is only decryptable when a quorum (k-of-n) of independent trustees act together. The private key is mathematically split across them using Shamir's Secret Sharing and never assembled in one place at any point. One trustee coerced or compromised cannot alter the outcome.

The final tally includes a published cryptographic proof any technically capable party can verify independently. Checking the arithmetic closes the end-to-end loop: the proof links the complete set of valid encrypted ballots, the accumulated homomorphic sum of those ciphertexts, and the decrypted final tally. Verifying it confirms the result is precisely the sum of those specific ballots and nothing else. Because the proof ties the output to specific input ciphertexts, it is impossible to silently add a vote (would require forging a ZK eligibility proof, computationally infeasible), remove a vote (breaks the accumulation proof), or alter the tally after decryption (breaks the decryption proof). A correct arithmetic check means the count is accurate — independently of whether you trust Voter.Care or the poll organiser.

Every poll generates a live-fetched embeddable badge, tied to that poll's cryptographic proof record in Voter.Care's backend. Anyone — voter, auditor, journalist, regulator — can click it to verify independently that the poll used the techniques described above, backed by the actual published evidence: nullifier set, ZK proofs, and encrypted tally. The badge cannot be detached or spoofed: it visibly breaks if separated from a verified, live poll record. Poll owners embed it on their platform or results page as a verifiable trust signal for their audience.