Making Byzantine consensus live
type: Item
instance of: scholarly article
title: Making Byzantine consensus live
author: Manuel Bravo
author: Gregory Chockler
author: Alexey Gotsman
published in: Distributed Computing
publication date: 2022-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2008.04167
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7630764
zbMATH Keywords: Byzantine consensus
zbMATH Keywords: blockchain
zbMATH Keywords: partial synchrony
zbMATH Keywords: liveness
MaRDI profile type: Publication
OpenAlex ID: W4294281180
cites work: Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
cites work: How to Solve Consensus in the Smallest Window of Synchrony
cites work: Correctness of Tendermint-Core Blockchains
cites work: Complexity of network synchronization
cites work: Tolerating corrupted communication
cites work: Asynchronous byzantine agreement protocols
cites work: Q4785503
cites work: The weakest failure detector for solving consensus
cites work: Unreliable failure detectors for reliable distributed systems
cites work: The Heard-Of model: computing in distributed systems with benign faults
cites work: Dynamic fault-tolerant clock synchronization
cites work: Impossibility of distributed consensus with one faulty process
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: Early Detection of Message Forwarding Faults
cites work: Timeliness, failure-detectors, and consensus performance
cites work: The part-time parliament
cites work: HotStuff
cites work: Blockchain consensus protocols in the wild (keynote talk)
Wikidata QID: Q128784492
DOI: 10.1007/S00446-022-00432-Y
description: scientific article; zbMATH DE number 7630764