{"type":"rich","version":"1.0","author_name":"npub1aslmpzentw224n3s6yccru4dq2qdlx7rfudfnqevfck637cjt6esswfqmx","author_url":"https://nostr.ae/npub1aslmpzentw224n3s6yccru4dq2qdlx7rfudfnqevfck637cjt6esswfqmx","provider_name":"njump","provider_url":"https://nostr.ae","html":"📅 Original date posted:2022-07-01\n📝 Original message:\n\u003e\n\u003e Path-finding algorithms that are currently in use generally don’t support\n\u003e negative fees. But in this case, the sum of inbound and outbound fees is\n\u003e still positive and therefore not a problem. If routing nodes set their\n\u003e policies accidentally or intentionally so that the sum of fees turns out\n\u003e negative, senders can just round up to zero and find a path as normal.\n\u003e\n\nCorrection to this:\n\nThe sum of inbound and outbound are not the fees set by one single routing\nnode. When path-finding considers a candidate hop, this adds the outbound\nfee of the \"from\" node and the inbound fee of the \"to\" node. Because those\nnodes don't necessarily coordinate fees, it may happen more often that the\nfee goes negative. Rounding up to zero is still a quick fix and better than\nignoring inbound fees completely.\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/lightning-dev/attachments/20220701/632a50ce/attachment.html\u003e"}