2026-08-07T22:18:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14861 2024-03-06T10:55:02Z ddc:004 open_access

Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication Livshits, Ariel Shadmi, Yonatan Tamir (Averbuch), Ran Majority consensus probabilistic message loss distributed systems In this work, we consider a synchronous model of n faultless agents, with a complete communication graph and messages that are lost with some constant probability q ∈ (0,1). In this model we show that there exists a protocol, called the Simple Majority Protocol, that solves consensus in 3 communication rounds with probability of agreement converging to 1 as n → ∞. We also prove that 3 communication rounds are necessary for the SMP to achieve consensus, with high probability. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ariel Livshits and Yonatan Shadmi and Ran Tamir (Averbuch) 2021 Is Part Of LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2021.59 urn:nbn:de:0030-drops-148617 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.59 eng https://creativecommons.org/licenses/by/4.0/legalcode