ZEXE: Enabling Decentralized Private Computation
summary
ZEXE constructs offline verifiable computations that publish constant-size proofs (around 1 KB proofs) and whose on-chain verification runs in <50 ms, independent of computation size. It supports arbitrary user-defined functions with per-coin death predicates enabling private, noncustodial atomic swaps and private user-defined assets while conserving value. Implementation uses recursion and recursive SNARK techniques to keep proving times practical, and code is available (Libzexe) alongside the paper; the system demonstrates private order-intent workflows and predicate-based enforcement for confidential decentralized trading.
AI-written summary · about
chapters (12)
- 0:00Scalability and privacy
- 0:49The Sexy system overview
- 2:43Private assets and tokens
- 3:59Trading challenges
- 6:29Privacy-related issues
- 8:47Zero cash protocol foundations
- 12:33Multi-asset anonymity pools
- 14:41Execution predicates
- 16:43Private atomic swaps
- 18:44DEX frameworks
- 21:26Achieving trade privacy
- 24:11Q&A and technical discussion
related talks
54mZexe: Enabling Decentralized Private Computation
38mCrypto-Economic Coprocessors & Their Applications
23mYour Game Will Suck Without Zero Knowledge Proofs
44mTooling for building zkEVM: PIL and Circom
28mZero Knowledge Proofs and Their Future Applications
31mZK Stack and the Rise of the Rollup-State
19mThe Superpowers of the ZK Stack
01h 23mProgram Presentations