Common use of Additional Related Work Clause in Contracts

Additional Related Work. ‌ ( / ) / The literature on Byzantine agreement is vast (see e.g., [18, 21, 30]), and we limit ourselves to the most relevant to this work. As mentioned earlier, the best-known bound for Byzantine agreement under an adaptive adversary is a long-standing result of Chor and ▇▇▇▇ [8] who give a randomized protocol that finishes in expected 𝑂 𝑡 log 𝑛 rounds and tolerates up to 𝑡 < 𝑛 3 Byzantine nodes. We note that this protocol assumes a non-▇▇▇▇▇▇▇ adversary (though this can also be modified to work for ▇▇▇▇▇▇▇). ( / ( )) The work of Augustine, ▇▇▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇ [3] gives a protocol for Byzantine agreement in dynamic and sparse expander networks that can tolerate 𝑂 √𝑛 polylog 𝑛 Byzantine nodes. We note that this setting differs from the one considered here; the agreement protocol in [3] also differs