Course Description: ​
In this course, you will learn the mathematical foundations of distributed consensus as well as how to construct consensus protocols and prove them secure. We will motivate distributed consensus with a modern narrative, and yet we will cover the classical theoretical foundations of consensus. We will cover both classical, permissioned consensus protocols, as well as modern, permissionless consensus protocols such as Bitcoin.​
Logistics: ​
Instructor:
Time:
Location:
Office hour:

Contact:
Elaine Shi
TR 9:50-11:10am
Zoom
Please send me messages through Canvas to schedule.
Please contact me through Canvas.
Textbook: ​
Foundations of Distributed Consensus and Blockchains
Grading: ​
5 homeworks: 12% each
Mini research project/presentation: 35%
Class participation: 5%
Bonus: help improve textbook (up to 10%)
Syllabus: ​
  • Lecture 1 (9/8) : Distributed Consensus: from Aircraft Control to Cryptocurrencies  
  • Lecture 2 (9/10) : Byzantine Broadcast and the Dolev-Strong Protocol
  • Mini Research Project (9/15) : A Simulator Framework for Consensus
  • Lecture 3 (9/15) : Byzantine Broadcast without Digital Signatures (Lower Bound)
  • Lecture 4 (9/17) : Byzantine Broadcast without Digital Signatures (Upper Bound)
  • Lecture 5 (9/22) : Blockchain and State Machine Replication
  • Lecture 6 (9/24) : A Simple Blockchain Protocol -- Streamlet
  • Lecture 7 (9/29) : Lower Bound for Partial Synchrony
  • Lecture 8 (10/13, 10/15) : Round Complexity of Deterministic Consensus
  • Lecture 9 (10/1) : Round Complexity of Randomized Consensus
  • Lecture 10 (10/20) : Communication Complexity of Consensus
  • Lecture 11: Asynchronous Consensus: The FLP Impossibility
  • Lecture 12: A Randomized Asynchronous Consensus Protocol
  • Lecture 13 (10/22) : Bitcoin and Nakamoto's Blockchain
  • Lecture 14 (10/27) : The Selfish Mining Attack and Incentive Compatibility
  • Lecture 15 (10/29) : A Simple, Deterministic Longest-Chain-Style Protocol
  • Lectures 16-18 (11/3 - 11/10) : Analysis of Nakamoto's Blockchain
  • Lecture 19: Proof of Stake
Academic Integrity: ​
Honesty and transparency are important features of good scholarship. Equally importantly, plagiarism and cheating are serious academic offenses with serious consequences. If you are discovered engaging in either behavior in this course, you will earn a failing grade on the assignment in question, and further disciplinary action may be taken. For a clear description of what counts as plagiarism, cheating, and/or the use of unauthorized sources, please see the University Policy on Academic Integrity and the Carnegie Mellon Code on Academic Integrity.
free web stats