Event JSON
{
"id": "5a3900b30ff7c246aec9fbadaa2cc1dc3cd301c53fc7ea5d1389f68101fc5d96",
"pubkey": "3ebe8ca6d34cec8262f34cbb3c026cadaa41b446efea7d7dcf09de2d337fc90a",
"created_at": 1719437978,
"kind": 1,
"tags": [
[
"p",
"3ebe8ca6d34cec8262f34cbb3c026cadaa41b446efea7d7dcf09de2d337fc90a"
],
[
"e",
"be43d3bfd8ba3fa37a25c5e2c8c40f35bb732e1234d2e633ead284e38fabd98b",
"",
"reply"
],
[
"e",
"f26b14004df098960fa5e0e4c0404967767736c3964ae5831675a6d01d005dbb",
"",
"root"
],
[
"proxy",
"https://floss.social/@alcinnz/112685087381158373",
"web"
],
[
"proxy",
"https://floss.social/users/alcinnz/statuses/112685087381158373",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://floss.social/users/alcinnz/statuses/112685087381158373",
"pink.momostr"
],
[
"expiration",
"1722029981"
]
],
"content": "To address this I'd let the Layout Coprocessor consult a shared lookup table, possibly with some tricks to utilize its binary-tree concurrency model. With some preprocessing we should be able to get those lookuptables down to a reasonable size!\n\nSimilarly we may lookup (stack-based) microcode from those lookuptables to aid implementing bytecode interpretors for programs frequently embedded in fonts.\n\nAnd we'll parse Binary Search Tries from the font to query.\n\n3/5?",
"sig": "208652988fb7f9c28ebd78b6345e9ca090ca25ae876cd5b23512fe1d2e7345c01f3bcce9ca5579fc200d7df1de3ca5bdbd6f6484436d1efb47dd85fe020216cc"
}