{
  "id": "wesolowski26-general",
  "categoryId": "ssip-classical-heuristic",
  "paperId": "wesolowski26-isogeny",
  "date": "2026-07-23",
  "datePrecision": "day",
  "time": {
    "coefficient": 0.3333333333333333,
    "expression": "p^{1/3+o(1)}"
  },
  "space": {
    "coefficient": null,
    "expression": "p^{1/3+o(1)}"
  },
  "tags": [],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "The time and memory bound assumes smoothness of certain random integers. The source notes a superpolynomial overhead hidden in o(1) and substantial memory requirements; concrete impact is not established.",
  "extra": {
    "assumption": "Smoothness heuristic",
    "source-chronology": "Received 20 July; approved 23 July 2026"
  },
  "evidence": {
    "url": "https://eprint.iacr.org/2026/1486",
    "locator": "Abstract; approved 2026-07-23",
    "sourceVersion": "Checked 2026-11-08; see linked source version/date"
  }
}