)]}'
{
  "commit": "0d1c19d63380edc768fe4b91fde84b24b1921752",
  "tree": "9c049f921c77d7ee52fee2fb666da7d601c0087e",
  "parents": [
    "30466c94c272d8fd0fff0f39d37153bcc4b779fc"
  ],
  "author": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Thu Oct 22 04:50:05 2026 +0000"
  },
  "committer": {
    "name": "Leonardo de Moura",
    "email": "leomoura@amazon.com",
    "time": "Thu Oct 22 04:50:05 2026 +0000"
  },
  "message": "fix: stale congruence root after merging equivalence classes in `grind`\n\nThis PR fixes a `grind.debug` invariant violation in `checkEqc` on goals such as `(p \u0026\u0026 p \u0026\u0026 q) \u003d (p \u0026\u0026 q)`.\n\nWhen `addEqStep` merges two equivalence classes, it writes back the node of the new root using a copy taken before the merge. If the new root is also a parent of the old root, `reinsertParents` may update its `congr` field during the merge, and the write-back reverted this update. In the example, merging `p \u003d false ∨ q \u003d false` with `q \u003d false` makes it congruent to `p \u003d false ∨ (p \u003d false ∨ q \u003d false)`, but its `congr` field kept pointing to itself, so the congruence table and the node disagreed. The root node is now retrieved again before it is updated, as was already done for the old root.\n\nCloses #15871\n\nCo-Authored-By: Claude Opus 5.5 \u003cnoreply@anthropic.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "826501269e9b2310f4ed09e126223ba2f7999b94",
      "old_mode": 33188,
      "old_path": "src/Lean/Meta/Tactic/Grind/Core.lean",
      "new_id": "b63bd5474f18b02d351716aa7efa094ad7883e89",
      "new_mode": 33188,
      "new_path": "src/Lean/Meta/Tactic/Grind/Core.lean"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "29c9627ca9a8948e04b85daf3153934b3ca1a161",
      "new_mode": 33188,
      "new_path": "tests/elab/grind_15871.lean"
    }
  ]
}
