Scholarlink

<p>Serving as the backbone for next-generation advancements like Web3 and the Metaverse, blockchain is expected to support high-frequency and high-concurrency applications, including real-time gaming, decentralized exchanges, and cross-chain interactions. However, current blockchain systems struggle to meet the low-latency requirements of emerging applications. This paper introduces Symphony, a high-performance Byzantine Fault Tolerant (BFT) blockchain consensus protocol designed to address these challenges. Symphony proposes a two-stage confirmation mechanism by adding a fast confirmation stage before the final secure confirmation. By isolating the impact of rare malicious activities, the fast confirmation phase allows the majority of blockchain transactions to be confirmed quickly, thereby achieving low latency and high throughput. Symphony accomplishes this with a novel vote-tree algorithm that separately addresses crash and malicious issues, allowing fast confirmation within two message delays and ensuring complete secure confirmation in the subsequent four message delays. In addition, Symphony addresses the problem of proposer crashes by employing multiple candidates to propose blocks. This approach enhances robustness to network latency variations caused by network fluctuations. Comparative evaluations demonstrate that Symphony delivers higher throughput and lower latency than HotStuff, Jolteon, and PBFT.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Symphony: unleashing efficiency and robustness in blockchain consensus

  • 期刊论文

  • 发表日期：

    2026年6月15日

查看全文
  • Nianzu Sheng,
  • Tong Zhou,
  • He Zhao,
  • Xiaoting Zhang,
  • Xiaofeng Li,
  • Jinlin Xu

摘要

Serving as the backbone for next-generation advancements like Web3 and the Metaverse, blockchain is expected to support high-frequency and high-concurrency applications, including real-time gaming, decentralized exchanges, and cross-chain interactions. However, current blockchain systems struggle to meet the low-latency requirements of emerging applications. This paper introduces Symphony, a high-performance Byzantine Fault Tolerant (BFT) blockchain consensus protocol designed to address these challenges. Symphony proposes a two-stage confirmation mechanism by adding a fast confirmation stage before the final secure confirmation. By isolating the impact of rare malicious activities, the fast confirmation phase allows the majority of blockchain transactions to be confirmed quickly, thereby achieving low latency and high throughput. Symphony accomplishes this with a novel vote-tree algorithm that separately addresses crash and malicious issues, allowing fast confirmation within two message delays and ensuring complete secure confirmation in the subsequent four message delays. In addition, Symphony addresses the problem of proposer crashes by employing multiple candidates to propose blocks. This approach enhances robustness to network latency variations caused by network fluctuations. Comparative evaluations demonstrate that Symphony delivers higher throughput and lower latency than HotStuff, Jolteon, and PBFT.