{
  "schema": "colony.capabilities.v1",
  "company": "colony.technology",
  "primitive": {
    "mark": "ᑕ.",
    "name": "TAA",
    "mechanics": [
      "retained boundary state",
      "exact interval composition",
      "state contraction"
    ],
    "scope": "Mathematical methods; an individual proof applies only under its registered observation contract"
  },
  "engine": {
    "name": "speedrunpapi",
    "direction": "universal, source-bound computation",
    "released_cli_version": "0.7.1"
  },
  "proof_rule": "A certificate identifies a source digest, exact observation contract, verifier and bounded scope. One lane's proof does not establish another lane's correctness.",
  "lanes": [
    {
      "id": "math.exact-finite.v1",
      "status": "production_bounded",
      "surface": "authenticated hosted jobs",
      "job_contract": "colony.job.v1",
      "job_type": "solve",
      "source_format": "math",
      "domain": "colony-math-v1",
      "execution_profile": "math-cpu-v1",
      "equivalence": "mathematical_exact",
      "verification": "colony-math-independent v1",
      "coverage": "M01–M14 research family; registered bounded operators only",
      "source": "engine/packages/colony-math/src/math-edge.ts"
    },
    {
      "id": "onnx.closed-cpu.v1",
      "status": "production_bounded",
      "surface": "authenticated hosted jobs",
      "job_contract": "colony.job.v1",
      "job_type": "optimize",
      "source_format": "onnx",
      "domain": "onnx-exact-cpu-v1",
      "execution_profile": "onnx-exact-cpu-v1",
      "equivalence": "bit_exact",
      "verification": "colony.onnx-plan-independent.v1",
      "coverage": "registered closed-graph CPU profile, source-to-source plan, independently replayed",
      "source": "engine/packages/colony-contracts/src/verified-plan.ts"
    },
    {
      "id": "r1cs.output-determinism.v0.7.1",
      "status": "released",
      "surface": "CLI / browser demo / hosted analysis / signed certificate",
      "job_contract": "separate R1CS analysis and certificate APIs",
      "source_format": "compiled binary R1CS; Circom via local compiler",
      "equivalence": "output determinism under declared inputs and assumptions",
      "verification": "independent derivation or two satisfying witness assignments",
      "coverage": "Certified / Broken / Unknown; a deterministic circuit may still implement an incorrect function",
      "source": "engine/packages/carrycert-core/src/determinism/"
    },
    {
      "id": "logic.lut-threshold.v1",
      "status": "research_verified_instances",
      "surface": "engineering source; not a hosted job",
      "source_format": "n, threshold T, LUT width k; optional binary block tree",
      "equivalence": "output = [popcount(inputs) >= T] for all inputs",
      "verification": "colony.lut-threshold-independent.v1 derivation replay; certificate-free BDD equality for n <= 127; ABC cec chain on tree builds",
      "coverage": "threshold-count networks (voters, k-of-n logic, sync correlators). Cost is LUT count and levels of the netlist; no device timing, power or silicon claim",
      "source": "engine/packages/colony-adapters/lut-threshold/"
    },
    {
      "id": "logic.lut-square.v1",
      "status": "research_verified_instances",
      "surface": "engineering source; not a hosted job",
      "source_format": "operand width n",
      "equivalence": "outputs = a*a for all inputs",
      "verification": "colony.lut-square-independent.v1 derivation replay; exhaustive simulation for n <= 12",
      "coverage": "unsigned squarers as LUT networks. Netlist counts only; no evaluator-only equivalence proof against a third-party netlist",
      "source": "engine/packages/colony-adapters/lut-arith/"
    },
    {
      "id": "physical.rtl-lab.v1",
      "status": "research",
      "surface": "scoped hardware engineering engagement",
      "source_format": "declared RTL/state-transition semantics and target",
      "equivalence": "target-specific functional or trace equivalence",
      "verification": "independent reference checker and actual synthesis, timing and activity evaluators required",
      "coverage": "circuit structure, physical cost and dependable control; no general RTL compiler or hardware certificate is released",
      "source": "private SHC MineField and repo engineering research"
    }
  ],
  "interoperability": {
    "caution": "Format names in the shared job schema are transport labels, not declarations of implemented verification. Only validated lane profiles accept a funded job."
  }
}