论文标题
亲切的矿工：每个可能性的快速有效共识
Cordial Miners: Fast and Efficient Consensus for Every Eventuality
论文作者
论文摘要
亲切的矿工是一个有效的拜占庭原子广播方案的家族，并具有异步和最终同步的实例。 他们通过放弃可靠的广播作为基础，将基于DAG的最新协议的延迟提高了几乎2倍，并实现了O（n）的最佳良好复杂性。 相反，亲切的矿工使用Blocklace（完全订购的区块链数据结构的部分订购的对应物）来实现共识的三种算法组件：传播，模棱两可的排斥和订购。
Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block. Rather, Cordial Miners use the blocklace -- a partially-ordered counterpart of the totally-ordered blockchain data structure -- to implement the three algorithmic components of consensus: Dissemination, equivocation-exclusion, and ordering.
