Matt Corallo 0d7c316259 [router] Avoid re-processing peers when a score component decreases ... While walking the graph doing Dijkstra's, we may decrease the amount being sent along one path, and not others, based on the htlc_minimum_msat value. This may result in a lower relative fees on that path in comparison to others. In the extreme, this may result in finding a second path to a node with a lower fee than the first path found (normally impossible in a Dijkstra's implementation, as we walk next hops in fee-order). In such a case, we end up with parts of our state invalid as further hops beyond that node have been filled in using the original total fee information. Instead, we simply track which nodes have been processed and ignore and further updates to them (as it implies we've reduced the amount we're sending to find a lower absolute fee, but a higher relative fee, which isn't a better route). We check that we are in exactly this case in test builds with new in-line assertions. Note that these assertions successfully detect the bug in the previous commit. Sadly this requires an extra HashMap lookup every time we pop an element off of our heap, though we can skip a number of heap pushes during the channel walking.		2021-04-06 21:41:45 -04:00
..
src	[router] Avoid re-processing peers when a score component decreases	2021-04-06 21:41:45 -04:00
Cargo.toml	Update licenses and add missing fields in Cargo.toml files	2021-03-09 16:53:03 -05:00