According to previous survey studies, existing consensus building methods for distributed ledger technology (DLT) have not been able to simultaneously achieve high TPS, high decentralization, and sufficient security (blockchain trilemma). PoW is a groundbreaking technology that has realized consensus building between more than several thousand nodes (decentralization of consensus). However, it has a major problem of huge power consumption. PoS has achieved a significant reduction in it, but it is difficult to increase the number of consensuses building nodes, resulting in a problem with decentralization. DAG-based DLT has been successful in improving TPS but has the same problem as PoS in the number of consensus nodes. In this paper, we propose a new consensus building method that solves the trilemma by utilizing the “transaction graph” and improve TPS. In the proposed method, voting information is piggybacked on the transactions and the voting state is explicitly shared between nodes. Unlike existing technologies, the amount of calculation and the amount of data for state management for voting hardly increases even if the number of consensuses building nodes increases. The proposed method can simultaneously achieve low power consumption equivalent to PoS, high TPS equivalent to existing DAG, and high decentralization and security close to PoW. We also demonstrate its effectiveness through analysis and simulation.

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

A New DLT Consensus Building Method for Achieving High TPS and High Decentralization Simultaneously

  • Hitomi Yazawa,
  • Kiyora Kodama,
  • Takeshi Ogawa

摘要

According to previous survey studies, existing consensus building methods for distributed ledger technology (DLT) have not been able to simultaneously achieve high TPS, high decentralization, and sufficient security (blockchain trilemma). PoW is a groundbreaking technology that has realized consensus building between more than several thousand nodes (decentralization of consensus). However, it has a major problem of huge power consumption. PoS has achieved a significant reduction in it, but it is difficult to increase the number of consensuses building nodes, resulting in a problem with decentralization. DAG-based DLT has been successful in improving TPS but has the same problem as PoS in the number of consensus nodes. In this paper, we propose a new consensus building method that solves the trilemma by utilizing the “transaction graph” and improve TPS. In the proposed method, voting information is piggybacked on the transactions and the voting state is explicitly shared between nodes. Unlike existing technologies, the amount of calculation and the amount of data for state management for voting hardly increases even if the number of consensuses building nodes increases. The proposed method can simultaneously achieve low power consumption equivalent to PoS, high TPS equivalent to existing DAG, and high decentralization and security close to PoW. We also demonstrate its effectiveness through analysis and simulation.