Optimization and Implementation of Hashgraph Consensus Algorithm Based on Path Storage Table

Hashgraph is a blockchain consensus algorithm that uses a Directed Acyclic Graph (DAG) structure in the database. Hashgraph introduces the concept of virtual voting, which allows nodes to send out blocks concurrently without additional communication overheads and achieves Byzantine fault tolerance i...

Full description

Saved in:
Bibliographic Details
Published in:Ji suan ji gong cheng Vol. 50; no. 6; pp. 166 - 178
Main Author: LIU Yinhao, JIANG Wenbao, SUN Linkun, WANG Yongpan
Format: Journal Article
Language:Chinese
English
Published: Editorial Office of Computer Engineering 01.06.2024
Subjects:
blockchain|consensus algorithm|directed acyclic graph(dag)|hashgraph protocol|byzantine fault tolerance
ISSN:1000-3428
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Hashgraph is a blockchain consensus algorithm that uses a Directed Acyclic Graph (DAG) structure in the database. Hashgraph introduces the concept of virtual voting, which allows nodes to send out blocks concurrently without additional communication overheads and achieves Byzantine fault tolerance in asynchronous scenarios. However, the virtual voting algorithm proposed by the Hashgraph has a high algorithmic time complexity, and the consensus operational logic is too complex. Accordingly, this study proposes a Hashgraph optimization scheme based on path storage tables. First, a witness determination method based on a vertex reachability table is proposed. The method records the reachability relationship between the generated and historical events in real time through storage paths. In the round partitioning stage, the backtracking algorithm is replaced by a function that queries the reachability information of the vertex events to reduce the time complexity of the witness determination algorithm. Second, a well-known witness determination method based on a historical reachability table is proposed to address the issue where the vertex reachability table cannot determine event relationships across rounds. The historical reachability table stores the reachability relationship between witnesses and historical events. It solves the problem of repeatedly backtracking views during the well-known witness determination stage by querying the historical reachability table. Finally, based on the vertex and historical reachability tables, the complex consensus calculation in the Hashgraph is improved to enhance the algorithm's efficiency and accelerate event confirmation speed. Experimental results show that, compared with the original Hashgraph consensus algorithm, the proposed optimization scheme improves algorithm efficiency by 65.76% and throughput by an average of 41.27%.
AbstractList Hashgraph is a blockchain consensus algorithm that uses a Directed Acyclic Graph (DAG) structure in the database. Hashgraph introduces the concept of virtual voting, which allows nodes to send out blocks concurrently without additional communication overheads and achieves Byzantine fault tolerance in asynchronous scenarios. However, the virtual voting algorithm proposed by the Hashgraph has a high algorithmic time complexity, and the consensus operational logic is too complex. Accordingly, this study proposes a Hashgraph optimization scheme based on path storage tables. First, a witness determination method based on a vertex reachability table is proposed. The method records the reachability relationship between the generated and historical events in real time through storage paths. In the round partitioning stage, the backtracking algorithm is replaced by a function that queries the reachability information of the vertex events to reduce the time complexity of the witness determination algorithm. Second, a well-known witness determination method based on a historical reachability table is proposed to address the issue where the vertex reachability table cannot determine event relationships across rounds. The historical reachability table stores the reachability relationship between witnesses and historical events. It solves the problem of repeatedly backtracking views during the well-known witness determination stage by querying the historical reachability table. Finally, based on the vertex and historical reachability tables, the complex consensus calculation in the Hashgraph is improved to enhance the algorithm's efficiency and accelerate event confirmation speed. Experimental results show that, compared with the original Hashgraph consensus algorithm, the proposed optimization scheme improves algorithm efficiency by 65.76% and throughput by an average of 41.27%.
Author LIU Yinhao, JIANG Wenbao, SUN Linkun, WANG Yongpan
Author_xml – sequence: 1
  fullname: LIU Yinhao, JIANG Wenbao, SUN Linkun, WANG Yongpan
  organization: School of Information Management, Beijing Information Science and Technology University, Beijing 100192, China
BookMark eNo9zF1LwzAUxvFcTHCbfof4AVpPkjZtL-dQNxhMcN4J5TQ9fRltUpp4oZ9eceLVAz8e_iu2sM4SY3cCYlHoLL8_x733NhYAEKlE5jGAzjIpFmz5b9ds5f0ZIJESYMnej1Pox_4LQ-8sR1vz_TgNNJINF3IN36Hv2hmnjm-d9WT9h-eboXVzH7qRP6Cnmv88XzB0_DW4GVviJ6wGumFXDQ6ebv92zd6eHk_bXXQ4Pu-3m0NUC6VDRCI3SVHUgrQmgQIVyaQQeaGNamrIM2WoSjOQjc4USJNqk1cpmiaBQmnRqDXbX7q1w3M5zf2I82fpsC9_wc1tiXPozUClrEUt8yrLCChBWaFIGqUwTUGbJgVU32IMZNc
ContentType Journal Article
DBID DOA
DOI 10.19678/j.issn.1000-3428.0067721
DatabaseName DOAJ Directory of Open Access Journals
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 178
ExternalDocumentID oai_doaj_org_article_2d1d28b77e0e4a2ba14f33a5506cf50a
GroupedDBID -0Y
5XA
5XJ
92H
92I
ABJNI
ACGFS
ALMA_UNASSIGNED_HOLDINGS
CCEZO
CUBFJ
CW9
GROUPED_DOAJ
TCJ
TGT
U1G
U5S
ID FETCH-LOGICAL-d136t-e18c499d1e66e1a1a3e2491896c3fd0873ceb5702f67302c56c8b5acf409361f3
IEDL.DBID DOA
ISSN 1000-3428
IngestDate Mon Nov 03 21:56:07 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language Chinese
English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d136t-e18c499d1e66e1a1a3e2491896c3fd0873ceb5702f67302c56c8b5acf409361f3
OpenAccessLink https://doaj.org/article/2d1d28b77e0e4a2ba14f33a5506cf50a
PageCount 13
ParticipantIDs doaj_primary_oai_doaj_org_article_2d1d28b77e0e4a2ba14f33a5506cf50a
PublicationCentury 2000
PublicationDate 2024-06-01
PublicationDateYYYYMMDD 2024-06-01
PublicationDate_xml – month: 06
  year: 2024
  text: 2024-06-01
  day: 01
PublicationDecade 2020
PublicationTitle Ji suan ji gong cheng
PublicationYear 2024
Publisher Editorial Office of Computer Engineering
Publisher_xml – name: Editorial Office of Computer Engineering
SSID ssj0042200
Score 2.2573545
Snippet Hashgraph is a blockchain consensus algorithm that uses a Directed Acyclic Graph (DAG) structure in the database. Hashgraph introduces the concept of virtual...
SourceID doaj
SourceType Open Website
StartPage 166
SubjectTerms blockchain|consensus algorithm|directed acyclic graph(dag)|hashgraph protocol|byzantine fault tolerance
Title Optimization and Implementation of Hashgraph Consensus Algorithm Based on Path Storage Table
URI https://doaj.org/article/2d1d28b77e0e4a2ba14f33a5506cf50a
Volume 50
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  issn: 1000-3428
  databaseCode: DOA
  dateStart: 20160101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.doaj.org/
  omitProxy: false
  ssIdentifier: ssj0042200
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8NAEF2kiOhB_MRvVvAam91NNptjK5aeasEKPQhlsh-2YlNpo7_f2U2UevLiLWxCCDuZ2fdg5j1CbrwAIUCRRoXO0yhJBEQgrcIrbbjWVkvhgtlENhio8Tgfrll9-Z6wWh643rg2N8xwVWSZjW0CvACWOCEAgbXULo0DNIqz_JtM1TU44TyudQhirDKIsLfIdZjMw9Lcfg3pdftzz7d2IcZkv1T7w_HS2yO7DS6knfp79smGLQ_Izppa4CF5fsD0njdzkxRKQ4O077yZHirpwtE-rKZBg5p6J05vY7GinbeXxXJWTee0i0eWofjkEHEffUS6jdWEjvz01BF56t2P7vpRY44QGSZkFVmmNLIVw6yUlgEDYZFJMZVLLZyJVSa0LdIs5k5iEnOdSq2KFLRDQickc-KYtMpFaU8IdcJJZ3wm554AATDvmSmB45rkyp2Srt-YyXutfzHxitRhAeM0aeI0-StOZ__xknOyzRFU1K1aF6RVLT_sJdnUn9VstbwKv8AXCW60_w
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimization+and+Implementation+of+Hashgraph+Consensus+Algorithm+Based+on+Path+Storage+Table&rft.jtitle=Ji+suan+ji+gong+cheng&rft.au=LIU+Yinhao%2C+JIANG+Wenbao%2C+SUN+Linkun%2C+WANG+Yongpan&rft.date=2024-06-01&rft.pub=Editorial+Office+of+Computer+Engineering&rft.issn=1000-3428&rft.volume=50&rft.issue=6&rft.spage=166&rft.epage=178&rft_id=info:doi/10.19678%2Fj.issn.1000-3428.0067721&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_2d1d28b77e0e4a2ba14f33a5506cf50a
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1000-3428&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1000-3428&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1000-3428&client=summon