)]}'
{
  "commit": "6b1f563de53fcfc21f398c30952348cacb884fd9",
  "tree": "b5f268f3029c06aeb0e228564898cf89f395331e",
  "parents": [
    "f0eeff68bd9edb9759eaa715542b6583b9dfdfac"
  ],
  "author": {
    "name": "Kim Morrison",
    "email": "kim@tqft.net",
    "time": "Sun Jul 05 23:29:57 2026 +0000"
  },
  "committer": {
    "name": "Kim Morrison",
    "email": "kim@tqft.net",
    "time": "Sun Jul 05 23:29:57 2026 +0000"
  },
  "message": "doc: explain why byte arrays escape the LEAN_MAX_SMALL_NAT size bound\n\nByte arrays have 1-byte elements, so unlike pointer arrays their size is not\nbounded by LEAN_MAX_SMALL_NAT; the guard is therefore reachable on 32-bit systems.\n\nCo-Authored-By: Claude Opus 4.8 (1M context) \u003cnoreply@anthropic.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "e12b064b03c707cd6ae1043bc7c4117aabe48a74",
      "old_mode": 33188,
      "old_path": "src/runtime/object.cpp",
      "new_id": "80598a48ff7b06c16321d90361dbe8787f1a00eb",
      "new_mode": 33188,
      "new_path": "src/runtime/object.cpp"
    }
  ]
}
