Deterministic Consensus Algorithm with Linear Per-Bit Complexity
Guanfeng Liang, Nitin Vaidya
TL;DR
This paper presents a deterministic consensus algorithm for Byzantine agreement with linear per-bit complexity, building on previous multi-valued broadcast algorithms to improve efficiency in distributed systems.
Contribution
It introduces a new deterministic all-to-all Byzantine agreement algorithm with linear complexity per bit, advancing the efficiency of consensus protocols.
Findings
Achieves linear complexity per bit in Byzantine consensus
Builds upon previous multi-valued broadcast algorithms
Enhances efficiency of deterministic consensus algorithms
Abstract
In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multi-valued all-to-all Byzantine agreement algorithm (consensus), with linear complexity per bit agreed upon. The discussion in this note is not self-contained, and relies heavily on the material in [2] - please refer to [2] for the necessary background.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Mobile Agent-Based Network Management · Logic, Reasoning, and Knowledge