TY - GEN
T1 - From classical to blockchain consensus
T2 - 38th ACM Symposium on Principles of Distributed Computing, PODC 2019
AU - Liu, Yanhong A.
AU - Stoller, Scott D.
N1 - Publisher Copyright:
© 2019 Authors.
PY - 2019/7/16
Y1 - 2019/7/16
N2 - This tutorial describes well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus, and discusses exact algorithms that are high-level as in pseudocode and directly executable at the same time. The tutorial consists of five parts:(1) A introduction to different distributed consensus problems, from classical consensus and Byzantine consensus to blockchain consensus. (2) An overview of well-known algorithms, from Paxos for classical consensus to the Bitcoin algorithm for blockchain consensus, including important variants such as Viewstamped Replication and Virtual Synchrony, as well as Proof-of-Stake vs. Proof-of-Work. (3) An overview of a method and language, DistAlgo, for expressing distributed algorithms precisely at a high-level as pseudocode and having them be directly executable at the same time. (4) A study of exact algorithms expressed at a high level for the most extensively studied algorithm variants, including Lamport's Paxos for classical consensus and Nakamoto's Bitcoin algorithm for blockchain consensus. (5) A demo of the direct execution of these exact algorithms by distributed processes.
AB - This tutorial describes well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus, and discusses exact algorithms that are high-level as in pseudocode and directly executable at the same time. The tutorial consists of five parts:(1) A introduction to different distributed consensus problems, from classical consensus and Byzantine consensus to blockchain consensus. (2) An overview of well-known algorithms, from Paxos for classical consensus to the Bitcoin algorithm for blockchain consensus, including important variants such as Viewstamped Replication and Virtual Synchrony, as well as Proof-of-Stake vs. Proof-of-Work. (3) An overview of a method and language, DistAlgo, for expressing distributed algorithms precisely at a high-level as pseudocode and having them be directly executable at the same time. (4) A study of exact algorithms expressed at a high level for the most extensively studied algorithm variants, including Lamport's Paxos for classical consensus and Nakamoto's Bitcoin algorithm for blockchain consensus. (5) A demo of the direct execution of these exact algorithms by distributed processes.
KW - Bitcoin algorithm
KW - Blockchain consensus
KW - Distributed consensus
KW - High-level queries
KW - Paxos algorithm
KW - Synchronization conditions
UR - https://www.scopus.com/pages/publications/85071025931
U2 - 10.1145/3293611.3338022
DO - 10.1145/3293611.3338022
M3 - Conference contribution
AN - SCOPUS:85071025931
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 544
EP - 545
BT - PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
PB - Association for Computing Machinery
Y2 - 29 July 2019 through 2 August 2019
ER -