Skip to main content

On the Bitcoin Limitations to Deliver Fairness to Users

  • Conference paper
  • First Online:
On the Move to Meaningful Internet Systems. OTM 2017 Conferences (OTM 2017)

Abstract

While current Bitcoin literature mainly focuses on miner behaviors, little has been done to analyze user participation. Because Bitcoins users do not benefit from any incentive, their participation in the system is conditional upon system ability to provide a transactional service at a reasonable cost and acceptable quality. A recent observed trend on a growing number of unconfirmed transactions seems, however, to substantiate that Bitcoin is facing service degradation. The objective of this paper is to shed some light on user participation in Bitcoin against a notion of system fairness, through a utility-based approach. We first introduce fairness to quantify the satisfaction degree of participants (both users and miners) with respect to their justified expectations over time. We then characterize user strategies, deriving the necessary condition for fairness, and we show Bitcoin limitations in delivering it. The utility-based model allows to finally draw conclusions on possible improvements for fairness to promote user participation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Technically the miners can create empty blocks and get block rewards. But this is not the purpose of blockchain systems.

  2. 2.

    This description is based on the Nakamoto paper [13], the Bitcoin source code (https://github.com/bitcoin/bitcoin), bitcoin.org (https://bitcoin.org/) and the Bitcoin StackExchange forum (https://bitcoin.stackexchange.com/).

  3. 3.

    https://bitcoin.stackexchange.com/questions/53938/how-does-one-node-connect-to-other-nodes, last access 30 May 2017.

  4. 4.

    Hashing power is proportional to computational power and nodes may change this power by time.

  5. 5.

    Any transaction fees collected by the miner are also sent in this transaction.

  6. 6.

    Note to remember is that the coins in a coinbase transaction cannot be spent until they have received 100 confirmations in the blockchain. All things being equal, 100 confirmations should equate to roughly 16 h and 40 min.

  7. 7.

    The current maximum block size in Bitcoin is 1 MB. See https://bitcoin.org/en/glossary/block-size-limit, last access on 18 July 2017.

  8. 8.

    Average block size for Bitcoin is given in https://blockchain.info/charts/avg-block-size, last access on 18 July 2017.

  9. 9.

    Technically speaking this means to consider P(f) modeled as a stationary process, and the blockchain system as an ergodic dynamical system [4].

  10. 10.

    For simplicity, it is assumed that the sizes of both \(Tx_1\) and \(Tx_2\) are equal to the maximum block size.

  11. 11.

    The principle of insufficient reason prescribes that if one has no reason to think that one state of the world is more probable than another, then all state should be assigned equal probability [16].

  12. 12.

    This is the same situation as in the Saint Petersburg Paradox [19].

  13. 13.

    In the Bitcoin protocol blocks have fixed size (see Sect. 3.5).

  14. 14.

    Such device hash rate is 14TH/s, which means \(14e12*36000\) attempts to solve the PoW in a round (10 min in average).

  15. 15.

    During the submission process of this paper (August 2017), the Bitcoin (BTC) protocol, which has 1 MB of block size, has been hard forked as the Bitcoin Cash (BCC) protocol, which has 8 MB of block size. However, it is early to conclude if BCC is better than BTC for the moment.

References

  1. Asokan, N.: Fairness in electronic commerce (1998)

    Google Scholar 

  2. Babaioff, M., Dobzinski, S., Oren, S., Zohar, A.: On bitcoin and red balloons. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 56–73. ACM (2012)

    Google Scholar 

  3. Carlsten, M., Kalodner, H., Weinberg, S.M., Narayanan, A.: On the instability of bitcoin without the block reward. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 154–167. ACM (2016)

    Google Scholar 

  4. Coudene, Y.: Ergodic Theory and Dynamical Systems. Universitext. Springer, London (2016). http://dx.doi.org/10.1007/978-1-4471-7287-1

    Book  MATH  Google Scholar 

  5. Eyal, I.: The miner’s dilemma. In: 2015 IEEE Symposium on Security and Privacy (SP), pp. 89–103. IEEE (2015)

    Google Scholar 

  6. Eyal, I., Gencer, A.E., Sirer, E.G., Van Renesse, R.: Bitcoin-ng: a scalable blockchain protocol. In: NSDI, pp. 45–59 (2016)

    Google Scholar 

  7. Eyal, I., Sirer, E.G.: Majority is not enough: bitcoin mining is vulnerable. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 436–454. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45472-5_28

    Google Scholar 

  8. Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281–310. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46803-6_10

    Google Scholar 

  9. Göbel, 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, 23–41 (2016)

    Article  Google Scholar 

  10. Lewenberg, Y., Sompolinsky, Y., Zohar, A.: Inclusive block chain protocols. In: Böhme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 528–547. Springer, Heidelberg (2015). doi:10.1007/978-3-662-47854-7_33

    Chapter  Google Scholar 

  11. Liu, J., Li, W., Karame, G.O., Asokan, N.: Towards fairness of cryptocurrency payments. arXiv preprint arXiv:1609.07256 (2016)

  12. Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988). doi:10.1007/3-540-48184-2_32

    Google Scholar 

  13. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https://bitcoin.org/bitcoin.pdf

  14. Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. IACR Cryptology ePrint Archive 2016:454 (2016)

    Google Scholar 

  15. Pass, R., Shi, E.: Fruitchains: a fair blockchain. Cryptology ePrint Archive, Report 2016/916 (2016). http://eprint.iacr.org/2016/916.pdf

  16. Resnik, M.D.: Choices: An Introduction to Decision Theory. University of Minnesota Press, Minneapolis (1987)

    Google Scholar 

  17. Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach, 3rd edn. Pearson Education, Essex (2010)

    MATH  Google Scholar 

  18. Sapirshtein, A., Sompolinsky, Y., Zohar, A.: Optimal selfish mining strategies in bitcoin. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 515–532. Springer, Heidelberg (2017). doi:10.1007/978-3-662-54970-4_30

    Chapter  Google Scholar 

  19. Weiss, M.: Conceptual Foundations of Risk Theory. Technical Bulletin. U.S. Department of Agriculture, Economic Research Service, Washington, D.C. (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Önder Gürcan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gürcan, Ö., Del Pozzo, A., Tucci-Piergiovanni, S. (2017). On the Bitcoin Limitations to Deliver Fairness to Users. In: Panetto, H., et al. On the Move to Meaningful Internet Systems. OTM 2017 Conferences. OTM 2017. Lecture Notes in Computer Science(), vol 10573. Springer, Cham. https://doi.org/10.1007/978-3-319-69462-7_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69462-7_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69461-0

  • Online ISBN: 978-3-319-69462-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics