Metraipolis › archive › dc_ed73b145a8cc

Consensus with Stochastic Broadcast — arXiv:2608.27336

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27336
License (as archived)
CC0-1.0
Archived
2026-10-17T15:28:25.182Z
SHA-256 of the archived text
53c350a3e20652f44e68b3e580b1b22438d58572d74b52126604a4f60f8dfe16
Stable URL of this page
https://metraipolis.com/documento/dc_ed73b145a8cc

How to cite

Consensus with Stochastic Broadcast — arXiv:2608.27336 — arXiv (en), https://arxiv.org/abs/2608.27336 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ed73b145a8cc (Metraipolis archive dc_ed73b145a8cc, sha256 53c350a3e20652f44e68b3e580b1b22438d58572d74b52126604a4f60f8dfe16)
BibTeX
@misc{dced73b145a8cc,
  title = {Consensus with Stochastic Broadcast — arXiv:2608.27336},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27336},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ed73b145a8cc; sha256 53c350a3e20652f44e68b3e580b1b22438d58572d74b52126604a4f60f8dfe16},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27336. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study binary consensus in the \emph{stochastic broadcast model}, which assumes $n\geq 2$ processes communicating synchronously by message broadcasts. At each round, every process broadcasts a message to all the other processes. Each broadcast succeeds independently with some probability $p\in[0,1]$. If a broadcast succeeds, all processes receive the message, and if it fails, no process receives the message. The sender does not know whether its broadcast was successful or not. In this model, consensus is not solvable; the objective is to design, for a given number of rounds $r$, consensus algorithms that terminate in $r$ rounds, minimizing the probability of error disagreement. This problem has been studied in depth for 2 processes [DISC 2025]. We extend the study to $n> 2$.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.27336 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T15:17:44.900Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).