SpotLess: Concurrent Rotational Consensus Made Practical Through Rapid View Synchronization
Dakai Kang, Sajjad Rahnama, Jelle Hellings, Mohammad Sadoghi
Abstract
The emergence of blockchain technology has renewed the interest in consensus-based data management systems that are resilient to failures. To maximize the throughput of these systems, we have recently seen several prototype consensus solutions that optimize for throughput at the expense of overall implementation complexity, high costs, and reliability. Due to this, it remains unclear how these prototypes will perform in real-world environments.
In this paper, we present SpotLess, a novel concurrent rotational consensus protocol made practical. Central to SpotLess is the combination of (1) a chained rotational consensus design for replicating requests with a reduced message cost and low-cost failure recovery that eliminates the traditional complex, error-prone view-change protocol; (2) the novel Rapid View Synchronization protocol that enables SpotLess to work in more general network assumptions, without a need for a Global Synchronization Time to synchronize view, and recover valid earlier views with the aid of non-faulty replicas without the need to rely on the primary; (3) a high-performance concurrent consensus architecture in which independent instances of the chained consensus operate concurrently to process requests with high throughput, thereby avoiding the bottlenecks seen in other rotational protocols.
Due to the concurrent consensus architecture, SpotLess greatly outperforms traditional primary-backup consensus protocols such as Pbft (by up to 430%), Narwhal-HS (by up to 137%), and Hot-Stuff (by up to 3803%). Due to its reduced message cost, SpotLess is even able to outperform RCC, a state-of-the-art high-throughput concurrent consensus protocol, by up to 23%. Furthermore, Spot-Less is able to maintain a stable and low latency and consistently high throughput even during failures.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d3250283-7b1b-4c49-a64c-33b9f4287800Cited by top-tier papers8
- HotStuff-1: Linear Consensus with One-Phase SpeculationDakai Kang, Suyash Gupta, Dahlia Malkhi, Mohammad SadoghiSIGMOD 2025 · 23 citations
- Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted ComponentsShaokang Xie, Dakai Kang, Hanzheng Lyu, Jianyu Niu et al.VLDB 2026 · 8 citations
- Orthrus: Accelerating Multi-BFT Consensus Through Concurrent Partial Ordering of TransactionsHanzheng Lyu, Shaokang Xie, Jianyu Niu, Ivan Beschastnikh et al.ICDE 2025 · 2 citations
- Censorship Resistance vs Throughput in Multi-Proposer BFT ProtocolsFatima Elsheimy, Ioannis Kaklamanis, Charalampos Papamanthou, Sarisht Wadhwa et al.CCS 2026 · 2 citations
- FairDAG: Consensus Fairness over Multi-Proposer Causal DesignDakai Kang, Junchao Chen, Anh Dinh, Mohammad SadoghiVLDB 2026 · 2 citations
Builds on12
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Enhancing Bitcoin Security and Performance with Strong Consistency via Collective SigningEleftherios Kokoris-Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi et al.USENIX Security 2016 · 769 citations
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 259 citations
- SharPer: Sharding Permissioned Blockchains Over Network ClustersMohammad Javad Amiri, Divyakant Agrawal, Amr El AbbadiSIGMOD 2021 · 181 citations
- Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGXYouren Shen, Hongliang Tian, Yu Chen, Kang Chen et al.ASPLOS 2020 · 144 citations
Related papers
- RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction ProcessingSuyash Gupta, Jelle Hellings, Mohammad SadoghiICDE 2021 · 72 citations
- High-Throughput Permissionless Blockchain Consensus Under Realistic Network AssumptionsSandro Coretti, Matthias Fitzi, Aggelos Kiayias, Giorgos Panagiotakos et al.CRYPTO 2025
- High Throughput Replication with Integrated Membership ManagementPedro Fouto, Nuno M. Preguiça, João LeitãoUSENIX ATC 2022
- A Weak Consensus Algorithm and Its Application to High-Performance BlockchainQin Wang, Rujia LiINFOCOM 2021 · 27 citations
- NeuChain: A Fast Permissioned Blockchain System with Deterministic OrderingZeshun Peng, Yanfeng Zhang, Qian Xu, Haixu Liu et al.VLDB 2022 · 42 citations
