论文标题
缠结2.0无领导者中amoto在最重的dag上共识
Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG
论文作者
论文摘要
我们介绍了缠结2.0的理论基础,这是一种基于定向的无环形图(DAG)的概率无领导者共识方案,称为Tangle。缠结自然会成功地将区块链作为其下一个进化步骤,因为它提供了适合建立更有效和可扩展的分布式分类帐解决方案的功能。 共识不再在最长的链中找到,而在最重的DAG中找到,在最重的DAG中,POW被基于股份或声誉的权重函数所取代。 DAG结构和基于现实的基于现实的UTXO分类帐可以并行验证交易,而无需总订购。此外,它可以拆除矿工和验证者的中介,允许在节点级别而不是在验证器级别上进行\ emph {fosose-vote}范式遵循纯粹的两步过程。 我们提出了一个框架,以分析不同的沟通和对手模型下的livesice和安全性。这允许在某些边缘情况和异步通信模型中提供不可能的结果。我们为假设具有常见的随机硬币的协议安全性提供了正式的证明。
We introduce the theoretical foundations of the Tangle 2.0, a probabilistic leaderless consensus protocol based on a directed acyclic graph (DAG) called the Tangle. The Tangle naturally succeeds the blockchain as its next evolutionary step as it offers features suited to establish more efficient and scalable distributed ledger solutions. Consensus is no longer found in the longest chain but on the heaviest DAG, where PoW is replaced by a stake- or reputation-based weight function. The DAG structure and the underlying Reality-based UTXO Ledger allow parallel validation of transactions without the need for total ordering. Moreover, it enables the removal of the intermediary of miners and validators, allowing a pure two-step process that follows the \emph{propose-vote} paradigm at the node level and not at the validator level. We propose a framework to analyse liveness and safety under different communication and adversary models. This allows providing impossibility results in some edge cases and in the asynchronous communication model. We provide formal proof of the security of the protocol assuming a common random coin.