Renepay const prob cost #7540
Merged
Renepay const prob cost #7540
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Lagrang3
force-pushed
the
renepay-const-prob-cost
branch
from
9fd2d3e to
da4be80
Compare
|
@renepickhardt this sounds a lot like the discussion with a multiplicative factor from Monday :-) Could you recap that discussion briefly here? |
Lagrang3
commented
Aug 8, 2024
The probability for a success forward of x amount on a channel is now computed as: P_success(x) = b * P_rene(x) where P_rene(x) is the probability distribution proposed by Rene Pickhardt with a uniform distribution on the known liquidity of the channel and 'b' is a new parameter we add in this PR, by the name of "base probability". The "base probability" represents the probability for a channel in the network choosen at random to be able to forward at least 1msat, ie. of being alive, non-depleted and with at least one HTLC slot. We don't know the value of 'b', but for the moment we assume that it is 0.98 and use that as default. As a consequence the probability cost becomes non-linear and non-convex because of the additional constant term: Cost(x) = - log P_success(x) = - log b - - log P_rene(x) = - log b + Cost_rene(x) We currently don't handle well base fees and neither this additional "base probability" but we can as a first approximation linearize the cost function in this way: Cost_linear(x) = (- log b)*x + Cost_rene_linear(x) Changelog-Added: renepay: Add a dev parameter to renepay that represents a constant probability of availability for all channels in the network. Signed-off-by: Lagrang3 <[email protected]>
|
I've seen great improvements in the reliability of the payments after adding this and #7548. As a disclaimer, I have not tools to quantify this improvement, that judgement is only based on my tests on mainnet. |
Lagrang3
force-pushed
the
renepay-const-prob-cost
branch
from
1d19f84 to
67ffd8d
Compare
|
Rebased to fix conflicts, head is 67ffd8d. |
rustyrussell
approved these changes
Aug 15, 2024
2 tasks
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
4 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The probability for a success forward of
xamount on a channel is nowcomputed as:
where
P_rene(x)is the probability distribution proposed by @renepickhardtwith a uniform distribution on the known liquidity of the
channel and
bis a new parameter we add in this PR, by the name of"base probability". The "base probability" represents the probability
for a channel in the network chosen at random to be able to forward at
least 1msat, ie. of being alive, non-depleted and with at least one HTLC
slot. We don't know the value of 'b', but for the moment we assume that
it is 0.98 and use that as default.
As a consequence the probability cost becomes non-linear and non-convex
because of the additional constant term:
We currently don't handle well base fees and neither this additional
"base probability" but we can as a first approximation linearize the
cost function in this way: