omk-adaptorch-wpl 0.91.0

package/README.md

@@ -0,0 +1,49 @@
+# omk-adaptorch-wpl
+
+> **Status**: Stable (v0.90.9). Wired into `open-multi-agent-kit` as a workspace dependency.
+> This package implements the AdaptOrch-native Work Packet Loop (WPL) design, an original
+> execution loop whose only work-producing action is AdaptOrch's `adaptorch_run` tool. See
+> [AdaptOrch](https://adaptorch.com) for the backend product this integrates with; AdaptOrch is
+> still under active development and this integration currently targets its free **Start** tier.
+
+## Design documents
+
+The full design (state machine, verification layer, integration mapping, and the adversarial
+review that shaped the safety gates below) lives outside this package at
+`.omk/runs/adaptorch-native-loop-algorithm-20260701/`:
+
+- `final-part1-core-algorithm.md` — Work Packet state machine, termination conditions, cancellation policy
+- `final-part2-verification-layer.md` — the Outcome Adjudicator (5-state verification)
+- `final-part3-integration.md` — the projection/bridge between the two
+
+## Modules
+
+- `src/types.ts` — Work Packet, Dispatch Record, state enums (as string literal unions), on-disk schema types
+- `src/state-machine.ts` — the packet lifecycle state machine and transition guards
+- `src/adaptorch-client.ts` — thin typed wrapper around AdaptOrch's 10 MCP tools
+- `src/adjudicator.ts` + `src/adjudicator-registry.ts` — the Outcome Adjudicator and its per-`kind` registry
+- `src/loop.ts` — the integration layer wiring the state machine, AdaptOrch client, and adjudicator together
+- `src/b2c-mapper.ts` — B2C (Bridge-to-Code) mapping for patch-apply safety
+- `src/b2c-verdict.ts` — Verdict card schema for correctness wall decisions
+- `src/deep-wall.ts` — Deep verification wall for multi-runner evidence gating
+- `src/receipt-signature.ts` — Cryptographic receipt signing for verification evidence
+
+## Integration
+
+The coding-agent consumes this package via:
+
+- `packages/coding-agent/src/core/adaptorch-bridge.ts` — advisory-only bridge (default-off,
+  circuit-breaker protected, TTL-cached). Provides `getFreshHint` (sync, cache-read-only) and
+  `requestRefresh` (fire-and-forget) for the reasoning router's turn-start path.
+- `packages/coding-agent/docs/adaptorch-preview.md` — read-first planning pipeline spec.
+
+## Safety notes (do not remove without updating the design docs)
+
+- `ESCALATED` packets never resume automatically; only an explicit external unblock signal moves them on.
+- The first Dispatch Record of any payload that differs from the last human-approved baseline
+  (an `augmented_payload` was applied, or a `REROUTE` changed topology) requires human approval
+  (`AWAITING_APPROVAL`), unless the loop is explicitly launched in pre-approved-batch mode.
+- Loop-level budgets (`max_dispatch_attempts`, `max_loop_duration`, dispatch-call budget) are
+  immutable for a loop instance's lifetime; raising them requires a new instance under the same review.
+
+Preview spec: [`../coding-agent/docs/adaptorch-preview.md`](../coding-agent/docs/adaptorch-preview.md)

package/dist/adaptorch-client.d.ts

@@ -0,0 +1,184 @@
+/**
+ * AdaptOrch MCP client wrapper.
+ *
+ * Design-stage / experimental: this module has no production
+ * `AdaptOrchTransport` implementation wired in yet. Callers must supply
+ * their own transport (e.g. an adapter around an MCP SDK client) until one
+ * ships in this package.
+ *
+ * Tool surface, names, and read/write classification are grounded in
+ * `.omk/runs/lazycodex-adaptorch-loop-plan-20260701/lane2-adaptorch-tool-surface.md`,
+ * which cross-checks the real AdaptOrch MCP server against
+ * `docs/tools.md`, `README.md`, `mcp_server.py` dispatch, and
+ * `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";
+/**
+ * Abstract transport for invoking AdaptOrch MCP tools by name.
+ *
+ * See doc section "The real, current 10-tool MCP surface (grouped)". No
+ * concrete implementation ships with this package yet; a caller must
+ * provide one (e.g. wrapping an MCP SDK client's `callTool`).
+ */
+export interface AdaptOrchTransport {
+    callTool(name: string, args: Record<string, unknown>): Promise<unknown>;
+}
+/**
+ * Payload accepted by `adaptorch_run`.
+ *
+ * See doc section "Run / lifecycle (submit, inspect, list, cancel)":
+ * `adaptorch_run` submits a task payload (prompt/context/raw payload,
+ * connector, synthesis mode, budget policy) to the control-plane, and can
+ * optionally block until the run reaches a terminal status.
+ */
+export interface AdaptOrchRunPayload {
+    taskPayload: unknown;
+    connector?: string;
+    synthesisMode?: string;
+    budgetPolicy?: unknown;
+    waitForTerminal?: boolean;
+    timeoutSeconds?: number;
+    pollIntervalSeconds?: number;
+}
+/**
+ * Result of `adaptorch_run`.
+ *
+ * Shape is inferred from the doc's description of the tool's purpose, not
+ * guaranteed by an official schema.
+ */
+export interface AdaptOrchRunResult {
+    run_id: string;
+    status?: string;
+}
+/**
+ * Result of `adaptorch_get_run`.
+ *
+ * Shape is inferred from the doc's description ("fetch a run summary by
+ * run_id"), not guaranteed by an official schema; extra fields are
+ * expected to vary by connector/synthesis mode.
+ */
+export interface AdaptOrchRunSummary {
+    run_id: string;
+    status: string;
+    [key: string]: unknown;
+}
+/**
+ * Entry in the result of `adaptorch_list_runs`.
+ *
+ * Shape is inferred, not guaranteed by an official schema.
+ */
+export interface AdaptOrchRunListEntry {
+    run_id: string;
+    status: string;
+}
+/**
+ * Result of `adaptorch_cancel_run`.
+ *
+ * Shape is inferred from the doc's description ("request cancellation of
+ * an in-flight run by run_id"), not guaranteed by an official schema.
+ */
+export interface AdaptOrchCancelResult {
+    run_id: string;
+    cancelled: boolean;
+}
+/**
+ * Entry in the result of `adaptorch_get_artifacts`.
+ *
+ * Shape is inferred from the doc's description ("fetch artifact metadata
+ * for a run"), not guaranteed by an official schema.
+ */
+export interface AdaptOrchArtifact {
+    path: string;
+    size_bytes?: number;
+    created_at?: string;
+    [key: string]: unknown;
+}
+/**
+ * Entry in the result of `adaptorch_get_traces`.
+ *
+ * Shape is inferred from the doc's description ("fetch execution traces
+ * for a run by run_id"), not guaranteed by an official schema.
+ */
+export interface AdaptOrchTraceSpan {
+    span_id?: string;
+    kind?: string;
+    severity?: string;
+    [key: string]: unknown;
+}
+/**
+ * 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.
+ */
+export interface AdaptOrchRouteTopologyResult {
+    classification: TopologyClassification;
+    raw: unknown;
+}
+/**
+ * Typed wrapper around the 10 real AdaptOrch MCP tools.
+ *
+ * See doc section "The real, current 10-tool MCP surface (grouped)" for
+ * the full tool list, purposes, and read/write classification. This
+ * class only translates method calls into `transport.callTool` calls
+ * with the exact tool names the doc lists; it does not implement a
+ * transport itself.
+ */
+export declare class AdaptOrchClient {
+    private readonly transport;
+    constructor(transport: AdaptOrchTransport);
+    /**
+     * `adaptorch_run` (write). Submit a task payload to the control-plane,
+     * optionally blocking until the run reaches a terminal status.
+     */
+    run(payload: AdaptOrchRunPayload): Promise<AdaptOrchRunResult>;
+    /**
+     * `adaptorch_get_run` (read). Fetch a run summary by `run_id`.
+     */
+    getRun(runId: string): Promise<AdaptOrchRunSummary>;
+    /**
+     * `adaptorch_list_runs` (read). List recent control-plane runs.
+     */
+    listRuns(params?: {
+        limit?: number;
+    }): Promise<AdaptOrchRunListEntry[]>;
+    /**
+     * `adaptorch_cancel_run` (write). Request cancellation of an in-flight
+     * run by `run_id`.
+     */
+    cancelRun(runId: string): Promise<AdaptOrchCancelResult>;
+    /**
+     * `adaptorch_get_artifacts` (read). Fetch artifact metadata for a run.
+     */
+    getArtifacts(runId: string): Promise<AdaptOrchArtifact[]>;
+    /**
+     * `adaptorch_get_traces` (read). Fetch execution traces for a run by
+     * `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.
+     */
+    routeTopology(payloadShape: unknown): Promise<AdaptOrchRouteTopologyResult>;
+    /**
+     * `adaptorch_server_metrics` (read/local). Read redacted MCP server
+     * metrics (tool-call counters, latency percentiles).
+     */
+    serverMetrics(): Promise<Record<string, unknown>>;
+    /**
+     * `adaptorch_capabilities` (read/local). Read supported synthesis
+     * modes, connectors, and server features.
+     */
+    capabilities(): Promise<Record<string, unknown>>;
+    /**
+     * `adaptorch_plan_catalog` (read/local). Read the hosted plan catalog
+     * (Starter $0 / Pro $39 / Team $149).
+     */
+    planCatalog(): Promise<Record<string, unknown>>;
+}
+//# sourceMappingURL=adaptorch-client.d.ts.map

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

@@ -0,0 +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"]}

package/dist/adaptorch-client.js

@@ -0,0 +1,109 @@
+/**
+ * AdaptOrch MCP client wrapper.
+ *
+ * Design-stage / experimental: this module has no production
+ * `AdaptOrchTransport` implementation wired in yet. Callers must supply
+ * their own transport (e.g. an adapter around an MCP SDK client) until one
+ * ships in this package.
+ *
+ * Tool surface, names, and read/write classification are grounded in
+ * `.omk/runs/lazycodex-adaptorch-loop-plan-20260701/lane2-adaptorch-tool-surface.md`,
+ * which cross-checks the real AdaptOrch MCP server against
+ * `docs/tools.md`, `README.md`, `mcp_server.py` dispatch, and
+ * `diagnostics.py::EXPECTED_CORE_TOOLS`. There are exactly 10 real tools;
+ * no "benchmark" or "verification" tools exist in the shipped surface.
+ */
+/**
+ * Typed wrapper around the 10 real AdaptOrch MCP tools.
+ *
+ * See doc section "The real, current 10-tool MCP surface (grouped)" for
+ * the full tool list, purposes, and read/write classification. This
+ * class only translates method calls into `transport.callTool` calls
+ * with the exact tool names the doc lists; it does not implement a
+ * transport itself.
+ */
+export class AdaptOrchClient {
+    transport;
+    constructor(transport) {
+        this.transport = transport;
+    }
+    /**
+     * `adaptorch_run` (write). Submit a task payload to the control-plane,
+     * optionally blocking until the run reaches a terminal status.
+     */
+    async run(payload) {
+        // The transport result shape is not schema-validated here; callers
+        // relying on strict correctness should validate at the transport
+        // boundary.
+        return (await this.transport.callTool("adaptorch_run", { ...payload }));
+    }
+    /**
+     * `adaptorch_get_run` (read). Fetch a run summary by `run_id`.
+     */
+    async getRun(runId) {
+        return (await this.transport.callTool("adaptorch_get_run", { run_id: runId }));
+    }
+    /**
+     * `adaptorch_list_runs` (read). List recent control-plane runs.
+     */
+    async listRuns(params) {
+        return (await this.transport.callTool("adaptorch_list_runs", { ...params }));
+    }
+    /**
+     * `adaptorch_cancel_run` (write). Request cancellation of an in-flight
+     * run by `run_id`.
+     */
+    async cancelRun(runId) {
+        return (await this.transport.callTool("adaptorch_cancel_run", { run_id: runId }));
+    }
+    /**
+     * `adaptorch_get_artifacts` (read). Fetch artifact metadata for a run.
+     */
+    async getArtifacts(runId) {
+        return (await this.transport.callTool("adaptorch_get_artifacts", { run_id: runId }));
+    }
+    /**
+     * `adaptorch_get_traces` (read). Fetch execution traces for a run by
+     * `run_id`.
+     */
+    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.
+     */
+    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,
+        };
+    }
+    /**
+     * `adaptorch_server_metrics` (read/local). Read redacted MCP server
+     * metrics (tool-call counters, latency percentiles).
+     */
+    async serverMetrics() {
+        return (await this.transport.callTool("adaptorch_server_metrics", {}));
+    }
+    /**
+     * `adaptorch_capabilities` (read/local). Read supported synthesis
+     * modes, connectors, and server features.
+     */
+    async capabilities() {
+        return (await this.transport.callTool("adaptorch_capabilities", {}));
+    }
+    /**
+     * `adaptorch_plan_catalog` (read/local). Read the hosted plan catalog
+     * (Starter $0 / Pro $39 / Team $149).
+     */
+    async planCatalog() {
+        return (await this.transport.callTool("adaptorch_plan_catalog", {}));
+    }
+}
+//# sourceMappingURL=adaptorch-client.js.map

package/dist/adaptorch-client.js.map

@@ -0,0 +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"]}

package/dist/adjudicator-registry.d.ts

@@ -0,0 +1,93 @@
+/**
+ * Per-kind verifier registry for the Outcome Adjudicator (Part 2 section 4).
+ *
+ * A flat, explicit registry keyed by unit-of-work `kind` string. No dynamic plugin
+ * discovery, no auto-loading - deliberately kept small and auditable per Part 2 section 4.
+ */
+/**
+ * The five-state verdict model for a single `run_id` (Part 2 section 2.4). This is the
+ * canonical, ground-truth output of the adjudication layer (Part 2 section 0).
+ */
+export type VerdictState = "CONFIRMED" | "CONTRADICTED" | "CORROBORATED-FAILURE" | "INDETERMINATE" | "VERIFIER-ERROR";
+/**
+ * The closed, machine-readable vocabulary of adjudication reasons. Every
+ * `PerRunVerdict`/`AdjudicationResult` carries exactly one of these codes alongside its
+ * free-text `reason`; disposition logic (Part 3 §1, `loop.ts`) branches on the code only,
+ * never on the reason text, which exists purely for humans and logs.
+ *
+ * Ordered by severity, worst first: {@link reduceReasonCodes} resolves a set of codes to
+ * the earliest entry in this array, so escalation-class codes always win over
+ * reroute-class codes, which win over plain-retry codes.
+ */
+export declare const ADJUDICATION_REASON_CODES: readonly ["SCOPE_VIOLATION", "SCHEMA_DRIFT", "CONTENT_CHECK_FAILED", "NO_EVIDENCE_ON_SUCCESS", "EMPTY_ARTIFACT_CONTENT", "TRACE_CHECK_FAILED", "TRACE_ERROR_SPAN", "MIN_ACTIONS_UNMET", "RUN_STATUS_UNPARSEABLE", "RUN_FETCH_FAILED", "MALFORMED_REQUEST", "RUN_NOT_TERMINAL", "EVIDENCE_EMPTY", "FAILURE_REPORTED", "ALL_CHECKS_PASSED"];
+export type AdjudicationReasonCode = (typeof ADJUDICATION_REASON_CODES)[number];
+/**
+ * Worst-wins reduction over reason codes, using {@link ADJUDICATION_REASON_CODES} order
+ * (earlier = more severe). Used both for a single run's collected problems and for the
+ * record-level aggregation across `per_run` verdicts. Returns `ALL_CHECKS_PASSED` (the
+ * neutral, least-severe element) for an empty input; callers only invoke it with at least
+ * one code in practice.
+ */
+export declare function reduceReasonCodes(codes: readonly AdjudicationReasonCode[]): AdjudicationReasonCode;
+/**
+ * Result of a single structural/content/trace check (Part 2 section 2.3).
+ */
+export interface CheckResult {
+    ok: boolean;
+    reason?: string;
+    /**
+     * Optional machine-readable classification for a failed check. `SCOPE_VIOLATION` and
+     * `SCHEMA_DRIFT` are the codes the disposition layer treats specially (escalate /
+     * reroute-on-recurrence respectively); when absent, a failed check defaults to
+     * `CONTENT_CHECK_FAILED` (content checks) or `TRACE_CHECK_FAILED` (trace checks).
+     * Ignored when `ok` is true.
+     */
+    code?: AdjudicationReasonCode;
+}
+/**
+ * A single per-kind verifier registry entry (Part 2 section 4). Every field beyond `kind`
+ * is optional; absence means the corresponding check/behavior is skipped or defaulted, as
+ * described in section 4.
+ */
+export interface VerifierRegistryEntry {
+    kind: string;
+    /** Default false. When true, an empty artifact list is not penalized (section 3). */
+    allow_zero_artifacts?: boolean;
+    /** e.g. ["markdown", "diff"] (section 4). */
+    expected_artifact_kinds?: string[];
+    /** Minimum matching trace spans required. Default 0 (no requirement, section 2.3/4). */
+    expected_min_actions?: number;
+    /** Default false. When true, retries above 1 are flagged (section 2.3). */
+    no_retry_masking?: boolean;
+    /**
+     * Default false. When true, a `SUCCESS_REPORTED` run with both artifacts and traces
+     * empty is upgraded from INDETERMINATE to CONTRADICTED (section 3).
+     */
+    no_evidence_on_success_is_contradiction?: boolean;
+    /** Format/schema check driven by the unit-of-work's content check hook (section 2.3). */
+    content_check?: (artifact: unknown) => CheckResult;
+    /** Trace-driven check hook (section 2.3). */
+    trace_check?: (traces: unknown) => CheckResult;
+    /**
+     * Optional corrective payload builder, invoked only when the record-level verdict is
+     * not CONFIRMED (section 4). Absent means no augmented payload is produced for this
+     * kind - callers resubmit the unmodified original payload.
+     */
+    build_augmented_payload?: (verdict: VerdictState, artifacts: unknown, traces: unknown) => unknown;
+}
+/**
+ * The conservative, structural-only fallback verifier used for any `kind` without a
+ * registered entry (Part 2 section 4). It can never reach CONFIRMED through a laxer path
+ * than a registered kind would, and intentionally defines no `content_check`,
+ * `trace_check`, or `build_augmented_payload`.
+ */
+export declare const DEFAULT_VERIFIER: VerifierRegistryEntry;
+/**
+ * Builds a flat, Map-backed lookup table for verifier registry entries (Part 2 section 4).
+ * No dynamic plugin discovery - the caller supplies the full, explicit entry list up front.
+ * Lookups for a `kind` with no registered entry fall back to {@link DEFAULT_VERIFIER}.
+ */
+export declare function createVerifierRegistry(entries: VerifierRegistryEntry[]): {
+    get(kind: string): VerifierRegistryEntry;
+};
+//# sourceMappingURL=adjudicator-registry.d.ts.map

package/dist/adjudicator-registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adjudicator-registry.d.ts","sourceRoot":"","sources":["../src/adjudicator-registry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG,cAAc,GAAG,sBAAsB,GAAG,eAAe,GAAG,gBAAgB,CAAC;AAEtH;;;;;;;;;GASG;AACH,eAAO,MAAM,yBAAyB,2UA+B5B,CAAC;AAEX,MAAM,MAAM,sBAAsB,GAAG,CAAC,OAAO,yBAAyB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEhF;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,sBAAsB,EAAE,GAAG,sBAAsB,CAKlG;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,EAAE,EAAE,OAAO,CAAC;IACZ,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,sBAAsB,CAAC;CAC9B;AAED;;;;GAIG;AACH,MAAM,WAAW,qBAAqB;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,qFAAqF;IACrF,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,6CAA6C;IAC7C,uBAAuB,CAAC,EAAE,MAAM,EAAE,CAAC;IACnC,wFAAwF;IACxF,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,2EAA2E;IAC3E,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,uCAAuC,CAAC,EAAE,OAAO,CAAC;IAClD,yFAAyF;IACzF,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,OAAO,KAAK,WAAW,CAAC;IACnD,6CAA6C;IAC7C,WAAW,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,WAAW,CAAC;IAC/C;;;;OAIG;IACH,uBAAuB,CAAC,EAAE,CAAC,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,OAAO,CAAC;CAClG;AAED;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,EAAE,qBAG9B,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,qBAAqB,EAAE,GAAG;IAAE,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,qBAAqB,CAAA;CAAE,CAUrH","sourcesContent":["/**\n * Per-kind verifier registry for the Outcome Adjudicator (Part 2 section 4).\n *\n * A flat, explicit registry keyed by unit-of-work `kind` string. No dynamic plugin\n * discovery, no auto-loading - deliberately kept small and auditable per Part 2 section 4.\n */\n\n/**\n * The five-state verdict model for a single `run_id` (Part 2 section 2.4). This is the\n * canonical, ground-truth output of the adjudication layer (Part 2 section 0).\n */\nexport type VerdictState = \"CONFIRMED\" | \"CONTRADICTED\" | \"CORROBORATED-FAILURE\" | \"INDETERMINATE\" | \"VERIFIER-ERROR\";\n\n/**\n * The closed, machine-readable vocabulary of adjudication reasons. Every\n * `PerRunVerdict`/`AdjudicationResult` carries exactly one of these codes alongside its\n * free-text `reason`; disposition logic (Part 3 §1, `loop.ts`) branches on the code only,\n * never on the reason text, which exists purely for humans and logs.\n *\n * Ordered by severity, worst first: {@link reduceReasonCodes} resolves a set of codes to\n * the earliest entry in this array, so escalation-class codes always win over\n * reroute-class codes, which win over plain-retry codes.\n */\nexport const ADJUDICATION_REASON_CODES = [\n\t/** A safety boundary was crossed (e.g. writes outside the lane's scope). Never auto-retried. */\n\t\"SCOPE_VIOLATION\",\n\t/** Output shape/schema does not match the packet's contract (explicit hook classification). */\n\t\"SCHEMA_DRIFT\",\n\t/** A registered `content_check` hook rejected an artifact (default code for failed content checks). */\n\t\"CONTENT_CHECK_FAILED\",\n\t/** Reported success but artifacts and traces are both empty, for a kind where that is contradictory. */\n\t\"NO_EVIDENCE_ON_SUCCESS\",\n\t/** An artifact exists but is empty or whitespace-only. */\n\t\"EMPTY_ARTIFACT_CONTENT\",\n\t/** A registered `trace_check` hook rejected the trace set (default code for failed trace checks). */\n\t\"TRACE_CHECK_FAILED\",\n\t/** The error-span scan found ERROR-severity spans under a reported success. */\n\t\"TRACE_ERROR_SPAN\",\n\t/** Fewer action spans than the registry entry's `expected_min_actions`. */\n\t\"MIN_ACTIONS_UNMET\",\n\t/** `getRun` payload carried no recognizable status field (checker failure, not task failure). */\n\t\"RUN_STATUS_UNPARSEABLE\",\n\t/** The evidence fetch/check sequence itself threw for this run. */\n\t\"RUN_FETCH_FAILED\",\n\t/** The `AdjudicationRequest` itself was malformed (missing kind / empty run_ids). */\n\t\"MALFORMED_REQUEST\",\n\t/** The run has not reached a terminal status yet. */\n\t\"RUN_NOT_TERMINAL\",\n\t/** Artifacts and/or traces were unexpectedly empty — too thin to judge either way. */\n\t\"EVIDENCE_EMPTY\",\n\t/** The run reported failure and the evidence does not contradict that report. */\n\t\"FAILURE_REPORTED\",\n\t/** Every check passed. */\n\t\"ALL_CHECKS_PASSED\",\n] as const;\n\nexport type AdjudicationReasonCode = (typeof ADJUDICATION_REASON_CODES)[number];\n\n/**\n * Worst-wins reduction over reason codes, using {@link ADJUDICATION_REASON_CODES} order\n * (earlier = more severe). Used both for a single run's collected problems and for the\n * record-level aggregation across `per_run` verdicts. Returns `ALL_CHECKS_PASSED` (the\n * neutral, least-severe element) for an empty input; callers only invoke it with at least\n * one code in practice.\n */\nexport function reduceReasonCodes(codes: readonly AdjudicationReasonCode[]): AdjudicationReasonCode {\n\tfor (const code of ADJUDICATION_REASON_CODES) {\n\t\tif (codes.includes(code)) return code;\n\t}\n\treturn \"ALL_CHECKS_PASSED\";\n}\n\n/**\n * Result of a single structural/content/trace check (Part 2 section 2.3).\n */\nexport interface CheckResult {\n\tok: boolean;\n\treason?: string;\n\t/**\n\t * Optional machine-readable classification for a failed check. `SCOPE_VIOLATION` and\n\t * `SCHEMA_DRIFT` are the codes the disposition layer treats specially (escalate /\n\t * reroute-on-recurrence respectively); when absent, a failed check defaults to\n\t * `CONTENT_CHECK_FAILED` (content checks) or `TRACE_CHECK_FAILED` (trace checks).\n\t * Ignored when `ok` is true.\n\t */\n\tcode?: AdjudicationReasonCode;\n}\n\n/**\n * A single per-kind verifier registry entry (Part 2 section 4). Every field beyond `kind`\n * is optional; absence means the corresponding check/behavior is skipped or defaulted, as\n * described in section 4.\n */\nexport interface VerifierRegistryEntry {\n\tkind: string;\n\t/** Default false. When true, an empty artifact list is not penalized (section 3). */\n\tallow_zero_artifacts?: boolean;\n\t/** e.g. [\"markdown\", \"diff\"] (section 4). */\n\texpected_artifact_kinds?: string[];\n\t/** Minimum matching trace spans required. Default 0 (no requirement, section 2.3/4). */\n\texpected_min_actions?: number;\n\t/** Default false. When true, retries above 1 are flagged (section 2.3). */\n\tno_retry_masking?: boolean;\n\t/**\n\t * Default false. When true, a `SUCCESS_REPORTED` run with both artifacts and traces\n\t * empty is upgraded from INDETERMINATE to CONTRADICTED (section 3).\n\t */\n\tno_evidence_on_success_is_contradiction?: boolean;\n\t/** Format/schema check driven by the unit-of-work's content check hook (section 2.3). */\n\tcontent_check?: (artifact: unknown) => CheckResult;\n\t/** Trace-driven check hook (section 2.3). */\n\ttrace_check?: (traces: unknown) => CheckResult;\n\t/**\n\t * Optional corrective payload builder, invoked only when the record-level verdict is\n\t * not CONFIRMED (section 4). Absent means no augmented payload is produced for this\n\t * kind - callers resubmit the unmodified original payload.\n\t */\n\tbuild_augmented_payload?: (verdict: VerdictState, artifacts: unknown, traces: unknown) => unknown;\n}\n\n/**\n * The conservative, structural-only fallback verifier used for any `kind` without a\n * registered entry (Part 2 section 4). It can never reach CONFIRMED through a laxer path\n * than a registered kind would, and intentionally defines no `content_check`,\n * `trace_check`, or `build_augmented_payload`.\n */\nexport const DEFAULT_VERIFIER: VerifierRegistryEntry = {\n\tkind: \"DEFAULT\",\n\tallow_zero_artifacts: false,\n};\n\n/**\n * Builds a flat, Map-backed lookup table for verifier registry entries (Part 2 section 4).\n * No dynamic plugin discovery - the caller supplies the full, explicit entry list up front.\n * Lookups for a `kind` with no registered entry fall back to {@link DEFAULT_VERIFIER}.\n */\nexport function createVerifierRegistry(entries: VerifierRegistryEntry[]): { get(kind: string): VerifierRegistryEntry } {\n\tconst byKind = new Map<string, VerifierRegistryEntry>();\n\tfor (const entry of entries) {\n\t\tbyKind.set(entry.kind, entry);\n\t}\n\treturn {\n\t\tget(kind: string): VerifierRegistryEntry {\n\t\t\treturn byKind.get(kind) ?? DEFAULT_VERIFIER;\n\t\t},\n\t};\n}\n"]}

package/dist/adjudicator-registry.js

@@ -0,0 +1,89 @@
+/**
+ * Per-kind verifier registry for the Outcome Adjudicator (Part 2 section 4).
+ *
+ * A flat, explicit registry keyed by unit-of-work `kind` string. No dynamic plugin
+ * discovery, no auto-loading - deliberately kept small and auditable per Part 2 section 4.
+ */
+/**
+ * The closed, machine-readable vocabulary of adjudication reasons. Every
+ * `PerRunVerdict`/`AdjudicationResult` carries exactly one of these codes alongside its
+ * free-text `reason`; disposition logic (Part 3 §1, `loop.ts`) branches on the code only,
+ * never on the reason text, which exists purely for humans and logs.
+ *
+ * Ordered by severity, worst first: {@link reduceReasonCodes} resolves a set of codes to
+ * the earliest entry in this array, so escalation-class codes always win over
+ * reroute-class codes, which win over plain-retry codes.
+ */
+export const ADJUDICATION_REASON_CODES = [
+    /** A safety boundary was crossed (e.g. writes outside the lane's scope). Never auto-retried. */
+    "SCOPE_VIOLATION",
+    /** Output shape/schema does not match the packet's contract (explicit hook classification). */
+    "SCHEMA_DRIFT",
+    /** A registered `content_check` hook rejected an artifact (default code for failed content checks). */
+    "CONTENT_CHECK_FAILED",
+    /** Reported success but artifacts and traces are both empty, for a kind where that is contradictory. */
+    "NO_EVIDENCE_ON_SUCCESS",
+    /** An artifact exists but is empty or whitespace-only. */
+    "EMPTY_ARTIFACT_CONTENT",
+    /** A registered `trace_check` hook rejected the trace set (default code for failed trace checks). */
+    "TRACE_CHECK_FAILED",
+    /** The error-span scan found ERROR-severity spans under a reported success. */
+    "TRACE_ERROR_SPAN",
+    /** Fewer action spans than the registry entry's `expected_min_actions`. */
+    "MIN_ACTIONS_UNMET",
+    /** `getRun` payload carried no recognizable status field (checker failure, not task failure). */
+    "RUN_STATUS_UNPARSEABLE",
+    /** The evidence fetch/check sequence itself threw for this run. */
+    "RUN_FETCH_FAILED",
+    /** The `AdjudicationRequest` itself was malformed (missing kind / empty run_ids). */
+    "MALFORMED_REQUEST",
+    /** The run has not reached a terminal status yet. */
+    "RUN_NOT_TERMINAL",
+    /** Artifacts and/or traces were unexpectedly empty — too thin to judge either way. */
+    "EVIDENCE_EMPTY",
+    /** The run reported failure and the evidence does not contradict that report. */
+    "FAILURE_REPORTED",
+    /** Every check passed. */
+    "ALL_CHECKS_PASSED",
+];
+/**
+ * Worst-wins reduction over reason codes, using {@link ADJUDICATION_REASON_CODES} order
+ * (earlier = more severe). Used both for a single run's collected problems and for the
+ * record-level aggregation across `per_run` verdicts. Returns `ALL_CHECKS_PASSED` (the
+ * neutral, least-severe element) for an empty input; callers only invoke it with at least
+ * one code in practice.
+ */
+export function reduceReasonCodes(codes) {
+    for (const code of ADJUDICATION_REASON_CODES) {
+        if (codes.includes(code))
+            return code;
+    }
+    return "ALL_CHECKS_PASSED";
+}
+/**
+ * The conservative, structural-only fallback verifier used for any `kind` without a
+ * registered entry (Part 2 section 4). It can never reach CONFIRMED through a laxer path
+ * than a registered kind would, and intentionally defines no `content_check`,
+ * `trace_check`, or `build_augmented_payload`.
+ */
+export const DEFAULT_VERIFIER = {
+    kind: "DEFAULT",
+    allow_zero_artifacts: false,
+};
+/**
+ * Builds a flat, Map-backed lookup table for verifier registry entries (Part 2 section 4).
+ * No dynamic plugin discovery - the caller supplies the full, explicit entry list up front.
+ * Lookups for a `kind` with no registered entry fall back to {@link DEFAULT_VERIFIER}.
+ */
+export function createVerifierRegistry(entries) {
+    const byKind = new Map();
+    for (const entry of entries) {
+        byKind.set(entry.kind, entry);
+    }
+    return {
+        get(kind) {
+            return byKind.get(kind) ?? DEFAULT_VERIFIER;
+        },
+    };
+}
+//# sourceMappingURL=adjudicator-registry.js.map

package/dist/adjudicator-registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adjudicator-registry.js","sourceRoot":"","sources":["../src/adjudicator-registry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAQH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG;IACxC,gGAAgG;IAChG,iBAAiB;IACjB,+FAA+F;IAC/F,cAAc;IACd,uGAAuG;IACvG,sBAAsB;IACtB,wGAAwG;IACxG,wBAAwB;IACxB,0DAA0D;IAC1D,wBAAwB;IACxB,qGAAqG;IACrG,oBAAoB;IACpB,+EAA+E;IAC/E,kBAAkB;IAClB,2EAA2E;IAC3E,mBAAmB;IACnB,iGAAiG;IACjG,wBAAwB;IACxB,mEAAmE;IACnE,kBAAkB;IAClB,qFAAqF;IACrF,mBAAmB;IACnB,qDAAqD;IACrD,kBAAkB;IAClB,wFAAsF;IACtF,gBAAgB;IAChB,iFAAiF;IACjF,kBAAkB;IAClB,0BAA0B;IAC1B,mBAAmB;CACV,CAAC;AAIX;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAwC,EAA0B;IACnG,KAAK,MAAM,IAAI,IAAI,yBAAyB,EAAE,CAAC;QAC9C,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IACvC,CAAC;IACD,OAAO,mBAAmB,CAAC;AAAA,CAC3B;AAkDD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAA0B;IACtD,IAAI,EAAE,SAAS;IACf,oBAAoB,EAAE,KAAK;CAC3B,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAgC,EAAgD;IACtH,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiC,CAAC;IACxD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO;QACN,GAAG,CAAC,IAAY,EAAyB;YACxC,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC;QAAA,CAC5C;KACD,CAAC;AAAA,CACF","sourcesContent":["/**\n * Per-kind verifier registry for the Outcome Adjudicator (Part 2 section 4).\n *\n * A flat, explicit registry keyed by unit-of-work `kind` string. No dynamic plugin\n * discovery, no auto-loading - deliberately kept small and auditable per Part 2 section 4.\n */\n\n/**\n * The five-state verdict model for a single `run_id` (Part 2 section 2.4). This is the\n * canonical, ground-truth output of the adjudication layer (Part 2 section 0).\n */\nexport type VerdictState = \"CONFIRMED\" | \"CONTRADICTED\" | \"CORROBORATED-FAILURE\" | \"INDETERMINATE\" | \"VERIFIER-ERROR\";\n\n/**\n * The closed, machine-readable vocabulary of adjudication reasons. Every\n * `PerRunVerdict`/`AdjudicationResult` carries exactly one of these codes alongside its\n * free-text `reason`; disposition logic (Part 3 §1, `loop.ts`) branches on the code only,\n * never on the reason text, which exists purely for humans and logs.\n *\n * Ordered by severity, worst first: {@link reduceReasonCodes} resolves a set of codes to\n * the earliest entry in this array, so escalation-class codes always win over\n * reroute-class codes, which win over plain-retry codes.\n */\nexport const ADJUDICATION_REASON_CODES = [\n\t/** A safety boundary was crossed (e.g. writes outside the lane's scope). Never auto-retried. */\n\t\"SCOPE_VIOLATION\",\n\t/** Output shape/schema does not match the packet's contract (explicit hook classification). */\n\t\"SCHEMA_DRIFT\",\n\t/** A registered `content_check` hook rejected an artifact (default code for failed content checks). */\n\t\"CONTENT_CHECK_FAILED\",\n\t/** Reported success but artifacts and traces are both empty, for a kind where that is contradictory. */\n\t\"NO_EVIDENCE_ON_SUCCESS\",\n\t/** An artifact exists but is empty or whitespace-only. */\n\t\"EMPTY_ARTIFACT_CONTENT\",\n\t/** A registered `trace_check` hook rejected the trace set (default code for failed trace checks). */\n\t\"TRACE_CHECK_FAILED\",\n\t/** The error-span scan found ERROR-severity spans under a reported success. */\n\t\"TRACE_ERROR_SPAN\",\n\t/** Fewer action spans than the registry entry's `expected_min_actions`. */\n\t\"MIN_ACTIONS_UNMET\",\n\t/** `getRun` payload carried no recognizable status field (checker failure, not task failure). */\n\t\"RUN_STATUS_UNPARSEABLE\",\n\t/** The evidence fetch/check sequence itself threw for this run. */\n\t\"RUN_FETCH_FAILED\",\n\t/** The `AdjudicationRequest` itself was malformed (missing kind / empty run_ids). */\n\t\"MALFORMED_REQUEST\",\n\t/** The run has not reached a terminal status yet. */\n\t\"RUN_NOT_TERMINAL\",\n\t/** Artifacts and/or traces were unexpectedly empty — too thin to judge either way. */\n\t\"EVIDENCE_EMPTY\",\n\t/** The run reported failure and the evidence does not contradict that report. */\n\t\"FAILURE_REPORTED\",\n\t/** Every check passed. */\n\t\"ALL_CHECKS_PASSED\",\n] as const;\n\nexport type AdjudicationReasonCode = (typeof ADJUDICATION_REASON_CODES)[number];\n\n/**\n * Worst-wins reduction over reason codes, using {@link ADJUDICATION_REASON_CODES} order\n * (earlier = more severe). Used both for a single run's collected problems and for the\n * record-level aggregation across `per_run` verdicts. Returns `ALL_CHECKS_PASSED` (the\n * neutral, least-severe element) for an empty input; callers only invoke it with at least\n * one code in practice.\n */\nexport function reduceReasonCodes(codes: readonly AdjudicationReasonCode[]): AdjudicationReasonCode {\n\tfor (const code of ADJUDICATION_REASON_CODES) {\n\t\tif (codes.includes(code)) return code;\n\t}\n\treturn \"ALL_CHECKS_PASSED\";\n}\n\n/**\n * Result of a single structural/content/trace check (Part 2 section 2.3).\n */\nexport interface CheckResult {\n\tok: boolean;\n\treason?: string;\n\t/**\n\t * Optional machine-readable classification for a failed check. `SCOPE_VIOLATION` and\n\t * `SCHEMA_DRIFT` are the codes the disposition layer treats specially (escalate /\n\t * reroute-on-recurrence respectively); when absent, a failed check defaults to\n\t * `CONTENT_CHECK_FAILED` (content checks) or `TRACE_CHECK_FAILED` (trace checks).\n\t * Ignored when `ok` is true.\n\t */\n\tcode?: AdjudicationReasonCode;\n}\n\n/**\n * A single per-kind verifier registry entry (Part 2 section 4). Every field beyond `kind`\n * is optional; absence means the corresponding check/behavior is skipped or defaulted, as\n * described in section 4.\n */\nexport interface VerifierRegistryEntry {\n\tkind: string;\n\t/** Default false. When true, an empty artifact list is not penalized (section 3). */\n\tallow_zero_artifacts?: boolean;\n\t/** e.g. [\"markdown\", \"diff\"] (section 4). */\n\texpected_artifact_kinds?: string[];\n\t/** Minimum matching trace spans required. Default 0 (no requirement, section 2.3/4). */\n\texpected_min_actions?: number;\n\t/** Default false. When true, retries above 1 are flagged (section 2.3). */\n\tno_retry_masking?: boolean;\n\t/**\n\t * Default false. When true, a `SUCCESS_REPORTED` run with both artifacts and traces\n\t * empty is upgraded from INDETERMINATE to CONTRADICTED (section 3).\n\t */\n\tno_evidence_on_success_is_contradiction?: boolean;\n\t/** Format/schema check driven by the unit-of-work's content check hook (section 2.3). */\n\tcontent_check?: (artifact: unknown) => CheckResult;\n\t/** Trace-driven check hook (section 2.3). */\n\ttrace_check?: (traces: unknown) => CheckResult;\n\t/**\n\t * Optional corrective payload builder, invoked only when the record-level verdict is\n\t * not CONFIRMED (section 4). Absent means no augmented payload is produced for this\n\t * kind - callers resubmit the unmodified original payload.\n\t */\n\tbuild_augmented_payload?: (verdict: VerdictState, artifacts: unknown, traces: unknown) => unknown;\n}\n\n/**\n * The conservative, structural-only fallback verifier used for any `kind` without a\n * registered entry (Part 2 section 4). It can never reach CONFIRMED through a laxer path\n * than a registered kind would, and intentionally defines no `content_check`,\n * `trace_check`, or `build_augmented_payload`.\n */\nexport const DEFAULT_VERIFIER: VerifierRegistryEntry = {\n\tkind: \"DEFAULT\",\n\tallow_zero_artifacts: false,\n};\n\n/**\n * Builds a flat, Map-backed lookup table for verifier registry entries (Part 2 section 4).\n * No dynamic plugin discovery - the caller supplies the full, explicit entry list up front.\n * Lookups for a `kind` with no registered entry fall back to {@link DEFAULT_VERIFIER}.\n */\nexport function createVerifierRegistry(entries: VerifierRegistryEntry[]): { get(kind: string): VerifierRegistryEntry } {\n\tconst byKind = new Map<string, VerifierRegistryEntry>();\n\tfor (const entry of entries) {\n\t\tbyKind.set(entry.kind, entry);\n\t}\n\treturn {\n\t\tget(kind: string): VerifierRegistryEntry {\n\t\t\treturn byKind.get(kind) ?? DEFAULT_VERIFIER;\n\t\t},\n\t};\n}\n"]}