The paper delves into the territory between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers. It introduces Process-Commutative Objects (PCOs), ensuring SEC and PC while allowing conflicting operations under certain conditions. The proposed algorithm implements any PCO specified by an appropriate trace language, working in both crash and Byzantine settings. Four concrete examples of PCOs are presented, including money transfer, Petri nets, multi-sets, and concurrent work stealing deques.
The content discusses the impact of Blockchains and Distributed Ledger Technologies beyond cryptocurrencies. It highlights the challenges faced by existing DLT systems due to total ordering requirements in failure-prone distributed systems. The introduction of Process-Commutative Objects offers a novel approach to achieve consistency guarantees efficiently.
The concept of Conflict-free Replicated Data Types (CRDTs) is explored as a foundation for weakly synchronized distributed data structures. The paper emphasizes the scalability and robustness benefits of CRDTs in large-scale decentralized services. Various designs for Byzantine-tolerant CRDTs are discussed, addressing the limitations of traditional CRDTs in preventing malicious actions.
Vers une autre langue
à partir du contenu source
arxiv.org
Questions plus approfondies