2000 character limit reached
On Conflict-Free Replicated Data Types and Equivocation in Byzantine Setups (2109.10554v2)
Published 22 Sep 2021 in cs.DC and cs.DS
Abstract: 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.