Cobalt:开放网络中的BFT治理
Cobalt: BFT Governance in Open Networks
摘要:
我们提出了钴,一种新的原子广播算法,工作在网络与非统一的信任,没有全球协议的参与者,并概率保证,即使在最大的故障和任意故障的存在下,取得进展。Cobalt满足的确切属性使其特别适用于设计一个高效的分散式“投票网络”,该网络允许一个公共的开放式节点组以公平和一致的方式同意对一些共享规则集的更改,同时容忍一些可信节点和任意多个恶意行为的不可信节点。我们还定义了一组新的属性,任何安全的去中心化治理算法都必须满足这些属性,并且Cobalt满足所有这些属性。
英文摘要:
We present Cobalt, a novel atomic broadcast algorithm that works in networks with non-uniform trust and no global agreement on participants, and is probabilistically guaranteed to make forward progress even in the presence of maximal faults and arbitrary asynchrony. The exact properties that Cobalt satisfies makes it particularly applicable to designing an efficient decentralized "voting network" that allows a public, open-entry group of nodes to agree on changes to some shared set of rules in a fair and consistent manner while tolerating some trusted nodes and arbitrarily many untrusted nodes behaving maliciously. We also define a new set of properties which must be satisfied by any safe decentralized governance algorithm, and all of which Cobalt satisfies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。