Distributed sequential consensus in networks: analysis of partially connected blockchains with uncertainty
Summary: This work presents a theoretical and numerical analysis of the conditions under which distributed sequential consensus is possible when the state of a portion of nodes in a network is perturbed. Specifically, it examines the consensus level of partially connected blockchains under failure/attack events. To this end, we develop stochastic models for both verification probability once an error is detected and network breakdown when consensus is not possible. Through a mean field approximation for network degree we derive analytical solutions for the average network consensus in the large graph size thermodynamic limit. The resulting expressions allow us to derive connectivity thresholds above which networks can tolerate an attack.
- Consensus Computation in Unreliable Networks: A System Theoretic Approach
- On the Robustness of Uncertain Consensus Networks
- Probabilistic consensus of the blockchain protocol
- Asynchronous Byzantine Approximate Consensus in Directed Networks
- Consensus vs Broadcast, with and without Noise
- On the viability of the deterministic consensus hierarchy
- Distributed consensus, revisited
- Impossibility Results and Lower Bounds for Consensus under Link Failures
This page was built for publication: Distributed sequential consensus in networks: analysis of partially connected blockchains with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687429)