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.

翻译：和睦矿工是一族高效的拜占庭原子广播协议，包含适用于异步和最终同步场景的实例。该协议通过摒弃可靠广播这一基础组件，将当前最先进的基于DAG的协议延迟降低近2倍，并实现了最优良性情况下的O(n)复杂度。具体而言，和睦矿工采用区块花（blocklace）——作为全序区块链数据结构的偏序对应物——来实现共识的三大算法组件：数据分发、冲突排除与排序。