# On Conflict-Free Replicated Data Types and Equivocation in Byzantine Setups

arXiv: https://arxiv.org/abs/2109.10554 · HTML: https://mlsanity.com/paper/2109.10554/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Sep 2021.

## Built on by (most cited first, 1 of 1)

- [Byzantine Accountability Without Consensus: Strong Eventual Consistency for Non-Associative, Stochastic, Robust Aggregation](https://mlsanity.com/paper/2607.10305/) (2026)

## Abstract (arXiv)

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.