Actually there’s an idea sparking up on me.
When I was a junior programmer there were some business guys coming up with the requirement to implement their own validation language (similar to regex). I always thought it is totally stupid to invent your own instead of using something that already exists. But it turned out to be great fun implementing it. I had no prior knowledge in implementing parsers and interpreters. But man I was so proud after I came up with my own solution for the problem. It was such fun, that I even was doing over hours. At the end I create my own tokenizer, a parser and an interpreter. Even something similar to what I now know most people would call an AST (abstract syntax tree).
However, I know I have bought the Crafting Interpreters book without having read it. I really should start digging into it.
To maybe give you some ideas, have a look at SimpleX and the Nostr. I haven’t looked into it in detail yet, but at first glance these two seem to work similarly.