The Dolev and Reischuk Lower Bound: Does Agreement need Quadratic Messages?
How scalable is Byzantine agreement? Does solving agreement require non-faulty parties to send a quadratic number of messages in the number of potential faults? In this post, we highlight the Dolev and Reischuk lower bound from 1982 that addresses this fundamental question. Dolev and Reischuk 1982: any deterministic Broadcast protocol...| decentralizedthoughts.github.io
