Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Inflation Propensity of Collatz Orbits: A New Proof-of-Work for Blockchain Applications

Version 1 : Received: 20 September 2018 / Approved: 25 September 2018 / Online: 25 September 2018 (03:58:07 CEST)
Version 2 : Received: 25 November 2018 / Approved: 26 November 2018 / Online: 26 November 2018 (07:25:04 CET)

A peer-reviewed article of this Preprint also exists.

Bocart, F. Inflation Propensity of Collatz Orbits: A New Proof-of-Work for Blockchain Applications. J. Risk Financial Manag. 2018, 11, 83. Bocart, F. Inflation Propensity of Collatz Orbits: A New Proof-of-Work for Blockchain Applications. J. Risk Financial Manag. 2018, 11, 83.

Abstract

Cryptocurrencies like Bitcoin rely on a proof-of-work system to validate transactions and prevent attacks or double-spending. Reliance on a few standard proofs-of-work such as hashcash, Ethash or Scrypt increases systemic risk of the whole crypto-economy. Diversification of proofs-of-work is a strategy to counter potential threats to the stability of electronic payment systems. To this end, another proof-of-work is introduced: it is based on a new metric associated to the algorithmically undecidable Collatz algorithm: the inflation propensity is defined as the cardinality of new maxima in a developing Collatz orbit. It is numerically verified that the distribution of inflation propensity slowly converges to a geometric distribution of parameter $0.714 \approx \frac{(\pi - 1)}{3}$ as the sample size increases. This pseudo-randomness opens the door to a new class of proofs-of-work based on congruential graphs.

Keywords

geometric distribution; collatz conjecture; inflation propensity; systemic risk; cryptocurrency; blockchain; proof-of-work

Subject

Computer Science and Mathematics, Computational Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.