<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Optimally Reliable &amp; Cheap Payment Flows on the Lightning Network · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2107.05322/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2107.05322/feed.xml" rel="self" type="application/rss+xml" /><item><title>Optimally Reliable &amp; Cheap Payment Flows on the Lightning Network — mentioned by xiphias2</title><link>https://news.ycombinator.com/item?id=31149444</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.05322:31149444</guid><pubDate>Mon, 25 Apr 2022 00:04:40 GMT</pubDate><description>&lt;p&gt;,, Our framework extends to an algorithm running in m1+o(1) time for computing flows that minimize general edge-separable convex functions to high accuracy.&amp;#x27;&amp;#x27; This looks like an interesting improvement possibility over the current algorithm for optimal pathfinding over the Lightning Network by Rene Pickhart, it would be interesting to know what he thinks about it: https://arxiv.org/abs/2107.05322&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.05322/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item></channel></rss>
