Technical reports

Optimistically Terminating Consensus

Piotr Zieliński

June 2006, 35 pages

DOI: 10.48456/tr-668

Abstract

Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes broadcast their proposals and decide if sufficiently many processes report the same proposal. This paper shows an OTC-based framework which can reconstruct all major asynchronous Consensus algorithms, even in Byzantine settings, with no overhead in latency or the required number of processes. This result does not only deepen our understanding of Consensus, but also reduces the problem of designing new, modular distributed agreement protocols to choosing the parameters of OTC.

Full text

PDF (0.4 MB)

BibTeX record

@TechReport{UCAM-CL-TR-668,
  author =	 {Zieli{\'n}ski, Piotr},
  title = 	 {{Optimistically Terminating Consensus}},
  year = 	 2006,
  month = 	 jun,
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-668.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-668},
  number = 	 {UCAM-CL-TR-668}
}