Pierre [ARCHIVE] on Nostr: đ
Original date posted:2016-09-21 đ Original message: > Excellent work!! ...
đ
Original date posted:2016-09-21
đ Original message:
> Excellent work!!
Thanks!
> In reality we envisioned that a DHT would acts as a substitute for a pure
> broadcast network, rather than to allow individual nodes to communicate with
> each other. At the time of the writing of the paper, we envisioned that
> information such as the current onion key for each node, identity keys,
> channel proofs, etc would potentially be stored within a DHT.
Got it, that makes sense. The reference to ip adress was confusing I guess.
> For communications, we referenced that something akin to HORNET could be
> used to allow nodes to communicate with each other [...]
> HORNET was especially attractive as as after its setup phase, there exists a
> bi-directional communication link between two nodes.
Yes I remember you mentioned HORNET on this ml some time ago. I am not too
familiar with it, but I think it operates at the network layer, right? I am
curious how you envision the relation between this layer and the application
layer: would an application-level link (LN channel) be *equal* to a
network-level
link (whatever link there is between two adjacent HORNET nodes if there is such
a thing)? Or would that be completely orthogonal, meaning if A and B
have a channel
open an htlc going from A to B could have to be routed through other nodes?
Does this question make sense?
> Additionally with
> HORNET, the backwards route can be distinct from the forwards route.
That is an amazing feature, kind of magical really!
> As a substitute for the first
> use-case (request/response) the latest design of our Sphinx construction
> could be used, with the requesting node providing the backwards path within
> the e2e payload. It's worth noting that this substitute reveals the entire
> path to the responding node
Yes, that's what we did, it does leak information but we are not sure how bad
that really is.
> Was the capacity of the channels created uniform? Or were the channel values
> uniformly distributed? Or perhaps drawn from a particular distribution?
> Similar to the question above, how were the satoshis requested within the<
> "payment request" distributed?
Well it didn't matter in this particular test, because as you pointed out we
didn't look at channel values (that's what we meant by 'static ranking' and
'undirected graph'). So it could have been anything.
Channel capacities, current values and fees will be key parameters of a future
'dynamic ranking' test, but we didn't think too much about it yet. Maybe normal
distributions? If you have already researched the subject or have any insights
please let us know :-)
Cheers,
Pierre
Published at
2023-06-09 12:46:46Event JSON
{
"id": "7cbf8cc7e00999c23cdeab17ebdf3893717691e6d793c56b7e965b9e6694b3ec",
"pubkey": "208e7a4699791a0264a0298ffa60456c51ac8d8992096a1b67389965eccc82ff",
"created_at": 1686314806,
"kind": 1,
"tags": [
[
"e",
"8f776e5085bba3ab2c3e0ebda5d60a0118ae665c6f90b43fa618b3053819241b",
"",
"root"
],
[
"e",
"9b65ebdab9098042ad0d94d39028e0d44b85d099f324c9efa990471b8bd3e31e",
"",
"reply"
],
[
"p",
"2df3fc2660459521b852c995d4fc1a93938389a5e085677d0ebb33ef92cc5476"
]
],
"content": "đ
Original date posted:2016-09-21\nđ Original message:\n\u003e Excellent work!!\nThanks!\n\n\u003e In reality we envisioned that a DHT would acts as a substitute for a pure\n\u003e broadcast network, rather than to allow individual nodes to communicate with\n\u003e each other. At the time of the writing of the paper, we envisioned that\n\u003e information such as the current onion key for each node, identity keys,\n\u003e channel proofs, etc would potentially be stored within a DHT.\nGot it, that makes sense. The reference to ip adress was confusing I guess.\n\n\u003e For communications, we referenced that something akin to HORNET could be\n\u003e used to allow nodes to communicate with each other [...]\n\u003e HORNET was especially attractive as as after its setup phase, there exists a\n\u003e bi-directional communication link between two nodes.\nYes I remember you mentioned HORNET on this ml some time ago. I am not too\nfamiliar with it, but I think it operates at the network layer, right? I am\ncurious how you envision the relation between this layer and the application\nlayer: would an application-level link (LN channel) be *equal* to a\nnetwork-level\nlink (whatever link there is between two adjacent HORNET nodes if there is such\na thing)? Or would that be completely orthogonal, meaning if A and B\nhave a channel\nopen an htlc going from A to B could have to be routed through other nodes?\nDoes this question make sense?\n\n\u003e Additionally with\n\u003e HORNET, the backwards route can be distinct from the forwards route.\nThat is an amazing feature, kind of magical really!\n\n\u003e As a substitute for the first\n\u003e use-case (request/response) the latest design of our Sphinx construction\n\u003e could be used, with the requesting node providing the backwards path within\n\u003e the e2e payload. It's worth noting that this substitute reveals the entire\n\u003e path to the responding node\nYes, that's what we did, it does leak information but we are not sure how bad\nthat really is.\n\n\n\u003e Was the capacity of the channels created uniform? Or were the channel values\n\u003e uniformly distributed? Or perhaps drawn from a particular distribution?\n\u003e Similar to the question above, how were the satoshis requested within the\u003c\n\u003e \"payment request\" distributed?\nWell it didn't matter in this particular test, because as you pointed out we\ndidn't look at channel values (that's what we meant by 'static ranking' and\n'undirected graph'). So it could have been anything.\nChannel capacities, current values and fees will be key parameters of a future\n'dynamic ranking' test, but we didn't think too much about it yet. Maybe normal\ndistributions? If you have already researched the subject or have any insights\nplease let us know :-)\n\nCheers,\n\nPierre",
"sig": "7490e358865489fb43bf1e72c3c452e6b1510f701d95e05148183e96ee6f41db038f09d013e9790fb93d920a1c259c5a61563a3d4666d8dd7273e1369726c8cd"
}