Abstract
Proof of Work (PoW) mechanisms used as part of the consensus mechanisms in block chains often have a major drawback namely that resources are only spent on doing the PoW and nothing else. In this paper we propose an adaption of hash based PoW’s. This adaption consists in two aspects, firstly by embedding the space of the hash’s, \(\mathcal{H}\), in the space of complex numbers \(\mathbb {C}\), more concretely in the subset \(\mathcal{B}=\{z\in \mathbb {C}: 0<Re(z)<1\}\), \(\Phi :\mathcal{H}\hookrightarrow \mathcal{B}\) and secondly in designing a new cryptographic puzzle in the hash space. The motivation behind these adaptions is that in this way the PoW can also be used to explore the Riemann Zeta Function (RZF). The RZF is associated with an open problem about the localization of its zeros. This problem was left as a conjecture by Riemann and is considered one of the most important open mathematical questions. The permanence of the problem is due to the mysterious behavior of the RZF in the region \(\mathcal{B}\). This region will be by translation the search region used in the new cryptographic puzzle. The PoW will thus be able to contribute to a better understanding of the behaviour of the RZF in the region \(\mathcal{B}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The notion of derivability must be see in the sense of complex analysis, see [3].
- 2.
- 3.
https://primecoin.io [11-06-2020].
- 4.
An easy way to know what this chains are is to searching in the site of wolfram https://www.wolframalpha.com [11-06-2020]. This is a website used by mathematicians for procedures similar to the one mentioned before.
- 5.
- 6.
- 7.
Note that \(HEX^n=HEX\times ...\times HEX\) (n-times) is \(\mathcal{H}\), where \(HEX=\{a,...,z,0,...,9\}\).
References
Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Proofs of useful work. IACR Cryptology ePrint Archive 2017/203 (2017)
Bombieri, E.: Problems of the millennium. The Riemann hypothesis (2000)
Rudin, W.: Real and Complex Analysis. Tata McGraw-Hill Education, New York (2006)
Titchmarsh, E.C., Titchmarsh, E.C.T., Heath-Brown, D.R., et al.: The Theory of the Riemann Zeta-Function. Oxford University Press, Oxford (1986)
Rudnick, Z., Sarnak, P., et al.: Zeros of principal L-functions and random matrix theory. Duke Math. J. 81(2), 269–322 (1996)
Hardy, G.H., Littlewood, J.E., et al.: Contributions to the theory of the Riemann zeta-function and the theory of the distribution of primes. Acta Math. 41, 119–196 (1916). https://doi.org/10.1007/BF02422942
Zagier, D.: The first 50 million prime numbers. Math. Intell. 1(2), 7–19 (1977). https://doi.org/10.1007/BF03039306
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Bitcoin (2008). https://bitcoin.org/bitcoin.pdf
Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Proofs of work from worst-case assumptions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 789–819. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96884-1_26
Miller, A., Juels, A., Shi, E., Parno, B., Katz, J.: Permacoin: repurposing bitcoin work for data preservation. In: 2014 IEEE Symposium on Security and Privacy, pp. 475–490. IEEE (2014)
Hoffman, J.D., Frankel, S.: Numerical Methods for Engineers and Scientists. CRC Press, Boca Raton (2018)
Sauer, T.: Numerical Analysis. Pearson Addison Wesley, Boston (2006)
Chapra, S.C., Canale, R.P., et al.: Numerical Methods for Engineers. McGraw-Hill Higher Education, Boston (2010)
Poularikas, A.D.: Transforms and Applications Handbook. CRC Press, Boca Raton (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Vieira, P. (2022). Blockchain and the Riemann Zeta Function. In: Prieto, J., Partida, A., Leitão, P., Pinto, A. (eds) Blockchain and Applications. BLOCKCHAIN 2021. Lecture Notes in Networks and Systems, vol 320. Springer, Cham. https://doi.org/10.1007/978-3-030-86162-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-86162-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86161-2
Online ISBN: 978-3-030-86162-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)