-
Notifications
You must be signed in to change notification settings - Fork 2.1k
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
Use all valid routes during blinded path construction #9334
base: master
Are you sure you want to change the base?
Conversation
Important Review skippedAuto reviews are limited to specific labels. 🏷️ Labels to auto review (1)
Please check the settings in the CodeRabbit UI or the You can disable this status message by setting the Thank you for using CodeRabbit. We offer it for free to the OSS community and would appreciate your support in helping us grow. If you find it useful, would you consider giving us a shout-out on your favorite social media? 🪧 TipsChatThere are 3 ways to chat with CodeRabbit:
Note: Be mindful of the bot's finite context window. It's strongly recommended to break down tasks such as reading entire modules into smaller chunks. For a focused discussion, use review comments to chat about specific files and their changes, instead of using the PR comments. CodeRabbit Commands (Invoked using PR comments)
Other keywords and placeholders
CodeRabbit Configuration File (
|
This seems like the simpler solution to implement. Since we’re already querying all routes in FindBlindedPaths, it makes sense to just return them. However, it might be worthwhile to introduce a hard constant cap during the pathfinding process to prevent the array size from growing exponentially. Currently, the algorithm explores all possible paths within the given constraints. Instead, we could stop after finding, say, 100 routes in total, and then apply filtering to select the MaxNumPaths in BuildBlindedPaymentPaths, as proposed in this PR. Probably the constraints of the Min/Max Hop number prevents these high numbers for routes but I think having a cap is kind of a sanity check. |
Before the proposed changes we are querying all routes, sorting the routes based on probability and them capping them based on |
I think we need to do way more when creating the path rather than creating the path and later checking the probability this does not seem efficient. I think we should build the path in the first place based on probability not just running a depth first search on all available paths. But I am not sure how difficult that might be because we went with the recusrive approach. |
I think we might compute the total probability and sort the path list during the creation of it (into |
yes let's keep it as is and focus only on the underlying issue. |
Hello @ziggie1984 gently reminder of review 😉 |
unit-test fail ! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looking good I am missing 2 things here:
- Can you add some logging stats how many routes are find in total, then how many are filtered out because of the probability as for example debug information. I am very curious whether routes will fail often at the level where the final route and relay information is accumulated.
- I tend to introduce a max route variable for the blinded path finding in general, maybe a default of 50 routes, otherwise we look for everything which with a big number of blinded hops might be wasteful.
}, | ||
) | ||
require.NoError(t, err) | ||
assertPaths(routes, []string{ |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can we still check here the expected number of paths now
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes, we could, but it would be redundant since this is already tested in the previous tests.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
which one do you mean ?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
My understanding is that this test was meant to verify the numpaths
restriction. Without it, no additional cases are being tested beyond those already covered in the previous tests.
@MPins, remember to re-request review from reviewers when ready |
41573d0
to
c1251d7
Compare
Hello Ziggie, I had addressed your comments, thank you! Ready for your next review! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for the PR. I looked through the changes and left some comments/questions.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thank you @Abdulkbk for your review!
@ziggie1984 and @Abdulkbk , it is ready for your review. 🤝 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looking good, I want to get @ellemouton opinion on the recursive abort criteria in case we have a maximum number of paths.
Missing release notes for LND 20.
routing/router.go
Outdated
for _, route := range routes { | ||
if len(bestRoutes) >= int(restrictions.MaxNumPaths) { | ||
if len(allRoutes) >= maxRoutes { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
that is not what I meant, my idea was to exit the recursion early when enough paths are found,
I was more thinking of restricting the recursion in processNodeForBlindedPath
but I would like to get @ellemouton opinion on this and also this can probably done in another PR.
Currently our DFS exhausts all Paths which exist in the graph, so I was thinking we could abort the DFS after we already have a hopSet
of let's say 100 ?
Imagine we have a minRouteLen of 2 and a maxRouteLen of 6, each node has more than 100 channels, when reaching the depth of 6, we could easily accumulate > 1000 routes which seems unreasonable.
But the above restrictions we do not need, because really makes not difference we already have all the paths in memory.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You right, thanks for the explanation.
The point is that, in the current implementation, we first retrieve all the routes and then sort them to prioritize those with the highest success probability.
Instead, we should modify the process to evaluate the probability of each route during the iteration, keeping only the best ones.
}, | ||
) | ||
require.NoError(t, err) | ||
assertPaths(routes, []string{ |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
which one do you mean ?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@ziggie1984 thank for your review! Comments addressed.
routing/router.go
Outdated
for _, route := range routes { | ||
if len(bestRoutes) >= int(restrictions.MaxNumPaths) { | ||
if len(allRoutes) >= maxRoutes { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You right, thanks for the explanation.
The point is that, in the current implementation, we first retrieve all the routes and then sort them to prioritize those with the highest success probability.
Instead, we should modify the process to evaluate the probability of each route during the iteration, keeping only the best ones.
}, | ||
) | ||
require.NoError(t, err) | ||
assertPaths(routes, []string{ |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
My understanding is that this test was meant to verify the numpaths
restriction. Without it, no additional cases are being tested beyond those already covered in the previous tests.
MaxNumPaths restriction moved from FindBlindedPaths to BuildBlindedPaymentPaths this way we can interact through all possibly routes when creating a new blinded path.
… use MaxNumPaths MaxNumPaths restriction moved from FindBlindedPaths to BuildBlindedPaymentPaths this way we have to fill the MaxNumPaths parameter when calling this function.
There is no release notes for LND 20 yet. Should I create it? |
Fixes #9076
MaxNumPaths restriction moved from
FindBlindedPaths
toBuildBlindedPaymentPaths
this way we can interact through all possibly routes.If the reviewers agreed to this approach we will have to modify the
TestFindBlindedPathsWithMC
because it is considering that MaxNumPaths retriction is applied onFindBlindedPaths
function.