2021/09/22 by Florian Jacob, Jacob, Florian, Saskia Bayreuther +3
Computer Science · #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2109.10554
openalex publication_date 2021/09/22 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
We explore the property of equivocation tolerance for Conflict-Free Replicated Data Types (CRDTs). We show that a subclass of CRDTs is equivocation-tolerant and can thereby cope with any number of Byzantine faults: Without equivocation detection, prevention or remediation, they still fulfill strong eventual consistency (SEC). We also conjecture that there is only one operation-based CRDT design supporting non-commutative operations that fulfills SEC in Byzantine environments with any number of faults.