REVIEW 3 major objections 2 minor 10 references
Electric Democracy: Proof of Work to secure Elections
T0 review · 3 major / 2 minor · reviewed 2026-05-24 · grok-4.3
Pith's one-line read Proof of work on voter devices creates a zero-trust electronic voting system where the state issues only single-use authorizations.
desk verdict This is a high-level sketch applying Proof of Work on voter devices to elections but supplies no analysis or mechanisms to support the zero-trust or usability claims. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Proof-of-work algorithm executed on user devices, combined with cryptographic primitives, to enforce single-use authorizations and zero-trust properties.
What would settle it
A documented case in which an attacker forges or alters votes despite the proof-of-work requirement, or a field test showing that a substantial fraction of eligible voters cannot complete the proof-of-work step on their devices within acceptable time and energy limits.
Extended reading notes
Core claim
By running a proof-of-work algorithm at the voter’s device together with standard security primitives, the protocol establishes a zero-trust election environment in which the state supplies only single-use authorizations; the remainder of the voting process occurs on an open-source, publicly observable platform.
Load-bearing premise
Running proof of work on ordinary consumer devices will simultaneously satisfy the required security properties, remain usable for most citizens, and avoid creating new attack surfaces or excluding large groups of voters.
Editorial extensions
If this is right
- Elections can be conducted entirely on an open-source platform with continuous public observability.
- The state’s role is reduced to issuing single-use authorizations, limiting opportunities for outcome manipulation.
- Higher frequency of plebiscites becomes feasible because the system removes many logistical barriers of traditional voting.
- The zero-trust property allows any interested party to verify the process without relying on the integrity of election officials.
Reading between the lines
- The same device-based proof-of-work pattern could be adapted to other collective decision processes that currently require trusted intermediaries.
- Device heterogeneity might still create participation gaps even if average usability appears acceptable.
- Integration with existing public-key infrastructure for authorization issuance would be a natural next engineering step.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a zero-trust electronic voting system in which the state issues single-use voting authorizations to citizens while users execute a Proof of Work algorithm on their own devices; these are combined with other security primitives to enable elections on an open-source platform with enhanced observability, addressing principal-agent problems in traditional voting and potentially increasing policy-making participation.
Significance. If substantiated, the approach could offer a novel way to mitigate security shortcomings in electronic voting by leveraging local computation and minimal state involvement. However, the manuscript contains no security analysis, threat model, or evaluation, so no positive significance can be assigned. The work does not ship machine-checked proofs, reproducible code, or falsifiable predictions.
major comments (3)
- [Abstract] Abstract: the central claim that PoW on user devices plus single-use authorizations yields zero-trust properties (preventing double-voting, coercion, or forgery) is unsupported; the text supplies neither a threat model nor any mechanism showing how PoW output is bound to or verified against the authorization.
- [Abstract] Abstract: the usability and accessibility assertions rest on the unexamined assumption that PoW can run acceptably on ordinary devices without introducing new attack surfaces or excluding portions of the electorate; no analysis of energy cost, hardware variance, or botnet risks is provided.
- [Abstract] Abstract: the description of the open-source platform and its observability properties contains no integration details, verification protocol, or comparison to the security already provided by the single-use authorization primitive alone.
minor comments (2)
- [Abstract] Abstract: 'heighten availability' should read 'heightened availability'.
- [Abstract] Abstract: the mention of the 'principal-agent problem' is not connected to any concrete mitigation in the proposed design.
Simulated Author's Rebuttal
We thank the referee for their review. The manuscript offers a high-level conceptual design rather than a fully specified protocol with proofs or evaluations. We address each major comment below and indicate where revisions will be made.
read point-by-point responses
-
Referee: [Abstract] Abstract: the central claim that PoW on user devices plus single-use authorizations yields zero-trust properties (preventing double-voting, coercion, or forgery) is unsupported; the text supplies neither a threat model nor any mechanism showing how PoW output is bound to or verified against the authorization.
Authors: The design intends single-use state-issued authorizations to directly prevent double-voting and forgery by construction, as each token is unique and non-reusable. PoW on the client is proposed to generate a publicly verifiable output that the open-source platform can check, contributing to coercion resistance and observability without trusted intermediaries. We agree, however, that no explicit threat model or binding mechanism is supplied. The paper focuses on the architectural idea; a full cryptographic specification lies outside its scope. We will revise the abstract and add a clarifying paragraph on the intended verification flow. revision: yes
-
Referee: [Abstract] Abstract: the usability and accessibility assertions rest on the unexamined assumption that PoW can run acceptably on ordinary devices without introducing new attack surfaces or excluding portions of the electorate; no analysis of energy cost, hardware variance, or botnet risks is provided.
Authors: We concur that the manuscript contains no quantitative assessment of energy use, hardware differences, or botnet exposure. The implicit assumption is that PoW difficulty can be calibrated to remain feasible on consumer hardware while still providing a deterrent, analogous to adjustable client puzzles. These practical considerations are unaddressed. We will insert a limitations paragraph discussing tunable parameters, memory-hard functions to limit hardware advantages, and the need for future usability studies. revision: yes
-
Referee: [Abstract] Abstract: the description of the open-source platform and its observability properties contains no integration details, verification protocol, or comparison to the security already provided by the single-use authorization primitive alone.
Authors: The platform is envisioned as a public, auditable ledger where PoW outputs and authorization consumption can be inspected by any party, thereby extending the security of the single-use tokens with transparency. We accept that concrete integration steps and a verification protocol are omitted. We will expand the relevant section with a high-level data-flow description and a brief comparison of the added properties versus the authorization primitive in isolation. revision: yes
Circularity Check
No derivation chain or equations present; proposal is purely conceptual
full rationale
The paper is a high-level system proposal without any equations, fitted parameters, mathematical derivations, or load-bearing claims that reduce to their own inputs. It describes an idea for combining PoW with single-use authorizations but offers no formal model, threat analysis, or reduction steps. No self-citations, ansatzes, or uniqueness theorems are invoked to support derivations. This matches the reader's assessment of zero circularity and is the expected outcome for a non-mathematical sketch.
Assumptions & free parameters
assumptions (1)
- domain assumption Well-known cryptographic primitives and Proof of Work suffice to achieve zero-trust properties when combined with single-use authorizations
Cite this review
Pith. "Pith review of Electric Democracy: Proof of Work to secure Elections." pith.science (2026). https://pith.science/paper/2207.07446
@misc{pith2026220707446,
author = {Pith},
title = {Pith review of: Electric Democracy: Proof of Work to secure Elections},
year = {2026},
howpublished = {\url{https://pith.science/paper/2207.07446}},
note = {Machine review of arXiv:2207.07446}
}
read the original abstract
Electronic voting consistently fails to supplant conventional paper ballot due to a plethora of security shortcomings. Not only are traditional voting methods mediocre in terms of convenience and interface, they also encompass principal-agent problem, where the state may have vested interest in the outcome of the ballot. Electronic voting protocol using cryptography to deliver in zero trust environments is long overdue. Here I propose using Proof of Work algorithm at user devices in combination with other well-known security primitives to build a zero-trust voting system. The state would only issue single-use voting authorizations to its citizens, while zero trust design would allow conducting elections by an open-source platform with enhanced observability. It is also hypothesized that the heighten availability of plebiscite by means of the proposed design may ultimately change the way our society participates in the policy making.
Reference graph
Works this paper leans on
-
[1]
Systems consultant based in London, United Kingdom
Zuevsky, V. Systems consultant based in London, United Kingdom. Online CV https://www.linkedin.com/in/vzuevsky/
-
[2]
Oostveen, Anne-Marie. (2010). Outsourcing Democracy: Losing Control of E-Voting in the Netherlands. Policy and Internet. 2. 201. 10.2202/1944-2866.1065
-
[3]
Mearian, L. (2019, Aug 12). Why blockchain-based voting could threaten democracy. Computerworld. Retrieved from https://www.computerworld.com/article/3430697/why- blockchain-could-be-a-threat-to-democracy.html
-
[4]
Fiore, D. (2020, Feb 27). ZKPROOF. Retrieved from https://zkproof.org/2020/02/27/zkp-set- membership/
work page 2020
-
[5]
https://en.wikipedia.org/wiki/Proof_of_work
-
[6]
Robert Epstein, & Ro nald E. Robertson (2015). The search engine manipulation effect (SEME) and its possible impact on the outcomes of elections . Proceedings of the National Academy of Sciences, 112(33), E4512-E4521
work page 2015
-
[7]
https://en.wikipedia.org/wiki/Proof_of_stake
-
[8]
Zuevsky, V. (2020, May 13). LinkedIn. Retrieved from https://www.linkedin.com/pulse/dreary-labyrinth-blockchain-vitaly-zuevsky/
work page 2020
Show all 10 references
-
[9]
Mohamed M., Sachdeva N., et al. (2014). A three-way investigation of a game-CAPTCHA: automated attacks, relay attacks and usability. In Proceedings of the 9th ACM symposium on Information, computer and communications security (ASIA CCS '14). Association for Computing Machinery...
2014 doi
-
[10]
Bernhard, M. et al. (2017). Public Evidence from Secret Ballots. In: Krimmer, R., Volkamer, M., Braun Binder, N., Kersting, N., Pereira, O., Schürmann, C. (eds) Electronic Voting. E-Vote-ID 2017. Lecture Notes in Computer Science(), vol 10615. Springer, Cham. https://doi.org/1...
2017 doi
Reviewed May 24, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.