REVIEW 8 cited by
Cordial Miners: Fast and Efficient Consensus for Every Eventuality
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
Signed reviews
read the original abstract
Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block. Rather, Cordial Miners use the blocklace -- a partially-ordered counterpart of the totally-ordered blockchain data structure -- to implement the three algorithmic components of consensus: Dissemination, equivocation-exclusion, and ordering.
Forward citations
Cited by 8 Pith papers
-
Transaction Fee Mechanism Design for Leaderless Blockchain Protocols
The paper introduces a game-theoretic model and the FPA-EQ fee mechanism for multi-proposer blockchains, with a tight 63.2% welfare guarantee and matching impossibility results.
-
Multimmit: Extending Blocks for Faster Finality
Multimmit finalises transaction blocks in one voting round with roughly 3δ average latency from dissemination, confining a faulty producer's damage to its own chain.
-
The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus
Two-round-finality leader-based consensus cannot beat ~2.5 data expansion; three-round Carnot protocols reach near-1 under favorable conditions and 1.33–1.5 under attack.
-
Raptr: Prefix Consensus for Robust High-Performance BFT
Raptr is a BFT consensus protocol whose prefix-voting mechanism commits nested prefixes of proposed blocks, delivering high throughput, near-optimal latency, and robustness to message loss in a 100-replica deployment.
-
Zaptos: Towards Optimal Blockchain Latency
By overlapping execution, storage, and state certification with consensus ordering, Zaptos cuts blockchain latency by up to five network rounds and reports sub-second latency at 20k TPS.
-
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.
-
SoK: DAG-based Consensus Protocols
A new taxonomy divides DAG-based consensus protocols into availability-focused and consistency-focused families, with subcategories for structured versus unstructured and optimistic versus certified DAGs.
-
Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice
A descriptive, implementation-level workflow analysis of the existing Bullshark-on-Narwhal consensus protocol, based on the Sui codebase, with no new experiments or derivations.
Discussion (0). Continue with ORCID to comment.