Blockchain Mining: Understanding its Difficulty in Terms of Hashing Algorithm Efficiency

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Blockchain is an emerging technology that offers great advantages such as global distribution of information and data immutability over time, but its mining process is known to be time consuming and highly resource demanding. There are different algorithms to mine blocks, being able to operate at different levels of complexity and also incurring different compute costs. This study used a custom and simple implementation of the MessageDigest Java class to evaluate the performance of MD5 version 2, SHA2, and SHA3 (the last two in modalities of 256 and 512-bits) when automatically creating a chain of a thousand blocks, measuring its average time for generation and proof of work verification, alongside to the count of incurred iterations. The SHA3 methods produced stronger hash values but performed slower than MD5 and SHA2, and the complexity level of 4 characters offered the best security level in terms of iteration count versus calculation time. Complexity levels of 5 and 6 characters offered greater security but with a drastic performance reduction, which is proper for critical security systems that do not process high volumes of information. These results are useful for those small to medium organizations that are planning to implement blockchain technologies and need a parameter for understanding exactly what ‘mining cost’ really means in terms of compute costs.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0