The ruleset I desire is (no AUTH requried):
READ:
* Allow whitelisted people to read everything
* Allow everybody to read events by whitelisted people
* Allow everybody to read all 10002 events
* Deny the rest
WRITE:
* Allow whitelisted people to write anything
* Allow everybody to write events where a whitelisted person is tagged [they won't be able to read them back, and that is very important]
* Allow everybody to write any 10002 event
* Deny the rest
I started work on a relay that uses similar ideas to yours but it is very early days. Events are appended to a mmapped file where readers are not blocked during writes (except during resize). Indices use concurrent lock-free kv system optimized for SSDs (rust package "sled") whose interface is like a BTree map between two binary blobs. I'm keying them with things like (pubkey,created_at) pairs so that I can handle since/until quickly. The value is just the offset in the mmapped events file. I'm using a form of serialization (called "speedy") that (at least in rust) performs faster than flatmaps (that may not count when switching languages). Incoming events go through slower processing to canonicalize their encoding and validate their ID and signature. Outgoing reads should be pretty close to as-fast-as-possible. All asynchronous to keep all the cores busy whenever there is work to be done.
mikedilger /
npub1acg…p35c
2023-05-07 02:09:01
in reply to nevent1q…msjn
Author Public Key
npub1acg6thl5psv62405rljzkj8spesceyfz2c32udakc2ak0dmvfeyse9p35cPublished at
2023-05-07 02:09:01Event JSON
{
"id": "00000793a2664c2cd24e166f9bcebe610f189318df36b1121cdefd3b751a7cf8",
"pubkey": "ee11a5dff40c19a555f41fe42b48f00e618c91225622ae37b6c2bb67b76c4e49",
"created_at": 1683418141,
"kind": 1,
"tags": [
[
"client",
"gossip"
],
[
"p",
"218238431393959d6c8617a3bd899303a96609b44a644e973891038a7de8622d"
],
[
"p",
"0c99877612291bd818b3dd92f2852b823557b3744c3cb10470865c7a56a4929b"
],
[
"p",
"79c2cae114ea28a981e7559b4fe7854a473521a8d22a66bbab9fa248eb820ff6"
],
[
"p",
"2d5b6404df532de082d9e77f7f4257a6f43fb79bb9de8dd3ac7df5e6d4b500b0"
],
[
"p",
"1bc70a0148b3f316da33fe3c89f23e3e71ac4ff998027ec712b905cd24f6a411"
],
[
"e",
"f70d6db9005ce00a8abf314caa16463c8b1b0b2cc1fe8ecebc144d1823a0bd74",
"wss://nos.lol/",
"root"
],
[
"e",
"a14dca9565ce6eecd626aedf67f16d0cc65dd116352d1aa2846f4168811331e6",
"wss://nostr-pub.wellorder.net/",
"reply"
],
[
"nonce",
"6917529027641129319",
"20"
]
],
"content": "The ruleset I desire is (no AUTH requried):\nREAD:\n * Allow whitelisted people to read everything\n * Allow everybody to read events by whitelisted people\n * Allow everybody to read all 10002 events\n * Deny the rest\nWRITE:\n * Allow whitelisted people to write anything\n * Allow everybody to write events where a whitelisted person is tagged [they won't be able to read them back, and that is very important]\n * Allow everybody to write any 10002 event\n * Deny the rest\n\nI started work on a relay that uses similar ideas to yours but it is very early days. Events are appended to a mmapped file where readers are not blocked during writes (except during resize). Indices use concurrent lock-free kv system optimized for SSDs (rust package \"sled\") whose interface is like a BTree map between two binary blobs. I'm keying them with things like (pubkey,created_at) pairs so that I can handle since/until quickly. The value is just the offset in the mmapped events file. I'm using a form of serialization (called \"speedy\") that (at least in rust) performs faster than flatmaps (that may not count when switching languages). Incoming events go through slower processing to canonicalize their encoding and validate their ID and signature. Outgoing reads should be pretty close to as-fast-as-possible. All asynchronous to keep all the cores busy whenever there is work to be done.",
"sig": "63753f7d420ade5be603191b03ce78c88af3685efff9c907cca718c08f19092e90a302009c567f3599ceb9014025a7c8bc54f6636d4c2c7fad4bb44ff5ac5196"
}