Matthew Green on Nostr: Making this work efficiently involves using the magic of Merkle hash trees. This ...
Making this work efficiently involves using the magic of Merkle hash trees. This allows anyone to verify that a single (key/identity) pair is contained within the tree, without downloading records for two billion other users, which would be annoying. /9
Published at
2023-04-13 15:50:00Event JSON
{
"id": "6cee2287a151099bbc9448eded51f9d91c8c32a6ecb0389fea70319bdc9e7409",
"pubkey": "5c06f588380197da5dfbe2e32928b9b6d82c62dac0c602535a09ee1cad5a8221",
"created_at": 1681401000,
"kind": 1,
"tags": [
[
"e",
"1639b2970d67d4ac7ce269915c4cb80fd94b89f602faa46115e84d6dd8a0f6d3",
"wss://relay.mostr.pub",
"reply"
],
[
"mostr",
"https://ioc.exchange/users/matthew_d_green/statuses/110192295965866422"
]
],
"content": "Making this work efficiently involves using the magic of Merkle hash trees. This allows anyone to verify that a single (key/identity) pair is contained within the tree, without downloading records for two billion other users, which would be annoying. /9",
"sig": "568767c5d2d405cff8f716e2fa4765368df1df1edce0c980b54becbfac6503142df7fd4ba6149b68edfdb12875805d96e909503018b339fdd186b48c05c2093a"
}
