Rusty Russell [ARCHIVE] on Nostr: 📅 Original date posted:2015-07-02 📝 Original message: Kevin Greene <kgreenek at ...
📅 Original date posted:2015-07-02
📝 Original message:
Kevin Greene <kgreenek at gmail.com> writes:
> On Wed, Jul 1, 2015 at 3:35 PM, Nick ODell <nickodell at gmail.com> wrote:
> Yeah. Also, how will A know what nodes B is connected to? B could
> advertise its connected peers ala BGP AS-Paths.
>
> Speaking of which, how does routing work in the lightening network? Forgive
> me if that's already documented somewhere. Is that designed already?
Nope, but it's worth its own thread. Let me start that now :)
Thanks,
Rusty.
📝 Original message:
Kevin Greene <kgreenek at gmail.com> writes:
> On Wed, Jul 1, 2015 at 3:35 PM, Nick ODell <nickodell at gmail.com> wrote:
> Yeah. Also, how will A know what nodes B is connected to? B could
> advertise its connected peers ala BGP AS-Paths.
>
> Speaking of which, how does routing work in the lightening network? Forgive
> me if that's already documented somewhere. Is that designed already?
Nope, but it's worth its own thread. Let me start that now :)
Thanks,
Rusty.