@mneme-ai/core 2.4.0 → 2.6.0

package/dist/truth_kernel/index.d.ts

@@ -0,0 +1,92 @@
+/**
+ * v2.6.0 -- TRUTH KERNEL.
+ *
+ *   "Many gates · one verdict · disagreement is signal, not noise."
+ *
+ * The pattern Mneme accumulated by v2.5: more than ten folders all
+ * answering the same family of question — "is this AI claim true?".
+ * Each carries a different sensor:
+ *   FLASH        — Veracity-Velocity Singularity over evidence weights
+ *   APOPTOSIS    — 7-witness fusion (file ∧ symbol ∧ type ∧ git ∧ test ∧ ...)
+ *   X-RAY        — surface-text hedging vs. absolutism
+ *   TWINS        — opposing-prior debate disagreement
+ * (additional sensors can be added — the kernel is sensor-agnostic.)
+ *
+ * Until now AI agents had to PICK which sensor to call. That's the
+ * wrong mental model. A truthful claim should look truthful to every
+ * sensor; a false claim is detected EARLIER when multiple sensors are
+ * fused. Mneme should ask the AI for a claim and run every sensor in
+ * parallel, then BAYESIAN-FUSE the verdicts into a single probability
+ * with calibrated weights.
+ *
+ * Wild move: DISAGREEMENT is itself the most valuable output. When
+ * apoptosis says HEALTHY and x-ray says LOW-CONFIDENCE, that conflict
+ * is a louder signal than either verdict alone. The kernel surfaces
+ * the disagreement, not just the fused score.
+ *
+ * Sensors stay independently callable (no breaking change). Kernel
+ * is a NEW SURFACE that composes them.
+ */
+export type SensorVerdict = "TRUE" | "FALSE" | "UNCERTAIN" | "INAPPLICABLE";
+export interface SensorOutput {
+    /** Stable sensor id ("flash" / "apoptosis" / etc). */
+    sensor: string;
+    /** This sensor's verdict on the claim. */
+    verdict: SensorVerdict;
+    /** Sensor's confidence in its own verdict, 0..1. */
+    confidence: number;
+    /** Free-form rationale a human can read. */
+    rationale?: string;
+    /** Wall-clock ms the sensor took. */
+    ms?: number;
+}
+export interface SensorAdapter {
+    /** Stable id used in fusion + reporting. */
+    id: string;
+    /** Optional prior weight 0..1 — calibrated from historical accuracy.
+     *  Default 1.0 (treat as fully reliable until measured otherwise). */
+    weight?: number;
+    /** Run the sensor. Must never throw — return a degraded verdict instead. */
+    run: (claim: string, ctx?: Record<string, unknown>) => Promise<SensorOutput> | SensorOutput;
+}
+export interface TruthKernelInput {
+    /** The claim under test. */
+    claim: string;
+    /** Sensors to fan out to. Must be ≥ 1. */
+    sensors: readonly SensorAdapter[];
+    /** Optional context passed verbatim to every sensor. */
+    ctx?: Record<string, unknown>;
+    /** Hard timeout per sensor in ms. Default 5000. */
+    perSensorTimeoutMs?: number;
+}
+export interface TruthVerdict {
+    /** Fused probability the claim is true, 0..1. */
+    pTrue: number;
+    /** Convenience label derived from pTrue + disagreement. */
+    verdict: "ACCEPTED" | "DISPUTED" | "REJECTED" | "INCONCLUSIVE";
+    /** 0..1 — how much sensors disagree. High disagreement = uncertain. */
+    disagreement: number;
+    /** Each sensor's raw verdict. */
+    sensorOutputs: SensorOutput[];
+    /** When applicable, the sensor that most-strongly drove the fused score. */
+    dominantSensor?: string;
+    /** When applicable, the sensor whose verdict is the outlier. */
+    outlierSensor?: string;
+    /** Total wall-clock ms. */
+    totalMs: number;
+}
+/** Run the kernel: fan out → fuse → label. */
+export declare function checkTruth(input: TruthKernelInput): Promise<TruthVerdict>;
+/** Compact one-line pulse summary. */
+export declare function formatTruthKernelPulseLine(v: TruthVerdict): string;
+/** Calibrate sensor weights from historical (sensorOutput, groundTruth) pairs.
+ *  Returns a new weight map; higher weight = sensor was more often right.
+ *
+ *  Simple algorithm: weight = max(0.1, accuracy * 2) so a 50% sensor → 1.0,
+ *  a perfect sensor → 2.0, a random sensor → 1.0. Caps at 2.0 to avoid
+ *  any single sensor dominating the log-odds sum. */
+export declare function calibrateWeights(history: ReadonlyArray<{
+    sensor: string;
+    verdictWasCorrect: boolean;
+}>): Map<string, number>;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/truth_kernel/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,OAAO,GAAG,WAAW,GAAG,cAAc,CAAC;AAE5E,MAAM,WAAW,YAAY;IAC3B,sDAAsD;IACtD,MAAM,EAAE,MAAM,CAAC;IACf,0CAA0C;IAC1C,OAAO,EAAE,aAAa,CAAC;IACvB,oDAAoD;IACpD,UAAU,EAAE,MAAM,CAAC;IACnB,4CAA4C;IAC5C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qCAAqC;IACrC,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,aAAa;IAC5B,4CAA4C;IAC5C,EAAE,EAAE,MAAM,CAAC;IACX;0EACsE;IACtE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,4EAA4E;IAC5E,GAAG,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC,YAAY,CAAC,GAAG,YAAY,CAAC;CAC7F;AAED,MAAM,WAAW,gBAAgB;IAC/B,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,OAAO,EAAE,SAAS,aAAa,EAAE,CAAC;IAClC,wDAAwD;IACxD,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,mDAAmD;IACnD,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,iDAAiD;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,2DAA2D;IAC3D,OAAO,EAAE,UAAU,GAAG,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC;IAC/D,uEAAuE;IACvE,YAAY,EAAE,MAAM,CAAC;IACrB,iCAAiC;IACjC,aAAa,EAAE,YAAY,EAAE,CAAC;IAC9B,4EAA4E;IAC5E,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gEAAgE;IAChE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,OAAO,EAAE,MAAM,CAAC;CACjB;AAiGD,8CAA8C;AAC9C,wBAAsB,UAAU,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,YAAY,CAAC,CAiC/E;AAED,sCAAsC;AACtC,wBAAgB,0BAA0B,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CAElE;AAED;;;;;qDAKqD;AACrD,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,aAAa,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,iBAAiB,EAAE,OAAO,CAAA;CAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAgB5H"}

package/dist/truth_kernel/index.js

@@ -0,0 +1,203 @@
+/**
+ * v2.6.0 -- TRUTH KERNEL.
+ *
+ *   "Many gates · one verdict · disagreement is signal, not noise."
+ *
+ * The pattern Mneme accumulated by v2.5: more than ten folders all
+ * answering the same family of question — "is this AI claim true?".
+ * Each carries a different sensor:
+ *   FLASH        — Veracity-Velocity Singularity over evidence weights
+ *   APOPTOSIS    — 7-witness fusion (file ∧ symbol ∧ type ∧ git ∧ test ∧ ...)
+ *   X-RAY        — surface-text hedging vs. absolutism
+ *   TWINS        — opposing-prior debate disagreement
+ * (additional sensors can be added — the kernel is sensor-agnostic.)
+ *
+ * Until now AI agents had to PICK which sensor to call. That's the
+ * wrong mental model. A truthful claim should look truthful to every
+ * sensor; a false claim is detected EARLIER when multiple sensors are
+ * fused. Mneme should ask the AI for a claim and run every sensor in
+ * parallel, then BAYESIAN-FUSE the verdicts into a single probability
+ * with calibrated weights.
+ *
+ * Wild move: DISAGREEMENT is itself the most valuable output. When
+ * apoptosis says HEALTHY and x-ray says LOW-CONFIDENCE, that conflict
+ * is a louder signal than either verdict alone. The kernel surfaces
+ * the disagreement, not just the fused score.
+ *
+ * Sensors stay independently callable (no breaking change). Kernel
+ * is a NEW SURFACE that composes them.
+ */
+/** Convert a sensor verdict into a probability that the claim is true.
+ *  TRUE  → confidence (clamp 0.5..1)
+ *  FALSE → 1 - confidence (clamp 0..0.5)
+ *  UNCERTAIN → 0.5 (no information)
+ *  INAPPLICABLE → 0.5 with weight 0 (effectively removed) */
+function verdictToProb(o) {
+    const c = Math.max(0, Math.min(1, o.confidence ?? 0));
+    switch (o.verdict) {
+        case "TRUE": return { p: 0.5 + 0.5 * c, informational: true };
+        case "FALSE": return { p: 0.5 - 0.5 * c, informational: true };
+        case "UNCERTAIN": return { p: 0.5, informational: false };
+        case "INAPPLICABLE": return { p: 0.5, informational: false };
+        default: return { p: 0.5, informational: false };
+    }
+}
+/** Run one sensor with a hard timeout. Always returns a verdict — on
+ *  timeout / throw, returns an UNCERTAIN sensor output so the kernel
+ *  stays robust. */
+async function runSensorSafe(s, claim, ctx, timeoutMs) {
+    const t0 = Date.now();
+    try {
+        const result = await Promise.race([
+            Promise.resolve(s.run(claim, ctx)),
+            new Promise((_resolve, reject) => setTimeout(() => reject(new Error("timeout")), timeoutMs)),
+        ]);
+        return { ...result, ms: result.ms ?? Date.now() - t0 };
+    }
+    catch (e) {
+        return { sensor: s.id, verdict: "UNCERTAIN", confidence: 0, rationale: `sensor failed: ${e.message?.slice(0, 80) ?? "unknown"}`, ms: Date.now() - t0 };
+    }
+}
+/** Weighted log-odds fusion with calibrated weights.
+ *  Each informational sensor contributes log(p/(1-p)) * weight; the sum
+ *  becomes the fused log-odds. Convert back with sigmoid. */
+function fuse(sensorOutputs, adapters) {
+    let logOdds = 0;
+    let informational = 0;
+    for (const o of sensorOutputs) {
+        const { p, informational: inf } = verdictToProb(o);
+        if (!inf)
+            continue;
+        const a = adapters.get(o.sensor);
+        const w = a?.weight ?? 1.0;
+        // Clamp p away from {0,1} to keep log-odds finite.
+        const pSafe = Math.min(0.999, Math.max(0.001, p));
+        logOdds += Math.log(pSafe / (1 - pSafe)) * w;
+        informational++;
+    }
+    if (informational === 0)
+        return { pTrue: 0.5, informationalCount: 0 };
+    const pTrue = 1 / (1 + Math.exp(-logOdds));
+    return { pTrue, informationalCount: informational };
+}
+/** Disagreement = WEIGHTED variance of per-sensor pTrue across informational
+ *  sensors, normalized to 0..1 (max weighted-variance is 0.25 when sensors
+ *  split evenly). Weighting matters: a low-weight outlier shouldn't
+ *  trigger DISPUTED when the high-weight sensors agree. */
+function disagreementScore(sensorOutputs, adapters) {
+    const ps = [];
+    for (const o of sensorOutputs) {
+        const { p, informational } = verdictToProb(o);
+        if (!informational)
+            continue;
+        const w = adapters.get(o.sensor)?.weight ?? 1;
+        if (w <= 0)
+            continue;
+        ps.push({ p, w });
+    }
+    if (ps.length < 2)
+        return 0;
+    const totalW = ps.reduce((acc, x) => acc + x.w, 0);
+    if (totalW <= 0)
+        return 0;
+    const mean = ps.reduce((acc, x) => acc + x.p * x.w, 0) / totalW;
+    const variance = ps.reduce((acc, x) => acc + x.w * (x.p - mean) ** 2, 0) / totalW;
+    return Math.min(1, variance / 0.25);
+}
+/** Pick the dominant / outlier sensors from the informational set. */
+function pickRoleSensors(sensorOutputs, adapters, pTrue) {
+    let dominantId;
+    let dominantPull = -Infinity;
+    let outlierId;
+    let outlierDist = -1;
+    for (const o of sensorOutputs) {
+        const { p, informational } = verdictToProb(o);
+        if (!informational)
+            continue;
+        const w = adapters.get(o.sensor)?.weight ?? 1;
+        // Dominant = strongest weighted log-odds contribution aligned with consensus.
+        const pSafe = Math.min(0.999, Math.max(0.001, p));
+        const contribution = (pTrue > 0.5 ? Math.log(pSafe / (1 - pSafe)) : -Math.log(pSafe / (1 - pSafe))) * w;
+        if (contribution > dominantPull) {
+            dominantPull = contribution;
+            dominantId = o.sensor;
+        }
+        // Outlier = furthest from consensus.
+        const dist = Math.abs(p - pTrue);
+        if (dist > outlierDist) {
+            outlierDist = dist;
+            outlierId = o.sensor;
+        }
+    }
+    return { dominant: dominantId, outlier: outlierId };
+}
+/** Run the kernel: fan out → fuse → label. */
+export async function checkTruth(input) {
+    if (input.sensors.length === 0) {
+        return { pTrue: 0.5, verdict: "INCONCLUSIVE", disagreement: 0, sensorOutputs: [], totalMs: 0 };
+    }
+    const t0 = Date.now();
+    const timeout = input.perSensorTimeoutMs ?? 5000;
+    const adapterMap = new Map();
+    for (const s of input.sensors)
+        adapterMap.set(s.id, s);
+    const sensorOutputs = await Promise.all(input.sensors.map((s) => runSensorSafe(s, input.claim, input.ctx, timeout)));
+    const { pTrue, informationalCount } = fuse(sensorOutputs, adapterMap);
+    const disagreement = disagreementScore(sensorOutputs, adapterMap);
+    const { dominant, outlier } = pickRoleSensors(sensorOutputs, adapterMap, pTrue);
+    let verdict;
+    if (informationalCount === 0) {
+        verdict = "INCONCLUSIVE";
+    }
+    else if (disagreement >= 0.5 && informationalCount >= 2) {
+        verdict = "DISPUTED";
+    }
+    else if (pTrue >= 0.75) {
+        verdict = "ACCEPTED";
+    }
+    else if (pTrue <= 0.25) {
+        verdict = "REJECTED";
+    }
+    else {
+        verdict = "INCONCLUSIVE";
+    }
+    return {
+        pTrue,
+        verdict,
+        disagreement,
+        sensorOutputs,
+        dominantSensor: dominant,
+        outlierSensor: outlier,
+        totalMs: Date.now() - t0,
+    };
+}
+/** Compact one-line pulse summary. */
+export function formatTruthKernelPulseLine(v) {
+    return `TRUTH-KERNEL · ${v.verdict} · pTrue=${v.pTrue.toFixed(2)} · disagree=${v.disagreement.toFixed(2)} · sensors=${v.sensorOutputs.length} · ${v.totalMs}ms`;
+}
+/** Calibrate sensor weights from historical (sensorOutput, groundTruth) pairs.
+ *  Returns a new weight map; higher weight = sensor was more often right.
+ *
+ *  Simple algorithm: weight = max(0.1, accuracy * 2) so a 50% sensor → 1.0,
+ *  a perfect sensor → 2.0, a random sensor → 1.0. Caps at 2.0 to avoid
+ *  any single sensor dominating the log-odds sum. */
+export function calibrateWeights(history) {
+    const tallies = new Map();
+    for (const h of history) {
+        const t = tallies.get(h.sensor) ?? { right: 0, total: 0 };
+        t.total++;
+        if (h.verdictWasCorrect)
+            t.right++;
+        tallies.set(h.sensor, t);
+    }
+    const weights = new Map();
+    for (const [sensor, t] of tallies) {
+        if (t.total === 0)
+            continue;
+        const acc = t.right / t.total;
+        const w = Math.max(0.1, Math.min(2.0, acc * 2));
+        weights.set(sensor, w);
+    }
+    return weights;
+}
+//# sourceMappingURL=index.js.map

package/dist/truth_kernel/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/truth_kernel/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAuDH;;;;6DAI6D;AAC7D,SAAS,aAAa,CAAC,CAAe;IACpC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;IACtD,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,CAAS,OAAO,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;QACtE,KAAK,OAAO,CAAC,CAAQ,OAAO,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;QACtE,KAAK,WAAW,CAAC,CAAI,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;QAC7D,KAAK,cAAc,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;QAC7D,OAAO,CAAC,CAAa,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;IAC/D,CAAC;AACH,CAAC;AAED;;oBAEoB;AACpB,KAAK,UAAU,aAAa,CAAC,CAAgB,EAAE,KAAa,EAAE,GAAwC,EAAE,SAAiB;IACvH,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;YAChC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAClC,IAAI,OAAO,CAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;SAC3G,CAAC,CAAC;QACH,OAAO,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;IACzD,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,kBAAmB,CAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,SAAS,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;IACpK,CAAC;AACH,CAAC;AAED;;6DAE6D;AAC7D,SAAS,IAAI,CAAC,aAA6B,EAAE,QAA4C;IACvF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,IAAI,GAAG,CAAC;QAC3B,mDAAmD;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7C,aAAa,EAAE,CAAC;IAClB,CAAC;IACD,IAAI,aAAa,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC;IACtE,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3C,OAAO,EAAE,KAAK,EAAE,kBAAkB,EAAE,aAAa,EAAE,CAAC;AACtD,CAAC;AAED;;;2DAG2D;AAC3D,SAAS,iBAAiB,CAAC,aAA6B,EAAE,QAA4C;IACpG,MAAM,EAAE,GAAoC,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,aAAa;YAAE,SAAS;QAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACrB,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;IAChE,MAAM,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;IAClF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,sEAAsE;AACtE,SAAS,eAAe,CAAC,aAA6B,EAAE,QAA4C,EAAE,KAAa;IACjH,IAAI,UAA8B,CAAC;IACnC,IAAI,YAAY,GAAG,CAAC,QAAQ,CAAC;IAC7B,IAAI,SAA6B,CAAC;IAClC,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,aAAa;YAAE,SAAS;QAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QAC9C,8EAA8E;QAC9E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,YAAY,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACxG,IAAI,YAAY,GAAG,YAAY,EAAE,CAAC;YAAC,YAAY,GAAG,YAAY,CAAC;YAAC,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;QAAC,CAAC;QACxF,qCAAqC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QACjC,IAAI,IAAI,GAAG,WAAW,EAAE,CAAC;YAAC,WAAW,GAAG,IAAI,CAAC;YAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC;QAAC,CAAC;IACvE,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AACtD,CAAC;AAED,8CAA8C;AAC9C,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,KAAuB;IACtD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IACjG,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,MAAM,OAAO,GAAG,KAAK,CAAC,kBAAkB,IAAI,IAAI,CAAC;IACjD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO;QAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACrH,MAAM,EAAE,KAAK,EAAE,kBAAkB,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IACtE,MAAM,YAAY,GAAG,iBAAiB,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;IAClE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,eAAe,CAAC,aAAa,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IAChF,IAAI,OAAgC,CAAC;IACrC,IAAI,kBAAkB,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,GAAG,cAAc,CAAC;IAC3B,CAAC;SAAM,IAAI,YAAY,IAAI,GAAG,IAAI,kBAAkB,IAAI,CAAC,EAAE,CAAC;QAC1D,OAAO,GAAG,UAAU,CAAC;IACvB,CAAC;SAAM,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,OAAO,GAAG,UAAU,CAAC;IACvB,CAAC;SAAM,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,OAAO,GAAG,UAAU,CAAC;IACvB,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,cAAc,CAAC;IAC3B,CAAC;IACD,OAAO;QACL,KAAK;QACL,OAAO;QACP,YAAY;QACZ,aAAa;QACb,cAAc,EAAE,QAAQ;QACxB,aAAa,EAAE,OAAO;QACtB,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE;KACzB,CAAC;AACJ,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,0BAA0B,CAAC,CAAe;IACxD,OAAO,kBAAkB,CAAC,CAAC,OAAO,YAAY,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,aAAa,CAAC,MAAM,MAAM,CAAC,CAAC,OAAO,IAAI,CAAC;AAClK,CAAC;AAED;;;;;qDAKqD;AACrD,MAAM,UAAU,gBAAgB,CAAC,OAAsE;IACrG,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4C,CAAC;IACpE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC1D,CAAC,CAAC,KAAK,EAAE,CAAC;QACV,IAAI,CAAC,CAAC,iBAAiB;YAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC;YAAE,SAAS;QAC5B,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/truth_kernel/truth_kernel.test.d.ts

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

package/dist/truth_kernel/truth_kernel.test.d.ts.map

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

package/dist/truth_kernel/truth_kernel.test.js

@@ -0,0 +1,126 @@
+import { describe, it, expect } from "vitest";
+import { checkTruth, calibrateWeights, formatTruthKernelPulseLine } from "./index.js";
+function makeSensor(id, verdict, confidence, weight = 1) {
+    return { id, weight, run: () => ({ sensor: id, verdict, confidence }) };
+}
+describe("v2.6 TRUTH KERNEL · fusion", () => {
+    it("two confident TRUE sensors → ACCEPTED with high pTrue", async () => {
+        const r = await checkTruth({
+            claim: "the sky is blue",
+            sensors: [makeSensor("flash", "TRUE", 0.9), makeSensor("apoptosis", "TRUE", 0.85)],
+        });
+        expect(r.verdict).toBe("ACCEPTED");
+        expect(r.pTrue).toBeGreaterThan(0.9);
+        expect(r.disagreement).toBeLessThan(0.05);
+    });
+    it("two confident FALSE sensors → REJECTED with low pTrue", async () => {
+        const r = await checkTruth({
+            claim: "the sky is green",
+            sensors: [makeSensor("flash", "FALSE", 0.9), makeSensor("apoptosis", "FALSE", 0.9)],
+        });
+        expect(r.verdict).toBe("REJECTED");
+        expect(r.pTrue).toBeLessThan(0.1);
+    });
+    it("conflicting sensors → DISPUTED with high disagreement", async () => {
+        const r = await checkTruth({
+            claim: "ambiguous claim",
+            sensors: [makeSensor("flash", "TRUE", 0.9), makeSensor("apoptosis", "FALSE", 0.9)],
+        });
+        expect(r.verdict).toBe("DISPUTED");
+        expect(r.disagreement).toBeGreaterThan(0.5);
+        expect(r.outlierSensor).toBeDefined();
+    });
+    it("all UNCERTAIN sensors → INCONCLUSIVE", async () => {
+        const r = await checkTruth({
+            claim: "x",
+            sensors: [makeSensor("a", "UNCERTAIN", 0), makeSensor("b", "UNCERTAIN", 0)],
+        });
+        expect(r.verdict).toBe("INCONCLUSIVE");
+        expect(r.pTrue).toBeCloseTo(0.5, 2);
+    });
+    it("INAPPLICABLE sensors are excluded from fusion", async () => {
+        const r = await checkTruth({
+            claim: "x",
+            sensors: [makeSensor("a", "TRUE", 0.95), makeSensor("b", "INAPPLICABLE", 0)],
+        });
+        expect(r.verdict).toBe("ACCEPTED");
+        expect(r.pTrue).toBeGreaterThan(0.9);
+    });
+    it("higher-weight sensor dominates the fused verdict", async () => {
+        const r = await checkTruth({
+            claim: "tie-breaker test",
+            sensors: [makeSensor("trustworthy", "TRUE", 0.9, 2.0), makeSensor("flaky", "FALSE", 0.9, 0.2)],
+        });
+        expect(r.verdict).toBe("ACCEPTED");
+        expect(r.pTrue).toBeGreaterThan(0.5);
+        expect(r.dominantSensor).toBe("trustworthy");
+    });
+    it("empty sensor list → INCONCLUSIVE", async () => {
+        const r = await checkTruth({ claim: "x", sensors: [] });
+        expect(r.verdict).toBe("INCONCLUSIVE");
+    });
+    it("crashing sensor degrades to UNCERTAIN gracefully", async () => {
+        const crashy = {
+            id: "crashy",
+            run: () => { throw new Error("kaboom"); },
+        };
+        const r = await checkTruth({
+            claim: "x",
+            sensors: [makeSensor("ok", "TRUE", 0.9), crashy],
+        });
+        // Crashy sensor is non-informational → ok sensor drives the verdict.
+        expect(r.verdict).toBe("ACCEPTED");
+        const crashOut = r.sensorOutputs.find((o) => o.sensor === "crashy");
+        expect(crashOut?.verdict).toBe("UNCERTAIN");
+    });
+    it("slow sensor times out without blocking the kernel", async () => {
+        const slow = {
+            id: "slow",
+            run: () => new Promise((resolve) => setTimeout(() => resolve({ sensor: "slow", verdict: "TRUE", confidence: 1 }), 200)),
+        };
+        const r = await checkTruth({
+            claim: "x",
+            sensors: [makeSensor("fast", "TRUE", 0.9), slow],
+            perSensorTimeoutMs: 50,
+        });
+        const slowOut = r.sensorOutputs.find((o) => o.sensor === "slow");
+        expect(slowOut?.verdict).toBe("UNCERTAIN");
+        expect(r.verdict).toBe("ACCEPTED"); // fast sensor still drives the verdict
+    });
+});
+describe("v2.6 TRUTH KERNEL · calibration", () => {
+    it("perfectly-accurate sensor gets weight 2.0", () => {
+        const history = Array.from({ length: 10 }, () => ({ sensor: "perfect", verdictWasCorrect: true }));
+        const w = calibrateWeights(history);
+        expect(w.get("perfect")).toBe(2.0);
+    });
+    it("50%-accurate sensor gets weight 1.0", () => {
+        const history = [
+            ...Array.from({ length: 5 }, () => ({ sensor: "average", verdictWasCorrect: true })),
+            ...Array.from({ length: 5 }, () => ({ sensor: "average", verdictWasCorrect: false })),
+        ];
+        const w = calibrateWeights(history);
+        expect(w.get("average")).toBeCloseTo(1.0, 2);
+    });
+    it("always-wrong sensor gets weight floor 0.1", () => {
+        const history = Array.from({ length: 10 }, () => ({ sensor: "wrong", verdictWasCorrect: false }));
+        const w = calibrateWeights(history);
+        expect(w.get("wrong")).toBe(0.1);
+    });
+    it("empty history → empty weight map", () => {
+        expect(calibrateWeights([]).size).toBe(0);
+    });
+});
+describe("v2.6 TRUTH KERNEL · pulse", () => {
+    it("formatTruthKernelPulseLine produces a compact summary", async () => {
+        const r = await checkTruth({
+            claim: "x",
+            sensors: [makeSensor("a", "TRUE", 0.9)],
+        });
+        const line = formatTruthKernelPulseLine(r);
+        expect(line).toContain("TRUTH-KERNEL");
+        expect(line).toContain("ACCEPTED");
+        expect(line).toContain("pTrue=");
+    });
+});
+//# sourceMappingURL=truth_kernel.test.js.map

package/dist/truth_kernel/truth_kernel.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"truth_kernel.test.js","sourceRoot":"","sources":["../../src/truth_kernel/truth_kernel.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,0BAA0B,EAAsB,MAAM,YAAY,CAAC;AAE1G,SAAS,UAAU,CAAC,EAAU,EAAE,OAAwD,EAAE,UAAkB,EAAE,MAAM,GAAG,CAAC;IACtH,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;AAC1E,CAAC;AAED,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,iBAAiB;YACxB,OAAO,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;SACnF,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,kBAAkB;YACzB,OAAO,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,WAAW,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;SACpF,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,iBAAiB;YACxB,OAAO,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,WAAW,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;SACnF,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,WAAW,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACpD,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,GAAG;YACV,OAAO,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;SAC5E,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,GAAG;YACV,OAAO,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU,CAAC,GAAG,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;SAC7E,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;QAChE,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,kBAAkB;YACzB,OAAO,EAAE,CAAC,UAAU,CAAC,aAAa,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;SAC/F,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;QAChD,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACxD,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;QAChE,MAAM,MAAM,GAAkB;YAC5B,EAAE,EAAE,QAAQ;YACZ,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SAC1C,CAAC;QACF,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,GAAG;YACV,OAAO,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC;SACjD,CAAC,CAAC;QACH,qEAAqE;QACrE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACjE,MAAM,IAAI,GAAkB;YAC1B,EAAE,EAAE,MAAM;YACV,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;SACxH,CAAC;QACF,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,GAAG;YACV,OAAO,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC;YAChD,kBAAkB,EAAE,EAAE;SACvB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QACjE,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,uCAAuC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACnG,MAAM,CAAC,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG;YACd,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC;YACpF,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC,CAAC;SACtF,CAAC;QACF,MAAM,CAAC,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAClG,MAAM,CAAC,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,EAAE,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,CAAC,GAAG,MAAM,UAAU,CAAC;YACzB,KAAK,EAAE,GAAG;YACV,OAAO,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;SACxC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,0BAA0B,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/wormhole/index.d.ts

@@ -0,0 +1,112 @@
+/**
+ * v2.6.0 -- WORMHOLE: channel auto-negotiation for cross-device sync.
+ *
+ *   "One call · every channel races · fastest live channel wins."
+ *
+ * The pattern Mneme accumulated by v2.5: more than ten folders all
+ * answering the same family of question — "how do I move this brain
+ * to another device / vendor?":
+ *   ANCHOR    — parent-pole / child-rope identity
+ *   AURA      — same-WiFi owner-only pairing
+ *   RELAY     — anonymous public paste services
+ *   CHAMELEON — environment-adaptive transport selection
+ *   RAINBOW   — multi-channel handoff orchestrator
+ *   SYNAPSE   — short-code + QR
+ *   CONDUIT   — phantom-exec cross-vendor loop
+ *   PERMEATE  — userscript + bookmarklet route-around
+ *   DIASPORA  — gitignore + spore + HTTP bridge
+ *   ABYSS     — capsule TTL + replay
+ *   SEAMLESS  — voice directive
+ *
+ * The receiving AI never had a UNIFIED entry. WORMHOLE is that entry.
+ *
+ * Design — modeled on ICE/STUN/TURN connectivity establishment:
+ *   1. Caller asks: "send this payload to peer X with quality Q".
+ *   2. WORMHOLE enumerates registered CHANNELS (each wraps one of the
+ *      existing transport modules).
+ *   3. Channels marked `probe: () => boolean` are pinged in parallel
+ *      with a hard timeout. Live ones survive.
+ *   4. Among live channels, WORMHOLE sorts by ADAPTIVE SCORE (recent
+ *      success rate × inverse latency × user preference).
+ *   5. The first channel to successfully `send()` wins; the rest are
+ *      cancelled. WORMHOLE records the outcome (success/latency) for
+ *      the next negotiation's score.
+ *
+ * Wild move: the score is not static. Channels that worked yesterday
+ * but flake today see their weight decay fast (~30-trial half-life).
+ * A WiFi pairing channel scores high on a home network, low on a
+ * coffee-shop captive portal — without anyone configuring anything.
+ *
+ * Transports stay independently usable (no breaking change). WORMHOLE
+ * is a NEW SURFACE that composes them.
+ */
+export type ChannelProbeResult = "available" | "unavailable" | "needs-pairing";
+export interface Channel<Payload, Receipt> {
+    /** Stable id used in scoring + reporting. */
+    id: string;
+    /** Higher = caller would prefer this channel if all else equal. */
+    preference?: number;
+    /** Cheap availability probe. Must return within probeTimeoutMs. */
+    probe: (ctx?: Record<string, unknown>) => Promise<ChannelProbeResult> | ChannelProbeResult;
+    /** Heavy operation: actually move the payload. Must never throw —
+     *  return { ok: false, reason } instead. */
+    send: (payload: Payload, ctx?: Record<string, unknown>) => Promise<{
+        ok: true;
+        receipt: Receipt;
+    } | {
+        ok: false;
+        reason: string;
+    }>;
+}
+export interface ChannelTrial {
+    channel: string;
+    outcome: "succeeded" | "failed" | "unavailable" | "needs-pairing";
+    ms: number;
+    reason?: string;
+    ts: number;
+}
+export interface WormholeNegotiation<Receipt> {
+    /** Channel that won the race. null if every channel failed. */
+    winner: string | null;
+    /** Receipt from the winning channel. */
+    receipt: Receipt | null;
+    /** Per-channel trial detail for the AI to surface to the user. */
+    trials: ChannelTrial[];
+    /** Total wall-clock ms. */
+    totalMs: number;
+    /** Adaptive score of each channel at the moment of negotiation. */
+    scoresAtNegotiation: Record<string, number>;
+}
+/** Persisted-by-caller stats; WORMHOLE never writes to disk itself. */
+export interface ChannelStats {
+    channel: string;
+    trials: number;
+    succeeded: number;
+    /** Exponentially-weighted recent success rate (recency = newer trials weigh more). */
+    ewmaSuccess: number;
+    /** Exponentially-weighted recent latency in ms. */
+    ewmaLatencyMs: number;
+}
+/** Update channel stats with one new trial. Returns the new stats
+ *  object — callers persist this (e.g. into .mneme/wormhole-stats.json). */
+export declare function ingestTrial(prev: ChannelStats | undefined, trial: ChannelTrial): ChannelStats;
+export interface WormholeInput<Payload, Receipt> {
+    payload: Payload;
+    channels: ReadonlyArray<Channel<Payload, Receipt>>;
+    /** Caller-supplied stats keyed by channel id. Undefined entries → cold start. */
+    stats?: Record<string, ChannelStats>;
+    /** Context passed verbatim to probe + send. */
+    ctx?: Record<string, unknown>;
+    /** Hard timeout per probe. Default 1500ms. */
+    probeTimeoutMs?: number;
+    /** Hard timeout per send. Default 15000ms. */
+    sendTimeoutMs?: number;
+    /** Maximum channels to try simultaneously during the send phase.
+     *  Default 3 — keeps bandwidth + cost bounded. */
+    concurrency?: number;
+}
+/** Run the negotiation. Returns the winning channel's receipt or null. */
+export declare function sendViaWormhole<Payload, Receipt>(input: WormholeInput<Payload, Receipt>): Promise<WormholeNegotiation<Receipt>>;
+/** Compact one-line pulse summary. */
+export declare function formatWormholePulseLine<R>(n: WormholeNegotiation<R>): string;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/wormhole/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAEH,MAAM,MAAM,kBAAkB,GAAG,WAAW,GAAG,aAAa,GAAG,eAAe,CAAC;AAE/E,MAAM,WAAW,OAAO,CAAC,OAAO,EAAE,OAAO;IACvC,6CAA6C;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,mEAAmE;IACnE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mEAAmE;IACnE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC,kBAAkB,CAAC,GAAG,kBAAkB,CAAC;IAC3F;gDAC4C;IAC5C,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC;QAAE,EAAE,EAAE,IAAI,CAAC;QAAC,OAAO,EAAE,OAAO,CAAA;KAAE,GAAG;QAAE,EAAE,EAAE,KAAK,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACpI;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,WAAW,GAAG,QAAQ,GAAG,aAAa,GAAG,eAAe,CAAC;IAClE,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,mBAAmB,CAAC,OAAO;IAC1C,+DAA+D;IAC/D,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,wCAAwC;IACxC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IACxB,kEAAkE;IAClE,MAAM,EAAE,YAAY,EAAE,CAAC;IACvB,2BAA2B;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,mEAAmE;IACnE,mBAAmB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7C;AAED,uEAAuE;AACvE,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,sFAAsF;IACtF,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,aAAa,EAAE,MAAM,CAAC;CACvB;AAID;4EAC4E;AAC5E,wBAAgB,WAAW,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,EAAE,KAAK,EAAE,YAAY,GAAG,YAAY,CAO7F;AAYD,MAAM,WAAW,aAAa,CAAC,OAAO,EAAE,OAAO;IAC7C,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACnD,iFAAiF;IACjF,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACrC,+CAA+C;IAC/C,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,8CAA8C;IAC9C,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,8CAA8C;IAC9C,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;sDACkD;IAClD,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAcD,0EAA0E;AAC1E,wBAAsB,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAsErI;AAED,sCAAsC;AACtC,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,GAAG,MAAM,CAG5E"}