@ulrichc1/sparn 1.2.1 → 1.2.2

package/dist/hooks/pre-prompt.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/hooks/pre-prompt.ts","../../src/utils/tokenizer.ts","../../src/core/engram-scorer.ts","../../src/core/budget-pruner.ts","../../src/utils/context-parser.ts","../../src/utils/hash.ts"],"sourcesContent":["#!/usr/bin/env node\n/**\n * Pre-Prompt Hook - Claude Code hook for real-time context optimization\n *\n * Reads context from stdin, checks if tokens exceed threshold,\n * optimizes if needed, writes to stdout.\n *\n * CRITICAL: Always exits 0 (never disrupts Claude Code).\n * Falls through unmodified if under threshold or on error.\n */\n\nimport { readFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport { load as parseYAML } from 'js-yaml';\nimport { createBudgetPrunerFromConfig } from '../core/budget-pruner.js';\nimport type { SparnConfig } from '../types/config.js';\nimport { parseClaudeCodeContext } from '../utils/context-parser.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n// Exit 0 wrapper for all errors\nfunction exitSuccess(output: string): void {\n  process.stdout.write(output);\n  process.exit(0);\n}\n\n// Main hook logic\nasync function main(): Promise<void> {\n  try {\n    // Read stdin (context)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n\n    // Estimate tokens\n    const tokens = estimateTokens(input);\n\n    // Load config\n    const configPath = join(homedir(), '.sparn', 'config.yaml');\n    let config: SparnConfig;\n\n    try {\n      const configYAML = readFileSync(configPath, 'utf-8');\n      config = parseYAML(configYAML) as SparnConfig;\n    } catch {\n      // Config not found or invalid, fall through\n      exitSuccess(input);\n      return;\n    }\n\n    const { autoOptimizeThreshold, tokenBudget } = config.realtime;\n\n    // Check if optimization needed\n    if (tokens < autoOptimizeThreshold) {\n      // Under threshold, pass through unmodified\n      exitSuccess(input);\n      return;\n    }\n\n    // Parse context into entries\n    const entries = parseClaudeCodeContext(input);\n\n    if (entries.length === 0) {\n      // No entries to optimize, pass through\n      exitSuccess(input);\n      return;\n    }\n\n    // Create budget pruner\n    const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);\n\n    // Prune to fit budget\n    const result = pruner.pruneToFit(entries, tokenBudget);\n\n    // Build optimized context (chronologically ordered)\n    const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);\n    const optimizedContext = sorted.map((e) => e.content).join('\\n\\n');\n\n    // Output optimized context\n    exitSuccess(optimizedContext);\n  } catch (_error) {\n    // On any error, pass through original input\n    // Read stdin again if needed (shouldn't happen, but safety fallback)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n    exitSuccess(input);\n  }\n}\n\n// Run hook\nmain();\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 * 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 * Budget-Aware Pruner - Token budget optimization\n *\n * Unlike SparsePruner which keeps top N% entries, BudgetPruner fits entries\n * within a target token budget using priority scoring that combines:\n * - TF-IDF relevance\n * - Engram decay\n * - Confidence state multipliers\n * - BTSP bypass (always included)\n *\n * Target use case: Real-time optimization for Opus model (~50K token budget)\n */\n\nimport type { RealtimeConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport type { PruneResult } from '../types/pruner.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\nimport { createEngramScorer } from './engram-scorer.js';\n\nexport interface BudgetPrunerConfig {\n  /** Target token budget */\n  tokenBudget: number;\n  /** Decay configuration */\n  decay: {\n    defaultTTL: number;\n    decayThreshold: number;\n  };\n  /** State multipliers */\n  states: {\n    activeThreshold: number;\n    readyThreshold: number;\n  };\n}\n\nexport interface BudgetPruner {\n  /**\n   * Prune entries to fit within token budget\n   * @param entries - Memory entries to prune\n   * @param budget - Optional override budget (uses config default if not provided)\n   * @returns Result with kept/removed entries and budget utilization\n   */\n  pruneToFit(entries: MemoryEntry[], budget?: number): PruneResult & { budgetUtilization: number };\n\n  /**\n   * Calculate priority score for an entry\n   * @param entry - Entry to score\n   * @param allEntries - All entries for TF-IDF calculation\n   * @returns Priority score (higher = more important)\n   */\n  priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number;\n}\n\n/**\n * Create a budget-aware pruner instance\n * @param config - Pruner configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPruner(config: BudgetPrunerConfig): BudgetPruner {\n  const { tokenBudget, decay } = config;\n  const engramScorer = createEngramScorer(decay);\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 calculateTFIDF(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 getStateMultiplier(entry: MemoryEntry): number {\n    // BTSP entries get max priority (handled separately, but keep high multiplier)\n    if (entry.isBTSP) return 2.0;\n\n    // State-based multipliers\n    switch (entry.state) {\n      case 'active':\n        return 2.0;\n      case 'ready':\n        return 1.0;\n      case 'silent':\n        return 0.5;\n      default:\n        return 1.0;\n    }\n  }\n\n  function priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tfidf = calculateTFIDF(entry, allEntries);\n    const currentScore = engramScorer.calculateScore(entry);\n    const engramDecay = 1 - currentScore; // Lower decay = higher priority\n    const stateMultiplier = getStateMultiplier(entry);\n\n    // Priority = TF-IDF * (1 - decay) * state_multiplier\n    // This balances relevance, recency, and confidence state\n    return tfidf * (1 - engramDecay) * stateMultiplier;\n  }\n\n  function pruneToFit(\n    entries: MemoryEntry[],\n    budget: number = tokenBudget,\n  ): PruneResult & { budgetUtilization: number } {\n    if (entries.length === 0) {\n      return {\n        kept: [],\n        removed: [],\n        originalTokens: 0,\n        prunedTokens: 0,\n        budgetUtilization: 0,\n      };\n    }\n\n    // Calculate original token count\n    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 1: Separate BTSP entries (always included, bypass budget)\n    const btspEntries = entries.filter((e) => e.isBTSP);\n    const regularEntries = entries.filter((e) => !e.isBTSP);\n\n    const btspTokens = btspEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 2: Score regular entries\n    const scored = regularEntries.map((entry) => ({\n      entry,\n      score: priorityScore(entry, entries),\n      tokens: estimateTokens(entry.content),\n    }));\n\n    // Step 3: Sort by priority score descending\n    scored.sort((a, b) => b.score - a.score);\n\n    // Step 4: Greedy fill until budget exceeded\n    const kept: MemoryEntry[] = [...btspEntries];\n    const removed: MemoryEntry[] = [];\n    let currentTokens = btspTokens;\n\n    for (const item of scored) {\n      if (currentTokens + item.tokens <= budget) {\n        kept.push(item.entry);\n        currentTokens += item.tokens;\n      } else {\n        removed.push(item.entry);\n      }\n    }\n\n    const budgetUtilization = budget > 0 ? currentTokens / budget : 0;\n\n    return {\n      kept,\n      removed,\n      originalTokens,\n      prunedTokens: currentTokens,\n      budgetUtilization,\n    };\n  }\n\n  return {\n    pruneToFit,\n    priorityScore,\n  };\n}\n\n/**\n * Helper to create budget pruner from RealtimeConfig\n * @param realtimeConfig - Realtime configuration\n * @param decayConfig - Decay configuration\n * @param statesConfig - States configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPrunerFromConfig(\n  realtimeConfig: RealtimeConfig,\n  decayConfig: { defaultTTL: number; decayThreshold: number },\n  statesConfig: { activeThreshold: number; readyThreshold: number },\n): BudgetPruner {\n  return createBudgetPruner({\n    tokenBudget: realtimeConfig.tokenBudget,\n    decay: decayConfig,\n    states: statesConfig,\n  });\n}\n","/**\n * Context Parser - Shared utilities for parsing agent contexts into memory entries\n *\n * Extracted from claude-code adapter to enable reuse across:\n * - Adapters (claude-code, generic)\n * - Real-time pipeline (streaming context)\n * - Hooks (pre-prompt, post-tool-result)\n */\n\nimport { randomUUID } from 'node:crypto';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from './hash.js';\n\n/**\n * Block type classification for Claude Code context\n */\nexport type BlockType = 'conversation' | 'tool' | 'result' | 'other';\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 */\nexport function 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: BlockType = '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 */\nexport function createEntry(content: string, type: BlockType, baseTime: number): 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/**\n * Parse generic context (fallback for non-Claude-Code agents)\n * Splits on double newlines, treats as paragraphs\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nexport function parseGenericContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split on double newlines (paragraph boundaries)\n  const blocks = context.split(/\\n\\n+/);\n\n  for (const block of blocks) {\n    const trimmed = block.trim();\n    if (trimmed.length === 0) continue;\n\n    entries.push(createEntry(trimmed, 'other', now));\n  }\n\n  return entries;\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"],"mappings":";;;;AAWA,qBAA6B;AAC7B,qBAAwB;AACxB,uBAAqB;AACrB,qBAAkC;;;ACM3B,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;;;ACWO,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;;;AC7CO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,aAAa,MAAM,IAAI;AAC/B,QAAM,eAAe,mBAAmB,KAAK;AAE7C,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,eAAe,OAAoB,YAAmC;AAC7E,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,mBAAmB,OAA4B;AAEtD,QAAI,MAAM,OAAQ,QAAO;AAGzB,YAAQ,MAAM,OAAO;AAAA,MACnB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAEA,WAAS,cAAc,OAAoB,YAAmC;AAC5E,UAAM,QAAQ,eAAe,OAAO,UAAU;AAC9C,UAAM,eAAe,aAAa,eAAe,KAAK;AACtD,UAAM,cAAc,IAAI;AACxB,UAAM,kBAAkB,mBAAmB,KAAK;AAIhD,WAAO,SAAS,IAAI,eAAe;AAAA,EACrC;AAEA,WAAS,WACP,SACA,SAAiB,aAC4B;AAC7C,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,SAAS,CAAC;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,mBAAmB;AAAA,MACrB;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,MAAM;AAClD,UAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM;AAEtD,UAAM,aAAa,YAAY,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,SAAS,eAAe,IAAI,CAAC,WAAW;AAAA,MAC5C;AAAA,MACA,OAAO,cAAc,OAAO,OAAO;AAAA,MACnC,QAAQ,eAAe,MAAM,OAAO;AAAA,IACtC,EAAE;AAGF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGvC,UAAM,OAAsB,CAAC,GAAG,WAAW;AAC3C,UAAM,UAAyB,CAAC;AAChC,QAAI,gBAAgB;AAEpB,eAAW,QAAQ,QAAQ;AACzB,UAAI,gBAAgB,KAAK,UAAU,QAAQ;AACzC,aAAK,KAAK,KAAK,KAAK;AACpB,yBAAiB,KAAK;AAAA,MACxB,OAAO;AACL,gBAAQ,KAAK,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,oBAAoB,SAAS,IAAI,gBAAgB,SAAS;AAEhE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,6BACd,gBACA,aACA,cACc;AACd,SAAO,mBAAmB;AAAA,IACxB,aAAa,eAAe;AAAA,IAC5B,OAAO;AAAA,IACP,QAAQ;AAAA,EACV,CAAC;AACH;;;AC3MA,IAAAA,sBAA2B;;;ACJ3B,yBAA2B;AAcpB,SAAS,YAAY,SAAyB;AACnD,aAAO,+BAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;;;ADGO,SAAS,uBAAuB,SAAgC;AACrE,QAAM,UAAyB,CAAC;AAChC,QAAM,MAAM,KAAK,IAAI;AAGrB,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,eAAyB,CAAC;AAC9B,MAAI,YAAuB;AAE3B,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;AASO,SAAS,YAAY,SAAiB,MAAiB,UAA+B;AAC3F,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;;;AJ9FA,SAAS,YAAY,QAAsB;AACzC,UAAQ,OAAO,MAAM,MAAM;AAC3B,UAAQ,KAAK,CAAC;AAChB;AAGA,eAAe,OAAsB;AACnC,MAAI;AAEF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAGpD,UAAM,SAAS,eAAe,KAAK;AAGnC,UAAM,iBAAa,2BAAK,wBAAQ,GAAG,UAAU,aAAa;AAC1D,QAAI;AAEJ,QAAI;AACF,YAAM,iBAAa,6BAAa,YAAY,OAAO;AACnD,mBAAS,eAAAC,MAAU,UAAU;AAAA,IAC/B,QAAQ;AAEN,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,UAAM,EAAE,uBAAuB,YAAY,IAAI,OAAO;AAGtD,QAAI,SAAS,uBAAuB;AAElC,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,UAAU,uBAAuB,KAAK;AAE5C,QAAI,QAAQ,WAAW,GAAG;AAExB,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,SAAS,6BAA6B,OAAO,UAAU,OAAO,OAAO,OAAO,MAAM;AAGxF,UAAM,SAAS,OAAO,WAAW,SAAS,WAAW;AAGrD,UAAM,SAAS,CAAC,GAAG,OAAO,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxE,UAAM,mBAAmB,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM;AAGjE,gBAAY,gBAAgB;AAAA,EAC9B,SAAS,QAAQ;AAGf,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AACpD,gBAAY,KAAK;AAAA,EACnB;AACF;AAGA,KAAK;","names":["import_node_crypto","parseYAML"]}
+{"version":3,"sources":["../../src/hooks/pre-prompt.ts","../../src/utils/tokenizer.ts","../../src/core/engram-scorer.ts","../../src/core/budget-pruner.ts","../../src/utils/context-parser.ts","../../src/utils/hash.ts"],"sourcesContent":["#!/usr/bin/env node\n/**\n * Pre-Prompt Hook - Claude Code hook for real-time context optimization\n *\n * Reads context from stdin, checks if tokens exceed threshold,\n * optimizes if needed, writes to stdout.\n *\n * CRITICAL: Always exits 0 (never disrupts Claude Code).\n * Falls through unmodified if under threshold or on error.\n */\n\nimport { appendFileSync, existsSync, readFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport { load as parseYAML } from 'js-yaml';\nimport { createBudgetPrunerFromConfig } from '../core/budget-pruner.js';\nimport type { SparnConfig } from '../types/config.js';\nimport { parseClaudeCodeContext } from '../utils/context-parser.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n// Debug logging (optional, set via env var)\nconst DEBUG = process.env['SPARN_DEBUG'] === 'true';\nconst LOG_FILE = process.env['SPARN_LOG_FILE'] || join(homedir(), '.sparn-hook.log');\n\nfunction log(message: string): void {\n  if (DEBUG) {\n    const timestamp = new Date().toISOString();\n    appendFileSync(LOG_FILE, `[${timestamp}] [pre-prompt] ${message}\\n`);\n  }\n}\n\n// Exit 0 wrapper for all errors\nfunction exitSuccess(output: string): void {\n  process.stdout.write(output);\n  process.exit(0);\n}\n\n// Main hook logic\nasync function main(): Promise<void> {\n  try {\n    // Read stdin (context)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n\n    // Estimate tokens\n    const tokens = estimateTokens(input);\n    log(`Input tokens: ${tokens}`);\n\n    // Load config (check project dir first, then global)\n    const projectConfigPath = join(process.cwd(), '.sparn', 'config.yaml');\n    const globalConfigPath = join(homedir(), '.sparn', 'config.yaml');\n    let config: SparnConfig;\n    let configPath: string;\n\n    if (existsSync(projectConfigPath)) {\n      configPath = projectConfigPath;\n      log(`Using project config: ${configPath}`);\n    } else if (existsSync(globalConfigPath)) {\n      configPath = globalConfigPath;\n      log(`Using global config: ${configPath}`);\n    } else {\n      log('No config found, passing through');\n      exitSuccess(input);\n      return;\n    }\n\n    try {\n      const configYAML = readFileSync(configPath, 'utf-8');\n      config = parseYAML(configYAML) as SparnConfig;\n    } catch (err) {\n      log(`Config parse error: ${err}`);\n      exitSuccess(input);\n      return;\n    }\n\n    const { autoOptimizeThreshold, tokenBudget } = config.realtime;\n    log(`Threshold: ${autoOptimizeThreshold}, Budget: ${tokenBudget}`);\n\n    // Check if optimization needed\n    if (tokens < autoOptimizeThreshold) {\n      log(`Under threshold (${tokens} < ${autoOptimizeThreshold}), passing through`);\n      exitSuccess(input);\n      return;\n    }\n\n    log(`Over threshold! Optimizing ${tokens} tokens to fit ${tokenBudget} budget`);\n\n    // Parse context into entries\n    const entries = parseClaudeCodeContext(input);\n    log(`Parsed ${entries.length} context entries`);\n\n    if (entries.length === 0) {\n      log('No entries to optimize, passing through');\n      exitSuccess(input);\n      return;\n    }\n\n    // Create budget pruner\n    const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);\n\n    // Prune to fit budget\n    const result = pruner.pruneToFit(entries, tokenBudget);\n    const outputTokens = estimateTokens(result.kept.map((e) => e.content).join('\\n\\n'));\n    const saved = tokens - outputTokens;\n    const reduction = ((saved / tokens) * 100).toFixed(1);\n\n    log(`Optimization complete: ${tokens} → ${outputTokens} tokens (${reduction}% reduction)`);\n    log(`Kept ${result.kept.length}/${entries.length} entries`);\n\n    // Build optimized context (chronologically ordered)\n    const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);\n    const optimizedContext = sorted.map((e) => e.content).join('\\n\\n');\n\n    // Output optimized context\n    exitSuccess(optimizedContext);\n  } catch (error) {\n    // On any error, pass through original input\n    log(`Error in pre-prompt hook: ${error instanceof Error ? error.message : String(error)}`);\n    // Read stdin again if needed (shouldn't happen, but safety fallback)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n    exitSuccess(input);\n  }\n}\n\n// Run hook\nmain();\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 * 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 * Budget-Aware Pruner - Token budget optimization\n *\n * Unlike SparsePruner which keeps top N% entries, BudgetPruner fits entries\n * within a target token budget using priority scoring that combines:\n * - TF-IDF relevance\n * - Engram decay\n * - Confidence state multipliers\n * - BTSP bypass (always included)\n *\n * Target use case: Real-time optimization for Opus model (~50K token budget)\n */\n\nimport type { RealtimeConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport type { PruneResult } from '../types/pruner.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\nimport { createEngramScorer } from './engram-scorer.js';\n\nexport interface BudgetPrunerConfig {\n  /** Target token budget */\n  tokenBudget: number;\n  /** Decay configuration */\n  decay: {\n    defaultTTL: number;\n    decayThreshold: number;\n  };\n  /** State multipliers */\n  states: {\n    activeThreshold: number;\n    readyThreshold: number;\n  };\n}\n\nexport interface BudgetPruner {\n  /**\n   * Prune entries to fit within token budget\n   * @param entries - Memory entries to prune\n   * @param budget - Optional override budget (uses config default if not provided)\n   * @returns Result with kept/removed entries and budget utilization\n   */\n  pruneToFit(entries: MemoryEntry[], budget?: number): PruneResult & { budgetUtilization: number };\n\n  /**\n   * Calculate priority score for an entry\n   * @param entry - Entry to score\n   * @param allEntries - All entries for TF-IDF calculation\n   * @returns Priority score (higher = more important)\n   */\n  priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number;\n}\n\n/**\n * Create a budget-aware pruner instance\n * @param config - Pruner configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPruner(config: BudgetPrunerConfig): BudgetPruner {\n  const { tokenBudget, decay } = config;\n  const engramScorer = createEngramScorer(decay);\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 calculateTFIDF(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 getStateMultiplier(entry: MemoryEntry): number {\n    // BTSP entries get max priority (handled separately, but keep high multiplier)\n    if (entry.isBTSP) return 2.0;\n\n    // State-based multipliers\n    switch (entry.state) {\n      case 'active':\n        return 2.0;\n      case 'ready':\n        return 1.0;\n      case 'silent':\n        return 0.5;\n      default:\n        return 1.0;\n    }\n  }\n\n  function priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tfidf = calculateTFIDF(entry, allEntries);\n    const currentScore = engramScorer.calculateScore(entry);\n    const engramDecay = 1 - currentScore; // Lower decay = higher priority\n    const stateMultiplier = getStateMultiplier(entry);\n\n    // Priority = TF-IDF * (1 - decay) * state_multiplier\n    // This balances relevance, recency, and confidence state\n    return tfidf * (1 - engramDecay) * stateMultiplier;\n  }\n\n  function pruneToFit(\n    entries: MemoryEntry[],\n    budget: number = tokenBudget,\n  ): PruneResult & { budgetUtilization: number } {\n    if (entries.length === 0) {\n      return {\n        kept: [],\n        removed: [],\n        originalTokens: 0,\n        prunedTokens: 0,\n        budgetUtilization: 0,\n      };\n    }\n\n    // Calculate original token count\n    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 1: Separate BTSP entries (always included, bypass budget)\n    const btspEntries = entries.filter((e) => e.isBTSP);\n    const regularEntries = entries.filter((e) => !e.isBTSP);\n\n    const btspTokens = btspEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 2: Score regular entries\n    const scored = regularEntries.map((entry) => ({\n      entry,\n      score: priorityScore(entry, entries),\n      tokens: estimateTokens(entry.content),\n    }));\n\n    // Step 3: Sort by priority score descending\n    scored.sort((a, b) => b.score - a.score);\n\n    // Step 4: Greedy fill until budget exceeded\n    const kept: MemoryEntry[] = [...btspEntries];\n    const removed: MemoryEntry[] = [];\n    let currentTokens = btspTokens;\n\n    for (const item of scored) {\n      if (currentTokens + item.tokens <= budget) {\n        kept.push(item.entry);\n        currentTokens += item.tokens;\n      } else {\n        removed.push(item.entry);\n      }\n    }\n\n    const budgetUtilization = budget > 0 ? currentTokens / budget : 0;\n\n    return {\n      kept,\n      removed,\n      originalTokens,\n      prunedTokens: currentTokens,\n      budgetUtilization,\n    };\n  }\n\n  return {\n    pruneToFit,\n    priorityScore,\n  };\n}\n\n/**\n * Helper to create budget pruner from RealtimeConfig\n * @param realtimeConfig - Realtime configuration\n * @param decayConfig - Decay configuration\n * @param statesConfig - States configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPrunerFromConfig(\n  realtimeConfig: RealtimeConfig,\n  decayConfig: { defaultTTL: number; decayThreshold: number },\n  statesConfig: { activeThreshold: number; readyThreshold: number },\n): BudgetPruner {\n  return createBudgetPruner({\n    tokenBudget: realtimeConfig.tokenBudget,\n    decay: decayConfig,\n    states: statesConfig,\n  });\n}\n","/**\n * Context Parser - Shared utilities for parsing agent contexts into memory entries\n *\n * Extracted from claude-code adapter to enable reuse across:\n * - Adapters (claude-code, generic)\n * - Real-time pipeline (streaming context)\n * - Hooks (pre-prompt, post-tool-result)\n */\n\nimport { randomUUID } from 'node:crypto';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from './hash.js';\n\n/**\n * Block type classification for Claude Code context\n */\nexport type BlockType = 'conversation' | 'tool' | 'result' | 'other';\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 */\nexport function 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: BlockType = '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 */\nexport function createEntry(content: string, type: BlockType, baseTime: number): 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/**\n * Parse generic context (fallback for non-Claude-Code agents)\n * Splits on double newlines, treats as paragraphs\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nexport function parseGenericContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split on double newlines (paragraph boundaries)\n  const blocks = context.split(/\\n\\n+/);\n\n  for (const block of blocks) {\n    const trimmed = block.trim();\n    if (trimmed.length === 0) continue;\n\n    entries.push(createEntry(trimmed, 'other', now));\n  }\n\n  return entries;\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"],"mappings":";;;;AAWA,qBAAyD;AACzD,qBAAwB;AACxB,uBAAqB;AACrB,qBAAkC;;;ACM3B,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;;;ACWO,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;;;AC7CO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,aAAa,MAAM,IAAI;AAC/B,QAAM,eAAe,mBAAmB,KAAK;AAE7C,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,eAAe,OAAoB,YAAmC;AAC7E,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,mBAAmB,OAA4B;AAEtD,QAAI,MAAM,OAAQ,QAAO;AAGzB,YAAQ,MAAM,OAAO;AAAA,MACnB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAEA,WAAS,cAAc,OAAoB,YAAmC;AAC5E,UAAM,QAAQ,eAAe,OAAO,UAAU;AAC9C,UAAM,eAAe,aAAa,eAAe,KAAK;AACtD,UAAM,cAAc,IAAI;AACxB,UAAM,kBAAkB,mBAAmB,KAAK;AAIhD,WAAO,SAAS,IAAI,eAAe;AAAA,EACrC;AAEA,WAAS,WACP,SACA,SAAiB,aAC4B;AAC7C,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,SAAS,CAAC;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,mBAAmB;AAAA,MACrB;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,MAAM;AAClD,UAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM;AAEtD,UAAM,aAAa,YAAY,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,SAAS,eAAe,IAAI,CAAC,WAAW;AAAA,MAC5C;AAAA,MACA,OAAO,cAAc,OAAO,OAAO;AAAA,MACnC,QAAQ,eAAe,MAAM,OAAO;AAAA,IACtC,EAAE;AAGF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGvC,UAAM,OAAsB,CAAC,GAAG,WAAW;AAC3C,UAAM,UAAyB,CAAC;AAChC,QAAI,gBAAgB;AAEpB,eAAW,QAAQ,QAAQ;AACzB,UAAI,gBAAgB,KAAK,UAAU,QAAQ;AACzC,aAAK,KAAK,KAAK,KAAK;AACpB,yBAAiB,KAAK;AAAA,MACxB,OAAO;AACL,gBAAQ,KAAK,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,oBAAoB,SAAS,IAAI,gBAAgB,SAAS;AAEhE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,6BACd,gBACA,aACA,cACc;AACd,SAAO,mBAAmB;AAAA,IACxB,aAAa,eAAe;AAAA,IAC5B,OAAO;AAAA,IACP,QAAQ;AAAA,EACV,CAAC;AACH;;;AC3MA,IAAAA,sBAA2B;;;ACJ3B,yBAA2B;AAcpB,SAAS,YAAY,SAAyB;AACnD,aAAO,+BAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;;;ADGO,SAAS,uBAAuB,SAAgC;AACrE,QAAM,UAAyB,CAAC;AAChC,QAAM,MAAM,KAAK,IAAI;AAGrB,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,eAAyB,CAAC;AAC9B,MAAI,YAAuB;AAE3B,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;AASO,SAAS,YAAY,SAAiB,MAAiB,UAA+B;AAC3F,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;;;AJ9FA,IAAM,QAAQ,QAAQ,IAAI,aAAa,MAAM;AAC7C,IAAM,WAAW,QAAQ,IAAI,gBAAgB,SAAK,2BAAK,wBAAQ,GAAG,iBAAiB;AAEnF,SAAS,IAAI,SAAuB;AAClC,MAAI,OAAO;AACT,UAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,uCAAe,UAAU,IAAI,SAAS,kBAAkB,OAAO;AAAA,CAAI;AAAA,EACrE;AACF;AAGA,SAAS,YAAY,QAAsB;AACzC,UAAQ,OAAO,MAAM,MAAM;AAC3B,UAAQ,KAAK,CAAC;AAChB;AAGA,eAAe,OAAsB;AACnC,MAAI;AAEF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAGpD,UAAM,SAAS,eAAe,KAAK;AACnC,QAAI,iBAAiB,MAAM,EAAE;AAG7B,UAAM,wBAAoB,uBAAK,QAAQ,IAAI,GAAG,UAAU,aAAa;AACrE,UAAM,uBAAmB,2BAAK,wBAAQ,GAAG,UAAU,aAAa;AAChE,QAAI;AACJ,QAAI;AAEJ,YAAI,2BAAW,iBAAiB,GAAG;AACjC,mBAAa;AACb,UAAI,yBAAyB,UAAU,EAAE;AAAA,IAC3C,eAAW,2BAAW,gBAAgB,GAAG;AACvC,mBAAa;AACb,UAAI,wBAAwB,UAAU,EAAE;AAAA,IAC1C,OAAO;AACL,UAAI,kCAAkC;AACtC,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,QAAI;AACF,YAAM,iBAAa,6BAAa,YAAY,OAAO;AACnD,mBAAS,eAAAC,MAAU,UAAU;AAAA,IAC/B,SAAS,KAAK;AACZ,UAAI,uBAAuB,GAAG,EAAE;AAChC,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,UAAM,EAAE,uBAAuB,YAAY,IAAI,OAAO;AACtD,QAAI,cAAc,qBAAqB,aAAa,WAAW,EAAE;AAGjE,QAAI,SAAS,uBAAuB;AAClC,UAAI,oBAAoB,MAAM,MAAM,qBAAqB,oBAAoB;AAC7E,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,QAAI,8BAA8B,MAAM,kBAAkB,WAAW,SAAS;AAG9E,UAAM,UAAU,uBAAuB,KAAK;AAC5C,QAAI,UAAU,QAAQ,MAAM,kBAAkB;AAE9C,QAAI,QAAQ,WAAW,GAAG;AACxB,UAAI,yCAAyC;AAC7C,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,SAAS,6BAA6B,OAAO,UAAU,OAAO,OAAO,OAAO,MAAM;AAGxF,UAAM,SAAS,OAAO,WAAW,SAAS,WAAW;AACrD,UAAM,eAAe,eAAe,OAAO,KAAK,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM,CAAC;AAClF,UAAM,QAAQ,SAAS;AACvB,UAAM,aAAc,QAAQ,SAAU,KAAK,QAAQ,CAAC;AAEpD,QAAI,0BAA0B,MAAM,WAAM,YAAY,YAAY,SAAS,cAAc;AACzF,QAAI,QAAQ,OAAO,KAAK,MAAM,IAAI,QAAQ,MAAM,UAAU;AAG1D,UAAM,SAAS,CAAC,GAAG,OAAO,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxE,UAAM,mBAAmB,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM;AAGjE,gBAAY,gBAAgB;AAAA,EAC9B,SAAS,OAAO;AAEd,QAAI,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAEzF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AACpD,gBAAY,KAAK;AAAA,EACnB;AACF;AAGA,KAAK;","names":["import_node_crypto","parseYAML"]}

package/dist/hooks/pre-prompt.js

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
 
 // src/hooks/pre-prompt.ts
-import { readFileSync } from "fs";
+import { appendFileSync, existsSync, readFileSync } from "fs";
 import { homedir } from "os";
 import { join } from "path";
 import { load as parseYAML } from "js-yaml";
@@ -237,6 +237,15 @@ function createEntry(content, type, baseTime) {
 }
 
 // src/hooks/pre-prompt.ts
+var DEBUG = process.env["SPARN_DEBUG"] === "true";
+var LOG_FILE = process.env["SPARN_LOG_FILE"] || join(homedir(), ".sparn-hook.log");
+function log(message) {
+  if (DEBUG) {
+    const timestamp = (/* @__PURE__ */ new Date()).toISOString();
+    appendFileSync(LOG_FILE, `[${timestamp}] [pre-prompt] ${message}
+`);
+  }
+}
 function exitSuccess(output) {
   process.stdout.write(output);
   process.exit(0);
@@ -249,31 +258,57 @@ async function main() {
     }
     const input = Buffer.concat(chunks).toString("utf-8");
     const tokens = estimateTokens(input);
-    const configPath = join(homedir(), ".sparn", "config.yaml");
+    log(`Input tokens: ${tokens}`);
+    const projectConfigPath = join(process.cwd(), ".sparn", "config.yaml");
+    const globalConfigPath = join(homedir(), ".sparn", "config.yaml");
     let config;
+    let configPath;
+    if (existsSync(projectConfigPath)) {
+      configPath = projectConfigPath;
+      log(`Using project config: ${configPath}`);
+    } else if (existsSync(globalConfigPath)) {
+      configPath = globalConfigPath;
+      log(`Using global config: ${configPath}`);
+    } else {
+      log("No config found, passing through");
+      exitSuccess(input);
+      return;
+    }
     try {
       const configYAML = readFileSync(configPath, "utf-8");
       config = parseYAML(configYAML);
-    } catch {
+    } catch (err) {
+      log(`Config parse error: ${err}`);
       exitSuccess(input);
       return;
     }
     const { autoOptimizeThreshold, tokenBudget } = config.realtime;
+    log(`Threshold: ${autoOptimizeThreshold}, Budget: ${tokenBudget}`);
     if (tokens < autoOptimizeThreshold) {
+      log(`Under threshold (${tokens} < ${autoOptimizeThreshold}), passing through`);
       exitSuccess(input);
       return;
     }
+    log(`Over threshold! Optimizing ${tokens} tokens to fit ${tokenBudget} budget`);
     const entries = parseClaudeCodeContext(input);
+    log(`Parsed ${entries.length} context entries`);
     if (entries.length === 0) {
+      log("No entries to optimize, passing through");
       exitSuccess(input);
       return;
     }
     const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);
     const result = pruner.pruneToFit(entries, tokenBudget);
+    const outputTokens = estimateTokens(result.kept.map((e) => e.content).join("\n\n"));
+    const saved = tokens - outputTokens;
+    const reduction = (saved / tokens * 100).toFixed(1);
+    log(`Optimization complete: ${tokens} \u2192 ${outputTokens} tokens (${reduction}% reduction)`);
+    log(`Kept ${result.kept.length}/${entries.length} entries`);
     const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);
     const optimizedContext = sorted.map((e) => e.content).join("\n\n");
     exitSuccess(optimizedContext);
-  } catch (_error) {
+  } catch (error) {
+    log(`Error in pre-prompt hook: ${error instanceof Error ? error.message : String(error)}`);
     const chunks = [];
     for await (const chunk of process.stdin) {
       chunks.push(chunk);

package/dist/hooks/pre-prompt.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/hooks/pre-prompt.ts","../../src/utils/tokenizer.ts","../../src/core/engram-scorer.ts","../../src/core/budget-pruner.ts","../../src/utils/context-parser.ts","../../src/utils/hash.ts"],"sourcesContent":["#!/usr/bin/env node\n/**\n * Pre-Prompt Hook - Claude Code hook for real-time context optimization\n *\n * Reads context from stdin, checks if tokens exceed threshold,\n * optimizes if needed, writes to stdout.\n *\n * CRITICAL: Always exits 0 (never disrupts Claude Code).\n * Falls through unmodified if under threshold or on error.\n */\n\nimport { readFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport { load as parseYAML } from 'js-yaml';\nimport { createBudgetPrunerFromConfig } from '../core/budget-pruner.js';\nimport type { SparnConfig } from '../types/config.js';\nimport { parseClaudeCodeContext } from '../utils/context-parser.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n// Exit 0 wrapper for all errors\nfunction exitSuccess(output: string): void {\n  process.stdout.write(output);\n  process.exit(0);\n}\n\n// Main hook logic\nasync function main(): Promise<void> {\n  try {\n    // Read stdin (context)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n\n    // Estimate tokens\n    const tokens = estimateTokens(input);\n\n    // Load config\n    const configPath = join(homedir(), '.sparn', 'config.yaml');\n    let config: SparnConfig;\n\n    try {\n      const configYAML = readFileSync(configPath, 'utf-8');\n      config = parseYAML(configYAML) as SparnConfig;\n    } catch {\n      // Config not found or invalid, fall through\n      exitSuccess(input);\n      return;\n    }\n\n    const { autoOptimizeThreshold, tokenBudget } = config.realtime;\n\n    // Check if optimization needed\n    if (tokens < autoOptimizeThreshold) {\n      // Under threshold, pass through unmodified\n      exitSuccess(input);\n      return;\n    }\n\n    // Parse context into entries\n    const entries = parseClaudeCodeContext(input);\n\n    if (entries.length === 0) {\n      // No entries to optimize, pass through\n      exitSuccess(input);\n      return;\n    }\n\n    // Create budget pruner\n    const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);\n\n    // Prune to fit budget\n    const result = pruner.pruneToFit(entries, tokenBudget);\n\n    // Build optimized context (chronologically ordered)\n    const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);\n    const optimizedContext = sorted.map((e) => e.content).join('\\n\\n');\n\n    // Output optimized context\n    exitSuccess(optimizedContext);\n  } catch (_error) {\n    // On any error, pass through original input\n    // Read stdin again if needed (shouldn't happen, but safety fallback)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n    exitSuccess(input);\n  }\n}\n\n// Run hook\nmain();\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 * 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 * Budget-Aware Pruner - Token budget optimization\n *\n * Unlike SparsePruner which keeps top N% entries, BudgetPruner fits entries\n * within a target token budget using priority scoring that combines:\n * - TF-IDF relevance\n * - Engram decay\n * - Confidence state multipliers\n * - BTSP bypass (always included)\n *\n * Target use case: Real-time optimization for Opus model (~50K token budget)\n */\n\nimport type { RealtimeConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport type { PruneResult } from '../types/pruner.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\nimport { createEngramScorer } from './engram-scorer.js';\n\nexport interface BudgetPrunerConfig {\n  /** Target token budget */\n  tokenBudget: number;\n  /** Decay configuration */\n  decay: {\n    defaultTTL: number;\n    decayThreshold: number;\n  };\n  /** State multipliers */\n  states: {\n    activeThreshold: number;\n    readyThreshold: number;\n  };\n}\n\nexport interface BudgetPruner {\n  /**\n   * Prune entries to fit within token budget\n   * @param entries - Memory entries to prune\n   * @param budget - Optional override budget (uses config default if not provided)\n   * @returns Result with kept/removed entries and budget utilization\n   */\n  pruneToFit(entries: MemoryEntry[], budget?: number): PruneResult & { budgetUtilization: number };\n\n  /**\n   * Calculate priority score for an entry\n   * @param entry - Entry to score\n   * @param allEntries - All entries for TF-IDF calculation\n   * @returns Priority score (higher = more important)\n   */\n  priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number;\n}\n\n/**\n * Create a budget-aware pruner instance\n * @param config - Pruner configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPruner(config: BudgetPrunerConfig): BudgetPruner {\n  const { tokenBudget, decay } = config;\n  const engramScorer = createEngramScorer(decay);\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 calculateTFIDF(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 getStateMultiplier(entry: MemoryEntry): number {\n    // BTSP entries get max priority (handled separately, but keep high multiplier)\n    if (entry.isBTSP) return 2.0;\n\n    // State-based multipliers\n    switch (entry.state) {\n      case 'active':\n        return 2.0;\n      case 'ready':\n        return 1.0;\n      case 'silent':\n        return 0.5;\n      default:\n        return 1.0;\n    }\n  }\n\n  function priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tfidf = calculateTFIDF(entry, allEntries);\n    const currentScore = engramScorer.calculateScore(entry);\n    const engramDecay = 1 - currentScore; // Lower decay = higher priority\n    const stateMultiplier = getStateMultiplier(entry);\n\n    // Priority = TF-IDF * (1 - decay) * state_multiplier\n    // This balances relevance, recency, and confidence state\n    return tfidf * (1 - engramDecay) * stateMultiplier;\n  }\n\n  function pruneToFit(\n    entries: MemoryEntry[],\n    budget: number = tokenBudget,\n  ): PruneResult & { budgetUtilization: number } {\n    if (entries.length === 0) {\n      return {\n        kept: [],\n        removed: [],\n        originalTokens: 0,\n        prunedTokens: 0,\n        budgetUtilization: 0,\n      };\n    }\n\n    // Calculate original token count\n    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 1: Separate BTSP entries (always included, bypass budget)\n    const btspEntries = entries.filter((e) => e.isBTSP);\n    const regularEntries = entries.filter((e) => !e.isBTSP);\n\n    const btspTokens = btspEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 2: Score regular entries\n    const scored = regularEntries.map((entry) => ({\n      entry,\n      score: priorityScore(entry, entries),\n      tokens: estimateTokens(entry.content),\n    }));\n\n    // Step 3: Sort by priority score descending\n    scored.sort((a, b) => b.score - a.score);\n\n    // Step 4: Greedy fill until budget exceeded\n    const kept: MemoryEntry[] = [...btspEntries];\n    const removed: MemoryEntry[] = [];\n    let currentTokens = btspTokens;\n\n    for (const item of scored) {\n      if (currentTokens + item.tokens <= budget) {\n        kept.push(item.entry);\n        currentTokens += item.tokens;\n      } else {\n        removed.push(item.entry);\n      }\n    }\n\n    const budgetUtilization = budget > 0 ? currentTokens / budget : 0;\n\n    return {\n      kept,\n      removed,\n      originalTokens,\n      prunedTokens: currentTokens,\n      budgetUtilization,\n    };\n  }\n\n  return {\n    pruneToFit,\n    priorityScore,\n  };\n}\n\n/**\n * Helper to create budget pruner from RealtimeConfig\n * @param realtimeConfig - Realtime configuration\n * @param decayConfig - Decay configuration\n * @param statesConfig - States configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPrunerFromConfig(\n  realtimeConfig: RealtimeConfig,\n  decayConfig: { defaultTTL: number; decayThreshold: number },\n  statesConfig: { activeThreshold: number; readyThreshold: number },\n): BudgetPruner {\n  return createBudgetPruner({\n    tokenBudget: realtimeConfig.tokenBudget,\n    decay: decayConfig,\n    states: statesConfig,\n  });\n}\n","/**\n * Context Parser - Shared utilities for parsing agent contexts into memory entries\n *\n * Extracted from claude-code adapter to enable reuse across:\n * - Adapters (claude-code, generic)\n * - Real-time pipeline (streaming context)\n * - Hooks (pre-prompt, post-tool-result)\n */\n\nimport { randomUUID } from 'node:crypto';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from './hash.js';\n\n/**\n * Block type classification for Claude Code context\n */\nexport type BlockType = 'conversation' | 'tool' | 'result' | 'other';\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 */\nexport function 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: BlockType = '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 */\nexport function createEntry(content: string, type: BlockType, baseTime: number): 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/**\n * Parse generic context (fallback for non-Claude-Code agents)\n * Splits on double newlines, treats as paragraphs\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nexport function parseGenericContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split on double newlines (paragraph boundaries)\n  const blocks = context.split(/\\n\\n+/);\n\n  for (const block of blocks) {\n    const trimmed = block.trim();\n    if (trimmed.length === 0) continue;\n\n    entries.push(createEntry(trimmed, 'other', now));\n  }\n\n  return entries;\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"],"mappings":";;;AAWA,SAAS,oBAAoB;AAC7B,SAAS,eAAe;AACxB,SAAS,YAAY;AACrB,SAAS,QAAQ,iBAAiB;;;ACM3B,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;;;ACWO,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;;;AC7CO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,aAAa,MAAM,IAAI;AAC/B,QAAM,eAAe,mBAAmB,KAAK;AAE7C,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,eAAe,OAAoB,YAAmC;AAC7E,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,mBAAmB,OAA4B;AAEtD,QAAI,MAAM,OAAQ,QAAO;AAGzB,YAAQ,MAAM,OAAO;AAAA,MACnB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAEA,WAAS,cAAc,OAAoB,YAAmC;AAC5E,UAAM,QAAQ,eAAe,OAAO,UAAU;AAC9C,UAAM,eAAe,aAAa,eAAe,KAAK;AACtD,UAAM,cAAc,IAAI;AACxB,UAAM,kBAAkB,mBAAmB,KAAK;AAIhD,WAAO,SAAS,IAAI,eAAe;AAAA,EACrC;AAEA,WAAS,WACP,SACA,SAAiB,aAC4B;AAC7C,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,SAAS,CAAC;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,mBAAmB;AAAA,MACrB;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,MAAM;AAClD,UAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM;AAEtD,UAAM,aAAa,YAAY,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,SAAS,eAAe,IAAI,CAAC,WAAW;AAAA,MAC5C;AAAA,MACA,OAAO,cAAc,OAAO,OAAO;AAAA,MACnC,QAAQ,eAAe,MAAM,OAAO;AAAA,IACtC,EAAE;AAGF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGvC,UAAM,OAAsB,CAAC,GAAG,WAAW;AAC3C,UAAM,UAAyB,CAAC;AAChC,QAAI,gBAAgB;AAEpB,eAAW,QAAQ,QAAQ;AACzB,UAAI,gBAAgB,KAAK,UAAU,QAAQ;AACzC,aAAK,KAAK,KAAK,KAAK;AACpB,yBAAiB,KAAK;AAAA,MACxB,OAAO;AACL,gBAAQ,KAAK,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,oBAAoB,SAAS,IAAI,gBAAgB,SAAS;AAEhE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,6BACd,gBACA,aACA,cACc;AACd,SAAO,mBAAmB;AAAA,IACxB,aAAa,eAAe;AAAA,IAC5B,OAAO;AAAA,IACP,QAAQ;AAAA,EACV,CAAC;AACH;;;AC3MA,SAAS,kBAAkB;;;ACJ3B,SAAS,kBAAkB;AAcpB,SAAS,YAAY,SAAyB;AACnD,SAAO,WAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;;;ADGO,SAAS,uBAAuB,SAAgC;AACrE,QAAM,UAAyB,CAAC;AAChC,QAAM,MAAM,KAAK,IAAI;AAGrB,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,eAAyB,CAAC;AAC9B,MAAI,YAAuB;AAE3B,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;AASO,SAAS,YAAY,SAAiB,MAAiB,UAA+B;AAC3F,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,IAAI,WAAW;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;;;AJ9FA,SAAS,YAAY,QAAsB;AACzC,UAAQ,OAAO,MAAM,MAAM;AAC3B,UAAQ,KAAK,CAAC;AAChB;AAGA,eAAe,OAAsB;AACnC,MAAI;AAEF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAGpD,UAAM,SAAS,eAAe,KAAK;AAGnC,UAAM,aAAa,KAAK,QAAQ,GAAG,UAAU,aAAa;AAC1D,QAAI;AAEJ,QAAI;AACF,YAAM,aAAa,aAAa,YAAY,OAAO;AACnD,eAAS,UAAU,UAAU;AAAA,IAC/B,QAAQ;AAEN,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,UAAM,EAAE,uBAAuB,YAAY,IAAI,OAAO;AAGtD,QAAI,SAAS,uBAAuB;AAElC,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,UAAU,uBAAuB,KAAK;AAE5C,QAAI,QAAQ,WAAW,GAAG;AAExB,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,SAAS,6BAA6B,OAAO,UAAU,OAAO,OAAO,OAAO,MAAM;AAGxF,UAAM,SAAS,OAAO,WAAW,SAAS,WAAW;AAGrD,UAAM,SAAS,CAAC,GAAG,OAAO,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxE,UAAM,mBAAmB,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM;AAGjE,gBAAY,gBAAgB;AAAA,EAC9B,SAAS,QAAQ;AAGf,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AACpD,gBAAY,KAAK;AAAA,EACnB;AACF;AAGA,KAAK;","names":[]}
+{"version":3,"sources":["../../src/hooks/pre-prompt.ts","../../src/utils/tokenizer.ts","../../src/core/engram-scorer.ts","../../src/core/budget-pruner.ts","../../src/utils/context-parser.ts","../../src/utils/hash.ts"],"sourcesContent":["#!/usr/bin/env node\n/**\n * Pre-Prompt Hook - Claude Code hook for real-time context optimization\n *\n * Reads context from stdin, checks if tokens exceed threshold,\n * optimizes if needed, writes to stdout.\n *\n * CRITICAL: Always exits 0 (never disrupts Claude Code).\n * Falls through unmodified if under threshold or on error.\n */\n\nimport { appendFileSync, existsSync, readFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport { load as parseYAML } from 'js-yaml';\nimport { createBudgetPrunerFromConfig } from '../core/budget-pruner.js';\nimport type { SparnConfig } from '../types/config.js';\nimport { parseClaudeCodeContext } from '../utils/context-parser.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n// Debug logging (optional, set via env var)\nconst DEBUG = process.env['SPARN_DEBUG'] === 'true';\nconst LOG_FILE = process.env['SPARN_LOG_FILE'] || join(homedir(), '.sparn-hook.log');\n\nfunction log(message: string): void {\n  if (DEBUG) {\n    const timestamp = new Date().toISOString();\n    appendFileSync(LOG_FILE, `[${timestamp}] [pre-prompt] ${message}\\n`);\n  }\n}\n\n// Exit 0 wrapper for all errors\nfunction exitSuccess(output: string): void {\n  process.stdout.write(output);\n  process.exit(0);\n}\n\n// Main hook logic\nasync function main(): Promise<void> {\n  try {\n    // Read stdin (context)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n\n    // Estimate tokens\n    const tokens = estimateTokens(input);\n    log(`Input tokens: ${tokens}`);\n\n    // Load config (check project dir first, then global)\n    const projectConfigPath = join(process.cwd(), '.sparn', 'config.yaml');\n    const globalConfigPath = join(homedir(), '.sparn', 'config.yaml');\n    let config: SparnConfig;\n    let configPath: string;\n\n    if (existsSync(projectConfigPath)) {\n      configPath = projectConfigPath;\n      log(`Using project config: ${configPath}`);\n    } else if (existsSync(globalConfigPath)) {\n      configPath = globalConfigPath;\n      log(`Using global config: ${configPath}`);\n    } else {\n      log('No config found, passing through');\n      exitSuccess(input);\n      return;\n    }\n\n    try {\n      const configYAML = readFileSync(configPath, 'utf-8');\n      config = parseYAML(configYAML) as SparnConfig;\n    } catch (err) {\n      log(`Config parse error: ${err}`);\n      exitSuccess(input);\n      return;\n    }\n\n    const { autoOptimizeThreshold, tokenBudget } = config.realtime;\n    log(`Threshold: ${autoOptimizeThreshold}, Budget: ${tokenBudget}`);\n\n    // Check if optimization needed\n    if (tokens < autoOptimizeThreshold) {\n      log(`Under threshold (${tokens} < ${autoOptimizeThreshold}), passing through`);\n      exitSuccess(input);\n      return;\n    }\n\n    log(`Over threshold! Optimizing ${tokens} tokens to fit ${tokenBudget} budget`);\n\n    // Parse context into entries\n    const entries = parseClaudeCodeContext(input);\n    log(`Parsed ${entries.length} context entries`);\n\n    if (entries.length === 0) {\n      log('No entries to optimize, passing through');\n      exitSuccess(input);\n      return;\n    }\n\n    // Create budget pruner\n    const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);\n\n    // Prune to fit budget\n    const result = pruner.pruneToFit(entries, tokenBudget);\n    const outputTokens = estimateTokens(result.kept.map((e) => e.content).join('\\n\\n'));\n    const saved = tokens - outputTokens;\n    const reduction = ((saved / tokens) * 100).toFixed(1);\n\n    log(`Optimization complete: ${tokens} → ${outputTokens} tokens (${reduction}% reduction)`);\n    log(`Kept ${result.kept.length}/${entries.length} entries`);\n\n    // Build optimized context (chronologically ordered)\n    const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);\n    const optimizedContext = sorted.map((e) => e.content).join('\\n\\n');\n\n    // Output optimized context\n    exitSuccess(optimizedContext);\n  } catch (error) {\n    // On any error, pass through original input\n    log(`Error in pre-prompt hook: ${error instanceof Error ? error.message : String(error)}`);\n    // Read stdin again if needed (shouldn't happen, but safety fallback)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n    exitSuccess(input);\n  }\n}\n\n// Run hook\nmain();\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 * 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 * Budget-Aware Pruner - Token budget optimization\n *\n * Unlike SparsePruner which keeps top N% entries, BudgetPruner fits entries\n * within a target token budget using priority scoring that combines:\n * - TF-IDF relevance\n * - Engram decay\n * - Confidence state multipliers\n * - BTSP bypass (always included)\n *\n * Target use case: Real-time optimization for Opus model (~50K token budget)\n */\n\nimport type { RealtimeConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport type { PruneResult } from '../types/pruner.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\nimport { createEngramScorer } from './engram-scorer.js';\n\nexport interface BudgetPrunerConfig {\n  /** Target token budget */\n  tokenBudget: number;\n  /** Decay configuration */\n  decay: {\n    defaultTTL: number;\n    decayThreshold: number;\n  };\n  /** State multipliers */\n  states: {\n    activeThreshold: number;\n    readyThreshold: number;\n  };\n}\n\nexport interface BudgetPruner {\n  /**\n   * Prune entries to fit within token budget\n   * @param entries - Memory entries to prune\n   * @param budget - Optional override budget (uses config default if not provided)\n   * @returns Result with kept/removed entries and budget utilization\n   */\n  pruneToFit(entries: MemoryEntry[], budget?: number): PruneResult & { budgetUtilization: number };\n\n  /**\n   * Calculate priority score for an entry\n   * @param entry - Entry to score\n   * @param allEntries - All entries for TF-IDF calculation\n   * @returns Priority score (higher = more important)\n   */\n  priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number;\n}\n\n/**\n * Create a budget-aware pruner instance\n * @param config - Pruner configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPruner(config: BudgetPrunerConfig): BudgetPruner {\n  const { tokenBudget, decay } = config;\n  const engramScorer = createEngramScorer(decay);\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 calculateTFIDF(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 getStateMultiplier(entry: MemoryEntry): number {\n    // BTSP entries get max priority (handled separately, but keep high multiplier)\n    if (entry.isBTSP) return 2.0;\n\n    // State-based multipliers\n    switch (entry.state) {\n      case 'active':\n        return 2.0;\n      case 'ready':\n        return 1.0;\n      case 'silent':\n        return 0.5;\n      default:\n        return 1.0;\n    }\n  }\n\n  function priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tfidf = calculateTFIDF(entry, allEntries);\n    const currentScore = engramScorer.calculateScore(entry);\n    const engramDecay = 1 - currentScore; // Lower decay = higher priority\n    const stateMultiplier = getStateMultiplier(entry);\n\n    // Priority = TF-IDF * (1 - decay) * state_multiplier\n    // This balances relevance, recency, and confidence state\n    return tfidf * (1 - engramDecay) * stateMultiplier;\n  }\n\n  function pruneToFit(\n    entries: MemoryEntry[],\n    budget: number = tokenBudget,\n  ): PruneResult & { budgetUtilization: number } {\n    if (entries.length === 0) {\n      return {\n        kept: [],\n        removed: [],\n        originalTokens: 0,\n        prunedTokens: 0,\n        budgetUtilization: 0,\n      };\n    }\n\n    // Calculate original token count\n    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 1: Separate BTSP entries (always included, bypass budget)\n    const btspEntries = entries.filter((e) => e.isBTSP);\n    const regularEntries = entries.filter((e) => !e.isBTSP);\n\n    const btspTokens = btspEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 2: Score regular entries\n    const scored = regularEntries.map((entry) => ({\n      entry,\n      score: priorityScore(entry, entries),\n      tokens: estimateTokens(entry.content),\n    }));\n\n    // Step 3: Sort by priority score descending\n    scored.sort((a, b) => b.score - a.score);\n\n    // Step 4: Greedy fill until budget exceeded\n    const kept: MemoryEntry[] = [...btspEntries];\n    const removed: MemoryEntry[] = [];\n    let currentTokens = btspTokens;\n\n    for (const item of scored) {\n      if (currentTokens + item.tokens <= budget) {\n        kept.push(item.entry);\n        currentTokens += item.tokens;\n      } else {\n        removed.push(item.entry);\n      }\n    }\n\n    const budgetUtilization = budget > 0 ? currentTokens / budget : 0;\n\n    return {\n      kept,\n      removed,\n      originalTokens,\n      prunedTokens: currentTokens,\n      budgetUtilization,\n    };\n  }\n\n  return {\n    pruneToFit,\n    priorityScore,\n  };\n}\n\n/**\n * Helper to create budget pruner from RealtimeConfig\n * @param realtimeConfig - Realtime configuration\n * @param decayConfig - Decay configuration\n * @param statesConfig - States configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPrunerFromConfig(\n  realtimeConfig: RealtimeConfig,\n  decayConfig: { defaultTTL: number; decayThreshold: number },\n  statesConfig: { activeThreshold: number; readyThreshold: number },\n): BudgetPruner {\n  return createBudgetPruner({\n    tokenBudget: realtimeConfig.tokenBudget,\n    decay: decayConfig,\n    states: statesConfig,\n  });\n}\n","/**\n * Context Parser - Shared utilities for parsing agent contexts into memory entries\n *\n * Extracted from claude-code adapter to enable reuse across:\n * - Adapters (claude-code, generic)\n * - Real-time pipeline (streaming context)\n * - Hooks (pre-prompt, post-tool-result)\n */\n\nimport { randomUUID } from 'node:crypto';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from './hash.js';\n\n/**\n * Block type classification for Claude Code context\n */\nexport type BlockType = 'conversation' | 'tool' | 'result' | 'other';\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 */\nexport function 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: BlockType = '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 */\nexport function createEntry(content: string, type: BlockType, baseTime: number): 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/**\n * Parse generic context (fallback for non-Claude-Code agents)\n * Splits on double newlines, treats as paragraphs\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nexport function parseGenericContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split on double newlines (paragraph boundaries)\n  const blocks = context.split(/\\n\\n+/);\n\n  for (const block of blocks) {\n    const trimmed = block.trim();\n    if (trimmed.length === 0) continue;\n\n    entries.push(createEntry(trimmed, 'other', now));\n  }\n\n  return entries;\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"],"mappings":";;;AAWA,SAAS,gBAAgB,YAAY,oBAAoB;AACzD,SAAS,eAAe;AACxB,SAAS,YAAY;AACrB,SAAS,QAAQ,iBAAiB;;;ACM3B,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;;;ACWO,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;;;AC7CO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,aAAa,MAAM,IAAI;AAC/B,QAAM,eAAe,mBAAmB,KAAK;AAE7C,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,eAAe,OAAoB,YAAmC;AAC7E,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,mBAAmB,OAA4B;AAEtD,QAAI,MAAM,OAAQ,QAAO;AAGzB,YAAQ,MAAM,OAAO;AAAA,MACnB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAEA,WAAS,cAAc,OAAoB,YAAmC;AAC5E,UAAM,QAAQ,eAAe,OAAO,UAAU;AAC9C,UAAM,eAAe,aAAa,eAAe,KAAK;AACtD,UAAM,cAAc,IAAI;AACxB,UAAM,kBAAkB,mBAAmB,KAAK;AAIhD,WAAO,SAAS,IAAI,eAAe;AAAA,EACrC;AAEA,WAAS,WACP,SACA,SAAiB,aAC4B;AAC7C,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,SAAS,CAAC;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,mBAAmB;AAAA,MACrB;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,MAAM;AAClD,UAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM;AAEtD,UAAM,aAAa,YAAY,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,SAAS,eAAe,IAAI,CAAC,WAAW;AAAA,MAC5C;AAAA,MACA,OAAO,cAAc,OAAO,OAAO;AAAA,MACnC,QAAQ,eAAe,MAAM,OAAO;AAAA,IACtC,EAAE;AAGF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGvC,UAAM,OAAsB,CAAC,GAAG,WAAW;AAC3C,UAAM,UAAyB,CAAC;AAChC,QAAI,gBAAgB;AAEpB,eAAW,QAAQ,QAAQ;AACzB,UAAI,gBAAgB,KAAK,UAAU,QAAQ;AACzC,aAAK,KAAK,KAAK,KAAK;AACpB,yBAAiB,KAAK;AAAA,MACxB,OAAO;AACL,gBAAQ,KAAK,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,oBAAoB,SAAS,IAAI,gBAAgB,SAAS;AAEhE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,6BACd,gBACA,aACA,cACc;AACd,SAAO,mBAAmB;AAAA,IACxB,aAAa,eAAe;AAAA,IAC5B,OAAO;AAAA,IACP,QAAQ;AAAA,EACV,CAAC;AACH;;;AC3MA,SAAS,kBAAkB;;;ACJ3B,SAAS,kBAAkB;AAcpB,SAAS,YAAY,SAAyB;AACnD,SAAO,WAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;;;ADGO,SAAS,uBAAuB,SAAgC;AACrE,QAAM,UAAyB,CAAC;AAChC,QAAM,MAAM,KAAK,IAAI;AAGrB,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,eAAyB,CAAC;AAC9B,MAAI,YAAuB;AAE3B,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;AASO,SAAS,YAAY,SAAiB,MAAiB,UAA+B;AAC3F,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,IAAI,WAAW;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;;;AJ9FA,IAAM,QAAQ,QAAQ,IAAI,aAAa,MAAM;AAC7C,IAAM,WAAW,QAAQ,IAAI,gBAAgB,KAAK,KAAK,QAAQ,GAAG,iBAAiB;AAEnF,SAAS,IAAI,SAAuB;AAClC,MAAI,OAAO;AACT,UAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,mBAAe,UAAU,IAAI,SAAS,kBAAkB,OAAO;AAAA,CAAI;AAAA,EACrE;AACF;AAGA,SAAS,YAAY,QAAsB;AACzC,UAAQ,OAAO,MAAM,MAAM;AAC3B,UAAQ,KAAK,CAAC;AAChB;AAGA,eAAe,OAAsB;AACnC,MAAI;AAEF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAGpD,UAAM,SAAS,eAAe,KAAK;AACnC,QAAI,iBAAiB,MAAM,EAAE;AAG7B,UAAM,oBAAoB,KAAK,QAAQ,IAAI,GAAG,UAAU,aAAa;AACrE,UAAM,mBAAmB,KAAK,QAAQ,GAAG,UAAU,aAAa;AAChE,QAAI;AACJ,QAAI;AAEJ,QAAI,WAAW,iBAAiB,GAAG;AACjC,mBAAa;AACb,UAAI,yBAAyB,UAAU,EAAE;AAAA,IAC3C,WAAW,WAAW,gBAAgB,GAAG;AACvC,mBAAa;AACb,UAAI,wBAAwB,UAAU,EAAE;AAAA,IAC1C,OAAO;AACL,UAAI,kCAAkC;AACtC,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,QAAI;AACF,YAAM,aAAa,aAAa,YAAY,OAAO;AACnD,eAAS,UAAU,UAAU;AAAA,IAC/B,SAAS,KAAK;AACZ,UAAI,uBAAuB,GAAG,EAAE;AAChC,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,UAAM,EAAE,uBAAuB,YAAY,IAAI,OAAO;AACtD,QAAI,cAAc,qBAAqB,aAAa,WAAW,EAAE;AAGjE,QAAI,SAAS,uBAAuB;AAClC,UAAI,oBAAoB,MAAM,MAAM,qBAAqB,oBAAoB;AAC7E,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,QAAI,8BAA8B,MAAM,kBAAkB,WAAW,SAAS;AAG9E,UAAM,UAAU,uBAAuB,KAAK;AAC5C,QAAI,UAAU,QAAQ,MAAM,kBAAkB;AAE9C,QAAI,QAAQ,WAAW,GAAG;AACxB,UAAI,yCAAyC;AAC7C,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,SAAS,6BAA6B,OAAO,UAAU,OAAO,OAAO,OAAO,MAAM;AAGxF,UAAM,SAAS,OAAO,WAAW,SAAS,WAAW;AACrD,UAAM,eAAe,eAAe,OAAO,KAAK,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM,CAAC;AAClF,UAAM,QAAQ,SAAS;AACvB,UAAM,aAAc,QAAQ,SAAU,KAAK,QAAQ,CAAC;AAEpD,QAAI,0BAA0B,MAAM,WAAM,YAAY,YAAY,SAAS,cAAc;AACzF,QAAI,QAAQ,OAAO,KAAK,MAAM,IAAI,QAAQ,MAAM,UAAU;AAG1D,UAAM,SAAS,CAAC,GAAG,OAAO,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxE,UAAM,mBAAmB,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM;AAGjE,gBAAY,gBAAgB;AAAA,EAC9B,SAAS,OAAO;AAEd,QAAI,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAEzF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AACpD,gBAAY,KAAK;AAAA,EACnB;AACF;AAGA,KAAK;","names":[]}

package/dist/index.cjs

@@ -1795,8 +1795,8 @@ var DEFAULT_CONFIG = {
   },
   autoConsolidate: null,
   realtime: {
-    tokenBudget: 5e4,
-    autoOptimizeThreshold: 8e4,
+    tokenBudget: 4e4,
+    autoOptimizeThreshold: 6e4,
     watchPatterns: ["**/*.jsonl"],
     pidFile: ".sparn/daemon.pid",
     logFile: ".sparn/daemon.log",