serapath on Nostr: hmm... yeah, lookup would be slowish... but sending would not be impqcted once you ...
hmm... yeah, lookup would be slowish...
but sending would not be impqcted once you have the data and based on how often it changes you cpuld cash initial lookups.
also, you could speed it up by having each node store not just the next but multiple hops.. a small graph with the publishing node in the center, so you would need probably less lookups by always progressing multiple hops instead of just one hop.
they say the idea is also to give ppl the information so they can experiment with many routing algos i think.
Published at
2024-12-04 18:33:17Event JSON
{
"id": "0ca3fdf516895ace3e412d0bf413938191e0b1748cb4586c95ab243aad2fca5b",
"pubkey": "390a5738b56da18489cc672da7c2654904096b560ca5ec0581f87c9762f760dc",
"created_at": 1733337197,
"kind": 1,
"tags": [
[
"p",
"390a5738b56da18489cc672da7c2654904096b560ca5ec0581f87c9762f760dc"
],
[
"p",
"3bf0c63fcb93463407af97a5e5ee64fa883d107ef9e558472c4eb9aaaefa459d"
],
[
"e",
"00009df68301adf2bed8cd4ea7dd833b665e72264396f929d81cdd62af8ece8a",
"",
"root"
],
[
"e",
"000042ed88aa98b91cf5bf7cca5850fde1c008fce1f37efb629cad87b8b88930",
"",
"reply"
]
],
"content": "\nhmm... yeah, lookup would be slowish...\n\nbut sending would not be impqcted once you have the data and based on how often it changes you cpuld cash initial lookups.\n\nalso, you could speed it up by having each node store not just the next but multiple hops.. a small graph with the publishing node in the center, so you would need probably less lookups by always progressing multiple hops instead of just one hop.\n\nthey say the idea is also to give ppl the information so they can experiment with many routing algos i think.",
"sig": "796c2774f430b2a4eb301b88b5c6aaa6cad6f943836e6b464be9d75fa6be60a8719382d9a0b082508fe56542541cb42040dc69327733cae0bb83a1ba64c72736"
}