Pith. sign in

REVIEW 2 cited by

Revisiting Fast Practical Byzantine Fault Tolerance

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 1712.01367 v1 pith:CC2VIIA2 submitted 2017-12-04 cs.DC

Ittai Abraham , Guy Gueta , Dahlia Malkhi , Lorenzo Alvisi , Rama Kotla , Jean-Philippe Martin This is my paper · ORCID
classification cs.DC
keywords violationalreadybyzantinechangesdemonstratefastfaultfirst
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 note, we observe a safety violation in Zyzzyva and a liveness violation in FaB. To demonstrate these issues, we require relatively simple scenarios, involving only four replicas, and one or two view changes. In all of them, the problem is manifested already in the first log slot.

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. Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes

    cs.DC 2019-08 conditional novelty 7.0 of 10

    Aleph achieves expected constant-latency atomic broadcast over an asynchronous network using a communication-history DAG and a trustless threshold-signature randomness beacon.

Pith tools