REVIEW 6 cited by
The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Conflict-free Replicated Data Types (CRDTs) are designed for replica convergence without global coordination or consensus. Recent work has achieved the same in a Byzantine environment, through DAG-like structures based on cryptographic hashes of content. The blocklace is a partially-ordered generalization of the blockchain in which each block has any finite number of signed hash pointers to preceding blocks. We show that the blocklace datatype, with the sole operation of adding a single block, is a CRDT: it is both a pure operation-based CRDT, with self-tagging; and a delta-state CRDT, under a slight generalization of the delta framework. Allowing arbitrary values as payload, the blocklace can also be seen as a universal Byzantine fault-tolerant implementation for arbitrary CRDTs, under the operation-based approach. Current approaches only care about CRDT convergence, being equivocation-tolerant (they do not detect or prevent equivocations), allowing a Byzantine node to cause an arbitrary amount of harm by polluting the CRDT state with an unbounded number of equivocations. We show that the blocklace can be used not only in an equivocation-tolerant way, but also so as to detect and eventually exclude Byzantine nodes, including equivocators, even under the presence of undetectable colluders. The blocklace CRDT protocol ensures that a Byzantine node may harm only a finite prefix of the computation.
Forward citations
Cited by 6 Pith papers
-
Byzantine Accountability Without Consensus: Strong Eventual Consistency for Non-Associative, Stochastic, Robust Aggregation
Any pure function of a product of CRDTs inherits Strong Eventual Consistency, so multi-Krum and similar discontinuous robust selectors can be made coordinator-free and accountable via OR-Set contributions plus grow-on...
-
Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI (Full Version)
dGLP and madGLP are deterministic, implementation-ready semantics for Grassroots Logic Programs, proved correct against the abstract nondeterministic semantics.
-
Beluga: Block Synchronization for BFT Consensus Protocols
Beluga gives BFT consensus a principled block synchronizer with admission control and implicit availability proofs, preserving optimistic latency and bounding pull-based attacks.
-
GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language for AI (Full Version)
GLP is a logic programming language whose single-reader/single-writer variables give secure channels, with proofs that multiagent GLP computations are deductions and that multiagent GLP is a grassroots protocol.
-
Consensus as Collapse Policy: Communication Evidence, Horizons, and Prefix Decisions
Consensus is lawful collapse of order-2 communication evidence into order-1 outputs under legitimacy, horizon, and repair rules.
-
Memory-Exhaustion Attack on the Blocklace Byzantine-Repelling Conflict-Free Replicated Data Type
A blocklace node can be forced to replicate arbitrarily many useless updates via self-incriminating synthetic identities, exhausting its memory.
Discussion (0). Continue with ORCID to comment.