闪电网络上最可靠和廉价的支付流
Optimally Reliable & Cheap Payment Flows on the Lightning Network
摘要:
今天,比特币闪电网络中的支付路径是通过在费用图上搜索最短路径来找到的。我们在两个方面加强了这种方法。首先,我们考虑由于渠道中的未知余额分布而实际上可能支付的概率。其次,我们使用最小成本流作为多部分支付(MPP)的最短路径的适当推广。特别是,我们表明,在合理的假设下的平衡分布,我们可以找到最有可能的MPP为任何给定的一组,收件人和金额通过求解(广义)整数最小成本流与可分离的凸成本函数。多项式时间精确算法以及近似是已知的这个优化问题。我们提出了一种基于轮的最小成本流计算算法,用于在闪电网络上提供大量支付。该算法的工作原理是利用从前几轮的成功和不成功路径中获得的信息来更新概率分布。在我们所有的实验中,一位数的回合数就足以提供接近发送者本地总余额的支付规模。早期的实验表明,我们的方法增加了支付的规模,可以可靠地提供了几个数量级相比,目前的最先进的。我们观察到,找到最便宜的多部分支付是一个NP-困难的问题,考虑到目前的费用结构,并建议放弃基本费用,使其成为一个线性最小成本流问题。最后,我们讨论的可能性最大化的概率,而在同一时间最小化的流量的费用。虽然这在一般情况下也是一个很难解决的问题--即使是在单路径的情况下--但在实践中它似乎出奇地容易处理。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。