Library Header Image
LSE Research Online LSE Library Services

Lumiere: making optimal BFT for partial synchrony practica

Lewis-Pye, Andrew, Malkhi, Dahlia, Naor, Oded and Nayak, Kartik (2024) Lumiere: making optimal BFT for partial synchrony practica. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (PODC 2024). ACM Press. (In Press)

[img] Text (Lumiere Making optimal BFT for partial synchrony pratica) - Accepted Version
Pending embargo until 1 January 2100.

Download (327kB) | Request a copy


The view synchronization problem lies at the heart of many Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocols in the partial synchrony model, since these protocols are usually based on views. Liveness is guaranteed if honest processors spend a sufficiently long time in the same view during periods of synchrony, and if the leader of the view is honest. Ensuring that these conditions occur, known as Byzantine View Synchronization (BVS), has turned out to be the performance bottleneck of many BFT SMR protocols. A recent line of work [7, 12] has shown that, by using an appropriate view synchronization protocol, BFT SMR protocols can achieve 푂(푛 2 ) communication complexity in the worst case after GST, thereby finally matching the lower bound established by Dolev and Reischuk in 1985 [9]. However, these protocols suffer from two major issues, hampering practicality: (i) When implemented so as to be optimistically responsive, even a single Byzantine processor may infinitely often cause Ω(푛Δ) latency between consecutive consensus decisions. (ii) Even in the absence of Byzantine action, infinitely many views require honest processors to send Ω(푛 2 ) messages. Here, we present Lumiere, an optimistically responsive BVS protocol which maintains optimal worst-case communication complexity while simultaneously addressing the two issues above: for the first time, Lumiere enables BFT consensus solutions in the partial synchrony setting that have 푂(푛 2 ) worst-case communication complexity, and that eventually always (i.e., except for a small constant number of “warmup” decisions) have communication complexity and latency which is linear in the number of actual faults in the execution.

Item Type: Book Section
Additional Information: © 2024 The Author
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 09 May 2024 14:54
Last Modified: 16 May 2024 06:02

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics