@loomwork/reasoning 0.0.0-stage → 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

package/NOTICE

@@ -0,0 +1,8 @@
+Loom
+Copyright 2026 Sushil Chhetri
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this project except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0

package/README.md

@@ -1,3 +1,83 @@
-# Temporary Holding Version
+# @loomwork/reasoning — model routing and elevation
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+`ReasoningRuntime` picks a model from a set of tiered routes, scores the answer, and moves to a stronger
+tier when the score is below a threshold. The stages are separate and replaceable: a `Router` chooses the
+first route, a `ConfidenceSignal` scores each answer, and `elevateThreshold` (default 0.5) decides whether
+to climb to the next tier. Pass `ctx.decide` and each routing and elevation choice is recorded, so a replay
+makes the same choices. Use it when cheap-first routing with escalation is worth the extra calls.
+`IntentRuntime` and `PlannerRuntime` accept it as `reasoning`, and `agentLoop$` calls it through an
+`invoke` that runs each model call as a journaled effect.
+
+```ts
+import type { LlmProvider, LlmResponse } from "@loomwork/llm";
+import { ReasoningRuntime, validatorConfidence } from "@loomwork/reasoning";
+
+// Stand-ins for real providers: the cheap model answers badly, the strong one answers well.
+const provider = (content: string): LlmProvider => ({
+  complete: async (): Promise<LlmResponse> => ({ content, stopReason: "end_turn" }),
+});
+
+const reasoning = new ReasoningRuntime({
+  routes: [
+    { id: "small", provider: provider("not json"), tier: 0 },
+    { id: "large", provider: provider('{"ok":true}'), tier: 1 },
+  ],
+  // Elevate until the output validates, instead of trusting the model's stop reason.
+  confidence: validatorConfidence((text) => {
+    try {
+      JSON.parse(text);
+      return true;
+    } catch {
+      return false;
+    }
+  }),
+});
+
+const result = await reasoning.reason({ messages: [{ role: "user", content: "Reply with JSON." }] });
+console.log(result.modelId, result.elevated); // "large" true; result.trace has one entry per call
+```
+
+## Surface
+
+- **Runtime.** `new ReasoningRuntime({ routes, router?, confidence?, elevateThreshold?, cache? })`,
+  `reason(request, { decide?, invoke?, wrapCall?, decisionKey?, cacheScope?, signal? })` and
+  `availableRoutes`. A `ReasoningResult` carries `content`, `toolCalls`, `stopReason`, `usage`, `modelId`,
+  `confidence`, `elevated` and a `trace` of every call.
+- **Routers.** `tagRouter` (default: the lowest tier whose `tags` include `strategy`, else the lowest
+  tier), `fixedRouter(id)`, `rankedRouter(rankings, { minSamples?, fallback? })`, `ucb1(stats, ...)` and
+  `epsilonGreedy(inner, { epsilon })`. The learned ones take per-route evidence such as
+  `outcomeAnalytics(events)` from `@loomwork/analytics`.
+- **Confidence.** `stopReasonConfidence` (default: 0.9 for `end_turn` and `tool_use`, 0.3 for
+  `max_tokens`), `validatorConfidence(fn)` (1 or 0) and `constantConfidence(n)`.
+- **Types.** `ModelRoute`, `ReasoningRequest` (with `strategy` and `maxTier`), `ModelInvoker`,
+  `ReasoningCache`, and `DecideFn`, which has the same shape as `ctx.decide`.
+
+## Behaviour that surprises people
+
+- **The direct path is outside the effect ring.** Without `invoke`, the runtime calls
+  `route.provider.complete` itself, so there is no authorization, metering or kill switch on that call. It
+  still runs `guardRequest`, so tainted content in an instruction position is refused. To make each model
+  call a journaled effect, supply an `invoke` (what `agentLoop$` does). With `invoke` the response cache is
+  bypassed, so whether a durable frame exists does not depend on a process-local cache.
+- **Routing is recorded only if you pass `decide`.** Without it the choices run inline and are not
+  replay-stable.
+- **Confidence is a pluggable signal, not a self-reported number.** The default reads only the stop
+  reason. `maxTier` caps elevation as a budget.
+- **Elevation climbs one strictly higher tier at a time** and stops at the top tier or `maxTier`. A cache
+  is optional (`ReasoningCache` is just an interface) and, if you share one across tenants, scope it with
+  `cacheScope`.
+- **`rankedRouter` can collapse onto what it already chose**, because arms it stops picking stop
+  generating outcomes. Wrap it in `epsilonGreedy` or use `ucb1`, which is deterministic (no RNG).
+- **Captured reasoning is text-free here.** Reasoning parts leave this runtime in recorded form only;
+  readable text goes to a sidecar through `@loomwork/llm` (ADR 0133).
+
+## Install
+
+Unpublished for now: inside this repo use `workspace:*`; from a sibling checkout use a `link:` override (see [AGENTS.md](../../AGENTS.md)).
+
+## See also
+
+- API reference: section "`@loomwork/reasoning` — model routing & elevation" in [docs/api-reference.org](../../docs/api-reference.org).
+- Guides: [user guide, section 15: reasoning runtime](../../docs/user-guide.md#15-reasoning-runtime--routing--elevation), [reasoning and memory](../../docs/loom-2.0/02-reasoning-and-memory.md).
+- ADRs: [0016 execution runtime and decision seam](../../docs/adr/0016-loom-2.0-execution-runtime-and-decision-seam.md), [0121 one canonical agent loop](../../docs/adr/0121-one-canonical-agent-loop.md), [0133 model reasoning audit capture](../../docs/adr/0133-model-reasoning-audit-capture.md).
+- Source: `packages/reasoning/src`.

package/dist/ReasoningRuntime.d.ts

@@ -0,0 +1,22 @@
+import type { ModelRoute, ReasonOptions, ReasoningRequest, ReasoningResult, ReasoningRuntimeConfig } from "./types";
+export declare class ReasoningRuntime {
+    private readonly routes;
+    private readonly router;
+    private readonly confidence;
+    private readonly threshold;
+    private readonly cache;
+    private readonly indexById;
+    private readonly nextHigherIndex;
+    constructor(config: ReasoningRuntimeConfig);
+    /** Whether a response cache is configured (a host that shares it across tenants must scope it). */
+    get hasResponseCache(): boolean;
+    get availableRoutes(): ReadonlyArray<ModelRoute>;
+    reason(req: ReasoningRequest, opts?: ReasonOptions): Promise<ReasoningResult>;
+    private indexOf;
+    private call;
+    private callRaw;
+    /** Who the cached response belongs to: the explicit scope and the principal identity, if any. */
+    private scopeOf;
+    private keyFor;
+}
+//# sourceMappingURL=ReasoningRuntime.d.ts.map

package/dist/ReasoningRuntime.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReasoningRuntime.d.ts","sourceRoot":"","sources":["../src/ReasoningRuntime.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAGV,UAAU,EACV,aAAa,EAEb,gBAAgB,EAChB,eAAe,EACf,sBAAsB,EAGvB,MAAM,SAAS,CAAC;AAqBjB,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAmB;IAC9C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IAEnD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAsB;IAGhD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAW;gBAE/B,MAAM,EAAE,sBAAsB;IAyB1C,mGAAmG;IACnG,IAAI,gBAAgB,IAAI,OAAO,CAE9B;IAED,IAAI,eAAe,IAAI,aAAa,CAAC,UAAU,CAAC,CAE/C;IAEK,MAAM,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI,GAAE,aAAkB,GAAG,OAAO,CAAC,eAAe,CAAC;IAiDvF,OAAO,CAAC,OAAO;YAQD,IAAI;YAUJ,OAAO;IAsErB,iGAAiG;IACjG,OAAO,CAAC,OAAO;IAUf,OAAO,CAAC,MAAM;CAQf"}

package/dist/ReasoningRuntime.js

@@ -0,0 +1,200 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ReasoningRuntime = void 0;
+const llm_1 = require("@loomwork/llm");
+const confidence_1 = require("./confidence");
+const router_1 = require("./router");
+// No decision sink → run the decider inline (used by standalone callers outside a
+// durable flow). When a flow passes ctx.decide, the choice is recorded instead.
+const identityDecide = (_id, decider) => Promise.resolve(decider());
+/**
+ * ADR 0133 - what leaves this runtime (a result a caller journals, a cache entry) carries reasoning
+ * only in its text-free recorded form: readable text goes to a sidecar through `createLlmEffect`, or
+ * nowhere. The same object when there is no reasoning (G2).
+ */
+function withTextFreeReasoning(res) {
+    return res.reasoning === undefined
+        ? res
+        : { ...res, reasoning: (0, llm_1.textFreeReasoning)(res.reasoning) };
+}
+// The Reasoning Runtime (P3), built as composable stages: route → call → score →
+// elevate. Each route/elevation is a logged decision (P9), so replay is deterministic
+// while routing can improve run-to-run. The kernel stays untouched — this is an
+// optional advisory module (P10).
+class ReasoningRuntime {
+    routes;
+    router;
+    confidence;
+    threshold;
+    cache;
+    // id → position in the tier-sorted `routes`, so `byId` is O(1) not a linear scan.
+    indexById;
+    // For each route index, the index of the next route with a strictly higher tier
+    // (or -1). Precomputed once so elevation is an O(1) hop instead of an O(n) scan.
+    nextHigherIndex;
+    constructor(config) {
+        if (config.routes.length === 0) {
+            throw new Error("ReasoningRuntime requires at least one route");
+        }
+        // Sorted by tier once so elevation is a simple forward hop.
+        this.routes = [...config.routes].sort((a, b) => a.tier - b.tier);
+        this.router = config.router ?? router_1.tagRouter;
+        this.confidence = config.confidence ?? confidence_1.stopReasonConfidence;
+        this.threshold = config.elevateThreshold ?? 0.5;
+        this.cache = config.cache;
+        const n = this.routes.length;
+        this.indexById = new Map(this.routes.map((r, i) => [r.id, i]));
+        // Right-to-left pass (O(n)): the next strictly-higher tier for i is either its
+        // neighbour i+1 (if that neighbour's tier is greater) or, when i+1 shares i's
+        // tier, whatever the next-higher of i+1 already resolved to.
+        this.nextHigherIndex = new Array(n).fill(-1);
+        for (let i = n - 2; i >= 0; i--) {
+            this.nextHigherIndex[i] =
+                this.routes[i + 1].tier > this.routes[i].tier
+                    ? i + 1
+                    : this.nextHigherIndex[i + 1];
+        }
+    }
+    /** Whether a response cache is configured (a host that shares it across tenants must scope it). */
+    get hasResponseCache() {
+        return this.cache !== undefined;
+    }
+    get availableRoutes() {
+        return this.routes;
+    }
+    async reason(req, opts = {}) {
+        const decide = opts.decide ?? identityDecide;
+        const key = opts.decisionKey ?? req.strategy ?? "default";
+        const signal = opts.signal ?? req.signal;
+        const maxTier = req.maxTier ?? this.routes[this.routes.length - 1].tier;
+        // Stage 1 — route (a logged decision).
+        const initialId = await decide(`reason:${key}:route`, () => this.router.select(req, this.routes).id);
+        let currentIdx = this.indexOf(initialId);
+        let current = this.routes[currentIdx];
+        const trace = [];
+        let res = await this.call(current, req, signal, opts);
+        let confidence = await this.confidence.score(req, res);
+        trace.push({ modelId: current.id, tier: current.tier, confidence, elevated: false });
+        // Stage 2 — elevate while low-confidence and a higher tier is within budget.
+        let step = 0;
+        while (confidence < this.threshold) {
+            const nextIdx = this.nextHigherIndex[currentIdx];
+            if (nextIdx === -1)
+                break;
+            const next = this.routes[nextIdx];
+            if (next.tier > maxTier)
+                break;
+            step += 1;
+            const chosenId = await decide(`reason:${key}:elevate:${step}`, () => next.id);
+            currentIdx = this.indexOf(chosenId);
+            current = this.routes[currentIdx];
+            res = await this.call(current, req, signal, opts);
+            confidence = await this.confidence.score(req, res);
+            trace.push({ modelId: current.id, tier: current.tier, confidence, elevated: true });
+        }
+        return {
+            content: res.content,
+            ...(res.toolCalls !== undefined && { toolCalls: res.toolCalls }),
+            stopReason: res.stopReason,
+            ...(res.usage !== undefined && { usage: res.usage }),
+            ...(res.reasoning !== undefined && { reasoning: res.reasoning }),
+            ...(res.layout !== undefined && { layout: res.layout }),
+            modelId: current.id,
+            confidence,
+            elevated: trace.length > 1,
+            trace,
+        };
+    }
+    indexOf(id) {
+        const idx = this.indexById.get(id);
+        if (idx === undefined) {
+            throw new Error(`ReasoningRuntime: unknown route "${id}"`);
+        }
+        return idx;
+    }
+    async call(route, req, signal, opts) {
+        // Every path (an invoker, a wrapper serving a record, the cache, the provider) is text-free on exit.
+        return withTextFreeReasoning(await this.callRaw(route, req, signal, opts));
+    }
+    async callRaw(route, req, signal, opts) {
+        const invoke = opts.invoke;
+        if (invoke !== undefined) {
+            // R9 — the host makes the call (as an effect, inside the ring). No cache: see ModelInvoker.
+            // `guardRequest` still runs here, so a custom invoker that is NOT an effect cannot
+            // receive tainted content either; the effect it resolves to guards again, harmlessly
+            // (a guarded request is untainted, and guarding it is the identity).
+            const guarded = (0, llm_1.guardRequest)({
+                messages: req.messages,
+                ...(req.system !== undefined && { system: req.system }),
+                ...(req.tools !== undefined && { tools: req.tools }),
+                ...(req.maxTokens !== undefined && { maxTokens: req.maxTokens }),
+                ...(req.temperature !== undefined && { temperature: req.temperature }),
+            });
+            return invoke(route, {
+                messages: guarded.messages,
+                ...(guarded.system !== undefined && { system: guarded.system }),
+                ...(guarded.tools !== undefined && { tools: guarded.tools }),
+                ...(guarded.maxTokens !== undefined && { maxTokens: guarded.maxTokens }),
+                ...(guarded.temperature !== undefined && { temperature: guarded.temperature }),
+            });
+        }
+        // R2 — the prompt boundary, on the reasoning path. This is the single site where
+        // this runtime hands a request to a provider, so it is the one place the check
+        // belongs. `ReasoningRequest` types its content as `string`, but a `string`
+        // annotation is a claim, not a check: a tainted MCP tool description reaches
+        // here through exactly such a field. `guardRequest` refuses taint in every
+        // instruction position and returns an untainted request unchanged.
+        const guarded = (0, llm_1.guardRequest)({
+            messages: req.messages,
+            ...(req.system !== undefined && { system: req.system }),
+            ...(req.tools !== undefined && { tools: req.tools }),
+            ...(req.maxTokens !== undefined && { maxTokens: req.maxTokens }),
+            ...(req.temperature !== undefined && { temperature: req.temperature }),
+            ...(signal !== undefined && { signal }),
+        });
+        // R5 — a third-party provider may not check its own modalities; this runtime does.
+        (0, llm_1.assertRequestSupported)(guarded, route.provider.capabilities);
+        // The cache key is the request AS WRITTEN (addresses, not bytes); computed before the host's
+        // wrapper so a journaled call and an unjournaled one share the same entries.
+        const cacheKey = this.cache !== undefined ? this.keyFor(route.id, req, this.scopeOf(opts)) : undefined;
+        const run = async () => {
+            if (cacheKey !== undefined) {
+                const hit = this.cache?.get(cacheKey);
+                if (hit !== undefined)
+                    return hit;
+            }
+            // R5 — refs become bytes only now: after the capability check (a refusal must precede any
+            // fetch) and after the cache lookup, whose key is the request as written.
+            // ADR 0133: reasoning is reduced BEFORE the cache sees it, so a shared cache never holds text.
+            const res = withTextFreeReasoning(await route.provider.complete(await (0, llm_1.resolveRequestContent)(guarded, opts.resolveContent, {
+                ...(signal !== undefined && { signal }),
+                // Absent only when there is no resolver; a ref then fails before any fetch.
+                context: opts.resolveContext ?? { executionId: "" },
+            })));
+            if (cacheKey !== undefined)
+                this.cache?.set(cacheKey, res);
+            return res;
+        };
+        return opts.wrapCall !== undefined ? opts.wrapCall(route, run) : run();
+    }
+    /** Who the cached response belongs to: the explicit scope and the principal identity, if any. */
+    scopeOf(opts) {
+        const p = opts.resolveContext?.principal;
+        const who = p === undefined
+            ? undefined
+            : JSON.stringify([p.tenant ?? null, p.actor ?? null, p.onBehalfOf ?? null]);
+        if (opts.cacheScope === undefined && who === undefined)
+            return undefined;
+        return JSON.stringify([opts.cacheScope ?? null, who ?? null]);
+    }
+    keyFor(modelId, req, scope) {
+        return JSON.stringify({
+            m: modelId,
+            s: req.system,
+            msgs: req.messages,
+            ...(scope !== undefined && { c: scope }),
+        });
+    }
+}
+exports.ReasoningRuntime = ReasoningRuntime;
+//# sourceMappingURL=ReasoningRuntime.js.map

package/dist/ReasoningRuntime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReasoningRuntime.js","sourceRoot":"","sources":["../src/ReasoningRuntime.ts"],"names":[],"mappings":";;;AACA,uCAKuB;AACvB,6CAAoD;AACpD,qCAAqC;AAcrC,kFAAkF;AAClF,gFAAgF;AAChF,MAAM,cAAc,GAAa,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;AAE9E;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,GAAgB;IAC7C,OAAO,GAAG,CAAC,SAAS,KAAK,SAAS;QAChC,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,SAAS,EAAE,IAAA,uBAAiB,EAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;AAC9D,CAAC;AAED,iFAAiF;AACjF,sFAAsF;AACtF,gFAAgF;AAChF,kCAAkC;AAClC,MAAa,gBAAgB;IACV,MAAM,CAAe;IACrB,MAAM,CAAS;IACf,UAAU,CAAmB;IAC7B,SAAS,CAAS;IAClB,KAAK,CAA6B;IACnD,kFAAkF;IACjE,SAAS,CAAsB;IAChD,gFAAgF;IAChF,iFAAiF;IAChE,eAAe,CAAW;IAE3C,YAAY,MAA8B;QACxC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;QAClE,CAAC;QACD,4DAA4D;QAC5D,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,kBAAS,CAAC;QACzC,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,iCAAoB,CAAC;QAC5D,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,gBAAgB,IAAI,GAAG,CAAC;QAChD,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAE1B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,+EAA+E;QAC/E,8EAA8E;QAC9E,6DAA6D;QAC7D,IAAI,CAAC,eAAe,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAgB,CAAC,IAAI,GAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAgB,CAAC,IAAI;oBAC3E,CAAC,CAAC,CAAC,GAAG,CAAC;oBACP,CAAC,CAAE,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAY,CAAC;QAChD,CAAC;IACH,CAAC;IAED,mGAAmG;IACnG,IAAI,gBAAgB;QAClB,OAAO,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;IAClC,CAAC;IAED,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,GAAqB,EAAE,OAAsB,EAAE;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,cAAc,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,GAAG,CAAC,QAAQ,IAAI,SAAS,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC;QACzC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,IAAK,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAgB,CAAC,IAAI,CAAC;QAExF,uCAAuC;QACvC,MAAM,SAAS,GAAG,MAAM,MAAM,CAC5B,UAAU,GAAG,QAAQ,EACrB,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAC9C,CAAC;QACF,IAAI,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAe,CAAC;QACpD,MAAM,KAAK,GAA0B,EAAE,CAAC;QAExC,IAAI,GAAG,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACtD,IAAI,UAAU,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACvD,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QAErF,6EAA6E;QAC7E,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAW,CAAC;YAC3D,IAAI,OAAO,KAAK,CAAC,CAAC;gBAAE,MAAM;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAe,CAAC;YAChD,IAAI,IAAI,CAAC,IAAI,GAAG,OAAO;gBAAE,MAAM;YAC/B,IAAI,IAAI,CAAC,CAAC;YACV,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,UAAU,GAAG,YAAY,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9E,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACpC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAe,CAAC;YAChD,GAAG,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAClD,UAAU,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACtF,CAAC;QAED,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,GAAG,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;YAChE,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;YACpD,GAAG,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;YAChE,GAAG,CAAC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC;YACvD,OAAO,EAAE,OAAO,CAAC,EAAE;YACnB,UAAU;YACV,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;YAC1B,KAAK;SACN,CAAC;IACJ,CAAC;IAEO,OAAO,CAAC,EAAU;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,oCAAoC,EAAE,GAAG,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,KAAK,CAAC,IAAI,CAChB,KAAiB,EACjB,GAAqB,EACrB,MAA+B,EAC/B,IAAmB;QAEnB,qGAAqG;QACrG,OAAO,qBAAqB,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IAC7E,CAAC;IAEO,KAAK,CAAC,OAAO,CACnB,KAAiB,EACjB,GAAqB,EACrB,MAA+B,EAC/B,IAAmB;QAEnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,4FAA4F;YAC5F,mFAAmF;YACnF,qFAAqF;YACrF,qEAAqE;YACrE,MAAM,OAAO,GAAG,IAAA,kBAAY,EAAC;gBAC3B,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,GAAG,CAAC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC;gBACvD,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;gBACpD,GAAG,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;gBAChE,GAAG,CAAC,GAAG,CAAC,WAAW,KAAK,SAAS,IAAI,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC;aACvE,CAAC,CAAC;YACH,OAAO,MAAM,CAAC,KAAK,EAAE;gBACnB,QAAQ,EAAE,OAAO,CAAC,QAAQ;gBAC1B,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC/D,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC5D,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;gBACxE,GAAG,CAAC,OAAO,CAAC,WAAW,KAAK,SAAS,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC;aAC/E,CAAC,CAAC;QACL,CAAC;QACD,iFAAiF;QACjF,+EAA+E;QAC/E,4EAA4E;QAC5E,6EAA6E;QAC7E,2EAA2E;QAC3E,mEAAmE;QACnE,MAAM,OAAO,GAAG,IAAA,kBAAY,EAAC;YAC3B,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,GAAG,CAAC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC;YACvD,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;YACpD,GAAG,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;YAChE,GAAG,CAAC,GAAG,CAAC,WAAW,KAAK,SAAS,IAAI,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC;YACtE,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;SACxC,CAAC,CAAC;QACH,mFAAmF;QACnF,IAAA,4BAAsB,EAAC,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC7D,6FAA6F;QAC7F,6EAA6E;QAC7E,MAAM,QAAQ,GACZ,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACxF,MAAM,GAAG,GAAG,KAAK,IAA0B,EAAE;YAC3C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACtC,IAAI,GAAG,KAAK,SAAS;oBAAE,OAAO,GAAG,CAAC;YACpC,CAAC;YACD,0FAA0F;YAC1F,0EAA0E;YAC1E,+FAA+F;YAC/F,MAAM,GAAG,GAAG,qBAAqB,CAC/B,MAAM,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAC3B,MAAM,IAAA,2BAAqB,EAAC,OAAO,EAAE,IAAI,CAAC,cAAc,EAAE;gBACxD,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;gBACvC,4EAA4E;gBAC5E,OAAO,EAAE,IAAI,CAAC,cAAc,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE;aACpD,CAAC,CACH,CACF,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS;gBAAE,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC3D,OAAO,GAAG,CAAC;QACb,CAAC,CAAC;QACF,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACzE,CAAC;IAED,iGAAiG;IACzF,OAAO,CAAC,IAAmB;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,SAAS,CAAC;QACzC,MAAM,GAAG,GACP,CAAC,KAAK,SAAS;YACb,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC;QAChF,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACzE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC;IAChE,CAAC;IAEO,MAAM,CAAC,OAAe,EAAE,GAAqB,EAAE,KAAc;QACnE,OAAO,IAAI,CAAC,SAAS,CAAC;YACpB,CAAC,EAAE,OAAO;YACV,CAAC,EAAE,GAAG,CAAC,MAAM;YACb,IAAI,EAAE,GAAG,CAAC,QAAQ;YAClB,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;SACzC,CAAC,CAAC;IACL,CAAC;CACF;AA1MD,4CA0MC"}

package/dist/confidence.d.ts

@@ -0,0 +1,5 @@
+import type { ConfidenceSignal } from "./types";
+export declare const stopReasonConfidence: ConfidenceSignal;
+export declare function validatorConfidence(validate: (content: string) => boolean): ConfidenceSignal;
+export declare function constantConfidence(value: number): ConfidenceSignal;
+//# sourceMappingURL=confidence.d.ts.map

package/dist/confidence.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"confidence.d.ts","sourceRoot":"","sources":["../src/confidence.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAoB,MAAM,SAAS,CAAC;AAKlE,eAAO,MAAM,oBAAoB,EAAE,gBAalC,CAAC;AAKF,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,GAAG,gBAAgB,CAM5F;AAID,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,gBAAgB,CAElE"}

package/dist/confidence.js

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.stopReasonConfidence = void 0;
+exports.validatorConfidence = validatorConfidence;
+exports.constantConfidence = constantConfidence;
+// Honest, pluggable confidence — NOT a magic self-reported number. The default uses
+// the model's stop reason, the one signal every provider emits: a truncated answer
+// (max_tokens) is low-confidence and should elevate; a clean finish is high.
+exports.stopReasonConfidence = {
+    score(_req, res) {
+        switch (res.stopReason) {
+            case "end_turn":
+                return 0.9;
+            case "tool_use":
+                return 0.9;
+            case "max_tokens":
+                return 0.3;
+            default:
+                return 0.5;
+        }
+    },
+};
+// Confidence from a caller-supplied validator: pass → 1, fail → 0. Use for structured
+// outputs ("did it parse as the expected JSON / a known capability id?"). This turns
+// elevation into "retry on a stronger model until the output validates."
+function validatorConfidence(validate) {
+    return {
+        score(_req, res) {
+            return validate(res.content) ? 1 : 0;
+        },
+    };
+}
+// Agreement across a fixed constant — always returns the given value. Useful to force
+// (never elevate → 1) or always-elevate (→ 0) in tests and pins.
+function constantConfidence(value) {
+    return { score: () => value };
+}
+//# sourceMappingURL=confidence.js.map

package/dist/confidence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"confidence.js","sourceRoot":"","sources":["../src/confidence.ts"],"names":[],"mappings":";;;AAwBA,kDAMC;AAID,gDAEC;AAjCD,oFAAoF;AACpF,mFAAmF;AACnF,6EAA6E;AAChE,QAAA,oBAAoB,GAAqB;IACpD,KAAK,CAAC,IAAsB,EAAE,GAAgB;QAC5C,QAAQ,GAAG,CAAC,UAAU,EAAE,CAAC;YACvB,KAAK,UAAU;gBACb,OAAO,GAAG,CAAC;YACb,KAAK,UAAU;gBACb,OAAO,GAAG,CAAC;YACb,KAAK,YAAY;gBACf,OAAO,GAAG,CAAC;YACb;gBACE,OAAO,GAAG,CAAC;QACf,CAAC;IACH,CAAC;CACF,CAAC;AAEF,sFAAsF;AACtF,qFAAqF;AACrF,yEAAyE;AACzE,SAAgB,mBAAmB,CAAC,QAAsC;IACxE,OAAO;QACL,KAAK,CAAC,IAAsB,EAAE,GAAgB;YAC5C,OAAO,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;KACF,CAAC;AACJ,CAAC;AAED,sFAAsF;AACtF,iEAAiE;AACjE,SAAgB,kBAAkB,CAAC,KAAa;IAC9C,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;AAChC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,6 @@
+export { ReasoningRuntime } from "./ReasoningRuntime";
+export { tagRouter, fixedRouter, rankedRouter, ucb1, epsilonGreedy } from "./router";
+export type { ArmStats, EpsilonGreedyOptions, RankedRouterOptions, Rankings, Ucb1Options, } from "./router";
+export { stopReasonConfidence, validatorConfidence, constantConfidence } from "./confidence";
+export type { ConfidenceSignal, DecideFn, ModelCallRequest, ModelInvoker, ModelRoute, ReasonOptions, ReasoningCache, ReasoningRequest, ReasoningResult, ReasoningRuntimeConfig, ReasoningTraceEntry, Router, } from "./types";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACrF,YAAY,EACV,QAAQ,EACR,oBAAoB,EACpB,mBAAmB,EACnB,QAAQ,EACR,WAAW,GACZ,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC7F,YAAY,EACV,gBAAgB,EAChB,QAAQ,EACR,gBAAgB,EAChB,YAAY,EACZ,UAAU,EACV,aAAa,EACb,cAAc,EACd,gBAAgB,EAChB,eAAe,EACf,sBAAsB,EACtB,mBAAmB,EACnB,MAAM,GACP,MAAM,SAAS,CAAC"}

package/dist/index.js

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.constantConfidence = exports.validatorConfidence = exports.stopReasonConfidence = exports.epsilonGreedy = exports.ucb1 = exports.rankedRouter = exports.fixedRouter = exports.tagRouter = exports.ReasoningRuntime = void 0;
+var ReasoningRuntime_1 = require("./ReasoningRuntime");
+Object.defineProperty(exports, "ReasoningRuntime", { enumerable: true, get: function () { return ReasoningRuntime_1.ReasoningRuntime; } });
+var router_1 = require("./router");
+Object.defineProperty(exports, "tagRouter", { enumerable: true, get: function () { return router_1.tagRouter; } });
+Object.defineProperty(exports, "fixedRouter", { enumerable: true, get: function () { return router_1.fixedRouter; } });
+Object.defineProperty(exports, "rankedRouter", { enumerable: true, get: function () { return router_1.rankedRouter; } });
+Object.defineProperty(exports, "ucb1", { enumerable: true, get: function () { return router_1.ucb1; } });
+Object.defineProperty(exports, "epsilonGreedy", { enumerable: true, get: function () { return router_1.epsilonGreedy; } });
+var confidence_1 = require("./confidence");
+Object.defineProperty(exports, "stopReasonConfidence", { enumerable: true, get: function () { return confidence_1.stopReasonConfidence; } });
+Object.defineProperty(exports, "validatorConfidence", { enumerable: true, get: function () { return confidence_1.validatorConfidence; } });
+Object.defineProperty(exports, "constantConfidence", { enumerable: true, get: function () { return confidence_1.constantConfidence; } });
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,uDAAsD;AAA7C,oHAAA,gBAAgB,OAAA;AACzB,mCAAqF;AAA5E,mGAAA,SAAS,OAAA;AAAE,qGAAA,WAAW,OAAA;AAAE,sGAAA,YAAY,OAAA;AAAE,8FAAA,IAAI,OAAA;AAAE,uGAAA,aAAa,OAAA;AAQlE,2CAA6F;AAApF,kHAAA,oBAAoB,OAAA;AAAE,iHAAA,mBAAmB,OAAA;AAAE,gHAAA,kBAAkB,OAAA"}