agentic-flow 3.0.0-alpha.2 → 3.1.0

package/dist/harness/flywheel-governance.d.ts

@@ -0,0 +1,85 @@
+export interface BenchmarkAnchor {
+    version: 1;
+    project: string;
+    corpusHash: string;
+    embeddingSpaceHash: string;
+    indexTopologyHash: string;
+    evaluatorHash: string;
+}
+export interface PromotionMetrics {
+    primary: number;
+    noopRate: number;
+    costPerWin: number;
+    regressed?: boolean;
+}
+export interface EvaluationReceipt {
+    version: 1;
+    experimentRevision: string;
+    candidateCommit: string;
+    candidateHash: string;
+    baselineGeneration: string;
+    anchor: BenchmarkAnchor;
+    anchorHash: string;
+    gateFingerprint: string;
+    baseline: PromotionMetrics;
+    candidate: PromotionMetrics;
+    anchorMetric?: {
+        baseline: number;
+        candidate: number;
+    };
+    createdAt: string;
+}
+export interface PromotionProposal {
+    version: 1;
+    receipt: EvaluationReceipt;
+    receiptHash: string;
+    promote: boolean;
+    reasons: string[];
+}
+export interface PromotionAuthorization {
+    version: 1;
+    receiptHash: string;
+    candidateCommit: string;
+    expiresAt: string;
+    signer: string;
+    signature: string;
+    publicKey: string;
+}
+export interface AtomicPromotionStore {
+    compareAndSwap(expectedGeneration: string, candidateHash: string, evidenceHash: string): Promise<{
+        promoted: boolean;
+        generation: string;
+    }>;
+}
+export interface PromotionRecord {
+    version: 1;
+    receiptHash: string;
+    candidateCommit: string;
+    candidateHash: string;
+    previousGeneration: string;
+    generation: string;
+    signer: string;
+    promotedAt: string;
+}
+export declare function governanceHash(value: unknown): string;
+export declare function createBenchmarkAnchor(input: Omit<BenchmarkAnchor, 'version'>): BenchmarkAnchor;
+export declare function createEvaluationReceipt(input: Omit<EvaluationReceipt, 'version' | 'anchorHash'>): EvaluationReceipt;
+export declare function evaluateCandidate(receipt: EvaluationReceipt): Promise<PromotionProposal>;
+export declare function authorizePromotion(proposal: PromotionProposal, signer: string, expiresAt: string, privateKey: string, publicKey: string): PromotionAuthorization;
+export declare function verifyPromotionAuthorization(proposal: PromotionProposal, authorization: PromotionAuthorization, now?: Date): boolean;
+export declare function promoteCandidate(proposal: PromotionProposal, authorization: PromotionAuthorization, store: AtomicPromotionStore, options: {
+    now?: Date;
+    trustedPublicKeys: ReadonlySet<string>;
+}): Promise<PromotionRecord>;
+export declare function verifyGovernanceReplay(bundle: {
+    proposal: PromotionProposal;
+    authorization: PromotionAuthorization;
+    promotion?: PromotionRecord;
+}, options: {
+    now?: Date;
+    trustedPublicKeys: ReadonlySet<string>;
+}): {
+    valid: boolean;
+    reasons: string[];
+};
+//# sourceMappingURL=flywheel-governance.d.ts.map

package/dist/harness/flywheel-governance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flywheel-governance.d.ts","sourceRoot":"","sources":["../../src/harness/flywheel-governance.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,CAAC,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,aAAa,EAAE,MAAM,CAAC;CACvB;AACD,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AACD,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,CAAC,CAAC;IACX,kBAAkB,EAAE,MAAM,CAAC;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,eAAe,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,gBAAgB,CAAC;IAC5B,YAAY,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IACvD,SAAS,EAAE,MAAM,CAAC;CACnB;AACD,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,CAAC,CAAC;IACX,OAAO,EAAE,iBAAiB,CAAC;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AACD,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,CAAC,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AACD,MAAM,WAAW,oBAAoB;IACnC,cAAc,CAAC,kBAAkB,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GACpF,OAAO,CAAC;QAAE,QAAQ,EAAE,OAAO,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtD;AACD,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,CAAC,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAUD,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAErD;AAID,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,eAAe,EAAE,SAAS,CAAC,GAAG,eAAe,CAM9F;AACD,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,IAAI,CAAC,iBAAiB,EAAE,SAAS,GAAG,YAAY,CAAC,GAAG,iBAAiB,CAQnH;AACD,wBAAsB,iBAAiB,CAAC,OAAO,EAAE,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAc9F;AAID,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,iBAAiB,EAC3B,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,GAChB,sBAAsB,CAWxB;AACD,wBAAgB,4BAA4B,CAC1C,QAAQ,EAAE,iBAAiB,EAC3B,aAAa,EAAE,sBAAsB,EACrC,GAAG,OAAa,GACf,OAAO,CAWT;AACD,wBAAsB,gBAAgB,CACpC,QAAQ,EAAE,iBAAiB,EAC3B,aAAa,EAAE,sBAAsB,EACrC,KAAK,EAAE,oBAAoB,EAC3B,OAAO,EAAE;IAAE,GAAG,CAAC,EAAE,IAAI,CAAC;IAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;CAAE,GAC9D,OAAO,CAAC,eAAe,CAAC,CAqB1B;AACD,wBAAgB,sBAAsB,CACpC,MAAM,EAAE;IAAE,QAAQ,EAAE,iBAAiB,CAAC;IAAC,aAAa,EAAE,sBAAsB,CAAC;IAAC,SAAS,CAAC,EAAE,eAAe,CAAA;CAAE,EAC3G,OAAO,EAAE;IAAE,GAAG,CAAC,EAAE,IAAI,CAAC;IAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;CAAE,GAC9D;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAUvC"}

package/dist/harness/flywheel-governance.js

@@ -0,0 +1,123 @@
+/**
+ * Trusted evaluation/promotion boundary (ADR-077).
+ * Candidate jobs create evidence; only a trusted signer plus an atomic CAS can promote.
+ */
+import { createHash, sign as cryptoSign, verify as cryptoVerify } from 'node:crypto';
+import { evaluateMetaHarnessPromotion } from './metaharness.js';
+function canonical(value) {
+    if (Array.isArray(value))
+        return `[${value.map(canonical).join(',')}]`;
+    if (value && typeof value === 'object') {
+        const object = value;
+        return `{${Object.keys(object).sort().map((key) => `${JSON.stringify(key)}:${canonical(object[key])}`).join(',')}}`;
+    }
+    return JSON.stringify(value);
+}
+export function governanceHash(value) {
+    return createHash('sha256').update(canonical(value)).digest('hex');
+}
+function assertDigest(name, digest) {
+    if (!/^[a-f0-9]{64}$/.test(digest))
+        throw new TypeError(`${name} must be a lowercase sha256 digest`);
+}
+export function createBenchmarkAnchor(input) {
+    for (const field of ['corpusHash', 'embeddingSpaceHash', 'indexTopologyHash', 'evaluatorHash']) {
+        assertDigest(field, input[field]);
+    }
+    if (!input.project.trim())
+        throw new TypeError('project is required');
+    return { version: 1, ...input };
+}
+export function createEvaluationReceipt(input) {
+    assertDigest('candidateHash', input.candidateHash);
+    assertDigest('gateFingerprint', input.gateFingerprint);
+    if (!input.experimentRevision.trim() || !input.candidateCommit.trim() || !input.baselineGeneration.trim()) {
+        throw new TypeError('experimentRevision, candidateCommit, and baselineGeneration are required');
+    }
+    if (!Number.isFinite(Date.parse(input.createdAt)))
+        throw new TypeError('createdAt must be an ISO timestamp');
+    return { version: 1, ...input, anchorHash: governanceHash(input.anchor) };
+}
+export async function evaluateCandidate(receipt) {
+    if (receipt.anchorHash !== governanceHash(receipt.anchor))
+        throw new Error('benchmark anchor hash mismatch');
+    const decision = await evaluateMetaHarnessPromotion({
+        baseline: receipt.baseline,
+        candidate: receipt.candidate,
+        ...(receipt.anchorMetric ? { anchor: receipt.anchorMetric } : {}),
+    });
+    return {
+        version: 1,
+        receipt,
+        receiptHash: governanceHash(receipt),
+        promote: decision.promote,
+        reasons: [...decision.reasons],
+    };
+}
+function authorizationPayload(auth) {
+    return canonical(auth);
+}
+export function authorizePromotion(proposal, signer, expiresAt, privateKey, publicKey) {
+    if (!proposal.promote)
+        throw new Error('cannot authorize a rejected or inconclusive proposal');
+    const unsigned = {
+        version: 1,
+        receiptHash: proposal.receiptHash,
+        candidateCommit: proposal.receipt.candidateCommit,
+        expiresAt,
+        signer,
+    };
+    const signature = cryptoSign(null, Buffer.from(authorizationPayload(unsigned)), privateKey).toString('base64');
+    return { ...unsigned, signature, publicKey };
+}
+export function verifyPromotionAuthorization(proposal, authorization, now = new Date()) {
+    const expiry = Date.parse(authorization.expiresAt);
+    if (!proposal.promote || authorization.receiptHash !== proposal.receiptHash ||
+        authorization.candidateCommit !== proposal.receipt.candidateCommit ||
+        !Number.isFinite(expiry) || expiry <= now.getTime())
+        return false;
+    const { signature, publicKey, ...unsigned } = authorization;
+    try {
+        return cryptoVerify(null, Buffer.from(authorizationPayload(unsigned)), publicKey, Buffer.from(signature, 'base64'));
+    }
+    catch {
+        return false;
+    }
+}
+export async function promoteCandidate(proposal, authorization, store, options) {
+    const now = options.now ?? new Date();
+    if (!options.trustedPublicKeys.has(authorization.publicKey))
+        throw new Error('untrusted promotion signer');
+    if (!verifyPromotionAuthorization(proposal, authorization, now))
+        throw new Error('invalid promotion authorization');
+    if (proposal.receiptHash !== governanceHash(proposal.receipt))
+        throw new Error('evaluation receipt hash mismatch');
+    const result = await store.compareAndSwap(proposal.receipt.baselineGeneration, proposal.receipt.candidateHash, proposal.receiptHash);
+    if (!result.promoted)
+        throw new Error('promotion race: baseline generation changed');
+    return {
+        version: 1,
+        receiptHash: proposal.receiptHash,
+        candidateCommit: proposal.receipt.candidateCommit,
+        candidateHash: proposal.receipt.candidateHash,
+        previousGeneration: proposal.receipt.baselineGeneration,
+        generation: result.generation,
+        signer: authorization.signer,
+        promotedAt: now.toISOString(),
+    };
+}
+export function verifyGovernanceReplay(bundle, options) {
+    const reasons = [];
+    if (bundle.proposal.receiptHash !== governanceHash(bundle.proposal.receipt))
+        reasons.push('receipt hash mismatch');
+    if (!options.trustedPublicKeys.has(bundle.authorization.publicKey))
+        reasons.push('untrusted signer');
+    if (!verifyPromotionAuthorization(bundle.proposal, bundle.authorization, options.now))
+        reasons.push('invalid authorization');
+    if (bundle.promotion && (bundle.promotion.receiptHash !== bundle.proposal.receiptHash ||
+        bundle.promotion.candidateHash !== bundle.proposal.receipt.candidateHash)) {
+        reasons.push('promotion lineage mismatch');
+    }
+    return { valid: reasons.length === 0, reasons };
+}
+//# sourceMappingURL=flywheel-governance.js.map

package/dist/harness/flywheel-governance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flywheel-governance.js","sourceRoot":"","sources":["../../src/harness/flywheel-governance.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,UAAU,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,IAAI,YAAY,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,4BAA4B,EAAE,MAAM,kBAAkB,CAAC;AA6DhE,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACvE,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,KAAgC,CAAC;QAChD,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACtH,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AACD,MAAM,UAAU,cAAc,CAAC,KAAc;IAC3C,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACrE,CAAC;AACD,SAAS,YAAY,CAAC,IAAY,EAAE,MAAc;IAChD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,GAAG,IAAI,oCAAoC,CAAC,CAAC;AACvG,CAAC;AACD,MAAM,UAAU,qBAAqB,CAAC,KAAuC;IAC3E,KAAK,MAAM,KAAK,IAAI,CAAC,YAAY,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,eAAe,CAAU,EAAE,CAAC;QACxG,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE;QAAE,MAAM,IAAI,SAAS,CAAC,qBAAqB,CAAC,CAAC;IACtE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC;AAClC,CAAC;AACD,MAAM,UAAU,uBAAuB,CAAC,KAAwD;IAC9F,YAAY,CAAC,eAAe,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IACnD,YAAY,CAAC,iBAAiB,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;IACvD,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC;QAC1G,MAAM,IAAI,SAAS,CAAC,0EAA0E,CAAC,CAAC;IAClG,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,oCAAoC,CAAC,CAAC;IAC7G,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,UAAU,EAAE,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;AAC5E,CAAC;AACD,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,OAA0B;IAChE,IAAI,OAAO,CAAC,UAAU,KAAK,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IAC7G,MAAM,QAAQ,GAAG,MAAM,4BAA4B,CAAC;QAClD,QAAQ,EAAE,OAAO,CAAC,QAAQ;QAC1B,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAClE,CAAC,CAAC;IACH,OAAO;QACL,OAAO,EAAE,CAAC;QACV,OAAO;QACP,WAAW,EAAE,cAAc,CAAC,OAAO,CAAC;QACpC,OAAO,EAAE,QAAQ,CAAC,OAAO;QACzB,OAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC;KAC/B,CAAC;AACJ,CAAC;AACD,SAAS,oBAAoB,CAAC,IAA6D;IACzF,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AACD,MAAM,UAAU,kBAAkB,CAChC,QAA2B,EAC3B,MAAc,EACd,SAAiB,EACjB,UAAkB,EAClB,SAAiB;IAEjB,IAAI,CAAC,QAAQ,CAAC,OAAO;QAAE,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;IAC/F,MAAM,QAAQ,GAAG;QACf,OAAO,EAAE,CAAU;QACnB,WAAW,EAAE,QAAQ,CAAC,WAAW;QACjC,eAAe,EAAE,QAAQ,CAAC,OAAO,CAAC,eAAe;QACjD,SAAS;QACT,MAAM;KACP,CAAC;IACF,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC/G,OAAO,EAAE,GAAG,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;AAC/C,CAAC;AACD,MAAM,UAAU,4BAA4B,CAC1C,QAA2B,EAC3B,aAAqC,EACrC,GAAG,GAAG,IAAI,IAAI,EAAE;IAEhB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;IACnD,IAAI,CAAC,QAAQ,CAAC,OAAO,IAAI,aAAa,CAAC,WAAW,KAAK,QAAQ,CAAC,WAAW;QACvE,aAAa,CAAC,eAAe,KAAK,QAAQ,CAAC,OAAO,CAAC,eAAe;QAClE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE;QAAE,OAAO,KAAK,CAAC;IACtE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,QAAQ,EAAE,GAAG,aAAa,CAAC;IAC5D,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;IACtH,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AACD,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAA2B,EAC3B,aAAqC,EACrC,KAA2B,EAC3B,OAA+D;IAE/D,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC;IACtC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,GAAG,CAAC,aAAa,CAAC,SAAS,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAC3G,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,aAAa,EAAE,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACpH,IAAI,QAAQ,CAAC,WAAW,KAAK,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACnH,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,cAAc,CACvC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,EACnC,QAAQ,CAAC,OAAO,CAAC,aAAa,EAC9B,QAAQ,CAAC,WAAW,CACrB,CAAC;IACF,IAAI,CAAC,MAAM,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACrF,OAAO;QACL,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,QAAQ,CAAC,WAAW;QACjC,eAAe,EAAE,QAAQ,CAAC,OAAO,CAAC,eAAe;QACjD,aAAa,EAAE,QAAQ,CAAC,OAAO,CAAC,aAAa;QAC7C,kBAAkB,EAAE,QAAQ,CAAC,OAAO,CAAC,kBAAkB;QACvD,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,MAAM,EAAE,aAAa,CAAC,MAAM;QAC5B,UAAU,EAAE,GAAG,CAAC,WAAW,EAAE;KAC9B,CAAC;AACJ,CAAC;AACD,MAAM,UAAU,sBAAsB,CACpC,MAA2G,EAC3G,OAA+D;IAE/D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,KAAK,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IACnH,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IACrG,IAAI,CAAC,4BAA4B,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,aAAa,EAAE,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAC7H,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,KAAK,MAAM,CAAC,QAAQ,CAAC,WAAW;QACjF,MAAM,CAAC,SAAS,CAAC,aAAa,KAAK,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAC9E,OAAO,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;AAClD,CAAC","sourcesContent":["/**\n * Trusted evaluation/promotion boundary (ADR-077).\n * Candidate jobs create evidence; only a trusted signer plus an atomic CAS can promote.\n */\nimport { createHash, sign as cryptoSign, verify as cryptoVerify } from 'node:crypto';\nimport { evaluateMetaHarnessPromotion } from './metaharness.js';\n\nexport interface BenchmarkAnchor {\n  version: 1;\n  project: string;\n  corpusHash: string;\n  embeddingSpaceHash: string;\n  indexTopologyHash: string;\n  evaluatorHash: string;\n}\nexport interface PromotionMetrics {\n  primary: number;\n  noopRate: number;\n  costPerWin: number;\n  regressed?: boolean;\n}\nexport interface EvaluationReceipt {\n  version: 1;\n  experimentRevision: string;\n  candidateCommit: string;\n  candidateHash: string;\n  baselineGeneration: string;\n  anchor: BenchmarkAnchor;\n  anchorHash: string;\n  gateFingerprint: string;\n  baseline: PromotionMetrics;\n  candidate: PromotionMetrics;\n  anchorMetric?: { baseline: number; candidate: number };\n  createdAt: string;\n}\nexport interface PromotionProposal {\n  version: 1;\n  receipt: EvaluationReceipt;\n  receiptHash: string;\n  promote: boolean;\n  reasons: string[];\n}\nexport interface PromotionAuthorization {\n  version: 1;\n  receiptHash: string;\n  candidateCommit: string;\n  expiresAt: string;\n  signer: string;\n  signature: string;\n  publicKey: string;\n}\nexport interface AtomicPromotionStore {\n  compareAndSwap(expectedGeneration: string, candidateHash: string, evidenceHash: string):\n    Promise<{ promoted: boolean; generation: string }>;\n}\nexport interface PromotionRecord {\n  version: 1;\n  receiptHash: string;\n  candidateCommit: string;\n  candidateHash: string;\n  previousGeneration: string;\n  generation: string;\n  signer: string;\n  promotedAt: string;\n}\n\nfunction canonical(value: unknown): string {\n  if (Array.isArray(value)) return `[${value.map(canonical).join(',')}]`;\n  if (value && typeof value === 'object') {\n    const object = value as Record<string, unknown>;\n    return `{${Object.keys(object).sort().map((key) => `${JSON.stringify(key)}:${canonical(object[key])}`).join(',')}}`;\n  }\n  return JSON.stringify(value);\n}\nexport function governanceHash(value: unknown): string {\n  return createHash('sha256').update(canonical(value)).digest('hex');\n}\nfunction assertDigest(name: string, digest: string): void {\n  if (!/^[a-f0-9]{64}$/.test(digest)) throw new TypeError(`${name} must be a lowercase sha256 digest`);\n}\nexport function createBenchmarkAnchor(input: Omit<BenchmarkAnchor, 'version'>): BenchmarkAnchor {\n  for (const field of ['corpusHash', 'embeddingSpaceHash', 'indexTopologyHash', 'evaluatorHash'] as const) {\n    assertDigest(field, input[field]);\n  }\n  if (!input.project.trim()) throw new TypeError('project is required');\n  return { version: 1, ...input };\n}\nexport function createEvaluationReceipt(input: Omit<EvaluationReceipt, 'version' | 'anchorHash'>): EvaluationReceipt {\n  assertDigest('candidateHash', input.candidateHash);\n  assertDigest('gateFingerprint', input.gateFingerprint);\n  if (!input.experimentRevision.trim() || !input.candidateCommit.trim() || !input.baselineGeneration.trim()) {\n    throw new TypeError('experimentRevision, candidateCommit, and baselineGeneration are required');\n  }\n  if (!Number.isFinite(Date.parse(input.createdAt))) throw new TypeError('createdAt must be an ISO timestamp');\n  return { version: 1, ...input, anchorHash: governanceHash(input.anchor) };\n}\nexport async function evaluateCandidate(receipt: EvaluationReceipt): Promise<PromotionProposal> {\n  if (receipt.anchorHash !== governanceHash(receipt.anchor)) throw new Error('benchmark anchor hash mismatch');\n  const decision = await evaluateMetaHarnessPromotion({\n    baseline: receipt.baseline,\n    candidate: receipt.candidate,\n    ...(receipt.anchorMetric ? { anchor: receipt.anchorMetric } : {}),\n  });\n  return {\n    version: 1,\n    receipt,\n    receiptHash: governanceHash(receipt),\n    promote: decision.promote,\n    reasons: [...decision.reasons],\n  };\n}\nfunction authorizationPayload(auth: Omit<PromotionAuthorization, 'signature' | 'publicKey'>): string {\n  return canonical(auth);\n}\nexport function authorizePromotion(\n  proposal: PromotionProposal,\n  signer: string,\n  expiresAt: string,\n  privateKey: string,\n  publicKey: string,\n): PromotionAuthorization {\n  if (!proposal.promote) throw new Error('cannot authorize a rejected or inconclusive proposal');\n  const unsigned = {\n    version: 1 as const,\n    receiptHash: proposal.receiptHash,\n    candidateCommit: proposal.receipt.candidateCommit,\n    expiresAt,\n    signer,\n  };\n  const signature = cryptoSign(null, Buffer.from(authorizationPayload(unsigned)), privateKey).toString('base64');\n  return { ...unsigned, signature, publicKey };\n}\nexport function verifyPromotionAuthorization(\n  proposal: PromotionProposal,\n  authorization: PromotionAuthorization,\n  now = new Date(),\n): boolean {\n  const expiry = Date.parse(authorization.expiresAt);\n  if (!proposal.promote || authorization.receiptHash !== proposal.receiptHash ||\n      authorization.candidateCommit !== proposal.receipt.candidateCommit ||\n      !Number.isFinite(expiry) || expiry <= now.getTime()) return false;\n  const { signature, publicKey, ...unsigned } = authorization;\n  try {\n    return cryptoVerify(null, Buffer.from(authorizationPayload(unsigned)), publicKey, Buffer.from(signature, 'base64'));\n  } catch {\n    return false;\n  }\n}\nexport async function promoteCandidate(\n  proposal: PromotionProposal,\n  authorization: PromotionAuthorization,\n  store: AtomicPromotionStore,\n  options: { now?: Date; trustedPublicKeys: ReadonlySet<string> },\n): Promise<PromotionRecord> {\n  const now = options.now ?? new Date();\n  if (!options.trustedPublicKeys.has(authorization.publicKey)) throw new Error('untrusted promotion signer');\n  if (!verifyPromotionAuthorization(proposal, authorization, now)) throw new Error('invalid promotion authorization');\n  if (proposal.receiptHash !== governanceHash(proposal.receipt)) throw new Error('evaluation receipt hash mismatch');\n  const result = await store.compareAndSwap(\n    proposal.receipt.baselineGeneration,\n    proposal.receipt.candidateHash,\n    proposal.receiptHash,\n  );\n  if (!result.promoted) throw new Error('promotion race: baseline generation changed');\n  return {\n    version: 1,\n    receiptHash: proposal.receiptHash,\n    candidateCommit: proposal.receipt.candidateCommit,\n    candidateHash: proposal.receipt.candidateHash,\n    previousGeneration: proposal.receipt.baselineGeneration,\n    generation: result.generation,\n    signer: authorization.signer,\n    promotedAt: now.toISOString(),\n  };\n}\nexport function verifyGovernanceReplay(\n  bundle: { proposal: PromotionProposal; authorization: PromotionAuthorization; promotion?: PromotionRecord },\n  options: { now?: Date; trustedPublicKeys: ReadonlySet<string> },\n): { valid: boolean; reasons: string[] } {\n  const reasons: string[] = [];\n  if (bundle.proposal.receiptHash !== governanceHash(bundle.proposal.receipt)) reasons.push('receipt hash mismatch');\n  if (!options.trustedPublicKeys.has(bundle.authorization.publicKey)) reasons.push('untrusted signer');\n  if (!verifyPromotionAuthorization(bundle.proposal, bundle.authorization, options.now)) reasons.push('invalid authorization');\n  if (bundle.promotion && (bundle.promotion.receiptHash !== bundle.proposal.receiptHash ||\n      bundle.promotion.candidateHash !== bundle.proposal.receipt.candidateHash)) {\n    reasons.push('promotion lineage mismatch');\n  }\n  return { valid: reasons.length === 0, reasons };\n}\n"]}

package/dist/harness/metaharness.d.ts

@@ -0,0 +1,6 @@
+/**
+ * The single lazy integration boundary for ruvector's pinned MetaHarness stack.
+ * Ordinary agentic-flow imports do not initialize research infrastructure.
+ */
+export { METAHARNESS_VERSIONS, assertMetaHarnessSafePayload, evaluateMetaHarnessPromotion, getMetaHarnessCapabilities, runMetaHarnessDarwin, runMetaHarnessFlywheel, scanMetaHarnessRewardHacks, verifyMetaHarnessReplay, } from 'ruvector';
+//# sourceMappingURL=metaharness.d.ts.map

package/dist/harness/metaharness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metaharness.d.ts","sourceRoot":"","sources":["../../src/harness/metaharness.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EACL,oBAAoB,EACpB,4BAA4B,EAC5B,4BAA4B,EAC5B,0BAA0B,EAC1B,oBAAoB,EACpB,sBAAsB,EACtB,0BAA0B,EAC1B,uBAAuB,GACxB,MAAM,UAAU,CAAC"}

package/dist/harness/metaharness.js

@@ -0,0 +1,6 @@
+/**
+ * The single lazy integration boundary for ruvector's pinned MetaHarness stack.
+ * Ordinary agentic-flow imports do not initialize research infrastructure.
+ */
+export { METAHARNESS_VERSIONS, assertMetaHarnessSafePayload, evaluateMetaHarnessPromotion, getMetaHarnessCapabilities, runMetaHarnessDarwin, runMetaHarnessFlywheel, scanMetaHarnessRewardHacks, verifyMetaHarnessReplay, } from 'ruvector';
+//# sourceMappingURL=metaharness.js.map

package/dist/harness/metaharness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metaharness.js","sourceRoot":"","sources":["../../src/harness/metaharness.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EACL,oBAAoB,EACpB,4BAA4B,EAC5B,4BAA4B,EAC5B,0BAA0B,EAC1B,oBAAoB,EACpB,sBAAsB,EACtB,0BAA0B,EAC1B,uBAAuB,GACxB,MAAM,UAAU,CAAC","sourcesContent":["/**\n * The single lazy integration boundary for ruvector's pinned MetaHarness stack.\n * Ordinary agentic-flow imports do not initialize research infrastructure.\n */\nexport {\n  METAHARNESS_VERSIONS,\n  assertMetaHarnessSafePayload,\n  evaluateMetaHarnessPromotion,\n  getMetaHarnessCapabilities,\n  runMetaHarnessDarwin,\n  runMetaHarnessFlywheel,\n  scanMetaHarnessRewardHacks,\n  verifyMetaHarnessReplay,\n} from 'ruvector';\n"]}

package/dist/harness/provenance.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Harness provenance — Ed25519 witness manifest over harness/agent config files
+ * (ADR-075, Track B).
+ *
+ * Produces a tamper-evident manifest (sha256 per file) and signs it with Ed25519
+ * (Node's built-in `crypto` — no external deps), complementing the CWE-78
+ * hardening: a signed manifest lets a consumer verify that the agent/skill/policy
+ * files a harness ships are exactly the ones that were reviewed.
+ *
+ * Deterministic by construction (no wall-clock inside): the caller supplies any
+ * timestamp, and entries are sorted, so signing the same files yields the same
+ * payload.
+ *
+ * @see docs/adr/ADR-075-metaharness-harness-evolution-and-provenance.md
+ */
+export interface ManifestEntry {
+    /** File path as supplied (used as the stable sort/identity key). */
+    path: string;
+    /** Lowercase hex sha256 of the file contents. */
+    sha256: string;
+}
+export interface HarnessManifest {
+    version: 1;
+    /** Optional caller-supplied timestamp (ISO string). Part of the signed payload. */
+    createdAt?: string;
+    /** File digests, sorted by path for a canonical, reproducible payload. */
+    entries: ManifestEntry[];
+}
+export interface KeyPairPem {
+    publicKey: string;
+    privateKey: string;
+}
+/** Generate an Ed25519 keypair as PEM strings (spki/pkcs8). */
+export declare function generateKeyPairPem(): KeyPairPem;
+/** sha256 (hex) of a buffer. */
+export declare function sha256Hex(data: Buffer | string): string;
+/**
+ * Build a canonical manifest over the given files. Entries are sorted by path so
+ * the signed payload is stable regardless of input order. `createdAt` is included
+ * verbatim if provided.
+ */
+export declare function buildManifest(files: string[], opts?: {
+    createdAt?: string;
+}): HarnessManifest;
+/** Sign a manifest with an Ed25519 private-key PEM. Returns a base64 signature. */
+export declare function signManifest(manifest: HarnessManifest, privateKeyPem: string): string;
+/** Verify a base64 Ed25519 signature over a manifest with a public-key PEM. */
+export declare function verifyManifest(manifest: HarnessManifest, signatureBase64: string, publicKeyPem: string): boolean;
+export interface SignedManifest {
+    manifest: HarnessManifest;
+    signature: string;
+    publicKey: string;
+}
+/** Convenience: build + sign in one step, returning a portable signed bundle. */
+export declare function signFiles(files: string[], privateKeyPem: string, publicKeyPem: string, opts?: {
+    createdAt?: string;
+}): SignedManifest;
+/**
+ * Verify a signed bundle AND that the on-disk files still match the manifest
+ * digests. Returns a per-file drift report so a caller can see exactly what
+ * changed since signing.
+ */
+export declare function verifySignedManifest(signed: SignedManifest): {
+    signatureValid: boolean;
+    filesIntact: boolean;
+    drift: {
+        path: string;
+        expected: string;
+        actual: string | null;
+    }[];
+};
+//# sourceMappingURL=provenance.d.ts.map

package/dist/harness/provenance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"provenance.d.ts","sourceRoot":"","sources":["../../src/harness/provenance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,MAAM,WAAW,aAAa;IAC5B,oEAAoE;IACpE,IAAI,EAAE,MAAM,CAAC;IACb,iDAAiD;IACjD,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,CAAC,CAAC;IACX,mFAAmF;IACnF,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0EAA0E;IAC1E,OAAO,EAAE,aAAa,EAAE,CAAC;CAC1B;AAED,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,+DAA+D;AAC/D,wBAAgB,kBAAkB,IAAI,UAAU,CAM/C;AAED,gCAAgC;AAChC,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAEvD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,eAAe,CAKjG;AAYD,mFAAmF;AACnF,wBAAgB,YAAY,CAAC,QAAQ,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,CAIrF;AAED,+EAA+E;AAC/E,wBAAgB,cAAc,CAAC,QAAQ,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAOhH;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,eAAe,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,iFAAiF;AACjF,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,cAAc,CAGzI;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG;IAC5D,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,EAAE,OAAO,CAAC;IACrB,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,EAAE,CAAC;CACpE,CAaA"}

package/dist/harness/provenance.js

@@ -0,0 +1,92 @@
+/**
+ * Harness provenance — Ed25519 witness manifest over harness/agent config files
+ * (ADR-075, Track B).
+ *
+ * Produces a tamper-evident manifest (sha256 per file) and signs it with Ed25519
+ * (Node's built-in `crypto` — no external deps), complementing the CWE-78
+ * hardening: a signed manifest lets a consumer verify that the agent/skill/policy
+ * files a harness ships are exactly the ones that were reviewed.
+ *
+ * Deterministic by construction (no wall-clock inside): the caller supplies any
+ * timestamp, and entries are sorted, so signing the same files yields the same
+ * payload.
+ *
+ * @see docs/adr/ADR-075-metaharness-harness-evolution-and-provenance.md
+ */
+import { generateKeyPairSync, sign as cryptoSign, verify as cryptoVerify, createHash } from 'node:crypto';
+import { readFileSync } from 'node:fs';
+/** Generate an Ed25519 keypair as PEM strings (spki/pkcs8). */
+export function generateKeyPairPem() {
+    const { publicKey, privateKey } = generateKeyPairSync('ed25519');
+    return {
+        publicKey: publicKey.export({ type: 'spki', format: 'pem' }).toString(),
+        privateKey: privateKey.export({ type: 'pkcs8', format: 'pem' }).toString(),
+    };
+}
+/** sha256 (hex) of a buffer. */
+export function sha256Hex(data) {
+    return createHash('sha256').update(data).digest('hex');
+}
+/**
+ * Build a canonical manifest over the given files. Entries are sorted by path so
+ * the signed payload is stable regardless of input order. `createdAt` is included
+ * verbatim if provided.
+ */
+export function buildManifest(files, opts = {}) {
+    const entries = files
+        .map((path) => ({ path, sha256: sha256Hex(readFileSync(path)) }))
+        .sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : 0));
+    return { version: 1, ...(opts.createdAt ? { createdAt: opts.createdAt } : {}), entries };
+}
+/** Canonical bytes that get signed/verified — stable JSON of the manifest. */
+function canonicalPayload(manifest) {
+    // Keys emitted in a fixed order; entries already sorted by buildManifest.
+    return JSON.stringify({
+        version: manifest.version,
+        createdAt: manifest.createdAt ?? null,
+        entries: manifest.entries.map((e) => ({ path: e.path, sha256: e.sha256 })),
+    });
+}
+/** Sign a manifest with an Ed25519 private-key PEM. Returns a base64 signature. */
+export function signManifest(manifest, privateKeyPem) {
+    const payload = Buffer.from(canonicalPayload(manifest), 'utf8');
+    // Ed25519 takes a null algorithm (the curve fixes the hash).
+    return cryptoSign(null, payload, privateKeyPem).toString('base64');
+}
+/** Verify a base64 Ed25519 signature over a manifest with a public-key PEM. */
+export function verifyManifest(manifest, signatureBase64, publicKeyPem) {
+    try {
+        const payload = Buffer.from(canonicalPayload(manifest), 'utf8');
+        return cryptoVerify(null, payload, publicKeyPem, Buffer.from(signatureBase64, 'base64'));
+    }
+    catch {
+        return false; // malformed signature/key → not verified
+    }
+}
+/** Convenience: build + sign in one step, returning a portable signed bundle. */
+export function signFiles(files, privateKeyPem, publicKeyPem, opts = {}) {
+    const manifest = buildManifest(files, opts);
+    return { manifest, signature: signManifest(manifest, privateKeyPem), publicKey: publicKeyPem };
+}
+/**
+ * Verify a signed bundle AND that the on-disk files still match the manifest
+ * digests. Returns a per-file drift report so a caller can see exactly what
+ * changed since signing.
+ */
+export function verifySignedManifest(signed) {
+    const signatureValid = verifyManifest(signed.manifest, signed.signature, signed.publicKey);
+    const drift = [];
+    for (const entry of signed.manifest.entries) {
+        let actual = null;
+        try {
+            actual = sha256Hex(readFileSync(entry.path));
+        }
+        catch {
+            actual = null; // missing/unreadable
+        }
+        if (actual !== entry.sha256)
+            drift.push({ path: entry.path, expected: entry.sha256, actual });
+    }
+    return { signatureValid, filesIntact: drift.length === 0, drift };
+}
+//# sourceMappingURL=provenance.js.map

package/dist/harness/provenance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"provenance.js","sourceRoot":"","sources":["../../src/harness/provenance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,mBAAmB,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,IAAI,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC1G,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAsBvC,+DAA+D;AAC/D,MAAM,UAAU,kBAAkB;IAChC,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;IACjE,OAAO;QACL,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,QAAQ,EAAE;QACvE,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,QAAQ,EAAE;KAC3E,CAAC;AACJ,CAAC;AAED,gCAAgC;AAChC,MAAM,UAAU,SAAS,CAAC,IAAqB;IAC7C,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAe,EAAE,OAA+B,EAAE;IAC9E,MAAM,OAAO,GAAoB,KAAK;SACnC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;SAChE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;AAC3F,CAAC;AAED,8EAA8E;AAC9E,SAAS,gBAAgB,CAAC,QAAyB;IACjD,0EAA0E;IAC1E,OAAO,IAAI,CAAC,SAAS,CAAC;QACpB,OAAO,EAAE,QAAQ,CAAC,OAAO;QACzB,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,IAAI;QACrC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;KAC3E,CAAC,CAAC;AACL,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,YAAY,CAAC,QAAyB,EAAE,aAAqB;IAC3E,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;IAChE,6DAA6D;IAC7D,OAAO,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;AACrE,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,cAAc,CAAC,QAAyB,EAAE,eAAuB,EAAE,YAAoB;IACrG,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;QAChE,OAAO,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC3F,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC,CAAC,yCAAyC;IACzD,CAAC;AACH,CAAC;AAQD,iFAAiF;AACjF,MAAM,UAAU,SAAS,CAAC,KAAe,EAAE,aAAqB,EAAE,YAAoB,EAAE,OAA+B,EAAE;IACvH,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,CAAC,QAAQ,EAAE,aAAa,CAAC,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC;AACjG,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAsB;IAKzD,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3F,MAAM,KAAK,GAAgE,EAAE,CAAC;IAC9E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC5C,IAAI,MAAM,GAAkB,IAAI,CAAC;QACjC,IAAI,CAAC;YACH,MAAM,GAAG,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,IAAI,CAAC,CAAC,qBAAqB;QACtC,CAAC;QACD,IAAI,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAChG,CAAC;IACD,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;AACpE,CAAC","sourcesContent":["/**\n * Harness provenance — Ed25519 witness manifest over harness/agent config files\n * (ADR-075, Track B).\n *\n * Produces a tamper-evident manifest (sha256 per file) and signs it with Ed25519\n * (Node's built-in `crypto` — no external deps), complementing the CWE-78\n * hardening: a signed manifest lets a consumer verify that the agent/skill/policy\n * files a harness ships are exactly the ones that were reviewed.\n *\n * Deterministic by construction (no wall-clock inside): the caller supplies any\n * timestamp, and entries are sorted, so signing the same files yields the same\n * payload.\n *\n * @see docs/adr/ADR-075-metaharness-harness-evolution-and-provenance.md\n */\n\nimport { generateKeyPairSync, sign as cryptoSign, verify as cryptoVerify, createHash } from 'node:crypto';\nimport { readFileSync } from 'node:fs';\n\nexport interface ManifestEntry {\n  /** File path as supplied (used as the stable sort/identity key). */\n  path: string;\n  /** Lowercase hex sha256 of the file contents. */\n  sha256: string;\n}\n\nexport interface HarnessManifest {\n  version: 1;\n  /** Optional caller-supplied timestamp (ISO string). Part of the signed payload. */\n  createdAt?: string;\n  /** File digests, sorted by path for a canonical, reproducible payload. */\n  entries: ManifestEntry[];\n}\n\nexport interface KeyPairPem {\n  publicKey: string;\n  privateKey: string;\n}\n\n/** Generate an Ed25519 keypair as PEM strings (spki/pkcs8). */\nexport function generateKeyPairPem(): KeyPairPem {\n  const { publicKey, privateKey } = generateKeyPairSync('ed25519');\n  return {\n    publicKey: publicKey.export({ type: 'spki', format: 'pem' }).toString(),\n    privateKey: privateKey.export({ type: 'pkcs8', format: 'pem' }).toString(),\n  };\n}\n\n/** sha256 (hex) of a buffer. */\nexport function sha256Hex(data: Buffer | string): string {\n  return createHash('sha256').update(data).digest('hex');\n}\n\n/**\n * Build a canonical manifest over the given files. Entries are sorted by path so\n * the signed payload is stable regardless of input order. `createdAt` is included\n * verbatim if provided.\n */\nexport function buildManifest(files: string[], opts: { createdAt?: string } = {}): HarnessManifest {\n  const entries: ManifestEntry[] = files\n    .map((path) => ({ path, sha256: sha256Hex(readFileSync(path)) }))\n    .sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : 0));\n  return { version: 1, ...(opts.createdAt ? { createdAt: opts.createdAt } : {}), entries };\n}\n\n/** Canonical bytes that get signed/verified — stable JSON of the manifest. */\nfunction canonicalPayload(manifest: HarnessManifest): string {\n  // Keys emitted in a fixed order; entries already sorted by buildManifest.\n  return JSON.stringify({\n    version: manifest.version,\n    createdAt: manifest.createdAt ?? null,\n    entries: manifest.entries.map((e) => ({ path: e.path, sha256: e.sha256 })),\n  });\n}\n\n/** Sign a manifest with an Ed25519 private-key PEM. Returns a base64 signature. */\nexport function signManifest(manifest: HarnessManifest, privateKeyPem: string): string {\n  const payload = Buffer.from(canonicalPayload(manifest), 'utf8');\n  // Ed25519 takes a null algorithm (the curve fixes the hash).\n  return cryptoSign(null, payload, privateKeyPem).toString('base64');\n}\n\n/** Verify a base64 Ed25519 signature over a manifest with a public-key PEM. */\nexport function verifyManifest(manifest: HarnessManifest, signatureBase64: string, publicKeyPem: string): boolean {\n  try {\n    const payload = Buffer.from(canonicalPayload(manifest), 'utf8');\n    return cryptoVerify(null, payload, publicKeyPem, Buffer.from(signatureBase64, 'base64'));\n  } catch {\n    return false; // malformed signature/key → not verified\n  }\n}\n\nexport interface SignedManifest {\n  manifest: HarnessManifest;\n  signature: string; // base64\n  publicKey: string; // spki PEM (the verification anchor)\n}\n\n/** Convenience: build + sign in one step, returning a portable signed bundle. */\nexport function signFiles(files: string[], privateKeyPem: string, publicKeyPem: string, opts: { createdAt?: string } = {}): SignedManifest {\n  const manifest = buildManifest(files, opts);\n  return { manifest, signature: signManifest(manifest, privateKeyPem), publicKey: publicKeyPem };\n}\n\n/**\n * Verify a signed bundle AND that the on-disk files still match the manifest\n * digests. Returns a per-file drift report so a caller can see exactly what\n * changed since signing.\n */\nexport function verifySignedManifest(signed: SignedManifest): {\n  signatureValid: boolean;\n  filesIntact: boolean;\n  drift: { path: string; expected: string; actual: string | null }[];\n} {\n  const signatureValid = verifyManifest(signed.manifest, signed.signature, signed.publicKey);\n  const drift: { path: string; expected: string; actual: string | null }[] = [];\n  for (const entry of signed.manifest.entries) {\n    let actual: string | null = null;\n    try {\n      actual = sha256Hex(readFileSync(entry.path));\n    } catch {\n      actual = null; // missing/unreadable\n    }\n    if (actual !== entry.sha256) drift.push({ path: entry.path, expected: entry.sha256, actual });\n  }\n  return { signatureValid, filesIntact: drift.length === 0, drift };\n}\n"]}

package/dist/hooks/swarm-learning-optimizer.js

@@ -92,12 +92,12 @@ export class SwarmLearningOptimizer {
      * Get optimization recommendations based on learned patterns
      */
     async getOptimization(taskDescription, taskComplexity, estimatedAgentCount) {
-        // Search for similar successful patterns
-        const similarPatterns = await this.reasoningBank.searchPatterns(taskDescription, {
+        // Search for similar successful patterns - use search method with any cast for compatibility
+        const similarPatterns = await this.reasoningBank.searchPatterns?.(taskDescription, {
             k: 10,
             minReward: 0.7,
             onlySuccesses: true
-        });
+        }) ?? [];
         if (similarPatterns.length === 0) {
             // No learned patterns - return default recommendations
             return this.getDefaultRecommendation(taskComplexity, estimatedAgentCount);
@@ -281,10 +281,10 @@ export class SwarmLearningOptimizer {
      * Generate statistics report on learned patterns
      */
     async getOptimizationStats() {
-        const allPatterns = await this.reasoningBank.searchPatterns(this.NAMESPACE, {
+        const allPatterns = await this.reasoningBank.searchPatterns?.(this.NAMESPACE, {
             k: 1000,
             onlySuccesses: true
-        });
+        }) ?? [];
         const stats = {
             totalPatterns: allPatterns.length,
             topologiesUsed: {},

package/dist/hooks/swarm-learning-optimizer.js.map

@@ -1 +1 @@
-{"version":3,"file":"swarm-learning-optimizer.js","sourceRoot":"","sources":["../../src/hooks/swarm-learning-optimizer.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAsCH,MAAM,OAAO,sBAAsB;IACzB,aAAa,CAAgB;IACpB,SAAS,GAAG,oBAAoB,CAAC;IAElD,YAAY,aAA4B;QACtC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,qBAAqB,CACzB,eAAuB,EACvB,OAAqB,EACrB,OAAgB;QAEhB,MAAM,SAAS,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAExE,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC;YACpC,SAAS;YACT,IAAI,EAAE,eAAe;YACrB,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,cAAc,EAAE,OAAO,CAAC,cAAc,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC;YACjG,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YAC/B,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC;YAC9C,OAAO;YACP,SAAS,EAAE,OAAO,CAAC,WAAW;YAC9B,UAAU,EAAE,CAAC,EAAE,oCAAoC;YACnD,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC;SAClD,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,OAAqB,EAAE,OAAgB;QAC7D,IAAI,CAAC,OAAO;YAAE,OAAO,GAAG,CAAC;QAEzB,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,0BAA0B;QAE5C,sCAAsC;QACtC,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;aAAM,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,4BAA4B;QAC5B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;iBAAM,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAClC,MAAM,IAAI,IAAI,CAAC;YACjB,CAAC;iBAAM,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QACvE,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,OAAqB,EAAE,OAAgB;QAC9D,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;QACxE,CAAC;QAED,IAAI,OAAO,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;YAC7B,SAAS,CAAC,IAAI,CAAC,qBAAqB,OAAO,CAAC,WAAW,+BAA+B,CAAC,CAAC;QAC1F,CAAC;QAED,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAC7C,SAAS,CAAC,IAAI,CAAC,oBAAoB,OAAO,CAAC,OAAO,oDAAoD,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QACnF,CAAC;QAED,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC;YAC3D,SAAS,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;QAChG,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC9C,OAAO,sDAAsD,CAAC;YAChE,CAAC;YACD,OAAO,2CAA2C,CAAC;QACrD,CAAC;QAED,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,eAAuB,EACvB,cAAsD,EACtD,mBAA2B;QAE3B,yCAAyC;QACzC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,eAAe,EAAE;YAC/E,CAAC,EAAE,EAAE;YACL,SAAS,EAAE,GAAG;YACd,aAAa,EAAE,IAAI;SACpB,CAAC,CAAC;QAEH,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,uDAAuD;YACvD,OAAO,IAAI,CAAC,wBAAwB,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAC;QAC5E,CAAC;QAED,iDAAiD;QACjD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAsE,CAAC;QAErG,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;gBAElC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAClC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC5E,CAAC;gBAED,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBAC5C,KAAK,CAAC,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC;gBACpC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACjB,KAAK,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,CAAC;YAC7C,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,4BAA4B;gBAC5B,SAAS;YACX,CAAC;QACH,CAAC;QAED,yDAAyD;QACzD,IAAI,YAAY,GAAG,cAAc,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,GAAG,CAAC;QACtB,MAAM,YAAY,GAAuE,EAAE,CAAC;QAE5F,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB;YAE3E,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAClB,oCAAoC;oBACpC,YAAY,CAAC,IAAI,CAAC;wBAChB,QAAQ,EAAE,YAAY;wBACtB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;wBAC7C,SAAS,EAAE,oBAAoB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,cAAc,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,KAAK,aAAa;qBACpH,CAAC,CAAC;gBACL,CAAC;gBACD,SAAS,GAAG,KAAK,CAAC;gBAClB,YAAY,GAAG,QAAQ,CAAC;gBACxB,WAAW,GAAG,UAAU,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC;oBAChB,QAAQ;oBACR,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;oBACzC,SAAS,EAAE,oBAAoB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,KAAK,aAAa;iBACtF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,mBAAmB,EAAE,eAAe,CAAC,CAAC;QAE9G,OAAO;YACL,mBAAmB,EAAE,YAAmB;YACxC,oBAAoB,EAAE,gBAAgB;YACtC,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;YAChG,eAAe,EAAE,WAAW;YAC5B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;YAC7C,SAAS,EAAE,YAAY,eAAe,CAAC,MAAM,kCAAkC;gBACrE,GAAG,YAAY,sBAAsB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB;YACzF,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACnF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,cAAsD,EACtD,mBAA2B;QAE3B,iEAAiE;QACjE,IAAI,QAAmD,CAAC;QACxD,IAAI,eAAuB,CAAC;QAC5B,IAAI,SAAiB,CAAC;QAEtB,IAAI,mBAAmB,IAAI,CAAC,EAAE,CAAC;YAC7B,QAAQ,GAAG,MAAM,CAAC;YAClB,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,qFAAqF,CAAC;QACpG,CAAC;aAAM,IAAI,mBAAmB,IAAI,EAAE,EAAE,CAAC;YACrC,QAAQ,GAAG,cAAc,CAAC;YAC1B,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,sFAAsF,CAAC;QACrG,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,cAAc,CAAC;YAC1B,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,mGAAmG,CAAC;QAClH,CAAC;QAED,6BAA6B;QAC7B,IAAI,cAAc,KAAK,UAAU,IAAI,cAAc,KAAK,MAAM,EAAE,CAAC;YAC/D,eAAe,IAAI,GAAG,CAAC,CAAC,uDAAuD;QACjF,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,mBAAmB,EAAE,EAAE,CAAC,CAAC;QAE1F,OAAO;YACL,mBAAmB,EAAE,QAAQ;YAC7B,oBAAoB,EAAE,SAAS;YAC/B,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAC5F,eAAe;YACf,UAAU,EAAE,GAAG,EAAE,4CAA4C;YAC7D,SAAS,EAAE,GAAG,SAAS,qDAAqD;YAC5E,YAAY,EAAE;gBACZ;oBACE,QAAQ,EAAE,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM;oBACvD,UAAU,EAAE,GAAG;oBACf,SAAS,EAAE,uDAAuD;iBACnE;aACF;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,cAAsD,EACtD,mBAA2B,EAC3B,eAAsB;QAEtB,kDAAkD;QAClD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,eAAe;iBAC/B,GAAG,CAAC,CAAC,CAAC,EAAE;gBACP,IAAI,CAAC;oBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACnD,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC5D,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC,CAAC;iBACD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAiD,CAAC;YAE3E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,8CAA8C;gBAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkD,CAAC;gBAC3E,KAAK,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC7B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;oBACxD,CAAC;oBACD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;oBACvC,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC;oBAC5B,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAED,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;oBACrE,MAAM,SAAS,GAAG,WAAW,GAAG,KAAK,CAAC;oBACtC,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;wBAC9B,aAAa,GAAG,SAAS,CAAC;wBAC1B,aAAa,GAAG,SAAS,CAAC;oBAC5B,CAAC;gBACH,CAAC;gBAED,OAAO,aAAa,CAAC;YACvB,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,QAAgB;QAC9C,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,0CAA0C;YACvD,KAAK,cAAc;gBACjB,OAAO,EAAE,CAAC,CAAC,8BAA8B;YAC3C,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,wCAAwC;YACrD,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,iCAAiC;YAC9C;gBACE,OAAO,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB;QAOxB,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE;YAC1E,CAAC,EAAE,IAAI;YACP,aAAa,EAAE,IAAI;SACpB,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG;YACZ,aAAa,EAAE,WAAW,CAAC,MAAM;YACjC,cAAc,EAAE,EAA4B;YAC5C,iBAAiB,EAAE,EAA8B;YACjD,YAAY,EAAE,EAAc;YAC5B,oBAAoB,EAAE,EAA4B;YAClD,cAAc,EAAE,CAAC;YACjB,sBAAsB,EAAE,cAAc;SACvC,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAEzD,uBAAuB;gBACvB,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAE3F,gBAAgB;gBAChB,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC/C,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;gBACjD,CAAC;gBACD,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;oBACpB,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAClE,CAAC;gBAED,qBAAqB;gBACrB,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC/C,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;YAC3E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,oBAAoB,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/F,CAAC;QACH,CAAC;QAED,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAClD,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM;YAC3E,CAAC,CAAC,CAAC,CAAC;QAEN,gCAAgC;QAChC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC;YAChF,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC;gBAC7B,WAAW,GAAG,UAAU,CAAC;gBACzB,KAAK,CAAC,sBAAsB,GAAG,QAAQ,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,OAAO;YACL,aAAa,EAAE,KAAK,CAAC,aAAa;YAClC,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;YAChD,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,GAAG,EAAE,CAAC,GAAG,EAAE;YAC1D,sBAAsB,EAAE,KAAK,CAAC,sBAAsB;SACrD,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,aAA4B,EAC5B,eAAuB,EACvB,UAGI,EAAE;IAEN,MAAM,SAAS,GAAG,IAAI,sBAAsB,CAAC,aAAa,CAAC,CAAC;IAE5D,MAAM,UAAU,GAAG,OAAO,CAAC,cAAc,IAAI,QAAQ,CAAC;IACtD,MAAM,UAAU,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC;IAEpD,OAAO,MAAM,SAAS,CAAC,eAAe,CAAC,eAAe,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAClF,CAAC","sourcesContent":["/**\n * Swarm Learning Optimizer\n *\n * Enhances parallel execution with adaptive learning, pattern recognition,\n * and automated topology selection using ReasoningBank intelligence.\n */\n\nimport { ReasoningBank } from '../reasoningbank';\n\nexport interface SwarmMetrics {\n  topology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n  agentCount: number;\n  batchSize: number;\n  totalTimeMs: number;\n  successRate: number;\n  speedup?: number;\n  taskComplexity: 'low' | 'medium' | 'high' | 'critical';\n  operations: number;\n}\n\nexport interface LearningPattern {\n  taskType: string;\n  optimalTopology: string;\n  optimalBatchSize: number;\n  expectedSpeedup: number;\n  successRate: number;\n  timestamp: string;\n}\n\nexport interface OptimizationRecommendation {\n  recommendedTopology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n  recommendedBatchSize: number;\n  recommendedAgentCount: number;\n  expectedSpeedup: number;\n  confidence: number;\n  reasoning: string;\n  alternatives: Array<{\n    topology: string;\n    confidence: number;\n    reasoning: string;\n  }>;\n}\n\nexport class SwarmLearningOptimizer {\n  private reasoningBank: ReasoningBank;\n  private readonly NAMESPACE = 'swarm/optimization';\n\n  constructor(reasoningBank: ReasoningBank) {\n    this.reasoningBank = reasoningBank;\n  }\n\n  /**\n   * Store swarm execution metrics for learning\n   */\n  async storeExecutionPattern(\n    taskDescription: string,\n    metrics: SwarmMetrics,\n    success: boolean\n  ): Promise<void> {\n    const sessionId = `${this.NAMESPACE}/${metrics.topology}/${Date.now()}`;\n\n    await this.reasoningBank.storePattern({\n      sessionId,\n      task: taskDescription,\n      input: JSON.stringify({ taskComplexity: metrics.taskComplexity, agentCount: metrics.agentCount }),\n      output: JSON.stringify(metrics),\n      reward: this.calculateReward(metrics, success),\n      success,\n      latencyMs: metrics.totalTimeMs,\n      tokensUsed: 0, // Not tracking tokens for swarm ops\n      critique: this.generateCritique(metrics, success)\n    });\n  }\n\n  /**\n   * Calculate reward score for swarm execution (0-1)\n   */\n  private calculateReward(metrics: SwarmMetrics, success: boolean): number {\n    if (!success) return 0.0;\n\n    let reward = 0.5; // Base reward for success\n\n    // Reward for high success rate (+0.2)\n    if (metrics.successRate >= 90) {\n      reward += 0.2;\n    } else if (metrics.successRate >= 75) {\n      reward += 0.1;\n    }\n\n    // Reward for speedup (+0.2)\n    if (metrics.speedup) {\n      if (metrics.speedup >= 3.0) {\n        reward += 0.2;\n      } else if (metrics.speedup >= 2.0) {\n        reward += 0.15;\n      } else if (metrics.speedup >= 1.5) {\n        reward += 0.1;\n      }\n    }\n\n    // Reward for efficiency (operations/time) (+0.1)\n    const opsPerSecond = (metrics.operations / metrics.totalTimeMs) * 1000;\n    if (opsPerSecond > 0.1) {\n      reward += 0.1;\n    }\n\n    return Math.min(1.0, reward);\n  }\n\n  /**\n   * Generate critique for learning\n   */\n  private generateCritique(metrics: SwarmMetrics, success: boolean): string {\n    const critiques: string[] = [];\n\n    if (!success) {\n      critiques.push('Swarm execution failed - investigate error handling');\n    }\n\n    if (metrics.successRate < 80) {\n      critiques.push(`Low success rate (${metrics.successRate}%) - review agent reliability`);\n    }\n\n    if (metrics.speedup && metrics.speedup < 1.2) {\n      critiques.push(`Minimal speedup (${metrics.speedup}x) - consider different topology or larger batches`);\n    }\n\n    if (metrics.batchSize < 3) {\n      critiques.push('Small batch size - may not fully utilize parallel capabilities');\n    }\n\n    if (metrics.topology === 'mesh' && metrics.agentCount > 10) {\n      critiques.push('Mesh topology with many agents (O(n²) coordination) - consider hierarchical');\n    }\n\n    if (critiques.length === 0) {\n      if (metrics.speedup && metrics.speedup >= 3.0) {\n        return 'Excellent parallel execution - pattern worth reusing';\n      }\n      return 'Good swarm execution - successful pattern';\n    }\n\n    return critiques.join('. ');\n  }\n\n  /**\n   * Get optimization recommendations based on learned patterns\n   */\n  async getOptimization(\n    taskDescription: string,\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number\n  ): Promise<OptimizationRecommendation> {\n    // Search for similar successful patterns\n    const similarPatterns = await this.reasoningBank.searchPatterns(taskDescription, {\n      k: 10,\n      minReward: 0.7,\n      onlySuccesses: true\n    });\n\n    if (similarPatterns.length === 0) {\n      // No learned patterns - return default recommendations\n      return this.getDefaultRecommendation(taskComplexity, estimatedAgentCount);\n    }\n\n    // Analyze patterns to find optimal configuration\n    const topologyScores = new Map<string, { totalReward: number; count: number; avgSpeedup: number }>();\n\n    for (const pattern of similarPatterns) {\n      try {\n        const metrics: SwarmMetrics = JSON.parse(pattern.output);\n        const topology = metrics.topology;\n\n        if (!topologyScores.has(topology)) {\n          topologyScores.set(topology, { totalReward: 0, count: 0, avgSpeedup: 0 });\n        }\n\n        const score = topologyScores.get(topology)!;\n        score.totalReward += pattern.reward;\n        score.count += 1;\n        score.avgSpeedup += metrics.speedup || 1.0;\n      } catch (e) {\n        // Skip invalid pattern data\n        continue;\n      }\n    }\n\n    // Find best topology based on average reward and speedup\n    let bestTopology = 'hierarchical';\n    let bestScore = 0;\n    let bestSpeedup = 1.0;\n    const alternatives: Array<{ topology: string; confidence: number; reasoning: string }> = [];\n\n    for (const [topology, data] of topologyScores.entries()) {\n      const avgReward = data.totalReward / data.count;\n      const avgSpeedup = data.avgSpeedup / data.count;\n      const score = avgReward * 0.6 + (avgSpeedup / 5.0) * 0.4; // Weighted score\n\n      if (score > bestScore) {\n        if (bestScore > 0) {\n          // Previous best becomes alternative\n          alternatives.push({\n            topology: bestTopology,\n            confidence: Math.round(bestScore * 100) / 100,\n            reasoning: `Average speedup: ${bestSpeedup.toFixed(2)}x from ${topologyScores.get(bestTopology)!.count} executions`\n          });\n        }\n        bestScore = score;\n        bestTopology = topology;\n        bestSpeedup = avgSpeedup;\n      } else {\n        alternatives.push({\n          topology,\n          confidence: Math.round(score * 100) / 100,\n          reasoning: `Average speedup: ${avgSpeedup.toFixed(2)}x from ${data.count} executions`\n        });\n      }\n    }\n\n    // Determine optimal batch size based on task complexity and learned patterns\n    const optimalBatchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, similarPatterns);\n\n    return {\n      recommendedTopology: bestTopology as any,\n      recommendedBatchSize: optimalBatchSize,\n      recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(bestTopology)),\n      expectedSpeedup: bestSpeedup,\n      confidence: Math.round(bestScore * 100) / 100,\n      reasoning: `Based on ${similarPatterns.length} similar successful executions. ` +\n                `${bestTopology} topology achieved ${bestSpeedup.toFixed(2)}x average speedup.`,\n      alternatives: alternatives.sort((a, b) => b.confidence - a.confidence).slice(0, 2)\n    };\n  }\n\n  /**\n   * Get default recommendations when no learned patterns exist\n   */\n  private getDefaultRecommendation(\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number\n  ): OptimizationRecommendation {\n    // Default topology selection based on agent count and complexity\n    let topology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n    let expectedSpeedup: number;\n    let reasoning: string;\n\n    if (estimatedAgentCount <= 5) {\n      topology = 'mesh';\n      expectedSpeedup = 2.5;\n      reasoning = 'Mesh topology optimal for small swarms (≤5 agents) - full peer-to-peer coordination';\n    } else if (estimatedAgentCount <= 10) {\n      topology = 'hierarchical';\n      expectedSpeedup = 3.5;\n      reasoning = 'Hierarchical topology optimal for medium swarms (6-10 agents) - efficient delegation';\n    } else {\n      topology = 'hierarchical';\n      expectedSpeedup = 4.0;\n      reasoning = 'Hierarchical topology required for large swarms (>10 agents) - avoids O(n²) coordination overhead';\n    }\n\n    // Adjust for task complexity\n    if (taskComplexity === 'critical' || taskComplexity === 'high') {\n      expectedSpeedup *= 1.2; // Higher complexity benefits more from parallelization\n    }\n\n    const batchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, []);\n\n    return {\n      recommendedTopology: topology,\n      recommendedBatchSize: batchSize,\n      recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(topology)),\n      expectedSpeedup,\n      confidence: 0.6, // Lower confidence without learned patterns\n      reasoning: `${reasoning} (default recommendation - no learned patterns yet)`,\n      alternatives: [\n        {\n          topology: topology === 'mesh' ? 'hierarchical' : 'mesh',\n          confidence: 0.5,\n          reasoning: 'Alternative topology if default does not perform well'\n        }\n      ]\n    };\n  }\n\n  /**\n   * Determine optimal batch size based on complexity and learned patterns\n   */\n  private determineOptimalBatchSize(\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number,\n    learnedPatterns: any[]\n  ): number {\n    // Analyze learned patterns for optimal batch size\n    if (learnedPatterns.length > 0) {\n      const batchSizes = learnedPatterns\n        .map(p => {\n          try {\n            const metrics: SwarmMetrics = JSON.parse(p.output);\n            return { batchSize: metrics.batchSize, reward: p.reward };\n          } catch (e) {\n            return null;\n          }\n        })\n        .filter(x => x !== null) as Array<{ batchSize: number; reward: number }>;\n\n      if (batchSizes.length > 0) {\n        // Find batch size with highest average reward\n        const batchMap = new Map<number, { totalReward: number; count: number }>();\n        for (const { batchSize, reward } of batchSizes) {\n          if (!batchMap.has(batchSize)) {\n            batchMap.set(batchSize, { totalReward: 0, count: 0 });\n          }\n          const entry = batchMap.get(batchSize)!;\n          entry.totalReward += reward;\n          entry.count += 1;\n        }\n\n        let bestBatchSize = 3;\n        let bestAvgReward = 0;\n        for (const [batchSize, { totalReward, count }] of batchMap.entries()) {\n          const avgReward = totalReward / count;\n          if (avgReward > bestAvgReward) {\n            bestAvgReward = avgReward;\n            bestBatchSize = batchSize;\n          }\n        }\n\n        return bestBatchSize;\n      }\n    }\n\n    // Default batch size based on complexity\n    switch (taskComplexity) {\n      case 'low':\n        return Math.min(3, estimatedAgentCount);\n      case 'medium':\n        return Math.min(5, estimatedAgentCount);\n      case 'high':\n        return Math.min(7, estimatedAgentCount);\n      case 'critical':\n        return Math.min(10, estimatedAgentCount);\n    }\n  }\n\n  /**\n   * Get maximum agents for topology (to avoid coordination overhead)\n   */\n  private getMaxAgentsForTopology(topology: string): number {\n    switch (topology) {\n      case 'mesh':\n        return 10; // O(n²) coordination overhead beyond this\n      case 'hierarchical':\n        return 50; // Scales well with delegation\n      case 'ring':\n        return 20; // Sequential token passing limits scale\n      case 'star':\n        return 30; // Central coordinator bottleneck\n      default:\n        return 10;\n    }\n  }\n\n  /**\n   * Generate statistics report on learned patterns\n   */\n  async getOptimizationStats(): Promise<{\n    totalPatterns: number;\n    topologiesUsed: Record<string, number>;\n    avgSpeedupByTopology: Record<string, number>;\n    avgSuccessRate: number;\n    bestPerformingTopology: string;\n  }> {\n    const allPatterns = await this.reasoningBank.searchPatterns(this.NAMESPACE, {\n      k: 1000,\n      onlySuccesses: true\n    });\n\n    const stats = {\n      totalPatterns: allPatterns.length,\n      topologiesUsed: {} as Record<string, number>,\n      speedupByTopology: {} as Record<string, number[]>,\n      successRates: [] as number[],\n      avgSpeedupByTopology: {} as Record<string, number>,\n      avgSuccessRate: 0,\n      bestPerformingTopology: 'hierarchical'\n    };\n\n    for (const pattern of allPatterns) {\n      try {\n        const metrics: SwarmMetrics = JSON.parse(pattern.output);\n\n        // Count topology usage\n        stats.topologiesUsed[metrics.topology] = (stats.topologiesUsed[metrics.topology] || 0) + 1;\n\n        // Track speedup\n        if (!stats.speedupByTopology[metrics.topology]) {\n          stats.speedupByTopology[metrics.topology] = [];\n        }\n        if (metrics.speedup) {\n          stats.speedupByTopology[metrics.topology].push(metrics.speedup);\n        }\n\n        // Track success rate\n        stats.successRates.push(metrics.successRate);\n      } catch (e) {\n        continue;\n      }\n    }\n\n    // Calculate averages\n    for (const [topology, speedups] of Object.entries(stats.speedupByTopology)) {\n      if (speedups.length > 0) {\n        stats.avgSpeedupByTopology[topology] = speedups.reduce((a, b) => a + b, 0) / speedups.length;\n      }\n    }\n\n    stats.avgSuccessRate = stats.successRates.length > 0\n      ? stats.successRates.reduce((a, b) => a + b, 0) / stats.successRates.length\n      : 0;\n\n    // Find best performing topology\n    let bestSpeedup = 0;\n    for (const [topology, avgSpeedup] of Object.entries(stats.avgSpeedupByTopology)) {\n      if (avgSpeedup > bestSpeedup) {\n        bestSpeedup = avgSpeedup;\n        stats.bestPerformingTopology = topology;\n      }\n    }\n\n    return {\n      totalPatterns: stats.totalPatterns,\n      topologiesUsed: stats.topologiesUsed,\n      avgSpeedupByTopology: stats.avgSpeedupByTopology,\n      avgSuccessRate: Math.round(stats.avgSuccessRate * 10) / 10,\n      bestPerformingTopology: stats.bestPerformingTopology\n    };\n  }\n}\n\n/**\n * Auto-select optimal swarm configuration\n */\nexport async function autoSelectSwarmConfig(\n  reasoningBank: ReasoningBank,\n  taskDescription: string,\n  options: {\n    taskComplexity?: 'low' | 'medium' | 'high' | 'critical';\n    estimatedAgentCount?: number;\n  } = {}\n): Promise<OptimizationRecommendation> {\n  const optimizer = new SwarmLearningOptimizer(reasoningBank);\n\n  const complexity = options.taskComplexity || 'medium';\n  const agentCount = options.estimatedAgentCount || 5;\n\n  return await optimizer.getOptimization(taskDescription, complexity, agentCount);\n}\n"]}
+{"version":3,"file":"swarm-learning-optimizer.js","sourceRoot":"","sources":["../../src/hooks/swarm-learning-optimizer.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAsCH,MAAM,OAAO,sBAAsB;IACzB,aAAa,CAAgB;IACpB,SAAS,GAAG,oBAAoB,CAAC;IAElD,YAAY,aAA4B;QACtC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,qBAAqB,CACzB,eAAuB,EACvB,OAAqB,EACrB,OAAgB;QAEhB,MAAM,SAAS,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAExE,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC;YACpC,SAAS;YACT,IAAI,EAAE,eAAe;YACrB,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,cAAc,EAAE,OAAO,CAAC,cAAc,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC;YACjG,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YAC/B,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC;YAC9C,OAAO;YACP,SAAS,EAAE,OAAO,CAAC,WAAW;YAC9B,UAAU,EAAE,CAAC,EAAE,oCAAoC;YACnD,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC;SAClD,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,OAAqB,EAAE,OAAgB;QAC7D,IAAI,CAAC,OAAO;YAAE,OAAO,GAAG,CAAC;QAEzB,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC,0BAA0B;QAE5C,sCAAsC;QACtC,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;aAAM,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,4BAA4B;QAC5B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;iBAAM,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAClC,MAAM,IAAI,IAAI,CAAC;YACjB,CAAC;iBAAM,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QACvE,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,OAAqB,EAAE,OAAgB;QAC9D,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;QACxE,CAAC;QAED,IAAI,OAAO,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;YAC7B,SAAS,CAAC,IAAI,CAAC,qBAAqB,OAAO,CAAC,WAAW,+BAA+B,CAAC,CAAC;QAC1F,CAAC;QAED,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAC7C,SAAS,CAAC,IAAI,CAAC,oBAAoB,OAAO,CAAC,OAAO,oDAAoD,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QACnF,CAAC;QAED,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC;YAC3D,SAAS,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;QAChG,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC9C,OAAO,sDAAsD,CAAC;YAChE,CAAC;YACD,OAAO,2CAA2C,CAAC;QACrD,CAAC;QAED,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,eAAuB,EACvB,cAAsD,EACtD,mBAA2B;QAE3B,6FAA6F;QAC7F,MAAM,eAAe,GAAG,MAAO,IAAI,CAAC,aAAqB,CAAC,cAAc,EAAE,CAAC,eAAe,EAAE;YAC1F,CAAC,EAAE,EAAE;YACL,SAAS,EAAE,GAAG;YACd,aAAa,EAAE,IAAI;SACpB,CAAC,IAAI,EAAE,CAAC;QAET,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,uDAAuD;YACvD,OAAO,IAAI,CAAC,wBAAwB,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAC;QAC5E,CAAC;QAED,iDAAiD;QACjD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAsE,CAAC;QAErG,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;gBAElC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAClC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC5E,CAAC;gBAED,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBAC5C,KAAK,CAAC,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC;gBACpC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACjB,KAAK,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,IAAI,GAAG,CAAC;YAC7C,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,4BAA4B;gBAC5B,SAAS;YACX,CAAC;QACH,CAAC;QAED,yDAAyD;QACzD,IAAI,YAAY,GAAG,cAAc,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,GAAG,CAAC;QACtB,MAAM,YAAY,GAAuE,EAAE,CAAC;QAE5F,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,KAAK,GAAG,SAAS,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB;YAE3E,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;oBAClB,oCAAoC;oBACpC,YAAY,CAAC,IAAI,CAAC;wBAChB,QAAQ,EAAE,YAAY;wBACtB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;wBAC7C,SAAS,EAAE,oBAAoB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,cAAc,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,KAAK,aAAa;qBACpH,CAAC,CAAC;gBACL,CAAC;gBACD,SAAS,GAAG,KAAK,CAAC;gBAClB,YAAY,GAAG,QAAQ,CAAC;gBACxB,WAAW,GAAG,UAAU,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC;oBAChB,QAAQ;oBACR,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;oBACzC,SAAS,EAAE,oBAAoB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,KAAK,aAAa;iBACtF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,mBAAmB,EAAE,eAAe,CAAC,CAAC;QAE9G,OAAO;YACL,mBAAmB,EAAE,YAAmB;YACxC,oBAAoB,EAAE,gBAAgB;YACtC,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,YAAY,CAAC,CAAC;YAChG,eAAe,EAAE,WAAW;YAC5B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG;YAC7C,SAAS,EAAE,YAAY,eAAe,CAAC,MAAM,kCAAkC;gBACrE,GAAG,YAAY,sBAAsB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB;YACzF,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACnF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,cAAsD,EACtD,mBAA2B;QAE3B,iEAAiE;QACjE,IAAI,QAAmD,CAAC;QACxD,IAAI,eAAuB,CAAC;QAC5B,IAAI,SAAiB,CAAC;QAEtB,IAAI,mBAAmB,IAAI,CAAC,EAAE,CAAC;YAC7B,QAAQ,GAAG,MAAM,CAAC;YAClB,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,qFAAqF,CAAC;QACpG,CAAC;aAAM,IAAI,mBAAmB,IAAI,EAAE,EAAE,CAAC;YACrC,QAAQ,GAAG,cAAc,CAAC;YAC1B,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,sFAAsF,CAAC;QACrG,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,cAAc,CAAC;YAC1B,eAAe,GAAG,GAAG,CAAC;YACtB,SAAS,GAAG,mGAAmG,CAAC;QAClH,CAAC;QAED,6BAA6B;QAC7B,IAAI,cAAc,KAAK,UAAU,IAAI,cAAc,KAAK,MAAM,EAAE,CAAC;YAC/D,eAAe,IAAI,GAAG,CAAC,CAAC,uDAAuD;QACjF,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,mBAAmB,EAAE,EAAE,CAAC,CAAC;QAE1F,OAAO;YACL,mBAAmB,EAAE,QAAQ;YAC7B,oBAAoB,EAAE,SAAS;YAC/B,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAC5F,eAAe;YACf,UAAU,EAAE,GAAG,EAAE,4CAA4C;YAC7D,SAAS,EAAE,GAAG,SAAS,qDAAqD;YAC5E,YAAY,EAAE;gBACZ;oBACE,QAAQ,EAAE,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM;oBACvD,UAAU,EAAE,GAAG;oBACf,SAAS,EAAE,uDAAuD;iBACnE;aACF;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,cAAsD,EACtD,mBAA2B,EAC3B,eAAsB;QAEtB,kDAAkD;QAClD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,eAAe;iBAC/B,GAAG,CAAC,CAAC,CAAC,EAAE;gBACP,IAAI,CAAC;oBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBACnD,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC5D,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC,CAAC;iBACD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAiD,CAAC;YAE3E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,8CAA8C;gBAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkD,CAAC;gBAC3E,KAAK,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBAC/C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC7B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;oBACxD,CAAC;oBACD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;oBACvC,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC;oBAC5B,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAED,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;oBACrE,MAAM,SAAS,GAAG,WAAW,GAAG,KAAK,CAAC;oBACtC,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;wBAC9B,aAAa,GAAG,SAAS,CAAC;wBAC1B,aAAa,GAAG,SAAS,CAAC;oBAC5B,CAAC;gBACH,CAAC;gBAED,OAAO,aAAa,CAAC;YACvB,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC1C,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,QAAgB;QAC9C,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,0CAA0C;YACvD,KAAK,cAAc;gBACjB,OAAO,EAAE,CAAC,CAAC,8BAA8B;YAC3C,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,wCAAwC;YACrD,KAAK,MAAM;gBACT,OAAO,EAAE,CAAC,CAAC,iCAAiC;YAC9C;gBACE,OAAO,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB;QAOxB,MAAM,WAAW,GAAG,MAAO,IAAI,CAAC,aAAqB,CAAC,cAAc,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE;YACrF,CAAC,EAAE,IAAI;YACP,aAAa,EAAE,IAAI;SACpB,CAAC,IAAI,EAAE,CAAC;QAET,MAAM,KAAK,GAAG;YACZ,aAAa,EAAE,WAAW,CAAC,MAAM;YACjC,cAAc,EAAE,EAA4B;YAC5C,iBAAiB,EAAE,EAA8B;YACjD,YAAY,EAAE,EAAc;YAC5B,oBAAoB,EAAE,EAA4B;YAClD,cAAc,EAAE,CAAC;YACjB,sBAAsB,EAAE,cAAc;SACvC,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAiB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAEzD,uBAAuB;gBACvB,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAE3F,gBAAgB;gBAChB,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC/C,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;gBACjD,CAAC;gBACD,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;oBACpB,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAClE,CAAC;gBAED,qBAAqB;gBACrB,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC/C,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;YAC3E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,oBAAoB,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/F,CAAC;QACH,CAAC;QAED,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAClD,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM;YAC3E,CAAC,CAAC,CAAC,CAAC;QAEN,gCAAgC;QAChC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC;YAChF,IAAI,UAAU,GAAG,WAAW,EAAE,CAAC;gBAC7B,WAAW,GAAG,UAAU,CAAC;gBACzB,KAAK,CAAC,sBAAsB,GAAG,QAAQ,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,OAAO;YACL,aAAa,EAAE,KAAK,CAAC,aAAa;YAClC,cAAc,EAAE,KAAK,CAAC,cAAc;YACpC,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;YAChD,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,cAAc,GAAG,EAAE,CAAC,GAAG,EAAE;YAC1D,sBAAsB,EAAE,KAAK,CAAC,sBAAsB;SACrD,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,aAA4B,EAC5B,eAAuB,EACvB,UAGI,EAAE;IAEN,MAAM,SAAS,GAAG,IAAI,sBAAsB,CAAC,aAAa,CAAC,CAAC;IAE5D,MAAM,UAAU,GAAG,OAAO,CAAC,cAAc,IAAI,QAAQ,CAAC;IACtD,MAAM,UAAU,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC;IAEpD,OAAO,MAAM,SAAS,CAAC,eAAe,CAAC,eAAe,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAClF,CAAC","sourcesContent":["/**\n * Swarm Learning Optimizer\n *\n * Enhances parallel execution with adaptive learning, pattern recognition,\n * and automated topology selection using ReasoningBank intelligence.\n */\n\nimport { ReasoningBank } from '../reasoningbank';\n\nexport interface SwarmMetrics {\n  topology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n  agentCount: number;\n  batchSize: number;\n  totalTimeMs: number;\n  successRate: number;\n  speedup?: number;\n  taskComplexity: 'low' | 'medium' | 'high' | 'critical';\n  operations: number;\n}\n\nexport interface LearningPattern {\n  taskType: string;\n  optimalTopology: string;\n  optimalBatchSize: number;\n  expectedSpeedup: number;\n  successRate: number;\n  timestamp: string;\n}\n\nexport interface OptimizationRecommendation {\n  recommendedTopology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n  recommendedBatchSize: number;\n  recommendedAgentCount: number;\n  expectedSpeedup: number;\n  confidence: number;\n  reasoning: string;\n  alternatives: Array<{\n    topology: string;\n    confidence: number;\n    reasoning: string;\n  }>;\n}\n\nexport class SwarmLearningOptimizer {\n  private reasoningBank: ReasoningBank;\n  private readonly NAMESPACE = 'swarm/optimization';\n\n  constructor(reasoningBank: ReasoningBank) {\n    this.reasoningBank = reasoningBank;\n  }\n\n  /**\n   * Store swarm execution metrics for learning\n   */\n  async storeExecutionPattern(\n    taskDescription: string,\n    metrics: SwarmMetrics,\n    success: boolean\n  ): Promise<void> {\n    const sessionId = `${this.NAMESPACE}/${metrics.topology}/${Date.now()}`;\n\n    await this.reasoningBank.storePattern({\n      sessionId,\n      task: taskDescription,\n      input: JSON.stringify({ taskComplexity: metrics.taskComplexity, agentCount: metrics.agentCount }),\n      output: JSON.stringify(metrics),\n      reward: this.calculateReward(metrics, success),\n      success,\n      latencyMs: metrics.totalTimeMs,\n      tokensUsed: 0, // Not tracking tokens for swarm ops\n      critique: this.generateCritique(metrics, success)\n    });\n  }\n\n  /**\n   * Calculate reward score for swarm execution (0-1)\n   */\n  private calculateReward(metrics: SwarmMetrics, success: boolean): number {\n    if (!success) return 0.0;\n\n    let reward = 0.5; // Base reward for success\n\n    // Reward for high success rate (+0.2)\n    if (metrics.successRate >= 90) {\n      reward += 0.2;\n    } else if (metrics.successRate >= 75) {\n      reward += 0.1;\n    }\n\n    // Reward for speedup (+0.2)\n    if (metrics.speedup) {\n      if (metrics.speedup >= 3.0) {\n        reward += 0.2;\n      } else if (metrics.speedup >= 2.0) {\n        reward += 0.15;\n      } else if (metrics.speedup >= 1.5) {\n        reward += 0.1;\n      }\n    }\n\n    // Reward for efficiency (operations/time) (+0.1)\n    const opsPerSecond = (metrics.operations / metrics.totalTimeMs) * 1000;\n    if (opsPerSecond > 0.1) {\n      reward += 0.1;\n    }\n\n    return Math.min(1.0, reward);\n  }\n\n  /**\n   * Generate critique for learning\n   */\n  private generateCritique(metrics: SwarmMetrics, success: boolean): string {\n    const critiques: string[] = [];\n\n    if (!success) {\n      critiques.push('Swarm execution failed - investigate error handling');\n    }\n\n    if (metrics.successRate < 80) {\n      critiques.push(`Low success rate (${metrics.successRate}%) - review agent reliability`);\n    }\n\n    if (metrics.speedup && metrics.speedup < 1.2) {\n      critiques.push(`Minimal speedup (${metrics.speedup}x) - consider different topology or larger batches`);\n    }\n\n    if (metrics.batchSize < 3) {\n      critiques.push('Small batch size - may not fully utilize parallel capabilities');\n    }\n\n    if (metrics.topology === 'mesh' && metrics.agentCount > 10) {\n      critiques.push('Mesh topology with many agents (O(n²) coordination) - consider hierarchical');\n    }\n\n    if (critiques.length === 0) {\n      if (metrics.speedup && metrics.speedup >= 3.0) {\n        return 'Excellent parallel execution - pattern worth reusing';\n      }\n      return 'Good swarm execution - successful pattern';\n    }\n\n    return critiques.join('. ');\n  }\n\n  /**\n   * Get optimization recommendations based on learned patterns\n   */\n  async getOptimization(\n    taskDescription: string,\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number\n  ): Promise<OptimizationRecommendation> {\n    // Search for similar successful patterns - use search method with any cast for compatibility\n    const similarPatterns = await (this.reasoningBank as any).searchPatterns?.(taskDescription, {\n      k: 10,\n      minReward: 0.7,\n      onlySuccesses: true\n    }) ?? [];\n\n    if (similarPatterns.length === 0) {\n      // No learned patterns - return default recommendations\n      return this.getDefaultRecommendation(taskComplexity, estimatedAgentCount);\n    }\n\n    // Analyze patterns to find optimal configuration\n    const topologyScores = new Map<string, { totalReward: number; count: number; avgSpeedup: number }>();\n\n    for (const pattern of similarPatterns) {\n      try {\n        const metrics: SwarmMetrics = JSON.parse(pattern.output);\n        const topology = metrics.topology;\n\n        if (!topologyScores.has(topology)) {\n          topologyScores.set(topology, { totalReward: 0, count: 0, avgSpeedup: 0 });\n        }\n\n        const score = topologyScores.get(topology)!;\n        score.totalReward += pattern.reward;\n        score.count += 1;\n        score.avgSpeedup += metrics.speedup || 1.0;\n      } catch (e) {\n        // Skip invalid pattern data\n        continue;\n      }\n    }\n\n    // Find best topology based on average reward and speedup\n    let bestTopology = 'hierarchical';\n    let bestScore = 0;\n    let bestSpeedup = 1.0;\n    const alternatives: Array<{ topology: string; confidence: number; reasoning: string }> = [];\n\n    for (const [topology, data] of topologyScores.entries()) {\n      const avgReward = data.totalReward / data.count;\n      const avgSpeedup = data.avgSpeedup / data.count;\n      const score = avgReward * 0.6 + (avgSpeedup / 5.0) * 0.4; // Weighted score\n\n      if (score > bestScore) {\n        if (bestScore > 0) {\n          // Previous best becomes alternative\n          alternatives.push({\n            topology: bestTopology,\n            confidence: Math.round(bestScore * 100) / 100,\n            reasoning: `Average speedup: ${bestSpeedup.toFixed(2)}x from ${topologyScores.get(bestTopology)!.count} executions`\n          });\n        }\n        bestScore = score;\n        bestTopology = topology;\n        bestSpeedup = avgSpeedup;\n      } else {\n        alternatives.push({\n          topology,\n          confidence: Math.round(score * 100) / 100,\n          reasoning: `Average speedup: ${avgSpeedup.toFixed(2)}x from ${data.count} executions`\n        });\n      }\n    }\n\n    // Determine optimal batch size based on task complexity and learned patterns\n    const optimalBatchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, similarPatterns);\n\n    return {\n      recommendedTopology: bestTopology as any,\n      recommendedBatchSize: optimalBatchSize,\n      recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(bestTopology)),\n      expectedSpeedup: bestSpeedup,\n      confidence: Math.round(bestScore * 100) / 100,\n      reasoning: `Based on ${similarPatterns.length} similar successful executions. ` +\n                `${bestTopology} topology achieved ${bestSpeedup.toFixed(2)}x average speedup.`,\n      alternatives: alternatives.sort((a, b) => b.confidence - a.confidence).slice(0, 2)\n    };\n  }\n\n  /**\n   * Get default recommendations when no learned patterns exist\n   */\n  private getDefaultRecommendation(\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number\n  ): OptimizationRecommendation {\n    // Default topology selection based on agent count and complexity\n    let topology: 'mesh' | 'hierarchical' | 'ring' | 'star';\n    let expectedSpeedup: number;\n    let reasoning: string;\n\n    if (estimatedAgentCount <= 5) {\n      topology = 'mesh';\n      expectedSpeedup = 2.5;\n      reasoning = 'Mesh topology optimal for small swarms (≤5 agents) - full peer-to-peer coordination';\n    } else if (estimatedAgentCount <= 10) {\n      topology = 'hierarchical';\n      expectedSpeedup = 3.5;\n      reasoning = 'Hierarchical topology optimal for medium swarms (6-10 agents) - efficient delegation';\n    } else {\n      topology = 'hierarchical';\n      expectedSpeedup = 4.0;\n      reasoning = 'Hierarchical topology required for large swarms (>10 agents) - avoids O(n²) coordination overhead';\n    }\n\n    // Adjust for task complexity\n    if (taskComplexity === 'critical' || taskComplexity === 'high') {\n      expectedSpeedup *= 1.2; // Higher complexity benefits more from parallelization\n    }\n\n    const batchSize = this.determineOptimalBatchSize(taskComplexity, estimatedAgentCount, []);\n\n    return {\n      recommendedTopology: topology,\n      recommendedBatchSize: batchSize,\n      recommendedAgentCount: Math.min(estimatedAgentCount, this.getMaxAgentsForTopology(topology)),\n      expectedSpeedup,\n      confidence: 0.6, // Lower confidence without learned patterns\n      reasoning: `${reasoning} (default recommendation - no learned patterns yet)`,\n      alternatives: [\n        {\n          topology: topology === 'mesh' ? 'hierarchical' : 'mesh',\n          confidence: 0.5,\n          reasoning: 'Alternative topology if default does not perform well'\n        }\n      ]\n    };\n  }\n\n  /**\n   * Determine optimal batch size based on complexity and learned patterns\n   */\n  private determineOptimalBatchSize(\n    taskComplexity: 'low' | 'medium' | 'high' | 'critical',\n    estimatedAgentCount: number,\n    learnedPatterns: any[]\n  ): number {\n    // Analyze learned patterns for optimal batch size\n    if (learnedPatterns.length > 0) {\n      const batchSizes = learnedPatterns\n        .map(p => {\n          try {\n            const metrics: SwarmMetrics = JSON.parse(p.output);\n            return { batchSize: metrics.batchSize, reward: p.reward };\n          } catch (e) {\n            return null;\n          }\n        })\n        .filter(x => x !== null) as Array<{ batchSize: number; reward: number }>;\n\n      if (batchSizes.length > 0) {\n        // Find batch size with highest average reward\n        const batchMap = new Map<number, { totalReward: number; count: number }>();\n        for (const { batchSize, reward } of batchSizes) {\n          if (!batchMap.has(batchSize)) {\n            batchMap.set(batchSize, { totalReward: 0, count: 0 });\n          }\n          const entry = batchMap.get(batchSize)!;\n          entry.totalReward += reward;\n          entry.count += 1;\n        }\n\n        let bestBatchSize = 3;\n        let bestAvgReward = 0;\n        for (const [batchSize, { totalReward, count }] of batchMap.entries()) {\n          const avgReward = totalReward / count;\n          if (avgReward > bestAvgReward) {\n            bestAvgReward = avgReward;\n            bestBatchSize = batchSize;\n          }\n        }\n\n        return bestBatchSize;\n      }\n    }\n\n    // Default batch size based on complexity\n    switch (taskComplexity) {\n      case 'low':\n        return Math.min(3, estimatedAgentCount);\n      case 'medium':\n        return Math.min(5, estimatedAgentCount);\n      case 'high':\n        return Math.min(7, estimatedAgentCount);\n      case 'critical':\n        return Math.min(10, estimatedAgentCount);\n    }\n  }\n\n  /**\n   * Get maximum agents for topology (to avoid coordination overhead)\n   */\n  private getMaxAgentsForTopology(topology: string): number {\n    switch (topology) {\n      case 'mesh':\n        return 10; // O(n²) coordination overhead beyond this\n      case 'hierarchical':\n        return 50; // Scales well with delegation\n      case 'ring':\n        return 20; // Sequential token passing limits scale\n      case 'star':\n        return 30; // Central coordinator bottleneck\n      default:\n        return 10;\n    }\n  }\n\n  /**\n   * Generate statistics report on learned patterns\n   */\n  async getOptimizationStats(): Promise<{\n    totalPatterns: number;\n    topologiesUsed: Record<string, number>;\n    avgSpeedupByTopology: Record<string, number>;\n    avgSuccessRate: number;\n    bestPerformingTopology: string;\n  }> {\n    const allPatterns = await (this.reasoningBank as any).searchPatterns?.(this.NAMESPACE, {\n      k: 1000,\n      onlySuccesses: true\n    }) ?? [];\n\n    const stats = {\n      totalPatterns: allPatterns.length,\n      topologiesUsed: {} as Record<string, number>,\n      speedupByTopology: {} as Record<string, number[]>,\n      successRates: [] as number[],\n      avgSpeedupByTopology: {} as Record<string, number>,\n      avgSuccessRate: 0,\n      bestPerformingTopology: 'hierarchical'\n    };\n\n    for (const pattern of allPatterns) {\n      try {\n        const metrics: SwarmMetrics = JSON.parse(pattern.output);\n\n        // Count topology usage\n        stats.topologiesUsed[metrics.topology] = (stats.topologiesUsed[metrics.topology] || 0) + 1;\n\n        // Track speedup\n        if (!stats.speedupByTopology[metrics.topology]) {\n          stats.speedupByTopology[metrics.topology] = [];\n        }\n        if (metrics.speedup) {\n          stats.speedupByTopology[metrics.topology].push(metrics.speedup);\n        }\n\n        // Track success rate\n        stats.successRates.push(metrics.successRate);\n      } catch (e) {\n        continue;\n      }\n    }\n\n    // Calculate averages\n    for (const [topology, speedups] of Object.entries(stats.speedupByTopology)) {\n      if (speedups.length > 0) {\n        stats.avgSpeedupByTopology[topology] = speedups.reduce((a, b) => a + b, 0) / speedups.length;\n      }\n    }\n\n    stats.avgSuccessRate = stats.successRates.length > 0\n      ? stats.successRates.reduce((a, b) => a + b, 0) / stats.successRates.length\n      : 0;\n\n    // Find best performing topology\n    let bestSpeedup = 0;\n    for (const [topology, avgSpeedup] of Object.entries(stats.avgSpeedupByTopology)) {\n      if (avgSpeedup > bestSpeedup) {\n        bestSpeedup = avgSpeedup;\n        stats.bestPerformingTopology = topology;\n      }\n    }\n\n    return {\n      totalPatterns: stats.totalPatterns,\n      topologiesUsed: stats.topologiesUsed,\n      avgSpeedupByTopology: stats.avgSpeedupByTopology,\n      avgSuccessRate: Math.round(stats.avgSuccessRate * 10) / 10,\n      bestPerformingTopology: stats.bestPerformingTopology\n    };\n  }\n}\n\n/**\n * Auto-select optimal swarm configuration\n */\nexport async function autoSelectSwarmConfig(\n  reasoningBank: ReasoningBank,\n  taskDescription: string,\n  options: {\n    taskComplexity?: 'low' | 'medium' | 'high' | 'critical';\n    estimatedAgentCount?: number;\n  } = {}\n): Promise<OptimizationRecommendation> {\n  const optimizer = new SwarmLearningOptimizer(reasoningBank);\n\n  const complexity = options.taskComplexity || 'medium';\n  const agentCount = options.estimatedAgentCount || 5;\n\n  return await optimizer.getOptimization(taskDescription, complexity, agentCount);\n}\n"]}

package/dist/index.d.ts

@@ -1,4 +1,6 @@
-import "./utils/agentdb-runtime-patch.js";
-import "dotenv/config";
-export * as reasoningbank from "./reasoningbank/index.js";
+import './utils/agentdb-runtime-patch.js';
+import './utils/load-env.js';
+export * as reasoningbank from './reasoningbank/index.js';
+declare function main(): Promise<void>;
+export { main };
 //# sourceMappingURL=index.d.ts.map