)]}'
{
  "commit": "3248c46c053ec08768d2fbf5bd7bbc1c603b1886",
  "tree": "e0ba2a78c4807afef8622c69efdfbe561a402d9a",
  "parents": [
    "73639eff907a94865edaafa02a94b274dec20769"
  ],
  "author": {
    "name": "Kim Morrison",
    "email": "kim@tqft.net",
    "time": "Tue Feb 10 23:26:43 2026 +0000"
  },
  "committer": {
    "name": "Kim Morrison",
    "email": "kim@tqft.net",
    "time": "Tue Feb 10 23:26:43 2026 +0000"
  },
  "message": "fix: revert ensureInternalized to preprocessLight\n\nFull preprocessing (via preprocessAndInternalize) runs simp, which can\nnormalize terms into forms that break congruence closure. For example,\n`i \u003c (a :: l).length` becomes `i + 1 ≤ (a :: l).length`, preventing CC\nfrom proving equality with `0 \u003c (a :: l).length` when `i` and `0` are\nin the same equivalence class. This caused 6 test failures.\n\nCo-Authored-By: Claude Opus 4.6 \u003cnoreply@anthropic.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "06a471acc8f30c60347c7502c98ada1f9bc72988",
      "old_mode": 33188,
      "old_path": "src/Lean/Meta/Tactic/Grind/ProveEq.lean",
      "new_id": "ea2f38e000f60bf79f41ff7765c3465f3d572ebd",
      "new_mode": 33188,
      "new_path": "src/Lean/Meta/Tactic/Grind/ProveEq.lean"
    }
  ]
}
