On Bitcoin cash's target recalculation functions
Pages 192 - 204
Abstract
Bitcoin Cash, created in 2017, is a "hard fork" from Bitcoin responding to the need for allowing a higher transaction volume. This is achieved by a larger block size, as well as a new difficulty adjustment (target recalculation) function that acts more frequently (as opposed to Bitcoin's difficulty adjustment happening about every two weeks), resulting in a potentially different target for each block. While seemingly achieving its goal in practice, to our knowledge there is no formal analysis to back this proposal up.
In this paper we provide the first formal cryptographic analysis of Bitcoin Cash's target recalculation functions---both ASERT and SMA (current and former recalculation functions, respectively)---against all possible adversaries. The main distinction with respect to Bitcoin's is that they are no longer epoch-based, and as such previous analyses fail to hold. We overcome this technical obstacle by introducing a new set of analytical tools focusing on the "calibration" of blocks' timestamps in sliding windows, which yield a measure of closeness to the initial block generation rate. With that measure, we then follow the analytical approach developed in the Bitcoin backbone protocol [Eurocrypt 2015 and follow-ups] to first establish the basic properties of the blockchain data structure, from which the properties of a robust transaction ledger (namely, Consistency and Liveness) can be derived.
We compare our analytical results with data from the Bitcoin Cash network, and conclude that in order to satisfy security (namely, properties satisfied except with negligible probability in the security parameter) considerably larger parameter values should be used with respect to the ones used in practice.
References
[1]
Lear Bahack. 2013. Theoretical Bitcoin Attacks with less than Half of the Computational Power (draft). Cryptology ePrint Archive, Report 2013/868. (2013). https://eprint.iacr.org/2013/868.
[2]
C. Decker and R. Wattenhofer. 2013. Information propagation in the Bitcoin network. In IEEE P2P 2013 Proceedings. 1--10.
[3]
Cynthia Dwork and Moni Naor. 1992. Pricing via Processing or Combatting Junk Mail. In Advances in Cryptology --- CRYPTO' 92, Ernest F. Brickell (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 139--147.
[4]
Juan A. Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The Bitcoin Backbone Protocol: Analysis and Applications. In Advances in Cryptology - EUROCRYPT 2015, Elisabeth Oswald and Marc Fischlin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 281--310.
[5]
Juan A. Garay, Aggelos Kiayias, and Nikos Leonardos. 2017. The Bitcoin Backbone Protocol with Chains of Variable Difficulty. In Advances in Cryptology - CRYPTO 2017, Jonathan Katz and Hovav Shacham (Eds.). Springer International Publishing, Cham, 291--323.
[6]
Juan A. Garay, Aggelos Kiayias, and Nikos Leonardos. 2020. Full Analysis of Nakamoto Consensus in Bounded-Delay Networks. Cryptology ePrint Archive, Report 2020/277. (2020). https://eprint.iacr.org/2020/277.
[7]
Juan A. Garay and Yu Shen. 2021. On Bitcoin Cash's Target Recalculation Functions. Cryptology ePrint Archive, Report 2021/143. (2021). https://ia.cr/2021/143.
[8]
Aggelos Kiayias and Giorgos Panagiotakos. 2015. Speed-Security Tradeoffs in Blockchain Protocols. Cryptology ePrint Archive, Report 2015/1019. (2015). https://eprint.iacr.org/2015/1019.
[9]
Colin McDiarmid. 1998. Probabilistic Methods for Algorithmic Discrete Mathematicss, chapter Concentration, pages 195--248. Springer Berlin Heidelberg, Berlin, Heidelberg. (1998).
[10]
Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.
[11]
Satoshi Nakamoto. 2009. Bitcoin: A peer-to-peer electronic cash system. (2009). http://www.bitcoin.org/bitcoin.pdf.
[12]
Satoshi Nakamoto. 2009. Bitcoin open source implementation of p2p currency. (Feb. 2009). http://p2pfoundation.ning.com/forum/topics/bitcoin-open-source.
[13]
Rafael Pass, Lior Seeman, and Abhi Shelat. 2017. Analysis of the Blockchain Protocol in Asynchronous Networks. In Advances in Cryptology - EUROCRYPT 2017, Jean-Sébastien Coron and Jesper Buus Nielsen (Eds.). Springer International Publishing, Cham, 643--673.
[14]
G. S. WATSON. 1955. Serial correlation in regression analysis I. Biometrika 42, 3-4 (1955), 327--341.
[15]
Sam M. Werner, Dragos I. Ilie, Iain Stewart, and William J. Knottenbelt. 2020. Unstable Throughput: When the Difficulty Algorithm Breaks. (2020). arXiv:arXiv:2006.03044
Index Terms
- On Bitcoin cash's target recalculation functions
Index terms have been assigned to the content through auto-classification.
Comments
Information & Contributors
Information
Published In
September 2021
225 pages
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 November 2021
Check for updates
Qualifiers
- Research-article
Conference
AFT '21
Sponsor:
AFT '21: 3rd ACM Conference on Advances in Financial Technologies
September 26 - 28, 2021
Virginia, Arlington
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 67Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)1
Reflects downloads up to 18 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in