ruflo-graph-intelligence 0.1.0-alpha.1

package/dist/domain/types.d.ts

@@ -0,0 +1,329 @@
+/**
+ * ruflo-graph-intelligence — Domain Types (ADR-123)
+ *
+ * Core type contract: SparseMatrix shape, ComplexityClass budget, coherence
+ * threshold, signed PR artifact envelope. These are the wire types every
+ * adapter, MCP tool, and federation peer agrees on.
+ */
+import { z } from 'zod';
+export declare const SparseEntrySchema: z.ZodObject<{
+    row: z.ZodNumber;
+    col: z.ZodNumber;
+    value: z.ZodNumber;
+}, "strip", z.ZodTypeAny, {
+    row: number;
+    col: number;
+    value: number;
+}, {
+    row: number;
+    col: number;
+    value: number;
+}>;
+export type SparseEntry = z.infer<typeof SparseEntrySchema>;
+export declare const SparseMatrixSchema: z.ZodObject<{
+    /** Stable identifier — e.g. "ruflo-federation:trust-mesh:2026-05-19T01:00:00Z". */
+    graphId: z.ZodString;
+    /** Number of rows / columns (square). */
+    size: z.ZodNumber;
+    /** Non-zero entries. */
+    entries: z.ZodArray<z.ZodObject<{
+        row: z.ZodNumber;
+        col: z.ZodNumber;
+        value: z.ZodNumber;
+    }, "strip", z.ZodTypeAny, {
+        row: number;
+        col: number;
+        value: number;
+    }, {
+        row: number;
+        col: number;
+        value: number;
+    }>, "many">;
+    /** Node-id → row-index lookup so callers can talk in domain identifiers. */
+    nodeIndex: z.ZodRecord<z.ZodString, z.ZodNumber>;
+    /** Reverse lookup row-index → node-id. */
+    indexNode: z.ZodArray<z.ZodString, "many">;
+    /** When the snapshot was taken (ISO). */
+    capturedAt: z.ZodString;
+    /** Optional content hash for memoization + signed-artifact integrity. */
+    contentHash: z.ZodOptional<z.ZodString>;
+}, "strip", z.ZodTypeAny, {
+    entries: {
+        row: number;
+        col: number;
+        value: number;
+    }[];
+    graphId: string;
+    size: number;
+    nodeIndex: Record<string, number>;
+    indexNode: string[];
+    capturedAt: string;
+    contentHash?: string | undefined;
+}, {
+    entries: {
+        row: number;
+        col: number;
+        value: number;
+    }[];
+    graphId: string;
+    size: number;
+    nodeIndex: Record<string, number>;
+    indexNode: string[];
+    capturedAt: string;
+    contentHash?: string | undefined;
+}>;
+export type SparseMatrix = z.infer<typeof SparseMatrixSchema>;
+/**
+ * 12-tier upstream `sublinear-time-solver@1.7.0` taxonomy. Ordered.
+ * Lower-cost classes are at the top; Adaptive wraps a (default, worst) pair.
+ */
+export declare const ComplexityClassSchema: z.ZodEnum<["constant", "logarithmic", "polylogarithmic", "sublinear", "linear", "linearithmic", "polynomial", "exponential", "doubleExponential", "adaptive", "unknown", "unbounded"]>;
+export type ComplexityClass = z.infer<typeof ComplexityClassSchema>;
+/** For Adaptive: default + worst-case both reported. */
+export interface AdaptiveBound {
+    default: ComplexityClass;
+    worst: ComplexityClass;
+}
+/** Is `actual` within `budget`? */
+export declare function fitsBudget(actual: ComplexityClass, budget: ComplexityClass): boolean;
+/** Pi-Zero-safe ≈ at most polylogarithmic. */
+export declare function isEdgeSafe(c: ComplexityClass): boolean;
+export declare const CoherenceReportSchema: z.ZodObject<{
+    /** Per-row margin (min over rows of (|diag| − Σ|off|) / |diag|). Range (−∞, 1]. */
+    score: z.ZodNumber;
+    /** Did the matrix pass the configured threshold? */
+    passed: z.ZodBoolean;
+    /** Threshold used. 0 = gate disabled (wire-compatible default). */
+    threshold: z.ZodNumber;
+}, "strip", z.ZodTypeAny, {
+    score: number;
+    passed: boolean;
+    threshold: number;
+}, {
+    score: number;
+    passed: boolean;
+    threshold: number;
+}>;
+export type CoherenceReport = z.infer<typeof CoherenceReportSchema>;
+export declare const PageRankQuerySchema: z.ZodObject<{
+    graphId: z.ZodString;
+    /** Single-entry query — the node we want the PR score for. */
+    nodeId: z.ZodString;
+    /** Damping factor. Default 0.85. */
+    alpha: z.ZodDefault<z.ZodNumber>;
+    /** ε convergence target. Default 1e-3. */
+    epsilon: z.ZodDefault<z.ZodNumber>;
+    /** For personalized PR — seed nodes weighted as the restart distribution. */
+    seedNodes: z.ZodDefault<z.ZodArray<z.ZodString, "many">>;
+    /** Budget gate. Default `linear` (tier-2-safe). */
+    maxComplexityClass: z.ZodDefault<z.ZodEnum<["constant", "logarithmic", "polylogarithmic", "sublinear", "linear", "linearithmic", "polynomial", "exponential", "doubleExponential", "adaptive", "unknown", "unbounded"]>>;
+    /** DD-margin floor. 0 = disabled. */
+    coherenceThreshold: z.ZodDefault<z.ZodNumber>;
+}, "strip", z.ZodTypeAny, {
+    graphId: string;
+    nodeId: string;
+    alpha: number;
+    epsilon: number;
+    seedNodes: string[];
+    maxComplexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    coherenceThreshold: number;
+}, {
+    graphId: string;
+    nodeId: string;
+    alpha?: number | undefined;
+    epsilon?: number | undefined;
+    seedNodes?: string[] | undefined;
+    maxComplexityClass?: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded" | undefined;
+    coherenceThreshold?: number | undefined;
+}>;
+export type PageRankQuery = z.infer<typeof PageRankQuerySchema>;
+export declare const PageRankResultSchema: z.ZodObject<{
+    graphId: z.ZodString;
+    nodeId: z.ZodString;
+    score: z.ZodNumber;
+    alpha: z.ZodNumber;
+    epsilon: z.ZodNumber;
+    iterations: z.ZodNumber;
+    /** Class the solver actually used. */
+    complexityClass: z.ZodEnum<["constant", "logarithmic", "polylogarithmic", "sublinear", "linear", "linearithmic", "polynomial", "exponential", "doubleExponential", "adaptive", "unknown", "unbounded"]>;
+    /** Coherence report attached at compute time. */
+    coherence: z.ZodObject<{
+        /** Per-row margin (min over rows of (|diag| − Σ|off|) / |diag|). Range (−∞, 1]. */
+        score: z.ZodNumber;
+        /** Did the matrix pass the configured threshold? */
+        passed: z.ZodBoolean;
+        /** Threshold used. 0 = gate disabled (wire-compatible default). */
+        threshold: z.ZodNumber;
+    }, "strip", z.ZodTypeAny, {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    }, {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    }>;
+    computedAt: z.ZodString;
+    /** Hash of (graphId, nodeId, alpha, epsilon, seedNodes, score). Stable for memoization. */
+    resultHash: z.ZodString;
+}, "strip", z.ZodTypeAny, {
+    graphId: string;
+    score: number;
+    nodeId: string;
+    alpha: number;
+    epsilon: number;
+    iterations: number;
+    complexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    coherence: {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    };
+    computedAt: string;
+    resultHash: string;
+}, {
+    graphId: string;
+    score: number;
+    nodeId: string;
+    alpha: number;
+    epsilon: number;
+    iterations: number;
+    complexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    coherence: {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    };
+    computedAt: string;
+    resultHash: string;
+}>;
+export type PageRankResult = z.infer<typeof PageRankResultSchema>;
+export declare const SolveQuerySchema: z.ZodObject<{
+    graphId: z.ZodString;
+    rhs: z.ZodArray<z.ZodNumber, "many">;
+    algorithm: z.ZodDefault<z.ZodEnum<["cg", "neumann", "random-walk"]>>;
+    maxComplexityClass: z.ZodDefault<z.ZodEnum<["constant", "logarithmic", "polylogarithmic", "sublinear", "linear", "linearithmic", "polynomial", "exponential", "doubleExponential", "adaptive", "unknown", "unbounded"]>>;
+    coherenceThreshold: z.ZodDefault<z.ZodNumber>;
+}, "strip", z.ZodTypeAny, {
+    graphId: string;
+    maxComplexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    coherenceThreshold: number;
+    rhs: number[];
+    algorithm: "cg" | "neumann" | "random-walk";
+}, {
+    graphId: string;
+    rhs: number[];
+    maxComplexityClass?: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded" | undefined;
+    coherenceThreshold?: number | undefined;
+    algorithm?: "cg" | "neumann" | "random-walk" | undefined;
+}>;
+export type SolveQuery = z.infer<typeof SolveQuerySchema>;
+export declare const SolveResultSchema: z.ZodObject<{
+    graphId: z.ZodString;
+    x: z.ZodArray<z.ZodNumber, "many">;
+    residualNorm: z.ZodNumber;
+    iterations: z.ZodNumber;
+    complexityClass: z.ZodEnum<["constant", "logarithmic", "polylogarithmic", "sublinear", "linear", "linearithmic", "polynomial", "exponential", "doubleExponential", "adaptive", "unknown", "unbounded"]>;
+    coherence: z.ZodObject<{
+        /** Per-row margin (min over rows of (|diag| − Σ|off|) / |diag|). Range (−∞, 1]. */
+        score: z.ZodNumber;
+        /** Did the matrix pass the configured threshold? */
+        passed: z.ZodBoolean;
+        /** Threshold used. 0 = gate disabled (wire-compatible default). */
+        threshold: z.ZodNumber;
+    }, "strip", z.ZodTypeAny, {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    }, {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    }>;
+    computedAt: z.ZodString;
+}, "strip", z.ZodTypeAny, {
+    graphId: string;
+    iterations: number;
+    complexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    coherence: {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    };
+    computedAt: string;
+    x: number[];
+    residualNorm: number;
+}, {
+    graphId: string;
+    iterations: number;
+    complexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    coherence: {
+        score: number;
+        passed: boolean;
+        threshold: number;
+    };
+    computedAt: string;
+    x: number[];
+    residualNorm: number;
+}>;
+export type SolveResult = z.infer<typeof SolveResultSchema>;
+export declare const SparseDeltaSchema: z.ZodObject<{
+    indices: z.ZodArray<z.ZodNumber, "many">;
+    values: z.ZodArray<z.ZodNumber, "many">;
+}, "strip", z.ZodTypeAny, {
+    values: number[];
+    indices: number[];
+}, {
+    values: number[];
+    indices: number[];
+}>;
+export type SparseDelta = z.infer<typeof SparseDeltaSchema>;
+export declare const SolveOnChangeQuerySchema: z.ZodObject<{
+    graphId: z.ZodString;
+    prevSolution: z.ZodArray<z.ZodNumber, "many">;
+    delta: z.ZodObject<{
+        indices: z.ZodArray<z.ZodNumber, "many">;
+        values: z.ZodArray<z.ZodNumber, "many">;
+    }, "strip", z.ZodTypeAny, {
+        values: number[];
+        indices: number[];
+    }, {
+        values: number[];
+        indices: number[];
+    }>;
+    algorithm: z.ZodDefault<z.ZodEnum<["cg", "neumann"]>>;
+    maxComplexityClass: z.ZodDefault<z.ZodEnum<["constant", "logarithmic", "polylogarithmic", "sublinear", "linear", "linearithmic", "polynomial", "exponential", "doubleExponential", "adaptive", "unknown", "unbounded"]>>;
+}, "strip", z.ZodTypeAny, {
+    graphId: string;
+    maxComplexityClass: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded";
+    algorithm: "cg" | "neumann";
+    prevSolution: number[];
+    delta: {
+        values: number[];
+        indices: number[];
+    };
+}, {
+    graphId: string;
+    prevSolution: number[];
+    delta: {
+        values: number[];
+        indices: number[];
+    };
+    maxComplexityClass?: "unknown" | "constant" | "logarithmic" | "polylogarithmic" | "sublinear" | "linear" | "linearithmic" | "polynomial" | "exponential" | "doubleExponential" | "adaptive" | "unbounded" | undefined;
+    algorithm?: "cg" | "neumann" | undefined;
+}>;
+export type SolveOnChangeQuery = z.infer<typeof SolveOnChangeQuerySchema>;
+export declare const GraphIntelErrorKindSchema: z.ZodEnum<["complexity-budget-exceeded", "coherence-rejected", "graph-not-found", "invalid-input", "solver-failed", "not-applicable"]>;
+export type GraphIntelErrorKind = z.infer<typeof GraphIntelErrorKindSchema>;
+export interface GraphIntelError {
+    kind: GraphIntelErrorKind;
+    message: string;
+    recoverable: boolean;
+    /** If `complexity-budget-exceeded`: what class was needed vs requested. */
+    requiredClass?: ComplexityClass;
+    requestedClass?: ComplexityClass;
+    /** If `coherence-rejected`: actual vs threshold. */
+    coherence?: number;
+    threshold?: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/domain/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/domain/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAMxB,eAAO,MAAM,iBAAiB;;;;;;;;;;;;EAI5B,CAAC;AACH,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAE5D,eAAO,MAAM,kBAAkB;IAC7B,mFAAmF;;IAEnF,yCAAyC;;IAEzC,wBAAwB;;;;;;;;;;;;;;IAExB,4EAA4E;;IAE5E,0CAA0C;;IAE1C,yCAAyC;;IAEzC,yEAAyE;;;;;;;;;;;;;;;;;;;;;;;;;;EAEzE,CAAC;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAM9D;;;GAGG;AACH,eAAO,MAAM,qBAAqB,wLAahC,CAAC;AACH,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,qBAAqB,CAAC,CAAC;AAEpE,wDAAwD;AACxD,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,eAAe,CAAC;IACzB,KAAK,EAAE,eAAe,CAAC;CACxB;AAkBD,mCAAmC;AACnC,wBAAgB,UAAU,CAAC,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,GAAG,OAAO,CAEpF;AAED,8CAA8C;AAC9C,wBAAgB,UAAU,CAAC,CAAC,EAAE,eAAe,GAAG,OAAO,CAEtD;AAMD,eAAO,MAAM,qBAAqB;IAChC,mFAAmF;;IAEnF,oDAAoD;;IAEpD,mEAAmE;;;;;;;;;;EAEnE,CAAC;AACH,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,qBAAqB,CAAC,CAAC;AAMpE,eAAO,MAAM,mBAAmB;;IAE9B,8DAA8D;;IAE9D,oCAAoC;;IAEpC,0CAA0C;;IAE1C,6EAA6E;;IAE7E,mDAAmD;;IAEnD,qCAAqC;;;;;;;;;;;;;;;;;;EAErC,CAAC;AACH,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAEhE,eAAO,MAAM,oBAAoB;;;;;;;IAO/B,sCAAsC;;IAEtC,iDAAiD;;QAvCjD,mFAAmF;;QAEnF,oDAAoD;;QAEpD,mEAAmE;;;;;;;;;;;;IAsCnE,2FAA2F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAE3F,CAAC;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,oBAAoB,CAAC,CAAC;AAMlE,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;;;EAM3B,CAAC;AACH,MAAM,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAE1D,eAAO,MAAM,iBAAiB;;;;;;;QA5D5B,mFAAmF;;QAEnF,oDAAoD;;QAEpD,mEAAmE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAgEnE,CAAC;AACH,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAM5D,eAAO,MAAM,iBAAiB;;;;;;;;;EAG5B,CAAC;AACH,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAE5D,eAAO,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAMnC,CAAC;AACH,MAAM,MAAM,kBAAkB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,wBAAwB,CAAC,CAAC;AAM1E,eAAO,MAAM,yBAAyB,wIAOpC,CAAC;AACH,MAAM,MAAM,mBAAmB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,yBAAyB,CAAC,CAAC;AAE5E,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,mBAAmB,CAAC;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,OAAO,CAAC;IACrB,2EAA2E;IAC3E,aAAa,CAAC,EAAE,eAAe,CAAC;IAChC,cAAc,CAAC,EAAE,eAAe,CAAC;IACjC,oDAAoD;IACpD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB"}

package/dist/domain/types.js

@@ -0,0 +1,165 @@
+/**
+ * ruflo-graph-intelligence — Domain Types (ADR-123)
+ *
+ * Core type contract: SparseMatrix shape, ComplexityClass budget, coherence
+ * threshold, signed PR artifact envelope. These are the wire types every
+ * adapter, MCP tool, and federation peer agrees on.
+ */
+import { z } from 'zod';
+// ============================================================================
+// SparseMatrix — the adapter handover shape
+// ============================================================================
+export const SparseEntrySchema = z.object({
+    row: z.number().int().nonnegative(),
+    col: z.number().int().nonnegative(),
+    value: z.number().finite(),
+});
+export const SparseMatrixSchema = z.object({
+    /** Stable identifier — e.g. "ruflo-federation:trust-mesh:2026-05-19T01:00:00Z". */
+    graphId: z.string().min(1),
+    /** Number of rows / columns (square). */
+    size: z.number().int().positive(),
+    /** Non-zero entries. */
+    entries: z.array(SparseEntrySchema),
+    /** Node-id → row-index lookup so callers can talk in domain identifiers. */
+    nodeIndex: z.record(z.number().int().nonnegative()),
+    /** Reverse lookup row-index → node-id. */
+    indexNode: z.array(z.string()),
+    /** When the snapshot was taken (ISO). */
+    capturedAt: z.string(),
+    /** Optional content hash for memoization + signed-artifact integrity. */
+    contentHash: z.string().regex(/^[0-9a-f]{64}$/).optional(),
+});
+// ============================================================================
+// Complexity class — runtime governance budget
+// ============================================================================
+/**
+ * 12-tier upstream `sublinear-time-solver@1.7.0` taxonomy. Ordered.
+ * Lower-cost classes are at the top; Adaptive wraps a (default, worst) pair.
+ */
+export const ComplexityClassSchema = z.enum([
+    'constant', // O(1)
+    'logarithmic', // O(log n)
+    'polylogarithmic', // O((log n)^k)
+    'sublinear', // O(n^α) for α < 1
+    'linear', // O(n)
+    'linearithmic', // O(n log n)
+    'polynomial', // O(n^k)
+    'exponential', // O(2^n)
+    'doubleExponential', // O(2^(2^n))
+    'adaptive', // see adaptiveBound
+    'unknown',
+    'unbounded',
+]);
+/** Ordering — index = cost rank, so `rank('logarithmic') < rank('linear')`. */
+const COMPLEXITY_RANK = {
+    constant: 0,
+    logarithmic: 1,
+    polylogarithmic: 2,
+    sublinear: 3,
+    linear: 4,
+    linearithmic: 5,
+    polynomial: 6,
+    exponential: 7,
+    doubleExponential: 8,
+    adaptive: 4, // worst-case treated as Linear for budget comparisons by default
+    unknown: 8,
+    unbounded: 9,
+};
+/** Is `actual` within `budget`? */
+export function fitsBudget(actual, budget) {
+    return COMPLEXITY_RANK[actual] <= COMPLEXITY_RANK[budget];
+}
+/** Pi-Zero-safe ≈ at most polylogarithmic. */
+export function isEdgeSafe(c) {
+    return COMPLEXITY_RANK[c] <= COMPLEXITY_RANK['polylogarithmic'];
+}
+// ============================================================================
+// Coherence — DD margin for graph stability monitoring
+// ============================================================================
+export const CoherenceReportSchema = z.object({
+    /** Per-row margin (min over rows of (|diag| − Σ|off|) / |diag|). Range (−∞, 1]. */
+    score: z.number(),
+    /** Did the matrix pass the configured threshold? */
+    passed: z.boolean(),
+    /** Threshold used. 0 = gate disabled (wire-compatible default). */
+    threshold: z.number(),
+});
+// ============================================================================
+// PageRank query + result
+// ============================================================================
+export const PageRankQuerySchema = z.object({
+    graphId: z.string(),
+    /** Single-entry query — the node we want the PR score for. */
+    nodeId: z.string(),
+    /** Damping factor. Default 0.85. */
+    alpha: z.number().positive().lt(1).default(0.85),
+    /** ε convergence target. Default 1e-3. */
+    epsilon: z.number().positive().default(1e-3),
+    /** For personalized PR — seed nodes weighted as the restart distribution. */
+    seedNodes: z.array(z.string()).default([]),
+    /** Budget gate. Default `linear` (tier-2-safe). */
+    maxComplexityClass: ComplexityClassSchema.default('linear'),
+    /** DD-margin floor. 0 = disabled. */
+    coherenceThreshold: z.number().default(0),
+});
+export const PageRankResultSchema = z.object({
+    graphId: z.string(),
+    nodeId: z.string(),
+    score: z.number(),
+    alpha: z.number(),
+    epsilon: z.number(),
+    iterations: z.number().int().nonnegative(),
+    /** Class the solver actually used. */
+    complexityClass: ComplexityClassSchema,
+    /** Coherence report attached at compute time. */
+    coherence: CoherenceReportSchema,
+    computedAt: z.string(),
+    /** Hash of (graphId, nodeId, alpha, epsilon, seedNodes, score). Stable for memoization. */
+    resultHash: z.string().regex(/^[0-9a-f]{64}$/),
+});
+// ============================================================================
+// Solve (full vector)
+// ============================================================================
+export const SolveQuerySchema = z.object({
+    graphId: z.string(),
+    rhs: z.array(z.number()),
+    algorithm: z.enum(['cg', 'neumann', 'random-walk']).default('cg'),
+    maxComplexityClass: ComplexityClassSchema.default('linear'),
+    coherenceThreshold: z.number().default(0),
+});
+export const SolveResultSchema = z.object({
+    graphId: z.string(),
+    x: z.array(z.number()),
+    residualNorm: z.number(),
+    iterations: z.number().int().nonnegative(),
+    complexityClass: ComplexityClassSchema,
+    coherence: CoherenceReportSchema,
+    computedAt: z.string(),
+});
+// ============================================================================
+// Incremental solve (Wedge 12 — streaming)
+// ============================================================================
+export const SparseDeltaSchema = z.object({
+    indices: z.array(z.number().int().nonnegative()),
+    values: z.array(z.number()),
+});
+export const SolveOnChangeQuerySchema = z.object({
+    graphId: z.string(),
+    prevSolution: z.array(z.number()),
+    delta: SparseDeltaSchema,
+    algorithm: z.enum(['cg', 'neumann']).default('cg'),
+    maxComplexityClass: ComplexityClassSchema.default('linear'),
+});
+// ============================================================================
+// Structured errors
+// ============================================================================
+export const GraphIntelErrorKindSchema = z.enum([
+    'complexity-budget-exceeded',
+    'coherence-rejected',
+    'graph-not-found',
+    'invalid-input',
+    'solver-failed',
+    'not-applicable',
+]);
+//# sourceMappingURL=types.js.map

package/dist/domain/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/domain/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,+EAA+E;AAC/E,4CAA4C;AAC5C,+EAA+E;AAE/E,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;IACnC,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;IACnC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE;CAC3B,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IACzC,mFAAmF;IACnF,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1B,yCAAyC;IACzC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IACjC,wBAAwB;IACxB,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC;IACnC,4EAA4E;IAC5E,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IACnD,0CAA0C;IAC1C,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC9B,yCAAyC;IACzC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;IACtB,yEAAyE;IACzE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,QAAQ,EAAE;CAC3D,CAAC,CAAC;AAGH,+EAA+E;AAC/E,+CAA+C;AAC/C,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,IAAI,CAAC;IAC1C,UAAU,EAAU,OAAO;IAC3B,aAAa,EAAO,WAAW;IAC/B,iBAAiB,EAAG,eAAe;IACnC,WAAW,EAAS,mBAAmB;IACvC,QAAQ,EAAY,OAAO;IAC3B,cAAc,EAAM,aAAa;IACjC,YAAY,EAAQ,SAAS;IAC7B,aAAa,EAAO,SAAS;IAC7B,mBAAmB,EAAC,aAAa;IACjC,UAAU,EAAU,oBAAoB;IACxC,SAAS;IACT,WAAW;CACZ,CAAC,CAAC;AASH,+EAA+E;AAC/E,MAAM,eAAe,GAAoC;IACvD,QAAQ,EAAE,CAAC;IACX,WAAW,EAAE,CAAC;IACd,eAAe,EAAE,CAAC;IAClB,SAAS,EAAE,CAAC;IACZ,MAAM,EAAE,CAAC;IACT,YAAY,EAAE,CAAC;IACf,UAAU,EAAE,CAAC;IACb,WAAW,EAAE,CAAC;IACd,iBAAiB,EAAE,CAAC;IACpB,QAAQ,EAAE,CAAC,EAAE,iEAAiE;IAC9E,OAAO,EAAE,CAAC;IACV,SAAS,EAAE,CAAC;CACb,CAAC;AAEF,mCAAmC;AACnC,MAAM,UAAU,UAAU,CAAC,MAAuB,EAAE,MAAuB;IACzE,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;AAC5D,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,UAAU,CAAC,CAAkB;IAC3C,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,iBAAiB,CAAC,CAAC;AAClE,CAAC;AAED,+EAA+E;AAC/E,uDAAuD;AACvD,+EAA+E;AAE/E,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,mFAAmF;IACnF,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;IACjB,oDAAoD;IACpD,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE;IACnB,mEAAmE;IACnE,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;CACtB,CAAC,CAAC;AAGH,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,8DAA8D;IAC9D,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;IAClB,oCAAoC;IACpC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;IAChD,0CAA0C;IAC1C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IAC5C,6EAA6E;IAC7E,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IAC1C,mDAAmD;IACnD,kBAAkB,EAAE,qBAAqB,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC3D,qCAAqC;IACrC,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;CAC1C,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;IAClB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;IACjB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;IACjB,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;IAC1C,sCAAsC;IACtC,eAAe,EAAE,qBAAqB;IACtC,iDAAiD;IACjD,SAAS,EAAE,qBAAqB;IAChC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;IACtB,2FAA2F;IAC3F,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC;CAC/C,CAAC,CAAC;AAGH,+EAA+E;AAC/E,sBAAsB;AACtB,+EAA+E;AAE/E,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACxB,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;IACjE,kBAAkB,EAAE,qBAAqB,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC3D,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;CAC1C,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACtB,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE;IACxB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;IAC1C,eAAe,EAAE,qBAAqB;IACtC,SAAS,EAAE,qBAAqB;IAChC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;CACvB,CAAC,CAAC;AAGH,+EAA+E;AAC/E,2CAA2C;AAC3C,+EAA+E;AAE/E,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CAC5B,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACjC,KAAK,EAAE,iBAAiB;IACxB,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;IAClD,kBAAkB,EAAE,qBAAqB,CAAC,OAAO,CAAC,QAAQ,CAAC;CAC5D,CAAC,CAAC;AAGH,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC,IAAI,CAAC;IAC9C,4BAA4B;IAC5B,oBAAoB;IACpB,iBAAiB;IACjB,eAAe;IACf,eAAe;IACf,gBAAgB;CACjB,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,31 @@
+/**
+ * ruflo-graph-intelligence — RuFlo Graph Intelligence Engine (ADR-123)
+ *
+ * Real-time relationship intelligence with complexity-aware execution.
+ *
+ * Three-layer architecture:
+ *   Neural Layer        — adaptive learning (existing — @claude-flow/neural)
+ *   Graph Intelligence  — relationship reasoning (this plugin)
+ *   Complexity Layer    — runtime governance (this plugin)
+ *
+ * Built on `sublinear-time-solver@1.7.0`.
+ */
+export * from './domain/types.js';
+export { AdapterRegistry, getRegistry, resetRegistry, noopUnsubscribe, type SublinearAdapter, } from './domain/adapter.js';
+export { coherenceScore, checkCoherence, singleEntryPageRank, conjugateGradient, neumann, solveOnChange, hashResult, observedComplexity, runPageRank, runSolve, runSolveOnChange, } from './infrastructure/solver-bridge.js';
+export { graphIntelligenceTools, type MCPTool } from './mcp-tools/index.js';
+export * from './adapters/index.js';
+export { jlEmbed, computeTargetDim, type JLEmbedOptions, type JLEmbedResult } from './infrastructure/jl-embed.js';
+export { StreamingBridge, type StreamingBridgeOptions, type StreamingUpdate, } from './application/streaming-bridge.js';
+export { PrArtifactRequestSchema, PrArtifactResponseSchema, PrArtifactDeltaSchema, PrArtifactStaleSchema, FederationMessageSchema, type PrArtifactRequest, type PrArtifactResponse, type PrArtifactDelta, type PrArtifactStale, type FederationMessage, type FederationTransport, } from './domain/federation-protocol.js';
+export { FederationServer, type FederationServerOptions, } from './application/federation-server.js';
+export { FederationClient, inProcessTransport, type FederationClientOptions, type FetchPrResult, } from './application/federation-client.js';
+export { ARTIFACT_ENVELOPE_VERSION, ARTIFACT_ENVELOPE_KIND, SignedPageRankEnvelopeSchema, SignedPageRankPayloadSchema, type SignedPageRankEnvelope, type SignedPageRankPayload, type ArtifactVerificationResult, } from './domain/signed-artifact.js';
+export { generateWitnessKey, loadWitnessKey, resolveWitnessKey, sealArtifact, verifyArtifact, canonicalJSON, sha256Hex, type WitnessKey, type SealArtifactInput, } from './infrastructure/witness-signer.js';
+import { getRegistry } from './domain/adapter.js';
+declare const _default: {
+    tools: import("./mcp-tools/index.js").MCPTool[];
+    registry: typeof getRegistry;
+};
+export default _default;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,cAAc,mBAAmB,CAAC;AAClC,OAAO,EACL,eAAe,EACf,WAAW,EACX,aAAa,EACb,eAAe,EACf,KAAK,gBAAgB,GACtB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,cAAc,EACd,cAAc,EACd,mBAAmB,EACnB,iBAAiB,EACjB,OAAO,EACP,aAAa,EACb,UAAU,EACV,kBAAkB,EAClB,WAAW,EACX,QAAQ,EACR,gBAAgB,GACjB,MAAM,mCAAmC,CAAC;AAG3C,OAAO,EAAE,sBAAsB,EAAE,KAAK,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAG5E,cAAc,qBAAqB,CAAC;AAGpC,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,KAAK,cAAc,EAAE,KAAK,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAGlH,OAAO,EACL,eAAe,EACf,KAAK,sBAAsB,EAC3B,KAAK,eAAe,GACrB,MAAM,mCAAmC,CAAC;AAG3C,OAAO,EACL,uBAAuB,EACvB,wBAAwB,EACxB,qBAAqB,EACrB,qBAAqB,EACrB,uBAAuB,EACvB,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,KAAK,eAAe,EACpB,KAAK,eAAe,EACpB,KAAK,iBAAiB,EACtB,KAAK,mBAAmB,GACzB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EACL,gBAAgB,EAChB,KAAK,uBAAuB,GAC7B,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,KAAK,uBAAuB,EAC5B,KAAK,aAAa,GACnB,MAAM,oCAAoC,CAAC;AAG5C,OAAO,EACL,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,EAC5B,2BAA2B,EAC3B,KAAK,sBAAsB,EAC3B,KAAK,qBAAqB,EAC1B,KAAK,0BAA0B,GAChC,MAAM,6BAA6B,CAAC;AACrC,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,cAAc,EACd,aAAa,EACb,SAAS,EACT,KAAK,UAAU,EACf,KAAK,iBAAiB,GACvB,MAAM,oCAAoC,CAAC;AAI5C,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;;;;;AAClD,wBAAwE"}

package/dist/index.js

@@ -0,0 +1,37 @@
+/**
+ * ruflo-graph-intelligence — RuFlo Graph Intelligence Engine (ADR-123)
+ *
+ * Real-time relationship intelligence with complexity-aware execution.
+ *
+ * Three-layer architecture:
+ *   Neural Layer        — adaptive learning (existing — @claude-flow/neural)
+ *   Graph Intelligence  — relationship reasoning (this plugin)
+ *   Complexity Layer    — runtime governance (this plugin)
+ *
+ * Built on `sublinear-time-solver@1.7.0`.
+ */
+// Domain
+export * from './domain/types.js';
+export { AdapterRegistry, getRegistry, resetRegistry, noopUnsubscribe, } from './domain/adapter.js';
+// Infrastructure
+export { coherenceScore, checkCoherence, singleEntryPageRank, conjugateGradient, neumann, solveOnChange, hashResult, observedComplexity, runPageRank, runSolve, runSolveOnChange, } from './infrastructure/solver-bridge.js';
+// MCP tools
+export { graphIntelligenceTools } from './mcp-tools/index.js';
+// Adapters (per-wedge integrations)
+export * from './adapters/index.js';
+// JL embedding (ADR-121 follow-up)
+export { jlEmbed, computeTargetDim } from './infrastructure/jl-embed.js';
+// Streaming bridge (Wedge 12)
+export { StreamingBridge, } from './application/streaming-bridge.js';
+// Federation protocol (Phase 8 — beyond-SOTA)
+export { PrArtifactRequestSchema, PrArtifactResponseSchema, PrArtifactDeltaSchema, PrArtifactStaleSchema, FederationMessageSchema, } from './domain/federation-protocol.js';
+export { FederationServer, } from './application/federation-server.js';
+export { FederationClient, inProcessTransport, } from './application/federation-client.js';
+// Signed PR artifacts (Phase 7 — beyond-SOTA)
+export { ARTIFACT_ENVELOPE_VERSION, ARTIFACT_ENVELOPE_KIND, SignedPageRankEnvelopeSchema, SignedPageRankPayloadSchema, } from './domain/signed-artifact.js';
+export { generateWitnessKey, loadWitnessKey, resolveWitnessKey, sealArtifact, verifyArtifact, canonicalJSON, sha256Hex, } from './infrastructure/witness-signer.js';
+// Default export
+import { graphIntelligenceTools } from './mcp-tools/index.js';
+import { getRegistry } from './domain/adapter.js';
+export default { tools: graphIntelligenceTools, registry: getRegistry };
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,SAAS;AACT,cAAc,mBAAmB,CAAC;AAClC,OAAO,EACL,eAAe,EACf,WAAW,EACX,aAAa,EACb,eAAe,GAEhB,MAAM,qBAAqB,CAAC;AAE7B,iBAAiB;AACjB,OAAO,EACL,cAAc,EACd,cAAc,EACd,mBAAmB,EACnB,iBAAiB,EACjB,OAAO,EACP,aAAa,EACb,UAAU,EACV,kBAAkB,EAClB,WAAW,EACX,QAAQ,EACR,gBAAgB,GACjB,MAAM,mCAAmC,CAAC;AAE3C,YAAY;AACZ,OAAO,EAAE,sBAAsB,EAAgB,MAAM,sBAAsB,CAAC;AAE5E,oCAAoC;AACpC,cAAc,qBAAqB,CAAC;AAEpC,mCAAmC;AACnC,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAA2C,MAAM,8BAA8B,CAAC;AAElH,8BAA8B;AAC9B,OAAO,EACL,eAAe,GAGhB,MAAM,mCAAmC,CAAC;AAE3C,8CAA8C;AAC9C,OAAO,EACL,uBAAuB,EACvB,wBAAwB,EACxB,qBAAqB,EACrB,qBAAqB,EACrB,uBAAuB,GAOxB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EACL,gBAAgB,GAEjB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EACL,gBAAgB,EAChB,kBAAkB,GAGnB,MAAM,oCAAoC,CAAC;AAE5C,8CAA8C;AAC9C,OAAO,EACL,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,EAC5B,2BAA2B,GAI5B,MAAM,6BAA6B,CAAC;AACrC,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,cAAc,EACd,aAAa,EACb,SAAS,GAGV,MAAM,oCAAoC,CAAC;AAE5C,iBAAiB;AACjB,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAClD,eAAe,EAAE,KAAK,EAAE,sBAAsB,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC"}

package/dist/infrastructure/jl-embed.d.ts

@@ -0,0 +1,27 @@
+/**
+ * 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.
+ */
+/** Cap target dim at `n − 1` (Achlioptas / Dasgupta-Gupta). */
+export declare function computeTargetDim(originalDim: number, requestedDim: number, epsilon: number): number;
+export interface JLEmbedOptions {
+    targetDim: number;
+    epsilon?: number;
+    /** Seed for the projection matrix. Default 'ruflo-jl-v1' so it's reproducible. */
+    seed?: string;
+}
+export interface JLEmbedResult {
+    projected: number[][];
+    targetDim: number;
+    /** ε from the input, echoed for reporting. */
+    epsilon: number;
+    /** Confirmed within k ≤ n − 1 bound. */
+    withinAchlioptasBound: boolean;
+}
+/** Project a list of vectors to `targetDim` via a random Gaussian matrix. */
+export declare function jlEmbed(vectors: number[][], options: JLEmbedOptions): JLEmbedResult;
+//# sourceMappingURL=jl-embed.d.ts.map

package/dist/infrastructure/jl-embed.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"jl-embed.d.ts","sourceRoot":"","sources":["../../src/infrastructure/jl-embed.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAoBH,+DAA+D;AAC/D,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAMnG;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,kFAAkF;IAClF,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,aAAa;IAC5B,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,8CAA8C;IAC9C,OAAO,EAAE,MAAM,CAAC;IAChB,wCAAwC;IACxC,qBAAqB,EAAE,OAAO,CAAC;CAChC;AAED,6EAA6E;AAC7E,wBAAgB,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,cAAc,GAAG,aAAa,CA4CnF"}