jb55 on Nostr: Minimal perfect hashtables are awesome. I use it in btcs (my bitcoin script ...
Minimal perfect hashtables are awesome. I use it in btcs (my bitcoin script interpreter) for mapping opcode names to the opcodes themselves when parsing. It works great when you have a fixed dictionary, like the words in a note. It also uses minimal space so we can pack it nicely within nostrdb as an optimized datastructure for checking if a note contains a word. #nerdstr
Sorry ill stop nerdposting now
researching a way to build a minimal perfect hashmap of words to store alongside the binary note in nostrdb so that nostrdb clients (damus ios, damus notedeck, zaptream rust) can do O(1) mute word matching, which is pretty important for performance when you have 100s of mute words.
Published at
2024-11-20 20:40:02Event JSON
{
"id": "9777d72fc88de1d8750ca54f600dc8296137f43028a2e1ce597634c7f14058ba",
"pubkey": "32e1827635450ebb3c5a7d12c1f8e7b2b514439ac10a67eef3d9fd9c5c68e245",
"created_at": 1732135202,
"kind": 1,
"tags": [
[
"p",
"32e1827635450ebb3c5a7d12c1f8e7b2b514439ac10a67eef3d9fd9c5c68e245"
],
[
"t",
"nerdstr"
],
[
"r",
"https://cdn.jb55.com/s/02fd7ed5300180c8.png"
]
],
"content": "Minimal perfect hashtables are awesome. I use it in btcs (my bitcoin script interpreter) for mapping opcode names to the opcodes themselves when parsing. It works great when you have a fixed dictionary, like the words in a note. It also uses minimal space so we can pack it nicely within nostrdb as an optimized datastructure for checking if a note contains a word. #nerdstr \n\nSorry ill stop nerdposting now\n\nhttps://cdn.jb55.com/s/02fd7ed5300180c8.png nostr:note1wr7pg65thhnk9r80w0j5a9j9t6aqupd62el0fydlpr4dnn25wuqqpjavy9",
"sig": "b93b30483b5de4c9eabd63429e75fe29e7354442fbd93f20256905e9ab5783264f524582be09604afea214562165086dbb542fcb20a8819210bdf70f12b1152f"
}
