How Not to Be Censored: Inclusion Safety in Client-Led Consensus
Yackolley Amoussou-Guenou, Andrea Canidio
Abstract
Blockchain consensus protocols implicitly follow a client-server architecture: validators are the only active participants, while clients (i.e., users) merely submit transactions and rely on validators to include them. This abstraction obscures a fundamental question: what should a client do to guarantee the timely inclusion of its own transaction? We study this question by introducing a leaderless consensus protocol in which clients are active. We define inclusion safety: the guarantee that a client's transaction enters some of the blocks produced for an epoch, and that every block omitting it belongs to a fork that is eventually abandoned. Because every transaction carries a reference to a block of the previous epoch, clients help select the surviving fork. This yields two paths to inclusion: reaching sufficiently many honest replicas within an epoch, or relaying a block containing the transaction across epochs until the corresponding fork becomes canonical. In a generalized model spanning synchrony and asynchrony, the client's and the replicas' connectivity are substitutes for inclusion safety: it is achieved either if the client is well connected, or if the client is poorly connected but honest replicas communicate reliably, provided the client reaches at least one of them. However, the substitution is imperfect: when inclusion safety rests on the replicas' connectivity, it requires a longer epoch compared to when the client is well connected.
Create a lesson
Related papers
The End of Consensus Research?
Clément Burgelin, Rachid Guerraoui, Zicong Hong et al.
A Real-time tax compliance architecture for VAT split payments with Making Tax Smart and Open Banking
Panos Louvieris, George Ioannou, Gareth White
Enumeration-based Triangle Counting on GPUs
Sayan Ghosh
UlaCache: Unified Logical Addressing for Sparse LLM Serving
Isaac Zhu, Alan Cao, Hugh Yin et al.
Semantic-Aware Update Admission and Adaptive Byzantine Redundancy for Secure Computation Offloading in COIN-Enabled Metaverse Systems
Ibrahim Aliyu, Jaehyung Park, Jinsul Kim
RISK-KV: Quality-Aware Selective KV Cache Reconstruction for Distributed LLM Inference
Wang Yuekai