Paper 2025/016
Dynamically Available Common Subset
Abstract
Internet-scale consensus protocols used by blockchains are designed to remain operational in the presence of unexpected temporary crash faults (the so-called sleepy model of consensus) -- a critical feature for the latency-sensitive financial applications running on these systems. However, their leader-based architecture, where a single block proposer is responsible for creating the block at each height, makes them vulnerable to short-term censorship attacks, in which the proposers profit at the application layer by excluding certain transactions. In this work, we introduce an atomic broadcast protocol, secure in the sleepy model, that ensures the inclusion of all transactions within a constant expected time, provided that at least one participating node is non-censoring at all times. Unlike traditional approaches, our protocol avoids designating a single proposer per block height, instead leveraging a so-called dynamically available common subset (DACS) protocol -- the first of its kind in the sleepy model. Additionally, our construction guarantees deterministic synchronization -- once an honest node confirms a block, all other honest nodes do so within a constant time, thus addressing a shortcoming of many low-latency sleepy protocols.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- consensusblockchain
- Contact author(s)
-
ye2210 @ columbia edu
nusret @ stanford edu - History
- 2025-01-06: approved
- 2025-01-04: received
- See all versions
- Short URL
- https://ia.cr/2025/016
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/016,
author = {Yuval Efron and Ertem Nusret Tas},
title = {Dynamically Available Common Subset},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/016},
year = {2025},
url = {https://eprint.iacr.org/2025/016}
}
