GT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain

GT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article GT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain Tao Shen, Tianyu Li, Zhuo Yu, FenHua Bai, Chi Zhang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-2435381/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 8 You are reading this latest preprint version Abstract Blockchain is an innovative application of distributed storage, consensus mechanism, cryptographic algorithm and other computer technologies. As the underlying architecture of blockchain, consensus mechanism is the key to realize service-oriented applications of blockchain in terms of its security, efficiency and scalability optimization. In some high complexity consensus mechanism such as Practical Byzantine Fault Tolerance (PBFT), throughput is severely reduced as the number of nodes increases, and even in low complexity algorithms such as Raft, the load on leader is severely affected as the network size increases, which affecting consensus efficiency. To solve these problems, in this paper, we propose a node reliable shard model based on guarantee tree (GT-NRSM) that achieves high scalability while ensuring a certain degree of decentralization and security based on consortium blockchain. Firstly, we design a guarantee mechanism to represent the trust relationship between nodes, and then we design a reliable node selection strategy based on the guarantee mechanism to evaluate the node guarantee results and consensus behavior, determine the node trust status, and identify malicious nodes and select a list of trusted leaders. Secondly, we propose a Dual-Leaders supervision mechanism, where deputy detects the heartbeat of leader while the deputy activity is detected by consensus nodes. Finally, we use guarantee mechanism and reliable node selection strategy to design a network partitioning method to achieve high concurrent consensus for multiple partitions and greatly improve the consensus efficiency. Subsequent experiments show that the throughput of the proposed algorithm improves by 48% over Raft and is much higher than PBFT, which has higher throughput and lower consensus latency. Blockchain Consensus Shard Leader election Guarantee Tree Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Major revision 26 Apr, 2023 Reviews received at journal 05 Apr, 2023 Reviewers agreed at journal 02 Apr, 2023 Reviewers agreed at journal 02 Apr, 2023 Reviewers invited by journal 02 Apr, 2023 Editor assigned by journal 02 Jan, 2023 Submission checks completed at journal 02 Jan, 2023 First submitted to journal 02 Jan, 2023 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-2435381","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":164382234,"identity":"6ab03e26-6bb7-47b6-b95a-90122f087a5a","order_by":0,"name":"Tao Shen","email":"","orcid":"","institution":"Kunming University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Tao","middleName":"","lastName":"Shen","suffix":""},{"id":164382235,"identity":"cef297f0-400d-441b-bdcc-4a15ada6ccad","order_by":1,"name":"Tianyu Li","email":"","orcid":"","institution":"Kunming University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Tianyu","middleName":"","lastName":"Li","suffix":""},{"id":164382236,"identity":"bc5d1676-8d02-4b9a-8d1d-14fdf2a3d6d5","order_by":2,"name":"Zhuo Yu","email":"","orcid":"","institution":"Beijing Zhongdian Puhua Information Technology Company,Ltd.","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Zhuo","middleName":"","lastName":"Yu","suffix":""},{"id":164382237,"identity":"5de3ccfa-0a83-4e2c-b5af-aeefad446bbe","order_by":3,"name":"FenHua Bai","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA+klEQVRIiWNgGAWjYBACAwbGBwyMDQwM/GDuAYioBH4tzAZgLZINzBAtPERrMThArBZz9mbGx4U7Dssbnz9/TILhzGF7ewbmg7d5GOzycGmx7DnMbDzzzGHDbTeS2SQYbhxO7GFgS7bmYUguxumwG/nHpHnbDjNuu8EM1PLhcAIPA4+ZNA/DgcQGnFqS2X8Dtdhv7j8M1mLPw8D/jZAWNmaglsQNDBCHMfYw8LDh1QLyC9Bh6ckzbiQbWyScSU/sOcxmbDnHIBmnFlCIfeZts7bt7z/48MaHY9b27O3ND2+8qbDDqQUVJIAIZrCDiVI/CkbBKBgFowAHAAAMdFLTC3YhIgAAAABJRU5ErkJggg==","orcid":"","institution":"Kunming University of Science and Technology","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"FenHua","middleName":"","lastName":"Bai","suffix":""},{"id":164382238,"identity":"5fa00692-26b5-4da8-8a17-d1a3a1d8724b","order_by":4,"name":"Chi Zhang","email":"","orcid":"","institution":"Kunming University of Science and Technology","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Chi","middleName":"","lastName":"Zhang","suffix":""}],"badges":[],"createdAt":"2023-01-02 11:14:22","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-2435381/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-2435381/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":31147788,"identity":"1f6b58a0-892d-4c03-aa18-3f4f26d520e6","added_by":"auto","created_at":"2023-01-05 09:26:30","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1787544,"visible":true,"origin":"","legend":"","description":"","filename":"GTNRSMefficientandscalableshardingconsensusmechanismforconsortiumblockchain.pdf","url":"https://assets-eu.researchsquare.com/files/rs-2435381/v1/160241c89476cb4367b15807.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"\u003cp\u003eGT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Blockchain, Consensus, Shard, Leader election, Guarantee Tree","lastPublishedDoi":"10.21203/rs.3.rs-2435381/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-2435381/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eBlockchain is an innovative application of distributed storage, consensus mechanism, cryptographic algorithm and other computer technologies. As the underlying architecture of blockchain, consensus mechanism is the key to realize service-oriented applications of blockchain in terms of its security, efficiency and scalability optimization. In some high complexity consensus mechanism such as Practical Byzantine Fault Tolerance (PBFT), throughput is severely reduced as the number of nodes increases, and even in low complexity algorithms such as Raft, the load on leader is severely affected as the network size increases, which affecting consensus efficiency. To solve these problems, in this paper, we propose a node reliable shard model based on guarantee tree (GT-NRSM) that achieves high scalability while ensuring a certain degree of decentralization and security based on consortium blockchain. Firstly, we design a guarantee mechanism to represent the trust relationship between nodes, and then we design a reliable node selection strategy based on the guarantee mechanism to evaluate the node guarantee results and consensus behavior, determine the node trust status, and identify malicious nodes and select a list of trusted leaders. Secondly, we propose a Dual-Leaders supervision mechanism, where deputy detects the heartbeat of leader while the deputy activity is detected by consensus nodes. Finally, we use guarantee mechanism and reliable node selection strategy to design a network partitioning method to achieve high concurrent consensus for multiple partitions and greatly improve the consensus efficiency. Subsequent experiments show that the throughput of the proposed algorithm improves by 48% over Raft and is much higher than PBFT, which has higher throughput and lower consensus latency.\u003c/p\u003e","manuscriptTitle":"GT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-01-05 09:26:26","doi":"10.21203/rs.3.rs-2435381/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Major revision","date":"2023-04-26T23:05:49+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2023-04-05T12:50:05+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"f5edef60-9ccf-4c93-a50f-4f395cb9f7cd","date":"2023-04-03T00:13:42+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"74f13893-979c-4cd5-b517-771ae5c4bd11","date":"2023-04-03T00:12:56+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2023-04-02T22:00:58+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2023-01-02T17:38:01+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2023-01-02T17:38:00+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2023-01-02T11:10:22+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"a065160e-9969-4908-8cc8-43c989db868d","owner":[],"postedDate":"January 5th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2023-05-18T14:59:26+00:00","versionOfRecord":[],"versionCreatedAt":"2023-01-05 09:26:26","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-2435381","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-2435381","identity":"rs-2435381","version":["v1"]},"buildId":"WrCJVZZCHTDjtuVLN7oU0","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}