@dungle-scrubs/synapse 0.1.0

package/CHANGELOG.md

@@ -0,0 +1,21 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.1.0/),
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## [0.1.0](https://github.com/dungle-scrubs/synapse/releases/tag/v0.1.0) (2026-02-17)
+
+### Added
+
+- **matrix:** `MODEL_MATRIX` capability ratings for 30+ models across code, vision, text
+- **matrix:** `getModelRatings` with longest-prefix matching and provider stripping
+- **matrix:** `modelSupportsTask` for capability/complexity filtering
+- **resolver:** `resolveModelFuzzy` with 6-tier resolution cascade (exact → case-insensitive →
+  normalized → provider/id → token overlap → substring)
+- **resolver:** `resolveModelCandidates` for scoped routing (returns all tied matches)
+- **resolver:** `listAvailableModels` for error messages
+- **classifier:** `classifyTask` using in-process `completeSimple` instead of CLI subprocess
+- **classifier:** `findCheapestModel` by effective cost
+- **selector:** `selectModels` with eco/balanced/premium cost preference sorting

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Kevin Frilot
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,62 @@
+# synapse
+
+Model capability matrix, fuzzy resolver, task classifier, and selection
+algorithm for [pi-ai](https://github.com/nicobrinkkemper/pi-ai) models.
+
+## Install
+
+```bash
+npm install @dungle-scrubs/synapse
+```
+
+Requires `@mariozechner/pi-ai` as a peer dependency.
+
+## Usage
+
+```typescript
+import {
+  classifyTask,
+  resolveModelFuzzy,
+  selectModels,
+  MODEL_MATRIX,
+} from "synapse";
+
+// Fuzzy resolve a human-friendly model name
+const model = resolveModelFuzzy("opus");
+// → { provider: "anthropic", id: "claude-opus-4-6", displayName: "anthropic/claude-opus-4-6" }
+
+// Classify a task's type and complexity
+const classification = await classifyTask("Refactor the auth module", "code");
+// → { type: "code", complexity: 3, reasoning: "..." }
+
+// Select ranked models for the task
+const ranked = selectModels(classification, "balanced");
+// → [{ provider: "anthropic", id: "claude-sonnet-4-5-...", ... }, ...]
+```
+
+## API
+
+### Matrix
+
+- `MODEL_MATRIX` — Capability ratings for known models
+- `getModelRatings(modelId)` — Look up ratings by model ID (prefix matching)
+- `modelSupportsTask(modelId, type, minRating)` — Check if a model supports a task type
+
+### Resolver
+
+- `resolveModelFuzzy(query)` — Fuzzy resolve a name to a single model
+- `resolveModelCandidates(query)` — Resolve to all tied candidates
+- `listAvailableModels()` — List all registered models
+
+### Classifier
+
+- `classifyTask(task, primaryType, agentRole?)` — Classify task type and complexity
+- `findCheapestModel()` — Find the cheapest available model
+
+### Selector
+
+- `selectModels(classification, costPreference, pool?)` — Rank models for a classified task
+
+## License
+
+MIT

package/dist/classifier.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Task classification via cheap LLM call.
+ *
+ * Determines a task's type (code/vision/text) and complexity (1-5)
+ * using the cheapest available model from the registry. Uses pi-ai's
+ * `completeSimple` for in-process inference — no CLI subprocess.
+ */
+import type { ClassificationResult, TaskType } from "./types.js";
+/** Cheapest model info with the data needed to call completeSimple. */
+interface CheapestModelInfo {
+    provider: string;
+    id: string;
+}
+/**
+ * Finds the cheapest available model by effective cost.
+ *
+ * @returns Provider and ID of the cheapest model, or undefined if no models available
+ */
+export declare function findCheapestModel(): CheapestModelInfo | undefined;
+/**
+ * Classify a task's type and complexity using the cheapest available LLM.
+ *
+ * Picks the cheapest model from the registry by (input + output) / 2 cost,
+ * sends a structured classification prompt via `completeSimple`, and parses
+ * the JSON response. Falls back to primaryType + complexity 3 on any failure.
+ *
+ * @param task - The task description to classify
+ * @param primaryType - Agent's default type (used when ambiguous or on failure)
+ * @param agentRole - Optional agent role for additional context
+ * @returns Classification result with type, complexity, and reasoning
+ */
+export declare function classifyTask(task: string, primaryType: TaskType, agentRole?: string): Promise<ClassificationResult>;
+export {};
+//# sourceMappingURL=classifier.d.ts.map

package/dist/classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.d.ts","sourceRoot":"","sources":["../src/classifier.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,oBAAoB,EAAkB,QAAQ,EAAE,MAAM,YAAY,CAAC;AAQjF,uEAAuE;AACvE,UAAU,iBAAiB;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACX;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,IAAI,iBAAiB,GAAG,SAAS,CAejE;AA0ED;;;;;;;;;;;GAWG;AACH,wBAAsB,YAAY,CACjC,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,QAAQ,EACrB,SAAS,CAAC,EAAE,MAAM,GAChB,OAAO,CAAC,oBAAoB,CAAC,CAwC/B"}

package/dist/classifier.js

@@ -0,0 +1,151 @@
+/**
+ * Task classification via cheap LLM call.
+ *
+ * Determines a task's type (code/vision/text) and complexity (1-5)
+ * using the cheapest available model from the registry. Uses pi-ai's
+ * `completeSimple` for in-process inference — no CLI subprocess.
+ */
+import { completeSimple, getModel, getModels, getProviders } from "@mariozechner/pi-ai";
+/** Valid task types for validation. */
+const VALID_TYPES = new Set(["code", "vision", "text"]);
+/** Valid complexity values for validation. */
+const VALID_COMPLEXITIES = new Set([1, 2, 3, 4, 5]);
+/**
+ * Finds the cheapest available model by effective cost.
+ *
+ * @returns Provider and ID of the cheapest model, or undefined if no models available
+ */
+export function findCheapestModel() {
+    let cheapest;
+    let cheapestCost = Number.POSITIVE_INFINITY;
+    for (const provider of getProviders()) {
+        for (const m of getModels(provider)) {
+            const effective = (m.cost.input + m.cost.output) / 2;
+            if (effective < cheapestCost) {
+                cheapestCost = effective;
+                cheapest = { provider: m.provider, id: m.id };
+            }
+        }
+    }
+    return cheapest;
+}
+/**
+ * Builds the classification prompt for the LLM.
+ *
+ * @param task - Task description
+ * @param primaryType - Agent's default type
+ * @param agentRole - Optional agent role context
+ * @returns Formatted prompt string
+ */
+function buildPrompt(task, primaryType, agentRole) {
+    const roleLine = agentRole ? `\nAgent role: ${agentRole}` : "";
+    return `Classify this task on two axes.
+
+TYPE — what LLM capability is needed:
+- code: writing, refactoring, debugging, reviewing code
+- vision: analyzing images, screenshots, UI mockups
+- text: writing docs, planning, general reasoning, research
+
+COMPLEXITY (1-5):
+1 = Trivial (rename file, simple lookup, basic edit)
+2 = Simple (single-file change, add test, fix typo)
+3 = Moderate (multi-file change, implement function, debug)
+4 = Complex (design + implement feature, architecture)
+5 = Expert (cross-system design, security audit, optimization)
+
+Default type for this agent: ${primaryType}
+Use the default unless the task clearly requires a different type.
+
+Task: ${task}${roleLine}
+
+Respond with JSON only: {"type": "<type>", "complexity": <1-5>, "reasoning": "<one line>"}`;
+}
+/**
+ * Extracts and parses JSON from LLM output that may contain markdown fences.
+ *
+ * @param raw - Raw LLM output string
+ * @returns Parsed object, or undefined on failure
+ */
+function extractJson(raw) {
+    // Strip markdown code fences if present
+    const fenceMatch = raw.match(/```(?:json)?\s*\n?([\s\S]*?)\n?```/);
+    const jsonStr = fenceMatch ? fenceMatch[1] : raw;
+    try {
+        return JSON.parse(jsonStr.trim());
+    }
+    catch {
+        // Try to find a JSON object anywhere in the string
+        const objectMatch = jsonStr.match(/\{[\s\S]*\}/);
+        if (objectMatch) {
+            try {
+                return JSON.parse(objectMatch[0]);
+            }
+            catch {
+                return undefined;
+            }
+        }
+        return undefined;
+    }
+}
+/**
+ * Extracts text content from an AssistantMessage's content array.
+ *
+ * @param content - Array of content blocks from pi-ai response
+ * @returns Concatenated text content
+ */
+function extractText(content) {
+    return content
+        .filter((c) => c.type === "text" && c.text)
+        .map((c) => c.text)
+        .join("");
+}
+/**
+ * Classify a task's type and complexity using the cheapest available LLM.
+ *
+ * Picks the cheapest model from the registry by (input + output) / 2 cost,
+ * sends a structured classification prompt via `completeSimple`, and parses
+ * the JSON response. Falls back to primaryType + complexity 3 on any failure.
+ *
+ * @param task - The task description to classify
+ * @param primaryType - Agent's default type (used when ambiguous or on failure)
+ * @param agentRole - Optional agent role for additional context
+ * @returns Classification result with type, complexity, and reasoning
+ */
+export async function classifyTask(task, primaryType, agentRole) {
+    const fallback = {
+        type: primaryType,
+        complexity: 3,
+        reasoning: "fallback: classification unavailable",
+    };
+    const cheapest = findCheapestModel();
+    if (!cheapest)
+        return fallback;
+    const prompt = buildPrompt(task, primaryType, agentRole);
+    try {
+        const model = getModel(cheapest.provider, cheapest.id);
+        const response = await completeSimple(model, {
+            messages: [
+                { role: "user", content: [{ type: "text", text: prompt }], timestamp: Date.now() },
+            ],
+        });
+        const output = extractText(response.content);
+        const parsed = extractJson(output);
+        if (!parsed)
+            return fallback;
+        const type = String(parsed.type);
+        const complexity = Number(parsed.complexity);
+        const reasoning = String(parsed.reasoning ?? "");
+        if (!VALID_TYPES.has(type) || !VALID_COMPLEXITIES.has(complexity)) {
+            return fallback;
+        }
+        return {
+            type: type,
+            complexity: complexity,
+            reasoning,
+        };
+    }
+    catch {
+        return fallback;
+    }
+}
+//# sourceMappingURL=classifier.js.map

package/dist/classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.js","sourceRoot":"","sources":["../src/classifier.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAGxF,uCAAuC;AACvC,MAAM,WAAW,GAAwB,IAAI,GAAG,CAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AAEvF,8CAA8C;AAC9C,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAQzF;;;;GAIG;AACH,MAAM,UAAU,iBAAiB;IAChC,IAAI,QAAuC,CAAC;IAC5C,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAE5C,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACrD,IAAI,SAAS,GAAG,YAAY,EAAE,CAAC;gBAC9B,YAAY,GAAG,SAAS,CAAC;gBACzB,QAAQ,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;YAC/C,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,IAAY,EAAE,WAAqB,EAAE,SAAkB;IAC3E,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,iBAAiB,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/D,OAAO;;;;;;;;;;;;;;+BAcuB,WAAW;;;QAGlC,IAAI,GAAG,QAAQ;;2FAEoE,CAAC;AAC5F,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,GAAW;IAC/B,wCAAwC;IACxC,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAEjD,IAAI,CAAC;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACnC,CAAC;IAAC,MAAM,CAAC;QACR,mDAAmD;QACnD,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,WAAW,EAAE,CAAC;YACjB,IAAI,CAAC;gBACJ,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;YAAC,MAAM,CAAC;gBACR,OAAO,SAAS,CAAC;YAClB,CAAC;QACF,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;AACF,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,OAA+C;IACnE,OAAO,OAAO;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC;SAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAc,CAAC;SAC5B,IAAI,CAAC,EAAE,CAAC,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CACjC,IAAY,EACZ,WAAqB,EACrB,SAAkB;IAElB,MAAM,QAAQ,GAAyB;QACtC,IAAI,EAAE,WAAW;QACjB,UAAU,EAAE,CAAC;QACb,SAAS,EAAE,sCAAsC;KACjD,CAAC;IAEF,MAAM,QAAQ,GAAG,iBAAiB,EAAE,CAAC;IACrC,IAAI,CAAC,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE/B,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IAEzD,IAAI,CAAC;QACJ,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAiB,EAAE,QAAQ,CAAC,EAAW,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,MAAM,cAAc,CAAC,KAAK,EAAE;YAC5C,QAAQ,EAAE;gBACT,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE;aAClF;SACD,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,WAAW,CAAC,QAAQ,CAAC,OAAiD,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM;YAAE,OAAO,QAAQ,CAAC;QAE7B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;QAEjD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACnE,OAAO,QAAQ,CAAC;QACjB,CAAC;QAED,OAAO;YACN,IAAI,EAAE,IAAgB;YACtB,UAAU,EAAE,UAA4B;YACxC,SAAS;SACT,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,QAAQ,CAAC;IACjB,CAAC;AACF,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * synapse — Model capability matrix, fuzzy resolver, task classifier,
+ * and selection algorithm for pi-ai models.
+ *
+ * @module synapse
+ */
+export type { CandidateModel, ClassificationResult, CostPreference, ModelRatings, ModelSource, ResolvedModel, TaskComplexity, TaskType, } from "./types.js";
+export { getModelRatings, MODEL_MATRIX, modelSupportsTask } from "./matrix.js";
+export { listAvailableModels, resolveModelCandidates, resolveModelFuzzy } from "./resolver.js";
+export { classifyTask, findCheapestModel } from "./classifier.js";
+export { selectModels } from "./selector.js";
+//# 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;;;;;GAKG;AAGH,YAAY,EACX,cAAc,EACd,oBAAoB,EACpB,cAAc,EACd,YAAY,EACZ,WAAW,EACX,aAAa,EACb,cAAc,EACd,QAAQ,GACR,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAG/E,OAAO,EAAE,mBAAmB,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAG/F,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAGlE,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC"}

package/dist/index.js

@@ -0,0 +1,15 @@
+/**
+ * synapse — Model capability matrix, fuzzy resolver, task classifier,
+ * and selection algorithm for pi-ai models.
+ *
+ * @module synapse
+ */
+// Matrix
+export { getModelRatings, MODEL_MATRIX, modelSupportsTask } from "./matrix.js";
+// Resolver
+export { listAvailableModels, resolveModelCandidates, resolveModelFuzzy } from "./resolver.js";
+// Classifier
+export { classifyTask, findCheapestModel } from "./classifier.js";
+// Selector
+export { selectModels } from "./selector.js";
+//# 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;;;;;GAKG;AAcH,SAAS;AACT,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAE/E,WAAW;AACX,OAAO,EAAE,mBAAmB,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAE/F,aAAa;AACb,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAElE,WAAW;AACX,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC"}

package/dist/matrix.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Multi-dimensional model capability matrix.
+ *
+ * Maps model ID prefixes to per-task-type capability ratings.
+ * Source: Arena leaderboards (arena.ai/leaderboard/*).
+ */
+import type { ModelRatings, TaskType } from "./types.js";
+/**
+ * Multi-dimensional model capability matrix.
+ *
+ * Source: Arena leaderboards (arena.ai/leaderboard/*), Feb 2026.
+ *
+ * ELO → tier mapping per leaderboard (each has different ELO scale):
+ *   Code:   5=≥1440  4=1370-1439  3=1280-1369  2=1180-1279  1=<1180
+ *   Vision: 5=≥1250  4=1200-1249  3=1150-1199  2=1100-1149  1=<1100
+ *   Text:   5=≥1460  4=1410-1459  3=1370-1409  2=1320-1369  1=<1320
+ *
+ * Ratings use base model scores — no thinking, default effort.
+ */
+export declare const MODEL_MATRIX: Record<string, ModelRatings>;
+/**
+ * Get capability ratings for a model by its ID.
+ *
+ * Uses longest-prefix matching: strips provider prefix (e.g. "anthropic/"),
+ * then finds the longest key in MODEL_MATRIX that the model ID starts with.
+ * E.g., "claude-sonnet-4-5-20250929" matches "claude-sonnet-4-5".
+ *
+ * @param modelId - Full model ID (may include date suffixes)
+ * @returns Capability ratings, or undefined if model not in matrix
+ */
+export declare function getModelRatings(modelId: string): ModelRatings | undefined;
+/**
+ * Check if a model supports a given task type at the required complexity level.
+ *
+ * @param modelId - Full model ID
+ * @param type - Required task type
+ * @param minRating - Minimum required rating (1-5)
+ * @returns true if the model has a rating for the type >= minRating
+ */
+export declare function modelSupportsTask(modelId: string, type: TaskType, minRating: number): boolean;
+//# sourceMappingURL=matrix.d.ts.map

package/dist/matrix.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEzD;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CA6CrD,CAAC;AAKF;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAIzE;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAK7F"}

package/dist/matrix.js

@@ -0,0 +1,97 @@
+/**
+ * Multi-dimensional model capability matrix.
+ *
+ * Maps model ID prefixes to per-task-type capability ratings.
+ * Source: Arena leaderboards (arena.ai/leaderboard/*).
+ */
+/**
+ * Multi-dimensional model capability matrix.
+ *
+ * Source: Arena leaderboards (arena.ai/leaderboard/*), Feb 2026.
+ *
+ * ELO → tier mapping per leaderboard (each has different ELO scale):
+ *   Code:   5=≥1440  4=1370-1439  3=1280-1369  2=1180-1279  1=<1180
+ *   Vision: 5=≥1250  4=1200-1249  3=1150-1199  2=1100-1149  1=<1100
+ *   Text:   5=≥1460  4=1410-1459  3=1370-1409  2=1320-1369  1=<1320
+ *
+ * Ratings use base model scores — no thinking, default effort.
+ */
+export const MODEL_MATRIX = {
+    // Anthropic
+    "claude-opus-4-6": { code: 5, vision: 3, text: 5 },
+    "claude-opus-4-5": { code: 5, vision: 3, text: 5 },
+    "claude-opus-4-1": { code: 4, vision: 3, text: 4 },
+    "claude-sonnet-4-5": { code: 4, vision: 3, text: 4 },
+    "claude-haiku-4-5": { code: 3, vision: 2, text: 3 },
+    // OpenAI
+    "gpt-5.2": { code: 4, vision: 4, text: 4 },
+    "gpt-5": { code: 4, vision: 4, text: 4 },
+    "gpt-5.1": { code: 3, vision: 4, text: 4 },
+    "gpt-5.3-codex": { code: 4, text: 4 },
+    "gpt-5.3-codex-spark": { code: 2, text: 2 },
+    "gpt-5.2-codex": { code: 3, text: 3 },
+    "gpt-5.1-codex-max": { code: 4, text: 4 },
+    "gpt-5.1-codex": { code: 3, text: 3 },
+    "gpt-5.1-codex-mini": { code: 2, text: 2 },
+    // Google
+    "gemini-3-pro": { code: 5, vision: 5, text: 5 },
+    "gemini-3-flash": { code: 5, vision: 5, text: 5 },
+    "gemini-2.5-pro": { code: 2, vision: 4, text: 4 },
+    "gemini-2.5-flash": { vision: 4, text: 4 },
+    // Z.ai (Zhipu)
+    "glm-5": { code: 5, text: 5 },
+    "glm-4.7": { code: 5, text: 4 },
+    "glm-4.6": { code: 3, vision: 3, text: 4 },
+    // DeepSeek
+    "deepseek-reasoner": { code: 4, text: 4 },
+    "deepseek-chat": { code: 3, text: 4 },
+    // MiniMax
+    "minimax-m2.1": { code: 4, text: 3 },
+    "minimax-m2": { code: 3, text: 2 },
+    // Moonshot (Kimi)
+    "kimi-k2.5": { code: 4, text: 4 },
+    "kimi-k2": { code: 3, text: 4 },
+    // Qwen (Alibaba)
+    "qwen3-coder": { code: 3, text: 3 },
+    "qwen3-max": { text: 4 },
+    // xAI
+    "grok-4.1": { code: 2, text: 5 },
+    "grok-4": { code: 1, text: 4 },
+    // Mistral
+    "mistral-large-3": { code: 2, text: 4 },
+    "devstral-2": { code: 2 },
+    "devstral-medium": { code: 1 },
+};
+/** Sorted keys longest-first for prefix matching. */
+const SORTED_KEYS = Object.keys(MODEL_MATRIX).sort((a, b) => b.length - a.length);
+/**
+ * Get capability ratings for a model by its ID.
+ *
+ * Uses longest-prefix matching: strips provider prefix (e.g. "anthropic/"),
+ * then finds the longest key in MODEL_MATRIX that the model ID starts with.
+ * E.g., "claude-sonnet-4-5-20250929" matches "claude-sonnet-4-5".
+ *
+ * @param modelId - Full model ID (may include date suffixes)
+ * @returns Capability ratings, or undefined if model not in matrix
+ */
+export function getModelRatings(modelId) {
+    const bare = modelId.includes("/") ? modelId.slice(modelId.indexOf("/") + 1) : modelId;
+    const key = SORTED_KEYS.find((k) => bare.startsWith(k));
+    return key ? MODEL_MATRIX[key] : undefined;
+}
+/**
+ * Check if a model supports a given task type at the required complexity level.
+ *
+ * @param modelId - Full model ID
+ * @param type - Required task type
+ * @param minRating - Minimum required rating (1-5)
+ * @returns true if the model has a rating for the type >= minRating
+ */
+export function modelSupportsTask(modelId, type, minRating) {
+    const ratings = getModelRatings(modelId);
+    if (!ratings)
+        return false;
+    const rating = ratings[type];
+    return rating !== undefined && rating >= minRating;
+}
+//# sourceMappingURL=matrix.js.map

package/dist/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../src/matrix.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,YAAY,GAAiC;IACzD,YAAY;IACZ,iBAAiB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAClD,iBAAiB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAClD,iBAAiB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAClD,mBAAmB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACpD,kBAAkB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACnD,SAAS;IACT,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC1C,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACxC,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC1C,eAAe,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACrC,qBAAqB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC3C,eAAe,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACrC,mBAAmB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACzC,eAAe,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACrC,oBAAoB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC1C,SAAS;IACT,cAAc,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC/C,gBAAgB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACjD,gBAAgB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACjD,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC1C,eAAe;IACf,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC7B,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC/B,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC1C,WAAW;IACX,mBAAmB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACzC,eAAe,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACrC,UAAU;IACV,cAAc,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACpC,YAAY,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAClC,kBAAkB;IAClB,WAAW,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACjC,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC/B,iBAAiB;IACjB,aAAa,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACnC,WAAW,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE;IACxB,MAAM;IACN,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAChC,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IAC9B,UAAU;IACV,iBAAiB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;IACvC,YAAY,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE;IACzB,iBAAiB,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE;CAC9B,CAAC;AAEF,qDAAqD;AACrD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AAElF;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe;IAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IACvF,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAe,EAAE,IAAc,EAAE,SAAiB;IACnF,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,IAAI,SAAS,CAAC;AACpD,CAAC"}

package/dist/resolver.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Fuzzy model name resolution against the pi-ai model registry.
+ *
+ * Resolves human-friendly names like "opus", "sonnet 4.5" to exact
+ * provider/model-id pairs using a 6-tier resolution cascade.
+ */
+import type { ModelSource, ResolvedModel } from "./types.js";
+/**
+ * Resolves a human-friendly model name to a single exact provider/model-id.
+ *
+ * Finds all tied candidates via the resolution cascade, then picks the
+ * best one using capability score → shortest ID → lexicographic ordering.
+ *
+ * @param query - Human-friendly model name (e.g. "opus", "sonnet 4.5", "claude-opus-4-5")
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Resolved model, or undefined if no match found
+ */
+export declare function resolveModelFuzzy(query: string, modelSource?: ModelSource): ResolvedModel | undefined;
+/**
+ * Resolves a human-friendly model name to ALL tied candidates.
+ *
+ * Same resolution cascade as `resolveModelFuzzy`, but returns every model
+ * that ties at the best score instead of picking one. Used by the model
+ * router for scoped auto-routing: "codex" → all codex models → classify
+ * task → pick the right one for the job.
+ *
+ * @param query - Human-friendly model name (e.g. "codex", "opus", "gemini flash")
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Array of resolved models (may be empty if no match)
+ */
+export declare function resolveModelCandidates(query: string, modelSource?: ModelSource): ResolvedModel[];
+/**
+ * Lists all available models from the registry for error messages.
+ *
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Array of model display strings ("provider/id")
+ */
+export declare function listAvailableModels(modelSource?: ModelSource): string[];
+//# sourceMappingURL=resolver.d.ts.map

package/dist/resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver.d.ts","sourceRoot":"","sources":["../src/resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EAAkB,WAAW,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAsL7E;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAChC,KAAK,EAAE,MAAM,EACb,WAAW,CAAC,EAAE,WAAW,GACvB,aAAa,GAAG,SAAS,CAI3B;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE,CAEhG;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,WAAW,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE,CAGvE"}

package/dist/resolver.js

@@ -0,0 +1,221 @@
+/**
+ * Fuzzy model name resolution against the pi-ai model registry.
+ *
+ * Resolves human-friendly names like "opus", "sonnet 4.5" to exact
+ * provider/model-id pairs using a 6-tier resolution cascade.
+ */
+import { getModels, getProviders } from "@mariozechner/pi-ai";
+import { getModelRatings } from "./matrix.js";
+/**
+ * Collects all models from every registered provider.
+ *
+ * @returns Flat array of candidate models with provider, id, and name
+ */
+function getAllModels() {
+    const result = [];
+    for (const provider of getProviders()) {
+        for (const m of getModels(provider)) {
+            result.push({ provider: m.provider, id: m.id, name: m.name });
+        }
+    }
+    return result;
+}
+/**
+ * Builds a ResolvedModel from a candidate.
+ *
+ * @param m - Candidate model
+ * @returns ResolvedModel with display name
+ */
+function toResolved(m) {
+    return { provider: m.provider, id: m.id, displayName: `${m.provider}/${m.id}` };
+}
+/**
+ * Sum of all capability ratings for a model from the matrix.
+ * Higher = more capable. Returns 0 if not in matrix.
+ *
+ * @param id - Model ID
+ * @returns Total capability score
+ */
+function capabilityScore(id) {
+    const ratings = getModelRatings(id);
+    if (!ratings)
+        return 0;
+    return Object.values(ratings).reduce((sum, v) => sum + (v ?? 0), 0);
+}
+/**
+ * Picks the best candidate from a list of fuzzy-match ties.
+ *
+ * Tiebreak order:
+ * 1. Highest capability score (from model matrix) — picks the most capable model
+ * 2. Shortest model ID — prefers concise canonical names over variants
+ * 3. Lexicographically last — higher version numbers win ("5.3" > "5.2")
+ *
+ * @param models - Array of candidates to pick from
+ * @returns The best candidate by capability-then-shortest-then-latest
+ */
+function pickBest(models) {
+    return models.reduce((a, b) => {
+        const aCap = capabilityScore(a.id);
+        const bCap = capabilityScore(b.id);
+        if (aCap !== bCap)
+            return aCap > bCap ? a : b;
+        if (a.id.length !== b.id.length)
+            return a.id.length < b.id.length ? a : b;
+        return a.id >= b.id ? a : b;
+    });
+}
+/**
+ * Splits a string into lowercase tokens on spaces, hyphens, underscores, dots,
+ * and word↔digit boundaries (e.g. "codex5" → ["codex", "5"]).
+ *
+ * @param s - Input string
+ * @returns Array of non-empty lowercase tokens
+ */
+function tokenize(s) {
+    return s
+        .toLowerCase()
+        .replace(/([a-z])(\d)/g, "$1 $2")
+        .replace(/(\d)([a-z])/g, "$1 $2")
+        .split(/[\s\-_.]+/)
+        .filter((t) => t.length > 0);
+}
+/**
+ * Strips all common separators and lowercases for normalized comparison.
+ * "glm-5" → "glm5", "claude-sonnet-4-5" → "claudesonnet45"
+ *
+ * @param s - Input string
+ * @returns Normalized string with separators removed
+ */
+function normalize(s) {
+    return s.toLowerCase().replace(/[\s\-_.]+/g, "");
+}
+/**
+ * Finds all fuzzy-matched candidates for a query (before tiebreaking).
+ *
+ * Returns all models that tie at the best score for whichever resolution
+ * tier first produces a match. Used by `resolveModelFuzzy` (picks one)
+ * and `resolveModelCandidates` (returns all for scoped routing).
+ *
+ * Resolution cascade:
+ * 1. Exact ID match across all providers
+ * 2. Case-insensitive ID match
+ * 2.5. Normalized match — strips separators ("glm5" → "glm-5")
+ * 3. Provider/ID format (e.g. "anthropic/claude-sonnet-4-5")
+ * 4. Token overlap — split query into tokens, score models by weighted
+ *    token matches. ID/name matches score 2, provider-only matches score 1.
+ *    Best score wins.
+ * 5. Substring match — query appears as substring in model ID or name
+ * 6. Normalized substring — strips separators before substring comparison
+ *
+ * @param query - Human-friendly model name (e.g. "opus", "sonnet 4.5", "codex")
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Array of tied candidates from the first matching tier, or empty
+ */
+function findCandidates(query, modelSource) {
+    const models = modelSource ? modelSource() : getAllModels();
+    if (models.length === 0)
+        return [];
+    const q = query.trim();
+    if (q.length === 0)
+        return [];
+    const qLower = q.toLowerCase();
+    // 1. Exact ID match
+    const exact = models.filter((m) => m.id === q);
+    if (exact.length > 0)
+        return exact;
+    // 2. Case-insensitive ID match
+    const ciMatch = models.filter((m) => m.id.toLowerCase() === qLower);
+    if (ciMatch.length > 0)
+        return ciMatch;
+    // 2.5. Normalized match — strips separators ("glm5" matches "glm-5")
+    const qNorm = normalize(q);
+    const normMatch = models.filter((m) => normalize(m.id) === qNorm);
+    if (normMatch.length > 0)
+        return normMatch;
+    // 3. Provider/ID format
+    if (q.includes("/")) {
+        const slashIdx = q.indexOf("/");
+        const provider = q.slice(0, slashIdx).toLowerCase();
+        const id = q.slice(slashIdx + 1).toLowerCase();
+        const providerMatch = models.filter((m) => m.provider.toLowerCase() === provider && m.id.toLowerCase() === id);
+        if (providerMatch.length > 0)
+            return providerMatch;
+    }
+    // 4. Token overlap scoring (ID/name matches weighted 2×, provider-only 1×)
+    const queryTokens = tokenize(q);
+    if (queryTokens.length > 0) {
+        let bestScore = 0;
+        let bestMatches = [];
+        for (const m of models) {
+            const idName = `${m.id} ${m.name}`.toLowerCase();
+            const providerStr = m.provider.toLowerCase();
+            let score = 0;
+            for (const t of queryTokens) {
+                if (idName.includes(t))
+                    score += 2;
+                else if (providerStr.includes(t))
+                    score += 1;
+            }
+            if (score > bestScore) {
+                bestScore = score;
+                bestMatches = [m];
+            }
+            else if (score === bestScore && score > 0) {
+                bestMatches.push(m);
+            }
+        }
+        if (bestScore > 0 && bestMatches.length > 0)
+            return bestMatches;
+    }
+    // 5. Substring match (raw)
+    const subMatches = models.filter((m) => m.id.toLowerCase().includes(qLower) || m.name.toLowerCase().includes(qLower));
+    if (subMatches.length > 0)
+        return subMatches;
+    // 6. Substring match (normalized — strips separators before comparing)
+    const normSubMatches = models.filter((m) => normalize(m.id).includes(qNorm) || normalize(m.name).includes(qNorm));
+    if (normSubMatches.length > 0)
+        return normSubMatches;
+    return [];
+}
+/**
+ * Resolves a human-friendly model name to a single exact provider/model-id.
+ *
+ * Finds all tied candidates via the resolution cascade, then picks the
+ * best one using capability score → shortest ID → lexicographic ordering.
+ *
+ * @param query - Human-friendly model name (e.g. "opus", "sonnet 4.5", "claude-opus-4-5")
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Resolved model, or undefined if no match found
+ */
+export function resolveModelFuzzy(query, modelSource) {
+    const candidates = findCandidates(query, modelSource);
+    if (candidates.length === 0)
+        return undefined;
+    return toResolved(pickBest(candidates));
+}
+/**
+ * Resolves a human-friendly model name to ALL tied candidates.
+ *
+ * Same resolution cascade as `resolveModelFuzzy`, but returns every model
+ * that ties at the best score instead of picking one. Used by the model
+ * router for scoped auto-routing: "codex" → all codex models → classify
+ * task → pick the right one for the job.
+ *
+ * @param query - Human-friendly model name (e.g. "codex", "opus", "gemini flash")
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Array of resolved models (may be empty if no match)
+ */
+export function resolveModelCandidates(query, modelSource) {
+    return findCandidates(query, modelSource).map(toResolved);
+}
+/**
+ * Lists all available models from the registry for error messages.
+ *
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Array of model display strings ("provider/id")
+ */
+export function listAvailableModels(modelSource) {
+    const models = modelSource ? modelSource() : getAllModels();
+    return models.map((m) => `${m.provider}/${m.id}`);
+}
+//# sourceMappingURL=resolver.js.map

package/dist/resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver.js","sourceRoot":"","sources":["../src/resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAG9C;;;;GAIG;AACH,SAAS,YAAY;IACpB,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,CAAiB;IACpC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;AACjF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,EAAU;IAClC,MAAM,OAAO,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IACpC,IAAI,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC;IACvB,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,QAAQ,CAAC,MAAwB;IACzC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,CAAS;IAC1B,OAAO,CAAC;SACN,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC;SAChC,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC;SAChC,KAAK,CAAC,WAAW,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,CAAS;IAC3B,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,SAAS,cAAc,CAAC,KAAa,EAAE,WAAyB;IAC/D,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC;IAC5D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACvB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAE/B,oBAAoB;IACpB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAEnC,+BAA+B;IAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC;IACpE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,OAAO,CAAC;IAEvC,qEAAqE;IACrE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC;IAClE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAE3C,wBAAwB;IACxB,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;QACpD,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAC/C,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,CACzE,CAAC;QACF,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,aAAa,CAAC;IACpD,CAAC;IAED,2EAA2E;IAC3E,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAqB,EAAE,CAAC;QAEvC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACjD,MAAM,WAAW,GAAG,CAAC,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;qBAC9B,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,KAAK,IAAI,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACvB,SAAS,GAAG,KAAK,CAAC;gBAClB,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;iBAAM,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC7C,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,WAAW,CAAC;IACjE,CAAC;IAED,2BAA2B;IAC3B,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAC/B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CACnF,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IAE7C,uEAAuE;IACvE,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAC3E,CAAC;IACF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,cAAc,CAAC;IAErD,OAAO,EAAE,CAAC;AACX,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAChC,KAAa,EACb,WAAyB;IAEzB,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACtD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,OAAO,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa,EAAE,WAAyB;IAC9E,OAAO,cAAc,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,WAAyB;IAC5D,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC;IAC5D,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACnD,CAAC"}

package/dist/selector.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Model selection algorithm.
+ *
+ * Given a classified task and cost preference, ranks available models
+ * by suitability. Consumers use the first result and fall back to the rest.
+ */
+import type { ClassificationResult, CostPreference, ResolvedModel } from "./types.js";
+/**
+ * Selects models for a classified task, ranked by preference.
+ *
+ * Algorithm:
+ * 1. Enumerate all models from registry that have matrix ratings
+ * 2. Filter: model has rating for classification.type
+ * 3. Filter: rating[type] >= classification.complexity
+ * 4. Sort by cost preference:
+ *    - "eco": ascending by effective cost
+ *    - "premium": descending by effective cost
+ *    - "balanced": exact rating match first, then ascending cost
+ * 5. Return ranked list (caller uses first, falls back to rest)
+ *
+ * @param classification - Task classification result
+ * @param costPreference - Cost preference for sorting
+ * @param pool - Optional pre-resolved model pool (for scoped routing)
+ * @returns Ranked list of suitable models (may be empty)
+ */
+export declare function selectModels(classification: ClassificationResult, costPreference: CostPreference, pool?: ResolvedModel[]): ResolvedModel[];
+//# sourceMappingURL=selector.d.ts.map

package/dist/selector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"selector.d.ts","sourceRoot":"","sources":["../src/selector.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,KAAK,EAEX,oBAAoB,EACpB,cAAc,EAGd,aAAa,EACb,MAAM,YAAY,CAAC;AAuFpB;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,YAAY,CAC3B,cAAc,EAAE,oBAAoB,EACpC,cAAc,EAAE,cAAc,EAC9B,IAAI,CAAC,EAAE,aAAa,EAAE,GACpB,aAAa,EAAE,CAyBjB"}

package/dist/selector.js

@@ -0,0 +1,126 @@
+/**
+ * Model selection algorithm.
+ *
+ * Given a classified task and cost preference, ranks available models
+ * by suitability. Consumers use the first result and fall back to the rest.
+ */
+import { getModels, getProviders } from "@mariozechner/pi-ai";
+import { getModelRatings } from "./matrix.js";
+/**
+ * Collects all models from every registered provider.
+ *
+ * @returns Flat array of candidate models
+ */
+function getAllModels() {
+    const result = [];
+    for (const provider of getProviders()) {
+        for (const m of getModels(provider)) {
+            result.push({ provider: m.provider, id: m.id, name: m.name });
+        }
+    }
+    return result;
+}
+/**
+ * Enumerates all models from the registry with their ratings and costs.
+ *
+ * @param modelSource - Optional model-fetching function (defaults to pi-ai registry)
+ * @returns Array of candidates that exist in the capability matrix
+ */
+function enumerateCandidates(modelSource) {
+    const candidates = [];
+    const models = modelSource ? modelSource() : getAllModels();
+    for (const provider of getProviders()) {
+        for (const regModel of getModels(provider)) {
+            // Only include models that are in our source list (or all if no source)
+            if (modelSource &&
+                !models.some((m) => m.id === regModel.id && m.provider === regModel.provider)) {
+                continue;
+            }
+            const ratings = getModelRatings(regModel.id);
+            if (!ratings)
+                continue;
+            candidates.push({
+                resolved: {
+                    provider: regModel.provider,
+                    id: regModel.id,
+                    displayName: `${regModel.provider}/${regModel.id}`,
+                },
+                ratings,
+                effectiveCost: (regModel.cost.input + regModel.cost.output) / 2,
+            });
+        }
+    }
+    return candidates;
+}
+/**
+ * Converts a set of pre-resolved models into scored candidates.
+ *
+ * Used for scoped routing: takes fuzzy-matched models and enriches them
+ * with ratings and cost data so they can be filtered/sorted by selectModels.
+ *
+ * @param pool - Pre-resolved models to convert
+ * @returns Scored candidates (only those with matrix ratings)
+ */
+function candidatesFromPool(pool) {
+    const candidates = [];
+    for (const resolved of pool) {
+        const ratings = getModelRatings(resolved.id);
+        if (!ratings)
+            continue;
+        // Look up cost from registry
+        let effectiveCost = 0;
+        for (const provider of getProviders()) {
+            for (const model of getModels(provider)) {
+                if (model.id === resolved.id && model.provider === resolved.provider) {
+                    effectiveCost = (model.cost.input + model.cost.output) / 2;
+                }
+            }
+        }
+        candidates.push({ resolved, ratings, effectiveCost });
+    }
+    return candidates;
+}
+/**
+ * Selects models for a classified task, ranked by preference.
+ *
+ * Algorithm:
+ * 1. Enumerate all models from registry that have matrix ratings
+ * 2. Filter: model has rating for classification.type
+ * 3. Filter: rating[type] >= classification.complexity
+ * 4. Sort by cost preference:
+ *    - "eco": ascending by effective cost
+ *    - "premium": descending by effective cost
+ *    - "balanced": exact rating match first, then ascending cost
+ * 5. Return ranked list (caller uses first, falls back to rest)
+ *
+ * @param classification - Task classification result
+ * @param costPreference - Cost preference for sorting
+ * @param pool - Optional pre-resolved model pool (for scoped routing)
+ * @returns Ranked list of suitable models (may be empty)
+ */
+export function selectModels(classification, costPreference, pool) {
+    const { type, complexity } = classification;
+    const allCandidates = pool ? candidatesFromPool(pool) : enumerateCandidates();
+    const candidates = allCandidates.filter((c) => {
+        const rating = c.ratings[type];
+        return rating !== undefined && rating >= complexity;
+    });
+    if (candidates.length === 0)
+        return [];
+    candidates.sort((a, b) => {
+        if (costPreference === "eco") {
+            return a.effectiveCost - b.effectiveCost;
+        }
+        if (costPreference === "premium") {
+            return b.effectiveCost - a.effectiveCost;
+        }
+        // "balanced": exact-match rating sorts first, then ascending cost
+        const aExact = a.ratings[type] === complexity ? 0 : 1;
+        const bExact = b.ratings[type] === complexity ? 0 : 1;
+        if (aExact !== bExact)
+            return aExact - bExact;
+        return a.effectiveCost - b.effectiveCost;
+    });
+    return candidates.map((c) => c.resolved);
+}
+//# sourceMappingURL=selector.js.map

package/dist/selector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selector.js","sourceRoot":"","sources":["../src/selector.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAiB9C;;;;GAIG;AACH,SAAS,YAAY;IACpB,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,WAAyB;IACrD,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC;IAE5D,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,EAAE,CAAC;QACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,wEAAwE;YACxE,IACC,WAAW;gBACX,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ,CAAC,EAC5E,CAAC;gBACF,SAAS;YACV,CAAC;YACD,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,UAAU,CAAC,IAAI,CAAC;gBACf,QAAQ,EAAE;oBACT,QAAQ,EAAE,QAAQ,CAAC,QAAQ;oBAC3B,EAAE,EAAE,QAAQ,CAAC,EAAE;oBACf,WAAW,EAAE,GAAG,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,EAAE,EAAE;iBAClD;gBACD,OAAO;gBACP,aAAa,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;aAC/D,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IACD,OAAO,UAAU,CAAC;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,IAAqB;IAChD,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,6BAA6B;QAC7B,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,EAAE,CAAC;YACvC,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzC,IAAI,KAAK,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,IAAI,KAAK,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ,EAAE,CAAC;oBACtE,aAAa,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC5D,CAAC;YACF,CAAC;QACF,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,UAAU,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,YAAY,CAC3B,cAAoC,EACpC,cAA8B,EAC9B,IAAsB;IAEtB,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,cAAc,CAAC;IAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,mBAAmB,EAAE,CAAC;IAC9E,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7C,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,IAAI,UAAU,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,IAAI,cAAc,KAAK,KAAK,EAAE,CAAC;YAC9B,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;QAC1C,CAAC;QACD,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAClC,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;QAC1C,CAAC;QACD,kEAAkE;QAClE,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO,MAAM,GAAG,MAAM,CAAC;QAC9C,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;AAC1C,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,32 @@
+/** LLM task types for routing. */
+export type TaskType = "code" | "vision" | "text";
+/**
+ * Per-type capability ratings. Scale: 1 (basic) to 5 (frontier).
+ * Missing key = model doesn't support that type.
+ */
+export type ModelRatings = Partial<Record<TaskType, number>>;
+/** User's cost preference for model routing. */
+export type CostPreference = "eco" | "balanced" | "premium";
+/** Task complexity level (1-5). */
+export type TaskComplexity = 1 | 2 | 3 | 4 | 5;
+/** Result of task classification. */
+export interface ClassificationResult {
+    type: TaskType;
+    complexity: TaskComplexity;
+    reasoning: string;
+}
+/** A resolved model with provider and display name. */
+export interface ResolvedModel {
+    provider: string;
+    id: string;
+    displayName: string;
+}
+/** Model-fetching function signature for dependency injection. */
+export interface CandidateModel {
+    provider: string;
+    id: string;
+    name: string;
+}
+/** Model source function for dependency injection in resolver/selector. */
+export type ModelSource = () => CandidateModel[];
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,kCAAkC;AAClC,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,CAAC;AAElD;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AAE7D,gDAAgD;AAChD,MAAM,MAAM,cAAc,GAAG,KAAK,GAAG,UAAU,GAAG,SAAS,CAAC;AAE5D,mCAAmC;AACnC,MAAM,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAE/C,qCAAqC;AACrC,MAAM,WAAW,oBAAoB;IACpC,IAAI,EAAE,QAAQ,CAAC;IACf,UAAU,EAAE,cAAc,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,uDAAuD;AACvD,MAAM,WAAW,aAAa;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;CACpB;AAED,kEAAkE;AAClE,MAAM,WAAW,cAAc;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACb;AAED,2EAA2E;AAC3E,MAAM,MAAM,WAAW,GAAG,MAAM,cAAc,EAAE,CAAC"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":""}

package/package.json

@@ -0,0 +1,37 @@
+{
+	"name": "@dungle-scrubs/synapse",
+	"version": "0.1.0",
+	"description": "Model capability matrix, fuzzy resolver, task classifier, and selection algorithm for pi-ai models",
+	"type": "module",
+	"main": "dist/index.js",
+	"types": "dist/index.d.ts",
+	"exports": {
+		".": {
+			"import": "./dist/index.js",
+			"types": "./dist/index.d.ts"
+		}
+	},
+	"files": ["dist", "README.md", "CHANGELOG.md"],
+	"peerDependencies": {
+		"@mariozechner/pi-ai": ">=0.50.0"
+	},
+	"devDependencies": {
+		"@biomejs/biome": "^1.9.4",
+		"@mariozechner/pi-ai": "0.52.12",
+		"@types/bun": "^1.2.5",
+		"typescript": "^5.7.3"
+	},
+	"scripts": {
+		"build": "tsc",
+		"typecheck": "tsc --noEmit",
+		"test": "bun test",
+		"lint": "biome check src/ __tests__/",
+		"lint:fix": "biome check --write src/ __tests__/"
+	},
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/dungle-scrubs/synapse.git"
+	},
+	"author": "Kevin Frilot",
+	"license": "MIT"
+}