Download App
iOS & Android

How we achieved anonymity on Web3 token-based elections

From Vocdoni by Vocdoni and Lucas Menendez

At the heart of Vocdoni's mission there is to innovate secure and anonymous voting mechanisms, as we believe it's a primitive for fair and legitimate participation in many scenarios.

Voter's anonymity can be easily preserved in 1Person-1Vote scenarios, as we already offer with our SDK and UIs using zk-Snarks. However, for token-based elections, separating identities from votes is not enough because token holders have a unique balance for a token, making them easy to identify as the weight of a vote can be correlated with an address.

In this article, we'll detail our approach to resolving this issue.


A key part of the Vocdoni stack is Census3. Census3 is a service that checks for updates to a list of tokens or other crypto assets, and maintains an updated list of holders for each registered token. This service allows users to create a census based on a token, or combining censuses using strategies, in a way compatible with Vocdoni's blockchain (Vochain).

Census3 allows creating public or anonymous-compatible censuses and publishes them on IPFS, allowing for a transparent use and public auditing. But when the election is configured to be anonymous, we must consider not only the addresses of the holders, but also their balances because depending on the token holder distribution it could be easy to identify voters.

In the context of public blockchain technology where balances are public, preserving voter anonymity on token-based elections is a big challenge. To address this, we have been considered different approaches:

  • Find a way or mechanism to keep the balance secret. ❌ Balances are public, and the Vochain needs to know the weight value to perform some checks and to calculate the results.
  • Find a way to hide the balances. ✅ Modifying the balances as little as possible to make them difficult to correlate with identities and achieving sufficient anonymity.

The Vocdoni protocol is very flexible on how to configure and process elections. That includes weighted voting. In this type of election, not all voters wield the same power; instead, their voting power is determined by their token holdings as defined in the census.

Rounding censuses

To ensure that the balances of token-based censuses remain private, we must alter them in some way. However, any change must meet two requirements:

  1. The resulting balance must be less than or equal to the original one.
  2. The resulting balance should stay as close to the original as possible.

We explored two approaches:

  • Statistical approach: Using a classification algorithm based on k-means but introducing the minimum number of members in a cluster requirement. ❌ Unfortunately, this approach required too many iterations to converge.
  • Logical approach: Sorting participants by their balance and then grouping them, with some data cleaning techniques.✅ This approach proved sufficient to provide a solution.

Logical approach

We have developed an algorithm to meet these requirements, rounding balances to the nearest one, forming groups of at least 3 (privacyThreshold) equal balances. This process obscures individual holder's balances. The algorithm optimizes the number of members in a group, taking in account the difference between balances, to reduce the accuracy loss.

Basic steps

  1. Identify and exclude outliers: Participants balances are analyzed to detect outliers using z-score algorithm.
  2. Forming groups: Participants are initially grouped based on the privacy threshold. A group can extend to include participants with identical balances or with balances differences falling below the groupBalanceDiff criteria.
  3. Balancing groups: For each group, we adjust the balances, rounding them down to the smallest amount within the group to obscure individual values.
  4. Accuracy loop: The algorithm tries to find the highest accuracy possible while maintaining a minimum privacy threshold. It starts with the minimum privacy threshold and increases it by a small amount until the accuracy is maximized.

For example, here is the pseudocode of the core part, grouping participants (2):

Function groupAndRoundCensus Input: participants (array of Participant), privacyThreshold (integer), groupBalanceDiff (pointer to big integer) Output: array of Participant Sort participants by balance Initialize groups as an empty array of array of Participant Initialize currentGroup as an empty array of Participant For each participant in participants If currentGroup is empty Add participant to currentGroup Else Set lastParticipant to the last element in currentGroup Calculate balanceDiff as the absolute difference between participant's balance and lastParticipant's balance If the length of currentGroup is less than privacyThreshold OR balanceDiff is less than or equal to groupBalanceDiff Add participant to currentGroup Else Add currentGroup to groups Set currentGroup to a new array containing only participant If it's the last iteration Add currentGroup to groups Set roundedCensus to the result of flattening and rounding groups to the minimun balance Return roundedCensus End Function

Results accuracy

To measure accuracy, we compare the total of the adjusted balances from the census against the sum of the original balances, incorporating outliers in both calculations for consistency.

Our tests covered censuses involving 21 different tokens, showcasing various holder counts and token formats, including ERC20, ERC721, and POAP. This comprehensive testing ensures our approach is robust across different Web3 assets.

Our test results with different tokens

Initial conclusions

Our algorithm has several advantages, such as simplicity and speed. However, there's room for refinement. For example, tokens characterized by uneven distribution among holders present a challenge, as outliers not fitting into any group maintain their original balances, potentially revealing their identity.

Another problem identified is the loss of accuracy. The algorithm allows for parameter adjustments to enhance precision, and these can certainly be used to improve accuracy, but we didn't find any pattern in our test to do so. We've established parameter settings that generally perform well across various token types and distributions, so we consider this to be sufficient for now.

We've also detected potential vulnerabilities to specific attacks. For example, acquiring a certain amount of a token to manipulate the algorithm into grouping an address with others could theoretically expose that address. However, such strategies are impractical and unlikely to significantly impact election outcomes. This type of attack also requires an analysis of balance distributions, complicating its execution.

Additionally, among other possible enhancements, there is also the possibility of improving the algorithm's performance.

This is our first implementation to token-based anonymous elections. But we'll be pleased to hear about better approaches, or suggestions, to achieve anonymous voting on these and other types of elections. We warmly invite you to share them with us at or info[at]


All Comments

Recommended for you

  • FLOKI breaks through $0.00012, with a 24-hour increase of over 120%

    The market shows that FLOKI has broken through 0.00012 US dollars and is now trading at 0.0001219 US dollars, with a 24-hour increase of 121.5%. The market is volatile, so please be prepared for risk control.

  • Over 500 million DOGE transferred to Binance and Robinhood today

    According to Whale Alert, a chain data tracking service, there were two large DOGE transfer transactions today. One address starting with "DDuXGF" transferred 450 million DOGE to Robinhood, worth approximately $62,694,29. The other address starting with "DJfU2p" transferred 56,963,057 DOGE to Binance, worth approximately $7,915,994.

  • The Hungarian Ministry of Economy has proposed a draft law allowing banks to provide encryption services. If approved, it will take effect on June 30

    Hungary is promoting a legislative proposal, which was proposed by the Hungarian Ministry of Economy, to establish a digital asset regulatory framework with the Hungarian central bank as the main regulatory agency and support banks, investment funds, and asset management The company can provide Bitcoin and other cryptocurrency services. If this bill is passed, it will be a significant step forward in allowing traditional financial institutions to incorporate encryption services. Once the bill is approved, the relevant laws are expected to take effect on June 30.

  • U.S. SEC Commissioner: Regulators are considering Ethereum spot ETFs

    Hester Peirce, a commissioner of the U.S. Securities and Exchange Commission (SEC), revealed at the ETH Denver event that the SEC is considering an Ethereum spot ETF, but currently "there is no information that can be disclosed." In addition, Hester Peirce believes that some of the choices made by the SEC are very strange, because when regulatory agencies drive entities out of the United States, they are actually pushing them beyond the control of U.S. regulatory agencies.

  • Blur transaction total exceeds $9 billion

    DappRadar data shows that the total transaction volume of NFT aggregation platform Blur has exceeded 9 billion US dollars, reaching 9.19 billion US dollars at the time of writing this article. The total number of traders on the platform is currently about 376,400. Historical data shows that in mid-January of this year, the transaction volume of Blur platform exceeded 8 billion US dollars, which means that this indicator has increased by more than 12.5% in less than two months. In other NFT markets, the total transaction volume of OpenSea NFT market is about 36.55 billion US dollars, and the total number of traders is about 5.2 million; the total transaction volume of LooksRare is 4.86 billion US dollars, and the total number of traders is more than 156,000.

  • UNI briefly exceeded $12, rising by more than 5% in the past hour.

    According to OKX market information, UNI briefly broke through $12 and is now priced at $12.012, with a gain of 5.63% in the past hour.

  • Bitwise BITB Bitcoin holdings exceed 25,000 BTC

    According to Bitwise, a cryptocurrency asset management company, the updated data for their Bitcoin ETF shows that as of March 1st, Friday, the total holdings of BITB have exceeded 25,000 BTC, with a total of 25,309.03 BTC and a market value of $1,584,049,290.31. In addition, the number of BITB circulating shares has increased to 46,420,000, with each share holding 0.000545 BTC.

  • Sui Foundation announced a new batch of funding projects: 12 projects including Mofa Labs and Turbos Finance were selected

    The Sui Foundation announced the funding recipients for January and February of this year. A total of 12 projects were selected, including:

  • Grayscale: Bitcoin may hit new all-time highs later this year

    Gray released the February market report, which pointed out that Bitcoin's price rose by about 45% in February, breaking through $60,000 for the first time since the fourth quarter of 2021. This phenomenon reflects the large influx of funds into US ETFs and expectations for Bitcoin halving in April.

  • BuildBear Labs Raises $1.9M to Accelerate Development of Web3 Tools for Secure dApp Creation

    Singapore-based BuildBear Labs has secured $1.9m in funding from investors including Superscrypt, Tribe Capital, and 1kx, as well as angel investors such as Kris Kaczor and Ken Fromm. The funds will be used to speed up development of the company's flagship platform, which provides developers with testing and validation solutions for secure decentralized applications. BuildBear Labs' platform is dedicated to dApp development and testing, offering developers the ability to create customised Private Testnet sandboxes across multiple EVM and EVM-compatible blockchain networks, with features including private faucets for unlimited Native and ERC20 token minting.