PODC 2021 — Session 6 Talk 1 — Breaking the O(sqrt n)-Bit Barrier: Byzantine Agreement with...

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Describes breaking bit-complexity barriers in Byzantine agreement, teaching cryptographic protocols and distributed consensus bounds. PODC talk conveys advances in fault-tolerant distributed computing.

A 19-minute video from Association for Computing Machinery (ACM): “PODC 2021 — Session 6 Talk 1 — Breaking the O(sqrt n)-Bit Barrier: Byzantine Agreement with...”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of ACM PODC 2021