Ant Routing scalability for the Lightning Network - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2020

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.
Fichier principal
Vignette du fichier
AntRoutingPerformance21.pdf (634 Ko) Télécharger le fichier
cleaning_time.png (47.87 Ko) Télécharger le fichier
insertion_time.png (58.29 Ko) Télécharger le fichier
lookup_time.png (60.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)

Dates and versions

hal-02467123 , version 1 (04-02-2020)


  • HAL Id : hal-02467123 , version 1


Cyril Grunspan, Gabriel Lehéricy, Ricardo Pérez-Marco. Ant Routing scalability for the Lightning Network. 2020. ⟨hal-02467123⟩
68 View
262 Download


Gmail Facebook X LinkedIn More