Analysis of the Matrix Event Graph Replicated Data Type

Jacob, Florian; Beer, Carolin; Henze, Norbert; Hartenstein, Hannes

doi:10.1109/access.2021.3058576

Cited by 4 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Conjecture. A hash-chained directed acyclic graph as described in [5,4] is the only operation-based CRDT with non-commutative operations that provides SEC for any number of Byzantine faults, i.e., has fault tolerance n > f .…”

Section: Discussionmentioning

confidence: 99%

“…Recent works on CRDTs in Byzantine environments have followed different paths. The work stretches from classical assumptions of an honest two-thirds majority [7] introducing coordination (e.g., Byzantine-tolerant causal-order broadcast [1]) to coordination-free, sybil-resistant CRDTs using broadcast based on the happened-before relation as directed, acyclic graphs [5,4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Jacob,

Bayreuther,

Hartenstein

2021

Preprint

Self Cite

View full text Add to dashboard Cite

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 noncommutative operations that fulfills SEC in Byzantine environments with any number of faults.

show abstract

Section: Discussionmentioning

confidence: 99%