@mneme-ai/core 0.25.0 → 0.26.0

package/dist/index.d.ts

@@ -13,4 +13,5 @@ export * as quant from "./quant/index.js";
 export * as guardian from "./guardian/index.js";
 export * as forensics from "./forensics/index.js";
 export * as htc from "./htc/index.js";
+export * as pipeline from "./pipeline/index.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,OAAO,MAAM,oBAAoB,CAAC;AAC9C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,OAAO,MAAM,oBAAoB,CAAC;AAC9C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC"}

package/dist/index.js

@@ -13,4 +13,5 @@ export * as quant from "./quant/index.js";
 export * as guardian from "./guardian/index.js";
 export * as forensics from "./forensics/index.js";
 export * as htc from "./htc/index.js";
+export * as pipeline from "./pipeline/index.js";
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,OAAO,MAAM,oBAAoB,CAAC;AAC9C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,OAAO,MAAM,oBAAoB,CAAC;AAC9C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AAC5C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AAC1C,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,sBAAsB,CAAC;AAClD,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAC"}

package/dist/pipeline/index.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Super Pipeline Engine — barrel.
+ *
+ * Public surface for Mneme v0.26.0:
+ *   - types.ts          — PipelineStage, PipelineConfig, PipelineEvent
+ *   - super-pipeline.ts — runPipeline (the deeply-pipelined runtime)
+ *   - superscalar.ts    — superscalar / reorderBySeq / speculatePrefetch
+ *   - mpe.ts            — Multi-stage Pipelined Eigentrust
+ *
+ * The novel contribution: MPE composes Eigentrust (P2P reputation) with
+ * pipeline scheduling (CPU architecture) and adds latency-weighted success.
+ * Mneme is the first CLI memory layer to use this combination.
+ */
+export * from "./types.js";
+export * from "./super-pipeline.js";
+export * from "./superscalar.js";
+export * from "./mpe.js";
+import type { PipelineConfig, PipelineStage } from "./types.js";
+/**
+ * Run any sequence of stages as a deeply-pipelined superscalar engine and
+ * return the outputs in INPUT ORDER. Auto-tunes via MPE if `mpe` is set.
+ *
+ * For streaming use cases (or when input order doesn't matter) prefer
+ * runPipeline directly — it yields out-of-order with seq tags.
+ */
+export declare function runDeepPipeline<I, O>(cfg: PipelineConfig, inputs: AsyncIterable<I> | Iterable<I>): Promise<O[]>;
+/**
+ * Build a PipelineStage from a plain function + id. Convenience for tests
+ * and for ad-hoc pipelines where defining a class is overkill.
+ */
+export declare function defineStage<I, O>(id: string, description: string, fn: (input: I) => O | Promise<O>, opts?: {
+    targetMs?: number;
+}): PipelineStage<I, O>;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/pipeline/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,cAAc,YAAY,CAAC;AAC3B,cAAc,qBAAqB,CAAC;AACpC,cAAc,kBAAkB,CAAC;AACjC,cAAc,UAAU,CAAC;AAEzB,OAAO,KAAK,EAAE,cAAc,EAAE,aAAa,EAAW,MAAM,YAAY,CAAC;AAIzE;;;;;;GAMG;AACH,wBAAsB,eAAe,CAAC,CAAC,EAAE,CAAC,EACxC,GAAG,EAAE,cAAc,EACnB,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GACrC,OAAO,CAAC,CAAC,EAAE,CAAC,CASd;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAC9B,EAAE,EAAE,MAAM,EACV,WAAW,EAAE,MAAM,EACnB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAChC,IAAI,GAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GAC/B,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CASrB"}

package/dist/pipeline/index.js

@@ -0,0 +1,51 @@
+/**
+ * Super Pipeline Engine — barrel.
+ *
+ * Public surface for Mneme v0.26.0:
+ *   - types.ts          — PipelineStage, PipelineConfig, PipelineEvent
+ *   - super-pipeline.ts — runPipeline (the deeply-pipelined runtime)
+ *   - superscalar.ts    — superscalar / reorderBySeq / speculatePrefetch
+ *   - mpe.ts            — Multi-stage Pipelined Eigentrust
+ *
+ * The novel contribution: MPE composes Eigentrust (P2P reputation) with
+ * pipeline scheduling (CPU architecture) and adds latency-weighted success.
+ * Mneme is the first CLI memory layer to use this combination.
+ */
+export * from "./types.js";
+export * from "./super-pipeline.js";
+export * from "./superscalar.js";
+export * from "./mpe.js";
+import { runPipeline } from "./super-pipeline.js";
+import { reorderBySeq } from "./superscalar.js";
+/**
+ * Run any sequence of stages as a deeply-pipelined superscalar engine and
+ * return the outputs in INPUT ORDER. Auto-tunes via MPE if `mpe` is set.
+ *
+ * For streaming use cases (or when input order doesn't matter) prefer
+ * runPipeline directly — it yields out-of-order with seq tags.
+ */
+export async function runDeepPipeline(cfg, inputs) {
+    const out = [];
+    // runPipeline yields SeqItem<O> in completion order; reorderBySeq
+    // restores input order before we collect.
+    const ordered = reorderBySeq(runPipeline(cfg, inputs));
+    for await (const item of ordered) {
+        out.push(item.value);
+    }
+    return out;
+}
+/**
+ * Build a PipelineStage from a plain function + id. Convenience for tests
+ * and for ad-hoc pipelines where defining a class is overkill.
+ */
+export function defineStage(id, description, fn, opts = {}) {
+    return {
+        id,
+        description,
+        targetMs: opts.targetMs,
+        async process(input) {
+            return await fn(input);
+        },
+    };
+}
+//# sourceMappingURL=index.js.map

package/dist/pipeline/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/pipeline/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,cAAc,YAAY,CAAC;AAC3B,cAAc,qBAAqB,CAAC;AACpC,cAAc,kBAAkB,CAAC;AACjC,cAAc,UAAU,CAAC;AAGzB,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAEhD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,GAAmB,EACnB,MAAsC;IAEtC,MAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,kEAAkE;IAClE,0CAA0C;IAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,WAAW,CAAO,GAAG,EAAE,MAAM,CAA8B,CAAC,CAAC;IAC1F,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QACjC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,EAAU,EACV,WAAmB,EACnB,EAAgC,EAChC,OAA8B,EAAE;IAEhC,OAAO;QACL,EAAE;QACF,WAAW;QACX,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,KAAK,CAAC,OAAO,CAAC,KAAK;YACjB,OAAO,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/pipeline/mpe.d.ts

@@ -0,0 +1,83 @@
+/** Per-stage trust eigenvector. Updates after every pipeline run. */
+export interface MpeState {
+    trust: Map<string, number>;
+    successCount: Map<string, number>;
+    failureCount: Map<string, number>;
+    totalLatencyMs: Map<string, number>;
+    callCount: Map<string, number>;
+    /** Soft target latency per stage — used in latency weighting. */
+    targetMs: Map<string, number>;
+    /** PageRank-style decay term. */
+    decay: number;
+    /** Last update ISO ts. */
+    updatedAt?: string;
+}
+/** Single observation produced by the pipeline runtime. */
+export interface StageResult {
+    stage: string;
+    ok: boolean;
+    latencyMs: number;
+    /** Optional target latency for the stage. Defaults to whatever's already
+     *  recorded in MpeState.targetMs (or 100ms if neither is present). */
+    targetMs?: number;
+}
+/** Recommend an action for the next pipeline run based on trust. */
+export interface MpeRecommendation {
+    /** Stages to allocate MORE workers to (high trust + bottleneck). */
+    scaleUp: string[];
+    /** Stages to allocate FEWER workers to (low trust, save resources). */
+    scaleDown: string[];
+    /** Stages where speculative pre-fetch is unsafe (low trust). */
+    noSpeculate: string[];
+    /** Updated trust ranking, top-down. */
+    ranking: Array<{
+        stage: string;
+        trust: number;
+    }>;
+}
+/** Build an empty MpeState with the given decay (default 0.85). */
+export declare function emptyMpeState(decay?: number): MpeState;
+/**
+ * Apply one Eigentrust-style update step to `state` given the latest
+ * batch of stage observations. The function is pure — it returns a new
+ * MpeState rather than mutating the input.
+ *
+ * The math is:
+ *
+ *   prior_i  = 1 / numStages
+ *   e_i      = sum over results in stage i of (ok ? exp(-lat / target) : 0) / count
+ *   T'_i     = α × e_i × T_i + (1 - α) × prior_i
+ *
+ * After computing the raw vector we renormalize so it sums to 1, which
+ * makes it a probability distribution (proper eigenvector form).
+ */
+export declare function updateMpe(state: MpeState, results: StageResult[]): MpeState;
+/**
+ * Power iteration helper — repeatedly applies updateMpe with the SAME batch
+ * of results until the eigenvector converges (L1 distance < tol or maxIter).
+ * Useful in tests and when you want a stable ranking without waiting for
+ * many real pipeline runs.
+ */
+export declare function powerIterate(state: MpeState, results: StageResult[], opts?: {
+    maxIter?: number;
+    tol?: number;
+}): MpeState;
+/**
+ * Compute a recommendation from the current trust state.
+ *
+ * Heuristics (deliberately simple — the runtime can override):
+ *   - scaleUp:    top-third of stages by trust AND average latency above
+ *                 target (likely bottlenecks worth more workers).
+ *   - scaleDown:  bottom-third of stages by trust AND failure rate > 30%.
+ *   - noSpeculate: trust below speculateThreshold (default 0.3 / numStages).
+ */
+export declare function recommendFromMpe(state: MpeState, opts?: {
+    speculateThreshold?: number;
+}): MpeRecommendation;
+export declare function serializeMpeState(state: MpeState): string;
+export declare function deserializeMpeState(text: string): MpeState;
+/** Read .mneme/mpe.json. Returns an empty state if the file does not exist. */
+export declare function readMpeState(repoRoot: string): MpeState;
+/** Write .mneme/mpe.json (creates parent dir if needed). */
+export declare function writeMpeState(repoRoot: string, state: MpeState): void;
+//# sourceMappingURL=mpe.d.ts.map

package/dist/pipeline/mpe.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mpe.d.ts","sourceRoot":"","sources":["../../src/pipeline/mpe.ts"],"names":[],"mappings":"AA4CA,qEAAqE;AACrE,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,iEAAiE;IACjE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,iCAAiC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,0BAA0B;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,2DAA2D;AAC3D,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,EAAE,EAAE,OAAO,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB;0EACsE;IACtE,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,oEAAoE;AACpE,MAAM,WAAW,iBAAiB;IAChC,oEAAoE;IACpE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,uEAAuE;IACvE,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,gEAAgE;IAChE,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,uCAAuC;IACvC,OAAO,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAED,mEAAmE;AACnE,wBAAgB,aAAa,CAAC,KAAK,SAAO,GAAG,QAAQ,CAUpD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,QAAQ,CA4E3E;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,QAAQ,EACf,OAAO,EAAE,WAAW,EAAE,EACtB,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5C,QAAQ,CAcV;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,QAAQ,EACf,IAAI,GAAE;IAAE,kBAAkB,CAAC,EAAE,MAAM,CAAA;CAAO,GACzC,iBAAiB,CAiCnB;AA4BD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM,CAYzD;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAY1D;AAED,+EAA+E;AAC/E,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,CAQvD;AAED,4DAA4D;AAC5D,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,IAAI,CAIrE"}

package/dist/pipeline/mpe.js

@@ -0,0 +1,259 @@
+/**
+ * MPE — Multi-stage Pipelined Eigentrust.
+ *
+ * The novel formula. Three ingredients composed:
+ *
+ *   1. Eigentrust   (Kamvar, Schlosser, Garcia-Molina 2003) — P2P reputation
+ *      via power iteration on a stochastic trust matrix.
+ *   2. PageRank-style decay — preserves recency bias and prevents the
+ *      eigenvector from collapsing onto one dominant stage.
+ *   3. Latency-weighted success — fast successful stages contribute more
+ *      to the trust update than slow successful stages.
+ *
+ * The update at iteration n:
+ *
+ *      T_n = α × E_n × T_{n-1} + (1 - α) × prior
+ *
+ * where:
+ *      T_n     trust eigenvector at iteration n          (Map<stage, [0..1]>)
+ *      E_n     stage success matrix at iteration n       (diagonal — each
+ *              stage's contribution is independent; latency-discounted)
+ *      α       decay (PageRank teleport probability)     default 0.85
+ *      prior   uniform exploration term                  1 / numStages
+ *
+ * E_n is built from per-stage StageResult observations:
+ *
+ *      e_i = ok ? exp(-latency / target) : 0
+ *
+ * so a fast success ≈ 1, a slow success approaches 0, a failure is exactly 0.
+ * The exponential decay is the latency weighting referenced above.
+ *
+ * After enough iterations (or just one, if initial trust is uniform) the
+ * eigenvector ranks stages by recency × success × speed. The runtime uses
+ * this ranking to:
+ *   1. Allocate more workers to high-trust bottlenecks (scaleUp)
+ *   2. Reclaim workers from low-trust noisy stages (scaleDown)
+ *   3. Suppress speculative pre-fetch when trust < speculateThreshold
+ *
+ * Mneme is the first CLI memory layer to compose Eigentrust with deep
+ * pipeline scheduling. The persistence file is .mneme/mpe.json so the
+ * trust ranking carries across runs and adapts to each repo + user.
+ */
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from "node:fs";
+import { dirname, join } from "node:path";
+/** Build an empty MpeState with the given decay (default 0.85). */
+export function emptyMpeState(decay = 0.85) {
+    return {
+        trust: new Map(),
+        successCount: new Map(),
+        failureCount: new Map(),
+        totalLatencyMs: new Map(),
+        callCount: new Map(),
+        targetMs: new Map(),
+        decay,
+    };
+}
+/**
+ * Apply one Eigentrust-style update step to `state` given the latest
+ * batch of stage observations. The function is pure — it returns a new
+ * MpeState rather than mutating the input.
+ *
+ * The math is:
+ *
+ *   prior_i  = 1 / numStages
+ *   e_i      = sum over results in stage i of (ok ? exp(-lat / target) : 0) / count
+ *   T'_i     = α × e_i × T_i + (1 - α) × prior_i
+ *
+ * After computing the raw vector we renormalize so it sums to 1, which
+ * makes it a probability distribution (proper eigenvector form).
+ */
+export function updateMpe(state, results) {
+    // Defensive: clone all maps so callers can keep using the previous state.
+    const trust = new Map(state.trust);
+    const successCount = new Map(state.successCount);
+    const failureCount = new Map(state.failureCount);
+    const totalLatencyMs = new Map(state.totalLatencyMs);
+    const callCount = new Map(state.callCount);
+    const targetMs = new Map(state.targetMs);
+    // Step 1 — fold observations into the running counters.
+    // Group results by stage so we can compute a per-stage e_i.
+    const perStageContribs = new Map();
+    for (const r of results) {
+        successCount.set(r.stage, (successCount.get(r.stage) ?? 0) + (r.ok ? 1 : 0));
+        failureCount.set(r.stage, (failureCount.get(r.stage) ?? 0) + (r.ok ? 0 : 1));
+        totalLatencyMs.set(r.stage, (totalLatencyMs.get(r.stage) ?? 0) + r.latencyMs);
+        callCount.set(r.stage, (callCount.get(r.stage) ?? 0) + 1);
+        if (r.targetMs !== undefined)
+            targetMs.set(r.stage, r.targetMs);
+        const target = targetMs.get(r.stage) ?? 100;
+        // Latency-weighted success contribution.
+        // exp(-lat / target) ∈ (0, 1]; equals 1 at lat=0, ~0.37 at lat=target,
+        // ~0.05 at lat=3*target. A failure contributes 0.
+        const e = r.ok ? Math.exp(-Math.max(r.latencyMs, 0) / Math.max(target, 1)) : 0;
+        const cur = perStageContribs.get(r.stage) ?? { sum: 0, n: 0 };
+        cur.sum += e;
+        cur.n += 1;
+        perStageContribs.set(r.stage, cur);
+    }
+    // Make sure every known stage exists in trust with a starting value.
+    // Stages not seen in this batch keep their previous trust (decay applied
+    // implicitly — they get the (1-α)*prior nudge but no e_i contribution).
+    const allStages = new Set([
+        ...trust.keys(),
+        ...successCount.keys(),
+        ...failureCount.keys(),
+        ...perStageContribs.keys(),
+    ]);
+    const numStages = Math.max(allStages.size, 1);
+    const prior = 1 / numStages;
+    const alpha = state.decay;
+    // Step 2 — apply the Eigentrust update.
+    for (const stage of allStages) {
+        const contrib = perStageContribs.get(stage);
+        const e = contrib ? contrib.sum / Math.max(contrib.n, 1) : 0;
+        // Bootstrap: if the stage has no prior trust, seed it with the prior so
+        // the first observation can move it.
+        const tPrev = trust.get(stage) ?? prior;
+        const tNew = alpha * e * tPrev + (1 - alpha) * prior;
+        trust.set(stage, tNew);
+    }
+    // Step 3 — renormalize so the eigenvector sums to 1.
+    let total = 0;
+    for (const v of trust.values())
+        total += v;
+    if (total > 0) {
+        for (const [k, v] of trust)
+            trust.set(k, v / total);
+    }
+    return {
+        trust,
+        successCount,
+        failureCount,
+        totalLatencyMs,
+        callCount,
+        targetMs,
+        decay: state.decay,
+        updatedAt: new Date().toISOString(),
+    };
+}
+/**
+ * Power iteration helper — repeatedly applies updateMpe with the SAME batch
+ * of results until the eigenvector converges (L1 distance < tol or maxIter).
+ * Useful in tests and when you want a stable ranking without waiting for
+ * many real pipeline runs.
+ */
+export function powerIterate(state, results, opts = {}) {
+    const maxIter = opts.maxIter ?? 50;
+    const tol = opts.tol ?? 1e-6;
+    let cur = state;
+    for (let i = 0; i < maxIter; i++) {
+        const next = updateMpe(cur, results);
+        let l1 = 0;
+        for (const k of next.trust.keys()) {
+            l1 += Math.abs((next.trust.get(k) ?? 0) - (cur.trust.get(k) ?? 0));
+        }
+        cur = next;
+        if (l1 < tol)
+            break;
+    }
+    return cur;
+}
+/**
+ * Compute a recommendation from the current trust state.
+ *
+ * Heuristics (deliberately simple — the runtime can override):
+ *   - scaleUp:    top-third of stages by trust AND average latency above
+ *                 target (likely bottlenecks worth more workers).
+ *   - scaleDown:  bottom-third of stages by trust AND failure rate > 30%.
+ *   - noSpeculate: trust below speculateThreshold (default 0.3 / numStages).
+ */
+export function recommendFromMpe(state, opts = {}) {
+    const ranking = [...state.trust.entries()]
+        .map(([stage, trust]) => ({ stage, trust }))
+        .sort((a, b) => b.trust - a.trust);
+    const numStages = ranking.length || 1;
+    const third = Math.max(1, Math.floor(numStages / 3));
+    const top = new Set(ranking.slice(0, third).map((r) => r.stage));
+    const bottom = new Set(ranking.slice(-third).map((r) => r.stage));
+    // Threshold defaults to (speculateThreshold || 0.3) × prior so it scales
+    // naturally with stage count.
+    const prior = 1 / numStages;
+    const noSpecCutoff = (opts.speculateThreshold ?? 0.3) * prior;
+    const scaleUp = [];
+    const scaleDown = [];
+    const noSpeculate = [];
+    for (const { stage, trust } of ranking) {
+        const calls = state.callCount.get(stage) ?? 0;
+        const fails = state.failureCount.get(stage) ?? 0;
+        const totalLat = state.totalLatencyMs.get(stage) ?? 0;
+        const target = state.targetMs.get(stage) ?? 100;
+        const avgLat = calls > 0 ? totalLat / calls : 0;
+        const failRate = calls > 0 ? fails / calls : 0;
+        if (top.has(stage) && avgLat > target)
+            scaleUp.push(stage);
+        if (bottom.has(stage) && failRate > 0.3)
+            scaleDown.push(stage);
+        if (trust < noSpecCutoff)
+            noSpeculate.push(stage);
+    }
+    return { scaleUp, scaleDown, noSpeculate, ranking };
+}
+function mapToObj(m) {
+    const o = {};
+    for (const [k, v] of m)
+        o[k] = v;
+    return o;
+}
+function objToMap(o) {
+    const m = new Map();
+    if (!o)
+        return m;
+    for (const k of Object.keys(o))
+        m.set(k, o[k]);
+    return m;
+}
+export function serializeMpeState(state) {
+    const json = {
+        trust: mapToObj(state.trust),
+        successCount: mapToObj(state.successCount),
+        failureCount: mapToObj(state.failureCount),
+        totalLatencyMs: mapToObj(state.totalLatencyMs),
+        callCount: mapToObj(state.callCount),
+        targetMs: mapToObj(state.targetMs),
+        decay: state.decay,
+        updatedAt: state.updatedAt,
+    };
+    return JSON.stringify(json, null, 2);
+}
+export function deserializeMpeState(text) {
+    const json = JSON.parse(text);
+    return {
+        trust: objToMap(json.trust),
+        successCount: objToMap(json.successCount),
+        failureCount: objToMap(json.failureCount),
+        totalLatencyMs: objToMap(json.totalLatencyMs),
+        callCount: objToMap(json.callCount),
+        targetMs: objToMap(json.targetMs),
+        decay: json.decay ?? 0.85,
+        updatedAt: json.updatedAt,
+    };
+}
+/** Read .mneme/mpe.json. Returns an empty state if the file does not exist. */
+export function readMpeState(repoRoot) {
+    const p = join(repoRoot, ".mneme", "mpe.json");
+    if (!existsSync(p))
+        return emptyMpeState();
+    try {
+        return deserializeMpeState(readFileSync(p, "utf8"));
+    }
+    catch {
+        return emptyMpeState();
+    }
+}
+/** Write .mneme/mpe.json (creates parent dir if needed). */
+export function writeMpeState(repoRoot, state) {
+    const p = join(repoRoot, ".mneme", "mpe.json");
+    mkdirSync(dirname(p), { recursive: true });
+    writeFileSync(p, serializeMpeState(state), "utf8");
+}
+//# sourceMappingURL=mpe.js.map

package/dist/pipeline/mpe.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mpe.js","sourceRoot":"","sources":["../../src/pipeline/mpe.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAuC1C,mEAAmE;AACnE,MAAM,UAAU,aAAa,CAAC,KAAK,GAAG,IAAI;IACxC,OAAO;QACL,KAAK,EAAE,IAAI,GAAG,EAAE;QAChB,YAAY,EAAE,IAAI,GAAG,EAAE;QACvB,YAAY,EAAE,IAAI,GAAG,EAAE;QACvB,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,SAAS,EAAE,IAAI,GAAG,EAAE;QACpB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,SAAS,CAAC,KAAe,EAAE,OAAsB;IAC/D,0EAA0E;IAC1E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACjD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACjD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAEzC,wDAAwD;IACxD,4DAA4D;IAC5D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAsC,CAAC;IAEvE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,cAAc,CAAC,GAAG,CAChB,CAAC,CAAC,KAAK,EACP,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CACjD,CAAC;QACF,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE1D,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;QAE5C,yCAAyC;QACzC,uEAAuE;QACvE,kDAAkD;QAClD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAC9D,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACX,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IAED,qEAAqE;IACrE,yEAAyE;IACzE,wEAAwE;IACxE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS;QAChC,GAAG,KAAK,CAAC,IAAI,EAAE;QACf,GAAG,YAAY,CAAC,IAAI,EAAE;QACtB,GAAG,YAAY,CAAC,IAAI,EAAE;QACtB,GAAG,gBAAgB,CAAC,IAAI,EAAE;KAC3B,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAE1B,wCAAwC;IACxC,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,wEAAwE;QACxE,qCAAqC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QACxC,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QACrD,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,qDAAqD;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE;QAAE,KAAK,IAAI,CAAC,CAAC;IAC3C,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;IACtD,CAAC;IAED,OAAO;QACL,KAAK;QACL,YAAY;QACZ,YAAY;QACZ,cAAc;QACd,SAAS;QACT,QAAQ;QACR,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACpC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAe,EACf,OAAsB,EACtB,OAA2C,EAAE;IAE7C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC;IAC7B,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACrC,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,GAAG,GAAG,IAAI,CAAC;QACX,IAAI,EAAE,GAAG,GAAG;YAAE,MAAM;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAe,EACf,OAAwC,EAAE;IAE1C,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;SACvC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;SAC3C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACjE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAElE,yEAAyE;IACzE,8BAA8B;IAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC;IAC5B,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,kBAAkB,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC;IAE9D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;QAChD,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/C,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,GAAG,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3D,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,QAAQ,GAAG,GAAG;YAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/D,IAAI,KAAK,GAAG,YAAY;YAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AACtD,CAAC;AAeD,SAAS,QAAQ,CAAI,CAAiB;IACpC,MAAM,CAAC,GAAsB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,QAAQ,CAAI,CAAgC;IACnD,MAAM,CAAC,GAAG,IAAI,GAAG,EAAa,CAAC;IAC/B,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,KAAe;IAC/C,MAAM,IAAI,GAAiB;QACzB,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC;QAC5B,YAAY,EAAE,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC;QAC1C,YAAY,EAAE,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC;QAC1C,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC;QAC9C,SAAS,EAAE,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC;QACpC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC;QAClC,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,SAAS,EAAE,KAAK,CAAC,SAAS;KAC3B,CAAC;IACF,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAiB,CAAC;IAC9C,OAAO;QACL,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;QAC3B,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC;QACzC,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC;QACzC,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC;QAC7C,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC;QACnC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;QACjC,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,IAAI;QACzB,SAAS,EAAE,IAAI,CAAC,SAAS;KAC1B,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC/C,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,aAAa,EAAE,CAAC;IAC3C,IAAI,CAAC;QACH,OAAO,mBAAmB,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,aAAa,EAAE,CAAC;IACzB,CAAC;AACH,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,aAAa,CAAC,QAAgB,EAAE,KAAe;IAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC/C,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3C,aAAa,CAAC,CAAC,EAAE,iBAAiB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;AACrD,CAAC"}

package/dist/pipeline/mpe.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=mpe.test.d.ts.map

package/dist/pipeline/mpe.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mpe.test.d.ts","sourceRoot":"","sources":["../../src/pipeline/mpe.test.ts"],"names":[],"mappings":""}