Abstract

Proof of Work (PoW) and Proof of Stake (PoS) remain the dominant consensus mechanisms for public blockchains, yet both suffer from well-documented limitations: PoW incurs prohibitive energy costs and scales poorly with network size, while PoS tends to concentrate validator influence among large stake holders, re-introducing a form of economic centralization. This paper proposes Proof of Effort (PoE), a novel consensus mechanism in which validator eligibility is determined exclusively by verifiable, continuous protocol participation rather than by computational expenditure or financial stake. PoE integrates four lightweight security primitives — node-identity binding via asymmetric key pairs, sequence-number-based replay prevention, digital-signature message authentication, and threshold-based malicious-node detection — chosen specifically to impose negligible per-node overhead while maintaining Byzantine resilience. We formalize the effort accumulation model mathematically, provide a detailed pseudocode specification of the protocol, and evaluate the mechanism through an agent-based simulation implemented in NetLogo 6.4 with 500 heterogeneous agents (350 honest, 150 adversarial). Simulation results, presented with full graphical and tabular support, demonstrate that PoE achieves an average throughput of 900 tx/s (vs. 25 tx/s for PoS and 7 tx/s for PoW), reduces average consensus latency to 56 ms (vs. 400 ms and 1,200 ms), and correctly identifies 92–97% of malicious agents while accepting fewer than 0.2% of forged or replayed messages. The effort gap between honest and adversarial nodes remained below 0.21%, confirming protocol fairness under adversarial load, and the validator-selection Gini coefficient of 0.18 represents a 71% improvement in participation equality over PoS. These results position PoE as a compelling candidate for permissioned and consortium blockchain deployments where energy efficiency, participation fairness, and lightweight security are primary requirements.

References

• T. A. Alghamdi, R. Khalid, and N. Javaid, “A survey of blockchain-based systems: Scalability issues and solutions, applications and future challenges,” IEEE Access, vol. 9, pp. 45785–45806, 2021.
• S. Islam, M. J. Islam, M. Hossain, S. Noor, K.-S. Kwak, and S. M. R. Islam, “A survey on consensus algorithms in blockchain-based applications: Architecture, taxonomy, and operational issues,” IEEE Access, vol. 12, pp. 86892–86919, 2024.
• S. Aggarwal, R. Chaudhary, G. S. Aujla, N. Kumar, K. K. R. Choo, and A. Y. Zomaya, “Blockchain for smart communities: Applications, challenges and opportunities,” J. Netw. Comput. Appl., vol. 144, pp. 13–48, 2019.
• O. Alfandi, S. Otoum, and Y. Jararweh, “Blockchain solution for IoT-based critical infrastructures: Byzantine fault tolerance,” in Proc. NOMS IEEE/IFIP Netw. Oper. Manage. Symp., 2020, pp. 1–4.
• A. C. An, P. T. X. Diem, T. Van Toi, and L. D. Q. Binh, “Building a product origins tracking system based on blockchain and PoA consensus protocol,” in Proc. ACOMP, 2019, pp. 27–33.
• A. Andrey and C. Petr, “Review of existing consensus algorithms blockchain,” in Proc. IT&QM&IS, IEEE, 2019, pp. 124–127.
• L. Aniello, R. Baldoni, E. Gaetani, F. Lombardi, S. Margheri, and V. Sassone, “A prototype evaluation of a tamper-resistant high performance blockchain-based transaction log for a distributed database,” in Proc. EDCC, IEEE, 2017.
• M. H. Anisi, A. H. Abdullah, S. A. Razak, and M. A. Ngadi, “An overview of data routing approaches for wireless sensor networks,” Sensors, vol. 12, no. 4, pp. 3964–3996, 2012.
• A. Bahga and V. K. Madisetti, “Blockchain platform for industrial Internet of Things,” J. Softw. Eng. Appl., vol. 9, no. 10, pp. 533–546, 2016.
• A. Baliga, “Understanding blockchain consensus models,” Persistent Systems, White Paper, Apr. 2017.
• S. Bano et al., “Consensus in the age of blockchains,” arXiv:1711.03936, 2017.
• S. Biswas, K. Sharif, F. Li, S. Maharjan, S. P. Mohanty, and Y. Wang, “PoBT: A lightweight consensus algorithm for scalable IoT business blockchain,” IEEE Internet Things J., vol. 7, no. 3, pp. 2343–2355, 2020.
• BitFury Group and J. Garzik, “Public versus private blockchains,” White Paper, 2015.
• J. Bou Abdo, R. El Sibai, and J. Demerjian, “Permissionless proof of reputation X: A hybrid reputation-based consensus algorithm for permissionless blockchains,” Trans. Emerg. Telecommun. Technol., vol. 32, no. 1, p. e4148, 2021.
• C. Cachin and M. Vukolić, “Blockchain consensus protocols in the wild,” arXiv:1707.01873, 2017.
• W. Cai et al., “Dynamic reputation-based consensus mechanism: Real-time transactions for energy blockchain,” Int. J. Distrib. Sensor Netw., vol. 16, no. 3, 2020.
• M. Castro and B. Liskov, “Practical Byzantine fault tolerance,” in Proc. OSDI, vol. 99, pp. 173–186, 1999.
• P. Chatterjee, S. C. Ghosh, and N. Das, “Load balanced coverage with graded node deployment in wireless sensor networks,” IEEE Trans. Multi-Scale Comput. Syst., vol. 3, no. 2, pp. 100–112, 2017.
• B. Choi, J. Y. Sohn, D. J. Han, and J. Moon, “Scalable network-coded PBFT consensus algorithm,” in Proc. IEEE ISIT, 2019, pp. 857–861.
• P. Cuccuru, “Beyond bitcoin: An early overview on smart contracts,” Int. J. Law Inf. Technol., vol. 25, no. 3, pp. 179–195, 2017.
• S. De Angelis et al., “PBFT vs proof-of-authority: Applying the CAP theorem to permissioned blockchain,” in Proc. ITASEC, 2018.
• D. C. De Leon, A. Q. Stalick, A. A. Jillepalli, M. A. Haney, and F. T. Sheldon, “Blockchain: Properties and misconceptions,” Asia Pac. J. Innov. Entrep., 2017.
• Q. Deng, “Blockchain economical models, Delegated Proof of Economic Value and Delegated Adaptive Byzantine Fault Tolerance and their implementation in Artificial Intelligence BlockCloud,” J. Risk Financial Manag., vol. 12, no. 4, p. 177, 2019.