ATProto Browser

Record data

{
  "uri": "at://did:plc:l3rouwludahu3ui3bt66mfvj/app.bsky.feed.post/3lnl5xzmn522h",
  "cid": "bafyreiawp2eiukus3o572u4qbxzufuf7ecjijctuv2zhzoq3cbjyxdnyry",
  "value": {
    "text": "here's a little nugget on the structure of the merkle search tree (mst) at the heart of atproto repositories. first context: the mst is essentially a key-value store.\n\nnot often pointed out: its structure is fully determined by its keys and not its values. sometimes i like to think of it as a grid:",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.images",
      "images": [
        {
          "alt": "diagram of a simplified merkle search tree with three leaves. its keys/leaves are organized onto a grid:\n - keys lexically ordered left to right\n - keys ordered by leading 0s of hash bottom to top",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreigeflmz6v2butca4c272ezldd2qcohobyy6gqhn656dytgzs2awou"
            },
            "mimeType": "image/jpeg",
            "size": 146333
          },
          "aspectRatio": {
            "width": 874,
            "height": 674
          }
        }
      ]
    },
    "langs": [
      "en"
    ],
    "createdAt": "2025-04-24T16:48:16.250Z"
  }
}