Definition ∞ The Dolev-Reischuk Bound is a theoretical limit in distributed computing that specifies the minimum number of rounds required to achieve consensus in the presence of malicious actors. This bound is particularly relevant in asynchronous networks where message delivery times are unpredictable. It quantifies the inherent communication overhead for secure agreement.
Context ∞ The Dolev-Reischuk bound informs the design of fault-tolerant consensus protocols in blockchain systems, influencing the efficiency and security properties of various distributed ledgers. Researchers continue to seek protocols that approach or meet this theoretical minimum under practical conditions.