Skip to content

Better Handle Low-Fee Paths when Routing #3771

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
TheBlueMatt opened this issue May 11, 2025 · 0 comments
Open

Better Handle Low-Fee Paths when Routing #3771

TheBlueMatt opened this issue May 11, 2025 · 0 comments
Milestone

Comments

@TheBlueMatt
Copy link
Collaborator

Our router currently uses max(htlc_min, fee) for fees when picking a path, which addresses an important edge case where we might reduce a path's amount later during pathfinding and pay up to htlc_min in fees. However, when we're dealing with a path that has a bunch of nodes that have htlc_min of 1 sat and we're sending a small amount (eg a zap of 21 sats), this can start to impact our ability to pick cheap paths.

Its not clear exactly what to do here, but at a minimum we could detect cases where the per-path min means we won't be limited by the htlc_min and can prefer paths by their real fee, rather than just prop fees, when picking paths out of a candidate set during MPP.

@TheBlueMatt TheBlueMatt added this to the 0.3 milestone May 11, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant