Common use of Time Complexity vs Clause in Contracts

Time Complexity vs. Resilience If we define time complexity as in Section 3.4, we get the following result. In good runs, our atomic broadcast algorithms deliver messages within 2δ and require f < n/3. This result is for an atomic broadcast algorithm inspired by Xxxxx’x algorithm. Similarly, we could have derived an atomic broadcast algorithm from Ben-Or’s algorithm, which would have led to a time complexity of 3δ for the delivery of messages and f < n/2. So we have the same “time complexity vs. resilience” trade-off as for consensus, see Section 3.4.

Time Complexity vs. Resilience If we define time complexity as in Section 3.4, we get the following result. In good runs, our atomic broadcast algorithms deliver messages within 2δ and require re- quire f < n/3. This result is for an atomic broadcast algorithm inspired by Xxxxx’x algorithm. Similarly, we could have derived an atomic broadcast algorithm algo- rithm from Ben-Or’s algorithm, which would have led to a time complexity of 3δ for the delivery of messages and f < n/2. So we have the same “time complexity vs. resilience” trade-off as for consensus, see consensus (Section 3.4.). 5 Performance Evaluation‌‌‌

Time Complexity vs. Resilience If we define define time complexity as in Section 3.4, we get the following result. In good runs, our atomic broadcast algorithms deliver messages within 2δ and require re- quire f < n/3. This result is for an atomic broadcast algorithm inspired by Xxxxx’x algorithm. Similarly, we could have derived an atomic broadcast algorithm algo- rithm from Ben-Or’s algorithm, which would have led to a time complexity of 3δ for the delivery of messages and f < n/2. So we have the same “time complexity vs. resilience” trade-off off as for consensus, see consensus (Section 3.4.). 5 Performance Evaluation‌‌‌