STATE OF THE MIXERS: SUMMER 2019
A survey of active on-chain mixer efforts for Ethereum, including history, context and benchmarks.
- Strategic importance of mixers
- BTC coinjoin context / prior art
- Abstract Tradeoffs
- Mixer List
This document is meant to serve as a general overview of all mixer efforts currently in development for Ethereum. Requested by Moloch, in the interest of reducing information overhead and duplicative efforts for current teams and prospective developers.
Also included is general tradeoffs and considerations for Snarks / Ring Signatures. Developers looking to create their own mixer will hopefully be able to use this as a reference.
This survey will give most attention to simple mixers, ie, swapping ether for ether, and then exiting. There are more ambitious projects much larger in scope that allow transfers within the contract, effectively creating deep pools of private value transfer. Future versions of mixers may attempt to graduate to this stage as well.
I received significant input on this from the Semaphore Telegram channel, specifically Haarorld, Roman (tornado.cash) Barrywhitehat. Thank you as well to the mixer teams who answered my many questions.
Strategic importance of mixers
In the early days of Ethereum, before mining was inundated with highly specialised ASICs, it was relatively easy to get new Ether directly from the network. With a modest hardware setup, users could participate in network consensus and be rewarded with enough Ether to use on the platform. In this state, users were given several important advantages:
- The Ether minted from Block Rewards was a "clean" source, without any possibility of a tainted past. Transfers are trivially tracked, opening users up to law enforcement targeting of past activity.
- No potentially malicious intermediaries / onramps could interfere, as exists today in varying degrees through exchanges and local services.
- Mining is permissionless - meaning there are addresses from that time which will never have legacy identities associated with them. By not having to go through an exchange (and following opsec best practices), there's a low likelihood of ever getting targeted for theft and extortion.
Given the relatively high levels of mining difficulty and the uncertainty of local transfers, getting uncompromised Ether is nearly impossible today. Properly implemented mixers promise to restore at least a degree of this past, making them incredibly useful for any community that emphasises norms like sovereignty and strong privacy.
However, it's important to state that individual mixers at the application layer will never provide absolute privacy to users, only probabilistic guarantees. As with many mechanisms, it depends which tradeoffs were made in pursuit of which goals. This survey will explore these further.
For additional resources on user privacy outside of mixers at different levels:
- general intro from Vitalik Buterin, 2016: Privacy on the Blockchain
- 'Sandbox' closed-loop ecosystems like Aztec Protocol
- a very helpful curated resource list from Mikerah: Awesome Privacy on Blockchains
BTC coinjoin context / prior art
CoinJoin, and similar schemes without a growing anonymity set, are vulnerable to correlation analysis, as demonstrated by: https://www.coinjoinsudoku.com/ - systems which use this approach, be it aggregate signature schemes, ring signatures etc. have many security caveats which can result in all transactions essentially being deanonymised.
The final output of a mixer heavily depends on the foundational cryptographic component providing privacy. There are two mechanisms generally used: SNARKs, aka "Succinct Non-Interactive Argument of Knowledge," or Ring-Signatures. Both have specific peculiarities which must be considered in the mixer architecture.
- Algorithm used for merkle tree (makes proving on mobile devices possible)
- Depth of merkle-tree
- On-chain Gas cost for computing merkle tree inserts
- Number of circuit constraints, per-level
- Maximum number of items in merkle-tree
- Trade-off: depth vs max-items vs on-chain cost vs circuit constraints vs acceptable cost
- SHA256 = cheap on-chain, very expensive to prove
- Pedersen hash = very expensive on-chain, cheap to prove
- Poseidon = $1\over2$ depth merkle trees (very cheap to prove), expensive on-chain (~90k gas per-level)
- Trusted setup (the thing which stops us deploying)
- How can this be handled?
- Groth16 phase1 being handled by Gnosis
- Require per-circuit setup
- SONIC, SHARK, others etc. are slower, but don't require per-circuit trusted setup
- Bulletproofs = no trusted setup, but $\Theta(n)$ verification time versus number of constraints
- SNARKs = trusted setup, but $\Theta(1)$ verification time
- Platform support (running the same code, at near-native speeds, on as many platforms as possible = better)
- WASM / JS support for in-browser no-download-necessary web-wallets.
- WASM slower than natively compiled optimised code, but write-once-run-anywhere
- Native iOS and Android support?
- Natively compiled code usually faster & lower memory than WASM / JS
- Rust on iOS / Android?
- C++ on iOS / Android = easier
- Do Mixers need parallel / multi-cpu / GPU support?
- WASM / JS support for in-browser no-download-necessary web-wallets.
- Proving time (lower is better)
- On-chain cost (lower is better)
- The depth of the merkle tree, which determines the total number of deposits it supports
- The algorithm used for the Merkle-tree, and the depth of the tree, usually dominates the number of constraints and subsequently the proving time
- The choice of hashing algorithm and tree depth also significantly impacts the on-chain deposit GAS requirements
- There is a batching technique, where inserts into the tree are processed by a zkSNARK to 'append N items to tree', which reduces on-chain GAS cost
- Hashing algorithms:
- MiMC + Miyaguchi-Preneel compression function (2nd fastest on-chain)
- MiMC feistel sponge (approx 2x MiMC+MP GAS cost)
- Poseidon, allows quarternary trees (4 items per node), reducing tree-depth by half, low number of constraints per bit
- Pedersen hash (as used by Zcash Sapling, slowest on-chain)
- SHA-256 (fastest on-chain)
- Hashing algorithm measurements:
- Constraints per-bit
- Tree-depth versus node width (e.g. binary tree, vs n-ary tree)
- On-chain GAS cost, per-bit
- The number of constraints in the circuit. this highly impacts proving time. (do constraints affect level of privacy in the end?)
- Which snark library used
- Is it web-browser compatible? (JS/WASM etc.)
- Good for end-user web-based wallets
- Does it support faster parallel proving
- Good for large batches of transactions, aka 'rollup'
- Does it support mobile devices
- Native iOS, Android support
- Does it support GPU acceleration
- Good for reducing overall proving-time with larger circuits
- Is it web-browser compatible? (JS/WASM etc.)
- proof generation time? generally higher or lower than ring sigs? or does it depend on the mixer
- Proofs verification costs scale linearly relative to the pool of inputs (users)
- Proofs can be verified entirely on-chain
- No trusted setup (a.k.a no 'toxic waste')
- Relatively cheap to compute proof/signature
- Anonymity set can be limited depending on the interval between first deposit and withdrawal (first withdrawal ends ring deposits and starts new rings)
The majority of mixers on Ethereum under active development are SNARK based. The following chart compiles a variety of relevant benchmarks to compare across implementations.
|MT Max items||536,870,912||1,048,576||32,768||65,536||n/a|
|AVG Proving time (ms)||3,600 (native)||63,000 (browser)||10,000 (iPhone 7)||6,116 (browser)||-|
|User Keys (zipped / expanded) (mb)||7 / 11||40 / 176||-||10 / 32||-|
The following are based on the initial Miximus code by BarryWhiteHat
However, currently, only the ethsnarks-miximus project is being actively maintained and developed. It (ethsnarks-miximus) serves as the basis (with some modification) for the Hopper project.
Development Status: Active Deployed to: -
- Library: ethsnarks
- Merkle-Tree algorithm: MiMC
- Browser-compatible: Yes, via Emscripten build - with 10x proving time
- Relayer support: not yet
- Vitalik-spec-compatible: not yet
- serves as inspiration for
Development Status: Active Deployed to: Kovan
- Front end
- General Spec
- based on Semaphore
- State of the project: Should be releasing a POC in the next few weeks
- Loose Team: Barry Whitehat, Kobi, Wei Jie, Lakshman Sankar
- Funded by an EF grant (?)
- library: snarkjs/circom
- Relayer implementation: working on a burn relay registry
Development Status: Active Deployed to: Mainnet
- Intro Medium Post: for now it is a mobile-only mixer.
- Made by argent team: Itamar, Olivier
- Library: ethsnarks (uses MiMC)
- Amount limited to 1 ETH in, 1 ETH out
- funded as an internal project (?)
- Relayer implementation: https://github.com/argentlabs/hopper/pull/3
- NOTE: Relayer can potentially be front run
Development Status: Active Deployed to: --
Development Status: prototype Deployed to: --
Development Status: Active Deployed to: Live on Kovan, Mainnet (limit .1 ETH)
- Mainnet address: 0x94A1B5CdB22c43faab4AbEb5c74999895464Ddaf
- Kovan Address: 0x1Cea940cA15a303A0E01B7F8589F39fF34308DB2
- Team: Peppersec (Roman 1, Roman 2, Alex)
- Received Moloch grants recently for future updates to the mixer and past work
- Serverless, executed entirely in the browser (except relays)
- Circom, Websnark prover
- Fixed deposit amount
- MiMC hash
- Pedersen (nullifier, secret) commitments as leaves
- Relayer support with adjustable fees
- Constraints = 1869 + 1325 * tree_depth Deposit gas = 43381 + 50859 * tree_depth Proof time = 1071 + 347 * tree_depth ms
- 28,369 Constraints 1,060,561 Gas deposit 8,011 ms proof time
Ring Signature based
Development Status: Active / Prototype Deployed to: Ropsten
- Introducing Heiswap post
- Heiswap (黑 swap) is an Ethereum transaction mixer that ultilizes parts of CryptoNote to enable zero-knowledge transactions.
- Uses Ring Signatures and pseudo-stealth addresses to achieve its zero-knowledge properties
- The deployed smart contract handles the signature verification, while the client is responsible for generating the pseudo-stealth address.
- Relayer for gasless withdrawals
This repository contain the work done during the spring semester of 2017 as part of an Introduction to Research in Computer Science at ETH Zürich. I was helped and advised by Dr Arthur Gervais.
A collection of ring-signature based confidential transaction kernels created by 'SolidBlu1992'
- "Trustless Tumbling for Transaction Privacy"
Instead of ring signatures being computed on-chain, this scheme uses an interactive aggregate signature mechanism to sever the link between depositor and withdrawee. This means it costs the same as a regular ethereum transaction without any additional on-chain overhead.
Recommendations for continued efforts
USER AWARENESS / ADOPTION of mixers will be crucial for sustained success. Without a large and consistently fresh sets of deposits / withdrawals, the anonymity set will become stale and "capturable". Proposals may include:
- Signaling from high profile organisations (ie, EF or MakerDAO) or individuals encouraging use.
- Mixer pen-testing sessions with bounties for the most successful deanonymisation techniques.
- Organising mixing schemes at large events (Ethglobal hackathons, DevCon).
USER EDUCATION on the general tradeoffs between various mixer implementations. Users should be made aware in general that transactions can still leak privacy via IP address or Dapp cookies. Tor can help with this and should be recommended. Mixers should emphasise on front-ends or documentation that accounts should not be reused after interacting. Teams should be honestly present the levels of possible privacy and the tradeoffs made between implementations.
Points 1 and 2 can be significantly aided by an integrating mixing functions into popular wallets. User initiated privacy can leak identifying information over time by accidentally sending between addresses used before and after mixing. To avoid this, mixing should ideally occur pseudo-randomly, in the background, without the user's direct involvement. That's not say users shouldn't be able to initiate, but ideally would bias toward minimal effort on their part. It is a baseline assumption that addresses should not be reused. This can be accomplished through a properly considered UI that automatically retires (eg. hides) addresses once it is swept of funds. Finally, automatic modals warning users of possible account linkage before allowing transaction sends.
Reducing the gas cost of onchain precompiles like EIP-1108 is a significant step forward for all privacy initiatives. Developers should continue collaborating to make the public Ethereum chain a welcoming place for effective privacy. The EF and other interested parties should sponsor EIP champions if needed to shepherd upgrades through to mainnet.
Relayers: Relay networks like Gas Station Network but more decentralised. Will need additional research on what the difference in relayer types are
Explore incentivised mixer mechanisms. For example, incentivising anonymity set participation. (more research needed to determine viability, some arguments against here.
A strong focus on security auditing and standardizing cryptographic components would be beneficial for current and future efforts. (CIRCOM lib audit, websnark - prover written in WAss., solidity verifier audit)
UX studies of which factors are important (which numbers displayed) (# since last withdrawal vs deposit)
Experiment with xDAI chain for more complex experiments (fewer gas limitations)