diff --git a/12_path_finding.asciidoc b/12_path_finding.asciidoc index 1b89a56..a813619 100644 --- a/12_path_finding.asciidoc +++ b/12_path_finding.asciidoc @@ -389,7 +389,7 @@ Quantifying this optimal balance of size/number-of-splits for a given channel gr [NOTE] ==== -To read more about the optimization problem known as Minimum-Cost Flows involved when splitting payments into different sizes and allocating them to paths see the paper: https://arxiv.org/abs/2107.05322[Optimally Reliable & Cheap Payment Flows on the Lightning Network] by (co-author of this book) Rene Pickhardt & Stefan Richter. +To read more about the optimization problem known as Minimum-Cost Flows involved when splitting payments into different sizes and allocating them to paths see the paper: https://arxiv.org/abs/2107.05322[Optimally Reliable & Cheap Payment Flows on the Lightning Network] by (co-author of this book) René Pickhardt & Stefan Richter. ==== In our example, Selena's node will attempt to split the 1m satoshi payment into two parts with 600k and 400k satoshi respectively and send them on two different paths. This is shown in <>: