Instructor: Ling Ren
Lectures: Tue/Thu 12:30 PM - 01:45 PM, 1214 Siebel Center
Office hours: Wed 2 PM - 3 PM or by appointment, 4312 Siebel Center
15% Class Participation
35% Assignment (out 10/08, due 10/25)
Each student can choose between giving a lecture or completing a final project. For lectures, you can choose a topic from the list provided below; you will be required to read one or two papers on the topic, explain them to the class and share your lecture note. For projects, you are expected to come up with your own project idea; you will be required to present your result in class and submit a written report. Each student lecture/presentation will be 30 minutes.
Selection of lecture topics or project ideas is due 10/18, but you are encouraged to finalize your selection earlier to secure your preferred topic. If two students are interested in the same lecture/project, teamwork will be encouraged if the topic/project indeed involves twice the work.
Candidate topics for student lectures and projects
(2) indicates that two 30-minutes lecture slots are available on the topic.
Fault bound proof Easy impossibility proofs for distributed consensus problems
Consensus on large values Optimal Extension Protocols for Byzantine Broadcast and Agreement
Reliable broadcast Asynchronous Byzantine Agreement Protocols
Recent synchronous BFT Sync HotStuff: Simple and Practical Synchronous State Machine Replication
Recent partially synchronous BFT Casper the Friendly Finality Gadget
Recent asynchronous BFT The Honey Badger of BFT Protocols
Off-chain solutions The Bitcoin Lightning Network
Selfish mining (2) Majority is not Enough: Bitcoin Mining is Vulnerable Stubborn Mining
Deterministic longest chain Analysis of Deterministic Longest-Chain Protocols
Proof of stake designs (2) The Sleepy Model of Consensus Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol