핵심 개념
Process-Commutative Objects provide Strong Eventual Consistency and Pipeline Consistency while allowing conflicting operations under certain conditions.
초록
The content explores the territory between Byzantine-Fault-Tolerant CRDTs and totally ordered distributed ledgers, introducing Process-Commutative Objects. It defines legal sequences of operations, ensuring Strong Eventual Consistency and Pipeline Consistency. A generic algorithm is presented for implementing these objects in both crash and Byzantine settings, with practical examples like money transfer and Petri nets. The algorithm relies on reliable broadcast and ensures consistency and fault tolerance.
통계
"A Process-Commutative Object is a distributed data structure that accepts two types of operations, updates and queries."
"Total ordering and Byzantine Agreement are less central to Blockchains and DLTs than first assumed."
"CRDTs eschew the need for advanced synchronization through systematic reconciliation."
"Recent works have shown that cryptocurrency objects do not require total order and can be implemented using weaker communication abstractions."
"Existing BFT CRDTs cannot prevent double spending, a problematic situation for cryptocurrency applications."
인용구
"Recent works have shown that cryptocurrency objects do not require total order and can be implemented using weaker communication abstractions."
"CRDTs eschew the need for advanced synchronization through systematic reconciliation."