Pith. sign in

REVIEW 2 cited by

Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1810.05256 v2 pith:BD77NJYR submitted 2018-10-11 cs.DC

Adam Gągol , Micha{l} Świętek This is my paper · ORCID
classification cs.DC
keywords consensusprotocolalephalgorithmasynchronousbyzantinefaultleaderless
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper we propose Aleph, a leaderless, fully asynchronous, Byzantine fault tolerant consensus protocol for ordering messages exchanged among processes. It is based on a distributed construction of a partially ordered set and the algorithm for reaching a consensus on its extension to a total order. To achieve the consensus, the processes perform computations based only on a local copy of the data structure, however, they are bound to end with the same results. Our algorithm uses a dual-threshold coin-tossing scheme as a randomization strategy and establishes the agreement in an expected constant number of rounds. In addition, we introduce a fast way of validating messages that can occur prior to determining the total ordering. This version of the protocol is deprecated. For current version see arXiv:1908.05156.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multimmit: Extending Blocks for Faster Finality

    cs.DC 2026-07 conditional novelty 7.0 of 10

    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.

  2. The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus

    cs.DC 2026-03 unverdicted novelty 7.0 of 10

    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.

Pith tools