UI Wordmark

CS 598 CAL - Special Topics - Consensus Algorithms

Campus: Urbana-Champaign


Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: May be repeated in the same or separate terms if topics vary.

Special Instructions:

This course covers classic results and recent advances in consensus algorithms. The course studies different problem formulations of consensus including Byzantine agreement, broadcast primitives and state machine replication (a.k.a, blockchains); different models and assumptions regarding timing, fault pattern, cryptography, and setup; state-of-art algorithms and lower bounds under various combinations of settings; common algorithm design techniques including randomization, leader-based approach, and quorum systems; Nakamoto-s new permissionless model, longest-chain paradigm, the Bitcoin protocol, its mathematical analysis, proposals to improve Nakamoto consensus; longest-chain protocols with other resources or stake, and their connection to classic consensus algorithms; and recent advances in consensus algorithms inspired by Nakamoto's paradigm.

Option 1

Number of Required Visit(s): 0

Course Level: Graduate

Credit: 4

Term(s): Spring


Bachelor's Degree

Master's Degree

Doctoral Degree


Continuing Education

Search Programs

Search Courses


Contact Us

University of Illinois Online
Phone: (866) 633-8465 - Join Us  Facebook
© Copyright 2015 - University of Illinois

Cookie Settings