Optimally Reliable Cheap Payment Flows on the Lightning Network

07/12/2021
by   Rene Pickhardt, et al.
0

Today, payment paths in Bitcoin's Lightning Network are found by searching for shortest paths on the fee graph. We enhance this approach in two dimensions. Firstly, we take into account the probability of a payment actually being possible due to the unknown balance distributions in the channels. Secondly, we use minimum cost flows as a proper generalization of shortest paths to multi-part payments (MPP). In particular we show that under plausible assumptions about the balance distributions we can find the most likely MPP for any given set of senders, recipients and amounts by solving for a (generalized) integer minimum cost flow with a separable and convex cost function. Polynomial time exact algorithms as well as approximations are known for this optimization problem. We present a round-based algorithm of min-cost flow computations for delivering large payment amounts over the Lightning Network. This algorithm works by updating the probability distributions with the information gained from both successful and unsuccessful paths on prior rounds. In all our experiments a single digit number of rounds sufficed to deliver payments of sizes that were close to the total local balance of the sender. Early experiments indicate that our approach increases the size of payments that can be reliably delivered by several orders of magnitude compared to the current state of the art. We observe that finding the cheapest multi-part payments is an NP-hard problem considering the current fee structure and propose dropping the base fee to make it a linear min-cost flow problem. Finally, we discuss possibilities for maximizing the probability while at the same time minimizing the fees of a flow. While this turns out to be a hard problem in general as well - even in the single path case - it appears to be surprisingly tractable in practice.

READ FULL TEXT
research
11/03/2017

A Faster Distributed Single-Source Shortest Paths Algorithm

We devise new algorithms for the single-source shortest paths problem in...
research
09/12/2022

A Note on the Quickest Minimum Cost Transshipment Problem

Klinz and Woeginger (1995) prove that the minimum cost quickest flow pro...
research
06/01/2022

Minimum-Cost Flows Over Time

In this paper we show that every maximum minimum-cost flow over time pro...
research
07/04/2019

Min-Cost Flow in Unit-Capacity Planar Graphs

In this paper we give an O((nm)^2/3 C) time algorithm for computing min-...
research
06/18/2020

Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier

We consider the bi-criteria shortest-path problem where we want to compu...
research
08/05/2020

Robust Minimum Cost Flow Problem Under Consistent Flow Constraints

The robust minimum cost flow problem under consistent flow constraints (...
research
09/07/2022

Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow

We present rectified flow, a surprisingly simple approach to learning (n...

Please sign up or login with your details

Forgot password? Click here to reset