Reproduce “On the Robustness of Gossip Protocols in Modern Blockchains” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Wenting Li, Jannik Albrecht, Frederik Armknecht, Ghassan Karame
The authors evaluate how gossip-network topology affects whether blockchain consensus messages reach a Byzantine fault-tolerant quorum. Their framework simulates message coverage and delay under churn and adversarial behavior across random graphs and other topology families. In a 1,000-node simulated random graph of average degree 8, degree-targeted corruption lowers coverage to 64.17%, below the roughly two-thirds quorum; results are simulation-bound.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.