Introduction to Consensus (Part II) with Andrew Lewis-Pye | a16z crypto research talks
Source: YouTube · a16z crypto · published Oct 7, 2022 · 1:11:02
The video explores Byzantine agreement, Byzantine broadcast, and State Machine Replication (SMR), analyzing their feasibility under synchronous versus partially synchronous network conditions 0:08.
Key Takeaways:
• Byzantine agreement and broadcast become equivalent when f < n/2 in synchronous settings, but remain distinct otherwise 4:44
• SMR protocols require processors to maintain consistent logs and ensure liveness by eventually confirming all valid transactions 13:25
• Partial synchronicity is formalized using the Global Stabilization Time (GST) or unknown Delta models, which are theoretically equivalent 27:53
• Byzantine broadcast is impossible in partially synchronous settings if the designated leader is potentially faulty 35:42
• In partially synchronous environments, both Byzantine agreement and SMR are only feasible when f < n/3 38:00
The analysis highlights how protocol capabilities shift significantly based on network assumptions and fault tolerance thresholds, distinguishing deterministic permissioned consensus from probabilistic permissionless systems.
Sources:
Generate CPE Credits
Generate a professional CPE document from this video's transcript.
Estimated credit: 1 CPE hours
Estimate uses the video runtime (1 hour ≈ 1 CPE, rounded to the nearest 0.5, minimum 0.5, maximum 2.0). The final amount can be lower after review, never higher.
Topic: Cybersecurity. Commonly maps to: Security and Risk Management, Security Operations. Exact CISSP domains are assigned during generation.
Free account. One generation at a time, with a daily limit.
CPEBuddy is independent and not affiliated with or endorsed by ISC2, ISACA, or any certification body. Exports are formatted for common CPE submissions; acceptance is at your certification body's discretion.
Transcript Preview
First 800 characters of the transcript
all right good morning everyone let's go ahead and get started um so today we have again Andy Lewis pie one of our faculty fellows uh he'll be giving the second part of this two-part introduction to consensus thanks dude right yeah so uh let's start by just quickly recapping like where we are what we talked about last time uh so we we had this uh we set up a formal framework right and so let's just remind ourselves how that went this Joe's just coming in Okay so we've got a set of end processors I'm recording them from uh giving them names from zero up to n minus one at F of those maybe 40 we don't know which okay every processor knows n and they know F okay so then a number of processes involved uh they know some upper bound on the number of faulty processes uh and they also know their ow…