Clairvoyant state machine replications

Rida Bazzi, Maurice Herlihy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is available (such information can be in the form of transaction read and write sets). The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. For n servers of which f may be faulty, this protocol requires n>4f.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
EditorsTaisuke Izumi, Petr Kuznetsov
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783030032319
StatePublished - Jan 1 2018
Event20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan
Duration: Nov 4 2018Nov 7 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11201 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Clairvoyant state machine replications'. Together they form a unique fingerprint.

Cite this