Time-Optimal and Energy-Efficient Deterministic Consensus

Shachar Meir; Hugo Mirault; David Peleg; Peter Robinson

doi:10.4230/LIPIcs.OPODIS.2025.15

Time-Optimal and Energy-Efficient Deterministic Consensus

Shachar Meir
, Hugo Mirault
, David Peleg
, Peter Robinson

Weizmann Institute of Science
Augusta University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 O(⌈f²/n⌉) rounds, whereas for binary consensus, we show an algorithm to achieve O(⌈f/√n⌉) energy complexity.

Original language	English
Title of host publication	29th International Conference on Principles of Distributed Systems, OPODIS 2025
Editors	Andrei Arusoaie , Emanuel Onica, Michael Spear, Sara Tucci-Piergiovanni
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959774093
DOIs	https://doi.org/10.4230/LIPIcs.OPODIS.2025.15
State	Published - 2025
Externally published	Yes
Event	29th International Conference on Principles of Distributed Systems, OPODIS 2025 - Iasi, Romania Duration: 3 Dec 2025 → 5 Dec 2025

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	361
ISSN (Print)	1868-8969

Conference

Conference	29th International Conference on Principles of Distributed Systems, OPODIS 2025
Country/Territory	Romania
City	Iasi
Period	3/12/25 → 5/12/25

Bibliographical note

Publisher Copyright:
© Shachar Meir, Hugo Mirault, David Peleg, and Peter Robinson;

Keywords

Consensus
Crash faults
Distributed computing
Energy complexity
Sleeping model

Access to Document

10.4230/LIPIcs.OPODIS.2025.15

Cite this

Meir, S., Mirault, H., Peleg, D., & Robinson, P. (2025). Time-Optimal and Energy-Efficient Deterministic Consensus. In A. Arusoaie , E. Onica, M. Spear, & S. Tucci-Piergiovanni (Eds.), 29th International Conference on Principles of Distributed Systems, OPODIS 2025 Article 15 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 361). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.OPODIS.2025.15

Meir, Shachar ; Mirault, Hugo ; Peleg, David et al. / Time-Optimal and Energy-Efficient Deterministic Consensus. 29th International Conference on Principles of Distributed Systems, OPODIS 2025. editor / Andrei Arusoaie ; Emanuel Onica ; Michael Spear ; Sara Tucci-Piergiovanni. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2025. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{91f8f7625dba4a35a986861410977136,

title = "Time-Optimal and Energy-Efficient Deterministic Consensus",

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 O(⌈f2/n⌉) rounds, whereas for binary consensus, we show an algorithm to achieve O(⌈f/√n⌉) energy complexity.",

keywords = "Consensus, Crash faults, Distributed computing, Energy complexity, Sleeping model",

author = "Shachar Meir and Hugo Mirault and David Peleg and Peter Robinson",

note = "Publisher Copyright: {\textcopyright} Shachar Meir, Hugo Mirault, David Peleg, and Peter Robinson;; 29th International Conference on Principles of Distributed Systems, OPODIS 2025 ; Conference date: 03-12-2025 Through 05-12-2025",

year = "2025",

doi = "10.4230/LIPIcs.OPODIS.2025.15",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "\{Arusoaie \}, Andrei and Emanuel Onica and Michael Spear and Sara Tucci-Piergiovanni",

booktitle = "29th International Conference on Principles of Distributed Systems, OPODIS 2025",

address = "גרמניה",

}

Meir, S, Mirault, H, Peleg, D & Robinson, P 2025, Time-Optimal and Energy-Efficient Deterministic Consensus. in A Arusoaie , E Onica, M Spear & S Tucci-Piergiovanni (eds), 29th International Conference on Principles of Distributed Systems, OPODIS 2025., 15, Leibniz International Proceedings in Informatics, LIPIcs, vol. 361, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29th International Conference on Principles of Distributed Systems, OPODIS 2025, Iasi, Romania, 3/12/25. https://doi.org/10.4230/LIPIcs.OPODIS.2025.15

Time-Optimal and Energy-Efficient Deterministic Consensus. / Meir, Shachar; Mirault, Hugo; Peleg, David et al.
29th International Conference on Principles of Distributed Systems, OPODIS 2025. ed. / Andrei Arusoaie ; Emanuel Onica; Michael Spear; Sara Tucci-Piergiovanni. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2025. 15 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 361).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Time-Optimal and Energy-Efficient Deterministic Consensus

AU - Meir, Shachar

AU - Mirault, Hugo

AU - Peleg, David

AU - Robinson, Peter

N1 - Publisher Copyright: © Shachar Meir, Hugo Mirault, David Peleg, and Peter Robinson;

PY - 2025

Y1 - 2025

N2 - 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 O(⌈f2/n⌉) rounds, whereas for binary consensus, we show an algorithm to achieve O(⌈f/√n⌉) energy complexity.

AB - 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 O(⌈f2/n⌉) rounds, whereas for binary consensus, we show an algorithm to achieve O(⌈f/√n⌉) energy complexity.

KW - Consensus

KW - Crash faults

KW - Distributed computing

KW - Energy complexity

KW - Sleeping model

UR - https://www.scopus.com/pages/publications/105031378839

U2 - 10.4230/LIPIcs.OPODIS.2025.15

DO - 10.4230/LIPIcs.OPODIS.2025.15

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105031378839

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 29th International Conference on Principles of Distributed Systems, OPODIS 2025

A2 - Arusoaie , Andrei

A2 - Onica, Emanuel

A2 - Spear, Michael

A2 - Tucci-Piergiovanni, Sara

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 29th International Conference on Principles of Distributed Systems, OPODIS 2025

Y2 - 3 December 2025 through 5 December 2025

ER -

Meir S, Mirault H, Peleg D, Robinson P. Time-Optimal and Energy-Efficient Deterministic Consensus. In Arusoaie A, Onica E, Spear M, Tucci-Piergiovanni S, editors, 29th International Conference on Principles of Distributed Systems, OPODIS 2025. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2025. 15. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.OPODIS.2025.15

Time-Optimal and Energy-Efficient Deterministic Consensus

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this