{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T03:32:53Z","timestamp":1773804773616,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61962005"],"award-info":[{"award-number":["61962005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFB1404404"],"award-info":[{"award-number":["2018YFB1404404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["High-Confidence Computing"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1016\/j.hcc.2022.100070","type":"journal-article","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T03:53:45Z","timestamp":1656647625000},"page":"100070","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Workload-based randomization byzantine fault tolerance consensus protocol"],"prefix":"10.1016","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4717-4625","authenticated-orcid":false,"given":"Baohua","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningjiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.hcc.2022.100070_bib0001","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults[J]","volume":"27","author":"Pease","year":"1980","journal-title":"Journal of the ACM (JACM)"},{"key":"10.1016\/j.hcc.2022.100070_bib0002","first-page":"203","article-title":"The Byzantine generals problem[M]","author":"Lamport","year":"2019","journal-title":"Concurrency: the Works of Leslie Lamport"},{"issue":"2","key":"10.1016\/j.hcc.2022.100070_bib0003","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","article-title":"The Part-Time Parliament[J]","volume":"16","author":"Lamport","year":"1998","journal-title":"Acm Transactions on Computer Systems"},{"key":"10.1016\/j.hcc.2022.100070_bib0004","series-title":"Search of an Understandable Consensus Algorithm[C]\/\/2014 USENIX Annual Technical Conference (Usenix ATC 14)","first-page":"305","author":"Ongaro","year":"2014"},{"key":"10.1016\/j.hcc.2022.100070_bib0005","first-page":"173","article-title":"Practical Byzantine Fault","volume":"99","author":"Castro","year":"1999","journal-title":"Tolerance[C]\/\/OsDI. 1999,"},{"key":"10.1016\/j.hcc.2022.100070_bib0006","first-page":"21260","article-title":"A peer-to-peer electronic cash system[J]","author":"Bitcoin","year":"2008","journal-title":"Decentralized Business Review"},{"issue":"1","key":"10.1016\/j.hcc.2022.100070_bib0007","article-title":"Peer-to-peer crypto-currency with proof-of-stake[J]","volume":"19","author":"King","year":"2012","journal-title":"self-published paper"},{"key":"10.1016\/j.hcc.2022.100070_bib0008","unstructured":"Schuh F, Larimer D. Bitshares 2.0: Financial smart contract platform[J]. Accessed: Jan, 2015, 15: 2017."},{"key":"10.1016\/j.hcc.2022.100070_bib0009","first-page":"1","article-title":"An optimized byzantine fault tolerance algorithm for consortium blockchain[J]","author":"Li","year":"2021","journal-title":"Peer-to-Peer Networking and Applications"},{"issue":"5","key":"10.1016\/j.hcc.2022.100070_bib0010","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/TPDS.2020.3042392","article-title":"A Scalable Multi-Layer PBFT Consensus for Blockchain[J]","volume":"32","author":"Li","year":"2021","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"12","key":"10.1016\/j.hcc.2022.100070_bib0011","first-page":"101","article-title":"Improved PBFT Consensus Mechanism based on K-medoids[J]","volume":"46","author":"CHEN","year":"2019","journal-title":"Computer Science"},{"issue":"4","key":"10.1016\/j.hcc.2022.100070_bib0012","doi-asserted-by":"crossref","DOI":"10.1145\/1658357.1658358","article-title":"Zyzzyva: Speculative Byzantine Fault Tolerance[J]","volume":"27","author":"Kotla","year":"2009","journal-title":"Acm Transactions on Computer Systems"},{"key":"10.1016\/j.hcc.2022.100070_bib0013","series-title":"SBFT: A Scalable and Decentralized Trust Infrastructure[C]\/\/2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN)","first-page":"568","author":"Gueta","year":"2019"},{"issue":"12","key":"10.1016\/j.hcc.2022.100070_bib0014","doi-asserted-by":"crossref","first-page":"111","DOI":"10.23919\/JCC.2019.12.008","article-title":"T-PBFT: An EigenTrust-based practical Byzantine fault tolerance consensus algorithm[J]","volume":"16","author":"Gao","year":"2019","journal-title":"China Communications"},{"key":"10.1016\/j.hcc.2022.100070_bib0015","series-title":"Trust-PBFT: A PeerTrust-Based Practical Byzantine Consensus Algorithm[C]\/\/2019 International Conference on Networking and Network Applications (NaNA)","first-page":"344","author":"Tong","year":"2019"},{"key":"10.1016\/j.hcc.2022.100070_bib0016","doi-asserted-by":"crossref","unstructured":"Leung D, Suhl A, Gilad Y, et\u00a0al. Vault: Fast Bootstrapping for the Algorand Cryptocurrency[J]. 2019.","DOI":"10.14722\/ndss.2019.23313"},{"key":"10.1016\/j.hcc.2022.100070_bib0017","series-title":"Algorand: Scaling Byzantine Agreements for Cryptocurrencies[C]\/\/Proceedings of the Twenty-Sixth Acm Symposium on Operating Systems Principles","first-page":"51","author":"Gilad","year":"2017"},{"key":"10.1016\/j.hcc.2022.100070_bib0018","doi-asserted-by":"crossref","unstructured":"Micali S, Rabin M, Vadhan S. Verifiable random functions[J]. 1999: 120-130.","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"10.1016\/j.hcc.2022.100070_bib0019","unstructured":"Ontology Project.Consenses mechanism[EB\/OL]. [ 2020 -06-14]. https:\/\/docs.ont.io\/ontology-elements\/consensus-mechanism."},{"key":"10.1016\/j.hcc.2022.100070_bib0020","article-title":"Hybrid Consensus Algorithm Optimization: A Mathematical Method Based on POS and PBFT and Its Application in Blockchain[J]","volume":"2020","author":"Wu","year":"2020","journal-title":"Mathematical Problems in Engineering"},{"key":"10.1016\/j.hcc.2022.100070_bib0021","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ins.2020.12.077","article-title":"DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains[J]","volume":"559","author":"Zhan","year":"2021","journal-title":"Information Sciences"}],"container-title":["High-Confidence Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295222000228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295222000228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T08:39:57Z","timestamp":1757407197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2667295222000228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["S2667295222000228"],"URL":"https:\/\/doi.org\/10.1016\/j.hcc.2022.100070","relation":{},"ISSN":["2667-2952"],"issn-type":[{"value":"2667-2952","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Workload-based randomization byzantine fault tolerance consensus protocol","name":"articletitle","label":"Article Title"},{"value":"High-Confidence Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.hcc.2022.100070","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V. on behalf of Shandong University.","name":"copyright","label":"Copyright"}],"article-number":"100070"}}