Foundations of Blockchains (Lecture 5.2: Completing the Proof of the FLP Impossibility Theorem)
Tim Roughgarden Lectures · 25:59
This video proves Lemma 2 of the FLP impossibility result: starting from any ambiguous (bivalent) configuration Ci and any pending message (r,m), you can always deliver some sequence of *other* messages and then deliv...