{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T16:15:50Z","timestamp":1773591350480,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,27]]},"DOI":"10.1145\/3774949.3774962","type":"proceedings-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:04:14Z","timestamp":1769270654000},"page":"87-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Practical Byzantine consensus algorithm based on Kademlia algorithm"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5271-8472","authenticated-orcid":false,"given":"Peng","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5693-2310","authenticated-orcid":false,"given":"Guanglei","family":"Qiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6650-5931","authenticated-orcid":false,"given":"Bo","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6990-6701","authenticated-orcid":false,"given":"Fujiang","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,1,24]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Satoshi Nakamoto and A Bitcoin. 2008. A peer-to-peer electronic cash system. Bitcoin.\u2013URL: https:\/\/bitcoin. org\/bitcoin. pdf 4 2 (2008) 15."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Tien Tuan\u00a0Anh Dinh Rui Liu Meihui Zhang Gang Chen Beng\u00a0Chin Ooi and Ji Wang. 2018. Untangling blockchain: A data processing view of blockchain systems. IEEE transactions on knowledge and data engineering 30 7 (2018) 1366\u20131385.","DOI":"10.1109\/TKDE.2017.2781227"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Wenyu Li Chenglin Feng Lei Zhang Hao Xu Bin Cao and Muhammad\u00a0Ali Imran. 2020. A scalable multi-layer PBFT consensus for blockchain. IEEE Transactions on Parallel and Distributed Systems 32 5 (2020) 1146\u20131160.","DOI":"10.1109\/TPDS.2020.3042392"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Jameela Al-Jaroodi and Nader Mohamed. 2019. Blockchain in industries: A survey. IEEE access 7 (2019) 36500\u201336515.","DOI":"10.1109\/ACCESS.2019.2903554"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Yang Lu. 2019. The blockchain: State-of-the-art and research challenges. Journal of Industrial Information Integration 15 (2019) 80\u201390.","DOI":"10.1016\/j.jii.2019.04.002"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Philip Treleaven Richard\u00a0Gendal Brown and Danny Yang. 2017. Blockchain technology in finance. Computer 50 9 (2017) 14\u201317.","DOI":"10.1109\/MC.2017.3571047"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Sheng Gao Tianyu Yu Jianming Zhu and Wei Cai. 2019. T-PBFT: An EigenTrust-based practical Byzantine fault tolerance consensus algorithm. China Communications 16 12 (2019) 111\u2013123.","DOI":"10.23919\/JCC.2019.12.008"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"Jian Yang Zhenhong Jia Ruiguo Su Xiaoxiong Wu and Jiwei Qin. 2022. Improved fault-tolerant consensus based on the PBFT algorithm. Ieee Access 10 (2022) 30274\u201330283.","DOI":"10.1109\/ACCESS.2022.3153701"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Guangquan Xu Hongpeng Bai Jun Xing Tao Luo Neal\u00a0N Xiong Xiaochun Cheng Shaoying Liu and Xi Zheng. 2022. SG-PBFT: A secure and highly efficient distributed blockchain PBFT consensus algorithm for intelligent Internet of vehicles. J. Parallel and Distrib. Comput. 164 (2022) 1\u201311.","DOI":"10.1016\/j.jpdc.2022.01.029"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Shannan Liu Ronghua Zhang Changzheng Liu Chenxi Xu and Jiaojiao Wang. 2023. An improved PBFT consensus algorithm based on grouping and credit grading. Scientific Reports 13 1 (2023) 13030.","DOI":"10.1038\/s41598-023-28856-x"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Amritesh Kumar Lokendra Vishwakarma and Debasis Das. 2023. R-PBFT: A secure and intelligent consensus algorithm for Internet of vehicles. Vehicular Communications 41 (2023) 100609.","DOI":"10.1016\/j.vehcom.2023.100609"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"XING Song TAN\u00a0Lirong QIN\u00a0Ruiqing LI\u00a0Zhengquan. 2024. PBFT optimization consensus mechanism based on agglomerative hierarchical clustering. Journal of Optoelectronics\u00b7Laser 35 02 (2024) 207\u2013215. 10.16136\/j.joel.2024.02.0624","DOI":"10.16136\/j.joel.2024.02.0624"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Zhang\u00a0Jiaqi Li\u00a0Junji. 2024. Improved PBFT consensus algorithm based on reputation mechanism. Application Research of Computers 41 06 (2024) 1628\u20131634. 10.19734\/j.issn.1001-3695.2023.11.0517","DOI":"10.19734\/j.issn.1001-3695.2023.11.0517"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Miguel Castro and Barbara Liskov. 2002. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS) 20 4 (2002) 398\u2013461.","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Li\u00a0Xinru Shen\u00a0Xueli. 2024. Group consensus algorithm based on node dynamic scoring mechanism. Application Research of Computers 41 04 (2024) 989\u2013994. 10.19734\/j.issn.1001-3695.2023.07.0348","DOI":"10.19734\/j.issn.1001-3695.2023.07.0348"},{"key":"e_1_3_3_1_17_2","unstructured":"WANG\u00a0Hong YANG\u00a0Yunong TANG\u00a0Lingxiang. 2024. Dynamic multi-organizational PBFT algorithm based on k-means. Journal of Chongqing University 47 07 (2024) 125\u2013139."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"ZHANG\u00a0Xin SONG Yu-zhe ZHENG Guang-hai. 2024. RG-BFT: Random grouping based Byzantine fault-tolerant algorithm. Computer Engineering and Design 45 06 (2024) 1661\u20131667. 10.16208\/j.issn1000-7024.2024.06.009","DOI":"10.16208\/j.issn1000-7024.2024.06.009"},{"key":"e_1_3_3_1_19_2","unstructured":"WANG\u00a0Jin TU\u00a0Jun JIA\u00a0Dongli. 2023. Byzantine Fault Tolerant Consensus Algorithm Based on Traceable Ring Signature. Computer Science 50 S1 (2023) 743\u2013749."},{"key":"e_1_3_3_1_20_2","unstructured":"YANG Rui NIE\u00a0Haonan ZHAI\u00a0Sheping HUO\u00a0Yuanyuan. 2024. Improvement of PBFT Algorithm Based on Consistent Hash and Random Selection. Computer Engineering and Applications 60 12 (2024) 294\u2013302."},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Moritz Steiner Taoufik En-Najjary and Ernst\u00a0W Biersack. 2009. Long term study of peer behavior in the KAD DHT. IEEE\/ACM Transactions on Networking 17 5 (2009) 1371\u20131384.","DOI":"10.1109\/TNET.2008.2009053"},{"key":"e_1_3_3_1_22_2","unstructured":"HUANG\u00a0Baozhu WU\u00a0Guangfu YANG\u00a0Zi. 2023. Dynamic Byzantine Fault Tolerance Algorithm Based on Reputation and Clustering. Journal of Applied Sciences 41 06 (2023) 1046\u20131057."},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"WANG\u00a0Xiangyu WANG\u00a0Chundong. 2023. Improved Multi-Storey Practical Byzantine Fault Tolerance Algorithm. Computer Engineering 49 08 (2023) 29\u201336. 10.19678\/j.issn.1000-3428.0066292","DOI":"10.19678\/j.issn.1000-3428.0066292"},{"key":"e_1_3_3_1_24_2","unstructured":"CHEN Xiaohan LI\u00a0Chuanbiao WANG\u00a0Weiyuan BI\u00a0Yuanwei. 2023. A PBFT Consensus Algorithm for Consortium Chain Optimization. Journal of Applied Sciences 41 04 (2023) 577\u2013589."},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","unstructured":"Fujiang Yuan Xia Huang Long Zheng Lusheng Wang Yuxin Wang Xinming Yan Shaojie Gu and Yanhong Peng. 2025. The Evolution and Optimization Strategies of a PBFT Consensus Algorithm for Consortium Blockchains. Information 16 4 (2025). 10.3390\/info16040268","DOI":"10.3390\/info16040268"}],"event":{"name":"HP3C 2025: 2025 9th International Conference on High Performance Compilation, Computing and Communications (HP3C)","location":"Jinan , China","acronym":"HP3C 2025"},"container-title":["Proceedings of the 2025 9th International Conference on High Performance Compilation, Computing and Communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774949.3774962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T15:28:42Z","timestamp":1773588522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774949.3774962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":24,"alternative-id":["10.1145\/3774949.3774962","10.1145\/3774949"],"URL":"https:\/\/doi.org\/10.1145\/3774949.3774962","relation":{},"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"2026-01-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}