首页> 外文期刊>Quality Control, Transactions >Concordia: A Streamlined Consensus Protocol for Blockchain Networks
【24h】

Concordia: A Streamlined Consensus Protocol for Blockchain Networks

机译:Concordia:BlockChain网络的简化协商协议

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper, we present a novel Byzantine fault-tolerant consensus protocol for sharded blockchain networks that does not rely on expensive leader-driven communication. The proposed protocol selects a single block proposer at a time and uses threshold signatures as a voting mechanism to confirm the validity of the proposed block. By using a gossip-like communication scheme, each node can collect and recover the group signature within $mathrm {O(log}N)$ steps. With only one block proposer per consensus round, there is no possibility of conflicting blocks and resultant forks. Therefore, our consensus protocol requires only one round of one-way communication to achieve finality for each block. Our protocol guarantees safety and liveness while tolerating up to $f$ faulty participants among $2f+1$ nodes. Our performance study shows that the proposed protocol enables hundreds of nodes to participate in the agreement process, and can finalize large blocks in approximately 10 seconds.
机译:在本文中,我们提出了一种新的Byzantine容错共识协议,用于分布的区块链网络,不依赖于昂贵的领导者驱动的通信。所提出的协议一次选择单个块提议器,并使用阈值签名作为投票机制,以确认所提出的块的有效性。通过使用八卦类似的通信方案,每个节点可以收集和恢复<内联公式XMLNS:mml =“http://www.w3.org/1998/math/mathml”xmlns:xlink =“http中的组签名://www.w3.org/1999/xlink“> $ mathrm {o(log} n)$ 步骤。只有每个共识的一个街区提议者,没有可能相互冲突的块和结果叉。因此,我们的共识协议只需要一轮单向沟通,以实现每个街区的终结。我们的协议保证安全和活力,同时容忍<内联公式XMLNS:MML =“http://www.w3.org/1998/math/mathml”xmlns:xlink =“http://www.w3.org/ 1999 / xlink“> $ f $ $ 2f + 1 $ < /内联 - 公式>节点。我们的绩效研究表明,该拟议的协议使数百个节点能够参与协议过程,并可以在大约10秒内完成大块。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号