Author: René Pickhardt 2020-01-07 14:57:41
Published on: 2020-01-07T14:57:41+00:00
A proposed algorithm for conducting payments that optimally reduces the imbalance of nodes when conducting a (multipath) payment was shared in an email. The algorithm assumes a node u wants to pay someone for an amount a and computes the new node balance coefficient ν′u after this imaginary payment has been conducted as τu−a/κu, where τu is the total amount of funds that node u currently has and κu is the sum of the capacities of all its payment channels. For all online channel partners, the algorithm computes ζ(u,v1),…,ζ(u,vd), assuming channels are ordered such that ζ(u,v1)>…>ζ(u,vd′) and omitting channels with ζ(u,vi)−ν′u Updated on: 2023-06-02T22:30:33.978109+00:00