mikedilger on Nostr: In principle I can see the merit. But in practice I see problems. Sending huge ...
In principle I can see the merit. But in practice I see problems. Sending huge numbers of IDs to exclude is itself expensive. Bloom filters aren't precise. Negentropy (the other solution often suggested) requires potentially a lot of round trips. There are possibly other solutions like getting all the IDs first and then asking for only some of those events. Also 256-bit IDs are cryptographically unique but we don't need cryptographic uniqueness for this avoid-double-event problem, just practical uniqueness, so using the first 64 bits of an ID to make it shorter is a reasonable optimization to whichever solution arises as the best.
I haven't heard anybody make an argument that compares the options and concludes as to which option is superior, so we are still in an exploratory stage as to this issue. But I don't deny the problem.
Published at
2024-07-23 23:03:49Event JSON
{
"id": "50259bcb177fb51b6568e0ab7b1983703fc15775cff541353aeec304886efd10",
"pubkey": "ee11a5dff40c19a555f41fe42b48f00e618c91225622ae37b6c2bb67b76c4e49",
"created_at": 1721775829,
"kind": 1,
"tags": [
[
"p",
"4c800257a588a82849d049817c2bdaad984b25a45ad9f6dad66e47d3b47e3b2f"
],
[
"p",
"460c25e682fda7832b52d1f22d3d22b3176d972f60dcdc3212ed8c92ef85065c"
],
[
"p",
"7cc328a08ddb2afdf9f9be77beff4c83489ff979721827d628a542f32a247c0e"
],
[
"e",
"00000656ae7de86281d87bfbf9ad69b3eaf436059576fc01b527213f82020d7f",
"wss://nos.lol/",
"root"
],
[
"e",
"25da997bbbb8b90104ca20e86536e3313eb9055384aaa92a7608cb95c41f5b30",
"wss://a.nos.lol/",
"reply"
]
],
"content": "In principle I can see the merit. But in practice I see problems. Sending huge numbers of IDs to exclude is itself expensive. Bloom filters aren't precise. Negentropy (the other solution often suggested) requires potentially a lot of round trips. There are possibly other solutions like getting all the IDs first and then asking for only some of those events. Also 256-bit IDs are cryptographically unique but we don't need cryptographic uniqueness for this avoid-double-event problem, just practical uniqueness, so using the first 64 bits of an ID to make it shorter is a reasonable optimization to whichever solution arises as the best.\n\nI haven't heard anybody make an argument that compares the options and concludes as to which option is superior, so we are still in an exploratory stage as to this issue. But I don't deny the problem.",
"sig": "4f24992ba7f0207d49d25e5be359a50ea816f928a09dd9de66dd185be834823e899d5b70df2bdff623b01810dcb0c5c4a2cb572762ab9e3c12f77a5d550988e7"
}