Skip to main content

Promise: Leveraging Future Gains for Collateral Reduction

  • Conference paper
  • First Online:
Mathematical Research for Blockchain Economy

Part of the book series: Springer Proceedings in Business and Economics ((SPBE))

Abstract

Collateral employed in cryptoeconomic protocols protects against the misbehavior of economically rational agents, compensating honest users for damages and punishing misbehaving parties. The introduction of collateral, however, carries three disadvantages: (i) requiring agents to lock up substantial amount of collateral can be an entry barrier, limiting the set of candidates to wealthy agents; (ii) affected agents incur ongoing opportunity costs as the collateral cannot be utilized elsewhere; and (iii) users wishing to interact with an agent on a frequent basis (e.g., with a service provider to facilitate second-layer payments), have to ensure the correctness of each interaction individually instead of subscribing to a service period in which interactions are secured by the underlying collateral. We present Promise, a subscription mechanism to decrease the initial capital requirements of economically rational service providers in cryptoeconomic protocols. The mechanism leverages future income (such as service fees) prepaid by users to reduce the collateral actively locked up by service providers, while sustaining secure operation of the protocol. Promise is applicable in the context of multiple service providers competing for users. We provide a model for evaluating its effectiveness and argue its security. Demonstrating Promise’s applicability, we discuss how Promise can be integrated into a cross-chain interoperability protocol, XCLAIM, and a second-layer scaling protocol, NOCUST. Last, we present an implementation of the protocol on Ethereum showing that all functions of the protocol can be implemented in constant time complexity and Promise only adds USD 0.05 for a setup per user and service provider and USD 0.01 per service delivery during the subscription period.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    Based on https://docs.keep.network/tbtc/index.pdf from 3 May 2020.

  2. 2.

    Based on https://www.coingecko.com/en/earn/ethereum from 3 May 2020.

  3. 3.

    https://github.com/nud3l/Promise/tree/master/src.

References

  1. MakerDAO Whitepaper. https://makerdao.com/whitepaper. Accessed: 2018-11-28

  2. Aiyer, A. S., Alvisi, L., Clement, A., Dahlin, M., Martin, J. P., & Porth, C. (2005). Bar fault tolerance for cooperative services. In ACM SIGOPS operating systems review (Vol. 39, pp. 45–58). ACM.

    Google Scholar 

  3. Al-Bassam, M., Sonnino, A., & Buterin, V. (2018). Fraud proofs: Maximising light client security and scaling blockchains with dishonest majorities. arXiv:1809.09044.

  4. Avarikioti, G., Kogias, E. K., & Wattenhofer, R. (2019). Brick: Asynchronous state channels. arXiv preprint arXiv:1905.11360.

  5. Avarikioti, G., Laufenberg, F., Sliwinski, J., Wang, Y., & Wattenhofer, R. (2018). Towards secure and efficient payment channels. arXiv preprint arXiv:1811.12740.

  6. Bartoletti, M., & Zunino, R. (2018). BitML: A calculus for bitcoin smart contracts. In CCS ’18 Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (pp. 83–100). https://doi.org/10.1145/3243734.3243795.

  7. Berg, P. R. (2018). ERC-1620: Money streaming. https://github.com/ethereum/EIPs/issues/1620.

  8. Böhme, R. (2019). A primer on economics for cryptocurrencies.

    Google Scholar 

  9. Douceur, J. R. (2002). The sybil attack. In International Workshop on Peer-to-Peer Systems (pp. 251–260). Springer.

    Google Scholar 

  10. Dziembowski, S., Eckey, L., & Faust, S. (2018). FairSwap: How to fairly exchange digital goods. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18 (pp. 967–984). New York, USA: ACM Press. https://doi.org/10.1145/3243734.3243857, http://dl.acm.org/citation.cfm?doid=3243734.3243857.

  11. Dziembowski, S., Faust, S., & Hostáková, K. (2018). General state channel networks. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (pp. 949–966). ACM.

    Google Scholar 

  12. Fanti, G., Kogan, L., Oh, S., Ruan, K., Viswanath, P., & Wang, G. (2019). Compounding of wealth in proof-of-stake cryptocurrencies. In Financial cryptography and data security 2019.

    Google Scholar 

  13. Garay, J. A., Kiayias, A., & Leonardos, N. (2016). The bitcoin backbone protocol with chains of variable difficulty. http://eprint.iacr.org/2016/1048.pdf. Accessed: 2017-02-06

  14. Harz, D., Gudgeon, L., Gervais, A., & Knottenbelt, W. J. (2019). Balance: Dynamic adjustment of cryptocurrency deposits. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS ’19). New York, NY, USA: ACM. https://eprint.iacr.org/2019/675.pdf.

  15. Khalil, R., Gervais, A., & Felley, G. (2019). NOCUST - A securely scalable commit-chain. https://eprint.iacr.org/2018/642.

  16. McCorry, P., Bakshi, S., Bentov, I., Miller, A., & Meiklejohn, S. (2018). Pisa: Arbitration outsourcing for state channels. IACR Cryptology ePrint Archive, 2018, 582.

    Google Scholar 

  17. Scott, J. H, Jr. (1977). Bankruptcy, secured debt, and optimal capital structure. The Journal of Finance, 32(1), 1–19.

    Article  Google Scholar 

  18. Stulz, R., & Johnson, H. (1985). An analysis of secured debt. Journal of Financial Economics, 14(4), 501–521.

    Article  Google Scholar 

  19. Teutsch, J., Mäkelä, S., & Bakshi, S. (2019). Bootstrapping a stable computation token. arXiv:1908.02946.

  20. Teutsch, J., & Reitwießner, C. (2017, March). A scalable verification solution for blockchains. https://truebit.io/. Accessed: 2017-10-06.

  21. Zamyatin, A., Harz, D., Lind, J., Panayiotou, P., Gervais, A., & Knottenbelt, W. J. (2019). XCLAIM: Trustless, interoperable, cryptocurrency-backed assets. In Proceedings of the IEEE Symposium on Security & Privacy, May 2019 (pp. 1254–1271). https://eprint.iacr.org/2018/643.pdf.

Download references

Acknowledgements

The authors would like to thank Arthur Gervais and William Knottenbelt for their helpful feedback on this paper. Further, the authors thank the anonymous reviewers for their excellent feedback and suggestions for improvement.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Dominik Harz or Lewis Gudgeon .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Harz, D., Gudgeon, L., Khalil, R., Zamyatin, A. (2020). Promise: Leveraging Future Gains for Collateral Reduction. In: Pardalos, P., Kotsireas, I., Guo, Y., Knottenbelt, W. (eds) Mathematical Research for Blockchain Economy. Springer Proceedings in Business and Economics. Springer, Cham. https://doi.org/10.1007/978-3-030-53356-4_9

Download citation

Publish with us

Policies and ethics