Welcome to the resource topic for 2025/1856
Title:
Optimal Good-Case Latency for Sleepy Consensus
Authors: Yuval Efron, Joachim Neu, Ling Ren, Ertem Nusret Tas
Abstract:In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a BB or BA protocol under certain favorable conditions, namely the designated leader being correct (for BB), or all parties having the same input value (for BA). We provide a full characterization of the feasibility and impossibility of good-case latency, for both BA and BB, in the synchronous sleepy model. Surprisingly to us, we find irrational resilience thresholds emerging: 2-round good-case BB is possible if and only if at all times, at least \frac{1}{\varphi} \approx 0.618 fraction of the active parties are correct, where \varphi = \frac{1+\sqrt{5}}{2} \approx 1.618 is the golden ratio; 1-round good-case BA is possible if and only if at least \frac{1}{\sqrt{2}} \approx 0.707 fraction of the active parties are correct.
ePrint: https://eprint.iacr.org/2025/1856
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .