{
 "generated": "2026-11-19",
 "note": "Assembled by research/the-footprint-moved/build-data.mjs from the measurements beside it.",
 "summary": {
  "files": 26,
  "releases": [
   "4.31.0",
   "4.32.0",
   "4.33.0",
   "4.34.0",
   "4.35.0",
   "4.36.0"
  ],
  "compileFailures436Before": [
   "CrystallographicRestriction.lean",
   "Langford.lean"
  ],
  "compileFailures436Now": [],
  "choiceFiles436Before": [
   "CheckDigits.lean",
   "FifteenPuzzle.lean",
   "PerfectShuffle.lean"
  ],
  "choiceTheorems436Before": 8,
  "choiceTheorems436Now": 0,
  "theoremsPrinted436Now": 435,
  "everyReleaseNow": true,
  "repaired": [
   "CheckDigits.lean",
   "CrystallographicRestriction.lean",
   "FifteenPuzzle.lean",
   "Langford.lean",
   "PerfectShuffle.lean"
  ],
  "recipes": 25,
  "recipesPinned": [
   "crystallographic-restriction"
  ],
  "recipesPrintingChoice": [
   "check-digits",
   "eight-perfect-shuffles",
   "fifteen-puzzle",
   "langford"
  ],
  "recipesFailing": [
   "langford"
  ],
  "recipesAfter": 25,
  "recipesAfterFailing": [],
  "recipesAfterPrintingChoice": [],
  "recipesAfterReleases": {
   "4.33.0": 1,
   "4.36.0": 24
  },
  "corrected": 13,
  "noted": 20,
  "groups": 4
 },
 "rows": [
  {
   "file": "research/bayes-theorem/lean/Bayes.lean",
   "name": "Bayes.lean",
   "home": "bayes-theorem",
   "title": "The Positive Test That's Probably Wrong",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/the-missing-square/lean/Cassini.lean",
   "name": "Cassini.lean",
   "home": "the-missing-square",
   "title": "The Missing Square",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/check-digits/lean/CheckDigits.lean",
   "name": "CheckDigits.lean",
   "home": "check-digits",
   "title": "The Digit That Guards the Rest",
   "repaired": true,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 2,
     "sorry": 0,
     "none": 2,
     "choiceNames": [
      "CheckDigits.isbn_swap_ne",
      "CheckDigits.isbn_transposition_detects"
     ]
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 30,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": "4.36.0"
  },
  {
   "file": "research/labeled-chip-firing/lean/ChipFiring.lean",
   "name": "ChipFiring.lean",
   "home": "the-pile-that-sorts-itself",
   "title": "The Pile That Sorts Itself",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/crystallographic-restriction/lean/CrystallographicRestriction.lean",
   "name": "CrystallographicRestriction.lean",
   "home": "seventeen-and-no-more",
   "title": "Seventeen and No More",
   "repaired": true,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": false,
     "firstError": "248:38: error(lean.unknownIdentifier): Unknown identifier `ht`",
     "theorems": 16,
     "choice": 0,
     "sorry": 4,
     "none": 5,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": false,
     "firstError": "248:38: error(lean.unknownIdentifier): Unknown identifier `ht`",
     "theorems": 16,
     "choice": 0,
     "sorry": 4,
     "none": 5,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 16,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    }
   },
   "firstBroken": "4.35.0",
   "firstChoice": null
  },
  {
   "file": "research/the-dimension-that-buys-nothing/lean/DimensionParity.lean",
   "name": "DimensionParity.lean",
   "home": "the-dimension-that-buys-nothing",
   "title": "The Dimension That Buys Nothing",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 214,
     "choice": 0,
     "sorry": 0,
     "none": 8,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/proof-poem-seven-modes/lean/Euclid.lean",
   "name": "Euclid.lean",
   "home": "proof-poem-seven-modes",
   "title": "Proof / Poem: Euclid's Infinitude of Primes in Seven Modes",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/fifteen-puzzle/lean/FifteenPuzzle.lean",
   "name": "FifteenPuzzle.lean",
   "home": "the-half-you-can-never-reach",
   "title": "The Half You Can Never Reach",
   "repaired": true,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 1,
     "sorry": 0,
     "none": 0,
     "choiceNames": [
      "FP.loyd_unreachable"
     ]
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": "4.36.0"
  },
  {
   "file": "research/finite-gap/lean/FiniteGap.lean",
   "name": "FiniteGap.lean",
   "home": "does-point-nine-equal-one",
   "title": "The Number With No Room Beneath It",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 20,
     "choice": 0,
     "sorry": 0,
     "none": 1,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/graceful-census/lean/Graceful.lean",
   "name": "Graceful.lean",
   "home": "every-difference-once",
   "title": "Every Difference, Once",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/langford/lean/Langford.lean",
   "name": "Langford.lean",
   "home": "langford-pairings",
   "title": "The Arrangement You Can't Always Make",
   "repaired": true,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": false,
     "firstError": "77:2: error: Tactic `split` failed: Could not split an `if` or `match` expression in the goal",
     "theorems": 4,
     "choice": 0,
     "sorry": 4,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": false,
     "firstError": "77:2: error: Tactic `split` failed: Could not split an `if` or `match` expression in the goal",
     "theorems": 4,
     "choice": 0,
     "sorry": 4,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": false,
     "firstError": "77:2: error: Tactic `split` failed: Could not split an `if` or `match` expression in the goal",
     "theorems": 4,
     "choice": 0,
     "sorry": 4,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": false,
     "firstError": "77:2: error: Tactic `split` failed: Could not split an `if` or `match` expression in the goal",
     "theorems": 4,
     "choice": 1,
     "sorry": 4,
     "none": 0,
     "choiceNames": [
      "Langford.nickerson_necessity"
     ]
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 4,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": "4.33.0",
   "firstChoice": null
  },
  {
   "file": "research/mcnugget/lean/McNugget.lean",
   "name": "McNugget.lean",
   "home": "the-mcnugget-number",
   "title": "The McNugget Number",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/monty-hall/lean/MontyHall.lean",
   "name": "MontyHall.lean",
   "home": "monty-hall",
   "title": "The Door You Didn't Pick",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 5,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/the-mutilated-chessboard/lean/MutilatedChessboard.lean",
   "name": "MutilatedChessboard.lean",
   "home": "the-mutilated-chessboard",
   "title": "The Mutilated Chessboard",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 1,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/nim/lean/Nim.lean",
   "name": "Nim.lean",
   "home": "the-strategy-that-counts-in-binary",
   "title": "The Strategy That Counts in Binary",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/the-comma/lean/NthRootTwo.lean",
   "name": "NthRootTwo.lean",
   "home": "the-comma",
   "title": "The Comma",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/eight-perfect-shuffles/lean/PerfectShuffle.lean",
   "name": "PerfectShuffle.lean",
   "home": "eight-perfect-shuffles",
   "title": "Eight Perfect Shuffles",
   "repaired": true,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 5,
     "sorry": 0,
     "none": 4,
     "choiceNames": [
      "PerfectShuffle.valFrom_bits",
      "PerfectShuffle.elmsley",
      "PerfectShuffle.deck52_steer_all",
      "PerfectShuffle.elmsley_unique",
      "PerfectShuffle.deck52_unique"
     ]
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 42,
     "choice": 0,
     "sorry": 0,
     "none": 4,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": "4.36.0"
  },
  {
   "file": "research/printed-interval/lean/PrintedFigure.lean",
   "name": "PrintedFigure.lean",
   "home": "the-room-inside-a-number",
   "title": "The Room Inside a Number",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/hyperbolic-tiling/lean/SchlafliTrichotomy.lean",
   "name": "SchlafliTrichotomy.lean",
   "home": "the-floor-that-wont-lie-flat",
   "title": "The Floor That Won't Lie Flat",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 13,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/siteswap/lean/Siteswap.lean",
   "name": "Siteswap.lean",
   "home": "siteswap",
   "title": "What the Juggler Is Counting",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 6,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/incommensurable-immersive/lean/Sqrt2.lean",
   "name": "Sqrt2.lean",
   "home": "incommensurable",
   "title": "Incommensurable",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 3,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/which-roots-are-irrational/lean/SqrtN.lean",
   "name": "SqrtN.lean",
   "home": "which-roots-are-irrational",
   "title": "Which Square Roots Are Irrational?",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 7,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/the-comma/lean/TheComma.lean",
   "name": "TheComma.lean",
   "home": "the-comma",
   "title": "The Comma",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/three-mountains-leave-forty-two/lean/ThreeCubes.lean",
   "name": "ThreeCubes.lean",
   "home": "three-mountains-leave-forty-two",
   "title": "Three Mountains Leave Forty-Two",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 2,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/weaving-drafts/lean/WeavingDraft.lean",
   "name": "WeavingDraft.lean",
   "home": "two-threads-that-never-disagree",
   "title": "Two Threads That Never Disagree",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 8,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  },
  {
   "file": "research/sorting-networks/lean/ZeroOnePrinciple.lean",
   "name": "ZeroOnePrinciple.lean",
   "home": "two-symbols-are-enough",
   "title": "Two Symbols Are Enough",
   "repaired": false,
   "before": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "now": {
    "4.31.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.32.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.33.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.34.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.35.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    },
    "4.36.0": {
     "compiles": true,
     "firstError": null,
     "theorems": 5,
     "choice": 0,
     "sorry": 0,
     "none": 0,
     "choiceNames": []
    }
   },
   "firstBroken": null,
   "firstChoice": null
  }
 ],
 "drift": [
  {
   "release": "4.31.0",
   "instance": "Nat.instLawfulBEq",
   "footprint": "[propext, Quot.sound]"
  },
  {
   "release": "4.32.0",
   "instance": "Nat.instLawfulBEq",
   "footprint": "[propext, Quot.sound]"
  },
  {
   "release": "4.33.0",
   "instance": "Nat.instLawfulBEq",
   "footprint": "[propext, Quot.sound]"
  },
  {
   "release": "4.34.0",
   "instance": "Nat.instLawfulBEq",
   "footprint": "[propext, Quot.sound]"
  },
  {
   "release": "4.35.0",
   "instance": "Nat.instLawfulBEq",
   "footprint": "[propext, Quot.sound]"
  },
  {
   "release": "4.36.0",
   "instance": "Std.LawfulBEqOrd.lawfulBEq",
   "footprint": "[propext, Classical.choice, Quot.sound]"
  }
 ],
 "recipes": [
  {
   "slug": "bayes-theorem",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 18,
   "after": {
    "slug": "bayes-theorem",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 5
   }
  },
  {
   "slug": "check-digits",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 4,
   "withSorry": 0,
   "secs": 48,
   "after": {
    "slug": "check-digits",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 25
   }
  },
  {
   "slug": "crystallographic-restriction",
   "exit": 0,
   "lean": "4.33.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 24,
   "after": {
    "slug": "crystallographic-restriction",
    "exit": 0,
    "lean": "4.33.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 11
   }
  },
  {
   "slug": "eight-perfect-shuffles",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 10,
   "withSorry": 0,
   "secs": 13,
   "after": {
    "slug": "eight-perfect-shuffles",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 6
   }
  },
  {
   "slug": "fifteen-puzzle",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 2,
   "withSorry": 0,
   "secs": 9,
   "after": {
    "slug": "fifteen-puzzle",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 2
   }
  },
  {
   "slug": "finite-gap",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 6,
   "after": {
    "slug": "finite-gap",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  },
  {
   "slug": "graceful-census",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 9,
   "after": {
    "slug": "graceful-census",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 3
   }
  },
  {
   "slug": "hyperbolic-tiling",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 11,
   "after": {
    "slug": "hyperbolic-tiling",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 2
   }
  },
  {
   "slug": "incommensurable-immersive",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 7,
   "after": {
    "slug": "incommensurable-immersive",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  },
  {
   "slug": "labeled-chip-firing",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 202,
   "after": {
    "slug": "labeled-chip-firing",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 145
   }
  },
  {
   "slug": "langford",
   "exit": 1,
   "lean": "4.36.0",
   "errors": 3,
   "withChoice": 1,
   "withSorry": 4,
   "secs": 2,
   "after": {
    "slug": "langford",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 3
   }
  },
  {
   "slug": "mcnugget",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 6,
   "after": {
    "slug": "mcnugget",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 4
   }
  },
  {
   "slug": "monty-hall",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 4,
   "after": {
    "slug": "monty-hall",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 2
   }
  },
  {
   "slug": "nim",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 3,
   "after": {
    "slug": "nim",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  },
  {
   "slug": "printed-interval",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 2,
   "after": {
    "slug": "printed-interval",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 0
   }
  },
  {
   "slug": "proof-poem-seven-modes",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 3,
   "after": {
    "slug": "proof-poem-seven-modes",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 2
   }
  },
  {
   "slug": "siteswap",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 3,
   "after": {
    "slug": "siteswap",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  },
  {
   "slug": "sorting-networks",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 42,
   "after": {
    "slug": "sorting-networks",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 46
   }
  },
  {
   "slug": "the-comma",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 6,
   "after": {
    "slug": "the-comma",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 2
   }
  },
  {
   "slug": "the-dimension-that-buys-nothing",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 347,
   "after": {
    "slug": "the-dimension-that-buys-nothing",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 183
   }
  },
  {
   "slug": "the-missing-square",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 5,
   "after": {
    "slug": "the-missing-square",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  },
  {
   "slug": "the-mutilated-chessboard",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 3,
   "after": {
    "slug": "the-mutilated-chessboard",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 2
   }
  },
  {
   "slug": "three-mountains-leave-forty-two",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 7,
   "after": {
    "slug": "three-mountains-leave-forty-two",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  },
  {
   "slug": "weaving-drafts",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 8,
   "after": {
    "slug": "weaving-drafts",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 3
   }
  },
  {
   "slug": "which-roots-are-irrational",
   "exit": 0,
   "lean": "4.36.0",
   "errors": 0,
   "withChoice": 0,
   "withSorry": 0,
   "secs": 3,
   "after": {
    "slug": "which-roots-are-irrational",
    "exit": 0,
    "lean": "4.36.0",
    "errors": 0,
    "withChoice": 0,
    "withSorry": 0,
    "secs": 1
   }
  }
 ],
 "kernels": {
  "note": "Written by research/the-footprint-moved/kernels.mjs from the logs of one run of check-all.sh. Every verdict is the line the kernel printed.",
  "recipe": "research/the-footprint-moved/check-all.sh",
  "recipeSha256": "94528e63028833bdd770334d30d1fb3389ebc691e210bb4c67bbd31f8c848262",
  "recipeIsCurrent": true,
  "release": "4.36.0",
  "started": "2026-11-20T00:36:24Z",
  "ended": "2026-11-20T01:05:41Z",
  "filesChecked": 26,
  "sandboxed": true,
  "build": {
   "modulesBuilt": 27,
   "errors": 0,
   "theoremsWithFootprint": 435,
   "withClassicalChoice": 0,
   "withSorryAx": 0,
   "noAxioms": 38
  },
  "kernels": [
   {
    "name": "Lean paranoid",
    "verdict": "accepts",
    "said": [
     "Lean paranoid kernel accepts the solution"
    ]
   },
   {
    "name": "lean4lean",
    "verdict": "accepts",
    "declarations": 60072,
    "said": [
     "checked 60072 declarations",
     "lean4lean kernel accepts the solution"
    ]
   },
   {
    "name": "nanoda",
    "verdict": "accepts",
    "said": [
     "Skipped exported but unpermitted axioms [\"sorryAx\"]",
     "nanoda kernel accepts the solution"
    ]
   },
   {
    "name": "con-leche",
    "verdict": "accepts",
    "declarations": 60070,
    "said": [
     "con-leche: 1 inductive blocks modelled in-process: Lean.Syntax (30 generated records, checked by the fold as declarations and not counted as records of the file)",
     "con-leche: accepted 60070 declarations (--verified)",
     "con-leche kernel accepts the solution"
    ]
   },
   {
    "name": "con-ron",
    "verdict": "accepts",
    "declarations": 60070,
    "said": [
     "con-ron: 1 inductive blocks modelled in-process: Lean.Syntax (30 generated records, checked by the fold as declarations and not counted as records of the file)",
     "con-ron: accepted 60070 declarations (--verified)",
     "con-ron kernel accepts the solution"
    ]
   },
   {
    "name": "Lean default",
    "verdict": "accepts",
    "said": [
     "Lean default kernel accepts the solution"
    ]
   }
  ],
  "declarations": 60072,
  "declarationsCountedBy": "lean4lean",
  "usesAxiomsLine": "Uses axioms: Classical.choice, propext, Quot.sound",
  "usesAxiomsScope": "the union over the whole export, Lean's own prelude included; logs/lake-check-scope.txt shows a one-theorem project with no axioms printing the same line, so per-theorem footprints are in build.theoremsWithFootprint and footprints.txt",
  "exit": 0
 },
 "statements": {
  "note": "Question 1, does the Lean statement say what the page says? Seven reading passes (one agent per group of files, read-only, briefed with reading/BRIEF.md, their seven reports kept as reading/A.md to G.md) read every sentence on the site that says what one of the 26 Lean files proves, and quoted the sentence and the Lean statement side by side. Everything not listed here was judged a match. Every entry marked reread:true was re-read at its source by the author of this page before anything was changed; entries marked reread:false are listed as the reading pass reported them. Verdicts: FALSE (false as written), OVERCLAIM (says more than the file states), MODEL GAP (the file proves a statement about its own definition, which differs from the page's object), AMBIGUOUS (one reading is false), STALE (true once, the file has since changed). Collected 2026-11-19.",
  "corrected": [
   {
    "id": "c1",
    "file": "research/bayes-theorem/lean/Bayes.lean",
    "page": "bayes-theorem",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "the kernel proves the base-rate law, for every population at once; what is proven is the base-rate law itself",
    "states": "the clinic's counts, the worked examples' arithmetic, and one universal inequality, rarity_beats_accuracy: if false alarms outnumber the whole sick population, fewer than half the positives are sick. Bayes' formula and the rise with prevalence are not in the file."
   },
   {
    "id": "c2",
    "file": "research/which-roots-are-irrational/lean/SqrtN.lean",
    "page": "which-roots-are-irrational",
    "verdict": "FALSE",
    "reread": true,
    "says": "the gap readout: 'the kernel proved that, for this n, for all a and b', shown for every n, perfect squares included",
    "states": "irrational_of_not_square needs n not to be a perfect square; for n = 9, a = 3, b = 1 the gap is 0"
   },
   {
    "id": "c3",
    "file": "research/crystallographic-restriction/lean/CrystallographicRestriction.lean",
    "page": "past-the-last-case",
    "verdict": "FALSE",
    "reread": true,
    "says": "M^5 = I forces the pivot t^4 - 3t^2 + 1 = 0",
    "states": "fails at M = I (trace 2, pivot 5); the pivot argument needs M not equal to I, and since 2026-08-20 the file proves no_order_five from the full restriction instead"
   },
   {
    "id": "c4",
    "file": "research/crystallographic-restriction/lean/CrystallographicRestriction.lean",
    "page": "past-the-last-case",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "no lattice can carry a five-fold rotation",
    "states": "2 by 2 integer matrices, the plane; the same file's four-dimensional C5 has order 5"
   },
   {
    "id": "c5",
    "file": "research/which-roots-are-irrational/lean/SqrtN.lean",
    "page": "past-the-last-case",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "one theorem decides both outcomes",
    "states": "sqrt_rational_is_square proves one direction: a rational square root forces a perfect square"
   },
   {
    "id": "c6",
    "file": "research/fifteen-puzzle/lean/FifteenPuzzle.lean",
    "page": "the-half-you-can-never-reach",
    "verdict": "FALSE",
    "reread": true,
    "says": "the file's own header: exactly half of all arrangements can never be reached, on a grid of any width and height",
    "states": "the invariant only, so a two-tile swap is unreachable on any board; that the other half is reachable is not proved, and on one row of four or more cells far fewer than half are"
   },
   {
    "id": "c7",
    "file": "research/eight-perfect-shuffles/lean/PerfectShuffle.lean",
    "page": "eight-perfect-shuffles",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "five laws machine-checked for every deck at once",
    "states": "four of the five assume an even deck (hodd : m % 2 = 1, with m + 1 cards), and the out-shuffle's return law assumes four or more cards (hm : 2 ≤ m); the claims pass of 2026-11-20 found the second half, which the first correction missed"
   },
   {
    "id": "c8",
    "file": "research/the-comma/lean/TheComma.lean",
    "page": "made-not-retold",
    "verdict": "FALSE",
    "reread": true,
    "says": "3 to the m is never 2 to a power, and no equal temperament is rational, for all exponents",
    "states": "3^0 = 2^0; three_pow_ne_two_pow needs a positive power of 2, and the equal-temperament theorem needs two steps or more"
   },
   {
    "id": "c9",
    "file": "research/the-comma/lean/NthRootTwo.lean",
    "page": "the-comma",
    "verdict": "FALSE",
    "reread": true,
    "says": "the equal-tempered step is irrational for every number of steps",
    "states": "every_equal_temperament_irrational needs n at least 2; one step is the octave, 2:1"
   },
   {
    "id": "c10",
    "file": "research/check-digits/lean/CheckDigits.lean",
    "page": "check-digits",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "every weight, blind spot and count is machine-checked in Lean",
    "states": "each scheme's guarantee and named blind spot; the counts (for example how many ISBNs end in X) are checked in JavaScript only"
   },
   {
    "id": "c11",
    "file": "research/check-digits/lean/CheckDigits.lean",
    "page": "the-auditor-that-wants-nothing",
    "verdict": "FALSE",
    "reread": true,
    "says": "the guarantee needs a group that does not commute",
    "states": "damm_transposition_detects proves the same guarantee for Damm's table, a quasigroup, which is not a group"
   },
   {
    "id": "c12",
    "file": "research/printed-interval/lean/PrintedFigure.lean",
    "page": "tools/printed-numbers",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "the desk's exact intervals are checked by eight machine-checked Lean theorems",
    "states": "the rounding lemma: a printed figure denotes exactly the values that round to it, under ties upward; not the desk's arithmetic or parsing. (The same page's worked example also gave 3.20 as m = 3200 on g = 1000, and decimals from that wrong reading; corrected with it.)"
   },
   {
    "id": "c13",
    "file": "research/proof-poem-seven-modes/lean/Euclid.lean",
    "page": "proof-poem-seven-modes",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "the machine-checked proof guarantees the least prime factor of n! + 1 is prime and greater than n",
    "states": "infinitude: there exists a prime greater than n"
   }
  ],
  "noted": [
   {
    "id": "n1",
    "file": "research/weaving-drafts/lean/WeavingDraft.lean",
    "page": "two-threads-that-never-disagree",
    "verdict": "MODEL GAP",
    "reread": true,
    "says": "the minimum number of shafts is exactly the number of distinct columns, machine-checked",
    "states": "weavable_iff with 'at most S columns' stated as a labelling of the ends (ColumnsFit), and the lower bound; no count of distinct columns is defined"
   },
   {
    "id": "n2",
    "file": "research/monty-hall/lean/MontyHall.lean",
    "page": "monty-hall",
    "verdict": "MODEL GAP",
    "reread": true,
    "says": "ten doors with a knowing host: switching wins 90 of 100",
    "states": "ndoorSwitchWins := pick != car; no host is modelled for ten doors (the three-door model has one)"
   },
   {
    "id": "n3",
    "file": "research/siteswap/lean/Siteswap.lean",
    "page": "siteswap",
    "verdict": "MODEL GAP",
    "reread": true,
    "says": "the average theorem (the ball count is the average throw) is machine-checked",
    "states": "ballCount is defined as throwSum / n; what is proved is that n divides the sum of the throws"
   },
   {
    "id": "n4",
    "file": "research/nim/lean/Nim.lean",
    "page": "the-strategy-that-counts-in-binary",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "who wins (you lose if and only if the XOR is 0) is machine-checked",
    "states": "progress, closure and move_decreases; the file has no notion of a game's outcome"
   },
   {
    "id": "n5",
    "file": "research/the-mutilated-chessboard/lean/MutilatedChessboard.lean",
    "page": "past-the-last-case",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "the proof goes past the last case a search can reach",
    "states": "mutilated_chessboard is about one 8 by 8 board with two corners removed, which an exhaustive search also settles"
   },
   {
    "id": "n6",
    "file": "research/bayes-theorem/lean/Bayes.lean",
    "page": "bayes-theorem",
    "verdict": "MODEL GAP",
    "reread": true,
    "says": "the flagship (a 99 per cent accurate test, a 1 in 100 disease, exactly a coin flip) is machine-checked",
    "states": "flagship_is_a_coin_flip : 99 * 2 = (99 + 99) * 1, which names no test, rate or population"
   },
   {
    "id": "n7",
    "file": "research/crystallographic-restriction/lean/CrystallographicRestriction.lean",
    "page": "the-missing-square",
    "verdict": "STALE",
    "reread": false,
    "says": "the June pivot argument (5 is not a perfect square) is what the kernel checks; also on there-here's notes",
    "states": "since 2026-08-20 no_order_five follows from the full restriction by a trace recurrence and descent"
   },
   {
    "id": "n8",
    "file": "research/the-dimension-that-buys-nothing/lean/DimensionParity.lean",
    "page": "the-dimension-that-buys-nothing",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "214 Lean theorems settle the easy direction of the general theorem (a relation note)",
    "states": "dimensions 1 through 8; the page body says so"
   },
   {
    "id": "n9",
    "file": "research/the-dimension-that-buys-nothing/lean/DimensionParity.lean",
    "page": "the-dimension-that-buys-nothing",
    "verdict": "MODEL GAP",
    "reread": false,
    "says": "the matrices are rotations",
    "states": "no determinant condition; the order-2 examples are reflections, determinant -1"
   },
   {
    "id": "n10",
    "file": "research/check-digits/lean/CheckDigits.lean",
    "page": "check-digits",
    "verdict": "AMBIGUOUS",
    "reread": false,
    "says": "barcodes go blind to five particular swaps; Verhoeff catches all of them",
    "states": "adjacent swaps only; read as swaps at any distance, both halves are false"
   },
   {
    "id": "n11",
    "file": "research/eight-perfect-shuffles/lean/PerfectShuffle.lean",
    "page": "eight-perfect-shuffles",
    "verdict": "MODEL GAP",
    "reread": false,
    "says": "the binary steering rule fails on an odd deck (five cards)",
    "states": "odd_deck_5_fails runs the even-deck formula on five cards, which is not a shuffle (two cards land on one place)"
   },
   {
    "id": "n12",
    "file": "research/eight-perfect-shuffles/lean/PerfectShuffle.lean",
    "page": "eight-perfect-shuffles",
    "verdict": "OVERCLAIM",
    "reread": false,
    "says": "a wrapped run finishes at least a full deck below",
    "states": "steer_dichotomy gives m below, one less than the deck size"
   },
   {
    "id": "n13",
    "file": "research/fifteen-puzzle/lean/FifteenPuzzle.lean",
    "page": "the-half-you-can-never-reach",
    "verdict": "AMBIGUOUS",
    "reread": true,
    "says": "the Lean kernel takes over the universal claim, right after a sentence about necessary and sufficient",
    "states": "necessity only: no slide changes the parity bit"
   },
   {
    "id": "n14",
    "file": "research/labeled-chip-firing/lean/ChipFiring.lean",
    "page": "the-pile-that-sorts-itself",
    "verdict": "OVERCLAIM",
    "reread": false,
    "says": "the enumeration is complete",
    "states": "bounds checked for N = 5 and 6 only; completeness is inferred, not proved"
   },
   {
    "id": "n15",
    "file": "research/langford/lean/Langford.lean",
    "page": "langford-pairings",
    "verdict": "OVERCLAIM",
    "reread": false,
    "says": "a one-line proof of exactly when it can be done",
    "states": "necessity: n is 0 or 3 mod 4; existence is not in the file"
   },
   {
    "id": "n16",
    "file": "research/sorting-networks/lean/ZeroOnePrinciple.lean",
    "page": "two-symbols-are-enough",
    "verdict": "OVERCLAIM",
    "reread": false,
    "says": "the zero-one principle, if and only if",
    "states": "the hard direction"
   },
   {
    "id": "n17",
    "file": "research/graceful-census/lean/Graceful.lean",
    "page": "every-difference-once",
    "verdict": "AMBIGUOUS",
    "reread": false,
    "says": "the cycle condition is proved",
    "states": "necessity only; readable as the full if and only if"
   },
   {
    "id": "n18",
    "file": "research/the-comma/lean/NthRootTwo.lean",
    "page": "the-comma",
    "verdict": "OVERCLAIM",
    "reread": true,
    "says": "no tuning of the octave is both rational and closed",
    "states": "neither file states this; together they cover stacked 3:2 fifths and a step r with r^n = 2"
   },
   {
    "id": "n19",
    "file": "research/monty-hall/lean/MontyHall.lean",
    "page": "made-not-retold",
    "verdict": "AMBIGUOUS",
    "reread": false,
    "says": "the switch advantage is verified for a forgetful host",
    "states": "for the forgetful host the file proves switching and staying both win half the time"
   },
   {
    "id": "n20",
    "file": "research/finite-gap/lean/FiniteGap.lean",
    "page": "does-point-nine-equal-one",
    "verdict": "MODEL GAP",
    "reread": false,
    "says": "every rational below 1 is overtaken",
    "states": "p and q are natural numbers, so nonnegative rationals only"
   }
  ],
  "groups": [
   {
    "id": "g1",
    "verdict": "AXIOMS",
    "reread": false,
    "what": "blanket footprints: pages saying every theorem prints [propext, Quot.sound], or that all seven portal members print the same footprint, where some theorems print [propext] alone or no axioms, or are never printed (eight in SchlafliTrichotomy.lean; ZeroOnePrinciple.lean prints none itself, its verify.sh adds them)"
   },
   {
    "id": "g2",
    "verdict": "AXIOMS",
    "reread": false,
    "what": "'no library', 'nothing imported', 'built from the bare language': true of imports, but every file still loads Lean's core prelude, Init, implicitly"
   },
   {
    "id": "g3",
    "verdict": "STALE",
    "reread": false,
    "what": "counts that have moved: made-not-retold's 'all eighteen source files' (26 now), the-strategy-that-counts-in-binary's 'two self-verifying strata', the-report-is-not-the-defect's '52 .lean files' (53), and two pages saying DimensionParity.lean is not served under /checks/ (it is)"
   },
   {
    "id": "g4",
    "verdict": "OVERCLAIM",
    "reread": false,
    "what": "integers where the files have natural numbers (the square root of 2 'for all integers a and b'; 'every non-square integer'), harmless for the claim but not what is stated"
   }
  ]
 },
 "observations": {
  "note": "What the author ran and saw on 2026-11-19, each with its log in logs/.",
  "fifteenBefore": "35/36",
  "fifteenBeforeLog": "logs/fifteen-puzzle-verify-before.txt",
  "fifteenAfter": "36/36",
  "fifteenAfterLog": "logs/fifteen-puzzle-verify-after.txt",
  "deprecated": {
   "files": [
    "CheckDigits.lean",
    "FifteenPuzzle.lean",
    "PerfectShuffle.lean",
    "WeavingDraft.lean",
    "ZeroOnePrinciple.lean"
   ],
   "names": [
    "if_neg",
    "if_pos"
   ],
   "log": "logs/deprecations-436.txt",
   "release": "4.36.0"
  }
 },
 "deprecated": {
  "files": [
   "CheckDigits.lean",
   "FifteenPuzzle.lean",
   "PerfectShuffle.lean",
   "WeavingDraft.lean",
   "ZeroOnePrinciple.lean"
  ],
  "names": [
   "if_neg",
   "if_pos"
  ],
  "log": "logs/deprecations-436.txt",
  "release": "4.36.0"
 }
}
