{
  "schema_version": "mathgraph.capability-contract.v1",
  "id": "urn:mathgraph:capability:finite-developmental-growth",
  "version": "1",
  "profile": "mathgraph.finite-representation-refinement.v1",
  "claim": {
    "id": "urn:mathgraph:claim:finite-representation-refinement:v1",
    "kind": "bounded-finite-representation-refinement",
    "scope": "Exactly the eight ordered 3-bit states; deterministic Boolean policies on observational cells; the fixed five named refinements and all 256 Boolean one-bit refinements; discovery bit0 AND parity and reuse bit0 OR parity."
  },
  "inputs": [
    {
      "type_id": "mathgraph.finite-representation-refinement.v1",
      "schema": {
        "id": "urn:mathgraph:schema:finite-profile-input:v1",
        "locator": "conformance/capability_v1/fixtures/finite-profile.schema.json",
        "sha256": "9f2ebe1b56ef3ab8048f9d5669d5306b8807c589912eca2c32ebabe862478c75",
        "size_bytes": 5793,
        "media_type": "application/json"
      }
    }
  ],
  "outputs": [
    {
      "type_id": "mathgraph.capability-evaluation.v1",
      "schema": {
        "id": "urn:mathgraph:schema:capability-evaluation:v1",
        "locator": "protocol/schemas/capability-evaluation-v1.schema.json",
        "sha256": "df3db4e8ba7d1d34d45594e72fdeb1e525982e3a2b792043faf2bdf12038d779",
        "size_bytes": 5612,
        "media_type": "application/json"
      }
    }
  ],
  "preconditions": [
    "All eight states, complete truth vectors, and the entire declared mask ranges are supplied."
  ],
  "guarantees": [
    "Exact old exclusion and obstruction, unique named-family repair, sham failure, ablation, full old-closure retention, and distinct reuse.",
    "All 256 Boolean one-bit refinements are checked: 32 succeed in eight induced partition classes."
  ],
  "assumptions": [
    "The carrier is exactly the ordered 3-bit Boolean cube.",
    "Policies are total deterministic Boolean functions of the declared observations.",
    "Source-distinct reuse means two different target functions in the same owned source; it is not external adoption."
  ],
  "boundary": {
    "id": "urn:mathgraph:boundary:finite-refinement:v1",
    "locator": "conformance/capability_v1/fixtures/finite-representation-refinement-v1.json",
    "sha256": "62d74bd64163edd83c82414b344c7fd3c16e4983bbf480c165cf9e8218a86c60",
    "size_bytes": 2524,
    "media_type": "application/json"
  },
  "implementation": {
    "id": "urn:mathgraph:source:finite-developmental-run",
    "locator": "experiments/developmental_capability_growth_v1/run.py",
    "sha256": "4a76cae749b75e1461948854bf91fbcff5c5385591ec1f21967d44ba9738d588",
    "size_bytes": 13753,
    "media_type": "text/x-python"
  },
  "evidence": [
    {
      "id": "urn:mathgraph:source:finite-developmental-boolean-audit",
      "locator": "experiments/developmental_capability_growth_v1/audit_all_boolean_refinements.py",
      "sha256": "e4354d8c5ad2c07c5494907f0909f522f33a9c861f8f79586da395bc7535a0f3",
      "size_bytes": 4486,
      "media_type": "text/x-python"
    }
  ],
  "limitations": [
    "Finite scope only; no universal invention theorem or autonomous improvement claim.",
    "Same-owner implementation-independent qualification, not external adoption or independent organizational trust.",
    "Named-family uniqueness is not global feature uniqueness; no historical preregistration is claimed.",
    "No freshness, revocation, supersession, present applicability, or action authorization is established."
  ],
  "extensions": []
}