Real-Time Block Rate Targeting

Authors

  • Thomas M Harding

DOI:

https://doi.org/10.5195/ledger.2020.195

Abstract

A proof-of-work blockchain uses a retargeting algorithm, also termed a difficulty adjustment algorithm, to manage the rate of block production in the presence of changing hashrate. To derive the parameters that guide the search for the next block, nearly all such algorithms rely on averages of past inter-block time observations, as measured by on-chain timestamps. We are motivated to seek better responsiveness to changing hashrate, while improving stability of the block production rate and retaining the progress-free property of mining. We describe a class of retargeting algorithms for which the sole inter-block time input is that of the block being searched for, and whose response is nonlinear in that time. We discuss how these algorithms allow the other consensus rules that govern allowable timestamps to be tightened, which may improve the blockchain’s effectiveness as a time-stamping machine.

Author Biography

Thomas M Harding

Independent Cryptocurrency Researcher/Developer

References

Bowden, R., Keeler, H., Krzesinski, A., Taylor, P. “Block Arrivals in the Bitcoin Blockchain.” ArXiv (accessed 4 March 2020) https://arxiv:org/pdf/1801:07447.

jl777 “AdaptivePoW: The Solution to Diff Stranding of Smaller Blockchains.” Medium (accessed September 2019) https://medium:com/@jameslee777/adaptivepow-the-solution-to-diff-stranding-of-smaller-blockchains-425609df5563.

jl777 “Evolution of AdaptivePoW.” Medium (accessed September 2019) https://medium:com/@jameslee777/evolution-of-adaptivepow-dfea220d343f.

Nakamoto, S. “Bitcoin: A Peer-to-Peer Electronic Cash System.” (2008) (accessed 4 March 2020) https://bitcoin:org/bitcoin:pdf.

Nicolas, A. “Is the Family of Exponential Distributions Closed Under Scaling?” Mathematics Stack Exchange (accessed 4 March 2020) https://math:stackexchange:com/q/85578.

Noda, S., Okumura, K., Hashimoto, Y. “An Economic Analysis of Difficulty Adjustment in Proofof-Work Blockchain Systems.” SSRN (accessed 4 March 2020) https://papers:ssrn:com/sol3/papers:cfm?abstract id=3410460.

Roberts, S. “TSA: Change Difficulty During the Block.” GitHub (accessed September 2019) https:// github:com/zawy12/difficulty-algorithms/issues/36.

Rosenfeld, M. “Predicting Block Halving Party Times.” ArXiv (accessed 4 March 2020) https://arxiv:org/pdf/1708:05185.

Ross, S. A First Course in Probability. New York: Macmillan Publishing Company (1984).

Stone, A. “Tail Removal Block Validation.” Medium (accessed September 2019) https://medium:com/@g:andrew:stone/tail-removal-block-validation-ae26fb436524.

Stone, A. “The Blockchain Difficulty Information Paradox.” Medium (accessed September 2019) https://medium:com/@g:andrew:stone/the-blockchain-difficulty-information-paradox-879b0336864f.

Downloads

Published

2020-04-06

How to Cite

Harding, T. M. (2020). Real-Time Block Rate Targeting. Ledger, 5. https://doi.org/10.5195/ledger.2020.195

Issue

Section

Research Articles