@ulrichc1/sparn 1.0.0

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/adapters/claude-code.ts","../src/core/btsp-embedder.ts","../src/utils/hash.ts","../src/core/confidence-states.ts","../src/core/engram-scorer.ts","../src/utils/tokenizer.ts","../src/core/sparse-pruner.ts","../src/adapters/generic.ts","../src/core/kv-memory.ts","../src/core/sleep-compressor.ts","../src/types/config.ts","../src/utils/logger.ts"],"sourcesContent":["/**\n * Sparn - Neuroscience-inspired context optimization\n *\n * Main library export for programmatic API usage.\n * Per Article I: CLI-First, Library-Second - all core modules are importable.\n */\n\nexport { createClaudeCodeAdapter } from './adapters/claude-code.js';\nexport { createGenericAdapter } from './adapters/generic.js';\nexport type { BTSPEmbedder } from './core/btsp-embedder.js';\nexport { createBTSPEmbedder } from './core/btsp-embedder.js';\nexport type { ConfidenceStates, ConfidenceStatesConfig } from './core/confidence-states.js';\nexport { createConfidenceStates } from './core/confidence-states.js';\nexport type { EngramScorer, EngramScorerConfig } from './core/engram-scorer.js';\nexport { createEngramScorer } from './core/engram-scorer.js';\nexport type { KVMemory } from './core/kv-memory.js';\n// Core modules\nexport { createKVMemory } from './core/kv-memory.js';\nexport type { SleepCompressor } from './core/sleep-compressor.js';\n\nexport { createSleepCompressor } from './core/sleep-compressor.js';\nexport type { SparsePruner, SparsePrunerConfig } from './core/sparse-pruner.js';\nexport { createSparsePruner } from './core/sparse-pruner.js';\nexport type {\n  AgentAdapter,\n  OptimizationResult,\n  OptimizeOptions,\n} from './types/adapter.js';\n\nexport type {\n  AgentType,\n  DecayConfig,\n  PruningConfig,\n  SparnConfig,\n  StatesConfig,\n  UIConfig,\n} from './types/config.js';\n\nexport { DEFAULT_CONFIG } from './types/config.js';\nexport type { ConsolidateResult, DuplicateGroup } from './types/consolidate.js';\n// Types\nexport type {\n  ConfidenceState,\n  MemoryEntry,\n  MemoryQueryFilters,\n  StateDistribution,\n} from './types/memory.js';\nexport type { PruneResult } from './types/pruner.js';\nexport { hashContent } from './utils/hash.js';\nexport type { Logger, LogLevel } from './utils/logger.js';\nexport { createLogger } from './utils/logger.js';\n// Utilities\nexport { estimateTokens } from './utils/tokenizer.js';\n","/**\n * Claude Code Adapter - Claude Code-specific optimization pipeline\n *\n * Optimized for Claude Code's conversation patterns, tool use, and context management.\n * Implements the same AgentAdapter interface as GenericAdapter but with Claude-specific tuning.\n */\n\nimport { randomUUID } from 'node:crypto';\nimport { createBTSPEmbedder } from '../core/btsp-embedder.js';\nimport { createConfidenceStates } from '../core/confidence-states.js';\nimport { createEngramScorer } from '../core/engram-scorer.js';\nimport type { KVMemory } from '../core/kv-memory.js';\nimport { createSparsePruner } from '../core/sparse-pruner.js';\nimport type { AgentAdapter, OptimizationResult, OptimizeOptions } from '../types/adapter.js';\nimport type { SparnConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from '../utils/hash.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n/**\n * Claude Code-specific optimization profile\n * Tuned for Claude's conversation patterns and tool use\n */\nconst CLAUDE_CODE_PROFILE = {\n  // More aggressive pruning for tool results (they can be verbose)\n  toolResultThreshold: 3, // Keep top 3% of tool results\n\n  // Preserve conversation turns more aggressively\n  conversationBoost: 1.5, // 50% boost for User/Assistant exchanges\n\n  // Prioritize recent context (Claude Code sessions are typically focused)\n  recentContextWindow: 10 * 60, // Last 10 minutes gets priority\n\n  // BTSP patterns specific to Claude Code\n  btspPatterns: [\n    // Error patterns\n    /\\b(error|exception|failure|fatal|critical|panic)\\b/i,\n    /^\\s+at\\s+.*\\(.*:\\d+:\\d+\\)/m, // Stack traces\n    /^Error:/m,\n\n    // Git conflict markers\n    /^<<<<<<< /m,\n    /^=======/m,\n    /^>>>>>>> /m,\n\n    // Tool use patterns (important for context)\n    /<function_calls>/,\n    /<invoke>/,\n    /<tool_use>/,\n\n    // File operation results (often critical)\n    /ENOENT|EACCES|EISDIR|EEXIST/,\n  ],\n};\n\n/**\n * Create a Claude Code adapter instance\n * @param memory - KV memory store\n * @param config - Sparn configuration\n * @returns AgentAdapter instance optimized for Claude Code\n */\nexport function createClaudeCodeAdapter(memory: KVMemory, config: SparnConfig): AgentAdapter {\n  // Create core modules with Claude Code-optimized settings\n  const pruner = createSparsePruner({\n    threshold: config.pruning.threshold,\n  });\n\n  const scorer = createEngramScorer(config.decay);\n  const states = createConfidenceStates(config.states);\n  const btsp = createBTSPEmbedder();\n\n  async function optimize(\n    context: string,\n    options: OptimizeOptions = {},\n  ): Promise<OptimizationResult> {\n    const startTime = Date.now();\n\n    // Parse context into entries\n    // For Claude Code, we parse by conversation turns and tool uses\n    const entries = parseClaudeCodeContext(context);\n\n    // Apply BTSP detection with Claude Code-specific patterns\n    const entriesWithBTSP = entries.map((entry) => {\n      const isBTSP = CLAUDE_CODE_PROFILE.btspPatterns.some((pattern) =>\n        pattern.test(entry.content),\n      );\n\n      if (isBTSP) {\n        const btspEntry = btsp.createBTSPEntry(entry.content, [...entry.tags, 'claude-code'], {\n          originalTimestamp: entry.timestamp,\n        });\n        // Preserve original timestamp\n        return {\n          ...btspEntry,\n          timestamp: entry.timestamp,\n        };\n      }\n\n      return entry;\n    });\n\n    // Apply conversation boost to User/Assistant exchanges\n    const boostedEntries = entriesWithBTSP.map((entry) => {\n      const isConversationTurn =\n        entry.content.trim().startsWith('User:') || entry.content.trim().startsWith('Assistant:');\n\n      if (isConversationTurn) {\n        return {\n          ...entry,\n          score: entry.score * CLAUDE_CODE_PROFILE.conversationBoost,\n        };\n      }\n\n      return entry;\n    });\n\n    // Score entries with decay\n    const scoredEntries = boostedEntries.map((entry) => {\n      const decayScore = scorer.calculateScore(entry);\n      return {\n        ...entry,\n        score: decayScore,\n      };\n    });\n\n    // Calculate states\n    const entriesWithStates = scoredEntries.map((entry) => {\n      const state = states.calculateState(entry);\n      return {\n        ...entry,\n        state,\n      };\n    });\n\n    // Prune entries (keep top N%)\n    const pruneResult = pruner.prune(entriesWithStates);\n\n    // Store kept entries in memory (if not dry-run)\n    if (!options.dryRun) {\n      for (const entry of pruneResult.kept) {\n        await memory.put(entry);\n      }\n\n      // Record optimization stats\n      await memory.recordOptimization({\n        timestamp: Date.now(),\n        tokens_before: pruneResult.originalTokens,\n        tokens_after: pruneResult.prunedTokens,\n        entries_pruned: pruneResult.removed.length,\n        duration_ms: Date.now() - startTime,\n      });\n    }\n\n    // Build optimized context from kept entries\n    const optimizedContext = pruneResult.kept.map((entry) => entry.content).join('\\n');\n\n    // Calculate state distribution\n    const stateDistribution = states.getDistribution(pruneResult.kept);\n\n    // Build result\n    const result: OptimizationResult = {\n      optimizedContext,\n      tokensBefore: pruneResult.originalTokens,\n      tokensAfter: pruneResult.prunedTokens,\n      reduction:\n        pruneResult.originalTokens > 0\n          ? (pruneResult.originalTokens - pruneResult.prunedTokens) / pruneResult.originalTokens\n          : 0,\n      entriesProcessed: entries.length,\n      entriesKept: pruneResult.kept.length,\n      durationMs: Date.now() - startTime,\n      stateDistribution,\n    };\n\n    // Add verbose details if requested\n    if (options.verbose) {\n      result.details = pruneResult.kept.map((entry) => ({\n        id: entry.id,\n        score: entry.score,\n        state: entry.state || 'unknown',\n        isBTSP: entry.tags.includes('btsp'),\n        tokens: estimateTokens(entry.content),\n      }));\n    }\n\n    return result;\n  }\n\n  return {\n    optimize,\n  };\n}\n\n/**\n * Parse Claude Code context into memory entries\n * Handles conversation turns, tool uses, and results\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nfunction parseClaudeCodeContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split by conversation turns and tool boundaries\n  const lines = context.split('\\n');\n  let currentBlock: string[] = [];\n  let blockType: 'conversation' | 'tool' | 'result' | 'other' = 'other';\n\n  for (const line of lines) {\n    const trimmed = line.trim();\n\n    // Detect conversation turns\n    if (trimmed.startsWith('User:') || trimmed.startsWith('Assistant:')) {\n      if (currentBlock.length > 0) {\n        entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n        currentBlock = [];\n      }\n      blockType = 'conversation';\n      currentBlock.push(line);\n    }\n    // Detect tool calls\n    else if (\n      trimmed.includes('<function_calls>') ||\n      trimmed.includes('<invoke>') ||\n      trimmed.includes('<tool_use>')\n    ) {\n      if (currentBlock.length > 0) {\n        entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n        currentBlock = [];\n      }\n      blockType = 'tool';\n      currentBlock.push(line);\n    }\n    // Detect tool results\n    else if (trimmed.includes('<function_results>') || trimmed.includes('</function_results>')) {\n      if (currentBlock.length > 0 && blockType !== 'result') {\n        entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n        currentBlock = [];\n      }\n      blockType = 'result';\n      currentBlock.push(line);\n    }\n    // Continue current block\n    else if (currentBlock.length > 0) {\n      currentBlock.push(line);\n    }\n    // Start new block if line has content\n    else if (trimmed.length > 0) {\n      currentBlock.push(line);\n      blockType = 'other';\n    }\n  }\n\n  // Add final block\n  if (currentBlock.length > 0) {\n    entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n  }\n\n  return entries.filter((e) => e.content.trim().length > 0);\n}\n\n/**\n * Create a memory entry from a content block\n * @param content - Block content\n * @param type - Block type\n * @param baseTime - Base timestamp\n * @returns Memory entry\n */\nfunction createEntry(\n  content: string,\n  type: 'conversation' | 'tool' | 'result' | 'other',\n  baseTime: number,\n): MemoryEntry {\n  const tags: string[] = [type];\n\n  // Assign initial score based on type\n  let initialScore = 0.5;\n  if (type === 'conversation') initialScore = 0.8; // Prioritize conversation\n  if (type === 'tool') initialScore = 0.7; // Tool calls are important\n  if (type === 'result') initialScore = 0.4; // Results can be verbose\n\n  return {\n    id: randomUUID(),\n    content,\n    hash: hashContent(content),\n    timestamp: baseTime,\n    score: initialScore,\n    state: initialScore > 0.7 ? 'active' : initialScore > 0.3 ? 'ready' : 'silent',\n    ttl: 24 * 3600, // 24 hours default\n    accessCount: 0,\n    tags,\n    metadata: { type },\n    isBTSP: false,\n  };\n}\n","/**\n * BTSP Embedder - Implements behavioral timescale synaptic plasticity\n *\n * Neuroscience: One-shot learning from critical events (errors, conflicts).\n * Application: Detect high-importance patterns and mark for permanent retention.\n */\n\nimport { randomUUID } from 'node:crypto';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from '../utils/hash.js';\n\nexport interface BTSPEmbedder {\n  /**\n   * Detect if content contains BTSP patterns (errors, stack traces, conflicts, git diffs)\n   * @param content - Content to analyze\n   * @returns True if BTSP pattern detected\n   */\n  detectBTSP(content: string): boolean;\n\n  /**\n   * Create a new memory entry marked as BTSP (one-shot learned)\n   * @param content - Entry content\n   * @param tags - Optional tags\n   * @param metadata - Optional metadata\n   * @returns BTSP-marked memory entry\n   */\n  createBTSPEntry(\n    content: string,\n    tags?: string[],\n    metadata?: Record<string, unknown>,\n  ): MemoryEntry;\n}\n\n/**\n * Create a BTSP embedder instance\n * @returns BTSPEmbedder instance\n */\nexport function createBTSPEmbedder(): BTSPEmbedder {\n  // Patterns that indicate critical events\n  const BTSP_PATTERNS = [\n    // Error patterns\n    /\\b(error|exception|failure|fatal|critical|panic)\\b/i,\n    /\\b(TypeError|ReferenceError|SyntaxError|RangeError|URIError)\\b/,\n    /\\bENOENT|EACCES|ECONNREFUSED|ETIMEDOUT\\b/,\n\n    // Stack trace patterns\n    /^\\s+at\\s+.*\\(.*:\\d+:\\d+\\)/m, // JavaScript stack trace\n    /^\\s+at\\s+.*\\.[a-zA-Z]+:\\d+/m, // Python/Ruby stack trace\n\n    // Git diff new files\n    /^new file mode \\d+$/m,\n    /^--- \\/dev\\/null$/m,\n\n    // Merge conflict markers\n    /^<<<<<<< /m,\n    /^=======/m,\n    /^>>>>>>> /m,\n  ];\n\n  function detectBTSP(content: string): boolean {\n    return BTSP_PATTERNS.some((pattern) => pattern.test(content));\n  }\n\n  function createBTSPEntry(\n    content: string,\n    tags: string[] = [],\n    metadata: Record<string, unknown> = {},\n  ): MemoryEntry {\n    return {\n      id: randomUUID(),\n      content,\n      hash: hashContent(content),\n      timestamp: Date.now(),\n      score: 1.0, // Maximum initial score\n      ttl: 365 * 24 * 3600, // 1 year in seconds (long retention)\n      state: 'active', // Always active\n      accessCount: 0,\n      tags: [...tags, 'btsp'],\n      metadata,\n      isBTSP: true,\n    };\n  }\n\n  return {\n    detectBTSP,\n    createBTSPEntry,\n  };\n}\n","/**\n * Content hashing utilities.\n * Uses SHA-256 for deduplication.\n */\n\nimport { createHash } from 'node:crypto';\n\n/**\n * Generate SHA-256 hash of content for deduplication.\n *\n * @param content - Content to hash\n * @returns 64-character hex string (SHA-256)\n *\n * @example\n * ```typescript\n * const hash = hashContent('Hello world');\n * console.log(hash.length); // 64\n * ```\n */\nexport function hashContent(content: string): string {\n  return createHash('sha256').update(content, 'utf8').digest('hex');\n}\n","/**\n * Confidence States - Implements multi-state synapses\n *\n * Neuroscience: Synapses exist in three states: silent, ready (potentiated), active.\n * Application: Classify memory entries by score into silent/ready/active states.\n */\n\nimport type { ConfidenceState, MemoryEntry, StateDistribution } from '../types/memory.js';\n\nexport interface ConfidenceStatesConfig {\n  /** Score threshold for active state (e.g., 0.7) */\n  activeThreshold: number;\n  /** Score threshold for ready state (e.g., 0.3) */\n  readyThreshold: number;\n}\n\nexport interface ConfidenceStates {\n  /**\n   * Calculate state based on entry score and BTSP flag\n   * @param entry - Memory entry\n   * @returns Confidence state\n   */\n  calculateState(entry: MemoryEntry): ConfidenceState;\n\n  /**\n   * Transition entry to correct state based on its score\n   * @param entry - Entry to transition\n   * @returns Entry with updated state\n   */\n  transition(entry: MemoryEntry): MemoryEntry;\n\n  /**\n   * Get distribution of states across all entries\n   * @param entries - All memory entries\n   * @returns State distribution with counts\n   */\n  getDistribution(entries: MemoryEntry[]): StateDistribution;\n}\n\n/**\n * Create a confidence states manager\n * @param config - States configuration\n * @returns ConfidenceStates instance\n */\nexport function createConfidenceStates(config: ConfidenceStatesConfig): ConfidenceStates {\n  const { activeThreshold, readyThreshold } = config;\n\n  function calculateState(entry: MemoryEntry): ConfidenceState {\n    // BTSP entries are always active\n    if (entry.isBTSP) {\n      return 'active';\n    }\n\n    // State based on score thresholds\n    // Active: score > 0.7\n    if (entry.score > activeThreshold) {\n      return 'active';\n    }\n\n    // Ready: 0.3 <= score <= 0.7\n    if (entry.score >= readyThreshold) {\n      return 'ready';\n    }\n\n    // Silent: score < 0.3\n    return 'silent';\n  }\n\n  function transition(entry: MemoryEntry): MemoryEntry {\n    const newState = calculateState(entry);\n\n    return {\n      ...entry,\n      state: newState,\n    };\n  }\n\n  function getDistribution(entries: MemoryEntry[]): StateDistribution {\n    const distribution: StateDistribution = {\n      silent: 0,\n      ready: 0,\n      active: 0,\n      total: entries.length,\n    };\n\n    for (const entry of entries) {\n      const state = calculateState(entry);\n      distribution[state]++;\n    }\n\n    return distribution;\n  }\n\n  return {\n    calculateState,\n    transition,\n    getDistribution,\n  };\n}\n","/**\n * Engram Scorer - Implements engram theory (memory decay)\n *\n * Neuroscience: Memories fade over time without reinforcement.\n * Application: Apply exponential decay formula to memory scores based on age and access count.\n *\n * Formula: decay = 1 - e^(-age/TTL)\n * Score adjustment: score_new = score_old * (1 - decay) + (accessCount bonus)\n */\n\nimport type { MemoryEntry } from '../types/memory.js';\n\nexport interface EngramScorerConfig {\n  /** Default TTL in hours for new entries */\n  defaultTTL: number;\n  /** Decay threshold (0.0-1.0) above which entries are marked for pruning */\n  decayThreshold: number;\n}\n\nexport interface EngramScorer {\n  /**\n   * Calculate current score for an entry based on decay and access count\n   * @param entry - Memory entry to score\n   * @param currentTime - Current timestamp in milliseconds (for testing)\n   * @returns Updated score (0.0-1.0)\n   */\n  calculateScore(entry: MemoryEntry, currentTime?: number): number;\n\n  /**\n   * Refresh TTL to default value\n   * @param entry - Entry to refresh\n   * @returns Entry with refreshed TTL and timestamp\n   */\n  refreshTTL(entry: MemoryEntry): MemoryEntry;\n\n  /**\n   * Calculate decay factor (0.0-1.0) based on age and TTL\n   * @param ageInSeconds - Age of entry in seconds\n   * @param ttlInSeconds - TTL in seconds\n   * @returns Decay factor (0.0 = fresh, 1.0 = fully decayed)\n   */\n  calculateDecay(ageInSeconds: number, ttlInSeconds: number): number;\n}\n\n/**\n * Create an engram scorer instance\n * @param config - Scorer configuration\n * @returns EngramScorer instance\n */\nexport function createEngramScorer(config: EngramScorerConfig): EngramScorer {\n  const { defaultTTL } = config;\n\n  function calculateDecay(ageInSeconds: number, ttlInSeconds: number): number {\n    if (ttlInSeconds === 0) return 1.0; // Instant decay\n    if (ageInSeconds <= 0) return 0.0; // Fresh entry\n\n    // Exponential decay: 1 - e^(-age/TTL)\n    const ratio = ageInSeconds / ttlInSeconds;\n    const decay = 1 - Math.exp(-ratio);\n\n    // Clamp to [0.0, 1.0]\n    return Math.max(0, Math.min(1, decay));\n  }\n\n  function calculateScore(entry: MemoryEntry, currentTime: number = Date.now()): number {\n    // Calculate age in seconds\n    const ageInMilliseconds = currentTime - entry.timestamp;\n    const ageInSeconds = Math.max(0, ageInMilliseconds / 1000);\n\n    // Calculate decay factor\n    const decay = calculateDecay(ageInSeconds, entry.ttl);\n\n    // Base score reduced by decay\n    let score = entry.score * (1 - decay);\n\n    // Access count bonus (diminishing returns via log)\n    if (entry.accessCount > 0) {\n      const accessBonus = Math.log(entry.accessCount + 1) * 0.1;\n      score = Math.min(1.0, score + accessBonus);\n    }\n\n    // BTSP entries maintain high score\n    if (entry.isBTSP) {\n      score = Math.max(score, 0.9);\n    }\n\n    return Math.max(0, Math.min(1, score));\n  }\n\n  function refreshTTL(entry: MemoryEntry): MemoryEntry {\n    return {\n      ...entry,\n      ttl: defaultTTL * 3600, // Convert hours to seconds\n      timestamp: Date.now(),\n    };\n  }\n\n  return {\n    calculateScore,\n    refreshTTL,\n    calculateDecay,\n  };\n}\n","/**\n * Token estimation utilities.\n * Uses whitespace heuristic (~90% accuracy vs GPT tokenizer).\n */\n\n/**\n * Estimate token count for text using heuristic.\n *\n * Approximation: 1 token ≈ 4 chars or 0.75 words\n * Provides ~90% accuracy compared to GPT tokenizer, sufficient for optimization heuristics.\n *\n * @param text - Text to count\n * @returns Estimated token count\n *\n * @example\n * ```typescript\n * const tokens = estimateTokens('Hello world');\n * console.log(tokens); // ~2\n * ```\n */\nexport function estimateTokens(text: string): number {\n  if (!text || text.length === 0) {\n    return 0;\n  }\n\n  // Split on whitespace to get words\n  const words = text.split(/\\s+/).filter((w) => w.length > 0);\n  const wordCount = words.length;\n\n  // Character-based estimate\n  const charCount = text.length;\n  const charEstimate = Math.ceil(charCount / 4);\n\n  // Word-based estimate\n  const wordEstimate = Math.ceil(wordCount * 0.75);\n\n  // Return the maximum of both estimates (more conservative)\n  return Math.max(wordEstimate, charEstimate);\n}\n","/**\n * Sparse Pruner - Implements sparse coding principle\n *\n * Neuroscience: Only 2-5% of neurons fire at any given time.\n * Application: Keep only top 5% most relevant context entries by TF-IDF score.\n */\n\nimport type { MemoryEntry } from '../types/memory.js';\nimport type { PruneResult } from '../types/pruner.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\nexport interface SparsePrunerConfig {\n  /** Percentage threshold for pruning (e.g., 5 = keep top 5%) */\n  threshold: number;\n}\n\nexport interface SparsePruner {\n  /**\n   * Prune entries to keep only top N% by relevance score\n   * @param entries - Memory entries to prune\n   * @returns Result with kept/removed entries and token counts\n   */\n  prune(entries: MemoryEntry[]): PruneResult;\n\n  /**\n   * Calculate TF-IDF relevance score for a single entry\n   * @param entry - Entry to score\n   * @param allEntries - All entries for IDF calculation\n   * @returns Relevance score (0.0-1.0)\n   */\n  scoreEntry(entry: MemoryEntry, allEntries: MemoryEntry[]): number;\n}\n\n/**\n * Create a sparse pruner instance\n * @param config - Pruner configuration\n * @returns SparsePruner instance\n */\nexport function createSparsePruner(config: SparsePrunerConfig): SparsePruner {\n  const { threshold } = config;\n\n  function tokenize(text: string): string[] {\n    return text\n      .toLowerCase()\n      .split(/\\s+/)\n      .filter((word) => word.length > 0);\n  }\n\n  function calculateTF(term: string, tokens: string[]): number {\n    const count = tokens.filter((t) => t === term).length;\n    // Sqrt capping to prevent common words from dominating\n    return Math.sqrt(count);\n  }\n\n  function calculateIDF(term: string, allEntries: MemoryEntry[]): number {\n    const totalDocs = allEntries.length;\n    const docsWithTerm = allEntries.filter((entry) => {\n      const tokens = tokenize(entry.content);\n      return tokens.includes(term);\n    }).length;\n\n    if (docsWithTerm === 0) return 0;\n\n    return Math.log(totalDocs / docsWithTerm);\n  }\n\n  function scoreEntry(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tokens = tokenize(entry.content);\n    if (tokens.length === 0) return 0;\n\n    const uniqueTerms = [...new Set(tokens)];\n    let totalScore = 0;\n\n    for (const term of uniqueTerms) {\n      const tf = calculateTF(term, tokens);\n      const idf = calculateIDF(term, allEntries);\n      totalScore += tf * idf;\n    }\n\n    // Normalize by entry length\n    return totalScore / tokens.length;\n  }\n\n  function prune(entries: MemoryEntry[]): PruneResult {\n    if (entries.length === 0) {\n      return {\n        kept: [],\n        removed: [],\n        originalTokens: 0,\n        prunedTokens: 0,\n      };\n    }\n\n    // Calculate original token count\n    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Score all entries\n    const scored = entries.map((entry) => ({\n      entry,\n      score: scoreEntry(entry, entries),\n    }));\n\n    // Sort by score descending\n    scored.sort((a, b) => b.score - a.score);\n\n    // Keep top N% (minimum 1 entry)\n    const keepCount = Math.max(1, Math.ceil(entries.length * (threshold / 100)));\n    const kept = scored.slice(0, keepCount).map((s) => s.entry);\n    const removed = scored.slice(keepCount).map((s) => s.entry);\n\n    // Calculate pruned token count\n    const prunedTokens = kept.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    return {\n      kept,\n      removed,\n      originalTokens,\n      prunedTokens,\n    };\n  }\n\n  return {\n    prune,\n    scoreEntry,\n  };\n}\n","/**\n * Generic Adapter - Agent-agnostic optimization pipeline\n *\n * Orchestrates all 6 neuroscience modules to optimize context memory.\n */\n\nimport { randomUUID } from 'node:crypto';\nimport { createBTSPEmbedder } from '../core/btsp-embedder.js';\nimport { createConfidenceStates } from '../core/confidence-states.js';\nimport { createEngramScorer } from '../core/engram-scorer.js';\nimport type { KVMemory } from '../core/kv-memory.js';\nimport { createSparsePruner } from '../core/sparse-pruner.js';\nimport type { AgentAdapter, OptimizationResult, OptimizeOptions } from '../types/adapter.js';\nimport type { SparnConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from '../utils/hash.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n/**\n * Create a generic adapter instance\n * @param memory - KV memory store\n * @param config - Sparn configuration\n * @returns AgentAdapter instance\n */\nexport function createGenericAdapter(memory: KVMemory, config: SparnConfig): AgentAdapter {\n  const pruner = createSparsePruner(config.pruning);\n  const scorer = createEngramScorer(config.decay);\n  const states = createConfidenceStates(config.states);\n  const btsp = createBTSPEmbedder();\n\n  async function optimize(\n    context: string,\n    options: OptimizeOptions = {},\n  ): Promise<OptimizationResult> {\n    const startTime = Date.now();\n\n    // Parse context into entries (line-based for simplicity)\n    const lines = context.split('\\n').filter((line) => line.trim().length > 0);\n    const entries: MemoryEntry[] = lines.map((content) => ({\n      id: randomUUID(),\n      content,\n      hash: hashContent(content),\n      timestamp: Date.now(),\n      score: btsp.detectBTSP(content) ? 1.0 : 0.5, // BTSP gets high initial score\n      ttl: config.decay.defaultTTL * 3600, // Convert hours to seconds\n      state: 'ready' as const,\n      accessCount: 0,\n      tags: [],\n      metadata: {},\n      isBTSP: btsp.detectBTSP(content),\n    }));\n\n    // Calculate original token count\n    const tokensBefore = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 1: Update scores with decay\n    const scoredEntries = entries.map((entry) => ({\n      ...entry,\n      score: scorer.calculateScore(entry),\n    }));\n\n    // Step 2: Transition states based on scores\n    const statedEntries = scoredEntries.map((entry) => states.transition(entry));\n\n    // Step 3: Apply sparse pruning\n    const pruneResult = pruner.prune(statedEntries);\n\n    // Step 4: Keep active and ready entries, discard silent\n    const optimizedEntries = pruneResult.kept.filter(\n      (e) => e.state === 'active' || e.state === 'ready',\n    );\n\n    // Calculate final token count\n    const tokensAfter = optimizedEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Reconstruct optimized context\n    const optimizedContext = optimizedEntries.map((e) => e.content).join('\\n');\n\n    // Store entries in memory (if not dry run)\n    if (!options.dryRun) {\n      for (const entry of optimizedEntries) {\n        await memory.put(entry);\n      }\n\n      // Record optimization statistics\n      await memory.recordOptimization({\n        timestamp: Date.now(),\n        tokens_before: tokensBefore,\n        tokens_after: tokensAfter,\n        entries_pruned: entries.length - optimizedEntries.length,\n        duration_ms: Date.now() - startTime,\n      });\n    }\n\n    // Get state distribution\n    const distribution = states.getDistribution(optimizedEntries);\n\n    const result: OptimizationResult = {\n      optimizedContext,\n      tokensBefore,\n      tokensAfter,\n      reduction: tokensBefore > 0 ? (tokensBefore - tokensAfter) / tokensBefore : 0,\n      entriesProcessed: entries.length,\n      entriesKept: optimizedEntries.length,\n      stateDistribution: distribution,\n      durationMs: Date.now() - startTime,\n    };\n\n    // Add verbose details if requested\n    if (options.verbose) {\n      result.details = optimizedEntries.map((e) => ({\n        id: e.id,\n        score: e.score,\n        state: e.state,\n        isBTSP: e.isBTSP,\n        tokens: estimateTokens(e.content),\n      }));\n    }\n\n    return result;\n  }\n\n  return {\n    optimize,\n  };\n}\n","/**\n * KV Memory Store Module\n * Implements hippocampal key-value storage with dual index/value tables.\n * Maps to: Hippocampal Key-Value — the hippocampus separates what to store from how to retrieve it.\n */\n\nimport { copyFileSync, existsSync } from 'node:fs';\nimport Database from 'better-sqlite3';\nimport type { MemoryEntry, MemoryQueryFilters } from '../types/memory.js';\n\n/**\n * Optimization statistics record.\n */\nexport interface OptimizationStats {\n  id: number;\n  timestamp: number;\n  tokens_before: number;\n  tokens_after: number;\n  entries_pruned: number;\n  duration_ms: number;\n}\n\n/**\n * KV Memory interface.\n */\nexport interface KVMemory {\n  /** Store a memory entry */\n  put(entry: MemoryEntry): Promise<void>;\n\n  /** Retrieve a memory entry by ID */\n  get(id: string): Promise<MemoryEntry | null>;\n\n  /** Query entries by filters */\n  query(filters: MemoryQueryFilters): Promise<MemoryEntry[]>;\n\n  /** Delete a memory entry */\n  delete(id: string): Promise<void>;\n\n  /** List all entry IDs */\n  list(): Promise<string[]>;\n\n  /** Compact database (remove expired entries) */\n  compact(): Promise<number>;\n\n  /** Close database connection */\n  close(): Promise<void>;\n\n  /** Record optimization statistics */\n  recordOptimization(stats: Omit<OptimizationStats, 'id'>): Promise<void>;\n\n  /** Get all optimization statistics */\n  getOptimizationStats(): Promise<OptimizationStats[]>;\n\n  /** Clear all optimization statistics */\n  clearOptimizationStats(): Promise<void>;\n}\n\n/**\n * Create a timestamped backup of the database\n * @param dbPath - Path to database file\n * @returns Path to backup file\n */\nfunction createBackup(dbPath: string): string {\n  const timestamp = new Date().toISOString().replace(/[:.]/g, '-');\n  const backupPath = `${dbPath}.backup-${timestamp}`;\n\n  try {\n    copyFileSync(dbPath, backupPath);\n    console.log(`✓ Database backed up to: ${backupPath}`);\n    return backupPath;\n  } catch (error) {\n    console.error(`Warning: Could not create backup: ${error}`);\n    return '';\n  }\n}\n\n/**\n * Create KV Memory store with SQLite backend.\n *\n * Initializes database with dual table schema:\n * - entries_index: Fast lookups (id, hash, timestamp, score, ttl, state, accessCount, isBTSP)\n * - entries_value: Content storage (id, content, tags, metadata)\n *\n * @param dbPath - Path to SQLite database file\n * @returns KVMemory instance\n */\nexport async function createKVMemory(dbPath: string): Promise<KVMemory> {\n  // Detect database corruption and create backup\n  let db: Database.Database;\n  try {\n    db = new Database(dbPath);\n\n    // Quick integrity check\n    const integrityCheck = db.pragma('quick_check', { simple: true });\n    if (integrityCheck !== 'ok') {\n      console.error('⚠ Database corruption detected!');\n\n      // Create backup before attempting recovery\n      if (existsSync(dbPath)) {\n        const backupPath = createBackup(dbPath);\n        if (backupPath) {\n          console.log(`Backup created at: ${backupPath}`);\n        }\n      }\n\n      // Try to recover\n      console.log('Attempting database recovery...');\n      db.close();\n      db = new Database(dbPath);\n    }\n  } catch (error) {\n    console.error('⚠ Database error detected:', error);\n\n    // Create backup if database exists\n    if (existsSync(dbPath)) {\n      createBackup(dbPath);\n      console.log('Creating new database...');\n    }\n\n    db = new Database(dbPath);\n  }\n\n  // Enable WAL mode for better concurrency\n  db.pragma('journal_mode = WAL');\n\n  // Create entries_index table\n  db.exec(`\n    CREATE TABLE IF NOT EXISTS entries_index (\n      id TEXT PRIMARY KEY NOT NULL,\n      hash TEXT UNIQUE NOT NULL,\n      timestamp INTEGER NOT NULL,\n      score REAL NOT NULL DEFAULT 0.0 CHECK(score >= 0.0 AND score <= 1.0),\n      ttl INTEGER NOT NULL CHECK(ttl >= 0),\n      state TEXT NOT NULL CHECK(state IN ('silent', 'ready', 'active')),\n      accessCount INTEGER NOT NULL DEFAULT 0 CHECK(accessCount >= 0),\n      isBTSP INTEGER NOT NULL DEFAULT 0 CHECK(isBTSP IN (0, 1)),\n      created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now'))\n    );\n  `);\n\n  // Create entries_value table\n  db.exec(`\n    CREATE TABLE IF NOT EXISTS entries_value (\n      id TEXT PRIMARY KEY NOT NULL,\n      content TEXT NOT NULL,\n      tags TEXT,\n      metadata TEXT,\n      FOREIGN KEY (id) REFERENCES entries_index(id) ON DELETE CASCADE\n    );\n  `);\n\n  // Create optimization_stats table\n  db.exec(`\n    CREATE TABLE IF NOT EXISTS optimization_stats (\n      id INTEGER PRIMARY KEY AUTOINCREMENT,\n      timestamp INTEGER NOT NULL DEFAULT (strftime('%s', 'now')),\n      tokens_before INTEGER NOT NULL,\n      tokens_after INTEGER NOT NULL,\n      entries_pruned INTEGER NOT NULL,\n      duration_ms INTEGER NOT NULL\n    );\n  `);\n\n  // Create indexes\n  db.exec(`\n    CREATE INDEX IF NOT EXISTS idx_entries_state ON entries_index(state);\n    CREATE INDEX IF NOT EXISTS idx_entries_score ON entries_index(score DESC);\n    CREATE INDEX IF NOT EXISTS idx_entries_hash ON entries_index(hash);\n    CREATE INDEX IF NOT EXISTS idx_entries_timestamp ON entries_index(timestamp DESC);\n    CREATE INDEX IF NOT EXISTS idx_stats_timestamp ON optimization_stats(timestamp DESC);\n  `);\n\n  // Prepare statements for better performance\n  const putIndexStmt = db.prepare(`\n    INSERT OR REPLACE INTO entries_index\n    (id, hash, timestamp, score, ttl, state, accessCount, isBTSP)\n    VALUES (?, ?, ?, ?, ?, ?, ?, ?)\n  `);\n\n  const putValueStmt = db.prepare(`\n    INSERT OR REPLACE INTO entries_value\n    (id, content, tags, metadata)\n    VALUES (?, ?, ?, ?)\n  `);\n\n  const getStmt = db.prepare(`\n    SELECT\n      i.id, i.hash, i.timestamp, i.score, i.ttl, i.state, i.accessCount, i.isBTSP,\n      v.content, v.tags, v.metadata\n    FROM entries_index i\n    JOIN entries_value v ON i.id = v.id\n    WHERE i.id = ?\n  `);\n\n  const deleteIndexStmt = db.prepare('DELETE FROM entries_index WHERE id = ?');\n  const deleteValueStmt = db.prepare('DELETE FROM entries_value WHERE id = ?');\n\n  return {\n    async put(entry: MemoryEntry): Promise<void> {\n      const transaction = db.transaction(() => {\n        putIndexStmt.run(\n          entry.id,\n          entry.hash,\n          entry.timestamp,\n          entry.score,\n          entry.ttl,\n          entry.state,\n          entry.accessCount,\n          entry.isBTSP ? 1 : 0,\n        );\n\n        putValueStmt.run(\n          entry.id,\n          entry.content,\n          JSON.stringify(entry.tags),\n          JSON.stringify(entry.metadata),\n        );\n      });\n\n      transaction();\n    },\n\n    async get(id: string): Promise<MemoryEntry | null> {\n      const row = getStmt.get(id) as unknown;\n\n      if (!row) {\n        return null;\n      }\n\n      const r = row as {\n        id: string;\n        hash: string;\n        timestamp: number;\n        score: number;\n        ttl: number;\n        state: string;\n        accessCount: number;\n        isBTSP: number;\n        content: string;\n        tags: string | null;\n        metadata: string | null;\n      };\n\n      return {\n        id: r.id,\n        content: r.content,\n        hash: r.hash,\n        timestamp: r.timestamp,\n        score: r.score,\n        ttl: r.ttl,\n        state: r.state as 'silent' | 'ready' | 'active',\n        accessCount: r.accessCount,\n        tags: r.tags ? JSON.parse(r.tags) : [],\n        metadata: r.metadata ? JSON.parse(r.metadata) : {},\n        isBTSP: r.isBTSP === 1,\n      };\n    },\n\n    async query(filters: MemoryQueryFilters): Promise<MemoryEntry[]> {\n      let sql = `\n        SELECT\n          i.id, i.hash, i.timestamp, i.score, i.ttl, i.state, i.accessCount, i.isBTSP,\n          v.content, v.tags, v.metadata\n        FROM entries_index i\n        JOIN entries_value v ON i.id = v.id\n        WHERE 1=1\n      `;\n\n      const params: unknown[] = [];\n\n      if (filters.state) {\n        sql += ' AND i.state = ?';\n        params.push(filters.state);\n      }\n\n      if (filters.minScore !== undefined) {\n        sql += ' AND i.score >= ?';\n        params.push(filters.minScore);\n      }\n\n      if (filters.maxScore !== undefined) {\n        sql += ' AND i.score <= ?';\n        params.push(filters.maxScore);\n      }\n\n      if (filters.isBTSP !== undefined) {\n        sql += ' AND i.isBTSP = ?';\n        params.push(filters.isBTSP ? 1 : 0);\n      }\n\n      sql += ' ORDER BY i.score DESC';\n\n      if (filters.limit) {\n        sql += ' LIMIT ?';\n        params.push(filters.limit);\n      }\n\n      if (filters.offset) {\n        sql += ' OFFSET ?';\n        params.push(filters.offset);\n      }\n\n      const stmt = db.prepare(sql);\n      const rows = stmt.all(...params) as unknown[];\n\n      return rows.map((row) => {\n        const r = row as {\n          id: string;\n          hash: string;\n          timestamp: number;\n          score: number;\n          ttl: number;\n          state: string;\n          accessCount: number;\n          isBTSP: number;\n          content: string;\n          tags: string | null;\n          metadata: string | null;\n        };\n\n        return {\n          id: r.id,\n          content: r.content,\n          hash: r.hash,\n          timestamp: r.timestamp,\n          score: r.score,\n          ttl: r.ttl,\n          state: r.state as 'silent' | 'ready' | 'active',\n          accessCount: r.accessCount,\n          tags: r.tags ? JSON.parse(r.tags) : [],\n          metadata: r.metadata ? JSON.parse(r.metadata) : {},\n          isBTSP: r.isBTSP === 1,\n        };\n      });\n    },\n\n    async delete(id: string): Promise<void> {\n      const transaction = db.transaction(() => {\n        deleteIndexStmt.run(id);\n        deleteValueStmt.run(id);\n      });\n\n      transaction();\n    },\n\n    async list(): Promise<string[]> {\n      const stmt = db.prepare('SELECT id FROM entries_index');\n      const rows = stmt.all() as { id: string }[];\n      return rows.map((r) => r.id);\n    },\n\n    async compact(): Promise<number> {\n      const before = db.prepare('SELECT COUNT(*) as count FROM entries_index').get() as {\n        count: number;\n      };\n\n      // Remove fully decayed entries (this will be enhanced in sleep-compressor)\n      db.exec('DELETE FROM entries_index WHERE ttl <= 0');\n\n      db.exec('VACUUM');\n\n      const after = db.prepare('SELECT COUNT(*) as count FROM entries_index').get() as {\n        count: number;\n      };\n\n      return before.count - after.count;\n    },\n\n    async close(): Promise<void> {\n      db.close();\n    },\n\n    async recordOptimization(stats: Omit<OptimizationStats, 'id'>): Promise<void> {\n      const stmt = db.prepare(`\n        INSERT INTO optimization_stats (timestamp, tokens_before, tokens_after, entries_pruned, duration_ms)\n        VALUES (?, ?, ?, ?, ?)\n      `);\n\n      stmt.run(\n        stats.timestamp,\n        stats.tokens_before,\n        stats.tokens_after,\n        stats.entries_pruned,\n        stats.duration_ms,\n      );\n    },\n\n    async getOptimizationStats(): Promise<OptimizationStats[]> {\n      const stmt = db.prepare(`\n        SELECT id, timestamp, tokens_before, tokens_after, entries_pruned, duration_ms\n        FROM optimization_stats\n        ORDER BY timestamp DESC\n      `);\n\n      const rows = stmt.all() as OptimizationStats[];\n      return rows;\n    },\n\n    async clearOptimizationStats(): Promise<void> {\n      db.exec('DELETE FROM optimization_stats');\n    },\n  };\n}\n","/**\n * Sleep Compressor - Implements sleep replay principle\n *\n * Neuroscience: During sleep, the brain consolidates memories by replaying important ones\n * and discarding irrelevant information.\n * Application: Periodic consolidation removes decayed entries and merges duplicates.\n */\n\nimport type { ConsolidateResult, DuplicateGroup } from '../types/consolidate.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { createEngramScorer } from './engram-scorer.js';\n\nexport interface SleepCompressor {\n  /**\n   * Consolidate entries: remove decayed, merge duplicates\n   * @param entries - All memory entries\n   * @returns Consolidation result\n   */\n  consolidate(entries: MemoryEntry[]): ConsolidateResult;\n\n  /**\n   * Find duplicate entries (exact hash or near-duplicate by similarity)\n   * @param entries - Memory entries\n   * @returns Groups of duplicates\n   */\n  findDuplicates(entries: MemoryEntry[]): DuplicateGroup[];\n\n  /**\n   * Merge duplicate entries, keeping highest score\n   * @param groups - Duplicate groups\n   * @returns Merged entries\n   */\n  mergeDuplicates(groups: DuplicateGroup[]): MemoryEntry[];\n}\n\n/**\n * Create a sleep compressor instance\n * @returns SleepCompressor instance\n */\nexport function createSleepCompressor(): SleepCompressor {\n  const scorer = createEngramScorer({ defaultTTL: 24, decayThreshold: 0.95 });\n\n  function consolidate(entries: MemoryEntry[]): ConsolidateResult {\n    const startTime = Date.now();\n    const originalCount = entries.length;\n\n    // Step 1: Remove fully decayed entries (decay ≥ 0.95)\n    const now = Date.now();\n    const nonDecayed = entries.filter((entry) => {\n      const ageInSeconds = (now - entry.timestamp) / 1000;\n      const decay = scorer.calculateDecay(ageInSeconds, entry.ttl);\n      return decay < 0.95; // Keep entries with decay < 0.95\n    });\n\n    const decayedRemoved = originalCount - nonDecayed.length;\n\n    // Step 2: Find and merge duplicates\n    const duplicateGroups = findDuplicates(nonDecayed);\n    const merged = mergeDuplicates(duplicateGroups);\n\n    // Step 3: Keep non-duplicates\n    const duplicateIds = new Set(duplicateGroups.flatMap((g) => g.entries.map((e) => e.id)));\n    const nonDuplicates = nonDecayed.filter((e) => !duplicateIds.has(e.id));\n\n    // Combine merged duplicates with non-duplicates\n    const kept = [...merged, ...nonDuplicates];\n    const removed = entries.filter((e) => !kept.some((k) => k.id === e.id));\n\n    const duplicatesRemoved = duplicateGroups.reduce((sum, g) => sum + (g.entries.length - 1), 0);\n\n    return {\n      kept,\n      removed,\n      entriesBefore: originalCount,\n      entriesAfter: kept.length,\n      decayedRemoved,\n      duplicatesRemoved,\n      compressionRatio: originalCount > 0 ? kept.length / originalCount : 0,\n      durationMs: Date.now() - startTime,\n    };\n  }\n\n  function findDuplicates(entries: MemoryEntry[]): DuplicateGroup[] {\n    const groups: DuplicateGroup[] = [];\n    const processed = new Set<string>();\n\n    // Find exact hash matches\n    for (let i = 0; i < entries.length; i++) {\n      const entry = entries[i];\n      if (!entry || processed.has(entry.id)) continue;\n\n      const duplicates = entries.filter((e, idx) => idx !== i && e.hash === entry.hash);\n\n      if (duplicates.length > 0) {\n        const group: DuplicateGroup = {\n          entries: [entry, ...duplicates],\n          similarity: 1.0, // Exact match\n        };\n        groups.push(group);\n\n        // Mark as processed\n        processed.add(entry.id);\n        for (const dup of duplicates) {\n          processed.add(dup.id);\n        }\n      }\n    }\n\n    // Find near-duplicates (cosine similarity ≥ 0.85)\n    for (let i = 0; i < entries.length; i++) {\n      const entryI = entries[i];\n      if (!entryI || processed.has(entryI.id)) continue;\n\n      for (let j = i + 1; j < entries.length; j++) {\n        const entryJ = entries[j];\n        if (!entryJ || processed.has(entryJ.id)) continue;\n\n        const similarity = cosineSimilarity(entryI.content, entryJ.content);\n\n        if (similarity >= 0.85) {\n          const group: DuplicateGroup = {\n            entries: [entryI, entryJ],\n            similarity,\n          };\n          groups.push(group);\n\n          processed.add(entryI.id);\n          processed.add(entryJ.id);\n          break; // Move to next i\n        }\n      }\n    }\n\n    return groups;\n  }\n\n  function mergeDuplicates(groups: DuplicateGroup[]): MemoryEntry[] {\n    const merged: MemoryEntry[] = [];\n\n    for (const group of groups) {\n      // Keep entry with highest score\n      const sorted = [...group.entries].sort((a, b) => b.score - a.score);\n      const best = sorted[0];\n      if (!best) continue; // Skip empty groups\n\n      // Sum access counts\n      const totalAccessCount = group.entries.reduce((sum, e) => sum + e.accessCount, 0);\n\n      // Merge tags\n      const allTags = new Set(group.entries.flatMap((e) => e.tags));\n\n      merged.push({\n        ...best,\n        accessCount: totalAccessCount,\n        tags: Array.from(allTags),\n      });\n    }\n\n    return merged;\n  }\n\n  /**\n   * Calculate cosine similarity between two text strings\n   * @param text1 - First text\n   * @param text2 - Second text\n   * @returns Similarity score (0.0-1.0)\n   */\n  function cosineSimilarity(text1: string, text2: string): number {\n    const words1 = tokenize(text1);\n    const words2 = tokenize(text2);\n\n    // Build vocabulary\n    const vocab = new Set([...words1, ...words2]);\n\n    // Build word frequency vectors\n    const vec1: Record<string, number> = {};\n    const vec2: Record<string, number> = {};\n\n    for (const word of vocab) {\n      vec1[word] = words1.filter((w) => w === word).length;\n      vec2[word] = words2.filter((w) => w === word).length;\n    }\n\n    // Calculate dot product and magnitudes\n    let dotProduct = 0;\n    let mag1 = 0;\n    let mag2 = 0;\n\n    for (const word of vocab) {\n      const count1 = vec1[word] ?? 0;\n      const count2 = vec2[word] ?? 0;\n      dotProduct += count1 * count2;\n      mag1 += count1 * count1;\n      mag2 += count2 * count2;\n    }\n\n    mag1 = Math.sqrt(mag1);\n    mag2 = Math.sqrt(mag2);\n\n    if (mag1 === 0 || mag2 === 0) return 0;\n\n    return dotProduct / (mag1 * mag2);\n  }\n\n  function tokenize(text: string): string[] {\n    return text\n      .toLowerCase()\n      .split(/\\s+/)\n      .filter((word) => word.length > 0);\n  }\n\n  return {\n    consolidate,\n    findDuplicates,\n    mergeDuplicates,\n  };\n}\n","/**\n * Configuration types for Sparn behavior customization.\n */\n\n/**\n * Agent adapter type.\n */\nexport type AgentType = 'claude-code' | 'generic';\n\n/**\n * Pruning configuration.\n */\nexport interface PruningConfig {\n  /** Percentage of top-scored entries to keep (1-100, default: 5) */\n  threshold: number;\n\n  /** Aggressiveness scale 0-100 (affects TF-IDF weighting, default: 50) */\n  aggressiveness: number;\n}\n\n/**\n * Decay configuration.\n */\nexport interface DecayConfig {\n  /** Default TTL in hours (default: 24) */\n  defaultTTL: number;\n\n  /** Decay threshold for pruning (0.0-1.0, default: 0.95) */\n  decayThreshold: number;\n}\n\n/**\n * Confidence state threshold configuration.\n */\nexport interface StatesConfig {\n  /** Score threshold for active state (default: 0.7) */\n  activeThreshold: number;\n\n  /** Score threshold for ready state (default: 0.3) */\n  readyThreshold: number;\n}\n\n/**\n * UI configuration.\n */\nexport interface UIConfig {\n  /** Enable colored output (default: true) */\n  colors: boolean;\n\n  /** Enable sound effects (default: false) */\n  sounds: boolean;\n\n  /** Verbose logging (default: false) */\n  verbose: boolean;\n}\n\n/**\n * Complete Sparn configuration.\n */\nexport interface SparnConfig {\n  pruning: PruningConfig;\n  decay: DecayConfig;\n  states: StatesConfig;\n  agent: AgentType;\n  ui: UIConfig;\n  /** Auto-consolidation interval in hours, or null for manual */\n  autoConsolidate: number | null;\n}\n\n/**\n * Default configuration values.\n */\nexport const DEFAULT_CONFIG: SparnConfig = {\n  pruning: {\n    threshold: 5,\n    aggressiveness: 50,\n  },\n  decay: {\n    defaultTTL: 24,\n    decayThreshold: 0.95,\n  },\n  states: {\n    activeThreshold: 0.7,\n    readyThreshold: 0.3,\n  },\n  agent: 'generic',\n  ui: {\n    colors: true,\n    sounds: false,\n    verbose: false,\n  },\n  autoConsolidate: null,\n};\n","/**\n * Logging utility.\n * Simple console wrapper with log levels.\n */\n\nexport type LogLevel = 'debug' | 'info' | 'warn' | 'error';\n\n/**\n * Logger interface.\n */\nexport interface Logger {\n  debug(message: string, ...args: unknown[]): void;\n  info(message: string, ...args: unknown[]): void;\n  warn(message: string, ...args: unknown[]): void;\n  error(message: string, ...args: unknown[]): void;\n}\n\n/**\n * Create a logger with optional verbosity control.\n *\n * @param verbose - Enable debug-level logging\n * @returns Logger instance\n */\nexport function createLogger(verbose = false): Logger {\n  return {\n    debug(message: string, ...args: unknown[]): void {\n      if (verbose) {\n        console.debug(`[DEBUG] ${message}`, ...args);\n      }\n    },\n    info(message: string, ...args: unknown[]): void {\n      console.info(`[INFO] ${message}`, ...args);\n    },\n    warn(message: string, ...args: unknown[]): void {\n      console.warn(`[WARN] ${message}`, ...args);\n    },\n    error(message: string, ...args: unknown[]): void {\n      console.error(`[ERROR] ${message}`, ...args);\n    },\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACOA,IAAAA,sBAA2B;;;ACA3B,IAAAC,sBAA2B;;;ACF3B,yBAA2B;AAcpB,SAAS,YAAY,SAAyB;AACnD,aAAO,+BAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;;;ADgBO,SAAS,qBAAmC;AAEjD,QAAM,gBAAgB;AAAA;AAAA,IAEpB;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA;AAAA,IACA;AAAA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,WAAS,WAAW,SAA0B;AAC5C,WAAO,cAAc,KAAK,CAAC,YAAY,QAAQ,KAAK,OAAO,CAAC;AAAA,EAC9D;AAEA,WAAS,gBACP,SACA,OAAiB,CAAC,GAClB,WAAoC,CAAC,GACxB;AACb,WAAO;AAAA,MACL,QAAI,gCAAW;AAAA,MACf;AAAA,MACA,MAAM,YAAY,OAAO;AAAA,MACzB,WAAW,KAAK,IAAI;AAAA,MACpB,OAAO;AAAA;AAAA,MACP,KAAK,MAAM,KAAK;AAAA;AAAA,MAChB,OAAO;AAAA;AAAA,MACP,aAAa;AAAA,MACb,MAAM,CAAC,GAAG,MAAM,MAAM;AAAA,MACtB;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;;;AE3CO,SAAS,uBAAuB,QAAkD;AACvF,QAAM,EAAE,iBAAiB,eAAe,IAAI;AAE5C,WAAS,eAAe,OAAqC;AAE3D,QAAI,MAAM,QAAQ;AAChB,aAAO;AAAA,IACT;AAIA,QAAI,MAAM,QAAQ,iBAAiB;AACjC,aAAO;AAAA,IACT;AAGA,QAAI,MAAM,SAAS,gBAAgB;AACjC,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,OAAiC;AACnD,UAAM,WAAW,eAAe,KAAK;AAErC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,gBAAgB,SAA2C;AAClE,UAAM,eAAkC;AAAA,MACtC,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO,QAAQ;AAAA,IACjB;AAEA,eAAW,SAAS,SAAS;AAC3B,YAAM,QAAQ,eAAe,KAAK;AAClC,mBAAa,KAAK;AAAA,IACpB;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;ACjDO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,WAAW,IAAI;AAEvB,WAAS,eAAe,cAAsB,cAA8B;AAC1E,QAAI,iBAAiB,EAAG,QAAO;AAC/B,QAAI,gBAAgB,EAAG,QAAO;AAG9B,UAAM,QAAQ,eAAe;AAC7B,UAAM,QAAQ,IAAI,KAAK,IAAI,CAAC,KAAK;AAGjC,WAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,EACvC;AAEA,WAAS,eAAe,OAAoB,cAAsB,KAAK,IAAI,GAAW;AAEpF,UAAM,oBAAoB,cAAc,MAAM;AAC9C,UAAM,eAAe,KAAK,IAAI,GAAG,oBAAoB,GAAI;AAGzD,UAAM,QAAQ,eAAe,cAAc,MAAM,GAAG;AAGpD,QAAI,QAAQ,MAAM,SAAS,IAAI;AAG/B,QAAI,MAAM,cAAc,GAAG;AACzB,YAAM,cAAc,KAAK,IAAI,MAAM,cAAc,CAAC,IAAI;AACtD,cAAQ,KAAK,IAAI,GAAK,QAAQ,WAAW;AAAA,IAC3C;AAGA,QAAI,MAAM,QAAQ;AAChB,cAAQ,KAAK,IAAI,OAAO,GAAG;AAAA,IAC7B;AAEA,WAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,EACvC;AAEA,WAAS,WAAW,OAAiC;AACnD,WAAO;AAAA,MACL,GAAG;AAAA,MACH,KAAK,aAAa;AAAA;AAAA,MAClB,WAAW,KAAK,IAAI;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AClFO,SAAS,eAAe,MAAsB;AACnD,MAAI,CAAC,QAAQ,KAAK,WAAW,GAAG;AAC9B,WAAO;AAAA,EACT;AAGA,QAAM,QAAQ,KAAK,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC1D,QAAM,YAAY,MAAM;AAGxB,QAAM,YAAY,KAAK;AACvB,QAAM,eAAe,KAAK,KAAK,YAAY,CAAC;AAG5C,QAAM,eAAe,KAAK,KAAK,YAAY,IAAI;AAG/C,SAAO,KAAK,IAAI,cAAc,YAAY;AAC5C;;;ACAO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,UAAU,IAAI;AAEtB,WAAS,SAAS,MAAwB;AACxC,WAAO,KACJ,YAAY,EACZ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AAAA,EACrC;AAEA,WAAS,YAAY,MAAc,QAA0B;AAC3D,UAAM,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,IAAI,EAAE;AAE/C,WAAO,KAAK,KAAK,KAAK;AAAA,EACxB;AAEA,WAAS,aAAa,MAAc,YAAmC;AACrE,UAAM,YAAY,WAAW;AAC7B,UAAM,eAAe,WAAW,OAAO,CAAC,UAAU;AAChD,YAAM,SAAS,SAAS,MAAM,OAAO;AACrC,aAAO,OAAO,SAAS,IAAI;AAAA,IAC7B,CAAC,EAAE;AAEH,QAAI,iBAAiB,EAAG,QAAO;AAE/B,WAAO,KAAK,IAAI,YAAY,YAAY;AAAA,EAC1C;AAEA,WAAS,WAAW,OAAoB,YAAmC;AACzE,UAAM,SAAS,SAAS,MAAM,OAAO;AACrC,QAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AACvC,QAAI,aAAa;AAEjB,eAAW,QAAQ,aAAa;AAC9B,YAAM,KAAK,YAAY,MAAM,MAAM;AACnC,YAAM,MAAM,aAAa,MAAM,UAAU;AACzC,oBAAc,KAAK;AAAA,IACrB;AAGA,WAAO,aAAa,OAAO;AAAA,EAC7B;AAEA,WAAS,MAAM,SAAqC;AAClD,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,SAAS,CAAC;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,MAChB;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,SAAS,QAAQ,IAAI,CAAC,WAAW;AAAA,MACrC;AAAA,MACA,OAAO,WAAW,OAAO,OAAO;AAAA,IAClC,EAAE;AAGF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGvC,UAAM,YAAY,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,UAAU,YAAY,IAAI,CAAC;AAC3E,UAAM,OAAO,OAAO,MAAM,GAAG,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAC1D,UAAM,UAAU,OAAO,MAAM,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAG1D,UAAM,eAAe,KAAK,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAE/E,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;;;ANtGA,IAAM,sBAAsB;AAAA;AAAA,EAE1B,qBAAqB;AAAA;AAAA;AAAA,EAGrB,mBAAmB;AAAA;AAAA;AAAA,EAGnB,qBAAqB,KAAK;AAAA;AAAA;AAAA,EAG1B,cAAc;AAAA;AAAA,IAEZ;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IAGA;AAAA,EACF;AACF;AAQO,SAAS,wBAAwB,QAAkB,QAAmC;AAE3F,QAAM,SAAS,mBAAmB;AAAA,IAChC,WAAW,OAAO,QAAQ;AAAA,EAC5B,CAAC;AAED,QAAM,SAAS,mBAAmB,OAAO,KAAK;AAC9C,QAAM,SAAS,uBAAuB,OAAO,MAAM;AACnD,QAAM,OAAO,mBAAmB;AAEhC,iBAAe,SACb,SACA,UAA2B,CAAC,GACC;AAC7B,UAAM,YAAY,KAAK,IAAI;AAI3B,UAAM,UAAU,uBAAuB,OAAO;AAG9C,UAAM,kBAAkB,QAAQ,IAAI,CAAC,UAAU;AAC7C,YAAM,SAAS,oBAAoB,aAAa;AAAA,QAAK,CAAC,YACpD,QAAQ,KAAK,MAAM,OAAO;AAAA,MAC5B;AAEA,UAAI,QAAQ;AACV,cAAM,YAAY,KAAK,gBAAgB,MAAM,SAAS,CAAC,GAAG,MAAM,MAAM,aAAa,GAAG;AAAA,UACpF,mBAAmB,MAAM;AAAA,QAC3B,CAAC;AAED,eAAO;AAAA,UACL,GAAG;AAAA,UACH,WAAW,MAAM;AAAA,QACnB;AAAA,MACF;AAEA,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,iBAAiB,gBAAgB,IAAI,CAAC,UAAU;AACpD,YAAM,qBACJ,MAAM,QAAQ,KAAK,EAAE,WAAW,OAAO,KAAK,MAAM,QAAQ,KAAK,EAAE,WAAW,YAAY;AAE1F,UAAI,oBAAoB;AACtB,eAAO;AAAA,UACL,GAAG;AAAA,UACH,OAAO,MAAM,QAAQ,oBAAoB;AAAA,QAC3C;AAAA,MACF;AAEA,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,gBAAgB,eAAe,IAAI,CAAC,UAAU;AAClD,YAAM,aAAa,OAAO,eAAe,KAAK;AAC9C,aAAO;AAAA,QACL,GAAG;AAAA,QACH,OAAO;AAAA,MACT;AAAA,IACF,CAAC;AAGD,UAAM,oBAAoB,cAAc,IAAI,CAAC,UAAU;AACrD,YAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,aAAO;AAAA,QACL,GAAG;AAAA,QACH;AAAA,MACF;AAAA,IACF,CAAC;AAGD,UAAM,cAAc,OAAO,MAAM,iBAAiB;AAGlD,QAAI,CAAC,QAAQ,QAAQ;AACnB,iBAAW,SAAS,YAAY,MAAM;AACpC,cAAM,OAAO,IAAI,KAAK;AAAA,MACxB;AAGA,YAAM,OAAO,mBAAmB;AAAA,QAC9B,WAAW,KAAK,IAAI;AAAA,QACpB,eAAe,YAAY;AAAA,QAC3B,cAAc,YAAY;AAAA,QAC1B,gBAAgB,YAAY,QAAQ;AAAA,QACpC,aAAa,KAAK,IAAI,IAAI;AAAA,MAC5B,CAAC;AAAA,IACH;AAGA,UAAM,mBAAmB,YAAY,KAAK,IAAI,CAAC,UAAU,MAAM,OAAO,EAAE,KAAK,IAAI;AAGjF,UAAM,oBAAoB,OAAO,gBAAgB,YAAY,IAAI;AAGjE,UAAM,SAA6B;AAAA,MACjC;AAAA,MACA,cAAc,YAAY;AAAA,MAC1B,aAAa,YAAY;AAAA,MACzB,WACE,YAAY,iBAAiB,KACxB,YAAY,iBAAiB,YAAY,gBAAgB,YAAY,iBACtE;AAAA,MACN,kBAAkB,QAAQ;AAAA,MAC1B,aAAa,YAAY,KAAK;AAAA,MAC9B,YAAY,KAAK,IAAI,IAAI;AAAA,MACzB;AAAA,IACF;AAGA,QAAI,QAAQ,SAAS;AACnB,aAAO,UAAU,YAAY,KAAK,IAAI,CAAC,WAAW;AAAA,QAChD,IAAI,MAAM;AAAA,QACV,OAAO,MAAM;AAAA,QACb,OAAO,MAAM,SAAS;AAAA,QACtB,QAAQ,MAAM,KAAK,SAAS,MAAM;AAAA,QAClC,QAAQ,eAAe,MAAM,OAAO;AAAA,MACtC,EAAE;AAAA,IACJ;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL;AAAA,EACF;AACF;AAQA,SAAS,uBAAuB,SAAgC;AAC9D,QAAM,UAAyB,CAAC;AAChC,QAAM,MAAM,KAAK,IAAI;AAGrB,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,eAAyB,CAAC;AAC9B,MAAI,YAA0D;AAE9D,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,KAAK,KAAK;AAG1B,QAAI,QAAQ,WAAW,OAAO,KAAK,QAAQ,WAAW,YAAY,GAAG;AACnE,UAAI,aAAa,SAAS,GAAG;AAC3B,gBAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AACjE,uBAAe,CAAC;AAAA,MAClB;AACA,kBAAY;AACZ,mBAAa,KAAK,IAAI;AAAA,IACxB,WAGE,QAAQ,SAAS,kBAAkB,KACnC,QAAQ,SAAS,UAAU,KAC3B,QAAQ,SAAS,YAAY,GAC7B;AACA,UAAI,aAAa,SAAS,GAAG;AAC3B,gBAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AACjE,uBAAe,CAAC;AAAA,MAClB;AACA,kBAAY;AACZ,mBAAa,KAAK,IAAI;AAAA,IACxB,WAES,QAAQ,SAAS,oBAAoB,KAAK,QAAQ,SAAS,qBAAqB,GAAG;AAC1F,UAAI,aAAa,SAAS,KAAK,cAAc,UAAU;AACrD,gBAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AACjE,uBAAe,CAAC;AAAA,MAClB;AACA,kBAAY;AACZ,mBAAa,KAAK,IAAI;AAAA,IACxB,WAES,aAAa,SAAS,GAAG;AAChC,mBAAa,KAAK,IAAI;AAAA,IACxB,WAES,QAAQ,SAAS,GAAG;AAC3B,mBAAa,KAAK,IAAI;AACtB,kBAAY;AAAA,IACd;AAAA,EACF;AAGA,MAAI,aAAa,SAAS,GAAG;AAC3B,YAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AAAA,EACnE;AAEA,SAAO,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ,KAAK,EAAE,SAAS,CAAC;AAC1D;AASA,SAAS,YACP,SACA,MACA,UACa;AACb,QAAM,OAAiB,CAAC,IAAI;AAG5B,MAAI,eAAe;AACnB,MAAI,SAAS,eAAgB,gBAAe;AAC5C,MAAI,SAAS,OAAQ,gBAAe;AACpC,MAAI,SAAS,SAAU,gBAAe;AAEtC,SAAO;AAAA,IACL,QAAI,gCAAW;AAAA,IACf;AAAA,IACA,MAAM,YAAY,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,OAAO;AAAA,IACP,OAAO,eAAe,MAAM,WAAW,eAAe,MAAM,UAAU;AAAA,IACtE,KAAK,KAAK;AAAA;AAAA,IACV,aAAa;AAAA,IACb;AAAA,IACA,UAAU,EAAE,KAAK;AAAA,IACjB,QAAQ;AAAA,EACV;AACF;;;AOhSA,IAAAC,sBAA2B;AAkBpB,SAAS,qBAAqB,QAAkB,QAAmC;AACxF,QAAM,SAAS,mBAAmB,OAAO,OAAO;AAChD,QAAM,SAAS,mBAAmB,OAAO,KAAK;AAC9C,QAAM,SAAS,uBAAuB,OAAO,MAAM;AACnD,QAAM,OAAO,mBAAmB;AAEhC,iBAAe,SACb,SACA,UAA2B,CAAC,GACC;AAC7B,UAAM,YAAY,KAAK,IAAI;AAG3B,UAAM,QAAQ,QAAQ,MAAM,IAAI,EAAE,OAAO,CAAC,SAAS,KAAK,KAAK,EAAE,SAAS,CAAC;AACzE,UAAM,UAAyB,MAAM,IAAI,CAAC,aAAa;AAAA,MACrD,QAAI,gCAAW;AAAA,MACf;AAAA,MACA,MAAM,YAAY,OAAO;AAAA,MACzB,WAAW,KAAK,IAAI;AAAA,MACpB,OAAO,KAAK,WAAW,OAAO,IAAI,IAAM;AAAA;AAAA,MACxC,KAAK,OAAO,MAAM,aAAa;AAAA;AAAA,MAC/B,OAAO;AAAA,MACP,aAAa;AAAA,MACb,MAAM,CAAC;AAAA,MACP,UAAU,CAAC;AAAA,MACX,QAAQ,KAAK,WAAW,OAAO;AAAA,IACjC,EAAE;AAGF,UAAM,eAAe,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGlF,UAAM,gBAAgB,QAAQ,IAAI,CAAC,WAAW;AAAA,MAC5C,GAAG;AAAA,MACH,OAAO,OAAO,eAAe,KAAK;AAAA,IACpC,EAAE;AAGF,UAAM,gBAAgB,cAAc,IAAI,CAAC,UAAU,OAAO,WAAW,KAAK,CAAC;AAG3E,UAAM,cAAc,OAAO,MAAM,aAAa;AAG9C,UAAM,mBAAmB,YAAY,KAAK;AAAA,MACxC,CAAC,MAAM,EAAE,UAAU,YAAY,EAAE,UAAU;AAAA,IAC7C;AAGA,UAAM,cAAc,iBAAiB,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAG1F,UAAM,mBAAmB,iBAAiB,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,IAAI;AAGzE,QAAI,CAAC,QAAQ,QAAQ;AACnB,iBAAW,SAAS,kBAAkB;AACpC,cAAM,OAAO,IAAI,KAAK;AAAA,MACxB;AAGA,YAAM,OAAO,mBAAmB;AAAA,QAC9B,WAAW,KAAK,IAAI;AAAA,QACpB,eAAe;AAAA,QACf,cAAc;AAAA,QACd,gBAAgB,QAAQ,SAAS,iBAAiB;AAAA,QAClD,aAAa,KAAK,IAAI,IAAI;AAAA,MAC5B,CAAC;AAAA,IACH;AAGA,UAAM,eAAe,OAAO,gBAAgB,gBAAgB;AAE5D,UAAM,SAA6B;AAAA,MACjC;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW,eAAe,KAAK,eAAe,eAAe,eAAe;AAAA,MAC5E,kBAAkB,QAAQ;AAAA,MAC1B,aAAa,iBAAiB;AAAA,MAC9B,mBAAmB;AAAA,MACnB,YAAY,KAAK,IAAI,IAAI;AAAA,IAC3B;AAGA,QAAI,QAAQ,SAAS;AACnB,aAAO,UAAU,iBAAiB,IAAI,CAAC,OAAO;AAAA,QAC5C,IAAI,EAAE;AAAA,QACN,OAAO,EAAE;AAAA,QACT,OAAO,EAAE;AAAA,QACT,QAAQ,EAAE;AAAA,QACV,QAAQ,eAAe,EAAE,OAAO;AAAA,MAClC,EAAE;AAAA,IACJ;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL;AAAA,EACF;AACF;;;ACvHA,qBAAyC;AACzC,4BAAqB;AAuDrB,SAAS,aAAa,QAAwB;AAC5C,QAAM,aAAY,oBAAI,KAAK,GAAE,YAAY,EAAE,QAAQ,SAAS,GAAG;AAC/D,QAAM,aAAa,GAAG,MAAM,WAAW,SAAS;AAEhD,MAAI;AACF,qCAAa,QAAQ,UAAU;AAC/B,YAAQ,IAAI,iCAA4B,UAAU,EAAE;AACpD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,YAAQ,MAAM,qCAAqC,KAAK,EAAE;AAC1D,WAAO;AAAA,EACT;AACF;AAYA,eAAsB,eAAe,QAAmC;AAEtE,MAAI;AACJ,MAAI;AACF,SAAK,IAAI,sBAAAC,QAAS,MAAM;AAGxB,UAAM,iBAAiB,GAAG,OAAO,eAAe,EAAE,QAAQ,KAAK,CAAC;AAChE,QAAI,mBAAmB,MAAM;AAC3B,cAAQ,MAAM,sCAAiC;AAG/C,cAAI,2BAAW,MAAM,GAAG;AACtB,cAAM,aAAa,aAAa,MAAM;AACtC,YAAI,YAAY;AACd,kBAAQ,IAAI,sBAAsB,UAAU,EAAE;AAAA,QAChD;AAAA,MACF;AAGA,cAAQ,IAAI,iCAAiC;AAC7C,SAAG,MAAM;AACT,WAAK,IAAI,sBAAAA,QAAS,MAAM;AAAA,IAC1B;AAAA,EACF,SAAS,OAAO;AACd,YAAQ,MAAM,mCAA8B,KAAK;AAGjD,YAAI,2BAAW,MAAM,GAAG;AACtB,mBAAa,MAAM;AACnB,cAAQ,IAAI,0BAA0B;AAAA,IACxC;AAEA,SAAK,IAAI,sBAAAA,QAAS,MAAM;AAAA,EAC1B;AAGA,KAAG,OAAO,oBAAoB;AAG9B,KAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAYP;AAGD,KAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAQP;AAGD,KAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GASP;AAGD,KAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAMP;AAGD,QAAM,eAAe,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA,GAI/B;AAED,QAAM,eAAe,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA,GAI/B;AAED,QAAM,UAAU,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAO1B;AAED,QAAM,kBAAkB,GAAG,QAAQ,wCAAwC;AAC3E,QAAM,kBAAkB,GAAG,QAAQ,wCAAwC;AAE3E,SAAO;AAAA,IACL,MAAM,IAAI,OAAmC;AAC3C,YAAM,cAAc,GAAG,YAAY,MAAM;AACvC,qBAAa;AAAA,UACX,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM,SAAS,IAAI;AAAA,QACrB;AAEA,qBAAa;AAAA,UACX,MAAM;AAAA,UACN,MAAM;AAAA,UACN,KAAK,UAAU,MAAM,IAAI;AAAA,UACzB,KAAK,UAAU,MAAM,QAAQ;AAAA,QAC/B;AAAA,MACF,CAAC;AAED,kBAAY;AAAA,IACd;AAAA,IAEA,MAAM,IAAI,IAAyC;AACjD,YAAM,MAAM,QAAQ,IAAI,EAAE;AAE1B,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AAEA,YAAM,IAAI;AAcV,aAAO;AAAA,QACL,IAAI,EAAE;AAAA,QACN,SAAS,EAAE;AAAA,QACX,MAAM,EAAE;AAAA,QACR,WAAW,EAAE;AAAA,QACb,OAAO,EAAE;AAAA,QACT,KAAK,EAAE;AAAA,QACP,OAAO,EAAE;AAAA,QACT,aAAa,EAAE;AAAA,QACf,MAAM,EAAE,OAAO,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC;AAAA,QACrC,UAAU,EAAE,WAAW,KAAK,MAAM,EAAE,QAAQ,IAAI,CAAC;AAAA,QACjD,QAAQ,EAAE,WAAW;AAAA,MACvB;AAAA,IACF;AAAA,IAEA,MAAM,MAAM,SAAqD;AAC/D,UAAI,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASV,YAAM,SAAoB,CAAC;AAE3B,UAAI,QAAQ,OAAO;AACjB,eAAO;AACP,eAAO,KAAK,QAAQ,KAAK;AAAA,MAC3B;AAEA,UAAI,QAAQ,aAAa,QAAW;AAClC,eAAO;AACP,eAAO,KAAK,QAAQ,QAAQ;AAAA,MAC9B;AAEA,UAAI,QAAQ,aAAa,QAAW;AAClC,eAAO;AACP,eAAO,KAAK,QAAQ,QAAQ;AAAA,MAC9B;AAEA,UAAI,QAAQ,WAAW,QAAW;AAChC,eAAO;AACP,eAAO,KAAK,QAAQ,SAAS,IAAI,CAAC;AAAA,MACpC;AAEA,aAAO;AAEP,UAAI,QAAQ,OAAO;AACjB,eAAO;AACP,eAAO,KAAK,QAAQ,KAAK;AAAA,MAC3B;AAEA,UAAI,QAAQ,QAAQ;AAClB,eAAO;AACP,eAAO,KAAK,QAAQ,MAAM;AAAA,MAC5B;AAEA,YAAM,OAAO,GAAG,QAAQ,GAAG;AAC3B,YAAM,OAAO,KAAK,IAAI,GAAG,MAAM;AAE/B,aAAO,KAAK,IAAI,CAAC,QAAQ;AACvB,cAAM,IAAI;AAcV,eAAO;AAAA,UACL,IAAI,EAAE;AAAA,UACN,SAAS,EAAE;AAAA,UACX,MAAM,EAAE;AAAA,UACR,WAAW,EAAE;AAAA,UACb,OAAO,EAAE;AAAA,UACT,KAAK,EAAE;AAAA,UACP,OAAO,EAAE;AAAA,UACT,aAAa,EAAE;AAAA,UACf,MAAM,EAAE,OAAO,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC;AAAA,UACrC,UAAU,EAAE,WAAW,KAAK,MAAM,EAAE,QAAQ,IAAI,CAAC;AAAA,UACjD,QAAQ,EAAE,WAAW;AAAA,QACvB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IAEA,MAAM,OAAO,IAA2B;AACtC,YAAM,cAAc,GAAG,YAAY,MAAM;AACvC,wBAAgB,IAAI,EAAE;AACtB,wBAAgB,IAAI,EAAE;AAAA,MACxB,CAAC;AAED,kBAAY;AAAA,IACd;AAAA,IAEA,MAAM,OAA0B;AAC9B,YAAM,OAAO,GAAG,QAAQ,8BAA8B;AACtD,YAAM,OAAO,KAAK,IAAI;AACtB,aAAO,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,IAC7B;AAAA,IAEA,MAAM,UAA2B;AAC/B,YAAM,SAAS,GAAG,QAAQ,6CAA6C,EAAE,IAAI;AAK7E,SAAG,KAAK,0CAA0C;AAElD,SAAG,KAAK,QAAQ;AAEhB,YAAM,QAAQ,GAAG,QAAQ,6CAA6C,EAAE,IAAI;AAI5E,aAAO,OAAO,QAAQ,MAAM;AAAA,IAC9B;AAAA,IAEA,MAAM,QAAuB;AAC3B,SAAG,MAAM;AAAA,IACX;AAAA,IAEA,MAAM,mBAAmB,OAAqD;AAC5E,YAAM,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA,OAGvB;AAED,WAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IAEA,MAAM,uBAAqD;AACzD,YAAM,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA,OAIvB;AAED,YAAM,OAAO,KAAK,IAAI;AACtB,aAAO;AAAA,IACT;AAAA,IAEA,MAAM,yBAAwC;AAC5C,SAAG,KAAK,gCAAgC;AAAA,IAC1C;AAAA,EACF;AACF;;;AC3WO,SAAS,wBAAyC;AACvD,QAAM,SAAS,mBAAmB,EAAE,YAAY,IAAI,gBAAgB,KAAK,CAAC;AAE1E,WAAS,YAAY,SAA2C;AAC9D,UAAM,YAAY,KAAK,IAAI;AAC3B,UAAM,gBAAgB,QAAQ;AAG9B,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,aAAa,QAAQ,OAAO,CAAC,UAAU;AAC3C,YAAM,gBAAgB,MAAM,MAAM,aAAa;AAC/C,YAAM,QAAQ,OAAO,eAAe,cAAc,MAAM,GAAG;AAC3D,aAAO,QAAQ;AAAA,IACjB,CAAC;AAED,UAAM,iBAAiB,gBAAgB,WAAW;AAGlD,UAAM,kBAAkB,eAAe,UAAU;AACjD,UAAM,SAAS,gBAAgB,eAAe;AAG9C,UAAM,eAAe,IAAI,IAAI,gBAAgB,QAAQ,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AACvF,UAAM,gBAAgB,WAAW,OAAO,CAAC,MAAM,CAAC,aAAa,IAAI,EAAE,EAAE,CAAC;AAGtE,UAAM,OAAO,CAAC,GAAG,QAAQ,GAAG,aAAa;AACzC,UAAM,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC;AAEtE,UAAM,oBAAoB,gBAAgB,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,QAAQ,SAAS,IAAI,CAAC;AAE5F,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,eAAe;AAAA,MACf,cAAc,KAAK;AAAA,MACnB;AAAA,MACA;AAAA,MACA,kBAAkB,gBAAgB,IAAI,KAAK,SAAS,gBAAgB;AAAA,MACpE,YAAY,KAAK,IAAI,IAAI;AAAA,IAC3B;AAAA,EACF;AAEA,WAAS,eAAe,SAA0C;AAChE,UAAM,SAA2B,CAAC;AAClC,UAAM,YAAY,oBAAI,IAAY;AAGlC,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,YAAM,QAAQ,QAAQ,CAAC;AACvB,UAAI,CAAC,SAAS,UAAU,IAAI,MAAM,EAAE,EAAG;AAEvC,YAAM,aAAa,QAAQ,OAAO,CAAC,GAAG,QAAQ,QAAQ,KAAK,EAAE,SAAS,MAAM,IAAI;AAEhF,UAAI,WAAW,SAAS,GAAG;AACzB,cAAM,QAAwB;AAAA,UAC5B,SAAS,CAAC,OAAO,GAAG,UAAU;AAAA,UAC9B,YAAY;AAAA;AAAA,QACd;AACA,eAAO,KAAK,KAAK;AAGjB,kBAAU,IAAI,MAAM,EAAE;AACtB,mBAAW,OAAO,YAAY;AAC5B,oBAAU,IAAI,IAAI,EAAE;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAGA,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,CAAC,UAAU,UAAU,IAAI,OAAO,EAAE,EAAG;AAEzC,eAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AAC3C,cAAM,SAAS,QAAQ,CAAC;AACxB,YAAI,CAAC,UAAU,UAAU,IAAI,OAAO,EAAE,EAAG;AAEzC,cAAM,aAAa,iBAAiB,OAAO,SAAS,OAAO,OAAO;AAElE,YAAI,cAAc,MAAM;AACtB,gBAAM,QAAwB;AAAA,YAC5B,SAAS,CAAC,QAAQ,MAAM;AAAA,YACxB;AAAA,UACF;AACA,iBAAO,KAAK,KAAK;AAEjB,oBAAU,IAAI,OAAO,EAAE;AACvB,oBAAU,IAAI,OAAO,EAAE;AACvB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,gBAAgB,QAAyC;AAChE,UAAM,SAAwB,CAAC;AAE/B,eAAW,SAAS,QAAQ;AAE1B,YAAM,SAAS,CAAC,GAAG,MAAM,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAClE,YAAM,OAAO,OAAO,CAAC;AACrB,UAAI,CAAC,KAAM;AAGX,YAAM,mBAAmB,MAAM,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,aAAa,CAAC;AAGhF,YAAM,UAAU,IAAI,IAAI,MAAM,QAAQ,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;AAE5D,aAAO,KAAK;AAAA,QACV,GAAG;AAAA,QACH,aAAa;AAAA,QACb,MAAM,MAAM,KAAK,OAAO;AAAA,MAC1B,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAQA,WAAS,iBAAiB,OAAe,OAAuB;AAC9D,UAAM,SAAS,SAAS,KAAK;AAC7B,UAAM,SAAS,SAAS,KAAK;AAG7B,UAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAG5C,UAAM,OAA+B,CAAC;AACtC,UAAM,OAA+B,CAAC;AAEtC,eAAW,QAAQ,OAAO;AACxB,WAAK,IAAI,IAAI,OAAO,OAAO,CAAC,MAAM,MAAM,IAAI,EAAE;AAC9C,WAAK,IAAI,IAAI,OAAO,OAAO,CAAC,MAAM,MAAM,IAAI,EAAE;AAAA,IAChD;AAGA,QAAI,aAAa;AACjB,QAAI,OAAO;AACX,QAAI,OAAO;AAEX,eAAW,QAAQ,OAAO;AACxB,YAAM,SAAS,KAAK,IAAI,KAAK;AAC7B,YAAM,SAAS,KAAK,IAAI,KAAK;AAC7B,oBAAc,SAAS;AACvB,cAAQ,SAAS;AACjB,cAAQ,SAAS;AAAA,IACnB;AAEA,WAAO,KAAK,KAAK,IAAI;AACrB,WAAO,KAAK,KAAK,IAAI;AAErB,QAAI,SAAS,KAAK,SAAS,EAAG,QAAO;AAErC,WAAO,cAAc,OAAO;AAAA,EAC9B;AAEA,WAAS,SAAS,MAAwB;AACxC,WAAO,KACJ,YAAY,EACZ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AAAA,EACrC;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AChJO,IAAM,iBAA8B;AAAA,EACzC,SAAS;AAAA,IACP,WAAW;AAAA,IACX,gBAAgB;AAAA,EAClB;AAAA,EACA,OAAO;AAAA,IACL,YAAY;AAAA,IACZ,gBAAgB;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,IACN,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,EAClB;AAAA,EACA,OAAO;AAAA,EACP,IAAI;AAAA,IACF,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,SAAS;AAAA,EACX;AAAA,EACA,iBAAiB;AACnB;;;ACrEO,SAAS,aAAa,UAAU,OAAe;AACpD,SAAO;AAAA,IACL,MAAM,YAAoB,MAAuB;AAC/C,UAAI,SAAS;AACX,gBAAQ,MAAM,WAAW,OAAO,IAAI,GAAG,IAAI;AAAA,MAC7C;AAAA,IACF;AAAA,IACA,KAAK,YAAoB,MAAuB;AAC9C,cAAQ,KAAK,UAAU,OAAO,IAAI,GAAG,IAAI;AAAA,IAC3C;AAAA,IACA,KAAK,YAAoB,MAAuB;AAC9C,cAAQ,KAAK,UAAU,OAAO,IAAI,GAAG,IAAI;AAAA,IAC3C;AAAA,IACA,MAAM,YAAoB,MAAuB;AAC/C,cAAQ,MAAM,WAAW,OAAO,IAAI,GAAG,IAAI;AAAA,IAC7C;AAAA,EACF;AACF;","names":["import_node_crypto","import_node_crypto","import_node_crypto","Database"]}