{
  "name": "goormaghtigh_baker_verification",
  "description": "Quantum search for Baker bound violations in the Goormaghtigh collision problem",
  "registers": {
    "x": {
      "bits": 7,
      "range": [
        2,
        90
      ],
      "description": "base 1"
    },
    "m": {
      "bits": 4,
      "range": [
        3,
        13
      ],
      "description": "exponent 1"
    },
    "y": {
      "bits": 7,
      "range": [
        2,
        90
      ],
      "description": "base 2"
    },
    "n": {
      "bits": 4,
      "range": [
        3,
        13
      ],
      "description": "exponent 2"
    }
  },
  "total_qubits": 22,
  "oracle": {
    "type": "baker_bound_check",
    "constant_C": 18.0,
    "threshold": "B^{-C} where B = max(m,n)"
  },
  "amplification_rounds": 768,
  "expected_violations": 0,
  "classical_precheck": true,
  "note": "Classical precheck already verifies no violations exist in [2,90]x[3,13]. The quantum circuit provides additional confidence via amplitude amplification over the full space."
}