routing: rewrite package to conform to BOLT07 and factor in fees+timelocks
This commit overhauls the routing package significantly to simplify the
code, conform to the rest of the coding style within the package, and
observe the new authenticated gossiping scheme outlined in BOLT07.
As a major step towards a more realistic path finding algorithm, fees
are properly calculated and observed during path finding. If a path has
sufficient capacity _before_ fees are applied, but afterwards the
finalized route would exceed the capacity of a single link, the route
is marked as invalid.
Currently a naive weighting algorithm is used which only factors in the
time-lock delta at each hop, thereby optimizing for the lowest time
lock. Fee calculation also isn’t finalized since we aren’t yet using
milli-satoshi throughout the daemon. The final TODO item within the PR
is to properly perform a multi-path search and rank the results based
on a summation heuristic rather than just return the first (out of
many) route found.
On the server side, once nodes are initially connected to the daemon,
our routing table will be synced with the peer’s using a naive “just
send everything scheme” to hold us over until I spec out some a
efficient graph reconciliation protocol. Additionally, the routing
table is now pruned by the channel router itself once new blocks arrive
rather than depending on peers to tell us when a channel flaps or is
closed.
Finally, the validation of peer announcements aren’t yet fully
implemented as they’ll be implemented within the pending discovery
package that was blocking on the completion of this package. Most off
the routing message processing will be moved out of this package and
into the discovery package where full validation will be carried out.
2016-12-27 08:20:26 +03:00
|
|
|
{
|
|
|
|
|
"info": [
|
|
|
|
|
"This file encodes a basic graph that resembles the following ascii graph:",
|
|
|
|
|
"",
|
|
|
|
|
" 50k satoshis ┌──────┐ ",
|
|
|
|
|
" ┌───────────────────▶│luo ji│◀─┐ ",
|
|
|
|
|
" │ └──────┘ │ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" ▼ │ ┌──────┐ ",
|
|
|
|
|
" ┌────────┐ │ │sophon│◀┐ ",
|
|
|
|
|
" │satoshi │ │ └──────┘ │ ",
|
|
|
|
|
" └────────┘ │ │ ",
|
|
|
|
|
" ▲ │ │ 500 satoshis ",
|
|
|
|
|
" │ ┌───────────────────┘ │ ",
|
|
|
|
|
" │ │ 100k satoshis │ ",
|
|
|
|
|
" │ │ │ ",
|
|
|
|
|
" │ │ │ ┌────────┐ ",
|
|
|
|
|
" └──────────┤ └─▶│son goku│ ",
|
|
|
|
|
" 10k satoshis │ └────────┘ ",
|
|
|
|
|
" │ ▲ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" │ │ ",
|
|
|
|
|
" ▼ │ ",
|
|
|
|
|
" ┌──────────┐ │ ",
|
|
|
|
|
" │ roasbeef │◀─────────────────────────────────────┘ ",
|
|
|
|
|
" └──────────┘ 100k satoshis "
|
|
|
|
|
],
|
|
|
|
|
"nodes": [
|
|
|
|
|
{
|
|
|
|
|
"source": true,
|
|
|
|
|
"pubkey": "0367cec75158a4129177bfb8b269cb586efe93d751b43800d456485e81c2620ca6",
|
|
|
|
|
"alias": "roasbeef"
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"source": false,
|
|
|
|
|
"pubkey": "032b480de5d002f1a8fd1fe1bbf0a0f1b07760f65f052e66d56f15d71097c01add",
|
|
|
|
|
"alias": "songoku"
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"source": false,
|
|
|
|
|
"pubkey": "03c19f0027ffbb0ae0e14a4d958788793f9d74e107462473ec0c3891e4feb12e99",
|
|
|
|
|
"alias": "satoshi"
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"source": false,
|
|
|
|
|
"pubkey": "02e7b1aaac10977c38e9c61c74dc66840de211bcec3021603e7977bc5e28edabfd",
|
|
|
|
|
"alias": "luoji"
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"source": false,
|
|
|
|
|
"pubkey": "036264734b40c9e91d3d990a8cdfbbe23b5b0b7ad3cd0e080a25dcd05d39eeb7eb",
|
|
|
|
|
"alias": "sophon"
|
|
|
|
|
}
|
|
|
|
|
],
|
|
|
|
|
"edges": [
|
|
|
|
|
{
|
|
|
|
|
"node_1": "0367cec75158a4129177bfb8b269cb586efe93d751b43800d456485e81c2620ca6",
|
|
|
|
|
"node_2": "032b480de5d002f1a8fd1fe1bbf0a0f1b07760f65f052e66d56f15d71097c01add",
|
|
|
|
|
"channel_id": 12345,
|
|
|
|
|
"channel_point": "89dc56859c6a082d15ba1a7f6cb6be3fea62e1746e2cb8497b1189155c21a233:0",
|
|
|
|
|
"flags": 0,
|
|
|
|
|
"expiry": 1,
|
|
|
|
|
"min_htlc": 1,
|
|
|
|
|
"fee_base_msat": 10,
|
|
|
|
|
"fee_rate": 0.001,
|
|
|
|
|
"capacity": 100000
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"node_1": "032b480de5d002f1a8fd1fe1bbf0a0f1b07760f65f052e66d56f15d71097c01add",
|
|
|
|
|
"node_2": "036264734b40c9e91d3d990a8cdfbbe23b5b0b7ad3cd0e080a25dcd05d39eeb7eb",
|
2017-01-10 06:47:45 +03:00
|
|
|
"channel_id": 3495345,
|
routing: rewrite package to conform to BOLT07 and factor in fees+timelocks
This commit overhauls the routing package significantly to simplify the
code, conform to the rest of the coding style within the package, and
observe the new authenticated gossiping scheme outlined in BOLT07.
As a major step towards a more realistic path finding algorithm, fees
are properly calculated and observed during path finding. If a path has
sufficient capacity _before_ fees are applied, but afterwards the
finalized route would exceed the capacity of a single link, the route
is marked as invalid.
Currently a naive weighting algorithm is used which only factors in the
time-lock delta at each hop, thereby optimizing for the lowest time
lock. Fee calculation also isn’t finalized since we aren’t yet using
milli-satoshi throughout the daemon. The final TODO item within the PR
is to properly perform a multi-path search and rank the results based
on a summation heuristic rather than just return the first (out of
many) route found.
On the server side, once nodes are initially connected to the daemon,
our routing table will be synced with the peer’s using a naive “just
send everything scheme” to hold us over until I spec out some a
efficient graph reconciliation protocol. Additionally, the routing
table is now pruned by the channel router itself once new blocks arrive
rather than depending on peers to tell us when a channel flaps or is
closed.
Finally, the validation of peer announcements aren’t yet fully
implemented as they’ll be implemented within the pending discovery
package that was blocking on the completion of this package. Most off
the routing message processing will be moved out of this package and
into the discovery package where full validation will be carried out.
2016-12-27 08:20:26 +03:00
|
|
|
"channel_point": "9f155756b33a0a6827713965babbd561b55f9520444ac5db0cf7cb2eb0deb5bc:0",
|
|
|
|
|
"flags": 0,
|
|
|
|
|
"expiry": 1,
|
|
|
|
|
"min_htlc": 1,
|
|
|
|
|
"fee_base_msat": 10,
|
|
|
|
|
"fee_rate": 0.001,
|
|
|
|
|
"capacity": 500
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"node_1": "0367cec75158a4129177bfb8b269cb586efe93d751b43800d456485e81c2620ca6",
|
|
|
|
|
"node_2": "03c19f0027ffbb0ae0e14a4d958788793f9d74e107462473ec0c3891e4feb12e99",
|
2017-01-10 06:47:45 +03:00
|
|
|
"channel_id": 2340213491,
|
routing: rewrite package to conform to BOLT07 and factor in fees+timelocks
This commit overhauls the routing package significantly to simplify the
code, conform to the rest of the coding style within the package, and
observe the new authenticated gossiping scheme outlined in BOLT07.
As a major step towards a more realistic path finding algorithm, fees
are properly calculated and observed during path finding. If a path has
sufficient capacity _before_ fees are applied, but afterwards the
finalized route would exceed the capacity of a single link, the route
is marked as invalid.
Currently a naive weighting algorithm is used which only factors in the
time-lock delta at each hop, thereby optimizing for the lowest time
lock. Fee calculation also isn’t finalized since we aren’t yet using
milli-satoshi throughout the daemon. The final TODO item within the PR
is to properly perform a multi-path search and rank the results based
on a summation heuristic rather than just return the first (out of
many) route found.
On the server side, once nodes are initially connected to the daemon,
our routing table will be synced with the peer’s using a naive “just
send everything scheme” to hold us over until I spec out some a
efficient graph reconciliation protocol. Additionally, the routing
table is now pruned by the channel router itself once new blocks arrive
rather than depending on peers to tell us when a channel flaps or is
closed.
Finally, the validation of peer announcements aren’t yet fully
implemented as they’ll be implemented within the pending discovery
package that was blocking on the completion of this package. Most off
the routing message processing will be moved out of this package and
into the discovery package where full validation will be carried out.
2016-12-27 08:20:26 +03:00
|
|
|
"channel_point": "72cd6e8422c407fb6d098690f1130b7ded7ec2f7f5e1d30bd9d521f015363793:0",
|
|
|
|
|
"flags": 0,
|
|
|
|
|
"expiry": 1,
|
|
|
|
|
"min_htlc": 1,
|
|
|
|
|
"fee_base_msat": 10,
|
|
|
|
|
"fee_rate": 0.001,
|
|
|
|
|
"capacity": 10000
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"node_1": "0367cec75158a4129177bfb8b269cb586efe93d751b43800d456485e81c2620ca6",
|
|
|
|
|
"node_2": "02e7b1aaac10977c38e9c61c74dc66840de211bcec3021603e7977bc5e28edabfd",
|
2017-01-10 06:47:45 +03:00
|
|
|
"channel_id": 689530843,
|
routing: rewrite package to conform to BOLT07 and factor in fees+timelocks
This commit overhauls the routing package significantly to simplify the
code, conform to the rest of the coding style within the package, and
observe the new authenticated gossiping scheme outlined in BOLT07.
As a major step towards a more realistic path finding algorithm, fees
are properly calculated and observed during path finding. If a path has
sufficient capacity _before_ fees are applied, but afterwards the
finalized route would exceed the capacity of a single link, the route
is marked as invalid.
Currently a naive weighting algorithm is used which only factors in the
time-lock delta at each hop, thereby optimizing for the lowest time
lock. Fee calculation also isn’t finalized since we aren’t yet using
milli-satoshi throughout the daemon. The final TODO item within the PR
is to properly perform a multi-path search and rank the results based
on a summation heuristic rather than just return the first (out of
many) route found.
On the server side, once nodes are initially connected to the daemon,
our routing table will be synced with the peer’s using a naive “just
send everything scheme” to hold us over until I spec out some a
efficient graph reconciliation protocol. Additionally, the routing
table is now pruned by the channel router itself once new blocks arrive
rather than depending on peers to tell us when a channel flaps or is
closed.
Finally, the validation of peer announcements aren’t yet fully
implemented as they’ll be implemented within the pending discovery
package that was blocking on the completion of this package. Most off
the routing message processing will be moved out of this package and
into the discovery package where full validation will be carried out.
2016-12-27 08:20:26 +03:00
|
|
|
"channel_point": "25376aa6cb81913ad30416bd22d4083241bd6d68e811d0284d3c3a17795c458a:0",
|
|
|
|
|
"flags": 0,
|
|
|
|
|
"expiry": 1,
|
|
|
|
|
"min_htlc": 1,
|
|
|
|
|
"fee_base_msat": 10,
|
|
|
|
|
"fee_rate": 0.001,
|
|
|
|
|
"capacity": 100000
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
"node_1": "02e7b1aaac10977c38e9c61c74dc66840de211bcec3021603e7977bc5e28edabfd",
|
|
|
|
|
"node_2": "03c19f0027ffbb0ae0e14a4d958788793f9d74e107462473ec0c3891e4feb12e99",
|
2017-01-10 06:47:45 +03:00
|
|
|
"channel_id": 523452362,
|
routing: rewrite package to conform to BOLT07 and factor in fees+timelocks
This commit overhauls the routing package significantly to simplify the
code, conform to the rest of the coding style within the package, and
observe the new authenticated gossiping scheme outlined in BOLT07.
As a major step towards a more realistic path finding algorithm, fees
are properly calculated and observed during path finding. If a path has
sufficient capacity _before_ fees are applied, but afterwards the
finalized route would exceed the capacity of a single link, the route
is marked as invalid.
Currently a naive weighting algorithm is used which only factors in the
time-lock delta at each hop, thereby optimizing for the lowest time
lock. Fee calculation also isn’t finalized since we aren’t yet using
milli-satoshi throughout the daemon. The final TODO item within the PR
is to properly perform a multi-path search and rank the results based
on a summation heuristic rather than just return the first (out of
many) route found.
On the server side, once nodes are initially connected to the daemon,
our routing table will be synced with the peer’s using a naive “just
send everything scheme” to hold us over until I spec out some a
efficient graph reconciliation protocol. Additionally, the routing
table is now pruned by the channel router itself once new blocks arrive
rather than depending on peers to tell us when a channel flaps or is
closed.
Finally, the validation of peer announcements aren’t yet fully
implemented as they’ll be implemented within the pending discovery
package that was blocking on the completion of this package. Most off
the routing message processing will be moved out of this package and
into the discovery package where full validation will be carried out.
2016-12-27 08:20:26 +03:00
|
|
|
"channel_point": "704a5675c91b1c674309a6475fc51072c2913d6117ee6103c9f1b86956bcbe02:0",
|
|
|
|
|
"flags": 0,
|
|
|
|
|
"expiry": 1,
|
|
|
|
|
"min_htlc": 1,
|
|
|
|
|
"fee_base_msat": 10,
|
|
|
|
|
"fee_rate": 0.001,
|
|
|
|
|
"capacity": 50000
|
|
|
|
|
}
|
|
|
|
|
]
|
|
|
|
|
}
|