ATProto Browser

Record data

{
  "uri": "at://did:plc:6js2wkpi7qaa6f6shm24xezd/app.bsky.feed.post/3lohktugrac2l",
  "cid": "bafyreiho6i4rmi7ow4mb5lr2oii7g42mzknblrq7unn44klcpdfwnsdvnq",
  "value": {
    "text": "Fun fact about One Million Chessboards - I did it in one process entirely because 9 months ago a Hacker News commenter pointed out that I should have used one process for One Million Checkboxes\n\nworking on my writeup now, lmk if you have specific Qs!",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.images",
      "images": [
        {
          "alt": "Sorry, I'm talking hypothetically about how this would be designed, not in the context of your specific timeframe!\n> \"is my specialized datastore gonna be faster than Redis\"\n\nAbsolutely! With how efficient this code would be, you'd likely never need to scale horizontally, and in that case it is extremely easy to compete with a network hop (at least 1ms latency) versus L1 cache (<50ns)\n\nThe comparison with redis otherwise only applies once you do need to scale horizontally.\n\nThere's also the fact that redis must be designed to support any query pattern efficiently; a much harder problem then supporting just 1-2 queries efficiently.",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreiamj3xggr44c6ytqa3jtnazew4a45gw2ablixjiixnn3ugbsgfryq"
            },
            "mimeType": "image/jpeg",
            "size": 214298
          },
          "aspectRatio": {
            "width": 1200,
            "height": 419
          }
        }
      ]
    },
    "langs": [
      "en"
    ],
    "createdAt": "2025-05-05T23:53:07.914Z"
  }
}