Abstract
Payment channel networks like Bitcoin’s Lightning network are an auspicious approach for realizing high transaction throughput and almost-instant confirmations in blockchain networks. However, the ability to successfully conduct payments in such networks relies on the willingness of participants to lock collateral in the network. In Lightning, the key financial incentive to lock collateral are low fees for routing payments of other participants. While users can choose these fees, real-world data indicates that they mainly stick to default fees. By providing insights on beneficial choices for fees, we aim to incentivize users to lock more collateral and improve the effectiveness of the network.
In this paper, we consider a node \(\mathbf {A}\) that given the network topology and the channel details establishes channels and chooses fees to maximize its financial gain. Our contributions are i) formalization of the optimization problem, ii) proving that the problem is NP-hard, and iii) designing and evaluating a greedy algorithm to approximate the optimal solution. In each step, our greedy algorithm establishes a channel that maximizes the increase to \(\mathbf {A}\)’s total reward, which corresponds to maximizing the number of shortest paths passing through \(\mathbf {A}\). Our simulation study leveraged real-world data sets to quantify the impact of our gain optimization and indicates that our strategy is at least a factor two better than other strategies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
\((|V|-1)(|V|-2)\) is the number of pairs of nodes when not including \(\mathbf {A}\).
- 2.
For the rest of section, we drop the transaction amount tx from the channel fee formula \(\mathbf {f}(Ch_i)\) as it is fixed.
- 3.
- 4.
- 5.
The default fee values may change regarding the imported implementation. Our analysis on dataset shows that 33177 out of 68733 edges use the defaults we adopted.
References
Basis of lightning technology. https://github.com/lightningnetwork/ lightning-rfc/blob/master/00-introduction.md
AG, B.T.: Raiden network (2019). https://raiden.network/
Avarikioti, G., Janssen, G., Wang, Y., Wattenhofer, R.: Payment network design with fees. In: Garcia-Alfaro, J., Herrera-Joancomartí, J., Livraga, G., Rios, R. (eds.) DPM/CBT-2018. LNCS, vol. 11025, pp. 76–84. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00305-0_6
Bergamini, E., Crescenzi, P., D’Angelo, G., Meyerhenke, H., Severini, L., Velaj, Y.: Improving the betweenness centrality of a node by adding links. ACM J. Exp. Algorithmics 23, 1–32 (2018)
Brânzei, S., Segal-Halevi, E., Zohar, A.: How to charge lightning. CoRR abs/1712.10222 (2017). http://arxiv.org/abs/1712.10222
Decker, C., Russell, R., Osuntokun, O.: eltoo: a simple layer2 protocol for bitcoin (2018). https://blockstream.com/eltoo.pdf
Decker, C., Wattenhofer, R.: A fast and scalable payment network with bitcoin duplex micropayment channels. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 3–18. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21741-3_1
Dong, M., Liang, Q., Li, X., Liu, J.: Celer network: bring internet scale to every blockchain. arXiv preprint arXiv:1810.00037 (2018)
Dziembowski, S., Eckey, L., Faust, S., Malinowski, D.: PERUN: virtual payment channels over cryptographic currencies. In: Symposium on Security and Privacy (2019)
Egger, C., Moreno-Sanchez, P., Maffei, M.: Atomic multi-channel updates with constant collateral in bitcoin-compatible payment-channel networks. In: CCS (2019)
Engelmann, F., Kopp, H., Kargl, F., Glaser, F., Weinhardt, C.: Towards an economic analysis of routing in payment channel networks. In: Proceedings of the 1st Workshop on Scalable and Resilient Infrastructures for Distributed Ledgers, SERIAL@Middleware 2017. ACM (2017)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977). http://www.jstor.org/stable/3033543
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821–7826 (2002)
Gudgeon, L., Moreno-Sanchez, P., Roos, S., McCorry, P., Gervais, A.: SoK: off the chain transactions. IACR Cryptology ePrint Archive 2019/360 (2019)
Hearn, M.: Micro-payment channels implementation now in bitcoinj (2013). https://bitcointalk.org/index.php?topic=244656.0
Hoenisch, P., Weber, I.: AODV–based routing for payment channel networks. In: Chen, S., Wang, H., Zhang, L.-J. (eds.) ICBC 2018. LNCS, vol. 10974, pp. 107–124. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94478-4_8
Miller, A., Bentov, I., Bakshi, S., Kumaresan, R., McCorry, P.: Sprites and state channels: payment networks that go faster than lightning. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 508–526. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-32101-7_30
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)
Poon, J., Dryja, T.: The bitcoin lightning network: scalable off-chain instant payments (2016). https://lightning.network/lightning-network-paper.pdf
Prihodko, P., Zhigulin, S., Sahno, M., Ostrovskiy, A., Osuntokun, O.: Flare: an approach to routing in lightning network (2016). https://bitfury.com/content/downloads/whitepaper_flare_an_approach_to_routing_in_lightning_network_7_7_2016.pdf
Elements Project: Lightning-getroute (2019). https://github.com/ElementsProject/lightning/blob/master/doc/lightning-getroute.7
Rohrer, E., Malliaris, J., Tschorsch, F.: Discharged payment channels: quantifying the lightning network’s resilience to topology-based attacks. In: Security & Privacy on the Blockchain (2019)
Roos, S., Moreno-Sanchez, P., Kate, A., Goldberg, I.: Settling payments fast and private: efficient decentralized routing for path-based transactions. In: Network and Distributed Systems Security (2018)
Stasi, G.D., Avallone, S., Canonico, R., Ventre, G.: Routing payments on the lightning network. In: iThings/GreenCom/CPSCom/SmartData 2018 (2018)
Acknowledgments
This work was partially supported by Ripple’s University Blockchain Research Initiative.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
A Illustrative Example of the EBC vs. Fee Relationship of a Channel
B Pseudocode Channel Fee Function
Algorithm 2 is a recursive algorithm for determining the best fee in one step of the greedy algorithm.
Rights and permissions
Copyright information
© 2020 International Financial Cryptography Association
About this paper
Cite this paper
Ersoy, O., Roos, S., Erkin, Z. (2020). How to Profit from Payments Channels. In: Bonneau, J., Heninger, N. (eds) Financial Cryptography and Data Security. FC 2020. Lecture Notes in Computer Science(), vol 12059. Springer, Cham. https://doi.org/10.1007/978-3-030-51280-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-51280-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-51279-8
Online ISBN: 978-3-030-51280-4
eBook Packages: Computer ScienceComputer Science (R0)