ClusterPioneer Voting: A Scalable and Energy-Efficient Consensus Mechanism for Permissioned-Blockchain (DeFi) System

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract In decentralized financial (DeFi) systems operating on permissioned blockchains, achieving scalable, energy-efficient, and secure consensus remains a critical challenge. Traditional consensus mechanisms such as Practical Byzantine Fault Tolerance (PBFT), Raft, and Delegated Proof of Stake (DPoS) face significant limitations in scalability, high communication overhead, and restricted fault tolerance, particularly in voting-centric applications. The proposed ClusterPioneer Consensus, a novel cluster-based framework that dynamically distributes computational workloads and aggregates consensus decisions efficiently. Our model presents a dynamic cluster formation that reduces node-to-node message complexity up to 60% compared to PBFT, consensus latency remains between 0.8 to 2.8 seconds (across network sizes ranging from 50 to 1000 nodes), standard deviation less than 5% in workload balancing, and Merkle tamper-proof verification with proof validation times under 150 milliseconds. In the ClusterPioneer security enhances through real-time fault detection and periodic pioneered node rotation, achieves a malicious node detection accuracy 95%. The research study results in the ClusterPioneer model outperforms PBFT, Raft, and DPoS in consensus throughput, achieves 500 transactions per second with minimal energy overhead. In the proposed model we evaluated the models’ scalability, energy efficiency, and fault resilience using simulation and real deployment. This study validates the optimize, rapid, fault-tolerant consensus algorithm for blockchain-based application.
Full text 11,461 characters · extracted from preprint-html · click to expand
ClusterPioneer Voting: A Scalable and Energy-Efficient Consensus Mechanism for Permissioned-Blockchain (DeFi) System | 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 ClusterPioneer Voting: A Scalable and Energy-Efficient Consensus Mechanism for Permissioned-Blockchain (DeFi) System Anwar Ali Sathio, Muhammad Malook Rind, Shafique Ahmed Awan This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7099560/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract In decentralized financial (DeFi) systems operating on permissioned blockchains, achieving scalable, energy-efficient, and secure consensus remains a critical challenge. Traditional consensus mechanisms such as Practical Byzantine Fault Tolerance (PBFT), Raft, and Delegated Proof of Stake (DPoS) face significant limitations in scalability, high communication overhead, and restricted fault tolerance, particularly in voting-centric applications. The proposed ClusterPioneer Consensus, a novel cluster-based framework that dynamically distributes computational workloads and aggregates consensus decisions efficiently. Our model presents a dynamic cluster formation that reduces node-to-node message complexity up to 60% compared to PBFT, consensus latency remains between 0.8 to 2.8 seconds (across network sizes ranging from 50 to 1000 nodes), standard deviation less than 5% in workload balancing, and Merkle tamper-proof verification with proof validation times under 150 milliseconds. In the ClusterPioneer security enhances through real-time fault detection and periodic pioneered node rotation, achieves a malicious node detection accuracy 95%. The research study results in the ClusterPioneer model outperforms PBFT, Raft, and DPoS in consensus throughput, achieves 500 transactions per second with minimal energy overhead. In the proposed model we evaluated the models’ scalability, energy efficiency, and fault resilience using simulation and real deployment. This study validates the optimize, rapid, fault-tolerant consensus algorithm for blockchain-based application. Permissioned Blockchain Consensus Mechanism Decentralized Finance (DeFi) Cluster-Based Voting Byzantine Fault Tolerance Energy-Efficient Protocols Merkle Tree Verification Scalability in Distributed Systems Security in Blockchain Voting Dockerized Consensus Simulation Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-7099560","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":485478202,"identity":"fdaa3e8b-5ff7-494b-80e0-b78f834d0154","order_by":0,"name":"Anwar Ali Sathio","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABD0lEQVRIiWNgGAWjYFADCcYGho8NBxgY2IEcHpAAIR08QC2MM0FamInXAlTMS4wW/tk9hp8rGOrk7aWbGx/b7rhjb3CYgfHB2zaGPMkGHD64c8ZY8gzDYcMemYPNxrlnniVuOMzAbDi3jaFYGpeDbuRuABp3gLFHIrFNOrftcALQFjZp3jaGxHk4dMjfyN38s4Ghzh6sxbLtMMhh7L/xaTG4kbsNaAtzIlgLY9thRqDD2JhBWmbj0GJ4I/+bZYPB4eSeG4nNhr1Av8w8zNgsOeecRDEu78vdSEu+2VBRZ9s+I/3hg5/AEOM73nzww5symzyJA7j8D3YeCo8RZLxEAj4N2AEZWkbBKBgFo2CYAgDdXF0JZPREogAAAABJRU5ErkJggg==","orcid":"","institution":"Benazir Bhutto Shaheed University","correspondingAuthor":true,"prefix":"","firstName":"Anwar","middleName":"Ali","lastName":"Sathio","suffix":""},{"id":485478203,"identity":"f5356e11-2199-4e2e-ab05-7a7793167014","order_by":1,"name":"Muhammad Malook Rind","email":"","orcid":"","institution":"Sindh Madarssatul Islam University","correspondingAuthor":false,"prefix":"","firstName":"Muhammad","middleName":"Malook","lastName":"Rind","suffix":""},{"id":485478205,"identity":"9acc8a94-9a72-4992-9f7c-3ebea5980ac4","order_by":2,"name":"Shafique Ahmed Awan","email":"","orcid":"","institution":"Benazir Bhutto Shaheed University","correspondingAuthor":false,"prefix":"","firstName":"Shafique","middleName":"Ahmed","lastName":"Awan","suffix":""}],"badges":[],"createdAt":"2025-07-11 08:38:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7099560/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7099560/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":90580977,"identity":"d5233d56-0c78-464e-96c8-fd3a0722860c","added_by":"auto","created_at":"2025-09-04 10:17:05","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1096416,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptFD.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7099560/v1_covered_5922d577-dce8-461a-9a4a-28e86cd70163.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"\u003cp\u003e\u003cstrong\u003eClusterPioneer Voting: A Scalable and Energy-Efficient Consensus Mechanism for Permissioned-Blockchain (DeFi) System\u003c/strong\u003e\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":true,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Permissioned Blockchain, Consensus Mechanism, Decentralized Finance (DeFi), Cluster-Based Voting, Byzantine Fault Tolerance, Energy-Efficient Protocols, Merkle Tree Verification, Scalability in Distributed Systems, Security in Blockchain Voting, Dockerized Consensus Simulation","lastPublishedDoi":"10.21203/rs.3.rs-7099560/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7099560/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn decentralized financial (DeFi) systems operating on permissioned blockchains, achieving scalable, energy-efficient, and secure consensus remains a critical challenge. Traditional consensus mechanisms such as Practical Byzantine Fault Tolerance (PBFT), Raft, and Delegated Proof of Stake (DPoS) face significant limitations in scalability, high communication overhead, and restricted fault tolerance, particularly in voting-centric applications. The proposed ClusterPioneer Consensus, a novel cluster-based framework that dynamically distributes computational workloads and aggregates consensus decisions efficiently. Our model presents a dynamic cluster formation that reduces node-to-node message complexity up to 60% compared to PBFT, consensus latency remains between 0.8 to 2.8 seconds (across network sizes ranging from 50 to 1000 nodes), standard deviation less than 5% in workload balancing, and Merkle tamper-proof verification with proof validation times under 150 milliseconds. In the ClusterPioneer security enhances through real-time fault detection and periodic pioneered node rotation, achieves a malicious node detection accuracy 95%. The research study results in the ClusterPioneer model outperforms PBFT, Raft, and DPoS in consensus throughput, achieves 500 transactions per second with minimal energy overhead. In the proposed model we evaluated the models\u0026rsquo; scalability, energy efficiency, and fault resilience using simulation and real deployment. This study validates the optimize, rapid, fault-tolerant consensus algorithm for blockchain-based application.\u003c/p\u003e","manuscriptTitle":"ClusterPioneer Voting: A Scalable and Energy-Efficient Consensus Mechanism for Permissioned-Blockchain (DeFi) System","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-22 09:18:42","doi":"10.21203/rs.3.rs-7099560/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"06d5dd86-b5c9-4cb8-85c4-e555e0733962","owner":[],"postedDate":"July 22nd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-09-04T10:08:55+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-22 09:18:42","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7099560","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7099560","identity":"rs-7099560","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00