Metraipolis › archive › dc_95b181e44dc9
On the Robustness of Gossip Protocols in Modern Blockchains — arXiv:2610.21526
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21526
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:19:22.029Z
- SHA-256 of the archived text
df3d3dc09d10332d5ed38e2cb3d5c0eaed8540b77d4bf3d1df8e4dffb9bebdf0- Stable URL of this page
https://metraipolis.com/documento/dc_95b181e44dc9
How to cite
On the Robustness of Gossip Protocols in Modern Blockchains — arXiv:2610.21526 — arXiv (en), https://arxiv.org/abs/2610.21526 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_95b181e44dc9 (Metraipolis archive dc_95b181e44dc9, sha256 df3d3dc09d10332d5ed38e2cb3d5c0eaed8540b77d4bf3d1df8e4dffb9bebdf0)
BibTeX
@misc{dc95b181e44dc9,
title = {On the Robustness of Gossip Protocols in Modern Blockchains — arXiv:2610.21526},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21526},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_95b181e44dc9; sha256 df3d3dc09d10332d5ed38e2cb3d5c0eaed8540b77d4bf3d1df8e4dffb9bebdf0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21526. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Modern platforms such as Ethereum and Polkadot nowadays execute Byzantine fault-tolerant consensus protocols over large validator committees, often comprising hundreds of nodes. At this scale, complete graph topologies for connecting nodes are impractical, leading systems to adopt various gossip mechanisms, often in an ad hoc manner. In this paper, we study the robustness of widely deployed gossip protocols used in committee-based blockchains against realistic network adversaries. We show, both analytically and through extensive empirical measurements, that the graph parameters commonly chosen to instantiate random graphs are insufficient to guarantee that enough honest nodes receive consensus messages for quorum formation in existing protocols. Motivated by this finding, we empirically assess the robustness of Bitcoin's Erdős-Rényi (ER) graphs, Polkadot's grid topology, Ethereum's GossipSub, and Solana's chunk- and tree-based disseminations. Our results reveal surprising tradeoffs: Solana's dynamic trees are bandwidth-efficient in benign settings but fragile under adaptive attacks; Polkadot's grid achieves strong robustness at the cost of high bandwidth overhead; GossipSub is both bandwidth-efficient and resilient to adaptive adversaries, yet highly sensitive to parameter choices; and ER graphs provide a strong robustness-efficiency tradeoff, e.g., when the (average) fanout degree exceeds 15 for networks up to 5000 nodes. Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno). Categorie arXiv: Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2610.21526 — 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-16T08:47:32.612Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).