Abstract
In this paper, the authors propose to increase the efficiency of blockchain mining by using a population-based approach. Blockchain relies on solving difficult mathematical problems as proof-of-work within a network before blocks are added to the chain. Brute force approach, advocated by some as the fastest algorithm for solving partial hash collisions and implemented in Bitcoin blockchain, implies exhaustive, sequential search. It involves incrementing the nonce (number) of the header by one, then taking a double SHA-256 hash at each instance and comparing it with a target value to ascertain if lower than that target. It excessively consumes both time and power. In this paper, the authors, therefore, suggest using an inner for-loop for the population-based approach. Comparison shows that it’s a slightly faster approach than brute force, with an average speed advantage of about 1.67% or 3,420 iterations per second and 73% of the time performing better. Also, we observed that the more the total particles deployed, the better the performance until a pivotal point. Furthermore, a recommendation on taming the excessive use of power by networks, like Bitcoin’s, by using penalty by consensus is suggested.
References
[1] Nakamoto S., Bitcoin: A Peer-to-Peer Electronic Cash System, 2008Search in Google Scholar
[2] Narayanan A., Bonneau J., Felten E., Miller A., Goldfeder S., Bit-coin and cryptocurrency technologies: A comprehensive introduction, Princeton University Press, 2016Search in Google Scholar
[3] Crosby M., Pattanayak P., Verma S., Kalyanaraman V., et al., Blockchain technology: Beyond bitcoin, Applied Innovation, 2(6-10), 2016, 71Search in Google Scholar
[4] Clerc M., From theory to practice in particle swarm optimization, in Handbook of Swarm Intelligence, Springer, 2011, 3–3610.1007/978-3-642-17390-5_1Search in Google Scholar
[5] Settles M., An introduction to particle swarm optimization, Department of Computer Science, University of Idaho, 2, 2005Search in Google Scholar
[6] Lehre P.K., Witt C., Finite first hitting time versus stochastic convergence in particle swarm optimisation, in Advances in Meta-heuristics, Springer, 2013, 1–2010.1007/978-1-4614-6322-1_1Search in Google Scholar
[7] Beheshti Z., Shamsuddin S.M., A review of population-based meta-heuristic algorithm, International Journal of Advances in Soft Computing and Its Applications, 5, 2013, 1–35Search in Google Scholar
[8] Holland J.H., Genetic algorithms, Scientific american, 267(1), 1992, 66–7310.1038/scientificamerican0792-66Search in Google Scholar
[9] Eberhart R., Kennedy J., A new optimizer using particle swarm theory, in MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Ieee, 1995, 39–43Search in Google Scholar
[10] Willis H., Power distribution planning reference book, New York: M, 200410.1201/9781420030310Search in Google Scholar
[11] Adewumi T.P., Inner loop program construct: A faster way for program execution, Open Computer Science, 8(1), 2018, 115–12210.1515/comp-2018-0004Search in Google Scholar
[12] Back A., et al., Hashcash-a denial of service counter-measure, 2002Search in Google Scholar
[13] PUB F., Secure hash standard (shs), FIPS PUB, 180(4), 2012Search in Google Scholar
[14] Sobti R., Geetha G., Cryptographic hash functions: a review, International Journal of Computer Science Issues (IJCSI), 9(2), 2012, 461Search in Google Scholar
[15] Dworkin M.J., SHA-3 standard: Permutation-based hash and extendable-output functions, Technical report, 201510.6028/NIST.FIPS.202Search in Google Scholar
[16] Raikwar M., Gligoroski D., Kralevska K., SoK of Used Cryptography in Blockchain, arXiv preprint arXiv:1906.08609, 201910.1109/ACCESS.2019.2946983Search in Google Scholar
[17] Wood G., et al., Ethereum: A secure decentralised generalised transaction ledger, Ethereum project yellow paper, 151(2014), 2014, 1–32Search in Google Scholar
[18] Zamanov A.R., Erokhin V.A., Fedotov P.S., ASIC-resistant hash functions, in 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus), IEEE, 2018, 394–39610.1109/EIConRus.2018.8317115Search in Google Scholar
[19] Biryukov A., Khovratovich D., Equihash: Asymmetric proof-of-work based on the generalized birthday problem, Ledger, 2, 2017, 1–3010.5195/ledger.2017.48Search in Google Scholar
[20] Kazmier L.J., Theory and Problems of Business Statistics, McGraw-Hill, 2004Search in Google Scholar
[21] Swaroop H., A Byte of Python, Independent, 2013Search in Google Scholar
© 2020 Tosin P. Adewumi et al., published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.
