$30 off During Our Annual Pro Sale. View Details »

Making CRDTs Byzantine fault tolerant

Making CRDTs Byzantine fault tolerant

Slides from a talk given at the 9th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC), Rennes, France, 5 April 2022.
Paper: https://martin.kleppmann.com/papers/bft-crdt-papoc22.pdf


It is often claimed that Conflict-free Replicated Data Types (CRDTs) ensure consistency of replicated data in peer-to-peer systems. However, peer-to-peer systems usually consist of untrusted nodes that may deviate from the specified protocol (i.e. exhibit Byzantine faults), and most existing CRDT algorithms cannot guarantee consistency in the presence of such faults. This paper shows how to adapt existing non-Byzantine CRDT algorithms and make them Byzantine fault-tolerant. The proposed scheme can tolerate any number of Byzantine nodes (making it immune to Sybil attacks), guarantees Strong Eventual Consistency, and requires only modest changes to existing CRDT algorithms.

Martin Kleppmann

April 05, 2022

More Decks by Martin Kleppmann

Other Decks in Research


  1. None
  2. Thank you to my supporters Crowdfunding supporters include: Ably, Adrià

    Arcarons, Chet Corcos, Macrometa, Mintter, David Pollak, Prisma, RelationalAI, SoftwareMill, Talent Formation Network, Adam Wiggins https://www.patreon.com/martinkl
  3. None
  4. None
  5. None
  6. None
  7. None
  8. None
  9. None
  10. None
  11. None
  12. None
  13. None
  14. None
  15. None
  16. None
  17. None
  18. None
  19. None
  20. None
  21. None
  22. None
  23. None
  24. None
  25. None
  26. None
  27. None
  28. None
  29. None
  30. None
  31. None
  32. None
  33. https://martin.kleppmann.com/papers/bft-crdt-papoc22.pdf https://automerge.org/ martin@kleppmann.com https://twitter.com/martinkl https://www.patreon.com/martinkl