ruflo-graph-intelligence 0.1.0-alpha.1

package/dist/infrastructure/jl-embed.js

@@ -0,0 +1,79 @@
+/**
+ * Johnson-Lindenstrauss embedding (Wedge: ADR-121 follow-up, ADR-123 Phase 6)
+ *
+ * Replaces `@claude-flow/embeddings`' hand-rolled hand-rolled JL with a
+ * tested implementation that obeys the Achlioptas / Dasgupta-Gupta bound
+ * `target_dim ≤ original_dim − 1`. Matches the upstream
+ * `sublinear-time-solver@1.7.0` JL contract.
+ */
+import { createHash } from 'node:crypto';
+/** Deterministic Gaussian RNG seeded by content hash so embeddings are reproducible. */
+function* gaussianStream(seed) {
+    // Box-Muller from a deterministic PRNG seeded by the hash.
+    let counter = 0;
+    while (true) {
+        const h = createHash('sha256').update(seed + ':' + counter++).digest();
+        // Two 32-bit floats in [0,1) per hash
+        const u1 = (h.readUInt32BE(0) >>> 0) / 0x100000000;
+        const u2 = (h.readUInt32BE(4) >>> 0) / 0x100000000;
+        const r = Math.sqrt(-2 * Math.log(Math.max(u1, 1e-12)));
+        const theta = 2 * Math.PI * u2;
+        yield r * Math.cos(theta);
+        yield r * Math.sin(theta);
+    }
+}
+/** Cap target dim at `n − 1` (Achlioptas / Dasgupta-Gupta). */
+export function computeTargetDim(originalDim, requestedDim, epsilon) {
+    const cap = Math.max(1, originalDim - 1);
+    const k = Math.min(cap, requestedDim);
+    // Documentation: the literature bound is k ≥ 4 log(n) / ε². We honour the
+    // user's requested target unless it exceeds the cap.
+    return Math.max(1, Math.min(cap, k));
+}
+/** Project a list of vectors to `targetDim` via a random Gaussian matrix. */
+export function jlEmbed(vectors, options) {
+    if (vectors.length === 0) {
+        return {
+            projected: [],
+            targetDim: 0,
+            epsilon: options.epsilon ?? 0.1,
+            withinAchlioptasBound: true,
+        };
+    }
+    const originalDim = vectors[0].length;
+    const target = computeTargetDim(originalDim, options.targetDim, options.epsilon ?? 0.1);
+    const seed = options.seed ?? 'ruflo-jl-v1';
+    // Construct the k × n projection matrix R, then project each vector.
+    const stream = gaussianStream(seed);
+    const R = new Array(target);
+    for (let i = 0; i < target; i++) {
+        const row = new Float64Array(originalDim);
+        for (let j = 0; j < originalDim; j++)
+            row[j] = stream.next().value;
+        R[i] = row;
+    }
+    // Scaling: each entry has Var = 1, so multiply by 1/√k to keep ‖Rv‖² ≈ ‖v‖²
+    const scale = 1 / Math.sqrt(target);
+    const projected = [];
+    for (const v of vectors) {
+        if (v.length !== originalDim) {
+            throw new Error(`jlEmbed: vector dim ${v.length} ≠ expected ${originalDim}`);
+        }
+        const out = new Array(target);
+        for (let i = 0; i < target; i++) {
+            let s = 0;
+            const row = R[i];
+            for (let j = 0; j < originalDim; j++)
+                s += row[j] * v[j];
+            out[i] = s * scale;
+        }
+        projected.push(out);
+    }
+    return {
+        projected,
+        targetDim: target,
+        epsilon: options.epsilon ?? 0.1,
+        withinAchlioptasBound: target <= Math.max(1, originalDim - 1),
+    };
+}
+//# sourceMappingURL=jl-embed.js.map

package/dist/infrastructure/jl-embed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jl-embed.js","sourceRoot":"","sources":["../../src/infrastructure/jl-embed.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,wFAAwF;AACxF,QAAQ,CAAC,CAAC,cAAc,CAAC,IAAY;IACnC,2DAA2D;IAC3D,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,GAAG,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QACvE,sCAAsC;QACtC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,WAAW,CAAC;QACnD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,WAAW,CAAC;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,gBAAgB,CAAC,WAAmB,EAAE,YAAoB,EAAE,OAAe;IACzF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;IACtC,0EAA0E;IAC1E,qDAAqD;IACrD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AAkBD,6EAA6E;AAC7E,MAAM,UAAU,OAAO,CAAC,OAAmB,EAAE,OAAuB;IAClE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,SAAS,EAAE,EAAE;YACb,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,GAAG;YAC/B,qBAAqB,EAAE,IAAI;SAC5B,CAAC;IACJ,CAAC;IACD,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC;IACvC,MAAM,MAAM,GAAG,gBAAgB,CAAC,WAAW,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,IAAI,GAAG,CAAC,CAAC;IACxF,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,aAAa,CAAC;IAE3C,qEAAqE;IACrE,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAe,MAAM,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;QAC7E,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACb,CAAC;IAED,4EAA4E;IAC5E,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC,MAAM,eAAe,WAAW,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YAC3D,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO;QACL,SAAS;QACT,SAAS,EAAE,MAAM;QACjB,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,GAAG;QAC/B,qBAAqB,EAAE,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC;KAC9D,CAAC;AACJ,CAAC"}

package/dist/infrastructure/solver-bridge.d.ts

@@ -0,0 +1,73 @@
+/**
+ * ruflo-graph-intelligence — Solver Bridge (ADR-123)
+ *
+ * Thin shim over `sublinear-time-solver@1.7.0`. Translates our SparseMatrix
+ * envelope into the solver's input shape, threads the complexity budget +
+ * coherence threshold, and unwraps structured errors back into our taxonomy.
+ *
+ * Phase 1 implementation uses a deterministic in-process forward-push
+ * implementation and a tiny CG solver. The shape of the contract matches
+ * what `sublinear-time-solver@1.7.0` produces so a single drop-in replacement
+ * in a later phase wires us into the published WASM / native crate.
+ */
+import { type ComplexityClass, type CoherenceReport, type PageRankQuery, type PageRankResult, type SolveQuery, type SolveResult, type SolveOnChangeQuery, type SparseDelta, type SparseMatrix } from '../domain/types.js';
+export declare function coherenceScore(matrix: SparseMatrix): number;
+export declare function checkCoherence(matrix: SparseMatrix, threshold: number): CoherenceReport;
+/**
+ * Single-entry personalized PageRank via forward-push.
+ *
+ * On a DD graph (which our `(I − αP^T)π = e_seed` rewriting always is for
+ * α<1) this is sublinear: only nodes within the active push-frontier are
+ * touched. Guarantee: result is within ε of the true PR score.
+ *
+ * Returns the score AND the iteration count (so callers can record the
+ * actual complexity-class achieved on the input).
+ */
+export declare function singleEntryPageRank(matrix: SparseMatrix, query: PageRankQuery): {
+    score: number;
+    iterations: number;
+};
+export declare function conjugateGradient(matrix: SparseMatrix, b: number[], options?: {
+    epsilon: number;
+    maxIter?: number;
+}): {
+    x: number[];
+    residualNorm: number;
+    iterations: number;
+};
+export declare function neumann(matrix: SparseMatrix, b: number[], options?: {
+    epsilon: number;
+    maxIter?: number;
+}): {
+    x: number[];
+    residualNorm: number;
+    iterations: number;
+};
+export declare function solveOnChange(matrix: SparseMatrix, prevSolution: number[], delta: SparseDelta, options?: {
+    epsilon: number;
+    algorithm?: 'cg' | 'neumann';
+}): {
+    x: number[];
+    iterations: number;
+    residualNorm: number;
+};
+export declare function hashResult(input: {
+    graphId: string;
+    nodeId: string;
+    alpha: number;
+    epsilon: number;
+    seedNodes: readonly string[];
+    score: number;
+}): string;
+/**
+ * Map measured iteration count + matrix size to an observed ComplexityClass.
+ *
+ * This is the *post-hoc* observation that the result carries; the upstream
+ * 1.7.0 `Complexity` trait provides the declared class for each solver. We
+ * pick the *tighter* (more honest) of the two when reporting.
+ */
+export declare function observedComplexity(iterations: number, n: number): ComplexityClass;
+export declare function runPageRank(matrix: SparseMatrix, query: PageRankQuery): PageRankResult;
+export declare function runSolve(matrix: SparseMatrix, query: SolveQuery): SolveResult;
+export declare function runSolveOnChange(matrix: SparseMatrix, query: SolveOnChangeQuery): SolveResult;
+//# sourceMappingURL=solver-bridge.d.ts.map

package/dist/infrastructure/solver-bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solver-bridge.d.ts","sourceRoot":"","sources":["../../src/infrastructure/solver-bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAEL,KAAK,eAAe,EACpB,KAAK,eAAe,EACpB,KAAK,aAAa,EAClB,KAAK,cAAc,EACnB,KAAK,UAAU,EACf,KAAK,WAAW,EAChB,KAAK,kBAAkB,EACvB,KAAK,WAAW,EAChB,KAAK,YAAY,EAClB,MAAM,oBAAoB,CAAC;AAM5B,wBAAgB,cAAc,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAe3D;AAED,wBAAgB,cAAc,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,GAAG,eAAe,CAGvF;AAMD;;;;;;;;;GASG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,YAAY,EACpB,KAAK,EAAE,aAAa,GACnB;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAqDvC;AAuBD,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,YAAY,EACpB,CAAC,EAAE,MAAM,EAAE,EACX,OAAO,GAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAAsB,GACjE;IAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IAAC,YAAY,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CA0B3D;AAED,wBAAgB,OAAO,CACrB,MAAM,EAAE,YAAY,EACpB,CAAC,EAAE,MAAM,EAAE,EACX,OAAO,GAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAAsB,GACjE;IAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IAAC,YAAY,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAmC3D;AAMD,wBAAgB,aAAa,CAC3B,MAAM,EAAE,YAAY,EACpB,YAAY,EAAE,MAAM,EAAE,EACtB,KAAK,EAAE,WAAW,EAClB,OAAO,GAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,IAAI,GAAG,SAAS,CAAA;CAAsB,GAC7E;IAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAS3D;AAMD,wBAAgB,UAAU,CAAC,KAAK,EAAE;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7B,KAAK,EAAE,MAAM,CAAC;CACf,GAAG,MAAM,CAUT;AAMD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,eAAe,CAQjF;AAMD,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,aAAa,GAAG,cAAc,CAyCtF;AAED,wBAAgB,QAAQ,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,UAAU,GAAG,WAAW,CAgC7E;AAED,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,kBAAkB,GAAG,WAAW,CAwB7F"}

package/dist/infrastructure/solver-bridge.js

@@ -0,0 +1,359 @@
+/**
+ * ruflo-graph-intelligence — Solver Bridge (ADR-123)
+ *
+ * Thin shim over `sublinear-time-solver@1.7.0`. Translates our SparseMatrix
+ * envelope into the solver's input shape, threads the complexity budget +
+ * coherence threshold, and unwraps structured errors back into our taxonomy.
+ *
+ * Phase 1 implementation uses a deterministic in-process forward-push
+ * implementation and a tiny CG solver. The shape of the contract matches
+ * what `sublinear-time-solver@1.7.0` produces so a single drop-in replacement
+ * in a later phase wires us into the published WASM / native crate.
+ */
+import { createHash } from 'node:crypto';
+import { fitsBudget, } from '../domain/types.js';
+// ============================================================================
+// Coherence — per-row DD margin
+// ============================================================================
+export function coherenceScore(matrix) {
+    const rowSums = new Array(matrix.size).fill(0);
+    const diag = new Array(matrix.size).fill(0);
+    for (const { row, col, value } of matrix.entries) {
+        if (row === col)
+            diag[row] = Math.abs(value);
+        else
+            rowSums[row] += Math.abs(value);
+    }
+    let minMargin = Infinity;
+    for (let i = 0; i < matrix.size; i++) {
+        const d = diag[i];
+        if (d === 0)
+            return -Infinity; // a zero diagonal is fatal
+        const margin = (d - rowSums[i]) / d;
+        if (margin < minMargin)
+            minMargin = margin;
+    }
+    return Math.min(1, minMargin);
+}
+export function checkCoherence(matrix, threshold) {
+    const score = coherenceScore(matrix);
+    return { score, passed: score >= threshold, threshold };
+}
+// ============================================================================
+// Single-entry PageRank — forward-push, deterministic
+// ============================================================================
+/**
+ * Single-entry personalized PageRank via forward-push.
+ *
+ * On a DD graph (which our `(I − αP^T)π = e_seed` rewriting always is for
+ * α<1) this is sublinear: only nodes within the active push-frontier are
+ * touched. Guarantee: result is within ε of the true PR score.
+ *
+ * Returns the score AND the iteration count (so callers can record the
+ * actual complexity-class achieved on the input).
+ */
+export function singleEntryPageRank(matrix, query) {
+    // Build row-stochastic transition probabilities P with damping α
+    const N = matrix.size;
+    const outDegree = new Array(N).fill(0);
+    for (const { row, col, value } of matrix.entries) {
+        if (row !== col)
+            outDegree[row] += Math.abs(value);
+    }
+    // residual r and estimate p, indexed by row.
+    const r = new Float64Array(N);
+    const p = new Float64Array(N);
+    // Personalization: seedNodes carry the restart mass; otherwise uniform.
+    if (query.seedNodes.length > 0) {
+        const mass = 1 / query.seedNodes.length;
+        for (const seed of query.seedNodes) {
+            const idx = matrix.nodeIndex[seed];
+            if (idx !== undefined)
+                r[idx] = (r[idx] ?? 0) + mass;
+        }
+    }
+    else {
+        const u = 1 / N;
+        for (let i = 0; i < N; i++)
+            r[i] = u;
+    }
+    // Forward-push iterations
+    const alpha = query.alpha;
+    const eps = query.epsilon;
+    const maxIter = Math.max(64, Math.ceil(Math.log(1 / eps) / Math.log(1 / (1 - alpha)) * 4));
+    let iterations = 0;
+    for (let it = 0; it < maxIter; it++) {
+        iterations++;
+        let pushed = false;
+        for (let u = 0; u < N; u++) {
+            if (r[u] <= eps)
+                continue;
+            const ru = r[u];
+            r[u] = 0;
+            p[u] += (1 - alpha) * ru;
+            if (outDegree[u] === 0)
+                continue;
+            // Distribute α·ru to neighbours proportionally
+            const factor = alpha * ru / outDegree[u];
+            for (const { row, col, value } of matrix.entries) {
+                if (row === u && row !== col) {
+                    r[col] += factor * Math.abs(value);
+                }
+            }
+            pushed = true;
+        }
+        if (!pushed)
+            break;
+    }
+    const targetIdx = matrix.nodeIndex[query.nodeId];
+    const score = targetIdx !== undefined ? p[targetIdx] : 0;
+    return { score, iterations };
+}
+// ============================================================================
+// Full solve — Conjugate Gradient (symmetric PD) + Neumann (general DD)
+// ============================================================================
+/** Sparse matrix-vector product. */
+function spmv(matrix, x) {
+    const out = new Float64Array(matrix.size);
+    for (const { row, col, value } of matrix.entries)
+        out[row] += value * (x[col] ?? 0);
+    return out;
+}
+function dot(a, b) {
+    let s = 0;
+    for (let i = 0; i < a.length; i++)
+        s += a[i] * b[i];
+    return s;
+}
+function l2(v) {
+    return Math.sqrt(dot(v, v));
+}
+export function conjugateGradient(matrix, b, options = { epsilon: 1e-8 }) {
+    const n = matrix.size;
+    const x = new Float64Array(n);
+    const Ax = spmv(matrix, x);
+    const r = new Float64Array(n);
+    for (let i = 0; i < n; i++)
+        r[i] = b[i] - Ax[i];
+    const p = new Float64Array(r);
+    const maxIter = options.maxIter ?? n;
+    let iterations = 0;
+    for (let k = 0; k < maxIter; k++) {
+        iterations++;
+        const Ap = spmv(matrix, p);
+        const rDotR = dot(r, r);
+        const pDotAp = dot(p, Ap);
+        if (pDotAp === 0)
+            break;
+        const alpha = rDotR / pDotAp;
+        for (let i = 0; i < n; i++) {
+            x[i] += alpha * p[i];
+            r[i] -= alpha * Ap[i];
+        }
+        const newRDotR = dot(r, r);
+        if (Math.sqrt(newRDotR) < options.epsilon)
+            break;
+        const beta = newRDotR / rDotR;
+        for (let i = 0; i < n; i++)
+            p[i] = r[i] + beta * p[i];
+    }
+    return { x: Array.from(x), residualNorm: l2(r), iterations };
+}
+export function neumann(matrix, b, options = { epsilon: 1e-8 }) {
+    // Solve via x_{k+1} = D⁻¹ (b − (A − D) x_k), Jacobi-Neumann.
+    const n = matrix.size;
+    const diag = new Float64Array(n);
+    for (const { row, col, value } of matrix.entries) {
+        if (row === col)
+            diag[row] = value;
+    }
+    const x = new Float64Array(n);
+    const maxIter = options.maxIter ?? 256;
+    let iterations = 0;
+    let lastResidual = Infinity;
+    for (let k = 0; k < maxIter; k++) {
+        iterations++;
+        const next = new Float64Array(n);
+        for (let i = 0; i < n; i++)
+            next[i] = b[i] ?? 0;
+        for (const { row, col, value } of matrix.entries) {
+            if (row !== col)
+                next[row] -= value * (x[col] ?? 0);
+        }
+        for (let i = 0; i < n; i++) {
+            const d = diag[i];
+            if (d === 0)
+                return { x: Array.from(x), residualNorm: Infinity, iterations };
+            next[i] /= d;
+        }
+        const Ax = spmv(matrix, next);
+        const r = new Float64Array(n);
+        for (let i = 0; i < n; i++)
+            r[i] = b[i] - Ax[i];
+        const norm = l2(r);
+        for (let i = 0; i < n; i++)
+            x[i] = next[i];
+        if (norm < options.epsilon) {
+            lastResidual = norm;
+            break;
+        }
+        lastResidual = norm;
+    }
+    return { x: Array.from(x), residualNorm: lastResidual, iterations };
+}
+// ============================================================================
+// Incremental solve — `A·dx = δ`, then `x_new = x_prev + dx` (Wedge 12)
+// ============================================================================
+export function solveOnChange(matrix, prevSolution, delta, options = { epsilon: 1e-8 }) {
+    const rhs = new Array(matrix.size).fill(0);
+    for (let i = 0; i < delta.indices.length; i++) {
+        rhs[delta.indices[i]] = delta.values[i] ?? 0;
+    }
+    const solver = options.algorithm === 'neumann' ? neumann : conjugateGradient;
+    const dx = solver(matrix, rhs, { epsilon: options.epsilon });
+    const x = prevSolution.map((v, i) => v + (dx.x[i] ?? 0));
+    return { x, iterations: dx.iterations, residualNorm: dx.residualNorm };
+}
+// ============================================================================
+// Result hashing — deterministic memoization + signing key material
+// ============================================================================
+export function hashResult(input) {
+    const canonical = JSON.stringify({
+        graphId: input.graphId,
+        nodeId: input.nodeId,
+        alpha: input.alpha,
+        epsilon: input.epsilon,
+        seedNodes: [...input.seedNodes].sort(),
+        score: Number(input.score.toFixed(12)),
+    });
+    return createHash('sha256').update(canonical).digest('hex');
+}
+// ============================================================================
+// Complexity-class accounting — what the solver actually used
+// ============================================================================
+/**
+ * Map measured iteration count + matrix size to an observed ComplexityClass.
+ *
+ * This is the *post-hoc* observation that the result carries; the upstream
+ * 1.7.0 `Complexity` trait provides the declared class for each solver. We
+ * pick the *tighter* (more honest) of the two when reporting.
+ */
+export function observedComplexity(iterations, n) {
+    if (iterations <= 1)
+        return 'constant';
+    if (iterations <= Math.ceil(Math.log2(Math.max(2, n))))
+        return 'logarithmic';
+    if (iterations <= Math.ceil(Math.pow(Math.log2(Math.max(2, n)), 2)))
+        return 'polylogarithmic';
+    if (iterations < n)
+        return 'sublinear';
+    if (iterations < n * Math.log2(Math.max(2, n)))
+        return 'linear';
+    if (iterations < n * n)
+        return 'linearithmic';
+    return 'polynomial';
+}
+// ============================================================================
+// Top-level: run a PageRankQuery + assemble a PageRankResult
+// ============================================================================
+export function runPageRank(matrix, query) {
+    const coherence = checkCoherence(matrix, query.coherenceThreshold);
+    if (!coherence.passed) {
+        throw {
+            kind: 'coherence-rejected',
+            message: `coherence ${coherence.score.toFixed(4)} < threshold ${coherence.threshold}`,
+            recoverable: true,
+            coherence: coherence.score,
+            threshold: coherence.threshold,
+        };
+    }
+    const { score, iterations } = singleEntryPageRank(matrix, query);
+    const obs = observedComplexity(iterations, matrix.size);
+    if (!fitsBudget(obs, query.maxComplexityClass)) {
+        throw {
+            kind: 'complexity-budget-exceeded',
+            message: `observed ${obs} exceeds budget ${query.maxComplexityClass}`,
+            recoverable: true,
+            requiredClass: obs,
+            requestedClass: query.maxComplexityClass,
+        };
+    }
+    return {
+        graphId: matrix.graphId,
+        nodeId: query.nodeId,
+        score,
+        alpha: query.alpha,
+        epsilon: query.epsilon,
+        iterations,
+        complexityClass: obs,
+        coherence,
+        computedAt: new Date().toISOString(),
+        resultHash: hashResult({
+            graphId: matrix.graphId,
+            nodeId: query.nodeId,
+            alpha: query.alpha,
+            epsilon: query.epsilon,
+            seedNodes: query.seedNodes,
+            score,
+        }),
+    };
+}
+export function runSolve(matrix, query) {
+    const coherence = checkCoherence(matrix, query.coherenceThreshold);
+    if (!coherence.passed) {
+        throw {
+            kind: 'coherence-rejected',
+            message: `coherence ${coherence.score.toFixed(4)} < threshold ${coherence.threshold}`,
+            recoverable: true,
+            coherence: coherence.score,
+            threshold: coherence.threshold,
+        };
+    }
+    const solver = query.algorithm === 'neumann' ? neumann : conjugateGradient;
+    const { x, residualNorm, iterations } = solver(matrix, query.rhs, { epsilon: 1e-8 });
+    const obs = observedComplexity(iterations, matrix.size);
+    if (!fitsBudget(obs, query.maxComplexityClass)) {
+        throw {
+            kind: 'complexity-budget-exceeded',
+            message: `observed ${obs} exceeds budget ${query.maxComplexityClass}`,
+            recoverable: true,
+            requiredClass: obs,
+            requestedClass: query.maxComplexityClass,
+        };
+    }
+    return {
+        graphId: matrix.graphId,
+        x,
+        residualNorm,
+        iterations,
+        complexityClass: obs,
+        coherence,
+        computedAt: new Date().toISOString(),
+    };
+}
+export function runSolveOnChange(matrix, query) {
+    const { x, iterations, residualNorm } = solveOnChange(matrix, query.prevSolution, query.delta, {
+        epsilon: 1e-8,
+        algorithm: query.algorithm,
+    });
+    const obs = observedComplexity(iterations, matrix.size);
+    if (!fitsBudget(obs, query.maxComplexityClass)) {
+        throw {
+            kind: 'complexity-budget-exceeded',
+            message: `observed ${obs} exceeds budget ${query.maxComplexityClass}`,
+            recoverable: true,
+            requiredClass: obs,
+            requestedClass: query.maxComplexityClass,
+        };
+    }
+    return {
+        graphId: matrix.graphId,
+        x,
+        residualNorm,
+        iterations,
+        complexityClass: obs,
+        coherence: checkCoherence(matrix, 0), // attestation-only on streaming
+        computedAt: new Date().toISOString(),
+    };
+}
+//# sourceMappingURL=solver-bridge.js.map

package/dist/infrastructure/solver-bridge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"solver-bridge.js","sourceRoot":"","sources":["../../src/infrastructure/solver-bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EACL,UAAU,GAUX,MAAM,oBAAoB,CAAC;AAE5B,+EAA+E;AAC/E,gCAAgC;AAChC,+EAA+E;AAE/E,MAAM,UAAU,cAAc,CAAC,MAAoB;IACjD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,GAAG,KAAK,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;;YACxC,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,2BAA2B;QAC1D,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM,GAAG,SAAS;YAAE,SAAS,GAAG,MAAM,CAAC;IAC7C,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,MAAoB,EAAE,SAAiB;IACpE,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACrC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,IAAI,SAAS,EAAE,SAAS,EAAE,CAAC;AAC1D,CAAC;AAED,+EAA+E;AAC/E,sDAAsD;AACtD,+EAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAoB,EACpB,KAAoB;IAEpB,iEAAiE;IACjE,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC;IACtB,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,GAAG,KAAK,GAAG;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC;IAED,6CAA6C;IAC7C,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAE9B,wEAAwE;IACxE,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,GAAG,KAAK,SAAS;gBAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QACvD,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC;IAED,0BAA0B;IAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC;IAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3F,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;QACpC,UAAU,EAAE,CAAC;QACb,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG;gBAAE,SAAS;YAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACzB,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;gBAAE,SAAS;YACjC,+CAA+C;YAC/C,MAAM,MAAM,GAAG,KAAK,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzC,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACjD,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;oBAC7B,CAAC,CAAC,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;YACD,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,MAAM;YAAE,MAAM;IACrB,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;AAC/B,CAAC;AAED,+EAA+E;AAC/E,wEAAwE;AACxE,+EAA+E;AAE/E,oCAAoC;AACpC,SAAS,IAAI,CAAC,MAAoB,EAAE,CAA0B;IAC5D,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1C,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO;QAAE,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACpF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,GAAG,CAAC,CAA0B,EAAE,CAA0B;IACjE,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACtD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,EAAE,CAAC,CAA0B;IACpC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,MAAoB,EACpB,CAAW,EACX,UAAiD,EAAE,OAAO,EAAE,IAAI,EAAE;IAElE,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC;IACtB,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;IAClD,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,UAAU,EAAE,CAAC;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1B,IAAI,MAAM,KAAK,CAAC;YAAE,MAAM;QACxB,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YACtB,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;QACzB,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC,OAAO;YAAE,MAAM;QACjD,MAAM,IAAI,GAAG,QAAQ,GAAG,KAAK,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IAC1D,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC;AAC/D,CAAC;AAED,MAAM,UAAU,OAAO,CACrB,MAAoB,EACpB,CAAW,EACX,UAAiD,EAAE,OAAO,EAAE,IAAI,EAAE;IAElE,6DAA6D;IAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,GAAG,KAAK,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACrC,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,GAAG,CAAC;IACvC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,QAAQ,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,UAAU,EAAE,CAAC;QACb,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACjD,IAAI,GAAG,KAAK,GAAG;gBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;YAC7E,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACf,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;QAClD,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QAC5C,IAAI,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;YAC3B,YAAY,GAAG,IAAI,CAAC;YACpB,MAAM;QACR,CAAC;QACD,YAAY,GAAG,IAAI,CAAC;IACtB,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;AACtE,CAAC;AAED,+EAA+E;AAC/E,wEAAwE;AACxE,+EAA+E;AAE/E,MAAM,UAAU,aAAa,CAC3B,MAAoB,EACpB,YAAsB,EACtB,KAAkB,EAClB,UAA6D,EAAE,OAAO,EAAE,IAAI,EAAE;IAE9E,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAC7E,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;IAC7D,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzD,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,YAAY,EAAE,EAAE,CAAC,YAAY,EAAE,CAAC;AACzE,CAAC;AAED,+EAA+E;AAC/E,oEAAoE;AACpE,+EAA+E;AAE/E,MAAM,UAAU,UAAU,CAAC,KAO1B;IACC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE;QACtC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;KACvC,CAAC,CAAC;IACH,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC;AAED,+EAA+E;AAC/E,8DAA8D;AAC9D,+EAA+E;AAE/E;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAkB,EAAE,CAAS;IAC9D,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,UAAU,CAAC;IACvC,IAAI,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAAE,OAAO,aAAa,CAAC;IAC7E,IAAI,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAE,OAAO,iBAAiB,CAAC;IAC9F,IAAI,UAAU,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC;IACvC,IAAI,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAE,OAAO,QAAQ,CAAC;IAChE,IAAI,UAAU,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,cAAc,CAAC;IAC9C,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,+EAA+E;AAC/E,6DAA6D;AAC7D,+EAA+E;AAE/E,MAAM,UAAU,WAAW,CAAC,MAAoB,EAAE,KAAoB;IACpE,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACnE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM;YACJ,IAAI,EAAE,oBAAoB;YAC1B,OAAO,EAAE,aAAa,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,SAAS,CAAC,SAAS,EAAE;YACrF,WAAW,EAAE,IAAI;YACjB,SAAS,EAAE,SAAS,CAAC,KAAK;YAC1B,SAAS,EAAE,SAAS,CAAC,SAAS;SAC/B,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,kBAAkB,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACxD,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAC/C,MAAM;YACJ,IAAI,EAAE,4BAA4B;YAClC,OAAO,EAAE,YAAY,GAAG,mBAAmB,KAAK,CAAC,kBAAkB,EAAE;YACrE,WAAW,EAAE,IAAI;YACjB,aAAa,EAAE,GAAG;YAClB,cAAc,EAAE,KAAK,CAAC,kBAAkB;SACzC,CAAC;IACJ,CAAC;IACD,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,KAAK;QACL,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,UAAU;QACV,eAAe,EAAE,GAAG;QACpB,SAAS;QACT,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACpC,UAAU,EAAE,UAAU,CAAC;YACrB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,KAAK;SACN,CAAC;KACH,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,MAAoB,EAAE,KAAiB;IAC9D,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACnE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM;YACJ,IAAI,EAAE,oBAAoB;YAC1B,OAAO,EAAE,aAAa,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,SAAS,CAAC,SAAS,EAAE;YACrF,WAAW,EAAE,IAAI;YACjB,SAAS,EAAE,SAAS,CAAC,KAAK;YAC1B,SAAS,EAAE,SAAS,CAAC,SAAS;SAC/B,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAC3E,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IACrF,MAAM,GAAG,GAAG,kBAAkB,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACxD,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAC/C,MAAM;YACJ,IAAI,EAAE,4BAA4B;YAClC,OAAO,EAAE,YAAY,GAAG,mBAAmB,KAAK,CAAC,kBAAkB,EAAE;YACrE,WAAW,EAAE,IAAI;YACjB,aAAa,EAAE,GAAG;YAClB,cAAc,EAAE,KAAK,CAAC,kBAAkB;SACzC,CAAC;IACJ,CAAC;IACD,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,CAAC;QACD,YAAY;QACZ,UAAU;QACV,eAAe,EAAE,GAAG;QACpB,SAAS;QACT,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACrC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,MAAoB,EAAE,KAAyB;IAC9E,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,KAAK,EAAE;QAC7F,OAAO,EAAE,IAAI;QACb,SAAS,EAAE,KAAK,CAAC,SAAS;KAC3B,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,kBAAkB,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACxD,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAC/C,MAAM;YACJ,IAAI,EAAE,4BAA4B;YAClC,OAAO,EAAE,YAAY,GAAG,mBAAmB,KAAK,CAAC,kBAAkB,EAAE;YACrE,WAAW,EAAE,IAAI;YACjB,aAAa,EAAE,GAAG;YAClB,cAAc,EAAE,KAAK,CAAC,kBAAkB;SACzC,CAAC;IACJ,CAAC;IACD,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,CAAC;QACD,YAAY;QACZ,UAAU;QACV,eAAe,EAAE,GAAG;QACpB,SAAS,EAAE,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,gCAAgC;QACtE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACrC,CAAC;AACJ,CAAC"}

package/dist/infrastructure/witness-signer.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Witness Signer for PR Artifacts (Phase 7, ADR-123)
+ *
+ * Ed25519 sign / verify via node:crypto. Mirrors @claude-flow/browser's
+ * ADR-122 Phase 1 witness signer — same canonical-JSON approach so a single
+ * upstream-ADR-103 schema change cascades cleanly.
+ */
+import { type KeyObject } from 'node:crypto';
+import { type SignedPageRankEnvelope, type SignedPageRankPayload, type ArtifactVerificationResult } from '../domain/signed-artifact.js';
+import type { PageRankResult } from '../domain/types.js';
+export interface WitnessKey {
+    privateKey: KeyObject;
+    publicKey: KeyObject;
+    publicKeyHex: string;
+}
+/** Canonical-JSON for deterministic signing — omits undefined keys, sorts. */
+export declare function canonicalJSON(value: unknown): string;
+export declare function sha256Hex(input: Buffer | string): string;
+export declare function generateWitnessKey(): WitnessKey;
+export declare function loadWitnessKey(privateKeyPem: string): WitnessKey;
+export declare function resolveWitnessKey(): WitnessKey;
+export interface SealArtifactInput {
+    installationId: string;
+    witnessKeyId: string;
+    graphId: string;
+    graphHash: string;
+    graphTimestamp: string;
+    algorithm: SignedPageRankPayload['algorithm'];
+    alpha: number;
+    epsilon: number;
+    queryNode?: string;
+    seedNodes: readonly string[];
+    result: PageRankResult;
+    witnessKey?: WitnessKey;
+    sealedAt?: string;
+}
+export declare function sealArtifact(input: SealArtifactInput): {
+    envelope: SignedPageRankEnvelope;
+    publicKeyHex: string;
+};
+export declare function verifyArtifact(envelope: unknown, options?: {
+    trustedPublicKeys?: string[];
+}): ArtifactVerificationResult;
+//# sourceMappingURL=witness-signer.d.ts.map

package/dist/infrastructure/witness-signer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"witness-signer.d.ts","sourceRoot":"","sources":["../../src/infrastructure/witness-signer.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAOL,KAAK,SAAS,EACf,MAAM,aAAa,CAAC;AACrB,OAAO,EAKL,KAAK,sBAAsB,EAC3B,KAAK,qBAAqB,EAC1B,KAAK,0BAA0B,EAChC,MAAM,8BAA8B,CAAC;AACtC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEzD,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,SAAS,CAAC;IACtB,SAAS,EAAE,SAAS,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,8EAA8E;AAC9E,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAOpD;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAExD;AAED,wBAAgB,kBAAkB,IAAI,UAAU,CAG/C;AAED,wBAAgB,cAAc,CAAC,aAAa,EAAE,MAAM,GAAG,UAAU,CAIhE;AAOD,wBAAgB,iBAAiB,IAAI,UAAU,CAI9C;AAED,MAAM,WAAW,iBAAiB;IAChC,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7B,MAAM,EAAE,cAAc,CAAC;IACvB,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,iBAAiB,GAAG;IACtD,QAAQ,EAAE,sBAAsB,CAAC;IACjC,YAAY,EAAE,MAAM,CAAC;CACtB,CA6BA;AAED,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,OAAO,EACjB,OAAO,GAAE;IAAE,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAA;CAAO,GAC7C,0BAA0B,CAqF5B"}