Real-Time Block Rate Targeting
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.
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.
Copyright (c) 2020 Thomas M Harding
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- The Author retains copyright in the Work, where the term “Work” shall include all digital objects that may result in subsequent electronic publication or distribution.
- Upon acceptance of the Work, the author shall grant to the Publisher the right of first publication of the Work.
- The Author shall grant to the Publisher and its agents the nonexclusive perpetual right and license to publish, archive, and make accessible the Work in whole or in part in all forms of media now or hereafter known under a Creative Commons Attribution 4.0 International License or its equivalent, which, for the avoidance of doubt, allows others to copy, distribute, and transmit the Work under the following conditions:
- Attribution—other users must attribute the Work in the manner specified by the author as indicated on the journal Web site;
- The Author is able to enter into separate, additional contractual arrangements for the nonexclusive distribution of the journal's published version of the Work (e.g., post it to an institutional repository or publish it in a book), as long as there is provided in the document an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post online a prepublication manuscript (but not the Publisher’s final formatted PDF version of the Work) in institutional repositories or on their Websites prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work. Any such posting made before acceptance and publication of the Work shall be updated upon publication to include a reference to the Publisher-assigned DOI (Digital Object Identifier) and a link to the online abstract for the final published Work in the Journal.
- Upon Publisher’s request, the Author agrees to furnish promptly to Publisher, at the Author’s own expense, written evidence of the permissions, licenses, and consents for use of third-party material included within the Work, except as determined by Publisher to be covered by the principles of Fair Use.
- The Author represents and warrants that:
- the Work is the Author’s original work;
- the Author has not transferred, and will not transfer, exclusive rights in the Work to any third party;
- the Work is not pending review or under consideration by another publisher;
- the Work has not previously been published;
- the Work contains no misrepresentation or infringement of the Work or property of other authors or third parties; and
- the Work contains no libel, invasion of privacy, or other unlawful matter.
- The Author agrees to indemnify and hold Publisher harmless from Author’s breach of the representations and warranties contained in Paragraph 6 above, as well as any claim or proceeding relating to Publisher’s use and publication of any content contained in the Work, including third-party content.
- The Author agrees to digitally sign the Publisher’s final formatted PDF version of the Work.
Revised 7/16/2018. Revision Description: Removed outdated link.