Mussum on Nostr: I like nr 4 the most, but has to be done in a way that doesn't download repeated ...
I like nr 4 the most, but has to be done in a way that doesn't download repeated data. Check with @doug from #strfry for that. He had a simple algorithm that that is O(ln n), where n is the difference from local set to global set.
For number, Matrix/Element does this out of the box. You can get inspiration there, as it's open source and has an SDK:
https://element.io/Published at
2023-06-24 19:49:14Event JSON
{
"id": "02c08ae5e7ee82bcd9fe99f34cf482214aaaeb26ab5c6cd7ca50f3589146b097",
"pubkey": "654bb94be48e4e6e712e4ccaa1d0f0bdab6cf640e6d76da0758e26d088993810",
"created_at": 1687636154,
"kind": 1,
"tags": [
[
"e",
"7bd397d6ab72528ed7ba7ede8eec8d184e754c674af19b52d5f73231bdb297dd",
"",
"reply"
],
[
"p",
"460c25e682fda7832b52d1f22d3d22b3176d972f60dcdc3212ed8c92ef85065c"
],
[
"t",
"strfry"
],
[
"t",
"strfry"
],
[
"r",
"https://element.io/"
]
],
"content": "I like nr 4 the most, but has to be done in a way that doesn't download repeated data. Check with @doug from #strfry for that. He had a simple algorithm that that is O(ln n), where n is the difference from local set to global set.\n\nFor number, Matrix/Element does this out of the box. You can get inspiration there, as it's open source and has an SDK: https://element.io/",
"sig": "1916fc13e854674b8580c84567d3011521c0fb8675a598137ebda4e4887f9de8a4abe53f9daf63a8721e1f930a229ca6ebc561429da21eee55fe07b44eb4f28a"
}
