|
|
|
@ -64,7 +64,7 @@ The standard path finding mechanism with source based onion routing that is impl
|
|
|
|
|
3. Send out the onion and see if the payment settles by nodes sending back preimages or if the payment fails.
|
|
|
|
|
4. If the payment fails use this knowledge to select a different path by starting at step 1.
|
|
|
|
|
|
|
|
|
|
This means that with every attampted payment nodes actually probe the network and will also learn some information about how balances are distributed.
|
|
|
|
|
This means that with every attempted payment nodes actually probe the network and will also learn some information about how balances are distributed.
|
|
|
|
|
Implementations will usually prioritice cheaper paths or exclude channels which recently have failed.
|
|
|
|
|
In that sense the selection is not completely arbitrary.
|
|
|
|
|
Still even with such heuristics in place it could still be considered as a random process or random walk through the channel graph.
|
|
|
|
|