2026-07-25T03:03:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19167 2024-03-06T11:03:35Z ddc:004 open_access

Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority Gafni, Eli Losa, Giuliano Consensus Sleepy Model Dynamic Participation Byzantine Failures In a permissionless system like Ethereum, participation may fluctuate dynamically as some participants unpredictably go offline and some others come back online. In such an environment, traditional Byzantine fault-tolerant consensus algorithms may stall - even in the absence of failures - because they rely on the availability of fixed-sized quorums. The sleepy model formally captures the main requirements for solving consensus under dynamic participation, and several algorithms solve consensus with probabilistic safety in this model assuming that, at any time, more than half of the online participants are well behaved. However, whether safety can be ensured deterministically under these assumptions, especially with constant latency, remained an open question. Assuming a constant adversary, we answer in the positive by presenting a consensus algorithm that achieves deterministic safety and constant latency in expectation. In the full version of this paper, we also present a second algorithm which obtains both deterministic safety and liveness, but is likely only of theoretical interest because of its high round and message complexity. Both algorithms are striking in their simplicity. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Eli Gafni and Giuliano Losa 2023 Is Part Of LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2023.41 urn:nbn:de:0030-drops-191675 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.41 eng https://creativecommons.org/licenses/by/4.0/legalcode