2022/01/04 by Andrew Lewis-Pye, Lewis-Pye, Andrew · 4 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #DNA and Biological Computing #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Ferroelectric and Negative Capacitance Devices #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2201.01107
openalex publication_date 2022/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the message complexity of State Machine Replication protocols dealing with Byzantine failures in the partial synchrony model. A result of Dolev and Reischuk gives a quadratic lower bound for the message complexity, but it was unknown whether this lower bound is tight, with the most efficient known protocols giving worst-case message complexity O(n3). We describe a protocol which meets Dolev and Reischuk's quadratic lower bound, while also satisfying other desirable properties. To specify these properties, suppose that we have n replicas, f of which display Byzantine faults (with n≥ 3f+1). Suppose that Δ is an upper bound on message delay, i.e. if a message is sent at time t, then it is received by time max \ t, GST \ +Δ . We describe a deterministic protocol that simultaneously achieves O(n2) worst-case message complexity, optimistic responsiveness, O(fΔ ) time to first confirmation after GST and O(n) mean message complexity.