omk-adaptorch-wpl 0.96.2 → 0.97.0

package/dist/adaptorch-client.d.ts

@@ -13,7 +13,7 @@
  * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;
  * no "benchmark" or "verification" tools exist in the shipped surface.
  */
-import type { TopologyClassification } from "./types.ts";
+import { type TopologyClassification } from "./types.ts";
 /**
  * Abstract transport for invoking AdaptOrch MCP tools by name.
  *
@@ -109,10 +109,9 @@ export interface AdaptOrchTraceSpan {
 /**
  * Result of `adaptorch_route_topology`.
  *
- * `classification` is the topology router's decision
- * (singleton/pipeline/DAG/ensemble, see doc section "Routing (pre-run
- * planning, local/no dispatch)"); `raw` retains the untyped transport
- * response for callers that need more than the classification.
+ * `classification` is the validated value from the current response's
+ * `topology` field; `raw` retains the transport response for callers that
+ * need the accompanying reason, stages, or features.
  */
 export interface AdaptOrchRouteTopologyResult {
     classification: TopologyClassification;
@@ -159,11 +158,7 @@ export declare class AdaptOrchClient {
      * `run_id`.
      */
     getTraces(runId: string): Promise<AdaptOrchTraceSpan[]>;
-    /**
-     * `adaptorch_route_topology` (read/local). Route a DAG locally through
-     * AdaptOrch's topology router (singleton/pipeline/DAG/ensemble) without
-     * submitting a run.
-     */
+    /** Route a DAG locally and fail closed if the MCP response drifts from the current topology contract. */
     routeTopology(payloadShape: unknown): Promise<AdaptOrchRouteTopologyResult>;
     /**
      * `adaptorch_server_metrics` (read/local). Read redacted MCP server

package/dist/adaptorch-client.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"adaptorch-client.d.ts","sourceRoot":"","sources":["../src/adaptorch-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAEzD;;;;;;GAMG;AACH,MAAM,WAAW,kBAAkB;IAClC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CACxE;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IACnC,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;GAIG;AACH,MAAM,WAAW,qBAAqB;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,qBAAqB;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;CACnB;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IAClC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,4BAA4B;IAC5C,cAAc,EAAE,sBAAsB,CAAC;IACvC,GAAG,EAAE,OAAO,CAAC;CACb;AAED;;;;;;;;GAQG;AACH,qBAAa,eAAe;IAC3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAqB;IAE/C,YAAY,SAAS,EAAE,kBAAkB,EAExC;IAED;;;OAGG;IACG,GAAG,CAAC,OAAO,EAAE,mBAAmB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAKnE;IAED;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAExD;IAED;;OAEG;IACG,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAE5E;IAED;;;OAGG;IACG,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAE7D;IAED;;OAEG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAE9D;IAED;;;OAGG;IACG,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAE5D;IAED;;;;OAIG;IACG,aAAa,CAAC,YAAY,EAAE,OAAO,GAAG,OAAO,CAAC,4BAA4B,CAAC,CAShF;IAED;;;OAGG;IACG,aAAa,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAEtD;IAED;;;OAGG;IACG,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAErD;IAED;;;OAGG;IACG,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAEpD;CACD","sourcesContent":["/**\n * AdaptOrch MCP client wrapper.\n *\n * Design-stage / experimental: this module has no production\n * `AdaptOrchTransport` implementation wired in yet. Callers must supply\n * their own transport (e.g. an adapter around an MCP SDK client) until one\n * ships in this package.\n *\n * Tool surface, names, and read/write classification are grounded in\n * `.omk/runs/lazycodex-adaptorch-loop-plan-20260701/lane2-adaptorch-tool-surface.md`,\n * which cross-checks the real AdaptOrch MCP server against\n * `docs/tools.md`, `README.md`, `mcp_server.py` dispatch, and\n * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;\n * no \"benchmark\" or \"verification\" tools exist in the shipped surface.\n */\n\nimport type { TopologyClassification } from \"./types.ts\";\n\n/**\n * Abstract transport for invoking AdaptOrch MCP tools by name.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\". No\n * concrete implementation ships with this package yet; a caller must\n * provide one (e.g. wrapping an MCP SDK client's `callTool`).\n */\nexport interface AdaptOrchTransport {\n\tcallTool(name: string, args: Record<string, unknown>): Promise<unknown>;\n}\n\n/**\n * Payload accepted by `adaptorch_run`.\n *\n * See doc section \"Run / lifecycle (submit, inspect, list, cancel)\":\n * `adaptorch_run` submits a task payload (prompt/context/raw payload,\n * connector, synthesis mode, budget policy) to the control-plane, and can\n * optionally block until the run reaches a terminal status.\n */\nexport interface AdaptOrchRunPayload {\n\ttaskPayload: unknown;\n\tconnector?: string;\n\tsynthesisMode?: string;\n\tbudgetPolicy?: unknown;\n\twaitForTerminal?: boolean;\n\ttimeoutSeconds?: number;\n\tpollIntervalSeconds?: number;\n}\n\n/**\n * Result of `adaptorch_run`.\n *\n * Shape is inferred from the doc's description of the tool's purpose, not\n * guaranteed by an official schema.\n */\nexport interface AdaptOrchRunResult {\n\trun_id: string;\n\tstatus?: string;\n}\n\n/**\n * Result of `adaptorch_get_run`.\n *\n * Shape is inferred from the doc's description (\"fetch a run summary by\n * run_id\"), not guaranteed by an official schema; extra fields are\n * expected to vary by connector/synthesis mode.\n */\nexport interface AdaptOrchRunSummary {\n\trun_id: string;\n\tstatus: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_list_runs`.\n *\n * Shape is inferred, not guaranteed by an official schema.\n */\nexport interface AdaptOrchRunListEntry {\n\trun_id: string;\n\tstatus: string;\n}\n\n/**\n * Result of `adaptorch_cancel_run`.\n *\n * Shape is inferred from the doc's description (\"request cancellation of\n * an in-flight run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchCancelResult {\n\trun_id: string;\n\tcancelled: boolean;\n}\n\n/**\n * Entry in the result of `adaptorch_get_artifacts`.\n *\n * Shape is inferred from the doc's description (\"fetch artifact metadata\n * for a run\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchArtifact {\n\tpath: string;\n\tsize_bytes?: number;\n\tcreated_at?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_get_traces`.\n *\n * Shape is inferred from the doc's description (\"fetch execution traces\n * for a run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchTraceSpan {\n\tspan_id?: string;\n\tkind?: string;\n\tseverity?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Result of `adaptorch_route_topology`.\n *\n * `classification` is the topology router's decision\n * (singleton/pipeline/DAG/ensemble, see doc section \"Routing (pre-run\n * planning, local/no dispatch)\"); `raw` retains the untyped transport\n * response for callers that need more than the classification.\n */\nexport interface AdaptOrchRouteTopologyResult {\n\tclassification: TopologyClassification;\n\traw: unknown;\n}\n\n/**\n * Typed wrapper around the 10 real AdaptOrch MCP tools.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\" for\n * the full tool list, purposes, and read/write classification. This\n * class only translates method calls into `transport.callTool` calls\n * with the exact tool names the doc lists; it does not implement a\n * transport itself.\n */\nexport class AdaptOrchClient {\n\tprivate readonly transport: AdaptOrchTransport;\n\n\tconstructor(transport: AdaptOrchTransport) {\n\t\tthis.transport = transport;\n\t}\n\n\t/**\n\t * `adaptorch_run` (write). Submit a task payload to the control-plane,\n\t * optionally blocking until the run reaches a terminal status.\n\t */\n\tasync run(payload: AdaptOrchRunPayload): Promise<AdaptOrchRunResult> {\n\t\t// The transport result shape is not schema-validated here; callers\n\t\t// relying on strict correctness should validate at the transport\n\t\t// boundary.\n\t\treturn (await this.transport.callTool(\"adaptorch_run\", { ...payload })) as AdaptOrchRunResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_run` (read). Fetch a run summary by `run_id`.\n\t */\n\tasync getRun(runId: string): Promise<AdaptOrchRunSummary> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_run\", { run_id: runId })) as AdaptOrchRunSummary;\n\t}\n\n\t/**\n\t * `adaptorch_list_runs` (read). List recent control-plane runs.\n\t */\n\tasync listRuns(params?: { limit?: number }): Promise<AdaptOrchRunListEntry[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_list_runs\", { ...params })) as AdaptOrchRunListEntry[];\n\t}\n\n\t/**\n\t * `adaptorch_cancel_run` (write). Request cancellation of an in-flight\n\t * run by `run_id`.\n\t */\n\tasync cancelRun(runId: string): Promise<AdaptOrchCancelResult> {\n\t\treturn (await this.transport.callTool(\"adaptorch_cancel_run\", { run_id: runId })) as AdaptOrchCancelResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_artifacts` (read). Fetch artifact metadata for a run.\n\t */\n\tasync getArtifacts(runId: string): Promise<AdaptOrchArtifact[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_artifacts\", { run_id: runId })) as AdaptOrchArtifact[];\n\t}\n\n\t/**\n\t * `adaptorch_get_traces` (read). Fetch execution traces for a run by\n\t * `run_id`.\n\t */\n\tasync getTraces(runId: string): Promise<AdaptOrchTraceSpan[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_traces\", { run_id: runId })) as AdaptOrchTraceSpan[];\n\t}\n\n\t/**\n\t * `adaptorch_route_topology` (read/local). Route a DAG locally through\n\t * AdaptOrch's topology router (singleton/pipeline/DAG/ensemble) without\n\t * submitting a run.\n\t */\n\tasync routeTopology(payloadShape: unknown): Promise<AdaptOrchRouteTopologyResult> {\n\t\tconst raw = await this.transport.callTool(\"adaptorch_route_topology\", { payload_shape: payloadShape });\n\t\t// The transport response is not schema-validated; classification is\n\t\t// extracted best-effort since no official schema is documented.\n\t\tconst classification = (raw as { classification?: TopologyClassification } | undefined)?.classification;\n\t\treturn {\n\t\t\tclassification: classification as TopologyClassification,\n\t\t\traw,\n\t\t};\n\t}\n\n\t/**\n\t * `adaptorch_server_metrics` (read/local). Read redacted MCP server\n\t * metrics (tool-call counters, latency percentiles).\n\t */\n\tasync serverMetrics(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_server_metrics\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_capabilities` (read/local). Read supported synthesis\n\t * modes, connectors, and server features.\n\t */\n\tasync capabilities(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_capabilities\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_plan_catalog` (read/local). Read the hosted plan catalog\n\t * (Starter $0 / Pro $39 / Team $149).\n\t */\n\tasync planCatalog(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_plan_catalog\", {})) as Record<string, unknown>;\n\t}\n}\n"]}
+{"version":3,"file":"adaptorch-client.d.ts","sourceRoot":"","sources":["../src/adaptorch-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAA4B,KAAK,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAMnF;;;;;;GAMG;AACH,MAAM,WAAW,kBAAkB;IAClC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CACxE;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IACnC,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;GAIG;AACH,MAAM,WAAW,qBAAqB;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,qBAAqB;IACrC,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;CACnB;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IAClC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,4BAA4B;IAC5C,cAAc,EAAE,sBAAsB,CAAC;IACvC,GAAG,EAAE,OAAO,CAAC;CACb;AAED;;;;;;;;GAQG;AACH,qBAAa,eAAe;IAC3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAqB;IAE/C,YAAY,SAAS,EAAE,kBAAkB,EAExC;IAED;;;OAGG;IACG,GAAG,CAAC,OAAO,EAAE,mBAAmB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAKnE;IAED;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAExD;IAED;;OAEG;IACG,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAE5E;IAED;;;OAGG;IACG,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAE7D;IAED;;OAEG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAE9D;IAED;;;OAGG;IACG,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAE5D;IAED,yGAAyG;IACnG,aAAa,CAAC,YAAY,EAAE,OAAO,GAAG,OAAO,CAAC,4BAA4B,CAAC,CAOhF;IAED;;;OAGG;IACG,aAAa,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAEtD;IAED;;;OAGG;IACG,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAErD;IAED;;;OAGG;IACG,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAEpD;CACD","sourcesContent":["/**\n * AdaptOrch MCP client wrapper.\n *\n * Design-stage / experimental: this module has no production\n * `AdaptOrchTransport` implementation wired in yet. Callers must supply\n * their own transport (e.g. an adapter around an MCP SDK client) until one\n * ships in this package.\n *\n * Tool surface, names, and read/write classification are grounded in\n * `.omk/runs/lazycodex-adaptorch-loop-plan-20260701/lane2-adaptorch-tool-surface.md`,\n * which cross-checks the real AdaptOrch MCP server against\n * `docs/tools.md`, `README.md`, `mcp_server.py` dispatch, and\n * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;\n * no \"benchmark\" or \"verification\" tools exist in the shipped surface.\n */\n\nimport { isTopologyClassification, type TopologyClassification } from \"./types.ts\";\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/**\n * Abstract transport for invoking AdaptOrch MCP tools by name.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\". No\n * concrete implementation ships with this package yet; a caller must\n * provide one (e.g. wrapping an MCP SDK client's `callTool`).\n */\nexport interface AdaptOrchTransport {\n\tcallTool(name: string, args: Record<string, unknown>): Promise<unknown>;\n}\n\n/**\n * Payload accepted by `adaptorch_run`.\n *\n * See doc section \"Run / lifecycle (submit, inspect, list, cancel)\":\n * `adaptorch_run` submits a task payload (prompt/context/raw payload,\n * connector, synthesis mode, budget policy) to the control-plane, and can\n * optionally block until the run reaches a terminal status.\n */\nexport interface AdaptOrchRunPayload {\n\ttaskPayload: unknown;\n\tconnector?: string;\n\tsynthesisMode?: string;\n\tbudgetPolicy?: unknown;\n\twaitForTerminal?: boolean;\n\ttimeoutSeconds?: number;\n\tpollIntervalSeconds?: number;\n}\n\n/**\n * Result of `adaptorch_run`.\n *\n * Shape is inferred from the doc's description of the tool's purpose, not\n * guaranteed by an official schema.\n */\nexport interface AdaptOrchRunResult {\n\trun_id: string;\n\tstatus?: string;\n}\n\n/**\n * Result of `adaptorch_get_run`.\n *\n * Shape is inferred from the doc's description (\"fetch a run summary by\n * run_id\"), not guaranteed by an official schema; extra fields are\n * expected to vary by connector/synthesis mode.\n */\nexport interface AdaptOrchRunSummary {\n\trun_id: string;\n\tstatus: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_list_runs`.\n *\n * Shape is inferred, not guaranteed by an official schema.\n */\nexport interface AdaptOrchRunListEntry {\n\trun_id: string;\n\tstatus: string;\n}\n\n/**\n * Result of `adaptorch_cancel_run`.\n *\n * Shape is inferred from the doc's description (\"request cancellation of\n * an in-flight run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchCancelResult {\n\trun_id: string;\n\tcancelled: boolean;\n}\n\n/**\n * Entry in the result of `adaptorch_get_artifacts`.\n *\n * Shape is inferred from the doc's description (\"fetch artifact metadata\n * for a run\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchArtifact {\n\tpath: string;\n\tsize_bytes?: number;\n\tcreated_at?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_get_traces`.\n *\n * Shape is inferred from the doc's description (\"fetch execution traces\n * for a run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchTraceSpan {\n\tspan_id?: string;\n\tkind?: string;\n\tseverity?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Result of `adaptorch_route_topology`.\n *\n * `classification` is the validated value from the current response's\n * `topology` field; `raw` retains the transport response for callers that\n * need the accompanying reason, stages, or features.\n */\nexport interface AdaptOrchRouteTopologyResult {\n\tclassification: TopologyClassification;\n\traw: unknown;\n}\n\n/**\n * Typed wrapper around the 10 real AdaptOrch MCP tools.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\" for\n * the full tool list, purposes, and read/write classification. This\n * class only translates method calls into `transport.callTool` calls\n * with the exact tool names the doc lists; it does not implement a\n * transport itself.\n */\nexport class AdaptOrchClient {\n\tprivate readonly transport: AdaptOrchTransport;\n\n\tconstructor(transport: AdaptOrchTransport) {\n\t\tthis.transport = transport;\n\t}\n\n\t/**\n\t * `adaptorch_run` (write). Submit a task payload to the control-plane,\n\t * optionally blocking until the run reaches a terminal status.\n\t */\n\tasync run(payload: AdaptOrchRunPayload): Promise<AdaptOrchRunResult> {\n\t\t// The transport result shape is not schema-validated here; callers\n\t\t// relying on strict correctness should validate at the transport\n\t\t// boundary.\n\t\treturn (await this.transport.callTool(\"adaptorch_run\", { ...payload })) as AdaptOrchRunResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_run` (read). Fetch a run summary by `run_id`.\n\t */\n\tasync getRun(runId: string): Promise<AdaptOrchRunSummary> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_run\", { run_id: runId })) as AdaptOrchRunSummary;\n\t}\n\n\t/**\n\t * `adaptorch_list_runs` (read). List recent control-plane runs.\n\t */\n\tasync listRuns(params?: { limit?: number }): Promise<AdaptOrchRunListEntry[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_list_runs\", { ...params })) as AdaptOrchRunListEntry[];\n\t}\n\n\t/**\n\t * `adaptorch_cancel_run` (write). Request cancellation of an in-flight\n\t * run by `run_id`.\n\t */\n\tasync cancelRun(runId: string): Promise<AdaptOrchCancelResult> {\n\t\treturn (await this.transport.callTool(\"adaptorch_cancel_run\", { run_id: runId })) as AdaptOrchCancelResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_artifacts` (read). Fetch artifact metadata for a run.\n\t */\n\tasync getArtifacts(runId: string): Promise<AdaptOrchArtifact[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_artifacts\", { run_id: runId })) as AdaptOrchArtifact[];\n\t}\n\n\t/**\n\t * `adaptorch_get_traces` (read). Fetch execution traces for a run by\n\t * `run_id`.\n\t */\n\tasync getTraces(runId: string): Promise<AdaptOrchTraceSpan[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_traces\", { run_id: runId })) as AdaptOrchTraceSpan[];\n\t}\n\n\t/** Route a DAG locally and fail closed if the MCP response drifts from the current topology contract. */\n\tasync routeTopology(payloadShape: unknown): Promise<AdaptOrchRouteTopologyResult> {\n\t\tconst raw = await this.transport.callTool(\"adaptorch_route_topology\", { payload_shape: payloadShape });\n\t\tconst topology = isRecord(raw) ? raw.topology : undefined;\n\t\tif (!isTopologyClassification(topology)) {\n\t\t\tthrow new Error(\"AdaptOrch route response has invalid topology\");\n\t\t}\n\t\treturn { classification: topology, raw };\n\t}\n\n\t/**\n\t * `adaptorch_server_metrics` (read/local). Read redacted MCP server\n\t * metrics (tool-call counters, latency percentiles).\n\t */\n\tasync serverMetrics(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_server_metrics\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_capabilities` (read/local). Read supported synthesis\n\t * modes, connectors, and server features.\n\t */\n\tasync capabilities(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_capabilities\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_plan_catalog` (read/local). Read the hosted plan catalog\n\t * (Starter $0 / Pro $39 / Team $149).\n\t */\n\tasync planCatalog(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_plan_catalog\", {})) as Record<string, unknown>;\n\t}\n}\n"]}

package/dist/adaptorch-client.js

@@ -13,6 +13,10 @@
  * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;
  * no "benchmark" or "verification" tools exist in the shipped surface.
  */
+import { isTopologyClassification } from "./types.js";
+function isRecord(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
 /**
  * Typed wrapper around the 10 real AdaptOrch MCP tools.
  *
@@ -69,20 +73,14 @@ export class AdaptOrchClient {
     async getTraces(runId) {
         return (await this.transport.callTool("adaptorch_get_traces", { run_id: runId }));
     }
-    /**
-     * `adaptorch_route_topology` (read/local). Route a DAG locally through
-     * AdaptOrch's topology router (singleton/pipeline/DAG/ensemble) without
-     * submitting a run.
-     */
+    /** Route a DAG locally and fail closed if the MCP response drifts from the current topology contract. */
     async routeTopology(payloadShape) {
         const raw = await this.transport.callTool("adaptorch_route_topology", { payload_shape: payloadShape });
-        // The transport response is not schema-validated; classification is
-        // extracted best-effort since no official schema is documented.
-        const classification = raw?.classification;
-        return {
-            classification: classification,
-            raw,
-        };
+        const topology = isRecord(raw) ? raw.topology : undefined;
+        if (!isTopologyClassification(topology)) {
+            throw new Error("AdaptOrch route response has invalid topology");
+        }
+        return { classification: topology, raw };
     }
     /**
      * `adaptorch_server_metrics` (read/local). Read redacted MCP server

package/dist/adaptorch-client.js.map

@@ -1 +1 @@
-{"version":3,"file":"adaptorch-client.js","sourceRoot":"","sources":["../src/adaptorch-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAqHH;;;;;;;;GAQG;AACH,MAAM,OAAO,eAAe;IACV,SAAS,CAAqB;IAE/C,YAAY,SAA6B,EAAE;QAC1C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAAA,CAC3B;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,CAAC,OAA4B,EAA+B;QACpE,mEAAmE;QACnE,iEAAiE;QACjE,YAAY;QACZ,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,eAAe,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAuB,CAAC;IAAA,CAC9F;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAgC;QACzD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,mBAAmB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAwB,CAAC;IAAA,CACtG;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,MAA2B,EAAoC;QAC7E,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,qBAAqB,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,CAA4B,CAAC;IAAA,CACxG;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,KAAa,EAAkC;QAC9D,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAA0B,CAAC;IAAA,CAC3G;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAAC,KAAa,EAAgC;QAC/D,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,yBAAyB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAwB,CAAC;IAAA,CAC5G;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,KAAa,EAAiC;QAC7D,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAyB,CAAC;IAAA,CAC1G;IAED;;;;OAIG;IACH,KAAK,CAAC,aAAa,CAAC,YAAqB,EAAyC;QACjF,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,0BAA0B,EAAE,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;QACvG,oEAAoE;QACpE,gEAAgE;QAChE,MAAM,cAAc,GAAI,GAA+D,EAAE,cAAc,CAAC;QACxG,OAAO;YACN,cAAc,EAAE,cAAwC;YACxD,GAAG;SACH,CAAC;IAAA,CACF;IAED;;;OAGG;IACH,KAAK,CAAC,aAAa,GAAqC;QACvD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,0BAA0B,EAAE,EAAE,CAAC,CAA4B,CAAC;IAAA,CAClG;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,GAAqC;QACtD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAA4B,CAAC;IAAA,CAChG;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,GAAqC;QACrD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAA4B,CAAC;IAAA,CAChG;CACD","sourcesContent":["/**\n * AdaptOrch MCP client wrapper.\n *\n * Design-stage / experimental: this module has no production\n * `AdaptOrchTransport` implementation wired in yet. Callers must supply\n * their own transport (e.g. an adapter around an MCP SDK client) until one\n * ships in this package.\n *\n * Tool surface, names, and read/write classification are grounded in\n * `.omk/runs/lazycodex-adaptorch-loop-plan-20260701/lane2-adaptorch-tool-surface.md`,\n * which cross-checks the real AdaptOrch MCP server against\n * `docs/tools.md`, `README.md`, `mcp_server.py` dispatch, and\n * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;\n * no \"benchmark\" or \"verification\" tools exist in the shipped surface.\n */\n\nimport type { TopologyClassification } from \"./types.ts\";\n\n/**\n * Abstract transport for invoking AdaptOrch MCP tools by name.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\". No\n * concrete implementation ships with this package yet; a caller must\n * provide one (e.g. wrapping an MCP SDK client's `callTool`).\n */\nexport interface AdaptOrchTransport {\n\tcallTool(name: string, args: Record<string, unknown>): Promise<unknown>;\n}\n\n/**\n * Payload accepted by `adaptorch_run`.\n *\n * See doc section \"Run / lifecycle (submit, inspect, list, cancel)\":\n * `adaptorch_run` submits a task payload (prompt/context/raw payload,\n * connector, synthesis mode, budget policy) to the control-plane, and can\n * optionally block until the run reaches a terminal status.\n */\nexport interface AdaptOrchRunPayload {\n\ttaskPayload: unknown;\n\tconnector?: string;\n\tsynthesisMode?: string;\n\tbudgetPolicy?: unknown;\n\twaitForTerminal?: boolean;\n\ttimeoutSeconds?: number;\n\tpollIntervalSeconds?: number;\n}\n\n/**\n * Result of `adaptorch_run`.\n *\n * Shape is inferred from the doc's description of the tool's purpose, not\n * guaranteed by an official schema.\n */\nexport interface AdaptOrchRunResult {\n\trun_id: string;\n\tstatus?: string;\n}\n\n/**\n * Result of `adaptorch_get_run`.\n *\n * Shape is inferred from the doc's description (\"fetch a run summary by\n * run_id\"), not guaranteed by an official schema; extra fields are\n * expected to vary by connector/synthesis mode.\n */\nexport interface AdaptOrchRunSummary {\n\trun_id: string;\n\tstatus: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_list_runs`.\n *\n * Shape is inferred, not guaranteed by an official schema.\n */\nexport interface AdaptOrchRunListEntry {\n\trun_id: string;\n\tstatus: string;\n}\n\n/**\n * Result of `adaptorch_cancel_run`.\n *\n * Shape is inferred from the doc's description (\"request cancellation of\n * an in-flight run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchCancelResult {\n\trun_id: string;\n\tcancelled: boolean;\n}\n\n/**\n * Entry in the result of `adaptorch_get_artifacts`.\n *\n * Shape is inferred from the doc's description (\"fetch artifact metadata\n * for a run\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchArtifact {\n\tpath: string;\n\tsize_bytes?: number;\n\tcreated_at?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_get_traces`.\n *\n * Shape is inferred from the doc's description (\"fetch execution traces\n * for a run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchTraceSpan {\n\tspan_id?: string;\n\tkind?: string;\n\tseverity?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Result of `adaptorch_route_topology`.\n *\n * `classification` is the topology router's decision\n * (singleton/pipeline/DAG/ensemble, see doc section \"Routing (pre-run\n * planning, local/no dispatch)\"); `raw` retains the untyped transport\n * response for callers that need more than the classification.\n */\nexport interface AdaptOrchRouteTopologyResult {\n\tclassification: TopologyClassification;\n\traw: unknown;\n}\n\n/**\n * Typed wrapper around the 10 real AdaptOrch MCP tools.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\" for\n * the full tool list, purposes, and read/write classification. This\n * class only translates method calls into `transport.callTool` calls\n * with the exact tool names the doc lists; it does not implement a\n * transport itself.\n */\nexport class AdaptOrchClient {\n\tprivate readonly transport: AdaptOrchTransport;\n\n\tconstructor(transport: AdaptOrchTransport) {\n\t\tthis.transport = transport;\n\t}\n\n\t/**\n\t * `adaptorch_run` (write). Submit a task payload to the control-plane,\n\t * optionally blocking until the run reaches a terminal status.\n\t */\n\tasync run(payload: AdaptOrchRunPayload): Promise<AdaptOrchRunResult> {\n\t\t// The transport result shape is not schema-validated here; callers\n\t\t// relying on strict correctness should validate at the transport\n\t\t// boundary.\n\t\treturn (await this.transport.callTool(\"adaptorch_run\", { ...payload })) as AdaptOrchRunResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_run` (read). Fetch a run summary by `run_id`.\n\t */\n\tasync getRun(runId: string): Promise<AdaptOrchRunSummary> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_run\", { run_id: runId })) as AdaptOrchRunSummary;\n\t}\n\n\t/**\n\t * `adaptorch_list_runs` (read). List recent control-plane runs.\n\t */\n\tasync listRuns(params?: { limit?: number }): Promise<AdaptOrchRunListEntry[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_list_runs\", { ...params })) as AdaptOrchRunListEntry[];\n\t}\n\n\t/**\n\t * `adaptorch_cancel_run` (write). Request cancellation of an in-flight\n\t * run by `run_id`.\n\t */\n\tasync cancelRun(runId: string): Promise<AdaptOrchCancelResult> {\n\t\treturn (await this.transport.callTool(\"adaptorch_cancel_run\", { run_id: runId })) as AdaptOrchCancelResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_artifacts` (read). Fetch artifact metadata for a run.\n\t */\n\tasync getArtifacts(runId: string): Promise<AdaptOrchArtifact[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_artifacts\", { run_id: runId })) as AdaptOrchArtifact[];\n\t}\n\n\t/**\n\t * `adaptorch_get_traces` (read). Fetch execution traces for a run by\n\t * `run_id`.\n\t */\n\tasync getTraces(runId: string): Promise<AdaptOrchTraceSpan[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_traces\", { run_id: runId })) as AdaptOrchTraceSpan[];\n\t}\n\n\t/**\n\t * `adaptorch_route_topology` (read/local). Route a DAG locally through\n\t * AdaptOrch's topology router (singleton/pipeline/DAG/ensemble) without\n\t * submitting a run.\n\t */\n\tasync routeTopology(payloadShape: unknown): Promise<AdaptOrchRouteTopologyResult> {\n\t\tconst raw = await this.transport.callTool(\"adaptorch_route_topology\", { payload_shape: payloadShape });\n\t\t// The transport response is not schema-validated; classification is\n\t\t// extracted best-effort since no official schema is documented.\n\t\tconst classification = (raw as { classification?: TopologyClassification } | undefined)?.classification;\n\t\treturn {\n\t\t\tclassification: classification as TopologyClassification,\n\t\t\traw,\n\t\t};\n\t}\n\n\t/**\n\t * `adaptorch_server_metrics` (read/local). Read redacted MCP server\n\t * metrics (tool-call counters, latency percentiles).\n\t */\n\tasync serverMetrics(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_server_metrics\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_capabilities` (read/local). Read supported synthesis\n\t * modes, connectors, and server features.\n\t */\n\tasync capabilities(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_capabilities\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_plan_catalog` (read/local). Read the hosted plan catalog\n\t * (Starter $0 / Pro $39 / Team $149).\n\t */\n\tasync planCatalog(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_plan_catalog\", {})) as Record<string, unknown>;\n\t}\n}\n"]}
+{"version":3,"file":"adaptorch-client.js","sourceRoot":"","sources":["../src/adaptorch-client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,wBAAwB,EAA+B,MAAM,YAAY,CAAC;AAEnF,SAAS,QAAQ,CAAC,KAAc,EAAoC;IACnE,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAAA,CAC5E;AAkHD;;;;;;;;GAQG;AACH,MAAM,OAAO,eAAe;IACV,SAAS,CAAqB;IAE/C,YAAY,SAA6B,EAAE;QAC1C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAAA,CAC3B;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,CAAC,OAA4B,EAA+B;QACpE,mEAAmE;QACnE,iEAAiE;QACjE,YAAY;QACZ,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,eAAe,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAuB,CAAC;IAAA,CAC9F;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAgC;QACzD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,mBAAmB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAwB,CAAC;IAAA,CACtG;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,MAA2B,EAAoC;QAC7E,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,qBAAqB,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,CAA4B,CAAC;IAAA,CACxG;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,KAAa,EAAkC;QAC9D,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAA0B,CAAC;IAAA,CAC3G;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAAC,KAAa,EAAgC;QAC/D,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,yBAAyB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAwB,CAAC;IAAA,CAC5G;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,KAAa,EAAiC;QAC7D,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,sBAAsB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAyB,CAAC;IAAA,CAC1G;IAED,yGAAyG;IACzG,KAAK,CAAC,aAAa,CAAC,YAAqB,EAAyC;QACjF,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,0BAA0B,EAAE,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;QACvG,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1D,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;IAAA,CACzC;IAED;;;OAGG;IACH,KAAK,CAAC,aAAa,GAAqC;QACvD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,0BAA0B,EAAE,EAAE,CAAC,CAA4B,CAAC;IAAA,CAClG;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,GAAqC;QACtD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAA4B,CAAC;IAAA,CAChG;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,GAAqC;QACrD,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAA4B,CAAC;IAAA,CAChG;CACD","sourcesContent":["/**\n * AdaptOrch MCP client wrapper.\n *\n * Design-stage / experimental: this module has no production\n * `AdaptOrchTransport` implementation wired in yet. Callers must supply\n * their own transport (e.g. an adapter around an MCP SDK client) until one\n * ships in this package.\n *\n * Tool surface, names, and read/write classification are grounded in\n * `.omk/runs/lazycodex-adaptorch-loop-plan-20260701/lane2-adaptorch-tool-surface.md`,\n * which cross-checks the real AdaptOrch MCP server against\n * `docs/tools.md`, `README.md`, `mcp_server.py` dispatch, and\n * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;\n * no \"benchmark\" or \"verification\" tools exist in the shipped surface.\n */\n\nimport { isTopologyClassification, type TopologyClassification } from \"./types.ts\";\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/**\n * Abstract transport for invoking AdaptOrch MCP tools by name.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\". No\n * concrete implementation ships with this package yet; a caller must\n * provide one (e.g. wrapping an MCP SDK client's `callTool`).\n */\nexport interface AdaptOrchTransport {\n\tcallTool(name: string, args: Record<string, unknown>): Promise<unknown>;\n}\n\n/**\n * Payload accepted by `adaptorch_run`.\n *\n * See doc section \"Run / lifecycle (submit, inspect, list, cancel)\":\n * `adaptorch_run` submits a task payload (prompt/context/raw payload,\n * connector, synthesis mode, budget policy) to the control-plane, and can\n * optionally block until the run reaches a terminal status.\n */\nexport interface AdaptOrchRunPayload {\n\ttaskPayload: unknown;\n\tconnector?: string;\n\tsynthesisMode?: string;\n\tbudgetPolicy?: unknown;\n\twaitForTerminal?: boolean;\n\ttimeoutSeconds?: number;\n\tpollIntervalSeconds?: number;\n}\n\n/**\n * Result of `adaptorch_run`.\n *\n * Shape is inferred from the doc's description of the tool's purpose, not\n * guaranteed by an official schema.\n */\nexport interface AdaptOrchRunResult {\n\trun_id: string;\n\tstatus?: string;\n}\n\n/**\n * Result of `adaptorch_get_run`.\n *\n * Shape is inferred from the doc's description (\"fetch a run summary by\n * run_id\"), not guaranteed by an official schema; extra fields are\n * expected to vary by connector/synthesis mode.\n */\nexport interface AdaptOrchRunSummary {\n\trun_id: string;\n\tstatus: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_list_runs`.\n *\n * Shape is inferred, not guaranteed by an official schema.\n */\nexport interface AdaptOrchRunListEntry {\n\trun_id: string;\n\tstatus: string;\n}\n\n/**\n * Result of `adaptorch_cancel_run`.\n *\n * Shape is inferred from the doc's description (\"request cancellation of\n * an in-flight run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchCancelResult {\n\trun_id: string;\n\tcancelled: boolean;\n}\n\n/**\n * Entry in the result of `adaptorch_get_artifacts`.\n *\n * Shape is inferred from the doc's description (\"fetch artifact metadata\n * for a run\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchArtifact {\n\tpath: string;\n\tsize_bytes?: number;\n\tcreated_at?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Entry in the result of `adaptorch_get_traces`.\n *\n * Shape is inferred from the doc's description (\"fetch execution traces\n * for a run by run_id\"), not guaranteed by an official schema.\n */\nexport interface AdaptOrchTraceSpan {\n\tspan_id?: string;\n\tkind?: string;\n\tseverity?: string;\n\t[key: string]: unknown;\n}\n\n/**\n * Result of `adaptorch_route_topology`.\n *\n * `classification` is the validated value from the current response's\n * `topology` field; `raw` retains the transport response for callers that\n * need the accompanying reason, stages, or features.\n */\nexport interface AdaptOrchRouteTopologyResult {\n\tclassification: TopologyClassification;\n\traw: unknown;\n}\n\n/**\n * Typed wrapper around the 10 real AdaptOrch MCP tools.\n *\n * See doc section \"The real, current 10-tool MCP surface (grouped)\" for\n * the full tool list, purposes, and read/write classification. This\n * class only translates method calls into `transport.callTool` calls\n * with the exact tool names the doc lists; it does not implement a\n * transport itself.\n */\nexport class AdaptOrchClient {\n\tprivate readonly transport: AdaptOrchTransport;\n\n\tconstructor(transport: AdaptOrchTransport) {\n\t\tthis.transport = transport;\n\t}\n\n\t/**\n\t * `adaptorch_run` (write). Submit a task payload to the control-plane,\n\t * optionally blocking until the run reaches a terminal status.\n\t */\n\tasync run(payload: AdaptOrchRunPayload): Promise<AdaptOrchRunResult> {\n\t\t// The transport result shape is not schema-validated here; callers\n\t\t// relying on strict correctness should validate at the transport\n\t\t// boundary.\n\t\treturn (await this.transport.callTool(\"adaptorch_run\", { ...payload })) as AdaptOrchRunResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_run` (read). Fetch a run summary by `run_id`.\n\t */\n\tasync getRun(runId: string): Promise<AdaptOrchRunSummary> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_run\", { run_id: runId })) as AdaptOrchRunSummary;\n\t}\n\n\t/**\n\t * `adaptorch_list_runs` (read). List recent control-plane runs.\n\t */\n\tasync listRuns(params?: { limit?: number }): Promise<AdaptOrchRunListEntry[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_list_runs\", { ...params })) as AdaptOrchRunListEntry[];\n\t}\n\n\t/**\n\t * `adaptorch_cancel_run` (write). Request cancellation of an in-flight\n\t * run by `run_id`.\n\t */\n\tasync cancelRun(runId: string): Promise<AdaptOrchCancelResult> {\n\t\treturn (await this.transport.callTool(\"adaptorch_cancel_run\", { run_id: runId })) as AdaptOrchCancelResult;\n\t}\n\n\t/**\n\t * `adaptorch_get_artifacts` (read). Fetch artifact metadata for a run.\n\t */\n\tasync getArtifacts(runId: string): Promise<AdaptOrchArtifact[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_artifacts\", { run_id: runId })) as AdaptOrchArtifact[];\n\t}\n\n\t/**\n\t * `adaptorch_get_traces` (read). Fetch execution traces for a run by\n\t * `run_id`.\n\t */\n\tasync getTraces(runId: string): Promise<AdaptOrchTraceSpan[]> {\n\t\treturn (await this.transport.callTool(\"adaptorch_get_traces\", { run_id: runId })) as AdaptOrchTraceSpan[];\n\t}\n\n\t/** Route a DAG locally and fail closed if the MCP response drifts from the current topology contract. */\n\tasync routeTopology(payloadShape: unknown): Promise<AdaptOrchRouteTopologyResult> {\n\t\tconst raw = await this.transport.callTool(\"adaptorch_route_topology\", { payload_shape: payloadShape });\n\t\tconst topology = isRecord(raw) ? raw.topology : undefined;\n\t\tif (!isTopologyClassification(topology)) {\n\t\t\tthrow new Error(\"AdaptOrch route response has invalid topology\");\n\t\t}\n\t\treturn { classification: topology, raw };\n\t}\n\n\t/**\n\t * `adaptorch_server_metrics` (read/local). Read redacted MCP server\n\t * metrics (tool-call counters, latency percentiles).\n\t */\n\tasync serverMetrics(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_server_metrics\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_capabilities` (read/local). Read supported synthesis\n\t * modes, connectors, and server features.\n\t */\n\tasync capabilities(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_capabilities\", {})) as Record<string, unknown>;\n\t}\n\n\t/**\n\t * `adaptorch_plan_catalog` (read/local). Read the hosted plan catalog\n\t * (Starter $0 / Pro $39 / Team $149).\n\t */\n\tasync planCatalog(): Promise<Record<string, unknown>> {\n\t\treturn (await this.transport.callTool(\"adaptorch_plan_catalog\", {})) as Record<string, unknown>;\n\t}\n}\n"]}

package/dist/types.d.ts

@@ -18,11 +18,10 @@ export type WorkPacketState = "DRAFTED" | "ROUTED" | "AWAITING_APPROVAL" | "DISP
  * single-call-vs-client-side-fanout ambiguity.
  */
 export type CardinalityMode = "single_call" | "fanout_n";
-/**
- * Part 1 §3.1 — the four topology classes `adaptorch_route_topology` can return for a
- * packet's payload, decided once per packet before any `adaptorch_run` call.
- */
-export type TopologyClassification = "singleton" | "pipeline" | "dag" | "ensemble";
+/** Current `adaptorch_route_topology` values, synchronized with AdaptOrch's `Topology` enum. */
+export declare const TOPOLOGY_CLASSIFICATIONS: readonly ["parallel", "sequential", "hierarchical", "hybrid", "multi_model_ensemble", "multi_turn_debate"];
+export type TopologyClassification = (typeof TOPOLOGY_CLASSIFICATIONS)[number];
+export declare function isTopologyClassification(value: unknown): value is TopologyClassification;
 /**
  * Part 1 §3.3 / §7 — one concrete submission attempt for a Work Packet. A Dispatch Record
  * holds a run_id *set* (not a single run_id) tagged with its cardinality mode, so polling,

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GACxB,SAAS,GACT,QAAQ,GACR,mBAAmB,GACnB,YAAY,GACZ,QAAQ,GACR,SAAS,GACT,cAAc,GACd,cAAc,GACd,qBAAqB,GACrB,WAAW,GACX,UAAU,GACV,cAAc,GACd,WAAW,GACX,QAAQ,CAAC;AAEZ;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GAAG,aAAa,GAAG,UAAU,CAAC;AAEzD;;;GAGG;AACH,MAAM,MAAM,sBAAsB,GAAG,WAAW,GAAG,UAAU,GAAG,KAAK,GAAG,UAAU,CAAC;AAEnF;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,eAAe,CAAC;IAClC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,UAAU,GAAG,SAAS,CAAC;IAC7B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IAClC,IAAI,EAAE,eAAe,CAAC;IACtB,EAAE,EAAE,eAAe,CAAC;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAU;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,iBAAiB,EAAE;QAClB,cAAc,EAAE,sBAAsB,CAAC;QACvC,UAAU,EAAE,MAAM,CAAC;QACnB,kBAAkB,EAAE,OAAO,CAAC;KAC5B,GAAG,IAAI,CAAC;IACT,gBAAgB,EAAE,cAAc,EAAE,CAAC;IACnC,KAAK,EAAE,eAAe,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,kBAAkB,EAAE,CAAC;IACrC,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,+GAA4G;IAC5G,cAAc,EAAE;QACf,qBAAqB,EAAE,MAAM,CAAC;QAC9B,sBAAsB,EAAE,MAAM,CAAC;KAC/B,CAAC;IACF;;;;;OAKG;IACH,2BAA2B,EAAE,OAAO,GAAG,IAAI,CAAC;CAC5C;AAED;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,GACjC,uBAAuB,GACvB,2BAA2B,GAC3B,mBAAmB,GACnB,sBAAsB,GACtB,kBAAkB,GAClB,kBAAkB,GAClB,gBAAgB,CAAC;AAEpB;;;;GAIG;AACH,MAAM,WAAW,UAAU;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,8FAA2F;IAC3F,gCAAgC,EAAE,MAAM,CAAC;IACzC,sEAAqE;IACrE,oBAAoB,EAAE,MAAM,CAAC;IAC7B,mHAAgH;IAChH,wBAAwB,EAAE,MAAM,CAAC;IACjC;;;;OAIG;IACH,2BAA2B,EAAE,MAAM,CAAC;IACpC;;;;OAIG;IACH,4BAA4B,EAAE;QAC7B,iGAAiG;QACjG,oBAAoB,EAAE,MAAM,CAAC;QAC7B,sFAAsF;QACtF,qBAAqB,EAAE,MAAM,CAAC;QAC9B,kGAAkG;QAClG,2BAA2B,EAAE,MAAM,CAAC;KACpC,CAAC;IACF;;;OAGG;IACH,kBAAkB,EAAE,OAAO,CAAC;IAC5B;;;;OAIG;IACH,yBAAyB,EAAE,eAAe,GAAG,IAAI,CAAC;CAClD;AAED;;;GAGG;AACH,eAAO,MAAM,WAAW,YAAY,CAAC;AACrC,eAAO,MAAM,iBAAiB,sBAAsB,CAAC;AACrD,eAAO,MAAM,YAAY,iBAAiB,CAAC;AAC3C,eAAO,MAAM,eAAe,oBAAoB,CAAC;AACjD,eAAO,MAAM,iBAAiB,kBAAkB,CAAC","sourcesContent":["/**\n * Design-fidelity note: this file implements the Work Packet on-disk schema and supporting\n * type vocabulary defined in Part 1 (`final-part1-core-algorithm.md`), Sections 1, 2, 3, 4,\n * and 7. It is an implementation of that document, not a restatement of it — see the design\n * doc for rationale, transition semantics, and the open questions left for other lanes.\n */\n\n/**\n * Work Packet lifecycle states.\n *\n * Part 1 §2 — the fourteen states of the packet-level state machine, including the\n * ESCALATED / AWAITING_APPROVAL / ADJUDICATION_FAILED additions from this revision.\n */\nexport type WorkPacketState =\n\t| \"DRAFTED\"\n\t| \"ROUTED\"\n\t| \"AWAITING_APPROVAL\"\n\t| \"DISPATCHED\"\n\t| \"ACTIVE\"\n\t| \"HALTING\"\n\t| \"RAW_TERMINAL\"\n\t| \"UNDER_REVIEW\"\n\t| \"ADJUDICATION_FAILED\"\n\t| \"CONFIRMED\"\n\t| \"DECLINED\"\n\t| \"RETRY_QUEUED\"\n\t| \"ESCALATED\"\n\t| \"CLOSED\";\n\n/**\n * Part 1 §3.3 — whether a Dispatch Record's run_id set was produced by a single\n * `adaptorch_run` call (`single_call`) or by N calls the loop itself issued (`fanout_n`).\n * This tag is what lets the rest of the state machine stay agnostic to the Section 3.2\n * single-call-vs-client-side-fanout ambiguity.\n */\nexport type CardinalityMode = \"single_call\" | \"fanout_n\";\n\n/**\n * Part 1 §3.1 — the four topology classes `adaptorch_route_topology` can return for a\n * packet's payload, decided once per packet before any `adaptorch_run` call.\n */\nexport type TopologyClassification = \"singleton\" | \"pipeline\" | \"dag\" | \"ensemble\";\n\n/**\n * Part 1 §3.3 / §7 — one concrete submission attempt for a Work Packet. A Dispatch Record\n * holds a run_id *set* (not a single run_id) tagged with its cardinality mode, so polling,\n * cancellation, and review packaging work the same way regardless of which Section 3.2\n * reading turns out to be correct.\n */\nexport interface DispatchRecord {\n\tattempt_n: number;\n\tcardinality_mode: CardinalityMode;\n\trun_ids: string[];\n\tsubmitted_at: string;\n\tmode: \"blocking\" | \"polling\";\n\tterminal_status?: string;\n\tterminal_at?: string;\n}\n\n/**\n * Part 1 §7 — one append-only entry in a Work Packet's transition log. Recorded for every\n * state change, including adjudication-call failures that have no `AdjudicationResult` to\n * archive elsewhere.\n */\nexport interface TransitionLogEntry {\n\tfrom: WorkPacketState;\n\tto: WorkPacketState;\n\tat: string;\n\tcause: string;\n}\n\n/**\n * Part 1 §1 / §7 — the Work Packet: the durable unit of intent this loop manages, potentially\n * resubmitted across several Dispatch Records over its life.\n *\n * The design doc (§7) also describes `adjudication_retry_count` (a separate bounded counter\n * for retrying the `adjudicate()` call itself, Part 1 §2/§6) and\n * `last_human_approved_topology_class` as persisted fields. Those are not modeled on this\n * type in this cut; a later change can add them without breaking the fields defined here.\n */\nexport interface WorkPacket {\n\tpacket_id: string;\n\tkind: string;\n\tcreated_at: string;\n\tpayload: unknown;\n\ttopology_decision: {\n\t\tclassification: TopologyClassification;\n\t\tdecided_at: string;\n\t\traw_route_response: unknown;\n\t} | null;\n\tdispatch_records: DispatchRecord[];\n\tstate: WorkPacketState;\n\tretry_count: number;\n\ttransition_log: TransitionLogEntry[];\n\tlast_adjudication_ref: string | null;\n\t/** Part 1 §4 — the per-packet attempt budget (`max_dispatch_attempts`) and how much of it has been used. */\n\tattempt_budget: {\n\t\tmax_dispatch_attempts: number;\n\t\tdispatch_attempts_used: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 / §7 — the payload most recently approved by a human reviewer (or the\n\t * original payload at creation, implicitly approved). `null` only if the packet has not yet\n\t * been assigned an initial baseline. Used by `requiresHumanApproval` to decide whether the\n\t * next attempt needs an AWAITING_APPROVAL gate before its first dispatch.\n\t */\n\tlast_human_approved_payload: unknown | null;\n}\n\n/**\n * Part 1 §4 — the named reasons the loop stops admitting new DRAFTED packets and begins\n * draining. `capacity_ceiling` and the cardinality-mismatch guard are soft governors (they\n * reduce admission/concurrency rather than terminating the loop outright); the others are\n * hard termination conditions.\n */\nexport type LoopTerminationCondition =\n\t| \"completion_exhaustion\"\n\t| \"per_packet_attempt_budget\"\n\t| \"wall_clock_budget\"\n\t| \"dispatch_call_budget\"\n\t| \"stagnation_guard\"\n\t| \"capacity_ceiling\"\n\t| \"external_abort\";\n\n/**\n * Part 1 §4 — loop-instance configuration. Per the \"Budget immutability\" rule in §4, every\n * field here is fixed at loop-instance creation and must not be mutated for that instance's\n * lifetime; raising a threshold requires starting a new loop instance.\n */\nexport interface LoopConfig {\n\tloop_instance_id: string;\n\t/** Part 1 §4 \"Per-packet attempt budget\" — illustrative default in the design doc is 3. */\n\tmax_dispatch_attempts_per_packet: number;\n\t/** Part 1 §4 \"Loop wall-clock budget\", expressed in milliseconds. */\n\tmax_loop_duration_ms: number;\n\t/** Part 1 §4 \"Loop dispatch-call budget\" — total `adaptorch_run` invocations allowed across the loop's life. */\n\tmax_total_dispatch_calls: number;\n\t/**\n\t * Part 1 §4 \"Stagnation guard\" — the number of consecutive loop-wide DECLINED verdicts\n\t * with indistinguishable evidence (same reason text / same evidence digest) that triggers\n\t * a halt.\n\t */\n\tstagnation_repeat_threshold: number;\n\t/**\n\t * Part 1 §4 \"Capacity ceiling (soft governor)\". Shape chosen for this implementation, not\n\t * dictated verbatim by the design doc: a saturation fraction/duration pair that must be\n\t * sustained before the governor engages, and the reduced concurrency ceiling it engages to.\n\t */\n\tcapacity_governor_thresholds: {\n\t\t/** Fraction (0-1) of `adaptorch_server_metrics` saturation considered \"sustained saturation\". */\n\t\tsaturation_threshold: number;\n\t\t/** How long saturation must persist, in milliseconds, before the governor engages. */\n\t\tsustained_duration_ms: number;\n\t\t/** Concurrency budget (max packets allowed into ACTIVE at once) while the governor is engaged. */\n\t\treduced_concurrency_ceiling: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 — the documented opt-in escape hatch that skips AWAITING_APPROVAL\n\t * for every attempt in this loop instance, regardless of payload/topology drift.\n\t */\n\tpre_approved_batch: boolean;\n\t/**\n\t * Part 1 §3.4 — the result of the one-time cardinality calibration probe, or `null` before\n\t * that probe has run. Continuously cross-checked (at zero extra call cost) against later\n\t * `adaptorch_get_run`/reconciliation-sweep observations per §3.4.\n\t */\n\tobserved_cardinality_mode: CardinalityMode | null;\n}\n\n/**\n * Part 1 §7 — on-disk file layout constants, rooted at a loop-instance directory. Exported so\n * other modules never hardcode these path segments.\n */\nexport const PACKETS_DIR = \"packets\";\nexport const PACKET_INDEX_FILE = \"packet_index.json\";\nexport const RUN_MAP_FILE = \"run_map.json\";\nexport const LOOP_STATE_FILE = \"loop_state.json\";\nexport const ADJUDICATIONS_DIR = \"adjudications\";\n"]}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GACxB,SAAS,GACT,QAAQ,GACR,mBAAmB,GACnB,YAAY,GACZ,QAAQ,GACR,SAAS,GACT,cAAc,GACd,cAAc,GACd,qBAAqB,GACrB,WAAW,GACX,UAAU,GACV,cAAc,GACd,WAAW,GACX,QAAQ,CAAC;AAEZ;;;;;GAKG;AACH,MAAM,MAAM,eAAe,GAAG,aAAa,GAAG,UAAU,CAAC;AAEzD,gGAAgG;AAChG,eAAO,MAAM,wBAAwB,4GAO3B,CAAC;AAEX,MAAM,MAAM,sBAAsB,GAAG,CAAC,OAAO,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC;AAI/E,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,sBAAsB,CAExF;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,eAAe,CAAC;IAClC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,UAAU,GAAG,SAAS,CAAC;IAC7B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IAClC,IAAI,EAAE,eAAe,CAAC;IACtB,EAAE,EAAE,eAAe,CAAC;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAU;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,iBAAiB,EAAE;QAClB,cAAc,EAAE,sBAAsB,CAAC;QACvC,UAAU,EAAE,MAAM,CAAC;QACnB,kBAAkB,EAAE,OAAO,CAAC;KAC5B,GAAG,IAAI,CAAC;IACT,gBAAgB,EAAE,cAAc,EAAE,CAAC;IACnC,KAAK,EAAE,eAAe,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,kBAAkB,EAAE,CAAC;IACrC,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,+GAA4G;IAC5G,cAAc,EAAE;QACf,qBAAqB,EAAE,MAAM,CAAC;QAC9B,sBAAsB,EAAE,MAAM,CAAC;KAC/B,CAAC;IACF;;;;;OAKG;IACH,2BAA2B,EAAE,OAAO,GAAG,IAAI,CAAC;CAC5C;AAED;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,GACjC,uBAAuB,GACvB,2BAA2B,GAC3B,mBAAmB,GACnB,sBAAsB,GACtB,kBAAkB,GAClB,kBAAkB,GAClB,gBAAgB,CAAC;AAEpB;;;;GAIG;AACH,MAAM,WAAW,UAAU;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,8FAA2F;IAC3F,gCAAgC,EAAE,MAAM,CAAC;IACzC,sEAAqE;IACrE,oBAAoB,EAAE,MAAM,CAAC;IAC7B,mHAAgH;IAChH,wBAAwB,EAAE,MAAM,CAAC;IACjC;;;;OAIG;IACH,2BAA2B,EAAE,MAAM,CAAC;IACpC;;;;OAIG;IACH,4BAA4B,EAAE;QAC7B,iGAAiG;QACjG,oBAAoB,EAAE,MAAM,CAAC;QAC7B,sFAAsF;QACtF,qBAAqB,EAAE,MAAM,CAAC;QAC9B,kGAAkG;QAClG,2BAA2B,EAAE,MAAM,CAAC;KACpC,CAAC;IACF;;;OAGG;IACH,kBAAkB,EAAE,OAAO,CAAC;IAC5B;;;;OAIG;IACH,yBAAyB,EAAE,eAAe,GAAG,IAAI,CAAC;CAClD;AAED;;;GAGG;AACH,eAAO,MAAM,WAAW,YAAY,CAAC;AACrC,eAAO,MAAM,iBAAiB,sBAAsB,CAAC;AACrD,eAAO,MAAM,YAAY,iBAAiB,CAAC;AAC3C,eAAO,MAAM,eAAe,oBAAoB,CAAC;AACjD,eAAO,MAAM,iBAAiB,kBAAkB,CAAC","sourcesContent":["/**\n * Design-fidelity note: this file implements the Work Packet on-disk schema and supporting\n * type vocabulary defined in Part 1 (`final-part1-core-algorithm.md`), Sections 1, 2, 3, 4,\n * and 7. It is an implementation of that document, not a restatement of it — see the design\n * doc for rationale, transition semantics, and the open questions left for other lanes.\n */\n\n/**\n * Work Packet lifecycle states.\n *\n * Part 1 §2 — the fourteen states of the packet-level state machine, including the\n * ESCALATED / AWAITING_APPROVAL / ADJUDICATION_FAILED additions from this revision.\n */\nexport type WorkPacketState =\n\t| \"DRAFTED\"\n\t| \"ROUTED\"\n\t| \"AWAITING_APPROVAL\"\n\t| \"DISPATCHED\"\n\t| \"ACTIVE\"\n\t| \"HALTING\"\n\t| \"RAW_TERMINAL\"\n\t| \"UNDER_REVIEW\"\n\t| \"ADJUDICATION_FAILED\"\n\t| \"CONFIRMED\"\n\t| \"DECLINED\"\n\t| \"RETRY_QUEUED\"\n\t| \"ESCALATED\"\n\t| \"CLOSED\";\n\n/**\n * Part 1 §3.3 — whether a Dispatch Record's run_id set was produced by a single\n * `adaptorch_run` call (`single_call`) or by N calls the loop itself issued (`fanout_n`).\n * This tag is what lets the rest of the state machine stay agnostic to the Section 3.2\n * single-call-vs-client-side-fanout ambiguity.\n */\nexport type CardinalityMode = \"single_call\" | \"fanout_n\";\n\n/** Current `adaptorch_route_topology` values, synchronized with AdaptOrch's `Topology` enum. */\nexport const TOPOLOGY_CLASSIFICATIONS = [\n\t\"parallel\",\n\t\"sequential\",\n\t\"hierarchical\",\n\t\"hybrid\",\n\t\"multi_model_ensemble\",\n\t\"multi_turn_debate\",\n] as const;\n\nexport type TopologyClassification = (typeof TOPOLOGY_CLASSIFICATIONS)[number];\n\nconst TOPOLOGY_CLASSIFICATION_SET: ReadonlySet<string> = new Set(TOPOLOGY_CLASSIFICATIONS);\n\nexport function isTopologyClassification(value: unknown): value is TopologyClassification {\n\treturn typeof value === \"string\" && TOPOLOGY_CLASSIFICATION_SET.has(value);\n}\n\n/**\n * Part 1 §3.3 / §7 — one concrete submission attempt for a Work Packet. A Dispatch Record\n * holds a run_id *set* (not a single run_id) tagged with its cardinality mode, so polling,\n * cancellation, and review packaging work the same way regardless of which Section 3.2\n * reading turns out to be correct.\n */\nexport interface DispatchRecord {\n\tattempt_n: number;\n\tcardinality_mode: CardinalityMode;\n\trun_ids: string[];\n\tsubmitted_at: string;\n\tmode: \"blocking\" | \"polling\";\n\tterminal_status?: string;\n\tterminal_at?: string;\n}\n\n/**\n * Part 1 §7 — one append-only entry in a Work Packet's transition log. Recorded for every\n * state change, including adjudication-call failures that have no `AdjudicationResult` to\n * archive elsewhere.\n */\nexport interface TransitionLogEntry {\n\tfrom: WorkPacketState;\n\tto: WorkPacketState;\n\tat: string;\n\tcause: string;\n}\n\n/**\n * Part 1 §1 / §7 — the Work Packet: the durable unit of intent this loop manages, potentially\n * resubmitted across several Dispatch Records over its life.\n *\n * The design doc (§7) also describes `adjudication_retry_count` (a separate bounded counter\n * for retrying the `adjudicate()` call itself, Part 1 §2/§6) and\n * `last_human_approved_topology_class` as persisted fields. Those are not modeled on this\n * type in this cut; a later change can add them without breaking the fields defined here.\n */\nexport interface WorkPacket {\n\tpacket_id: string;\n\tkind: string;\n\tcreated_at: string;\n\tpayload: unknown;\n\ttopology_decision: {\n\t\tclassification: TopologyClassification;\n\t\tdecided_at: string;\n\t\traw_route_response: unknown;\n\t} | null;\n\tdispatch_records: DispatchRecord[];\n\tstate: WorkPacketState;\n\tretry_count: number;\n\ttransition_log: TransitionLogEntry[];\n\tlast_adjudication_ref: string | null;\n\t/** Part 1 §4 — the per-packet attempt budget (`max_dispatch_attempts`) and how much of it has been used. */\n\tattempt_budget: {\n\t\tmax_dispatch_attempts: number;\n\t\tdispatch_attempts_used: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 / §7 — the payload most recently approved by a human reviewer (or the\n\t * original payload at creation, implicitly approved). `null` only if the packet has not yet\n\t * been assigned an initial baseline. Used by `requiresHumanApproval` to decide whether the\n\t * next attempt needs an AWAITING_APPROVAL gate before its first dispatch.\n\t */\n\tlast_human_approved_payload: unknown | null;\n}\n\n/**\n * Part 1 §4 — the named reasons the loop stops admitting new DRAFTED packets and begins\n * draining. `capacity_ceiling` and the cardinality-mismatch guard are soft governors (they\n * reduce admission/concurrency rather than terminating the loop outright); the others are\n * hard termination conditions.\n */\nexport type LoopTerminationCondition =\n\t| \"completion_exhaustion\"\n\t| \"per_packet_attempt_budget\"\n\t| \"wall_clock_budget\"\n\t| \"dispatch_call_budget\"\n\t| \"stagnation_guard\"\n\t| \"capacity_ceiling\"\n\t| \"external_abort\";\n\n/**\n * Part 1 §4 — loop-instance configuration. Per the \"Budget immutability\" rule in §4, every\n * field here is fixed at loop-instance creation and must not be mutated for that instance's\n * lifetime; raising a threshold requires starting a new loop instance.\n */\nexport interface LoopConfig {\n\tloop_instance_id: string;\n\t/** Part 1 §4 \"Per-packet attempt budget\" — illustrative default in the design doc is 3. */\n\tmax_dispatch_attempts_per_packet: number;\n\t/** Part 1 §4 \"Loop wall-clock budget\", expressed in milliseconds. */\n\tmax_loop_duration_ms: number;\n\t/** Part 1 §4 \"Loop dispatch-call budget\" — total `adaptorch_run` invocations allowed across the loop's life. */\n\tmax_total_dispatch_calls: number;\n\t/**\n\t * Part 1 §4 \"Stagnation guard\" — the number of consecutive loop-wide DECLINED verdicts\n\t * with indistinguishable evidence (same reason text / same evidence digest) that triggers\n\t * a halt.\n\t */\n\tstagnation_repeat_threshold: number;\n\t/**\n\t * Part 1 §4 \"Capacity ceiling (soft governor)\". Shape chosen for this implementation, not\n\t * dictated verbatim by the design doc: a saturation fraction/duration pair that must be\n\t * sustained before the governor engages, and the reduced concurrency ceiling it engages to.\n\t */\n\tcapacity_governor_thresholds: {\n\t\t/** Fraction (0-1) of `adaptorch_server_metrics` saturation considered \"sustained saturation\". */\n\t\tsaturation_threshold: number;\n\t\t/** How long saturation must persist, in milliseconds, before the governor engages. */\n\t\tsustained_duration_ms: number;\n\t\t/** Concurrency budget (max packets allowed into ACTIVE at once) while the governor is engaged. */\n\t\treduced_concurrency_ceiling: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 — the documented opt-in escape hatch that skips AWAITING_APPROVAL\n\t * for every attempt in this loop instance, regardless of payload/topology drift.\n\t */\n\tpre_approved_batch: boolean;\n\t/**\n\t * Part 1 §3.4 — the result of the one-time cardinality calibration probe, or `null` before\n\t * that probe has run. Continuously cross-checked (at zero extra call cost) against later\n\t * `adaptorch_get_run`/reconciliation-sweep observations per §3.4.\n\t */\n\tobserved_cardinality_mode: CardinalityMode | null;\n}\n\n/**\n * Part 1 §7 — on-disk file layout constants, rooted at a loop-instance directory. Exported so\n * other modules never hardcode these path segments.\n */\nexport const PACKETS_DIR = \"packets\";\nexport const PACKET_INDEX_FILE = \"packet_index.json\";\nexport const RUN_MAP_FILE = \"run_map.json\";\nexport const LOOP_STATE_FILE = \"loop_state.json\";\nexport const ADJUDICATIONS_DIR = \"adjudications\";\n"]}

package/dist/types.js

@@ -4,6 +4,19 @@
  * and 7. It is an implementation of that document, not a restatement of it — see the design
  * doc for rationale, transition semantics, and the open questions left for other lanes.
  */
+/** Current `adaptorch_route_topology` values, synchronized with AdaptOrch's `Topology` enum. */
+export const TOPOLOGY_CLASSIFICATIONS = [
+    "parallel",
+    "sequential",
+    "hierarchical",
+    "hybrid",
+    "multi_model_ensemble",
+    "multi_turn_debate",
+];
+const TOPOLOGY_CLASSIFICATION_SET = new Set(TOPOLOGY_CLASSIFICATIONS);
+export function isTopologyClassification(value) {
+    return typeof value === "string" && TOPOLOGY_CLASSIFICATION_SET.has(value);
+}
 /**
  * Part 1 §7 — on-disk file layout constants, rooted at a loop-instance directory. Exported so
  * other modules never hardcode these path segments.

package/dist/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAoKH;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,SAAS,CAAC;AACrC,MAAM,CAAC,MAAM,iBAAiB,GAAG,mBAAmB,CAAC;AACrD,MAAM,CAAC,MAAM,YAAY,GAAG,cAAc,CAAC;AAC3C,MAAM,CAAC,MAAM,eAAe,GAAG,iBAAiB,CAAC;AACjD,MAAM,CAAC,MAAM,iBAAiB,GAAG,eAAe,CAAC","sourcesContent":["/**\n * Design-fidelity note: this file implements the Work Packet on-disk schema and supporting\n * type vocabulary defined in Part 1 (`final-part1-core-algorithm.md`), Sections 1, 2, 3, 4,\n * and 7. It is an implementation of that document, not a restatement of it — see the design\n * doc for rationale, transition semantics, and the open questions left for other lanes.\n */\n\n/**\n * Work Packet lifecycle states.\n *\n * Part 1 §2 — the fourteen states of the packet-level state machine, including the\n * ESCALATED / AWAITING_APPROVAL / ADJUDICATION_FAILED additions from this revision.\n */\nexport type WorkPacketState =\n\t| \"DRAFTED\"\n\t| \"ROUTED\"\n\t| \"AWAITING_APPROVAL\"\n\t| \"DISPATCHED\"\n\t| \"ACTIVE\"\n\t| \"HALTING\"\n\t| \"RAW_TERMINAL\"\n\t| \"UNDER_REVIEW\"\n\t| \"ADJUDICATION_FAILED\"\n\t| \"CONFIRMED\"\n\t| \"DECLINED\"\n\t| \"RETRY_QUEUED\"\n\t| \"ESCALATED\"\n\t| \"CLOSED\";\n\n/**\n * Part 1 §3.3 — whether a Dispatch Record's run_id set was produced by a single\n * `adaptorch_run` call (`single_call`) or by N calls the loop itself issued (`fanout_n`).\n * This tag is what lets the rest of the state machine stay agnostic to the Section 3.2\n * single-call-vs-client-side-fanout ambiguity.\n */\nexport type CardinalityMode = \"single_call\" | \"fanout_n\";\n\n/**\n * Part 1 §3.1 — the four topology classes `adaptorch_route_topology` can return for a\n * packet's payload, decided once per packet before any `adaptorch_run` call.\n */\nexport type TopologyClassification = \"singleton\" | \"pipeline\" | \"dag\" | \"ensemble\";\n\n/**\n * Part 1 §3.3 / §7 — one concrete submission attempt for a Work Packet. A Dispatch Record\n * holds a run_id *set* (not a single run_id) tagged with its cardinality mode, so polling,\n * cancellation, and review packaging work the same way regardless of which Section 3.2\n * reading turns out to be correct.\n */\nexport interface DispatchRecord {\n\tattempt_n: number;\n\tcardinality_mode: CardinalityMode;\n\trun_ids: string[];\n\tsubmitted_at: string;\n\tmode: \"blocking\" | \"polling\";\n\tterminal_status?: string;\n\tterminal_at?: string;\n}\n\n/**\n * Part 1 §7 — one append-only entry in a Work Packet's transition log. Recorded for every\n * state change, including adjudication-call failures that have no `AdjudicationResult` to\n * archive elsewhere.\n */\nexport interface TransitionLogEntry {\n\tfrom: WorkPacketState;\n\tto: WorkPacketState;\n\tat: string;\n\tcause: string;\n}\n\n/**\n * Part 1 §1 / §7 — the Work Packet: the durable unit of intent this loop manages, potentially\n * resubmitted across several Dispatch Records over its life.\n *\n * The design doc (§7) also describes `adjudication_retry_count` (a separate bounded counter\n * for retrying the `adjudicate()` call itself, Part 1 §2/§6) and\n * `last_human_approved_topology_class` as persisted fields. Those are not modeled on this\n * type in this cut; a later change can add them without breaking the fields defined here.\n */\nexport interface WorkPacket {\n\tpacket_id: string;\n\tkind: string;\n\tcreated_at: string;\n\tpayload: unknown;\n\ttopology_decision: {\n\t\tclassification: TopologyClassification;\n\t\tdecided_at: string;\n\t\traw_route_response: unknown;\n\t} | null;\n\tdispatch_records: DispatchRecord[];\n\tstate: WorkPacketState;\n\tretry_count: number;\n\ttransition_log: TransitionLogEntry[];\n\tlast_adjudication_ref: string | null;\n\t/** Part 1 §4 — the per-packet attempt budget (`max_dispatch_attempts`) and how much of it has been used. */\n\tattempt_budget: {\n\t\tmax_dispatch_attempts: number;\n\t\tdispatch_attempts_used: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 / §7 — the payload most recently approved by a human reviewer (or the\n\t * original payload at creation, implicitly approved). `null` only if the packet has not yet\n\t * been assigned an initial baseline. Used by `requiresHumanApproval` to decide whether the\n\t * next attempt needs an AWAITING_APPROVAL gate before its first dispatch.\n\t */\n\tlast_human_approved_payload: unknown | null;\n}\n\n/**\n * Part 1 §4 — the named reasons the loop stops admitting new DRAFTED packets and begins\n * draining. `capacity_ceiling` and the cardinality-mismatch guard are soft governors (they\n * reduce admission/concurrency rather than terminating the loop outright); the others are\n * hard termination conditions.\n */\nexport type LoopTerminationCondition =\n\t| \"completion_exhaustion\"\n\t| \"per_packet_attempt_budget\"\n\t| \"wall_clock_budget\"\n\t| \"dispatch_call_budget\"\n\t| \"stagnation_guard\"\n\t| \"capacity_ceiling\"\n\t| \"external_abort\";\n\n/**\n * Part 1 §4 — loop-instance configuration. Per the \"Budget immutability\" rule in §4, every\n * field here is fixed at loop-instance creation and must not be mutated for that instance's\n * lifetime; raising a threshold requires starting a new loop instance.\n */\nexport interface LoopConfig {\n\tloop_instance_id: string;\n\t/** Part 1 §4 \"Per-packet attempt budget\" — illustrative default in the design doc is 3. */\n\tmax_dispatch_attempts_per_packet: number;\n\t/** Part 1 §4 \"Loop wall-clock budget\", expressed in milliseconds. */\n\tmax_loop_duration_ms: number;\n\t/** Part 1 §4 \"Loop dispatch-call budget\" — total `adaptorch_run` invocations allowed across the loop's life. */\n\tmax_total_dispatch_calls: number;\n\t/**\n\t * Part 1 §4 \"Stagnation guard\" — the number of consecutive loop-wide DECLINED verdicts\n\t * with indistinguishable evidence (same reason text / same evidence digest) that triggers\n\t * a halt.\n\t */\n\tstagnation_repeat_threshold: number;\n\t/**\n\t * Part 1 §4 \"Capacity ceiling (soft governor)\". Shape chosen for this implementation, not\n\t * dictated verbatim by the design doc: a saturation fraction/duration pair that must be\n\t * sustained before the governor engages, and the reduced concurrency ceiling it engages to.\n\t */\n\tcapacity_governor_thresholds: {\n\t\t/** Fraction (0-1) of `adaptorch_server_metrics` saturation considered \"sustained saturation\". */\n\t\tsaturation_threshold: number;\n\t\t/** How long saturation must persist, in milliseconds, before the governor engages. */\n\t\tsustained_duration_ms: number;\n\t\t/** Concurrency budget (max packets allowed into ACTIVE at once) while the governor is engaged. */\n\t\treduced_concurrency_ceiling: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 — the documented opt-in escape hatch that skips AWAITING_APPROVAL\n\t * for every attempt in this loop instance, regardless of payload/topology drift.\n\t */\n\tpre_approved_batch: boolean;\n\t/**\n\t * Part 1 §3.4 — the result of the one-time cardinality calibration probe, or `null` before\n\t * that probe has run. Continuously cross-checked (at zero extra call cost) against later\n\t * `adaptorch_get_run`/reconciliation-sweep observations per §3.4.\n\t */\n\tobserved_cardinality_mode: CardinalityMode | null;\n}\n\n/**\n * Part 1 §7 — on-disk file layout constants, rooted at a loop-instance directory. Exported so\n * other modules never hardcode these path segments.\n */\nexport const PACKETS_DIR = \"packets\";\nexport const PACKET_INDEX_FILE = \"packet_index.json\";\nexport const RUN_MAP_FILE = \"run_map.json\";\nexport const LOOP_STATE_FILE = \"loop_state.json\";\nexport const ADJUDICATIONS_DIR = \"adjudications\";\n"]}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAgCH,gGAAgG;AAChG,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACvC,UAAU;IACV,YAAY;IACZ,cAAc;IACd,QAAQ;IACR,sBAAsB;IACtB,mBAAmB;CACV,CAAC;AAIX,MAAM,2BAA2B,GAAwB,IAAI,GAAG,CAAC,wBAAwB,CAAC,CAAC;AAE3F,MAAM,UAAU,wBAAwB,CAAC,KAAc,EAAmC;IACzF,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,2BAA2B,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAAA,CAC3E;AAgID;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,SAAS,CAAC;AACrC,MAAM,CAAC,MAAM,iBAAiB,GAAG,mBAAmB,CAAC;AACrD,MAAM,CAAC,MAAM,YAAY,GAAG,cAAc,CAAC;AAC3C,MAAM,CAAC,MAAM,eAAe,GAAG,iBAAiB,CAAC;AACjD,MAAM,CAAC,MAAM,iBAAiB,GAAG,eAAe,CAAC","sourcesContent":["/**\n * Design-fidelity note: this file implements the Work Packet on-disk schema and supporting\n * type vocabulary defined in Part 1 (`final-part1-core-algorithm.md`), Sections 1, 2, 3, 4,\n * and 7. It is an implementation of that document, not a restatement of it — see the design\n * doc for rationale, transition semantics, and the open questions left for other lanes.\n */\n\n/**\n * Work Packet lifecycle states.\n *\n * Part 1 §2 — the fourteen states of the packet-level state machine, including the\n * ESCALATED / AWAITING_APPROVAL / ADJUDICATION_FAILED additions from this revision.\n */\nexport type WorkPacketState =\n\t| \"DRAFTED\"\n\t| \"ROUTED\"\n\t| \"AWAITING_APPROVAL\"\n\t| \"DISPATCHED\"\n\t| \"ACTIVE\"\n\t| \"HALTING\"\n\t| \"RAW_TERMINAL\"\n\t| \"UNDER_REVIEW\"\n\t| \"ADJUDICATION_FAILED\"\n\t| \"CONFIRMED\"\n\t| \"DECLINED\"\n\t| \"RETRY_QUEUED\"\n\t| \"ESCALATED\"\n\t| \"CLOSED\";\n\n/**\n * Part 1 §3.3 — whether a Dispatch Record's run_id set was produced by a single\n * `adaptorch_run` call (`single_call`) or by N calls the loop itself issued (`fanout_n`).\n * This tag is what lets the rest of the state machine stay agnostic to the Section 3.2\n * single-call-vs-client-side-fanout ambiguity.\n */\nexport type CardinalityMode = \"single_call\" | \"fanout_n\";\n\n/** Current `adaptorch_route_topology` values, synchronized with AdaptOrch's `Topology` enum. */\nexport const TOPOLOGY_CLASSIFICATIONS = [\n\t\"parallel\",\n\t\"sequential\",\n\t\"hierarchical\",\n\t\"hybrid\",\n\t\"multi_model_ensemble\",\n\t\"multi_turn_debate\",\n] as const;\n\nexport type TopologyClassification = (typeof TOPOLOGY_CLASSIFICATIONS)[number];\n\nconst TOPOLOGY_CLASSIFICATION_SET: ReadonlySet<string> = new Set(TOPOLOGY_CLASSIFICATIONS);\n\nexport function isTopologyClassification(value: unknown): value is TopologyClassification {\n\treturn typeof value === \"string\" && TOPOLOGY_CLASSIFICATION_SET.has(value);\n}\n\n/**\n * Part 1 §3.3 / §7 — one concrete submission attempt for a Work Packet. A Dispatch Record\n * holds a run_id *set* (not a single run_id) tagged with its cardinality mode, so polling,\n * cancellation, and review packaging work the same way regardless of which Section 3.2\n * reading turns out to be correct.\n */\nexport interface DispatchRecord {\n\tattempt_n: number;\n\tcardinality_mode: CardinalityMode;\n\trun_ids: string[];\n\tsubmitted_at: string;\n\tmode: \"blocking\" | \"polling\";\n\tterminal_status?: string;\n\tterminal_at?: string;\n}\n\n/**\n * Part 1 §7 — one append-only entry in a Work Packet's transition log. Recorded for every\n * state change, including adjudication-call failures that have no `AdjudicationResult` to\n * archive elsewhere.\n */\nexport interface TransitionLogEntry {\n\tfrom: WorkPacketState;\n\tto: WorkPacketState;\n\tat: string;\n\tcause: string;\n}\n\n/**\n * Part 1 §1 / §7 — the Work Packet: the durable unit of intent this loop manages, potentially\n * resubmitted across several Dispatch Records over its life.\n *\n * The design doc (§7) also describes `adjudication_retry_count` (a separate bounded counter\n * for retrying the `adjudicate()` call itself, Part 1 §2/§6) and\n * `last_human_approved_topology_class` as persisted fields. Those are not modeled on this\n * type in this cut; a later change can add them without breaking the fields defined here.\n */\nexport interface WorkPacket {\n\tpacket_id: string;\n\tkind: string;\n\tcreated_at: string;\n\tpayload: unknown;\n\ttopology_decision: {\n\t\tclassification: TopologyClassification;\n\t\tdecided_at: string;\n\t\traw_route_response: unknown;\n\t} | null;\n\tdispatch_records: DispatchRecord[];\n\tstate: WorkPacketState;\n\tretry_count: number;\n\ttransition_log: TransitionLogEntry[];\n\tlast_adjudication_ref: string | null;\n\t/** Part 1 §4 — the per-packet attempt budget (`max_dispatch_attempts`) and how much of it has been used. */\n\tattempt_budget: {\n\t\tmax_dispatch_attempts: number;\n\t\tdispatch_attempts_used: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 / §7 — the payload most recently approved by a human reviewer (or the\n\t * original payload at creation, implicitly approved). `null` only if the packet has not yet\n\t * been assigned an initial baseline. Used by `requiresHumanApproval` to decide whether the\n\t * next attempt needs an AWAITING_APPROVAL gate before its first dispatch.\n\t */\n\tlast_human_approved_payload: unknown | null;\n}\n\n/**\n * Part 1 §4 — the named reasons the loop stops admitting new DRAFTED packets and begins\n * draining. `capacity_ceiling` and the cardinality-mismatch guard are soft governors (they\n * reduce admission/concurrency rather than terminating the loop outright); the others are\n * hard termination conditions.\n */\nexport type LoopTerminationCondition =\n\t| \"completion_exhaustion\"\n\t| \"per_packet_attempt_budget\"\n\t| \"wall_clock_budget\"\n\t| \"dispatch_call_budget\"\n\t| \"stagnation_guard\"\n\t| \"capacity_ceiling\"\n\t| \"external_abort\";\n\n/**\n * Part 1 §4 — loop-instance configuration. Per the \"Budget immutability\" rule in §4, every\n * field here is fixed at loop-instance creation and must not be mutated for that instance's\n * lifetime; raising a threshold requires starting a new loop instance.\n */\nexport interface LoopConfig {\n\tloop_instance_id: string;\n\t/** Part 1 §4 \"Per-packet attempt budget\" — illustrative default in the design doc is 3. */\n\tmax_dispatch_attempts_per_packet: number;\n\t/** Part 1 §4 \"Loop wall-clock budget\", expressed in milliseconds. */\n\tmax_loop_duration_ms: number;\n\t/** Part 1 §4 \"Loop dispatch-call budget\" — total `adaptorch_run` invocations allowed across the loop's life. */\n\tmax_total_dispatch_calls: number;\n\t/**\n\t * Part 1 §4 \"Stagnation guard\" — the number of consecutive loop-wide DECLINED verdicts\n\t * with indistinguishable evidence (same reason text / same evidence digest) that triggers\n\t * a halt.\n\t */\n\tstagnation_repeat_threshold: number;\n\t/**\n\t * Part 1 §4 \"Capacity ceiling (soft governor)\". Shape chosen for this implementation, not\n\t * dictated verbatim by the design doc: a saturation fraction/duration pair that must be\n\t * sustained before the governor engages, and the reduced concurrency ceiling it engages to.\n\t */\n\tcapacity_governor_thresholds: {\n\t\t/** Fraction (0-1) of `adaptorch_server_metrics` saturation considered \"sustained saturation\". */\n\t\tsaturation_threshold: number;\n\t\t/** How long saturation must persist, in milliseconds, before the governor engages. */\n\t\tsustained_duration_ms: number;\n\t\t/** Concurrency budget (max packets allowed into ACTIVE at once) while the governor is engaged. */\n\t\treduced_concurrency_ceiling: number;\n\t};\n\t/**\n\t * Part 1 §2 state 3 — the documented opt-in escape hatch that skips AWAITING_APPROVAL\n\t * for every attempt in this loop instance, regardless of payload/topology drift.\n\t */\n\tpre_approved_batch: boolean;\n\t/**\n\t * Part 1 §3.4 — the result of the one-time cardinality calibration probe, or `null` before\n\t * that probe has run. Continuously cross-checked (at zero extra call cost) against later\n\t * `adaptorch_get_run`/reconciliation-sweep observations per §3.4.\n\t */\n\tobserved_cardinality_mode: CardinalityMode | null;\n}\n\n/**\n * Part 1 §7 — on-disk file layout constants, rooted at a loop-instance directory. Exported so\n * other modules never hardcode these path segments.\n */\nexport const PACKETS_DIR = \"packets\";\nexport const PACKET_INDEX_FILE = \"packet_index.json\";\nexport const RUN_MAP_FILE = \"run_map.json\";\nexport const LOOP_STATE_FILE = \"loop_state.json\";\nexport const ADJUDICATIONS_DIR = \"adjudications\";\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "omk-adaptorch-wpl",
-	"version": "0.96.2",
+	"version": "0.97.0",
 	"description": "AdaptOrch-native Work Packet Loop (WPL) — state machine, verification layer, and integration bridge for OMK orchestration.",
 	"type": "module",
 	"main": "./dist/index.js",