Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.

中文翻译：

---

分散代理之间基于拜占庭协议的算法

分布式共识需要超过一半的代表大会同意才能产生不可逆的结果，并且共识算法的性能会随着节点数量的增加而恶化。可以通过将协议委派给几个选定的节点来解决此问题。由于所选节点必须符合算法要求的拜占庭节点比率标准，因此任何分散节点选择的结果均不可信任。但是，某些受信任的节点垄断了共识节点的选择过程，从而破坏了分散化并导致了三难。因此，需要一种共识节点选择算法，该算法可以使用分散方法构建可承受拜占庭式故障的会议。在本文中，提出了一种基于分散主体间拜占​​庭协议的算法，以促进分散节点之间的共识。通过应用提出的随机数证明算法，它为每个块选择一组随机共识节点。通过控制所选节点中包含的拜占庭百分比，当任意节点选择共识节点时，它可以解决三难问题。