{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:23:51Z","timestamp":1757622231279,"version":"3.44.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3604512","type":"journal-article","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:31:49Z","timestamp":1756755109000},"page":"153035-153055","source":"Crossref","is-referenced-by-count":0,"title":["Hashgraph Over the Edge: Achieving Byzantine Fault Tolerance in Decentralized P2P Frameworks"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3394-0853","authenticated-orcid":false,"given":"Wanli","family":"Zhao","sequence":"first","affiliation":[{"name":"Department of Information Science, Graduate School of Advanced Science and Engineering, Hiroshima University, Higashihiroshima, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9412-7309","authenticated-orcid":false,"given":"Satoshi","family":"Fujita","sequence":"additional","affiliation":[{"name":"Department of Information Science, Graduate School of Advanced Science and Engineering, Hiroshima University, Higashihiroshima, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.31585\/jbba-7-2-(2)2024"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.08.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190538"},{"key":"ref5","first-page":"9","article-title":"The swirlds hashgraph consensus algorithm: Fair, fast, Byzantine fault tolerance","author":"Baird","year":"2016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COINS49042.2020.9191430"},{"article-title":"State machine replication in the libra blockchain","year":"2019","author":"Baudet","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-8045-4_8"},{"key":"ref9","article-title":"IPFS\u2013content addressed, versioned, P2P file system","author":"Benet","year":"2014","journal-title":"arXiv:1407.3561"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"article-title":"Tendermint: Byzantine fault tolerance in the age of blockchains","year":"2016","author":"Buchman","key":"ref11"},{"key":"ref12","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume-title":"Proc. OsDI","volume":"99","author":"Castro"},{"key":"ref13","first-page":"377","article-title":"Algorand agreement: Super fast and partition resilient Byzantine agreement","author":"Chen","year":"2018","journal-title":"Cryptol. ePrint Arch."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS57955.2024.00093"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7142-5_17"},{"volume-title":"Digital Markets Act","year":"2022","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3300220"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.clsr.2024.106059"},{"key":"ref20","article-title":"Navigating decentralized online social networks: An overview of technical and societal challenges in architectural choices","author":"Jeong","year":"2025","journal-title":"arXiv:2504.00071"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3428662.3428794"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3359591.3359737"},{"volume-title":"Libp2p Documentation","year":"2025","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2011.6038753"},{"volume-title":"A Electronic Cash System","year":"2008","author":"Nakamoto","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.10.005"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/oed\/6374496060"},{"key":"ref28","article-title":"Grassroots social networking: Where people have agency over their personal information and social graph","author":"Shapiro","year":"2023","journal-title":"arXiv:2306.13941"},{"key":"ref29","first-page":"189","article-title":"BFT protocols under fire","volume-title":"Proc. NSDI","volume":"8","author":"Singh"},{"key":"ref30","first-page":"104","article-title":"PHANTOM: A scalable BlockDAG protocol","author":"Sompolinsky","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref31","article-title":"Musings on the HashGraph protocol: Its security and its limitations","author":"Sridhar","year":"2022","journal-title":"arXiv:2210.13682"},{"volume-title":"Scuttlebutt Protocol Guide","year":"2025","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3357150.3357396"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3357150.3357396"},{"key":"ref35","article-title":"GossipSub: Attack-resilient message propagation in the filecoin and ETH2.0 networks","author":"Vyzovitis","year":"2020","journal-title":"arXiv:2007.02754"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/DSN53405.2022.00038"},{"volume-title":"Polkadot: Vision for a heterogeneous multi-chain framework (Draft)","year":"2016","author":"Wood","key":"ref37"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11145446.pdf?arnumber=11145446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T17:47:12Z","timestamp":1757353632000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11145446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3604512","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}