Document Open Access Logo

Time-Optimal and Energy-Efficient Deterministic Consensus

Authors Shachar Meir , Hugo Mirault , David Peleg , Peter Robinson

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.15.pdf
  • Filesize: 0.92 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Distributed computing
  • Crash faults
  • Consensus
  • Energy complexity
  • Sleeping model

Metrics

Abstract

We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sleeping model (Chatterjee, Gmyr, Pandurangan PODC 2020) and defines the awake complexity (also called energy complexity), which measures the maximum number of rounds that any node is awake throughout the execution. Only awake nodes can send and receive messages in a given round and all messages sent to sleeping nodes are lost. We present new deterministic consensus algorithms that tolerate up to f < n crash failures, where n is the number of nodes. Our algorithms match the optimal time complexity lower bound of f+1 rounds. For multi-value consensus, where the input values are chosen from some possibly large set, we achieve an energy complexity of 𝒪(⌈ f² / n ⌉) rounds, whereas for binary consensus, we show an algorithm to achieve 𝒪(⌈ f / √n ⌉) energy complexity.

Cite As Get BibTex

Shachar Meir, Hugo Mirault, David Peleg, and Peter Robinson. Time-Optimal and Energy-Efficient Deterministic Consensus. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.15

Author Details

Shachar Meir
  • Weizmann Institute of Science, Rehovot, Israel
Hugo Mirault
  • Augusta University, GA, USA
David Peleg
  • Weizmann Institute of Science, Rehovot, Israel
Peter Robinson
  • Augusta University, GA, USA

Funding

Hugo Mirault and Peter Robinson were supported in part by National Science Foundation (NSF) Grant No. CCF-2402836.

References

  1. Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd ed.). John Wiley & Sons, Inc., April 2004. Google Scholar
  2. Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, and Mikaël Rabie. Solving sequential greedy problems distributedly with sub-logarithmic energy cost. In Alkida Balliu and Fabian Kuhn, editors, Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 2025, pages 417-427. ACM, 2025. URL: https://doi.org/10.1145/3732772.3733499.
  3. Leonid Barenboim and Tzalik Maimon. Deterministic logarithmic completeness in the distributed sleeping model. In Seth Gilbert, editor, DISC 2021,, volume 209 of LIPIcs, pages 10:1-10:19. LIPICS, 2021. URL: https://doi.org/10.4230/LIPICS.DISC.2021.10.
  4. Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, and Seth Pettie. The energy complexity of broadcast. In Calvin Newport and Idit Keidar, editors, PODC 2018, pages 95-104. ACM, 2018. URL: https://doi.org/10.1145/3212734.3212774.
  5. Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, and Seth Pettie. The energy complexity of BFS in radio networks. In Yuval Emek and Christian Cachin, editors, PODC 2020, pages 273-282. ACM, 2020. URL: https://doi.org/10.1145/3382734.3405713.
  6. Soumyottam Chatterjee, Robert Gmyr, and Gopal Pandurangan. Sleeping is efficient: Mis in o (1)-rounds node-averaged awake complexity. In ACM PODC 2020, pages 99-108, 2020. URL: https://doi.org/10.1145/3382734.3405718.
  7. Francesco D'Amato, Giuliano Losa, and Luca Zanolini. Asynchrony-resilient sleepy total-order broadcast protocols. In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, pages 247-256, 2024. URL: https://doi.org/10.1145/3662158.3662779.
  8. Francesco D'Amato and Luca Zanolini. Recent latest message driven ghost: Balancing dynamic availability with asynchrony resilience. In 2024 IEEE 37th Computer Security Foundations Symposium (CSF), pages 127-142. IEEE, 2024. URL: https://doi.org/10.1109/CSF61375.2024.00001.
  9. Danny Dolev and H. Raymond Strong. Authenticated algorithms for byzantine agreement. SIAM J. Comput., 12(4):656-666, 1983. URL: https://doi.org/10.1137/0212045.
  10. Fabien Dufoulon, William K. Moses Jr., and Gopal Pandurangan. Distributed MIS in o(log log n) awake complexity. In PODC 2023, Orlando, FL, USA, June 19-23, 2023, pages 135-145. ACM, 2023. URL: https://doi.org/10.1145/3583668.3594574.
  11. Francesco D’Amato, Roberto Saltini, Thanh-Hai Tran, and Luca Zanolini. Tob-svd: Total-order broadcast with single-vote decisions in the sleepy model. In 2025 IEEE 45th International Conference on Distributed Computing Systems (ICDCS), pages 1033-1043. IEEE, 2025. URL: https://doi.org/10.1109/ICDCS63083.2025.00104.
  12. Yuval Efron, Joachim Neu, and Toniann Pitassi. Fully-fluctuating participation in sleepy consensus. In 7th Conference on Advances in Financial Technologies (AFT 2025), pages 17-1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.AFT.2025.17.
  13. Yuval Efron, Joachim Neu, Ling Ren, and Ertem Nusret Tas. Optimal good-case latency for sleepy consensus. arXiv preprint arXiv:2510.06023, 2025. Google Scholar
  14. Michael J. Fischer, Nancy A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985. URL: https://doi.org/10.1145/3149.214121.
  15. Mohsen Ghaffari and Julian Portmann. Distributed MIS with low energy and time complexities. In PODC 2023, Orlando, FL, USA, June 19-23, 2023, pages 146-156. ACM, 2023. URL: https://doi.org/10.1145/3583668.3594587.
  16. Mohsen Ghaffari and Anton Trygub. A near-optimal low-energy deterministic distributed SSSP with ramifications on congestion and APSP. In Ran Gelles, Dennis Olivetti, and Petr Kuznetsov, editors, PODC 2024, Nantes, France, June 17-21, 2024, pages 401-411. ACM, 2024. URL: https://doi.org/10.1145/3662158.3662812.
  17. Khalid Hourani, Gopal Pandurangan, and Peter Robinson. Awake-efficient distributed algorithms for maximal independent set. In 42nd IEEE International Conference on Distributed Computing Systems, ICDCS 2022, Bologna, Italy, July 10-13, 2022, pages 1338-1339. IEEE, 2022. URL: https://doi.org/10.1109/ICDCS54860.2022.00153.
  18. Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982. URL: https://doi.org/10.1145/357172.357176.
  19. Nathan Linial. Locality in distributed graph algorithms. SIAM Journal on computing, 21(1):193-201, 1992. URL: https://doi.org/10.1137/0221015.
  20. Giuliano Losa and Eli Gafni. Consensus in the unknown-participation message-adversary model. arXiv preprint arXiv:2301.04817, 2023. URL: https://doi.org/10.48550/arXiv.2301.04817.
  21. Nancy Lynch. Distributed Algorithms. Morgan Kaufman Publishers, Inc., San Francisco, USA, 1996. Google Scholar
  22. Dahlia Malkhi, Atsuki Momose, and Ling Ren. Towards practical sleepy bft. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pages 490-503, 2023. URL: https://doi.org/10.1145/3576915.3623073.
  23. Hugo Mirault and Peter Robinson. Brief announcement: Towards energy-efficient distributed agreement. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC '25, pages 428-431, New York, NY, USA, 2025. Association for Computing Machinery. URL: https://doi.org/10.1145/3732772.3733554.
  24. Atsuki Momose and Ling Ren. Constant latency in sleepy consensus. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pages 2295-2308, 2022. URL: https://doi.org/10.1145/3548606.3559347.
  25. Joachim Neu, Javier Nieto, and Ling Ren. On the limits of consensus under dynamic availability and reconfiguration. arXiv preprint arXiv:2510.03625, 2025. Google Scholar
  26. Rafael Pass and Elaine Shi. The sleepy model of consensus. In International conference on the theory and application of cryptology and information security, pages 380-409. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-70697-9_14.
  27. Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. Journal of the ACM (JACM), 27(2):228-234, 1980. URL: https://doi.org/10.1145/322186.322188.
  28. Jie Xu, Cong Wang, and Xiaohua Jia. A survey of blockchain consensus protocols. ACM Comput. Surv., 55(13s):278:1-278:35, 2023. URL: https://doi.org/10.1145/3579845.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact