{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T18:32:14Z","timestamp":1724524334384},"reference-count":19,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,2,24]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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\u2019s 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\u2019s, by using penalty by consensus is suggested.<\/jats:p>","DOI":"10.1515\/comp-2020-0004","type":"journal-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T09:01:15Z","timestamp":1582621275000},"page":"42-47","source":"Crossref","is-referenced-by-count":5,"title":["Inner For-Loop for Speeding Up Blockchain Mining"],"prefix":"10.1515","volume":"10","author":[{"given":"Tosin P.","family":"Adewumi","sequence":"first","affiliation":[{"name":"Lule\u00e5 University of Technology, Lule\u00e5, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Liwicki","sequence":"additional","affiliation":[{"name":"Lule\u00e5 University of Technology, Lule\u00e5, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","reference":[{"key":"ref101","first-page":"115","article-title":"Inner loop program construct faster way for program execution Open","volume":"11","author":"Adewumi","year":"2018","journal-title":"Computer Science"},{"key":"ref151","first-page":"08609","article-title":"of Used Cryptography in arXiv preprint arXiv","volume":"16","author":"Raikwar","year":"1906"},{"key":"ref171","first-page":"394","article-title":"- resistant hash functions in Conference of Russian Young Researchers in Electrical and","volume":"18","author":"Zamanov","year":"2018","journal-title":"IEEE Electronic Engineering IEEE"},{"key":"ref01","first-page":"1","article-title":"Peer to - Peer Electronic Cash System","author":"Nakamoto","year":"2008"},{"key":"ref51","first-page":"1","article-title":"Lehre Finite first hitting time versus stochastic convergence in particle swarm optimisation in Advances in Meta - heuristics","author":"Witt","year":"2013"},{"key":"ref41","article-title":"An introduction to particle swarm optimization Department of University of Idaho","author":"Settles","year":"2005","journal-title":"Computer Science"},{"key":"ref181","first-page":"1","article-title":"Asymmetric proof - of - work based on the generalized birthday problem","volume":"19","author":"Biryukov","year":"2017"},{"key":"ref161","first-page":"151","article-title":"secure decentralised generalised transaction ledger Ethereum project yellow paper","volume":"17","author":"Wood","year":"2014"},{"key":"ref191","article-title":"Theory Problems of","volume":"20","author":"Kazmier","year":"2004","journal-title":"Business Statistics"},{"key":"ref31","first-page":"3","article-title":"From theory to practice in particle swarm optimization in Handbook of Swarm","author":"Clerc","year":"2011","journal-title":"Intelligence"},{"key":"ref111","article-title":"Back - a denial of service counter - measure","volume":"12","author":"Hashcash","year":"2002"},{"key":"ref121","first-page":"180","article-title":"PUB Secure hash standard shs PUB","volume":"13","author":"FIPS","year":"2012"},{"key":"ref141","first-page":"2015","article-title":"standard Permutation based hash and extendable output functions Technical report","volume":"15","author":"Dworkin"},{"key":"ref11","article-title":"coin cryptocurrency technologies comprehensive introduction Princeton University","author":"Narayanan","year":"2016","journal-title":"Bit"},{"key":"ref201","article-title":"of Python Independent","volume":"21","author":"Swaroop","year":"2013","journal-title":"Byte"},{"key":"ref61","first-page":"1","article-title":"of population - based meta - heuristic algorithm of in and Its Applications","author":"Beheshti","year":"2013","journal-title":"review International Journal Advances Soft Computing"},{"key":"ref131","first-page":"461","article-title":"hash functions a of Issues","volume":"14","author":"Sobti","year":"2012","journal-title":"review International Journal Computer Science"},{"key":"ref21","first-page":"6","article-title":"technology Beyond bitcoin Innovation","author":"Crosby","year":"2016","journal-title":"Applied"},{"key":"ref81","first-page":"95","article-title":"new optimizer using particle swarm theory in Proceedings of the Sixth International Symposium on Micro Machine and Human","author":"Eberhart","year":"1995","journal-title":"Science Ieee"}],"container-title":["Open Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/10\/1\/article-p42.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/downloadpdf\/journals\/comp\/10\/1\/article-p42.xml","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,28]],"date-time":"2021-02-28T03:22:33Z","timestamp":1614482553000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2020-0004\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,24]]},"references-count":19,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1515\/comp-2020-0004","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,24]]}}}