5 papers · 1 filter
A Dual-CRDT Architecture for Decentralized Trust Governance and Evolution
Amos Brocco
While CRDTs provide decentralized replication and eventual consistency, Byzantine-resilient deployments require mechanisms for deciding which updates should be trusted and therefor…
Decoupling Trust in Byzantine CRDTs: Fine-grained Post-Compromise Handling without Breaking Causality
Amos Brocco
Conflict-free Replicated Data Types (CRDTs) provide strong eventual consistency without coordination, but classical approaches assume benign participants. In Byzantine settings, co…
A Composable CRDT Layer for Byzantine-Resilient Deterministic Reconstruction
Amos Brocco
Conflict-free Replicated Data Types (CRDTs) ensure Strong Eventual Consistency without coordination, but typically assume benign participants and rely on validation or exclusion to…
BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
Massimo Coluzzi, Amos Brocco, Alessandro Antonucci +1
Consistent hashing is a technique for distributing data across a network of nodes in a way that minimizes reorganization when nodes join or leave the network. It is extensively app…
MementoHash: A Stateful, Minimal Memory, Best Performing Consistent Hash Algorithm
Massimo Coluzzi, Amos Brocco, Alessandro Antonucci +1
Consistent hashing is used in distributed systems and networking applications to spread data evenly and efficiently across a cluster of nodes. In this paper, we present MementoHash…