Event JSON
{
"id": "a541d3ac78dd2b14945bf6430cc4377214c97516bc38966215de32259de16ce6",
"pubkey": "aa09578457c39ff1e7d7520e0082548a4e140a7cfc392587ed746d020940122d",
"created_at": 1700766813,
"kind": 1,
"tags": [
[
"p",
"4ebb1885240ebc43fff7e4ff71a4f4a1b75f4e296809b61932f10de3e34c026b",
"wss://relay.mostr.pub"
],
[
"p",
"8b0be93ed69c30e9a68159fd384fd8308ce4bbf16c39e840e0803dcb6c08720e",
"wss://relay.mostr.pub"
],
[
"e",
"e36e987be3a43fbd4fd26a487f58ac4edd3150771f6265a8ce8ac5411b1aa555",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://mastodon.social/users/dvogel/statuses/111461453883802455",
"activitypub"
]
],
"content": "nostr:npub1f6a33pfyp67y8llhunlhrf855xm47n3fdqymvxfj7yx78c6vqf4scxpnql I don't know of any existing libraries but it should be fairly straight forward to use the ast stdlib module to parse the input and then eval it only after ensuring the tree only contains your limited vocabulary.",
"sig": "2bacfc9615baa80b666cb7a590c28d6c475bd4bd9850ea58ae6f24c0ea428e28db8a62ffbdb6eda6932c2f036b760652a315ee49b7439498fed74334f63e977a"
}
