2026-07-27T09:22:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17224 2024-03-06T10:59:16Z ddc:004 open_access

Safe Permissionless Consensus Pu, Youer Alvisi, Lorenzo Eyal, Ittay Consensus Permissionless Nakamoto Deterministic Safety Nakamoto’s consensus protocol works in a permissionless model, where nodes can join and leave without notice. However, it guarantees agreement only probabilistically. Is this weaker guarantee a necessary concession to the severe demands of supporting a permissionless model? This paper shows that, at least in a benign failure model, it is not. It presents Sandglass, the first permissionless consensus algorithm that guarantees deterministic agreement and termination with probability 1 under general omission failures. Like Nakamoto, Sandglass adopts a hybrid synchronous communication model, where, at all times, a majority of nodes (though their number is unknown) are correct and synchronously connected, and allows nodes to join and leave at any time. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Youer Pu and Lorenzo Alvisi and Ittay Eyal 2022 Is Part Of LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2022.33 urn:nbn:de:0030-drops-172246 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.33 eng https://creativecommons.org/licenses/by/4.0/legalcode