Proof systems, cryptographic coordination, and blockchain mechanism design

Zhuo Cai (蔡卓)

Building cryptographic and game-theoretic foundations for trustworthy decentralized protocols.

My research builds the cryptographic and game-theoretic foundations that make decentralized protocols trustworthy at scale. I work across three directions: (1) proof systems — constructing efficient, updatable SNARKs and lookup arguments for verifiable computation over evolving data; (2) cryptographic coordination protocols — designing bias-resistant, incentive-aware randomness and leader-election protocols secure against strategic manipulation; and (3) blockchain mechanism design — analyzing and repairing transaction fee mechanisms for modern architectures including DAG consensus, sharded execution, and parallel transaction processing. My work appears at CCS, IJCAI, OOPSLA, ICBC, and IEEE Blockchain. I am a PhD student at HKUST, supported by the Hong Kong PhD Fellowship (HKPFS), and a former visiting scholar at the University of Oxford.

Research Directions

Ongoing and planned research.

Topics I am actively working on or planning to pursue, beyond papers already published.

Research Direction Active

Blockchain Mechanism Design: Transaction Fees and Strategic Equilibria

Most transaction fee mechanism (TFM) theory—including the foundations of EIP-1559— assumes a linear chain with one proposer per block in isolation. Real blockchain infrastructure has moved well beyond this model: strategic builders can delay transactions across multiple blocks, DAG-based consensus (Bullshark, Shoal++) runs concurrent proposers across overlapping transaction sets, sharded systems must price cross-shard atomicity, and parallel execution engines (Solana, Monad, Sui) remove ordering constraints while introducing new strategic manipulation via conflict graphs. This direction asks which classical TFM desiderata survive these architectural changes and what new mechanisms are needed to restore incentive compatibility, user welfare, and revenue adequacy. It also studies incentive design for parallel execution: whether conflict injection can be detected and penalized, how MEV manifests under parallelism, and what validator compensation models are viable when transaction ordering is no longer the primary strategic lever.

transaction fee mechanismblockchain mechanism designincentive designblockchain economicsDAG blockchainshardingparallel executionMEV

Publications

Selected publications.

5 representative papers. The publications page has the full list with search, tags, and abstracts.

CCS 2026 Accepted

Rogue: Updatable Matrix Lookup Arguments and Applications to Verifiable Databases

C. Pappas Zhuo Cai D. Papadopoulos

ACM SIGSAC Conference on Computer and Communications Security · 2026

To appear.

IJCAI 2025 Published

Smart Contracts for Trustless Sampling of Correlated Equilibria

T. Barakbayevaα Zhuo Caiα A. Goharshadyα K. Keypoorα

International Joint Conference on Artificial Intelligence · 2025

Alphabetical author order with Amir Goharshady.

ICBC 2024 Published

SRNG: An Efficient Decentralized Approach for Secret Random Number Generation

T. Barakbayevaα Zhuo Caiα A. Goharshadyα

IEEE International Conference on Blockchain and Cryptocurrency · 2024

Alphabetical author order with Amir Goharshady.

OOPSLA 2023 Published

Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts

Zhuo Caiα S. Farokhniaα A. Goharshadyα S. Hitarthα

Proceedings of the ACM on Programming Languages · 2023

Alphabetical author order with Amir Goharshady.

ICBC 2023 Published

Trustless and Bias-Resistant Game-Theoretic Distributed Randomness

Zhuo Caiα A. Goharshadyα

IEEE International Conference on Blockchain and Cryptocurrency · 2023

Alphabetical author order with Amir Goharshady.

Publications

Searchable paper list

Browse the complete publication list with venue, year, tags, and local PDFs where available.

CV

Background and milestones

Web summary and PDF CV.

Contact

Profiles and email

Find contact details, profile links, and the best way to reach out for research discussions.