@burtson-labs/agent-core 1.6.44 → 1.6.45

package/dist/graph/index.d.ts

@@ -4,4 +4,5 @@ export * from './loopNode';
 export * from './contracts';
 export * from './envelopes';
 export * from './planner';
+export * from './routing';
 //# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC"}

package/dist/graph/index.js

@@ -20,4 +20,5 @@ __exportStar(require("./loopNode"), exports);
 __exportStar(require("./contracts"), exports);
 __exportStar(require("./envelopes"), exports);
 __exportStar(require("./planner"), exports);
+__exportStar(require("./routing"), exports);
 //# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,8CAA4B;AAC5B,6CAA2B;AAC3B,8CAA4B;AAC5B,8CAA4B;AAC5B,4CAA0B"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,8CAA4B;AAC5B,6CAA2B;AAC3B,8CAA4B;AAC5B,8CAA4B;AAC5B,4CAA0B;AAC1B,4CAA0B"}

package/dist/graph/routing.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Phase 10 — routing heuristics (the cheap pre-gate).
+ *
+ * Empirical routing (Phase 10 proper) needs the BanditBench baseline to say
+ * WHICH execution mode wins for WHICH task shape. But calling the planner
+ * model on every prompt just to hear "this is a plain loop" is wasteful — most
+ * prompts are obviously not graph-shaped. This module is the zero-inference
+ * pre-gate: a fast, explainable signal for whether a prompt is even worth
+ * asking the planner about.
+ *
+ * It NEVER decides execution — it only gates the (paid) planner call:
+ *   score low   → don't bother the planner; run the normal loop
+ *   score high  → the prompt smells decomposable; offer/consult the planner
+ *
+ * Deliberately conservative and transparent (returns its reasons) so a host
+ * can log why it routed, and so tuning it against the bench is inspectable
+ * rather than a black box. "graph rarely wins" is the null hypothesis the
+ * bench exists to test, so the bar to even SUGGEST a graph is high.
+ */
+export interface GraphShapeSignal {
+    /** 0..1 — how graph-shaped the prompt looks. */
+    score: number;
+    /** Human-readable contributors, for logging + tuning. */
+    reasons: string[];
+    /** Convenience: score >= the suggest threshold. */
+    suggestsGraph: boolean;
+}
+export interface GraphShapeOptions {
+    /** Score at/above which we'd consult the planner. Default 0.6 (high bar). */
+    suggestThreshold?: number;
+}
+/**
+ * Score how graph-shaped a prompt looks. Pure, fast, no model call.
+ */
+export declare function classifyGraphShaped(prompt: string, opts?: GraphShapeOptions): GraphShapeSignal;
+//# sourceMappingURL=routing.d.ts.map

package/dist/graph/routing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"routing.d.ts","sourceRoot":"","sources":["../../src/graph/routing.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,MAAM,WAAW,gBAAgB;IAC/B,gDAAgD;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,yDAAyD;IACzD,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,mDAAmD;IACnD,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,iBAAiB;IAChC,6EAA6E;IAC7E,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AA+CD;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,GAAE,iBAAsB,GAAG,gBAAgB,CA0DlG"}

package/dist/graph/routing.js

@@ -0,0 +1,122 @@
+"use strict";
+/**
+ * Phase 10 — routing heuristics (the cheap pre-gate).
+ *
+ * Empirical routing (Phase 10 proper) needs the BanditBench baseline to say
+ * WHICH execution mode wins for WHICH task shape. But calling the planner
+ * model on every prompt just to hear "this is a plain loop" is wasteful — most
+ * prompts are obviously not graph-shaped. This module is the zero-inference
+ * pre-gate: a fast, explainable signal for whether a prompt is even worth
+ * asking the planner about.
+ *
+ * It NEVER decides execution — it only gates the (paid) planner call:
+ *   score low   → don't bother the planner; run the normal loop
+ *   score high  → the prompt smells decomposable; offer/consult the planner
+ *
+ * Deliberately conservative and transparent (returns its reasons) so a host
+ * can log why it routed, and so tuning it against the bench is inspectable
+ * rather than a black box. "graph rarely wins" is the null hypothesis the
+ * bench exists to test, so the bar to even SUGGEST a graph is high.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.classifyGraphShaped = classifyGraphShaped;
+// Phrases that signal INDEPENDENT sub-parts (the thing a graph is for).
+const MULTI_PART_MARKERS = [
+    /\bcompare\b[\s\S]*\b(?:and|vs\.?|versus|with|to|against)\b/i, // two-sided compare
+    /\bcontrast\b/i,
+    /\beach of\b/i,
+    /\bboth\b[\s\S]*\band\b/i,
+    /\bin parallel\b/i,
+    /\bseparately\b/i,
+    /\bindependently\b/i,
+    /\bacross (the |these |all )?\w+/i,
+    /\bfor (?:each|every)\b/i,
+    // Sequential fan-in: "…then/finally summarize/combine/merge the results".
+    /\b(?:then|afterwards|finally)\b[\s\S]*\b(?:summari[sz]|synthesi[sz]|combin|merg|compil)/i,
+];
+// Explicit enumeration: "A, B, and C" or "A and B" of comparable nouns.
+const AND_LIST = /\b\w[\w./-]*(?:,\s*\w[\w./-]*)+\s*,?\s*and\s+\w[\w./-]*/i;
+const SIMPLE_AND = /\band\b/i;
+// A synthesis verb paired with multiple sources is the classic fan-in shape.
+// "compar(e|ison)" counts here too — a comparison IS a synthesis over sources.
+const SYNTHESIS_MARKERS = [
+    /\bsummari[sz]e\b/i,
+    /\bsynthesi[sz]e\b/i,
+    /\bcombine\b/i,
+    /\breport\b/i,
+    /\boverview\b/i,
+    /\bcompar(?:e|ison|ing)\b/i,
+];
+// Strong single-step signals that argue AGAINST a graph regardless.
+const SINGLE_STEP_MARKERS = [
+    /\bfix (the |a )?typo\b/i,
+    /\brename\b/i,
+    /\bbump (the )?version\b/i,
+    /^\s*(what|where|when|who|why|how)\b.*\?\s*$/i, // a single question
+    /\badd (a |an )?(comment|line|import|field)\b/i,
+];
+/** Count distinct file-ish tokens (paths, dotted names) mentioned. */
+function fileMentions(text) {
+    const matches = text.match(/\b[\w-]+\/[\w./-]+|\b[\w-]+\.(ts|tsx|js|jsx|py|cs|go|rs|md|json|ya?ml|sh)\b/gi) ?? [];
+    return new Set(matches.map((m) => m.toLowerCase())).size;
+}
+/**
+ * Score how graph-shaped a prompt looks. Pure, fast, no model call.
+ */
+function classifyGraphShaped(prompt, opts = {}) {
+    const threshold = opts.suggestThreshold ?? 0.6;
+    const text = prompt.trim();
+    const reasons = [];
+    let score = 0;
+    // Very short prompts are almost never worth decomposing.
+    const words = text.split(/\s+/).filter(Boolean).length;
+    if (words < 8) {
+        return { score: 0, reasons: ['prompt too short to decompose'], suggestsGraph: false };
+    }
+    // Hard single-step signals cap the score low — a typo fix is a typo fix.
+    for (const re of SINGLE_STEP_MARKERS) {
+        if (re.test(text)) {
+            return { score: 0.1, reasons: [`single-step marker: ${re.source}`], suggestsGraph: false };
+        }
+    }
+    const multiPartHits = MULTI_PART_MARKERS.filter((re) => re.test(text));
+    if (multiPartHits.length > 0) {
+        score += 0.4;
+        reasons.push(`multi-part phrasing (${multiPartHits.length})`);
+    }
+    const files = fileMentions(text);
+    if (files >= 3) {
+        score += 0.3;
+        reasons.push(`${files} distinct files/paths mentioned`);
+    }
+    else if (files === 2) {
+        score += 0.15;
+        reasons.push('2 files/paths mentioned');
+    }
+    const hasSynthesis = SYNTHESIS_MARKERS.some((re) => re.test(text));
+    const hasList = AND_LIST.test(text);
+    if (hasSynthesis && (hasList || multiPartHits.length > 0 || files >= 2)) {
+        // Synthesis over multiple things = the fan-in a graph handles well.
+        score += 0.3;
+        reasons.push('synthesis over multiple sources');
+    }
+    else if (hasList) {
+        score += 0.15;
+        reasons.push('enumerated list of targets');
+    }
+    else if (SIMPLE_AND.test(text) && words >= 20) {
+        // A bare "and" in a long prompt is weak evidence at most.
+        score += 0.05;
+        reasons.push('conjunction in a long prompt');
+    }
+    // Long, dense prompts have more room for separable work.
+    if (words >= 40) {
+        score += 0.1;
+        reasons.push('long prompt');
+    }
+    score = Math.min(1, score);
+    if (reasons.length === 0)
+        reasons.push('no graph-shape signals');
+    return { score, reasons, suggestsGraph: score >= threshold };
+}
+//# sourceMappingURL=routing.js.map

package/dist/graph/routing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"routing.js","sourceRoot":"","sources":["../../src/graph/routing.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;AAgEH,kDA0DC;AA1GD,wEAAwE;AACxE,MAAM,kBAAkB,GAAG;IACzB,6DAA6D,EAAE,oBAAoB;IACnF,eAAe;IACf,cAAc;IACd,yBAAyB;IACzB,kBAAkB;IAClB,iBAAiB;IACjB,oBAAoB;IACpB,kCAAkC;IAClC,yBAAyB;IACzB,0EAA0E;IAC1E,0FAA0F;CAC3F,CAAC;AAEF,wEAAwE;AACxE,MAAM,QAAQ,GAAG,0DAA0D,CAAC;AAC5E,MAAM,UAAU,GAAG,UAAU,CAAC;AAE9B,6EAA6E;AAC7E,+EAA+E;AAC/E,MAAM,iBAAiB,GAAG;IACxB,mBAAmB;IACnB,oBAAoB;IACpB,cAAc;IACd,aAAa;IACb,eAAe;IACf,2BAA2B;CAC5B,CAAC;AAEF,oEAAoE;AACpE,MAAM,mBAAmB,GAAG;IAC1B,yBAAyB;IACzB,aAAa;IACb,0BAA0B;IAC1B,8CAA8C,EAAE,oBAAoB;IACpE,+CAA+C;CAChD,CAAC;AAEF,sEAAsE;AACtE,SAAS,YAAY,CAAC,IAAY;IAChC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,+EAA+E,CAAC,IAAI,EAAE,CAAC;IAClH,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,MAAc,EAAE,OAA0B,EAAE;IAC9E,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,IAAI,GAAG,CAAC;IAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,yDAAyD;IACzD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IACvD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,+BAA+B,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;IACxF,CAAC;IAED,yEAAyE;IACzE,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,uBAAuB,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;QAC7F,CAAC;IACH,CAAC;IAED,MAAM,aAAa,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,IAAI,GAAG,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,wBAAwB,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,KAAK,IAAI,GAAG,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;IAC1D,CAAC;SAAM,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,IAAI,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,YAAY,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,YAAY,IAAI,CAAC,OAAO,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;QACxE,oEAAoE;QACpE,KAAK,IAAI,GAAG,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;IAClD,CAAC;SAAM,IAAI,OAAO,EAAE,CAAC;QACnB,KAAK,IAAI,IAAI,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IAC7C,CAAC;SAAM,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;QAChD,0DAA0D;QAC1D,KAAK,IAAI,IAAI,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC/C,CAAC;IAED,yDAAyD;IACzD,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;QAChB,KAAK,IAAI,GAAG,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC3B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACjE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;AAC/D,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@burtson-labs/agent-core",
-  "version": "1.6.44",
+  "version": "1.6.45",
   "author": {
     "name": "Burtson Labs",
     "email": "team@burtson.ai",