Blockchain Consensus Protocols in the Wild
pith:7PAGDPQR Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{7PAGDPQR}
Prints a linked pith:7PAGDPQR badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
A blockchain is a distributed ledger for recording transactions, maintained by many nodes without central authority through a distributed cryptographic protocol. All nodes validate the information to be appended to the blockchain, and a consensus protocol ensures that the nodes agree on a unique order in which entries are appended. Consensus protocols for tolerating Byzantine faults have received renewed attention because they also address blockchain systems. This work discusses the process of assessing and gaining confidence in the resilience of a consensus protocols exposed to faults and adversarial nodes. We advocate to follow the established practice in cryptography and computer security, relying on public reviews, detailed models, and formal proofs; the designers of several practical systems appear to be unaware of this. Moreover, we review the consensus protocols in some prominent permissioned blockchain platforms with respect to their fault models and resilience against attacks. The protocol comparison covers Hyperledger Fabric, Tendermint, Symbiont, R3~Corda, Iroha, Kadena, Chain, Quorum, MultiChain, Sawtooth Lake, Ripple, Stellar, and IOTA.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Resilient Byzantine Agreement with Predictions
Characterizes tight consistency-robustness trade-offs and linear smoothness of resilience degradation for Byzantine Agreement using a faulty-node predictor in authenticated and non-authenticated settings.
-
Time Entangled Quantum Blockchain with Phase Encoding for Classical Data
A new quantum blockchain framework integrates temporal GHZ entanglement for information-theoretic tamper sensitivity with phase encoding for improved efficiency and scalability.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.