@tangle-network/starter-foundry 0.5.2 → 0.5.4

package/dist/training/variant_b/generate.js

@@ -0,0 +1,70 @@
+// Public entrypoint: generateIdeas({ registryRoot, tracesPath })
+//
+// Scans the traces directory for the most recent trace file, rehydrates
+// Trace[] from it, then invokes the generate node. The scripts/multi-pursue-eval.mjs
+// harness calls this and feeds the result into judge.scoreCandidate.
+import { readdir, readFile } from 'node:fs/promises';
+import path from 'node:path';
+import { createLLM, isLLMAvailable } from '../../lib/llm.js';
+import { generateNode } from './nodes/generate.js';
+async function loadLatestTraces(tracesDir) {
+    let files = [];
+    try {
+        files = (await readdir(tracesDir)).filter((f) => f.startsWith('variant_b-') && f.endsWith('.jsonl')).sort();
+    }
+    catch {
+        return [];
+    }
+    if (files.length === 0)
+        return [];
+    const latest = files[files.length - 1];
+    const raw = await readFile(path.join(tracesDir, latest), 'utf8');
+    const traces = [];
+    for (const line of raw.split('\n')) {
+        const trimmed = line.trim();
+        if (!trimmed)
+            continue;
+        try {
+            traces.push(JSON.parse(trimmed));
+        }
+        catch {
+            // skip malformed lines
+        }
+    }
+    return traces;
+}
+export async function generateIdeas(input) {
+    const traces = await loadLatestTraces(input.tracesPath);
+    // Create an LLM only if we can — the mine-from-traces path runs anyway.
+    let llm;
+    try {
+        llm = isLLMAvailable() ? createLLM() : undefined;
+    }
+    catch {
+        llm = undefined;
+    }
+    if (!llm) {
+        // Use a fake AxAIService-compatible shim only for mined candidates. Node
+        // handles the llm-undefined branch internally when proposerAgent fails.
+        // Easier: pass a harmless throw to skip LLM path.
+        const throwing = {
+            async chat() { throw new Error('no-llm'); },
+            getId: () => 'noop',
+        };
+        const out = await generateNode({
+            registryRoot: input.registryRoot,
+            traces,
+            llm: throwing,
+            maxCandidates: input.maxCandidates,
+        });
+        return out.candidates;
+    }
+    const out = await generateNode({
+        registryRoot: input.registryRoot,
+        traces,
+        llm,
+        maxCandidates: input.maxCandidates,
+    });
+    return out.candidates;
+}
+//# sourceMappingURL=generate.js.map

package/dist/training/variant_b/generate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate.js","sourceRoot":"","sources":["../../../src/training/variant_b/generate.ts"],"names":[],"mappings":"AAAA,iEAAiE;AACjE,EAAE;AACF,wEAAwE;AACxE,qFAAqF;AACrF,qEAAqE;AAErE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAA;AACpD,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAA;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAA;AAUlD,KAAK,UAAU,gBAAgB,CAAC,SAAiB;IAC/C,IAAI,KAAK,GAAa,EAAE,CAAA;IACxB,IAAI,CAAC;QACH,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IAC7G,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAA;IACX,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IACjC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;IACvC,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,CAAA;IAChE,MAAM,MAAM,GAAY,EAAE,CAAA;IAC1B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QAC3B,IAAI,CAAC,OAAO;YAAE,SAAQ;QACtB,IAAI,CAAC;YACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAU,CAAC,CAAA;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,uBAAuB;QACzB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,KAAyB;IAC3D,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;IACvD,wEAAwE;IACxE,IAAI,GAAG,CAAA;IACP,IAAI,CAAC;QACH,GAAG,GAAG,cAAc,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAA;IAClD,CAAC;IAAC,MAAM,CAAC;QACP,GAAG,GAAG,SAAS,CAAA;IACjB,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,yEAAyE;QACzE,wEAAwE;QACxE,kDAAkD;QAClD,MAAM,QAAQ,GAAG;YACf,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAA,CAAC,CAAC;YAC1C,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM;SACoC,CAAA;QACzD,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC;YAC7B,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,MAAM;YACN,GAAG,EAAE,QAAQ;YACb,aAAa,EAAE,KAAK,CAAC,aAAa;SACnC,CAAC,CAAA;QACF,OAAO,GAAG,CAAC,UAAU,CAAA;IACvB,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC;QAC7B,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,MAAM;QACN,GAAG;QACH,aAAa,EAAE,KAAK,CAAC,aAAa;KACnC,CAAC,CAAA;IACF,OAAO,GAAG,CAAC,UAAU,CAAA;AACvB,CAAC"}

package/dist/training/variant_b/judge.d.ts

@@ -0,0 +1,8 @@
+import type { CandidateScore } from './nodes/judge.js';
+import type { ArchetypeCandidate } from './nodes/generate.js';
+export interface ScoreCandidateInput {
+    spec: ArchetypeCandidate;
+}
+export interface ScoreCandidateResult extends CandidateScore {
+}
+export declare function scoreCandidate(input: ScoreCandidateInput): Promise<ScoreCandidateResult>;

package/dist/training/variant_b/judge.js

@@ -0,0 +1,24 @@
+// Public entrypoint: scoreCandidate({ spec })
+//
+// The multi-pursue harness iterates candidates from generateIdeas and calls
+// scoreCandidate on each. Returns the judge's composite score + promotable
+// flag. LLM is used when available; deterministic scoring is the fallback.
+import { createLLM, isLLMAvailable } from '../../lib/llm.js';
+import { judgeNode } from './nodes/judge.js';
+export async function scoreCandidate(input) {
+    let llm;
+    try {
+        llm = isLLMAvailable() ? createLLM() : undefined;
+    }
+    catch {
+        llm = undefined;
+    }
+    const out = await judgeNode({
+        candidates: [input.spec],
+        judgePath: '.evolve/judge/variant_b.jsonl',
+        llm,
+        useLLM: llm !== undefined,
+    });
+    return out.scored[0].score;
+}
+//# sourceMappingURL=judge.js.map

package/dist/training/variant_b/judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"judge.js","sourceRoot":"","sources":["../../../src/training/variant_b/judge.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,EAAE;AACF,4EAA4E;AAC5E,2EAA2E;AAC3E,2EAA2E;AAE3E,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAA;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAU5C,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,KAA0B;IAC7D,IAAI,GAAG,CAAA;IACP,IAAI,CAAC;QACH,GAAG,GAAG,cAAc,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAA;IAClD,CAAC;IAAC,MAAM,CAAC;QACP,GAAG,GAAG,SAAS,CAAA;IACjB,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,SAAS,CAAC;QAC1B,UAAU,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;QACxB,SAAS,EAAE,+BAA+B;QAC1C,GAAG;QACH,MAAM,EAAE,GAAG,KAAK,SAAS;KAC1B,CAAC,CAAA;IACF,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;AAC7B,CAAC"}

package/dist/training/variant_b/nodes/collect.d.ts

@@ -0,0 +1,31 @@
+export interface Trace {
+    scenarioId: string;
+    corpus: 'ideasai' | 'held-out';
+    prompt: string;
+    partner: string | null;
+    expectedFamily: string | null;
+    expectedCapabilities: string[];
+    actualFamily: string | null;
+    actualCapabilities: string[];
+    kindMatch: boolean;
+    familyMatch: boolean;
+    capabilityHit: number;
+    latencyMs: number;
+    error: string | null;
+    timestamp: string;
+}
+export interface CollectInput {
+    corpusPath: string;
+    tracesDir: string;
+    limit?: number;
+    includeHeldOut?: boolean;
+}
+export interface CollectOutput {
+    traces: Trace[];
+    tracesFile: string;
+    coverageGaps: Array<{
+        capability: string;
+        missCount: number;
+    }>;
+}
+export declare function collectNode(input: CollectInput): Promise<CollectOutput>;

package/dist/training/variant_b/nodes/collect.js

@@ -0,0 +1,122 @@
+// collect node: reads ideasai + held-out corpora, runs the current planner on
+// each prompt, and materializes a typed Trace per scenario. Traces are the
+// only thing the train node reads — decoupling the corpus loader from the
+// optimizer. A different collect implementation (live prod traffic, synthetic
+// scenarios, etc.) can be swapped in without touching train.
+import { readFile, mkdir, appendFile } from 'node:fs/promises';
+import path from 'node:path';
+import { performance } from 'node:perf_hooks';
+import { planPrompt } from '../../../lib/prompt-planner.js';
+function jaccard(a, b) {
+    const A = new Set(a);
+    const B = new Set(b);
+    if (A.size === 0 && B.size === 0)
+        return 1;
+    let inter = 0;
+    for (const x of A)
+        if (B.has(x))
+            inter++;
+    const union = A.size + B.size - inter;
+    return union === 0 ? 1 : inter / union;
+}
+function extractActual(plan) {
+    const p = plan;
+    if (!p)
+        return { kind: null, family: null, capabilities: [] };
+    if (p.kind === 'starter') {
+        return { kind: 'starter', family: p.spec?.family ?? null, capabilities: p.spec?.layers ?? [] };
+    }
+    if (p.kind === 'workspace') {
+        const caps = [];
+        for (const proj of p.spec?.projects ?? []) {
+            for (const layer of proj.layers ?? [])
+                caps.push(layer);
+        }
+        return { kind: 'workspace', family: 'workspace', capabilities: caps };
+    }
+    return { kind: p.kind ?? null, family: null, capabilities: [] };
+}
+export async function collectNode(input) {
+    const ideasRaw = await readFile(input.corpusPath, 'utf8');
+    const ideas = JSON.parse(ideasRaw);
+    const scenarios = [];
+    for (const s of ideas) {
+        scenarios.push({
+            id: s.id,
+            corpus: 'ideasai',
+            prompt: s.prompt,
+            partner: null,
+            expectedFamily: s.expectedFamily ?? null,
+            expectedCapabilities: s.expectedCapabilities ?? [],
+        });
+    }
+    if (input.includeHeldOut !== false) {
+        try {
+            const heldRaw = await readFile('corpus/held-out-validation.json', 'utf8');
+            const held = JSON.parse(heldRaw);
+            for (const s of held.scenarios) {
+                scenarios.push({
+                    id: s.id,
+                    corpus: 'held-out',
+                    prompt: s.prompt,
+                    partner: s.partner ?? null,
+                    expectedFamily: s.expected?.family ?? null,
+                    expectedCapabilities: s.expected?.capabilities ?? [],
+                });
+            }
+        }
+        catch {
+            // held-out missing is fine for unit tests
+        }
+    }
+    const limited = input.limit ? scenarios.slice(0, input.limit) : scenarios;
+    const traces = [];
+    const missPerCap = new Map();
+    await mkdir(input.tracesDir, { recursive: true });
+    const tracesFile = path.join(input.tracesDir, `variant_b-${Date.now()}.jsonl`);
+    for (const s of limited) {
+        const t0 = performance.now();
+        let plan = null;
+        let error = null;
+        try {
+            plan = await planPrompt({ prompt: s.prompt, partner: s.partner });
+        }
+        catch (err) {
+            error = err instanceof Error ? err.message : String(err);
+        }
+        const latencyMs = performance.now() - t0;
+        const actual = extractActual(plan);
+        const familyMatch = s.expectedFamily ? actual.family === s.expectedFamily : true;
+        const capabilityHit = s.expectedCapabilities.length
+            ? jaccard(actual.capabilities, s.expectedCapabilities)
+            : 1;
+        for (const cap of s.expectedCapabilities) {
+            if (!actual.capabilities.includes(cap)) {
+                missPerCap.set(cap, (missPerCap.get(cap) ?? 0) + 1);
+            }
+        }
+        const trace = {
+            scenarioId: s.id,
+            corpus: s.corpus,
+            prompt: s.prompt,
+            partner: s.partner,
+            expectedFamily: s.expectedFamily,
+            expectedCapabilities: s.expectedCapabilities,
+            actualFamily: actual.family,
+            actualCapabilities: actual.capabilities,
+            kindMatch: actual.kind !== null,
+            familyMatch,
+            capabilityHit,
+            latencyMs,
+            error,
+            timestamp: new Date().toISOString(),
+        };
+        traces.push(trace);
+        await appendFile(tracesFile, JSON.stringify(trace) + '\n');
+    }
+    const coverageGaps = [...missPerCap.entries()]
+        .map(([capability, missCount]) => ({ capability, missCount }))
+        .sort((a, b) => b.missCount - a.missCount);
+    return { traces, tracesFile, coverageGaps };
+}
+//# sourceMappingURL=collect.js.map

package/dist/training/variant_b/nodes/collect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collect.js","sourceRoot":"","sources":["../../../../src/training/variant_b/nodes/collect.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,2EAA2E;AAC3E,0EAA0E;AAC1E,8EAA8E;AAC9E,6DAA6D;AAE7D,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAC9D,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAA;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAA;AA8C3D,SAAS,OAAO,CAAC,CAAW,EAAE,CAAW;IACvC,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;IACpB,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;IACpB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAC1C,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,KAAK,EAAE,CAAA;IACxC,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,CAAA;IACrC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAA;AACxC,CAAC;AAED,SAAS,aAAa,CAAC,IAAa;IAClC,MAAM,CAAC,GAAG,IAAwH,CAAA;IAClI,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,CAAA;IAC7D,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,IAAI,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE,EAAE,CAAA;IAChG,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzD,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,IAAI,EAAE,CAAA;IACvE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,CAAA;AACjE,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAmB;IACnD,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC,CAAA;IACzD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAsB,CAAA;IAEvD,MAAM,SAAS,GAOV,EAAE,CAAA;IAEP,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,SAAS,CAAC,IAAI,CAAC;YACb,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,OAAO,EAAE,IAAI;YACb,cAAc,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;YACxC,oBAAoB,EAAE,CAAC,CAAC,oBAAoB,IAAI,EAAE;SACnD,CAAC,CAAA;IACJ,CAAC;IAED,IAAI,KAAK,CAAC,cAAc,KAAK,KAAK,EAAE,CAAC;QACnC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,iCAAiC,EAAE,MAAM,CAAC,CAAA;YACzE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAqC,CAAA;YACpE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC/B,SAAS,CAAC,IAAI,CAAC;oBACb,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,MAAM,EAAE,UAAU;oBAClB,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI;oBAC1B,cAAc,EAAE,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,IAAI;oBAC1C,oBAAoB,EAAE,CAAC,CAAC,QAAQ,EAAE,YAAY,IAAI,EAAE;iBACrD,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0CAA0C;QAC5C,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACzE,MAAM,MAAM,GAAY,EAAE,CAAA;IAC1B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAE5C,MAAM,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IACjD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,aAAa,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;IAE9E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;QAC5B,IAAI,IAAI,GAAY,IAAI,CAAA;QACxB,IAAI,KAAK,GAAkB,IAAI,CAAA;QAC/B,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;QACnE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC1D,CAAC;QACD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;QACxC,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;QAClC,MAAM,WAAW,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAA;QAChF,MAAM,aAAa,GAAG,CAAC,CAAC,oBAAoB,CAAC,MAAM;YACjD,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,oBAAoB,CAAC;YACtD,CAAC,CAAC,CAAC,CAAA;QAEL,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,oBAAoB,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAU;YACnB,UAAU,EAAE,CAAC,CAAC,EAAE;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,cAAc,EAAE,CAAC,CAAC,cAAc;YAChC,oBAAoB,EAAE,CAAC,CAAC,oBAAoB;YAC5C,YAAY,EAAE,MAAM,CAAC,MAAM;YAC3B,kBAAkB,EAAE,MAAM,CAAC,YAAY;YACvC,SAAS,EAAE,MAAM,CAAC,IAAI,KAAK,IAAI;YAC/B,WAAW;YACX,aAAa;YACb,SAAS;YACT,KAAK;YACL,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAA;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAClB,MAAM,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAA;IAC5D,CAAC;IAED,MAAM,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;SAC3C,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC;SAC7D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAA;IAE5C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,CAAA;AAC7C,CAAC"}

package/dist/training/variant_b/nodes/generate.d.ts

@@ -0,0 +1,22 @@
+import type { AxAIService } from '@ax-llm/ax';
+import type { Trace } from './collect.js';
+export interface ArchetypeCandidate {
+    id: string;
+    description: string;
+    family: string;
+    capabilities: string[];
+    promptKeywords: string[];
+    rationale: string;
+    source: 'coverage-gap' | 'cooccurrence' | 'llm-proposed';
+}
+export interface GenerateInput {
+    registryRoot: string;
+    traces: Trace[];
+    llm: AxAIService;
+    maxCandidates?: number;
+}
+export interface GenerateOutput {
+    candidates: ArchetypeCandidate[];
+    existingArchetypes: string[];
+}
+export declare function generateNode(input: GenerateInput): Promise<GenerateOutput>;

package/dist/training/variant_b/nodes/generate.js

@@ -0,0 +1,171 @@
+// generate node: looks at coverage gaps in the traces + uncovered capability
+// co-occurrences, then uses an ax program to propose new archetype definitions
+// (capability bundles) that would plug the gaps. Output is candidates, not
+// committed archetypes — the judge + rank + promote nodes decide what lands.
+import { readFile, readdir } from 'node:fs/promises';
+import path from 'node:path';
+import { ax } from '@ax-llm/ax';
+async function loadExistingArchetypes(registryRoot) {
+    try {
+        const dir = path.join(registryRoot, 'layers', 'capability');
+        const entries = await readdir(dir, { withFileTypes: true });
+        return entries.filter((e) => e.isDirectory()).map((e) => e.name);
+    }
+    catch {
+        return [];
+    }
+}
+async function loadCapabilityKeywords(registryRoot, existing) {
+    const out = new Map();
+    for (const id of existing) {
+        try {
+            const manifestPath = path.join(registryRoot, 'layers', 'capability', id, 'manifest.json');
+            const raw = await readFile(manifestPath, 'utf8');
+            const manifest = JSON.parse(raw);
+            out.set(id, manifest.keywords ?? []);
+        }
+        catch {
+            // skip
+        }
+    }
+    return out;
+}
+// Derive candidates from real data first. LLM proposal is layered on top —
+// the judge will separate signal from slop.
+function mineCandidatesFromTraces(traces, existingIds) {
+    const cooccur = new Map();
+    for (const t of traces) {
+        const caps = t.expectedCapabilities;
+        for (let i = 0; i < caps.length; i++) {
+            for (let j = i + 1; j < caps.length; j++) {
+                const a = caps[i];
+                const b = caps[j];
+                const key = a < b ? `${a}|${b}` : `${b}|${a}`;
+                const [l, r] = key.split('|');
+                if (!cooccur.has(l))
+                    cooccur.set(l, new Map());
+                cooccur.get(l).set(r, (cooccur.get(l).get(r) ?? 0) + 1);
+            }
+        }
+    }
+    const bundles = [];
+    for (const [l, rs] of cooccur) {
+        for (const [r, count] of rs) {
+            if (count < 3)
+                continue;
+            const pairId = `${l.replace('capability:', '')}-${r.replace('capability:', '')}`;
+            const id = `bundle-${pairId}`;
+            if (existingIds.has(id))
+                continue;
+            const keywords = new Set();
+            for (const t of traces) {
+                if (t.expectedCapabilities.includes(l) && t.expectedCapabilities.includes(r)) {
+                    for (const w of t.prompt.toLowerCase().split(/\W+/).filter((w) => w.length >= 4)) {
+                        keywords.add(w);
+                    }
+                }
+            }
+            bundles.push({
+                id,
+                description: `Bundle of ${l} + ${r} — co-occurs in ${count} training prompts.`,
+                family: 'fullstack-ts',
+                capabilities: [l, r],
+                promptKeywords: [...keywords].slice(0, 12),
+                rationale: `Co-occurrence count ${count} in ideasai corpus.`,
+                source: 'cooccurrence',
+            });
+        }
+    }
+    // Plus: each high-miss capability that's present in the corpus but missed
+    // in traces becomes a candidate archetype that binds the capability +
+    // its strongest partner capability.
+    const missByCap = new Map();
+    for (const t of traces) {
+        for (const cap of t.expectedCapabilities) {
+            if (!t.actualCapabilities.includes(cap)) {
+                missByCap.set(cap, (missByCap.get(cap) ?? 0) + 1);
+            }
+        }
+    }
+    const topMiss = [...missByCap.entries()].sort((a, b) => b[1] - a[1]).slice(0, 6);
+    for (const [cap, missCount] of topMiss) {
+        const id = `gap-${cap.replace('capability:', '')}`;
+        if (existingIds.has(id))
+            continue;
+        const keywords = new Set();
+        for (const t of traces) {
+            if (t.expectedCapabilities.includes(cap)) {
+                for (const w of t.prompt.toLowerCase().split(/\W+/).filter((w) => w.length >= 4)) {
+                    keywords.add(w);
+                }
+            }
+        }
+        bundles.push({
+            id,
+            description: `Fill coverage gap for ${cap} — missed in ${missCount} training traces.`,
+            family: 'fullstack-ts',
+            capabilities: [cap],
+            promptKeywords: [...keywords].slice(0, 12),
+            rationale: `Top-N coverage gap (miss count ${missCount}).`,
+            source: 'coverage-gap',
+        });
+    }
+    return bundles;
+}
+// LLM-proposed archetype node: takes the top-N coverage gaps + a sample of
+// prompts and asks for a structured archetype name + capability bundle that
+// would plug the gaps. Kept narrow on purpose — judge & rank filter the noise.
+const proposerAgent = ax('"Propose a new product archetype that would help route ambiguous AI-product prompts to the right capability bundle. The archetype id must be kebab-case. Capabilities must be drawn ONLY from knownCapabilities. Promptkeywords must be single tokens that actually appear in problemPrompts." ' +
+    'coverageGaps:string[], problemPrompts:string[], knownCapabilities:string[] -> ' +
+    'archetypeId:string, description:string, family:string, capabilities:string[], promptKeywords:string[], rationale:string');
+export async function generateNode(input) {
+    const existing = await loadExistingArchetypes(input.registryRoot);
+    const existingSet = new Set(existing);
+    const capKeywords = await loadCapabilityKeywords(input.registryRoot, existing);
+    const knownCapabilities = [...capKeywords.keys()].map((id) => `capability:${id}`);
+    const mined = mineCandidatesFromTraces(input.traces, existingSet);
+    // LLM proposal: surface the worst-covered gaps + real prompts as context.
+    const missByCap = new Map();
+    for (const t of input.traces) {
+        for (const cap of t.expectedCapabilities) {
+            if (!t.actualCapabilities.includes(cap))
+                missByCap.set(cap, (missByCap.get(cap) ?? 0) + 1);
+        }
+    }
+    const topGaps = [...missByCap.entries()].sort((a, b) => b[1] - a[1]).slice(0, 5).map(([c]) => c);
+    const problemPrompts = input.traces
+        .filter((t) => t.capabilityHit < 0.5 && t.corpus === 'ideasai')
+        .slice(0, 8)
+        .map((t) => t.prompt);
+    const llmCandidates = [];
+    if (problemPrompts.length > 0 && topGaps.length > 0) {
+        try {
+            const raw = (await proposerAgent.forward(input.llm, {
+                coverageGaps: topGaps,
+                problemPrompts,
+                knownCapabilities,
+            }, { stream: false }));
+            if (raw.archetypeId && Array.isArray(raw.capabilities) && raw.capabilities.length > 0) {
+                const validCaps = raw.capabilities.filter((c) => knownCapabilities.includes(c));
+                if (validCaps.length > 0 && !existingSet.has(raw.archetypeId)) {
+                    llmCandidates.push({
+                        id: raw.archetypeId,
+                        description: raw.description ?? '',
+                        family: raw.family ?? 'fullstack-ts',
+                        capabilities: validCaps,
+                        promptKeywords: (raw.promptKeywords ?? []).filter((w) => typeof w === 'string' && w.length > 2),
+                        rationale: raw.rationale ?? '',
+                        source: 'llm-proposed',
+                    });
+                }
+            }
+        }
+        catch {
+            // LLM proposal is optional — mined candidates carry the loop alone
+        }
+    }
+    const max = input.maxCandidates ?? 12;
+    const candidates = [...mined, ...llmCandidates].slice(0, max);
+    return { candidates, existingArchetypes: existing };
+}
+//# sourceMappingURL=generate.js.map

package/dist/training/variant_b/nodes/generate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate.js","sourceRoot":"","sources":["../../../../src/training/variant_b/nodes/generate.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,+EAA+E;AAC/E,2EAA2E;AAC3E,6EAA6E;AAE7E,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAA;AACpD,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,EAAE,EAAE,MAAM,YAAY,CAAA;AA2B/B,KAAK,UAAU,sBAAsB,CAAC,YAAoB;IACxD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAA;QAC3D,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAA;QAC3D,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAClE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAA;IACX,CAAC;AACH,CAAC;AAED,KAAK,UAAU,sBAAsB,CAAC,YAAoB,EAAE,QAAkB;IAC5E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAA;IACvC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,IAAI,CAAC;YACH,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,CAAC,CAAA;YACzF,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC,CAAA;YAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAA4B,CAAA;YAC3D,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAA;QACtC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,2EAA2E;AAC3E,4CAA4C;AAC5C,SAAS,wBAAwB,CAAC,MAAe,EAAE,WAAwB;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAA;IACtD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,CAAC,CAAC,oBAAoB,CAAA;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;gBAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;gBAClB,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAA;gBAC7C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAqB,CAAA;gBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;gBAC9C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAyB,EAAE,CAAA;IACxC,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5B,IAAI,KAAK,GAAG,CAAC;gBAAE,SAAQ;YACvB,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,CAAA;YAChF,MAAM,EAAE,GAAG,UAAU,MAAM,EAAE,CAAA;YAC7B,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAQ;YACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;YAClC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,IAAI,CAAC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC;wBACjF,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE;gBACF,WAAW,EAAE,aAAa,CAAC,MAAM,CAAC,mBAAmB,KAAK,oBAAoB;gBAC9E,MAAM,EAAE,cAAc;gBACtB,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACpB,cAAc,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;gBAC1C,SAAS,EAAE,uBAAuB,KAAK,qBAAqB;gBAC5D,MAAM,EAAE,cAAc;aACvB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,sEAAsE;IACtE,oCAAoC;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,oBAAoB,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAChF,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,OAAO,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,CAAA;QAClD,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;QAClC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC;oBACjF,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,IAAI,CAAC;YACX,EAAE;YACF,WAAW,EAAE,yBAAyB,GAAG,gBAAgB,SAAS,mBAAmB;YACrF,MAAM,EAAE,cAAc;YACtB,YAAY,EAAE,CAAC,GAAG,CAAC;YACnB,cAAc,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,EAAE,kCAAkC,SAAS,IAAI;YAC1D,MAAM,EAAE,cAAc;SACvB,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,2EAA2E;AAC3E,4EAA4E;AAC5E,+EAA+E;AAC/E,MAAM,aAAa,GAAG,EAAE,CACtB,iSAAiS;IAC/R,gFAAgF;IAChF,yHAAyH,CAC5H,CAAA;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,KAAoB;IACrD,MAAM,QAAQ,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,YAAY,CAAC,CAAA;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAA;IACrC,MAAM,WAAW,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAA;IAC9E,MAAM,iBAAiB,GAAG,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,CAAA;IAEjF,MAAM,KAAK,GAAG,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;IAEjE,0EAA0E;IAC1E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,oBAAoB,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC5F,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAChG,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM;SAChC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,GAAG,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC;SAC9D,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAEvB,MAAM,aAAa,GAAyB,EAAE,CAAA;IAC9C,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,CAAC,MAAM,aAAa,CAAC,OAAO,CACtC,KAAK,CAAC,GAAG,EACT;gBACE,YAAY,EAAE,OAAO;gBACrB,cAAc;gBACd,iBAAiB;aAClB,EACD,EAAE,MAAM,EAAE,KAAK,EAAE,CAClB,CAOA,CAAA;YACD,IAAI,GAAG,CAAC,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtF,MAAM,SAAS,GAAG,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC/E,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC9D,aAAa,CAAC,IAAI,CAAC;wBACjB,EAAE,EAAE,GAAG,CAAC,WAAW;wBACnB,WAAW,EAAE,GAAG,CAAC,WAAW,IAAI,EAAE;wBAClC,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,cAAc;wBACpC,YAAY,EAAE,SAAS;wBACvB,cAAc,EAAE,CAAC,GAAG,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;wBAC/F,SAAS,EAAE,GAAG,CAAC,SAAS,IAAI,EAAE;wBAC9B,MAAM,EAAE,cAAc;qBACvB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,mEAAmE;QACrE,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,IAAI,EAAE,CAAA;IACrC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAC7D,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,QAAQ,EAAE,CAAA;AACrD,CAAC"}

package/dist/training/variant_b/nodes/judge.d.ts

@@ -0,0 +1,26 @@
+import type { AxAIService } from '@ax-llm/ax';
+import type { ArchetypeCandidate } from './generate.js';
+export interface CandidateScore {
+    utility: number;
+    specificity: number;
+    novelty: number;
+    rubric: number;
+    composite: number;
+    promotable: boolean;
+    notes: string;
+}
+export interface ScoredCandidate {
+    candidate: ArchetypeCandidate;
+    score: CandidateScore;
+}
+export interface JudgeInput {
+    candidates: ArchetypeCandidate[];
+    judgePath: string;
+    llm?: AxAIService;
+    useLLM?: boolean;
+    promoteThreshold?: number;
+}
+export interface JudgeOutput {
+    scored: ScoredCandidate[];
+}
+export declare function judgeNode(input: JudgeInput): Promise<JudgeOutput>;

package/dist/training/variant_b/nodes/judge.js

@@ -0,0 +1,64 @@
+// judge node: LLM-as-judge + deterministic checks. Each candidate archetype
+// is scored on (a) coverage-gap-fit, (b) keyword specificity, (c) non-overlap
+// with existing archetypes, (d) an LLM rubric score on "is this a real,
+// useful archetype that future prompts would match".
+//
+// Swap strategy: replace the rubric signature with a different judge
+// (pairwise preference, ensemble, rule-only) without changing the output
+// contract.
+import { appendFile, mkdir } from 'node:fs/promises';
+import path from 'node:path';
+import { ax } from '@ax-llm/ax';
+const rubricAgent = ax('"Score an archetype candidate on four dimensions from 0.0 to 1.0. utility = how often future AI-saas prompts will match. specificity = how unique the keyword set is. novelty = how different from existing archetypes. overall = weighted sum. Return short reasoning." ' +
+    'archetypeId:string, description:string, capabilities:string[], promptKeywords:string[], existingArchetypes:string[] -> ' +
+    'utility:number, specificity:number, novelty:number, overall:number, reasoning:string');
+function deterministicScore(c) {
+    const kw = c.promptKeywords ?? [];
+    const specificity = Math.min(1, kw.length / 8);
+    const utility = c.source === 'cooccurrence' ? 0.8 : c.source === 'coverage-gap' ? 0.7 : 0.5;
+    const novelty = c.capabilities.length >= 2 ? 0.8 : 0.5;
+    return { specificity, novelty, utility };
+}
+export async function judgeNode(input) {
+    const scored = [];
+    await mkdir(path.dirname(input.judgePath), { recursive: true });
+    const useLLM = input.useLLM !== false && input.llm !== undefined;
+    const promoteThreshold = input.promoteThreshold ?? 0.6;
+    for (const candidate of input.candidates) {
+        const det = deterministicScore(candidate);
+        let rubric = 0.5;
+        let notes = '';
+        if (useLLM && input.llm) {
+            try {
+                const raw = (await rubricAgent.forward(input.llm, {
+                    archetypeId: candidate.id,
+                    description: candidate.description,
+                    capabilities: candidate.capabilities,
+                    promptKeywords: candidate.promptKeywords,
+                    existingArchetypes: [],
+                }, { stream: false }));
+                const overall = typeof raw.overall === 'number' ? raw.overall : 0.5;
+                rubric = Math.max(0, Math.min(1, overall));
+                notes = raw.reasoning ?? '';
+            }
+            catch {
+                // LLM blip — deterministic score carries
+            }
+        }
+        const composite = 0.25 * det.utility + 0.25 * det.specificity + 0.2 * det.novelty + 0.3 * rubric;
+        const promotable = composite >= promoteThreshold && candidate.capabilities.length > 0;
+        const score = {
+            utility: det.utility,
+            specificity: det.specificity,
+            novelty: det.novelty,
+            rubric,
+            composite,
+            promotable,
+            notes,
+        };
+        scored.push({ candidate, score });
+        await appendFile(input.judgePath, JSON.stringify({ candidate, score, timestamp: new Date().toISOString() }) + '\n');
+    }
+    return { scored };
+}
+//# sourceMappingURL=judge.js.map

package/dist/training/variant_b/nodes/judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"judge.js","sourceRoot":"","sources":["../../../../src/training/variant_b/nodes/judge.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,8EAA8E;AAC9E,wEAAwE;AACxE,qDAAqD;AACrD,EAAE;AACF,qEAAqE;AACrE,yEAAyE;AACzE,YAAY;AAEZ,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AACpD,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,EAAE,EAAE,MAAM,YAAY,CAAA;AA+B/B,MAAM,WAAW,GAAG,EAAE,CACpB,2QAA2Q;IACzQ,yHAAyH;IACzH,sFAAsF,CACzF,CAAA;AAED,SAAS,kBAAkB,CAAC,CAAqB;IAC/C,MAAM,EAAE,GAAG,CAAC,CAAC,cAAc,IAAI,EAAE,CAAA;IACjC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC9C,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;IAC3F,MAAM,OAAO,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;IACtD,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,CAAA;AAC1C,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,KAAiB;IAC/C,MAAM,MAAM,GAAsB,EAAE,CAAA;IACpC,MAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,KAAK,KAAK,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,CAAA;IAChE,MAAM,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,IAAI,GAAG,CAAA;IAEtD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAA;QACzC,IAAI,MAAM,GAAG,GAAG,CAAA;QAChB,IAAI,KAAK,GAAG,EAAE,CAAA;QAEd,IAAI,MAAM,IAAI,KAAK,CAAC,GAAG,EAAE,CAAC;YACxB,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,CAAC,MAAM,WAAW,CAAC,OAAO,CACpC,KAAK,CAAC,GAAG,EACT;oBACE,WAAW,EAAE,SAAS,CAAC,EAAE;oBACzB,WAAW,EAAE,SAAS,CAAC,WAAW;oBAClC,YAAY,EAAE,SAAS,CAAC,YAAY;oBACpC,cAAc,EAAE,SAAS,CAAC,cAAc;oBACxC,kBAAkB,EAAE,EAAE;iBACvB,EACD,EAAE,MAAM,EAAE,KAAK,EAAE,CAClB,CAAuG,CAAA;gBACxG,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAA;gBACnE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;gBAC1C,KAAK,GAAG,GAAG,CAAC,SAAS,IAAI,EAAE,CAAA;YAC7B,CAAC;YAAC,MAAM,CAAC;gBACP,yCAAyC;YAC3C,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,GAAG,CAAC,OAAO,GAAG,IAAI,GAAG,GAAG,CAAC,WAAW,GAAG,GAAG,GAAG,GAAG,CAAC,OAAO,GAAG,GAAG,GAAG,MAAM,CAAA;QAChG,MAAM,UAAU,GAAG,SAAS,IAAI,gBAAgB,IAAI,SAAS,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAA;QAErF,MAAM,KAAK,GAAmB;YAC5B,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,WAAW,EAAE,GAAG,CAAC,WAAW;YAC5B,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,MAAM;YACN,SAAS;YACT,UAAU;YACV,KAAK;SACN,CAAA;QACD,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAA;QACjC,MAAM,UAAU,CACd,KAAK,CAAC,SAAS,EACf,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,GAAG,IAAI,CACjF,CAAA;IACH,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,CAAA;AACnB,CAAC"}

package/dist/training/variant_b/nodes/promote.d.ts

@@ -0,0 +1,15 @@
+import type { RankedCandidate } from './rank.js';
+export interface PromoteInput {
+    ranked: RankedCandidate[];
+    registryRoot: string;
+    maxPromotions?: number;
+    dryRun?: boolean;
+}
+export interface PromoteOutput {
+    promoted: string[];
+    skipped: Array<{
+        id: string;
+        reason: string;
+    }>;
+}
+export declare function promoteNode(input: PromoteInput): Promise<PromoteOutput>;