论文标题
que sera共识：与私人硬币和阈值逻辑时钟的简单异步一致
Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks
论文作者
论文摘要
通常认为，异步共识比部分同步算法更为复杂，困难和昂贵，尤其是不使用常见硬币。本文挑战了传统的智慧与que sera共识QSC的质疑，这是一种共识的方法，从网络异步方面清晰分解了协议问题。 QSC仅使用私人硬币，并在$ O（1）$预期的通信回合中达成共识。它依赖于“锁定步骤”同步广播，但可以在阈值逻辑时钟（TLC）算法上运行时间，并在一个基本的异步网络上以部分可靠的通信进行时间和节奏。这种组合可以说是比（多）Paxos或带领Leader选举的（多）Paxos或Raft等部分同步共识的方法更简单，并且对于缓慢的领导者或有针对性的网络拒绝服务攻击更为强大。 QSC at tlc的最简单配方预期$ O（n^2）$消息和$ o（n^4）$ bits $ lits $ bits $ bits $ o（n^3）$ bits bits具有直接优化。一个按需实施，客户充当“自然领导者”，以执行仅实施被动键值商店的状态服务器的协议，可以实现$ o（n^2）$（n^2）$预期的通信位，每个客户驱动协议。
It is commonly held that asynchronous consensus is much more complex, difficult, and costly than partially-synchronous algorithms, especially without using common coins. This paper challenges that conventional wisdom with que sera consensus QSC, an approach to consensus that cleanly decomposes the agreement problem from that of network asynchrony. QSC uses only private coins and reaches consensus in $O(1)$ expected communication rounds. It relies on "lock-step" synchronous broadcast, but can run atop a threshold logical clock (TLC) algorithm to time and pace partially-reliable communication atop an underlying asynchronous network. This combination is arguably simpler than partially-synchronous consensus approaches like (Multi-)Paxos or Raft with leader election, and is more robust to slow leaders or targeted network denial-of-service attacks. The simplest formulations of QSC atop TLC incur expected $O(n^2)$ messages and $O(n^4)$ bits per agreement, or $O(n^3)$ bits with straightforward optimizations. An on-demand implementation, in which clients act as "natural leaders" to execute the protocol atop stateful servers that merely implement passive key-value stores, can achieve $O(n^2)$ expected communication bits per client-driven agreement.
