Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-peer Databases

Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-peer Databases

Slides from a talk given at Protocol Labs ConsensusDays, 7 October 2021.
Paper: https://arxiv.org/abs/2012.00472


Sybil attacks, in which a large number of adversary-controlled nodes join a network, are a concern for many peer-to-peer database systems, necessitating expensive countermeasures such as proof-of-work. However, there is a category of database applications that are, by design, immune to Sybil attacks because they can tolerate arbitrary numbers of Byzantine-faulty nodes. In this paper, we characterize this category of applications using a consistency model we call "Byzantine Eventual Consistency" (BEC). We introduce an algorithm that guarantees BEC based on Byzantine causal broadcast, prove its correctness, and demonstrate near-optimal performance in a prototype

Martin Kleppmann

October 07, 2021

More Decks by Martin Kleppmann

Other Decks in Research