monomind 2.7.4 → 2.7.6

package/packages/@monomind/cli/dist/src/mcp-tools/coherence/consensus-verify.js

@@ -1,305 +0,0 @@
-/**
- * Consensus Verification Tool - pr_consensus_verify
- *
- * Verifies multi-agent consensus using cosine-similarity coherence analysis.
- * Identifies divergent agents and measures agreement ratios.
- * Connectivity stability uses a degree-ratio heuristic (not spectral decomposition).
- */
-import { ConsensusInputSchema, successResult, errorResult, cosineSimilarity, } from './types.js';
-// Default logger
-const defaultLogger = {
-    debug: (msg, meta) => console.debug(`[pr_consensus_verify] ${msg}`, meta),
-    info: (msg, meta) => console.info(`[pr_consensus_verify] ${msg}`, meta),
-    warn: (msg, meta) => console.warn(`[pr_consensus_verify] ${msg}`, meta),
-    error: (msg, meta) => console.error(`[pr_consensus_verify] ${msg}`, meta),
-};
-// ============================================================================
-// Consensus Analysis Functions
-// ============================================================================
-/**
- * Compute pairwise similarity matrix
- */
-function computeSimilarityMatrix(embeddings) {
-    const n = embeddings.length;
-    const matrix = [];
-    for (let i = 0; i < n; i++) {
-        const row = [];
-        const embi = embeddings[i];
-        for (let j = 0; j < n; j++) {
-            const embj = embeddings[j];
-            row.push(cosineSimilarity(embi, embj));
-        }
-        matrix.push(row);
-    }
-    return matrix;
-}
-/**
- * Compute coherence energy using Sheaf Laplacian approach
- */
-function computeCoherenceEnergy(embeddings) {
-    if (embeddings.length < 2)
-        return 0;
-    const n = embeddings.length;
-    let totalDisagreement = 0;
-    let edgeCount = 0;
-    for (let i = 0; i < n; i++) {
-        for (let j = i + 1; j < n; j++) {
-            const embi = embeddings[i];
-            const embj = embeddings[j];
-            const similarity = cosineSimilarity(embi, embj);
-            const disagreement = 1 - Math.max(0, similarity);
-            totalDisagreement += disagreement;
-            edgeCount++;
-        }
-    }
-    return edgeCount > 0 ? totalDisagreement / edgeCount : 0;
-}
-/**
- * Identify divergent agents whose embeddings differ significantly from the group
- */
-function identifyDivergentAgents(agentStates, threshold) {
-    if (agentStates.length < 2)
-        return [];
-    const embeddings = agentStates.map(s => s.embedding);
-    const n = embeddings.length;
-    const divergentAgents = [];
-    // Compute centroid
-    const firstEmb = embeddings[0];
-    if (!firstEmb)
-        return [];
-    const dim = firstEmb.length;
-    const centroid = new Array(dim).fill(0);
-    for (const emb of embeddings) {
-        for (let d = 0; d < dim; d++) {
-            const val = emb[d];
-            if (val !== undefined) {
-                centroid[d] = (centroid[d] ?? 0) + val / n;
-            }
-        }
-    }
-    // Find agents far from centroid
-    for (let i = 0; i < n; i++) {
-        const embi = embeddings[i];
-        const agentState = agentStates[i];
-        const similarity = cosineSimilarity(embi, centroid);
-        if (similarity < threshold) {
-            divergentAgents.push(agentState.agentId);
-        }
-    }
-    return divergentAgents;
-}
-/**
- * Compute vote-based agreement ratio
- */
-function computeVoteAgreement(agentStates) {
-    const votes = agentStates.filter(s => s.vote !== undefined).map(s => s.vote);
-    if (votes.length < 2)
-        return 1;
-    // Count vote frequencies
-    const voteCounts = new Map();
-    for (const vote of votes) {
-        voteCounts.set(vote, (voteCounts.get(vote) || 0) + 1);
-    }
-    // Agreement is based on majority
-    const values = Array.from(voteCounts.values());
-    const maxCount = values.length > 0 ? Math.max(...values) : 0;
-    return maxCount / votes.length;
-}
-/**
- * Compute connectivity stability from similarity matrix.
- * Uses the ratio of average to maximum degree as a connectivity proxy.
- * A ratio near 1 means uniform connectivity; near 0 means a few nodes
- * dominate connectivity while others are isolated.
- * NOTE: This is NOT a true spectral gap (which requires eigendecomposition
- * of the Laplacian). It is a lightweight degree-based heuristic.
- */
-function computeConnectivityStability(similarityMatrix) {
-    const n = similarityMatrix.length;
-    if (n < 2)
-        return { stable: true, degreeRatio: 1 };
-    // Convert similarity to adjacency (threshold at 0.5)
-    const adjacency = [];
-    for (let i = 0; i < n; i++) {
-        const row = [];
-        const simRow = similarityMatrix[i];
-        for (let j = 0; j < n; j++) {
-            const simVal = simRow[j] ?? 0;
-            row.push(simVal > 0.5 ? simVal : 0);
-        }
-        adjacency.push(row);
-    }
-    // Compute degrees
-    const degrees = [];
-    for (let i = 0; i < n; i++) {
-        let degree = 0;
-        const adjRow = adjacency[i];
-        for (let j = 0; j < n; j++) {
-            degree += adjRow[j] ?? 0;
-        }
-        degrees.push(degree);
-    }
-    const avgDegree = degrees.reduce((a, b) => a + b, 0) / n;
-    const maxDegree = Math.max(...degrees);
-    const degreeRatio = maxDegree > 0 ? avgDegree / maxDegree : 0;
-    const stable = degreeRatio > 0.3;
-    return { stable, degreeRatio };
-}
-/**
- * Get interpretation of consensus results
- */
-function getInterpretation(verified, coherenceScore, divergentAgents, connectivityStable) {
-    if (verified && divergentAgents.length === 0) {
-        return 'Strong consensus achieved - all agents are aligned';
-    }
-    if (verified && divergentAgents.length > 0) {
-        return `Consensus achieved with ${divergentAgents.length} minority agent(s)`;
-    }
-    if (!connectivityStable) {
-        return 'Consensus not achieved - agent network shows poor connectivity (uneven degree distribution)';
-    }
-    if (coherenceScore < 0.5) {
-        return 'Consensus not achieved - significant disagreement between agents';
-    }
-    return `Consensus not achieved - ${divergentAgents.length} divergent agent(s) detected`;
-}
-/**
- * Handler for pr_consensus_verify tool
- */
-async function handler(input, context) {
-    const logger = context?.logger ?? defaultLogger;
-    const startTime = performance.now();
-    try {
-        // Validate input
-        const validationResult = ConsensusInputSchema.safeParse(input);
-        if (!validationResult.success) {
-            logger.error('Input validation failed', { error: validationResult.error.message });
-            return errorResult(`Invalid input: ${validationResult.error.message}`);
-        }
-        const { agentStates, threshold } = validationResult.data;
-        logger.debug('Processing consensus verification', {
-            agentCount: agentStates.length,
-            threshold,
-        });
-        if (agentStates.length === 0) {
-            return errorResult('No agent states provided');
-        }
-        // Validate embedding dimensions are consistent
-        const firstDim = agentStates[0].embedding.length;
-        for (let i = 1; i < agentStates.length; i++) {
-            if (agentStates[i].embedding.length !== firstDim) {
-                return errorResult(`Embedding dimension mismatch: agent ${agentStates[i].agentId} has ` +
-                    `${agentStates[i].embedding.length} dimensions, expected ${firstDim}`);
-            }
-        }
-        const embeddings = agentStates.map(s => s.embedding);
-        let coherenceEnergy;
-        let divergentAgents;
-        // Try to use WASM bridge if available
-        if (context?.bridge?.initialized) {
-            try {
-                logger.debug('Using WASM bridge for coherence check');
-                const float32Embeddings = embeddings.map(e => new Float32Array(e));
-                const result = await context.bridge.checkCoherence(float32Embeddings);
-                coherenceEnergy = result.energy;
-                // WASM doesn't return divergent agents, compute separately
-                divergentAgents = identifyDivergentAgents(agentStates, threshold);
-            }
-            catch (wasmError) {
-                logger.warn('WASM bridge failed, falling back to JS implementation', {
-                    error: wasmError instanceof Error ? wasmError.message : String(wasmError),
-                });
-                coherenceEnergy = computeCoherenceEnergy(embeddings);
-                divergentAgents = identifyDivergentAgents(agentStates, threshold);
-            }
-        }
-        else {
-            // Pure JavaScript fallback
-            logger.debug('Using JavaScript fallback for consensus verification');
-            coherenceEnergy = computeCoherenceEnergy(embeddings);
-            divergentAgents = identifyDivergentAgents(agentStates, threshold);
-        }
-        // Compute additional metrics
-        const similarityMatrix = computeSimilarityMatrix(embeddings);
-        const { stable: connectivityStable, degreeRatio } = computeConnectivityStability(similarityMatrix);
-        const voteAgreement = computeVoteAgreement(agentStates);
-        // Coherence score is inverse of energy
-        const coherenceScore = 1 - coherenceEnergy;
-        // Agreement ratio combines embedding coherence and vote agreement
-        const agreementRatio = (coherenceScore + voteAgreement) / 2;
-        // Consensus is verified if agreement exceeds threshold and no major divergence
-        const verified = agreementRatio >= threshold &&
-            divergentAgents.length <= Math.floor(agentStates.length * 0.2); // Allow 20% minority
-        const output = {
-            verified,
-            coherenceScore,
-            divergentAgents,
-            details: {
-                agreementRatio,
-                coherenceEnergy,
-                connectivityStable,
-                degreeRatio,
-                interpretation: getInterpretation(verified, coherenceScore, divergentAgents, connectivityStable),
-                agentCount: agentStates.length,
-            },
-        };
-        const duration = performance.now() - startTime;
-        logger.info('Consensus verification completed', {
-            verified,
-            coherenceScore: coherenceScore.toFixed(4),
-            divergentAgents: divergentAgents.length,
-            durationMs: duration.toFixed(2),
-        });
-        return successResult(output);
-    }
-    catch (error) {
-        const duration = performance.now() - startTime;
-        logger.error('Consensus verification failed', {
-            error: error instanceof Error ? error.message : String(error),
-            durationMs: duration.toFixed(2),
-        });
-        return errorResult(error instanceof Error ? error : new Error(String(error)));
-    }
-}
-/**
- * pr_consensus_verify MCP Tool Definition
- */
-export const consensusVerifyTool = {
-    name: 'pr_consensus_verify',
-    description: 'Verify multi-agent consensus using cosine-similarity coherence analysis. Identifies divergent agents, measures agreement ratios, and checks connectivity stability via degree-ratio heuristic.',
-    category: 'consensus',
-    version: '0.1.3',
-    tags: ['consensus', 'multi-agent', 'coherence', 'swarm', 'ai-interpretability'],
-    cacheable: false, // Agent states change frequently
-    inputSchema: {
-        type: 'object',
-        properties: {
-            agentStates: {
-                type: 'array',
-                items: {
-                    type: 'object',
-                    properties: {
-                        agentId: { type: 'string', description: 'Unique agent identifier' },
-                        embedding: {
-                            type: 'array',
-                            items: { type: 'number' },
-                            description: 'Agent state embedding vector',
-                        },
-                        vote: { type: 'string', description: 'Agent vote or decision' },
-                        metadata: { type: 'object', description: 'Additional agent metadata' },
-                    },
-                    required: ['agentId', 'embedding'],
-                },
-                description: 'Array of agent states to verify consensus',
-            },
-            threshold: {
-                type: 'number',
-                default: 0.8,
-                description: 'Required agreement threshold (0-1)',
-            },
-        },
-        required: ['agentStates'],
-    },
-    handler,
-};
-export default consensusVerifyTool;
-//# sourceMappingURL=consensus-verify.js.map

package/packages/@monomind/cli/dist/src/mcp-tools/coherence/memory-gate.d.ts

@@ -1,16 +0,0 @@
-/**
- * Memory Gate Tool - pr_memory_gate
- *
- * Pre-storage coherence gate for memory entries.
- * Validates that new entries are coherent with existing context before storage.
- * Uses cosine similarity on vectors to compute coherence energy.
- * When no pre-computed embeddings are supplied, falls back to a deterministic
- * hash-based vector (structural proxy, not semantic similarity).
- */
-import type { MCPTool } from './types.js';
-/**
- * pr_memory_gate MCP Tool Definition
- */
-export declare const memoryGateTool: MCPTool;
-export default memoryGateTool;
-//# sourceMappingURL=memory-gate.d.ts.map

package/packages/@monomind/cli/dist/src/mcp-tools/coherence/memory-gate.js

@@ -1,279 +0,0 @@
-/**
- * Memory Gate Tool - pr_memory_gate
- *
- * Pre-storage coherence gate for memory entries.
- * Validates that new entries are coherent with existing context before storage.
- * Uses cosine similarity on vectors to compute coherence energy.
- * When no pre-computed embeddings are supplied, falls back to a deterministic
- * hash-based vector (structural proxy, not semantic similarity).
- */
-import { MemoryGateInputSchema, successResult, errorResult, cosineSimilarity, } from './types.js';
-// Default logger
-const defaultLogger = {
-    debug: (msg, meta) => console.debug(`[pr_memory_gate] ${msg}`, meta),
-    info: (msg, meta) => console.info(`[pr_memory_gate] ${msg}`, meta),
-    warn: (msg, meta) => console.warn(`[pr_memory_gate] ${msg}`, meta),
-    error: (msg, meta) => console.error(`[pr_memory_gate] ${msg}`, meta),
-};
-// ============================================================================
-// Memory Gate Functions
-// ============================================================================
-/**
- * Deterministic hash-based vector from value content.
- * This is NOT a semantic embedding -- it produces a normalized vector
- * derived from character codes via an LCG, so only identical (or
- * near-identical) strings will be "similar". It serves as a
- * structural-consistency proxy when no real embedding model is available.
- *
- * For real semantic similarity, use the generateEmbedding() from
- * neural-tools.ts which tries ONNX first and falls back to a
- * deterministic hash.
- */
-function hashVector(value) {
-    const str = typeof value === 'string' ? value : JSON.stringify(value);
-    // Seed from string content
-    let seed = 0;
-    for (let i = 0; i < str.length; i++) {
-        seed = ((seed * 1103515245 + 12345) & 0x7fffffff) ^ (str.charCodeAt(i) * (i + 1));
-    }
-    // Generate deterministic vector via LCG
-    const dims = 64;
-    const vec = new Array(dims);
-    for (let i = 0; i < dims; i++) {
-        seed = (seed * 1103515245 + 12345) & 0x7fffffff;
-        vec[i] = (seed / 0x7fffffff) * 2 - 1;
-    }
-    // Normalize
-    let norm = 0;
-    for (let i = 0; i < dims; i++) {
-        norm += vec[i] * vec[i];
-    }
-    norm = Math.sqrt(norm);
-    if (norm > 0) {
-        for (let i = 0; i < dims; i++) {
-            vec[i] /= norm;
-        }
-    }
-    return vec;
-}
-/**
- * Compute coherence energy using Sheaf Laplacian
- */
-function computeCoherenceEnergy(newEmbedding, existingEmbeddings) {
-    if (existingEmbeddings.length === 0)
-        return 0;
-    let totalDisagreement = 0;
-    for (const existing of existingEmbeddings) {
-        const similarity = cosineSimilarity(newEmbedding, existing);
-        const disagreement = 1 - Math.max(0, similarity);
-        totalDisagreement += disagreement;
-    }
-    return totalDisagreement / existingEmbeddings.length;
-}
-/**
- * Detect specific violations
- */
-function detectViolations(newEmbedding, existingEmbeddings, warnThreshold) {
-    const violations = [];
-    for (let i = 0; i < existingEmbeddings.length; i++) {
-        const similarity = cosineSimilarity(newEmbedding, existingEmbeddings[i]);
-        if (similarity < -0.3) {
-            violations.push(`Strong contradiction with context entry ${i} (similarity: ${similarity.toFixed(3)})`);
-        }
-        else if (similarity < warnThreshold) {
-            violations.push(`Weak coherence with context entry ${i} (similarity: ${similarity.toFixed(3)})`);
-        }
-    }
-    return violations;
-}
-/**
- * Determine action based on coherence energy
- */
-function determineAction(energy, thresholds) {
-    if (energy >= thresholds.reject) {
-        return 'reject';
-    }
-    if (energy >= thresholds.warn) {
-        return 'warn';
-    }
-    return 'allow';
-}
-/**
- * Get interpretation of memory gate result
- */
-function getInterpretation(action, energy, violations) {
-    switch (action) {
-        case 'allow':
-            return 'Entry is coherent with existing context - storage allowed';
-        case 'warn':
-            return `Entry has minor inconsistencies (energy: ${energy.toFixed(3)}) - storage allowed with warning`;
-        case 'reject':
-            return `Entry contradicts existing context (energy: ${energy.toFixed(3)}) - storage blocked. ${violations.length} violation(s) detected.`;
-    }
-}
-/**
- * Handler for pr_memory_gate tool
- */
-async function handler(input, context) {
-    const logger = context?.logger ?? defaultLogger;
-    const startTime = performance.now();
-    try {
-        // Validate input
-        const validationResult = MemoryGateInputSchema.safeParse(input);
-        if (!validationResult.success) {
-            logger.error('Input validation failed', { error: validationResult.error.message });
-            return errorResult(`Invalid input: ${validationResult.error.message}`);
-        }
-        const { key, value, existingVectors, thresholds } = validationResult.data;
-        // Get thresholds from config or input
-        const warnThreshold = thresholds?.warn ?? context?.config?.coherence?.warnThreshold ?? 0.3;
-        const rejectThreshold = thresholds?.reject ?? context?.config?.coherence?.rejectThreshold ?? 0.7;
-        logger.debug('Processing memory gate check', {
-            key,
-            hasExistingContext: !!existingVectors?.length,
-            contextSize: existingVectors?.length ?? 0,
-            warnThreshold,
-            rejectThreshold,
-        });
-        // Generate hash-based vector for the new value (not a semantic embedding --
-        // only detects near-identical content, not semantic similarity)
-        const newEmbedding = hashVector(value);
-        // If no existing context, always allow
-        if (!existingVectors || existingVectors.length === 0) {
-            const output = {
-                allowed: true,
-                coherenceEnergy: 0,
-                details: {
-                    action: 'allow',
-                    violations: [],
-                    confidence: 1,
-                    interpretation: 'No existing context - entry allowed',
-                    contextSize: 0,
-                },
-            };
-            const duration = performance.now() - startTime;
-            logger.info('Memory gate check completed (no context)', {
-                key,
-                allowed: true,
-                durationMs: duration.toFixed(2),
-            });
-            return successResult(output);
-        }
-        // Validate embedding dimensions match
-        const firstDim = existingVectors[0].length;
-        for (let i = 1; i < existingVectors.length; i++) {
-            if (existingVectors[i].length !== firstDim) {
-                return errorResult(`Context embedding dimension mismatch: entry ${i} has ${existingVectors[i].length} dimensions, expected ${firstDim}`);
-            }
-        }
-        let coherenceEnergy;
-        let violations;
-        // Try to use WASM bridge if available
-        if (context?.bridge?.initialized) {
-            try {
-                logger.debug('Using WASM bridge for coherence check');
-                const allEmbeddings = [
-                    new Float32Array(newEmbedding),
-                    ...existingVectors.map(v => new Float32Array(v)),
-                ];
-                const result = await context.bridge.checkCoherence(allEmbeddings);
-                coherenceEnergy = result.energy;
-                violations = result.violations;
-            }
-            catch (wasmError) {
-                logger.warn('WASM bridge failed, falling back to JS implementation', {
-                    error: wasmError instanceof Error ? wasmError.message : String(wasmError),
-                });
-                coherenceEnergy = computeCoherenceEnergy(newEmbedding, existingVectors);
-                violations = detectViolations(newEmbedding, existingVectors, warnThreshold);
-            }
-        }
-        else {
-            // Pure JavaScript fallback
-            logger.debug('Using JavaScript fallback for memory gate');
-            coherenceEnergy = computeCoherenceEnergy(newEmbedding, existingVectors);
-            violations = detectViolations(newEmbedding, existingVectors, warnThreshold);
-        }
-        const action = determineAction(coherenceEnergy, { warn: warnThreshold, reject: rejectThreshold });
-        const allowed = action !== 'reject';
-        const confidence = 1 - coherenceEnergy;
-        const output = {
-            allowed,
-            coherenceEnergy,
-            reason: !allowed ? `Coherence energy ${coherenceEnergy.toFixed(3)} exceeds reject threshold ${rejectThreshold}` : undefined,
-            details: {
-                action,
-                violations,
-                confidence,
-                interpretation: getInterpretation(action, coherenceEnergy, violations),
-                contextSize: existingVectors.length,
-            },
-        };
-        const duration = performance.now() - startTime;
-        logger.info('Memory gate check completed', {
-            key,
-            allowed,
-            action,
-            coherenceEnergy: coherenceEnergy.toFixed(4),
-            violations: violations.length,
-            durationMs: duration.toFixed(2),
-        });
-        return successResult(output);
-    }
-    catch (error) {
-        const duration = performance.now() - startTime;
-        logger.error('Memory gate check failed', {
-            error: error instanceof Error ? error.message : String(error),
-            durationMs: duration.toFixed(2),
-        });
-        return errorResult(error instanceof Error ? error : new Error(String(error)));
-    }
-}
-/**
- * pr_memory_gate MCP Tool Definition
- */
-export const memoryGateTool = {
-    name: 'pr_memory_gate',
-    description: 'Pre-storage coherence gate for memory entries. Validates new entries against existing context vectors using cosine-similarity energy. When no pre-computed embeddings are supplied, uses a deterministic hash-based vector (structural proxy, not semantic). Blocks contradictory entries to maintain memory coherence.',
-    category: 'memory',
-    version: '0.1.3',
-    tags: ['memory', 'coherence', 'gate', 'validation', 'ai-interpretability'],
-    cacheable: false, // Context changes frequently
-    inputSchema: {
-        type: 'object',
-        properties: {
-            key: {
-                type: 'string',
-                description: 'Memory entry key',
-            },
-            value: {
-                description: 'Value to be stored (any JSON-serializable type)',
-            },
-            existingVectors: {
-                type: 'array',
-                items: { type: 'array', items: { type: 'number' } },
-                description: 'Existing context embeddings to check against',
-            },
-            thresholds: {
-                type: 'object',
-                properties: {
-                    warn: {
-                        type: 'number',
-                        default: 0.3,
-                        description: 'Energy threshold for warnings (0-1)',
-                    },
-                    reject: {
-                        type: 'number',
-                        default: 0.7,
-                        description: 'Energy threshold for rejection (0-1)',
-                    },
-                },
-                description: 'Custom coherence thresholds',
-            },
-        },
-        required: ['key', 'value'],
-    },
-    handler,
-};
-export default memoryGateTool;
-//# sourceMappingURL=memory-gate.js.map

package/packages/@monomind/cli/dist/src/mcp-tools/coherence/quantum-topology.d.ts

@@ -1,15 +0,0 @@
-/**
- * Computational Topology Tool - pr_quantum_topology
- *
- * Computes topological features including Betti numbers (b0, b1) and
- * persistence diagrams via Vietoris-Rips filtration.
- * Analyzes topological features of point clouds and simplicial complexes.
- * b2 (voids) is not computed -- requires boundary-operator linear algebra.
- */
-import type { MCPTool } from './types.js';
-/**
- * pr_quantum_topology MCP Tool Definition
- */
-export declare const quantumTopologyTool: MCPTool;
-export default quantumTopologyTool;
-//# sourceMappingURL=quantum-topology.d.ts.map