Chain-based consensus
Probabilistic & Synchronous
PoW
PoS
Iddo Bentov, Ariel Gabizon (Technion) and Alex Mizrahi (chromaway.com)
Ouroboros
Rafael Pass Elaine Shi (CornellTech/Cornell, IC3)
Tesilient assuming only that a majority of the online players are honest
Phil Daian Rafael Pass Elaine Shi (CornellTech/Cornell)
FC'19
Using sleepy consensus at its core
Money-does-not-switch-hands-too-quickly assumption (Section 3.1)
Not deposit-based
Adopt fruitchain to achieve incentive compatiblity (ε Nash equilibrium)(e.g. prevent long range attack)
Semi-adaptive security (corruptions with delay)
Penalize nothing at stake (i.e. players that sign multiple blocks with the same timestamp)
Xuechao Wang, Govinda Kamath, Vivek Bagaria, Sreeram Kannan, Sewoong Oh, David Tse, Pramod Viswanath
SBC'20
Lei Fan (Shanghai Jiao Tong University) Hong-Sheng Zhou (Virginia Commonwealth University)
The latest version is not published
Analysis
Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, and Alexander Russell
Aggelos Kiayias, Saad Quader, and Alexander Russell
Number of confirmations
Deteministic
Asynchronously safe
CBC Casper
Permissioned-oriented
Elaine Shi, CSF'19
A variant of Aura (Parity PoA chain)
Synchronous (lock-step), adaptive adversary
Common prefix: chop off$ nblocks under$ n ≥ 3f + 1
Aggelos Kiayias and Alexander Russell
Synchronous (lock-step)
Blocks in the main chain older than$ 3t + 1slots are considered finalized ($ tis the number of Byzantine nodes)
Optimistic fast confirmation
Argue that recoverbility from a network failiure (split or large delay)
Application: checkpointing of PoW blockchain