Hello Kulpreet,
Thank you for the interest in our work!
wrt. 1.: You are correct, message complexity could be one of the main
challenges in the distributed case (~ O(n^3) in the asynchronous model,
according to Goldberg et al.). While this is clearly unfeasible to run for
every single
Hi Elias,
Thanks for the pointer to your excellent paper. I really enjoyed
reading the idea of using locked flows to allow for a distributed
execution for finding valid flows, which will enable discovering
routes for payments. Pretty neat idea indeed.
I just have few questions. My understanding
Hello Kulpreet,
thank you a lot for your work, your post highlights some really interesting
results.
I'm looking forward to your future work measuring the network's structure and
decentralization. Moreover, I find thinking about the LN as a flow network to
be a real interesting perspective.
Hi René,
Thanks for sharing the links to the issues and the excellent work you are doing.
I see that you are quite interested in helping autopilot create a
graph such that is provides certain characteristics. It is quite a
challenging task, and I admire your courage to take it on. I saw your
Hey Kulpreet,
thanks for this nice overview article! I have just today implemented a
first draft for the c-lightning autopilot [0]. I have implemented 4
heuristics to select nodes to which one could connect. On of those [1]
samples from the nodes that contribute to the high diameter. This
Hi all,
I have been thinking about how we could measure the centrality of
various nodes in the LN graph and the dependence on some nodes to
route payments and to prevent network partitions. I think measuring
and tracking the changes in key metrics could help the community
decide on which nodes to
