@mneme-ai/core 1.93.0 → 1.94.0

package/dist/qx_supernova/infinity_memory.d.ts

@@ -0,0 +1,67 @@
+/**
+ * v1.94.0 -- QX-SUPERNOVA · Infinity Memory Layer
+ *
+ * Where lineage stores FILES + commits, the Infinity layer stores
+ * EVENTS — each with a probability vector frozen at the moment it
+ * happened. So when you recall "why did the team migrate to Postgres",
+ * you don't just get the commit; you get the signal field that made
+ * the decision: which competing options were considered, their
+ * posterior weights at the time, and which outcome materialized.
+ *
+ * Quantum trace = the snapshot of the probability vector persists
+ * forever, even after the event itself fades from RAM. Recall is
+ * O(log n) on the in-memory index.
+ *
+ * Pure in-memory + JSON-persistable. No network. No telemetry.
+ */
+import { type SignalVector, type CollapseResult } from "./quantum_core.js";
+export type EventOutcome = "success" | "failure" | "pending" | "unknown";
+export interface QuantumEvent {
+    /** Stable id (sha256 prefix of kind+ts+actors). */
+    id: string;
+    ts: number;
+    /** Event class, e.g. "decision", "regret", "vaccine-fire", "burst". */
+    kind: string;
+    /** People / vendors / files involved. */
+    actors: string[];
+    /** Frozen probability vector at the moment of the event. */
+    probabilityVector: SignalVector;
+    /** Outcome assigned (can be filled in later via mark). */
+    outcome: EventOutcome;
+    /** Free-form narrative — what happened, why. */
+    trace: string;
+}
+export interface RecallQuery {
+    kind?: string;
+    actor?: string;
+    outcome?: EventOutcome;
+    /** Only events with ts >= sinceMs. */
+    sinceMs?: number;
+    /** Only events with ts <= untilMs. */
+    untilMs?: number;
+    /** Cap results. */
+    limit?: number;
+}
+export interface InfinityMemory {
+    /** Append an event. */
+    record(event: Omit<QuantumEvent, "id">): QuantumEvent;
+    /** Filter recall — newest first. */
+    recall(q: RecallQuery): QuantumEvent[];
+    /** Mark outcome retroactively (e.g. after we know "decision" succeeded). */
+    mark(id: string, outcome: EventOutcome): boolean;
+    /** All events. */
+    list(): QuantumEvent[];
+    /** Treat matching events as hypotheses and pick the most-probable one. */
+    collapse(q: RecallQuery): CollapseResult<QuantumEvent>;
+    /** Persist to disk (JSONL). */
+    flushTo(path: string): void;
+    /** Load from disk (JSONL). */
+    loadFrom(path: string): number;
+    /** Probability recall precision @ k — used by the benchmark. */
+    precisionAtK(query: RecallQuery, expected: string[], k: number): number;
+}
+export declare function createInfinityMemory(): InfinityMemory;
+/** Convenience: append a single event to a JSONL file without keeping
+ *  the whole index in memory (for the daemon's event log). */
+export declare function appendEventToFile(path: string, e: QuantumEvent): void;
+//# sourceMappingURL=infinity_memory.d.ts.map

package/dist/qx_supernova/infinity_memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"infinity_memory.d.ts","sourceRoot":"","sources":["../../src/qx_supernova/infinity_memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH,OAAO,EAEL,KAAK,YAAY,EAEjB,KAAK,cAAc,EACpB,MAAM,mBAAmB,CAAC;AAE3B,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAEzE,MAAM,WAAW,YAAY;IAC3B,mDAAmD;IACnD,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb,yCAAyC;IACzC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,4DAA4D;IAC5D,iBAAiB,EAAE,YAAY,CAAC;IAChC,0DAA0D;IAC1D,OAAO,EAAE,YAAY,CAAC;IACtB,gDAAgD;IAChD,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,YAAY,CAAC;IACvB,sCAAsC;IACtC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,sCAAsC;IACtC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,mBAAmB;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,cAAc;IAC7B,uBAAuB;IACvB,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,GAAG,YAAY,CAAC;IACtD,oCAAoC;IACpC,MAAM,CAAC,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE,CAAC;IACvC,4EAA4E;IAC5E,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,GAAG,OAAO,CAAC;IACjD,kBAAkB;IAClB,IAAI,IAAI,YAAY,EAAE,CAAC;IACvB,0EAA0E;IAC1E,QAAQ,CAAC,CAAC,EAAE,WAAW,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC;IACvD,+BAA+B;IAC/B,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,8BAA8B;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,gEAAgE;IAChE,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACzE;AAED,wBAAgB,oBAAoB,IAAI,cAAc,CA+ErD;AAED;8DAC8D;AAC9D,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,GAAG,IAAI,CAIrE"}

package/dist/qx_supernova/infinity_memory.js

@@ -0,0 +1,119 @@
+/**
+ * v1.94.0 -- QX-SUPERNOVA · Infinity Memory Layer
+ *
+ * Where lineage stores FILES + commits, the Infinity layer stores
+ * EVENTS — each with a probability vector frozen at the moment it
+ * happened. So when you recall "why did the team migrate to Postgres",
+ * you don't just get the commit; you get the signal field that made
+ * the decision: which competing options were considered, their
+ * posterior weights at the time, and which outcome materialized.
+ *
+ * Quantum trace = the snapshot of the probability vector persists
+ * forever, even after the event itself fades from RAM. Recall is
+ * O(log n) on the in-memory index.
+ *
+ * Pure in-memory + JSON-persistable. No network. No telemetry.
+ */
+import { createHash } from "node:crypto";
+import { existsSync, readFileSync, writeFileSync, appendFileSync, mkdirSync } from "node:fs";
+import { dirname } from "node:path";
+import { collapseProbabilityMatrix, } from "./quantum_core.js";
+export function createInfinityMemory() {
+    const events = [];
+    function makeId(e) {
+        const seed = `${e.kind}::${e.ts}::${e.actors.join(",")}`;
+        return createHash("sha256").update(seed).digest("hex").slice(0, 14);
+    }
+    function matches(e, q) {
+        if (q.kind && e.kind !== q.kind)
+            return false;
+        if (q.actor && !e.actors.includes(q.actor))
+            return false;
+        if (q.outcome && e.outcome !== q.outcome)
+            return false;
+        if (q.sinceMs !== undefined && e.ts < q.sinceMs)
+            return false;
+        if (q.untilMs !== undefined && e.ts > q.untilMs)
+            return false;
+        return true;
+    }
+    return {
+        record(e) {
+            const id = makeId(e);
+            const event = { ...e, id };
+            events.push(event);
+            return event;
+        },
+        recall(q) {
+            const out = events.filter((e) => matches(e, q));
+            out.sort((a, b) => b.ts - a.ts);
+            return q.limit ? out.slice(0, q.limit) : out;
+        },
+        mark(id, outcome) {
+            const e = events.find((x) => x.id === id);
+            if (!e)
+                return false;
+            e.outcome = outcome;
+            return true;
+        },
+        list() {
+            return events.slice();
+        },
+        collapse(q) {
+            const matching = events.filter((e) => matches(e, q));
+            if (matching.length === 0) {
+                return collapseProbabilityMatrix([], {});
+            }
+            const hyps = matching.map((e) => ({
+                id: e.id,
+                value: e,
+                signals: e.probabilityVector,
+            }));
+            return collapseProbabilityMatrix(hyps, {});
+        },
+        flushTo(path) {
+            const dir = dirname(path);
+            if (!existsSync(dir))
+                mkdirSync(dir, { recursive: true });
+            const buf = events.map((e) => JSON.stringify(e)).join("\n") + (events.length ? "\n" : "");
+            writeFileSync(path, buf, "utf8");
+        },
+        loadFrom(path) {
+            if (!existsSync(path))
+                return 0;
+            const txt = readFileSync(path, "utf8");
+            let loaded = 0;
+            for (const line of txt.split(/\r?\n/)) {
+                if (!line.trim())
+                    continue;
+                try {
+                    events.push(JSON.parse(line));
+                    loaded++;
+                }
+                catch {
+                    // skip malformed
+                }
+            }
+            return loaded;
+        },
+        precisionAtK(query, expectedIds, k) {
+            if (k <= 0)
+                return 0;
+            const got = this.recall({ ...query, limit: k }).map((e) => e.id);
+            let hits = 0;
+            for (const id of got)
+                if (expectedIds.includes(id))
+                    hits++;
+            return hits / k;
+        },
+    };
+}
+/** Convenience: append a single event to a JSONL file without keeping
+ *  the whole index in memory (for the daemon's event log). */
+export function appendEventToFile(path, e) {
+    const dir = dirname(path);
+    if (!existsSync(dir))
+        mkdirSync(dir, { recursive: true });
+    appendFileSync(path, JSON.stringify(e) + "\n", "utf8");
+}
+//# sourceMappingURL=infinity_memory.js.map

package/dist/qx_supernova/infinity_memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"infinity_memory.js","sourceRoot":"","sources":["../../src/qx_supernova/infinity_memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,OAAO,EACL,yBAAyB,GAI1B,MAAM,mBAAmB,CAAC;AAmD3B,MAAM,UAAU,oBAAoB;IAClC,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,SAAS,MAAM,CAAC,CAA2B;QACzC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACzD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtE,CAAC;IAED,SAAS,OAAO,CAAC,CAAe,EAAE,CAAc;QAC9C,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC9C,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACzD,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QACvD,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAC9D,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,MAAM,CAAC,CAAC;YACN,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAiB,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,CAAC;YACN,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,EAAE,EAAE,OAAO;YACd,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI;YACF,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QACD,QAAQ,CAAC,CAAC;YACR,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,CAAC;YACD,MAAM,IAAI,GAA+B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC5D,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,CAAC;gBACR,OAAO,EAAE,CAAC,CAAC,iBAAiB;aAC7B,CAAC,CAAC,CAAC;YACJ,OAAO,yBAAyB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,CAAC,IAAI;YACV,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1D,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1F,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;QACD,QAAQ,CAAC,IAAI;YACX,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACvC,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;oBAAE,SAAS;gBAC3B,IAAI,CAAC;oBACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAiB,CAAC,CAAC;oBAC9C,MAAM,EAAE,CAAC;gBACX,CAAC;gBAAC,MAAM,CAAC;oBACP,iBAAiB;gBACnB,CAAC;YACH,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;YACrB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjE,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAAE,IAAI,EAAE,CAAC;YAC3D,OAAO,IAAI,GAAG,CAAC,CAAC;QAClB,CAAC;KACF,CAAC;AACJ,CAAC;AAED;8DAC8D;AAC9D,MAAM,UAAU,iBAAiB,CAAC,IAAY,EAAE,CAAe;IAC7D,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC;AACzD,CAAC"}

package/dist/qx_supernova/quantum_core.d.ts

@@ -0,0 +1,71 @@
+/**
+ * v1.94.0 -- QX-SUPERNOVA · QUANTUM CORE
+ * The Probability Collapse Matrix.
+ *
+ * Replace CPU/GPU mental model: instead of evaluating ONE hypothesis,
+ * the Quantum Core takes N hypotheses with a multi-signal vector each,
+ * fuses signals into a posterior, and COLLAPSES to the winner with a
+ * measurable margin + entropy reading.
+ *
+ * Why this is not vapor:
+ *   1. Bayes fusion of independent signals is a real, well-known math
+ *      operation. We just give it a cosmic name + plug it into Mneme.
+ *   2. Margin + entropy let downstream code REFUSE to commit when the
+ *      collapse is too uncertain — instead of guessing, return UNCERTAIN.
+ *   3. Pure functions. Deterministic. Unit-testable. Same inputs → same
+ *      collapse forever.
+ *
+ *   "When computation becomes a cosmic event."
+ */
+export type SignalVector = Record<string, number>;
+export interface Hypothesis<T = unknown> {
+    /** Stable id for telemetry. */
+    id: string;
+    /** The candidate value being scored. */
+    value: T;
+    /** Prior probability before signals are fused. 0..1. Default 1/N. */
+    prior?: number;
+    /** Per-axis scores 0..1. Higher = more supportive of this hypothesis. */
+    signals: SignalVector;
+}
+export interface CollapseOptions {
+    /** Per-axis weights. Default: each axis weighted equally (1.0). */
+    weights?: Record<string, number>;
+    /** Floor on posterior to avoid log(0). Default 1e-9. */
+    epsilon?: number;
+    /** If margin < this, verdict is UNCERTAIN. Default 0.05. */
+    uncertaintyMargin?: number;
+}
+export type CollapseVerdict = "COLLAPSED" | "UNCERTAIN" | "DEGENERATE";
+export interface CollapseResult<T = unknown> {
+    verdict: CollapseVerdict;
+    winner: Hypothesis<T> | null;
+    /** Posterior of the winner, 0..1. */
+    posterior: number;
+    /** posterior(winner) - posterior(runner-up). High margin = confident. */
+    margin: number;
+    /** Shannon entropy across all posteriors. Lower = more confident. */
+    entropy: number;
+    /** Normalized entropy (entropy / log2(N)) — 0..1. */
+    entropyNormalized: number;
+    /** All hypotheses sorted by posterior desc, each with the fused score. */
+    ranked: Array<Hypothesis<T> & {
+        posterior: number;
+    }>;
+    /** Reason string for UNCERTAIN / DEGENERATE verdicts. */
+    reason?: string;
+}
+/** Core algorithm: fuse signals × weights × prior into a posterior, then
+ *  collapse to the winner with margin + entropy report.
+ *
+ *  Math: posterior_i ∝ prior_i × Π_axis ( signal_i,axis ^ weight_axis )
+ *  Normalized so Σ posteriors = 1. Entropy computed over normalized vec.
+ */
+export declare function collapseProbabilityMatrix<T>(hypotheses: readonly Hypothesis<T>[], opts?: CollapseOptions): CollapseResult<T>;
+/** Re-collapse with adjusted weights — used by the re-engineer loop to
+ *  tune signal weights based on benchmark feedback. */
+export declare function recollapseWithWeights<T>(hypotheses: readonly Hypothesis<T>[], weights: Record<string, number>, opts?: Omit<CollapseOptions, "weights">): CollapseResult<T>;
+/** Compute a confidence score 0..1 from a CollapseResult. Used by
+ *  callers that just want a single number. */
+export declare function confidenceOf(r: CollapseResult<unknown>): number;
+//# sourceMappingURL=quantum_core.d.ts.map

package/dist/qx_supernova/quantum_core.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantum_core.d.ts","sourceRoot":"","sources":["../../src/qx_supernova/quantum_core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAElD,MAAM,WAAW,UAAU,CAAC,CAAC,GAAG,OAAO;IACrC,+BAA+B;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,wCAAwC;IACxC,KAAK,EAAE,CAAC,CAAC;IACT,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,yEAAyE;IACzE,OAAO,EAAE,YAAY,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC9B,mEAAmE;IACnE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,wDAAwD;IACxD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,4DAA4D;IAC5D,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG,WAAW,GAAG,YAAY,CAAC;AAEvE,MAAM,WAAW,cAAc,CAAC,CAAC,GAAG,OAAO;IACzC,OAAO,EAAE,eAAe,CAAC;IACzB,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAC7B,qCAAqC;IACrC,SAAS,EAAE,MAAM,CAAC;IAClB,yEAAyE;IACzE,MAAM,EAAE,MAAM,CAAC;IACf,qEAAqE;IACrE,OAAO,EAAE,MAAM,CAAC;IAChB,qDAAqD;IACrD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,0EAA0E;IAC1E,MAAM,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG;QAAE,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACrD,yDAAyD;IACzD,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;GAKG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EACzC,UAAU,EAAE,SAAS,UAAU,CAAC,CAAC,CAAC,EAAE,EACpC,IAAI,GAAE,eAAoB,GACzB,cAAc,CAAC,CAAC,CAAC,CAkGnB;AAED;uDACuD;AACvD,wBAAgB,qBAAqB,CAAC,CAAC,EACrC,UAAU,EAAE,SAAS,UAAU,CAAC,CAAC,CAAC,EAAE,EACpC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAC/B,IAAI,GAAE,IAAI,CAAC,eAAe,EAAE,SAAS,CAAM,GAC1C,cAAc,CAAC,CAAC,CAAC,CAEnB;AAED;8CAC8C;AAC9C,wBAAgB,YAAY,CAAC,CAAC,EAAE,cAAc,CAAC,OAAO,CAAC,GAAG,MAAM,CAK/D"}

package/dist/qx_supernova/quantum_core.js

@@ -0,0 +1,134 @@
+/**
+ * v1.94.0 -- QX-SUPERNOVA · QUANTUM CORE
+ * The Probability Collapse Matrix.
+ *
+ * Replace CPU/GPU mental model: instead of evaluating ONE hypothesis,
+ * the Quantum Core takes N hypotheses with a multi-signal vector each,
+ * fuses signals into a posterior, and COLLAPSES to the winner with a
+ * measurable margin + entropy reading.
+ *
+ * Why this is not vapor:
+ *   1. Bayes fusion of independent signals is a real, well-known math
+ *      operation. We just give it a cosmic name + plug it into Mneme.
+ *   2. Margin + entropy let downstream code REFUSE to commit when the
+ *      collapse is too uncertain — instead of guessing, return UNCERTAIN.
+ *   3. Pure functions. Deterministic. Unit-testable. Same inputs → same
+ *      collapse forever.
+ *
+ *   "When computation becomes a cosmic event."
+ */
+/** Core algorithm: fuse signals × weights × prior into a posterior, then
+ *  collapse to the winner with margin + entropy report.
+ *
+ *  Math: posterior_i ∝ prior_i × Π_axis ( signal_i,axis ^ weight_axis )
+ *  Normalized so Σ posteriors = 1. Entropy computed over normalized vec.
+ */
+export function collapseProbabilityMatrix(hypotheses, opts = {}) {
+    const epsilon = opts.epsilon ?? 1e-9;
+    const uncertaintyMargin = opts.uncertaintyMargin ?? 0.05;
+    const N = hypotheses.length;
+    if (N === 0) {
+        return {
+            verdict: "DEGENERATE",
+            winner: null,
+            posterior: 0,
+            margin: 0,
+            entropy: 0,
+            entropyNormalized: 0,
+            ranked: [],
+            reason: "no hypotheses provided",
+        };
+    }
+    // Collect all axis names that show up anywhere.
+    const axes = new Set();
+    for (const h of hypotheses)
+        for (const k of Object.keys(h.signals))
+            axes.add(k);
+    // Determine weights — default 1.0 for every axis the caller didn't override.
+    const weights = {};
+    for (const a of axes)
+        weights[a] = opts.weights?.[a] ?? 1.0;
+    // Compute unnormalized posterior for each hypothesis.
+    // Use log-space for numerical stability with many axes.
+    const logScores = hypotheses.map((h) => {
+        const prior = h.prior ?? 1 / N;
+        let logP = Math.log(Math.max(prior, epsilon));
+        for (const axis of axes) {
+            const signal = h.signals[axis] ?? 0.5; // missing signal = neutral 0.5
+            const w = weights[axis] ?? 1.0;
+            // Map signal in [0,1] to a probability factor. signal=1 → factor=1,
+            // signal=0 → factor=epsilon. weight scales the influence.
+            const factor = Math.max(signal, epsilon);
+            logP += w * Math.log(factor);
+        }
+        return logP;
+    });
+    // Normalize via log-sum-exp for stability.
+    const maxLog = Math.max(...logScores);
+    const expShifted = logScores.map((l) => Math.exp(l - maxLog));
+    const sum = expShifted.reduce((a, b) => a + b, 0);
+    const posteriors = expShifted.map((e) => e / sum);
+    // Pair with hypotheses + sort.
+    const paired = hypotheses.map((h, i) => ({ ...h, posterior: posteriors[i] }));
+    const ranked = [...paired].sort((a, b) => b.posterior - a.posterior);
+    // Shannon entropy.
+    let entropy = 0;
+    for (const p of posteriors) {
+        if (p > 0)
+            entropy -= p * Math.log2(p);
+    }
+    const entropyMax = Math.log2(Math.max(N, 1)) || 1;
+    const entropyNormalized = entropy / entropyMax;
+    const winner = ranked[0];
+    const runnerUp = ranked[1];
+    const margin = runnerUp ? winner.posterior - runnerUp.posterior : winner.posterior;
+    // Verdict logic
+    if (N === 1) {
+        return {
+            verdict: "DEGENERATE",
+            winner,
+            posterior: winner.posterior,
+            margin: 1,
+            entropy: 0,
+            entropyNormalized: 0,
+            ranked,
+            reason: "single hypothesis — collapse is trivial",
+        };
+    }
+    if (margin < uncertaintyMargin) {
+        return {
+            verdict: "UNCERTAIN",
+            winner,
+            posterior: winner.posterior,
+            margin,
+            entropy,
+            entropyNormalized,
+            ranked,
+            reason: `margin ${margin.toFixed(4)} < threshold ${uncertaintyMargin}`,
+        };
+    }
+    return {
+        verdict: "COLLAPSED",
+        winner,
+        posterior: winner.posterior,
+        margin,
+        entropy,
+        entropyNormalized,
+        ranked,
+    };
+}
+/** Re-collapse with adjusted weights — used by the re-engineer loop to
+ *  tune signal weights based on benchmark feedback. */
+export function recollapseWithWeights(hypotheses, weights, opts = {}) {
+    return collapseProbabilityMatrix(hypotheses, { ...opts, weights });
+}
+/** Compute a confidence score 0..1 from a CollapseResult. Used by
+ *  callers that just want a single number. */
+export function confidenceOf(r) {
+    if (r.verdict === "DEGENERATE")
+        return 0.5;
+    // Confidence = posterior × (1 - normalized entropy) — favors high
+    // posterior AND low overall ambiguity.
+    return r.posterior * (1 - r.entropyNormalized);
+}
+//# sourceMappingURL=quantum_core.js.map

package/dist/qx_supernova/quantum_core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantum_core.js","sourceRoot":"","sources":["../../src/qx_supernova/quantum_core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AA2CH;;;;;GAKG;AACH,MAAM,UAAU,yBAAyB,CACvC,UAAoC,EACpC,OAAwB,EAAE;IAE1B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC;IACrC,MAAM,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC;IACzD,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAE5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO;YACL,OAAO,EAAE,YAAY;YACrB,MAAM,EAAE,IAAI;YACZ,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;YACV,iBAAiB,EAAE,CAAC;YACpB,MAAM,EAAE,EAAE;YACV,MAAM,EAAE,wBAAwB;SACjC,CAAC;IACJ,CAAC;IAED,gDAAgD;IAChD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhF,6EAA6E;IAC7E,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;IAE5D,sDAAsD;IACtD,wDAAwD;IACxD,MAAM,SAAS,GAAa,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,+BAA+B;YACtE,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;YAC/B,oEAAoE;YACpE,0DAA0D;YAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACzC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,2CAA2C;IAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IACtC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC9D,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAElD,+BAA+B;IAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IAErE,mBAAmB;IACnB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,iBAAiB,GAAG,OAAO,GAAG,UAAU,CAAC;IAE/C,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;IAEnF,gBAAgB;IAChB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO;YACL,OAAO,EAAE,YAAY;YACrB,MAAM;YACN,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;YACV,iBAAiB,EAAE,CAAC;YACpB,MAAM;YACN,MAAM,EAAE,yCAAyC;SAClD,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,GAAG,iBAAiB,EAAE,CAAC;QAC/B,OAAO;YACL,OAAO,EAAE,WAAW;YACpB,MAAM;YACN,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,MAAM;YACN,OAAO;YACP,iBAAiB;YACjB,MAAM;YACN,MAAM,EAAE,UAAU,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,iBAAiB,EAAE;SACvE,CAAC;IACJ,CAAC;IACD,OAAO;QACL,OAAO,EAAE,WAAW;QACpB,MAAM;QACN,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,MAAM;QACN,OAAO;QACP,iBAAiB;QACjB,MAAM;KACP,CAAC;AACJ,CAAC;AAED;uDACuD;AACvD,MAAM,UAAU,qBAAqB,CACnC,UAAoC,EACpC,OAA+B,EAC/B,OAAyC,EAAE;IAE3C,OAAO,yBAAyB,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;AACrE,CAAC;AAED;8CAC8C;AAC9C,MAAM,UAAU,YAAY,CAAC,CAA0B;IACrD,IAAI,CAAC,CAAC,OAAO,KAAK,YAAY;QAAE,OAAO,GAAG,CAAC;IAC3C,kEAAkE;IAClE,uCAAuC;IACvC,OAAO,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;AACjD,CAAC"}

package/dist/qx_supernova/qx_supernova.test.d.ts

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

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

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