Ant Routing scalability for the Lightning Network

The ambition of the Lightning Network is to provide a second layer to the Bitcoin network to enable transactions confirmed instantly, securely and anonymously with a world scale capacity using a decentralized protocol. Some of the current propositions and implementations present some difficulties in anonymity, scaling and decentalization. The Ant Routing algorithm for the Lightning Network was proposed in [7] for maximal decentralization, anonymity and potential scaling. It solves several problems of current implementation, such as channel information update and centralization by beacon nodes. Ant Routing nodes play all the same role and don't require any extra information on the network topology beside for their immediate neighbors. The goal of LN transactions are completed instantaneously and anonymously. We study the scaling of the Ant Routing protocol. We propose a precise implementation, with efficient memory management using AVL trees. We evaluate the efficiency of the algorithm and we estimate the memory usage of nodes by local node workload simulations. We prove that the number of transactions per second that Ant Routing can sustain is of the order of several thousands which is enough for a global payment network.

[1]  Radhika Mittal,et al.  High Throughput Cryptocurrency Routing in Payment Channel Networks , 2020, NSDI.

[2]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[3]  Cyril Grunspan,et al.  Ant routing algorithm for the Lightning Network , 2018, ArXiv.

[4]  Giulio Malavolta,et al.  SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks , 2017, NDSS.

[5]  Stefanie Roos,et al.  Anonymous addresses for efficient and resilient routing in F2F overlays , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[6]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[8]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[9]  László Gulyás,et al.  Topological Analysis of Bitcoin's Lightning Network , 2019, MARBLE.

[10]  Baruch Awerbuch.  Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization , 1985, Networks.

[11]  Cyril Grunspan,et al.  Double spend races , 2017, International Journal of Theoretical and Applied Finance.

[12]  Rene Pickhardt,et al.  Imbalance measure and proactive channel rebalancing algorithm for the Lightning Network , 2019, 2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC).

[13]  Pramod Viswanath,et al.  Routing Cryptocurrency with the Spider Network , 2018, HotNets.

[14]  Bandwidth-Eicient Transaction Relay in Bitcoin , 2019 .

[15]  Cristina Pérez-Solà,et al.  TxProbe: Discovering Bitcoin's Network Topology Using Orphan Transactions , 2018, Financial Cryptography.

[16]  Ian Goldberg,et al.  Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions , 2017, NDSS.

[17]  Evangelos Georgiadis,et al.  How many transactions per second can bitcoin really handle ? Theoretically , 2019, IACR Cryptol. ePrint Arch..