Skip to Main content Skip to Navigation
Conference papers

PnyxDB: a Lightweight Leaderless Democratic Byzantine Fault Tolerant Replicated Datastore

Abstract : Byzantine-Fault-Tolerant systems for closed consortia have recently attracted a growing attention notably in financial and supply-chain applications. Unfortunately, most existing solutions suffer from substantial scalability issues, and lack self-governance mechanisms. In this paper, we observe that many workloads present little concurrency, and propose PnyxDB, an eventually-consistent Byzantine Fault Tolerant replicated datastore that exhibits both high scalability and low latency. Our approach hinges on conditional endorsements that track conflicts between transactions. In addition to its high scalability, PnyxDB supports application-level voting, i.e. individual nodes are able to endorse or reject a transaction according to application-defined policies without compromising consistency. We provide a comparison against BFT-SMaRt and Tendermint, two competitors with different design aims, and show that our implementation speeds up commit latencies by a factor of 11, remaining below 5 seconds in a worldwide geodistributed deployment of 180 nodes.
Complete list of metadata
Contributor : Loïck Bonniot Connect in order to contact the contributor
Submitted on : Thursday, September 24, 2020 - 4:27:32 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM



Loïck Bonniot, Christoph Neumann, François Taïani. PnyxDB: a Lightweight Leaderless Democratic Byzantine Fault Tolerant Replicated Datastore. The 39th IEEE International Symposium on Reliable Distributed Systems (SRDS ’20), Sep 2020, Shanghai, China. ⟨10.1109/SRDS51746.2020.00023⟩. ⟨hal-02355778v2⟩



Record views


Files downloads