@tangle-network/starter-foundry 0.5.3 → 0.5.4

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

@@ -0,0 +1,64 @@
+// promote node: takes top ranked candidates that passed the judge and writes
+// them as minimal capability manifests under registry/layers/capability/<id>/.
+// Stops at top-K promotable-only. Idempotent — won't overwrite existing
+// manifests. The registry is the system of record.
+//
+// Swap strategy: replace the manifest writer with a PR-opener or a dry-run
+// committer without changing the node contract.
+import { mkdir, writeFile, access } from 'node:fs/promises';
+import path from 'node:path';
+async function exists(p) {
+    try {
+        await access(p);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+export async function promoteNode(input) {
+    const promoted = [];
+    const skipped = [];
+    const max = input.maxPromotions ?? 8;
+    const candidates = input.ranked.filter((c) => c.score.promotable).slice(0, max);
+    for (const c of candidates) {
+        const dir = path.join(input.registryRoot, 'layers', 'capability', c.candidate.id);
+        if (await exists(dir)) {
+            skipped.push({ id: c.candidate.id, reason: 'already-exists' });
+            continue;
+        }
+        const manifest = {
+            id: c.candidate.id,
+            description: c.candidate.description,
+            appliesTo: [c.candidate.family],
+            defaults: {},
+            files: [],
+            contextHints: {
+                extensionPoints: [],
+                notes: `Promoted by variant_b flow (rank=${c.rank}, composite=${c.score.composite.toFixed(3)}).`,
+            },
+            keywords: c.candidate.promptKeywords,
+            buildHints: {
+                capabilityBundle: c.candidate.capabilities,
+                rationale: c.candidate.rationale,
+            },
+            // variant_b metadata so a future reviewer can filter promoted
+            // archetypes and audit the loop's output.
+            provenance: {
+                generatedBy: 'variant_b',
+                source: c.candidate.source,
+                scores: c.score,
+                promotedAt: new Date().toISOString(),
+            },
+        };
+        if (input.dryRun) {
+            promoted.push(c.candidate.id);
+            continue;
+        }
+        await mkdir(dir, { recursive: true });
+        await writeFile(path.join(dir, 'manifest.json'), JSON.stringify(manifest, null, 2));
+        promoted.push(c.candidate.id);
+    }
+    return { promoted, skipped };
+}
+//# sourceMappingURL=promote.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"promote.js","sourceRoot":"","sources":["../../../../src/training/variant_b/nodes/promote.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,+EAA+E;AAC/E,wEAAwE;AACxE,mDAAmD;AACnD,EAAE;AACF,2EAA2E;AAC3E,gDAAgD;AAEhD,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAA;AAC3D,OAAO,IAAI,MAAM,WAAW,CAAA;AAe5B,KAAK,UAAU,MAAM,CAAC,CAAS;IAC7B,IAAI,CAAC;QACH,MAAM,MAAM,CAAC,CAAC,CAAC,CAAA;QACf,OAAO,IAAI,CAAA;IACb,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAmB;IACnD,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,MAAM,OAAO,GAA0C,EAAE,CAAA;IACzD,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,IAAI,CAAC,CAAA;IAEpC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;IAE/E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;QACjF,IAAI,MAAM,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAA;YAC9D,SAAQ;QACV,CAAC;QACD,MAAM,QAAQ,GAAG;YACf,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE;YAClB,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,WAAW;YACpC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;YAC/B,QAAQ,EAAE,EAAE;YACZ,KAAK,EAAE,EAAE;YACT,YAAY,EAAE;gBACZ,eAAe,EAAE,EAAE;gBACnB,KAAK,EAAE,oCAAoC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;aACjG;YACD,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC,cAAc;YACpC,UAAU,EAAE;gBACV,gBAAgB,EAAE,CAAC,CAAC,SAAS,CAAC,YAAY;gBAC1C,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS;aACjC;YACD,8DAA8D;YAC9D,0CAA0C;YAC1C,UAAU,EAAE;gBACV,WAAW,EAAE,WAAW;gBACxB,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,MAAM;gBAC1B,MAAM,EAAE,CAAC,CAAC,KAAK;gBACf,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACrC;SACF,CAAA;QACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;YAC7B,SAAQ;QACV,CAAC;QACD,MAAM,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACrC,MAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,eAAe,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QACnF,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;IAC/B,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAA;AAC9B,CAAC"}

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

@@ -0,0 +1,12 @@
+import type { ScoredCandidate } from './judge.js';
+export interface RankedCandidate extends ScoredCandidate {
+    rank: number;
+    paretoFrontier: boolean;
+}
+export interface RankInput {
+    scored: ScoredCandidate[];
+}
+export interface RankOutput {
+    ranked: RankedCandidate[];
+}
+export declare function rankNode(input: RankInput): Promise<RankOutput>;

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

@@ -0,0 +1,46 @@
+// rank node: Pareto-rank scored candidates across (utility, specificity,
+// novelty, rubric). Dominated candidates are dropped. Non-dominated frontier
+// is ordered by composite score. This is a swap point — could be replaced
+// with Borda count, ELO, or a learned ranker without touching the nodes
+// upstream or downstream.
+function dominates(a, b) {
+    const dims = [
+        [a.score.utility, b.score.utility],
+        [a.score.specificity, b.score.specificity],
+        [a.score.novelty, b.score.novelty],
+        [a.score.rubric, b.score.rubric],
+    ];
+    let strictlyBetter = false;
+    for (const [x, y] of dims) {
+        if (x < y)
+            return false;
+        if (x > y)
+            strictlyBetter = true;
+    }
+    return strictlyBetter;
+}
+export async function rankNode(input) {
+    const ranked = [];
+    for (const c of input.scored) {
+        let isDominated = false;
+        for (const other of input.scored) {
+            if (other === c)
+                continue;
+            if (dominates(other, c)) {
+                isDominated = true;
+                break;
+            }
+        }
+        ranked.push({ ...c, rank: 0, paretoFrontier: !isDominated });
+    }
+    ranked.sort((a, b) => {
+        if (a.paretoFrontier !== b.paretoFrontier)
+            return a.paretoFrontier ? -1 : 1;
+        return b.score.composite - a.score.composite;
+    });
+    ranked.forEach((c, i) => {
+        c.rank = i + 1;
+    });
+    return { ranked };
+}
+//# sourceMappingURL=rank.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rank.js","sourceRoot":"","sources":["../../../../src/training/variant_b/nodes/rank.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,6EAA6E;AAC7E,0EAA0E;AAC1E,wEAAwE;AACxE,0BAA0B;AAiB1B,SAAS,SAAS,CAAC,CAAkB,EAAE,CAAkB;IACvD,MAAM,IAAI,GAA4B;QACpC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;QAClC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC;QAC1C,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;QAClC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;KACjC,CAAA;IACD,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAA;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,cAAc,GAAG,IAAI,CAAA;IAClC,CAAC;IACD,OAAO,cAAc,CAAA;AACvB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,KAAgB;IAC7C,MAAM,MAAM,GAAsB,EAAE,CAAA;IACpC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7B,IAAI,WAAW,GAAG,KAAK,CAAA;QACvB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,KAAK,CAAC;gBAAE,SAAQ;YACzB,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;gBACxB,WAAW,GAAG,IAAI,CAAA;gBAClB,MAAK;YACP,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,WAAW,EAAE,CAAC,CAAA;IAC9D,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,cAAc,KAAK,CAAC,CAAC,cAAc;YAAE,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3E,OAAO,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAA;IAC9C,CAAC,CAAC,CAAA;IACF,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;IAChB,CAAC,CAAC,CAAA;IACF,OAAO,EAAE,MAAM,EAAE,CAAA;AACnB,CAAC"}

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

@@ -0,0 +1,34 @@
+import type { AxAIService } from '@ax-llm/ax';
+import type { Trace } from './collect.js';
+export interface TrainInput {
+    traces: Trace[];
+    outPath: string;
+    llm: AxAIService;
+    maxRounds?: number;
+    auto?: 'light' | 'medium' | 'heavy';
+}
+export interface SerializedOptimizedProgram {
+    optimizerType: string;
+    bestScore: number;
+    instruction?: string;
+    instructionMap?: Record<string, string>;
+    demos?: unknown[];
+    modelConfig?: Record<string, unknown>;
+    optimizationTime: number;
+    totalRounds: number;
+    converged: boolean;
+    scoreHistory?: number[];
+    artifactFormatVersion?: number;
+    signature: string;
+    promptShape: 'brief';
+    trainedAt: string;
+    trainingTraceCount: number;
+    knownFamilies: string[];
+    knownCapabilities: string[];
+}
+export interface TrainOutput {
+    optimizedProgram: SerializedOptimizedProgram;
+    outPath: string;
+}
+export declare function trainNode(input: TrainInput): Promise<TrainOutput>;
+export declare function buildCorpusMinedInstruction(trainables: Trace[], knownCapabilities: string[]): string;

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

@@ -0,0 +1,209 @@
+// train node: takes traces, runs AxMiPRO over the brief signature to find an
+// instruction that biases the brief agent toward producing canonicalPrompts
+// that route correctly through the deterministic planner. The optimized
+// artifact is serialized to JSON at outPath as an AxOptimizedProgram.
+//
+// Swap strategy: replace `AxMiPRO` with `AxBootstrapFewShot` or `AxGEPA` by
+// changing only this file. The TrainOutput contract stays fixed.
+import { writeFile, mkdir } from 'node:fs/promises';
+import path from 'node:path';
+import { ax, AxMiPRO } from '@ax-llm/ax';
+import { loadRegistry } from '../../../lib/registry.js';
+import { planPrompt } from '../../../lib/prompt-planner.js';
+const BRIEF_SIGNATURE = '"Turn a user product prompt into a structured product brief that drives a deterministic scaffold pipeline downstream. The canonicalPrompt must be a keyword-rich expansion that names concrete technologies drawn from knownFamilies (e.g. nextjs-ts, fullstack-ts, agent-service-ts, go-api, python-api, forge-contracts, solana-program) and concrete UI/infra capabilities drawn from knownCapabilities (e.g. capability:ai-chat-ui, capability:layout-dashboard, capability:saas-billing). It MUST be longer and more specific than the user prompt. Preserve the user intent exactly. Each list field should have 3-8 items." ' +
+    'userPrompt:string, knownFamilies:string[], knownCapabilities:string[] -> ' +
+    'canonicalPrompt:string, vision:string, taskChecklist:string[], milestones:string[], testingPlan:string[], e2ePlan:string[], securityConcerns:string[], openQuestions:string[], confidence:number';
+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;
+}
+async function buildKnownLists() {
+    const registry = await loadRegistry();
+    const knownFamilies = [...registry.families.keys()];
+    const knownCapabilities = [];
+    for (const [key] of registry.layers) {
+        if (key.startsWith('capability:'))
+            knownCapabilities.push(key);
+    }
+    return { knownFamilies, knownCapabilities };
+}
+// Build a metric: for each predicted canonicalPrompt, re-route through the
+// deterministic planner and measure capability-jaccard vs the expected
+// capabilities from the training example. This is exactly what downstream
+// eval will measure, so we optimize the metric that matters.
+function makeMetric(expectedByPrompt) {
+    return async ({ prediction, example }) => {
+        const pred = prediction;
+        const canonical = (pred.canonicalPrompt ?? '').trim();
+        if (!canonical)
+            return 0;
+        const ex = example;
+        const userPrompt = typeof ex['userPrompt'] === 'string' ? ex['userPrompt'] : '';
+        const expected = expectedByPrompt.get(userPrompt) ?? [];
+        if (expected.length === 0) {
+            // no expected caps — reward length + diversity as a weak proxy
+            return canonical.length > userPrompt.length ? 0.5 : 0;
+        }
+        let plan = null;
+        try {
+            plan = await planPrompt({ prompt: canonical });
+        }
+        catch {
+            return 0;
+        }
+        const p = plan;
+        const actual = p?.kind === 'starter'
+            ? p.spec?.layers ?? []
+            : (p?.spec?.projects ?? []).flatMap((proj) => proj.layers ?? []);
+        return jaccard(actual, expected);
+    };
+}
+export async function trainNode(input) {
+    const { knownFamilies, knownCapabilities } = await buildKnownLists();
+    // Only train on ideasai traces that have expected capabilities. held-out is
+    // measurement, not training. We also skip traces where capabilityHit was
+    // already 1.0 (nothing to learn).
+    const trainables = input.traces.filter((t) => t.corpus === 'ideasai' && t.expectedCapabilities.length > 0 && t.capabilityHit < 1.0);
+    const examples = trainables.slice(0, 30).map((t) => ({
+        userPrompt: t.prompt,
+        knownFamilies,
+        knownCapabilities,
+    }));
+    const expectedByPrompt = new Map();
+    for (const t of trainables)
+        expectedByPrompt.set(t.prompt, t.expectedCapabilities);
+    const briefProgram = ax(BRIEF_SIGNATURE);
+    const metric = makeMetric(expectedByPrompt);
+    let bestScore = 0;
+    let instruction;
+    let instructionMap;
+    let demos;
+    let modelConfig;
+    let optimizerType = 'variant_b.fallback';
+    let optimizationTime = 0;
+    let totalRounds = 0;
+    let converged = false;
+    let scoreHistory;
+    if (examples.length >= 3) {
+        try {
+            const optimizer = new AxMiPRO({
+                studentAI: input.llm,
+                numTrials: 3,
+                numCandidates: 3,
+                minibatch: true,
+                minibatchSize: Math.min(6, examples.length),
+                verbose: false,
+                seed: 42,
+            });
+            optimizer.configureAuto(input.auto ?? 'light');
+            const t0 = Date.now();
+            const result = await optimizer.compile(briefProgram, examples, metric, {
+                maxMetricCalls: Math.max(examples.length * 2, 12),
+                auto: input.auto ?? 'light',
+                verbose: false,
+            });
+            optimizationTime = Date.now() - t0;
+            const opt = result.optimizedProgram;
+            if (opt) {
+                bestScore = opt.bestScore;
+                instruction = opt.instruction;
+                instructionMap = opt.instructionMap;
+                demos = opt.demos;
+                modelConfig = opt.modelConfig;
+                optimizerType = opt.optimizerType;
+                totalRounds = opt.totalRounds;
+                converged = opt.converged;
+                scoreHistory = opt.scoreHistory;
+            }
+            else if (result.bestScore !== undefined) {
+                bestScore = result.bestScore;
+            }
+        }
+        catch (err) {
+            // Rate-limits, provider blips — fall back to the corpus-mined instruction
+            // so the variant still produces an artifact.
+            // eslint-disable-next-line no-console
+            console.warn('[variant_b/train] AxMiPRO failed, using fallback:', err instanceof Error ? err.message : err);
+        }
+    }
+    // Always attach a corpus-mined instruction as a floor. This is the part that
+    // reliably moves capHit because it surfaces the exact vocabulary the
+    // deterministic planner keys off. Real optimization can only improve on it.
+    if (!instruction) {
+        instruction = buildCorpusMinedInstruction(trainables, knownCapabilities);
+        optimizerType = optimizerType === 'variant_b.fallback' ? 'variant_b.corpus-mined' : optimizerType;
+    }
+    const artifact = {
+        optimizerType,
+        bestScore,
+        instruction,
+        instructionMap,
+        demos: Array.isArray(demos) ? demos.slice(0, 8) : demos,
+        modelConfig,
+        optimizationTime,
+        totalRounds,
+        converged,
+        scoreHistory,
+        artifactFormatVersion: 1,
+        signature: BRIEF_SIGNATURE,
+        promptShape: 'brief',
+        trainedAt: new Date().toISOString(),
+        trainingTraceCount: trainables.length,
+        knownFamilies,
+        knownCapabilities,
+    };
+    await mkdir(path.dirname(input.outPath), { recursive: true });
+    await writeFile(input.outPath, JSON.stringify(artifact, null, 2));
+    return { optimizedProgram: artifact, outPath: input.outPath };
+}
+// Mine the training traces to learn the high-signal vocabulary. For each
+// expected capability that was missed, collect the keywords from the original
+// prompt that co-occur with it. Build those into a tight instruction that
+// tells the brief agent to SURFACE the capability name explicitly when it
+// sees those keywords. This is the deterministic floor the optimizer must
+// beat. In practice it already lifts ideasaiCapHit materially because the
+// brief's canonicalPrompt will contain the exact layer IDs the planner scans.
+export function buildCorpusMinedInstruction(trainables, knownCapabilities) {
+    const capToKeywords = new Map();
+    for (const t of trainables) {
+        const words = t.prompt
+            .toLowerCase()
+            .replace(/[^a-z0-9\s-]/g, ' ')
+            .split(/\s+/)
+            .filter((w) => w.length >= 4);
+        for (const cap of t.expectedCapabilities) {
+            if (t.actualCapabilities.includes(cap))
+                continue; // already hit, no lesson
+            if (!capToKeywords.has(cap))
+                capToKeywords.set(cap, new Map());
+            const m = capToKeywords.get(cap);
+            for (const w of words)
+                m.set(w, (m.get(w) ?? 0) + 1);
+        }
+    }
+    const lines = [];
+    lines.push('ALWAYS name the capability IDs explicitly in canonicalPrompt when the user prompt matches.');
+    lines.push('For ambiguous AI-saas prompts, prefer fullstack-ts or nextjs-ts family.');
+    lines.push('Route rules (ordered):');
+    const entries = [...capToKeywords.entries()]
+        .map(([cap, m]) => ({ cap, top: [...m.entries()].sort((a, b) => b[1] - a[1]).slice(0, 6).map(([w]) => w) }))
+        .filter((e) => knownCapabilities.includes(e.cap))
+        .slice(0, 12);
+    for (const { cap, top } of entries) {
+        lines.push(`- If prompt mentions any of [${top.join(', ')}] include "${cap}" in canonicalPrompt.`);
+    }
+    lines.push('ALWAYS include capability:tailwind for any UI that renders pages.');
+    lines.push('ALWAYS include capability:layout-dashboard when prompt describes analytics, tracking, monitoring, or multiple views.');
+    lines.push('ALWAYS include capability:layout-chat when prompt describes messaging, conversation, or companion UX.');
+    lines.push('ALWAYS include capability:ai-chat-ui when the product is AI-driven or talks to the user.');
+    return lines.join('\n');
+}
+//# sourceMappingURL=train.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"train.js","sourceRoot":"","sources":["../../../../src/training/variant_b/nodes/train.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,4EAA4E;AAC5E,wEAAwE;AACxE,sEAAsE;AACtE,EAAE;AACF,4EAA4E;AAC5E,iEAAiE;AAEjE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAY,MAAM,kBAAkB,CAAA;AAC7D,OAAO,IAAI,MAAM,WAAW,CAAA;AAC5B,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,YAAY,CAAA;AAExC,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAA;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAA;AAqC3D,MAAM,eAAe,GACnB,qmBAAqmB;IACrmB,2EAA2E;IAC3E,kMAAkM,CAAA;AAepM,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,KAAK,UAAU,eAAe;IAC5B,MAAM,QAAQ,GAAG,MAAM,YAAY,EAAE,CAAA;IACrC,MAAM,aAAa,GAAG,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAA;IACnD,MAAM,iBAAiB,GAAa,EAAE,CAAA;IACtC,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC;YAAE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAChE,CAAC;IACD,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,CAAA;AAC7C,CAAC;AAED,2EAA2E;AAC3E,uEAAuE;AACvE,0EAA0E;AAC1E,6DAA6D;AAC7D,SAAS,UAAU,CAAC,gBAAuC;IACzD,OAAO,KAAK,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE;QACvC,MAAM,IAAI,GAAG,UAA6B,CAAA;QAC1C,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;QACrD,IAAI,CAAC,SAAS;YAAE,OAAO,CAAC,CAAA;QACxB,MAAM,EAAE,GAAG,OAAkC,CAAA;QAC7C,MAAM,UAAU,GAAG,OAAO,EAAE,CAAC,YAAY,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,YAAY,CAAY,CAAC,CAAC,CAAC,EAAE,CAAA;QAC3F,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAA;QACvD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,+DAA+D;YAC/D,OAAO,SAAS,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,IAAI,IAAI,GAAY,IAAI,CAAA;QACxB,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,UAAU,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAA;QAChD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,CAAC,CAAA;QACV,CAAC;QACD,MAAM,CAAC,GAAG,IAAuG,CAAA;QACjH,MAAM,MAAM,GAAG,CAAC,EAAE,IAAI,KAAK,SAAS;YAClC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE;YACtB,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,CAAA;QAClE,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC,CAAA;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,KAAiB;IAC/C,MAAM,EAAE,aAAa,EAAE,iBAAiB,EAAE,GAAG,MAAM,eAAe,EAAE,CAAA;IAEpE,4EAA4E;IAC5E,yEAAyE;IACzE,kCAAkC;IAClC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,aAAa,GAAG,GAAG,CAC5F,CAAA;IAED,MAAM,QAAQ,GAAwC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACxF,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,aAAa;QACb,iBAAiB;KAClB,CAAC,CAAC,CAAA;IAEH,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAoB,CAAA;IACpD,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAA;IAElF,MAAM,YAAY,GAAG,EAAE,CAAC,eAAe,CAAC,CAAA;IACxC,MAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,CAAC,CAAA;IAE3C,IAAI,SAAS,GAAG,CAAC,CAAA;IACjB,IAAI,WAA+B,CAAA;IACnC,IAAI,cAAkD,CAAA;IACtD,IAAI,KAA4B,CAAA;IAChC,IAAI,WAAgD,CAAA;IACpD,IAAI,aAAa,GAAG,oBAAoB,CAAA;IACxC,IAAI,gBAAgB,GAAG,CAAC,CAAA;IACxB,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,SAAS,GAAG,KAAK,CAAA;IACrB,IAAI,YAAkC,CAAA;IAEtC,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,IAAI,OAAO,CAAC;gBAC5B,SAAS,EAAE,KAAK,CAAC,GAAG;gBACpB,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,SAAS,EAAE,IAAI;gBACf,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC;gBAC3C,OAAO,EAAE,KAAK;gBACd,IAAI,EAAE,EAAE;aACT,CAAC,CAAA;YACF,SAAS,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,IAAI,OAAO,CAAC,CAAA;YAE9C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;YACrB,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,OAAO,CAAC,YAAY,EAAE,QAAQ,EAAE,MAAM,EAAE;gBACrE,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,OAAO;gBAC3B,OAAO,EAAE,KAAK;aACf,CAAC,CAAA;YACF,gBAAgB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;YAElC,MAAM,GAAG,GAAG,MAAM,CAAC,gBAAmE,CAAA;YACtF,IAAI,GAAG,EAAE,CAAC;gBACR,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;gBACzB,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;gBAC7B,cAAc,GAAG,GAAG,CAAC,cAAc,CAAA;gBACnC,KAAK,GAAG,GAAG,CAAC,KAA8B,CAAA;gBAC1C,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;gBAC7B,aAAa,GAAG,GAAG,CAAC,aAAa,CAAA;gBACjC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;gBAC7B,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;gBACzB,YAAY,GAAG,GAAG,CAAC,YAAY,CAAA;YACjC,CAAC;iBAAM,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC1C,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;YAC9B,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,0EAA0E;YAC1E,6CAA6C;YAC7C,sCAAsC;YACtC,OAAO,CAAC,IAAI,CAAC,mDAAmD,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QAC7G,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,qEAAqE;IACrE,4EAA4E;IAC5E,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,WAAW,GAAG,2BAA2B,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAA;QACxE,aAAa,GAAG,aAAa,KAAK,oBAAoB,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,aAAa,CAAA;IACnG,CAAC;IAED,MAAM,QAAQ,GAA+B;QAC3C,aAAa;QACb,SAAS;QACT,WAAW;QACX,cAAc;QACd,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;QACvD,WAAW;QACX,gBAAgB;QAChB,WAAW;QACX,SAAS;QACT,YAAY;QACZ,qBAAqB,EAAE,CAAC;QACxB,SAAS,EAAE,eAAe;QAC1B,WAAW,EAAE,OAAO;QACpB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,kBAAkB,EAAE,UAAU,CAAC,MAAM;QACrC,aAAa;QACb,iBAAiB;KAClB,CAAA;IAED,MAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IAC7D,MAAM,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAEjE,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAA;AAC/D,CAAC;AAED,yEAAyE;AACzE,8EAA8E;AAC9E,0EAA0E;AAC1E,0EAA0E;AAC1E,0EAA0E;AAC1E,0EAA0E;AAC1E,8EAA8E;AAC9E,MAAM,UAAU,2BAA2B,CAAC,UAAmB,EAAE,iBAA2B;IAC1F,MAAM,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAA;IAC5D,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM;aACnB,WAAW,EAAE;aACb,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;aAC7B,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAA;QAC/B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,oBAAoB,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,kBAAkB,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAQ,CAAC,yBAAyB;YAC1E,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;YAC9D,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAA;YACjC,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACtD,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,CAAC,IAAI,CAAC,4FAA4F,CAAC,CAAA;IACxG,KAAK,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAA;IACrF,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAA;IACpC,MAAM,OAAO,GAAG,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;SACzC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,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,EAAE,CAAC,CAAC;SAC3G,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAChD,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACf,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,OAAO,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,gCAAgC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,GAAG,uBAAuB,CAAC,CAAA;IACpG,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAA;IAC/E,KAAK,CAAC,IAAI,CAAC,sHAAsH,CAAC,CAAA;IAClI,KAAK,CAAC,IAAI,CAAC,uGAAuG,CAAC,CAAA;IACnH,KAAK,CAAC,IAAI,CAAC,0FAA0F,CAAC,CAAA;IACtG,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC"}

package/dist/training/variant_b/run-flow.d.ts

@@ -0,0 +1,11 @@
+import type { FlowOutput } from './flow.js';
+export interface RunFullFlowInput {
+    corpusPath?: string;
+    registryRoot?: string;
+    tracesDir?: string;
+    optimizedPath?: string;
+    ideasPath?: string;
+    judgePath?: string;
+    iterations?: number;
+}
+export declare function runFullFlow(input?: RunFullFlowInput): Promise<FlowOutput>;

package/dist/training/variant_b/run-flow.js

@@ -0,0 +1,21 @@
+// runFullFlow: runs the entire AxFlow pipeline end-to-end. Used by the
+// variant_b-flow.mjs script and by the integration test. This is the
+// one-shot "do everything" entrypoint.
+import { buildVariantBFlow } from './flow.js';
+import { createLLM } from '../../lib/llm.js';
+export async function runFullFlow(input = {}) {
+    const llm = createLLM();
+    const flowInstance = buildVariantBFlow();
+    const result = await flowInstance.forward(llm, {
+        corpusPath: input.corpusPath ?? 'corpus/ideasai-prompts.json',
+        registryRoot: input.registryRoot ?? 'registry',
+        tracesDir: input.tracesDir ?? '.evolve/traces',
+        optimizedPath: input.optimizedPath ?? '.evolve/optimized/brief-variant_b.json',
+        ideasPath: input.ideasPath ?? '.evolve/ideas/variant_b.json',
+        judgePath: input.judgePath ?? '.evolve/judge/variant_b.jsonl',
+        iterations: input.iterations ?? 1,
+        llm,
+    });
+    return result;
+}
+//# sourceMappingURL=run-flow.js.map

package/dist/training/variant_b/run-flow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-flow.js","sourceRoot":"","sources":["../../../src/training/variant_b/run-flow.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,qEAAqE;AACrE,uCAAuC;AAEvC,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAA;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAa5C,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,QAA0B,EAAE;IAC5D,MAAM,GAAG,GAAG,SAAS,EAAE,CAAA;IACvB,MAAM,YAAY,GAAG,iBAAiB,EAAE,CAAA;IACxC,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,OAAO,CAAC,GAAG,EAAE;QAC7C,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,6BAA6B;QAC7D,YAAY,EAAE,KAAK,CAAC,YAAY,IAAI,UAAU;QAC9C,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,gBAAgB;QAC9C,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,wCAAwC;QAC9E,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,8BAA8B;QAC5D,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,+BAA+B;QAC7D,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,CAAC;QACjC,GAAG;KACJ,CAAC,CAAA;IACF,OAAO,MAAoB,CAAA;AAC7B,CAAC"}

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

@@ -0,0 +1,15 @@
+import type { SerializedOptimizedProgram } from './nodes/train.js';
+export interface RunTrainingLoopInput {
+    corpusPath: string;
+    outPath: string;
+    tracesDir?: string;
+    auto?: 'light' | 'medium' | 'heavy';
+    limit?: number;
+}
+export interface RunTrainingLoopResult {
+    optimizedProgram: SerializedOptimizedProgram;
+    outPath: string;
+    traceCount: number;
+    tracesFile: string;
+}
+export declare function runTrainingLoop(input: RunTrainingLoopInput): Promise<RunTrainingLoopResult>;

package/dist/training/variant_b/train.js

@@ -0,0 +1,37 @@
+// Public entrypoint: runTrainingLoop({ corpusPath, outPath })
+//
+// Contract (see scripts/multi-pursue-eval.mjs):
+//   - Read corpusPath (defaults to corpus/ideasai-prompts.json)
+//   - Synthesize traces via the collect node
+//   - Run the train node, which compiles AxMiPRO on the brief signature
+//   - Write serialized AxOptimizedProgram JSON to outPath
+//
+// This wraps exactly the first two nodes of the flow. The full flow lives in
+// run-flow.ts. Training is separated so the eval harness can run it without
+// paying for generate/judge/rank/promote.
+import { createLLM } from '../../lib/llm.js';
+import { collectNode } from './nodes/collect.js';
+import { trainNode } from './nodes/train.js';
+export async function runTrainingLoop(input) {
+    const tracesDir = input.tracesDir ?? '.evolve/traces';
+    const collect = await collectNode({
+        corpusPath: input.corpusPath,
+        tracesDir,
+        limit: input.limit,
+        includeHeldOut: true,
+    });
+    const llm = createLLM();
+    const train = await trainNode({
+        traces: collect.traces,
+        outPath: input.outPath,
+        llm,
+        auto: input.auto ?? 'light',
+    });
+    return {
+        optimizedProgram: train.optimizedProgram,
+        outPath: train.outPath,
+        traceCount: collect.traces.length,
+        tracesFile: collect.tracesFile,
+    };
+}
+//# sourceMappingURL=train.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"train.js","sourceRoot":"","sources":["../../../src/training/variant_b/train.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,EAAE;AACF,gDAAgD;AAChD,gEAAgE;AAChE,6CAA6C;AAC7C,wEAAwE;AACxE,0DAA0D;AAC1D,EAAE;AACF,6EAA6E;AAC7E,4EAA4E;AAC5E,0CAA0C;AAE1C,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAA;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAA;AAkB5C,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,KAA2B;IAC/D,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,gBAAgB,CAAA;IACrD,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC;QAChC,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,SAAS;QACT,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,cAAc,EAAE,IAAI;KACrB,CAAC,CAAA;IACF,MAAM,GAAG,GAAG,SAAS,EAAE,CAAA;IACvB,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC;QAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,GAAG;QACH,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,OAAO;KAC5B,CAAC,CAAA;IACF,OAAO;QACL,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM;QACjC,UAAU,EAAE,OAAO,CAAC,UAAU;KAC/B,CAAA;AACH,CAAC"}

package/dist/types.d.ts

@@ -132,6 +132,18 @@ export interface BuildPlan {
     designDirective: string | null;
     /** shadcn preset code for `pnpm dlx shadcn@latest init --preset <code>` */
     presetCode?: string | null;
+    /** Vision statement (2-4 sentences) — only populated when a product brief was generated. */
+    vision?: string;
+    /** Ordered major phases with success criteria. Populated from product brief. */
+    milestones?: string[];
+    /** Unit/integration test plan items. Populated from product brief. */
+    testingPlan?: string[];
+    /** End-to-end user-journey coverage items. Populated from product brief. */
+    e2ePlan?: string[];
+    /** Red-team / audit surface concerns. Populated from product brief. */
+    securityConcerns?: string[];
+    /** Things the user should clarify. Populated from product brief. */
+    openQuestions?: string[];
 }
 export interface BuildHints {
     pages?: string[];
@@ -205,12 +217,16 @@ export interface StarterPromptPlan {
     confidence: Confidence;
     reasons: string[];
     spec: ComposeSpec;
+    /** Opaque product brief object attached when planPrompt was called with brief: true. */
+    brief?: unknown;
 }
 export interface WorkspacePromptPlan {
     kind: 'workspace';
     confidence: Confidence;
     reasons: string[];
     spec: WorkspaceSpec;
+    /** Opaque product brief object attached when planPrompt was called with brief: true. */
+    brief?: unknown;
 }
 export type PromptPlan = StarterPromptPlan | WorkspacePromptPlan;
 export interface ComposeComponents {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tangle-network/starter-foundry",
-  "version": "0.5.3",
+  "version": "0.5.4",
   "description": "Deterministic project scaffold engine for AI coding platforms",
   "type": "module",
   "license": "MIT",
@@ -38,7 +38,7 @@
   "scripts": {
     "build": "tsc",
     "prepublishOnly": "tsc",
-    "test": "tsc && tsc -p tsconfig.test.json && node --test dist-tests/*.test.js",
+    "test": "tsc && tsc -p tsconfig.test.json && node --test --test-concurrency=1 dist-tests/*.test.js",
     "catalog": "node dist/cli.js catalog",
     "select": "node dist/cli.js select",
     "compose": "node dist/cli.js compose",
@@ -65,6 +65,10 @@
     "typescript": "^5.7.0"
   },
   "dependencies": {
+    "@ax-llm/ax": "^19.0.45",
     "@huggingface/transformers": "^4.0.0"
+  },
+  "optionalDependencies": {
+    "@opentelemetry/api": "^1.9.0"
   }
 }

package/registry/families/browser-extension-ts/files/package.json

@@ -7,6 +7,9 @@
     "validate": "node validate-types.mjs"
   },
   "devDependencies": {
-    "vite": "^6.2.0"
+    "vite": "^6.2.0",
+    "typescript": "^5.7.0",
+    "@types/chrome": "^0.0.280",
+    "@types/node": "^20.0.0"
   }
 }

package/registry/families/cli-ts/files/package.json

@@ -7,6 +7,11 @@
   },
   "scripts": {
     "dev": "node --experimental-strip-types src/index.ts",
+    "typecheck": "tsc --noEmit",
     "validate": "node validate-types.mjs"
+  },
+  "devDependencies": {
+    "typescript": "^5.7.0",
+    "@types/node": "^20.0.0"
   }
 }

package/registry/families/electron-desktop-ts/files/package.json

@@ -8,6 +8,8 @@
     "validate": "node validate-types.mjs"
   },
   "devDependencies": {
-    "electron": "^36.0.0"
+    "electron": "^36.0.0",
+    "typescript": "^5.7.0",
+    "@types/node": "^20.0.0"
   }
 }

package/registry/families/expo-react-native-ts/files/package.json

@@ -10,5 +10,9 @@
     "expo": "^53.0.0",
     "react": "^19.1.0",
     "react-native": "^0.79.0"
+  },
+  "devDependencies": {
+    "typescript": "^5.7.0",
+    "@types/react": "^19.0.0"
   }
 }

package/registry/families/fhenix-contracts/files/package.json

@@ -11,6 +11,6 @@
     "@nomicfoundation/hardhat-toolbox": "^5.0.0",
     "@cofhe/hardhat-plugin": "latest",
     "@fhenixprotocol/cofhe-contracts": "latest",
-    "cofhejs": "^0.4.1"
+    "cofhejs": "^0.3.1"
   }
 }

package/registry/families/fhevm-contracts/files/package.json

@@ -9,7 +9,7 @@
   "devDependencies": {
     "hardhat": "^2.22.0",
     "@nomicfoundation/hardhat-toolbox": "^5.0.0",
-    "@fhevm/solidity": "^0.6.2",
+    "@fhevm/solidity": "^0.11.1",
     "@fhevm/hardhat-plugin": "latest",
     "@fhevm-sdk/core": "^0.1.6"
   }

package/registry/families/fullstack-ts/files/package.json

@@ -16,6 +16,8 @@
   "devDependencies": {
     "@tailwindcss/postcss": "latest",
     "postcss": "latest",
-    "tailwindcss": "latest"
+    "tailwindcss": "latest",
+    "typescript": "^5.7.0",
+    "@types/node": "^20.0.0"
   }
 }

package/registry/families/hardhat-contracts/files/package.json

@@ -8,6 +8,8 @@
   },
   "devDependencies": {
     "hardhat": "^2.22.0",
-    "@nomicfoundation/hardhat-toolbox": "^5.0.0"
+    "@nomicfoundation/hardhat-toolbox": "^5.0.0",
+    "@types/node": "^20.0.0",
+    "typescript": "^5.7.0"
   }
 }