Abstract
Cryptocurrencies such as Bitcoin rely on a proof-of-work system to validate transactions and prevent attacks or double-spending. A new proof-of-work is introduced which seems to be the first number theoretic proof-of-work unrelated to primes: it is based on a new metric associated to the Collatz algorithm whose natural generalization is algorithmically undecidable: 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 ≈ ( π - 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.
Reference24 articles.
1. Hashcash-A Denial of Service Counter-Measurehttp://hashcash.org/papers/hashcash.pdf
2. Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem
3. On the 3x + 1 problem;Crandall;Mathematics of Computation,1978
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献