Abstract
In the present note we address the important problem of stability of blockchain systems. The so-called “double-spending attacks” (attempts to spend digital funds more than once) have been analyzed by several authors. We re-state these questions under more realistic assumptions than previously discussed and show that they can be formulated as an optimal stopping problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antonopoulos, A.M.: Mastering Bitcoin: Programming the Open Blockchain, 2nd edn. O’Reilly Media, Inc., Sebastopol (2017). ISBN 1491954388, 9781491954386
Goebel, J., Keeler, H.P., Krzesinski, A.E., Taylor, P.G.: Bitcoin blockchain dynamics: the selfish-mine strategy in the presence of propagation delay. Perform. Eval. 104(Suppl. C), 23–41 (2016). ISSN 0166–5316. http://www.sciencedirect.com/science/article/pii/S016653161630089X
Gruenspan, C., Perez-Marco, R.: Double spend races. Working paper (2017)
Nakomoto, S.: A peer-to-peer electronic cash system. Working paper (2008)
Rosenfeld, M.: Analysis of hashrate-based double spending. Working paper (2014)
Acknowledgement
The first author expresses his warmest gratitudes to Kostya Borovkov for useful remarks.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Hinz, J., Taylor, P. (2019). A Note on Optimal Double Spending Attacks. In: de Gier, J., Praeger, C., Tao, T. (eds) 2017 MATRIX Annals. MATRIX Book Series, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-030-04161-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-030-04161-8_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04160-1
Online ISBN: 978-3-030-04161-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)