Slide 14
Slide 14 text
(参考)Blockchain Algorithm ①
There are varying ways to implement Proof-of-Stake algorithms, but the two major
tenets in Proof-of-Stake design are chain-based PoS and Byzantine Fault Tolerant-
based PoS. Tendermint is a BFT-based PoS design, Casper the Friendly Ghost is a
chain-based PoS design, and Casper the Friendly Finality Gadget is a hybrid of the
two.
The CAP Theorem in computer science returns the impossibility of providing more
than 2 out of 3 guarantees in distributed data systems: availability, consistency,
and partition tolerance. Chain-based PoS algorithms tend to choose availability
over consistency, where having availability means that all transactions will be
processed, but at the expense of a consistent state replicating across the network.
BFT-based PoS algorithms, on the other hand, strictly choose consistency over
availability.
By Tendermint(BPoS)