Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
Rex Fernando, Yuval Gelles, Ilan Komargodski · 2026
Read Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election by Rex Fernando, Yuval Gelles, Ilan Komargodski (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13630810.txt.
Description
Rex Fernando and two colleagues present a protocol that lets a network of computers reach agreement. It works even when up to a third of the members are malicious. Each member sends remarkably little data. Such Byzantine agreement underpins blockchains and secure joint computation. The challenge is scaling it without exotic assumptions.
Earlier efficient designs leaned on strong, non-standard proof systems. The new protocol rests only on the Learning With Errors assumption. That is a standard, well-studied hardness base for post-quantum cryptography. It still needs a public key setup and a shared reference string. Its route runs through a generic use of batched argument systems. The authors frame the result as scalable agreement on conservative foundations.
Catalog record
| CREATOR | Rex Fernando, Yuval Gelles, Ilan Komargodski |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 76 KB |
| LICENSE | https://creativecommons.org/licenses/by/4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |