@weavelogic/knowledge-graph-agent 0.6.0 → 0.7.0

package/dist/cli/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../src/cli/index.ts"],"sourcesContent":["/**\n * Knowledge Graph Agent CLI\n *\n * Main CLI setup and command registration.\n */\n\nimport { Command } from 'commander';\nimport chalk from 'chalk';\nimport { createInitCommand } from './commands/init.js';\nimport { createGraphCommand } from './commands/graph.js';\nimport { createDocsCommand } from './commands/docs.js';\nimport { createClaudeCommand } from './commands/claude.js';\nimport { createSyncCommand } from './commands/sync.js';\nimport { createStatsCommand } from './commands/stats.js';\nimport { createSearchCommand } from './commands/search.js';\nimport { createConvertCommand, createFrontmatterCommand } from './commands/convert.js';\nimport { createAnalyzeCommand } from './commands/analyze.js';\nimport { createSOPCommands } from './commands/sop.js';\nimport { createInitPrimitivesCommand, createAnalyzeCodebaseCommand } from './commands/init-primitives.js';\nimport { createCultivateCommand } from './commands/cultivate.js';\nimport { createCommitCommand } from './commands/commit.js';\nimport { createConfigCommand } from './commands/config.js';\nimport { createDiagnosticsCommand } from './commands/diagnostics.js';\nimport { createWorkflowCommand } from './commands/workflow.js';\nimport { createAuditCommand } from './commands/audit.js';\nimport { createVectorCommand } from './commands/vector.js';\nimport { createServeCommand } from './commands/serve.js';\nimport { createDashboardCommand } from './commands/dashboard.js';\nimport { createPluginCommand } from './commands/plugin.js';\n\n/**\n * CLI version\n */\nconst VERSION = '0.4.0';\n\n/**\n * Create and configure the CLI program\n */\nexport function createCLI(): Command {\n  const program = new Command();\n\n  program\n    .name('kg')\n    .description('Knowledge Graph Agent - Generate and manage knowledge graphs for Claude Code')\n    .version(VERSION, '-v, --version', 'Display version number');\n\n  // Configure help\n  program.configureHelp({\n    sortSubcommands: true,\n    sortOptions: true,\n  });\n\n  // Add commands\n  program.addCommand(createInitCommand());\n  program.addCommand(createGraphCommand());\n  program.addCommand(createDocsCommand());\n  program.addCommand(createClaudeCommand());\n  program.addCommand(createSyncCommand());\n  program.addCommand(createStatsCommand());\n  program.addCommand(createSearchCommand());\n  program.addCommand(createConvertCommand());\n  program.addCommand(createFrontmatterCommand());\n  program.addCommand(createAnalyzeCommand());\n  program.addCommand(createSOPCommands());\n  program.addCommand(createInitPrimitivesCommand());\n  program.addCommand(createAnalyzeCodebaseCommand());\n  program.addCommand(createCultivateCommand());\n  program.addCommand(createCommitCommand());\n  program.addCommand(createConfigCommand());\n  program.addCommand(createDiagnosticsCommand());\n  program.addCommand(createWorkflowCommand());\n  program.addCommand(createAuditCommand());\n  program.addCommand(createVectorCommand());\n  program.addCommand(createServeCommand());\n  program.addCommand(createDashboardCommand());\n  program.addCommand(createPluginCommand());\n\n  // Default action (show help)\n  program.action(() => {\n    console.log(chalk.cyan.bold('\\n  Knowledge Graph Agent\\n'));\n    console.log(chalk.gray('  Generate and manage knowledge graphs for Claude Code\\n'));\n\n    console.log(chalk.white('  Quick Start:'));\n    console.log(chalk.gray('    $ kg init                  # Initialize knowledge graph'));\n    console.log(chalk.gray('    $ kg docs init             # Initialize docs directory'));\n    console.log(chalk.gray('    $ kg graph                 # Generate knowledge graph'));\n    console.log(chalk.gray('    $ kg claude update         # Update CLAUDE.md'));\n    console.log(chalk.gray('    $ kg sync                  # Sync with claude-flow\\n'));\n\n    console.log(chalk.white('  Migration & Analysis:'));\n    console.log(chalk.gray('    $ kg analyze               # Analyze & migrate to knowledge graph'));\n    console.log(chalk.gray('    $ kg analyze deep          # Deep analysis with claude-flow'));\n    console.log(chalk.gray('    $ kg analyze report        # Generate analysis report'));\n    console.log(chalk.gray('    $ kg convert docs          # Convert docs/ → docs-nn/'));\n    console.log(chalk.gray('    $ kg frontmatter add       # Add frontmatter to files'));\n    console.log(chalk.gray('    $ kg frontmatter validate  # Validate frontmatter\\n'));\n\n    console.log(chalk.white('  AI-SDLC SOP Compliance:'));\n    console.log(chalk.gray('    $ kg sop init              # Initialize SOP standards layer'));\n    console.log(chalk.gray('    $ kg sop check             # Check compliance against SOPs'));\n    console.log(chalk.gray('    $ kg sop gaps              # Analyze compliance gaps'));\n    console.log(chalk.gray('    $ kg sop report            # Generate compliance report'));\n    console.log(chalk.gray('    $ kg sop list              # List available SOPs\\n'));\n\n    console.log(chalk.white('  Cultivation & Primitives:'));\n    console.log(chalk.gray('    $ kg init-primitives       # Bootstrap primitives from codebase'));\n    console.log(chalk.gray('    $ kg analyze-codebase      # Analyze dependencies & services'));\n    console.log(chalk.gray('    $ kg init-primitives --dry-run  # Preview without writing\\n'));\n\n    console.log(chalk.white('  Git Integration:'));\n    console.log(chalk.gray('    $ kg commit                # Show status and suggested message'));\n    console.log(chalk.gray('    $ kg commit -a             # Auto-commit with generated message'));\n    console.log(chalk.gray('    $ kg commit -i             # Interactive commit mode'));\n    console.log(chalk.gray('    $ kg commit -m \"message\"   # Commit with custom message'));\n    console.log(chalk.gray('    $ kg commit status         # Show git status with analysis'));\n    console.log(chalk.gray('    $ kg commit log            # Show recent commits'));\n    console.log(chalk.gray('    $ kg commit diff           # Show diff of changes\\n'));\n\n    console.log(chalk.white('  Diagnostics & Health:'));\n    console.log(chalk.gray('    $ kg diag run              # Run full diagnostics'));\n    console.log(chalk.gray('    $ kg diag run --fix        # Attempt to fix issues'));\n    console.log(chalk.gray('    $ kg diag health           # Check system health'));\n    console.log(chalk.gray('    $ kg diag repair           # Repair database issues'));\n    console.log(chalk.gray('    $ kg diag backup           # Create database backup'));\n    console.log(chalk.gray('    $ kg diag backup --list    # List existing backups'));\n    console.log(chalk.gray('    $ kg diag info             # Show system information\\n'));\n\n    console.log(chalk.white('  Workflow Management:'));\n    console.log(chalk.gray('    $ kg workflow start <type> # Start a workflow'));\n    console.log(chalk.gray('    $ kg workflow status [id]  # Check workflow status'));\n    console.log(chalk.gray('    $ kg workflow list         # List active workflows'));\n    console.log(chalk.gray('    $ kg workflow stop <id>    # Stop a workflow'));\n    console.log(chalk.gray('    $ kg workflow history      # Show workflow history\\n'));\n\n    console.log(chalk.white('  Vector Operations:'));\n    console.log(chalk.gray('    $ kg vector search <query> # Semantic search'));\n    console.log(chalk.gray('    $ kg vector stats          # Vector store statistics'));\n    console.log(chalk.gray('    $ kg vector rebuild        # Rebuild vector index'));\n    console.log(chalk.gray('    $ kg vector traj list      # List trajectories'));\n    console.log(chalk.gray('    $ kg vector traj show <id> # Show trajectory details'));\n    console.log(chalk.gray('    $ kg vector traj patterns  # Show detected patterns\\n'));\n\n    console.log(chalk.white('  Audit & Exochain:'));\n    console.log(chalk.gray('    $ kg audit query           # Query the audit log'));\n    console.log(chalk.gray('    $ kg audit checkpoint      # Create a checkpoint'));\n    console.log(chalk.gray('    $ kg audit verify          # Verify chain integrity'));\n    console.log(chalk.gray('    $ kg audit sync status     # Check sync status'));\n    console.log(chalk.gray('    $ kg audit sync peers      # List sync peers'));\n    console.log(chalk.gray('    $ kg audit export          # Export audit log\\n'));\n\n    console.log(chalk.white('  Server Mode:'));\n    console.log(chalk.gray('    $ kg serve                 # Start MCP server (stdio)'));\n    console.log(chalk.gray('    $ kg serve --graphql       # Start GraphQL server'));\n    console.log(chalk.gray('    $ kg serve --dashboard     # Start web dashboard'));\n    console.log(chalk.gray('    $ kg serve --all           # Start all servers'));\n    console.log(chalk.gray('    $ kg serve status          # Show server status\\n'));\n\n    console.log(chalk.white('  Dashboard:'));\n    console.log(chalk.gray('    $ kg dashboard start       # Start dashboard dev server'));\n    console.log(chalk.gray('    $ kg dashboard build       # Build dashboard for production'));\n    console.log(chalk.gray('    $ kg dashboard serve       # Serve built dashboard'));\n    console.log(chalk.gray('    $ kg dashboard open        # Open dashboard in browser'));\n    console.log(chalk.gray('    $ kg dashboard status      # Check dashboard status\\n'));\n\n    console.log(chalk.white('  Plugin Management:'));\n    console.log(chalk.gray('    $ kg plugin list           # List installed plugins'));\n    console.log(chalk.gray('    $ kg plugin install <pkg>  # Install a plugin'));\n    console.log(chalk.gray('    $ kg plugin uninstall <n>  # Uninstall a plugin'));\n    console.log(chalk.gray('    $ kg plugin enable <name>  # Enable a plugin'));\n    console.log(chalk.gray('    $ kg plugin disable <name> # Disable a plugin'));\n    console.log(chalk.gray('    $ kg plugin info <name>    # Show plugin details'));\n    console.log(chalk.gray('    $ kg plugin run <n> <file> # Run analyzer plugin'));\n    console.log(chalk.gray('    $ kg plugin create <name>  # Create new plugin\\n'));\n\n    console.log(chalk.white('  Commands:'));\n    program.commands.forEach(cmd => {\n      console.log(chalk.cyan(`    ${cmd.name().padEnd(20)}`), chalk.gray(cmd.description() || ''));\n    });\n\n    console.log('\\n  Run', chalk.cyan('kg <command> --help'), 'for more information\\n');\n  });\n\n  return program;\n}\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAiCA,MAAM,UAAU;AAKT,SAAS,YAAqB;AACnC,QAAM,UAAU,IAAI,QAAA;AAEpB,UACG,KAAK,IAAI,EACT,YAAY,8EAA8E,EAC1F,QAAQ,SAAS,iBAAiB,wBAAwB;AAG7D,UAAQ,cAAc;AAAA,IACpB,iBAAiB;AAAA,IACjB,aAAa;AAAA,EAAA,CACd;AAGD,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,sBAAsB;AACzC,UAAQ,WAAW,0BAA0B;AAC7C,UAAQ,WAAW,sBAAsB;AACzC,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,6BAA6B;AAChD,UAAQ,WAAW,8BAA8B;AACjD,UAAQ,WAAW,wBAAwB;AAC3C,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,0BAA0B;AAC7C,UAAQ,WAAW,uBAAuB;AAC1C,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,wBAAwB;AAC3C,UAAQ,WAAW,qBAAqB;AAGxC,UAAQ,OAAO,MAAM;AACnB,YAAQ,IAAI,MAAM,KAAK,KAAK,6BAA6B,CAAC;AAC1D,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAElF,YAAQ,IAAI,MAAM,MAAM,gBAAgB,CAAC;AACzC,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,4DAA4D,CAAC;AACpF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAElF,YAAQ,IAAI,MAAM,MAAM,yBAAyB,CAAC;AAClD,YAAQ,IAAI,MAAM,KAAK,uEAAuE,CAAC;AAC/F,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AACzF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AAEjF,YAAQ,IAAI,MAAM,MAAM,2BAA2B,CAAC;AACpD,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AACzF,YAAQ,IAAI,MAAM,KAAK,gEAAgE,CAAC;AACxF,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAEhF,YAAQ,IAAI,MAAM,MAAM,6BAA6B,CAAC;AACtD,YAAQ,IAAI,MAAM,KAAK,qEAAqE,CAAC;AAC7F,YAAQ,IAAI,MAAM,KAAK,kEAAkE,CAAC;AAC1F,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AAEzF,YAAQ,IAAI,MAAM,MAAM,oBAAoB,CAAC;AAC7C,YAAQ,IAAI,MAAM,KAAK,oEAAoE,CAAC;AAC5F,YAAQ,IAAI,MAAM,KAAK,qEAAqE,CAAC;AAC7F,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,gEAAgE,CAAC;AACxF,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AAEjF,YAAQ,IAAI,MAAM,MAAM,yBAAyB,CAAC;AAClD,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAC/E,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,4DAA4D,CAAC;AAEpF,YAAQ,IAAI,MAAM,MAAM,wBAAwB,CAAC;AACjD,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAElF,YAAQ,IAAI,MAAM,MAAM,sBAAsB,CAAC;AAC/C,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAC/E,YAAQ,IAAI,MAAM,KAAK,oDAAoD,CAAC;AAC5E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AAEnF,YAAQ,IAAI,MAAM,MAAM,qBAAqB,CAAC;AAC9C,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,oDAAoD,CAAC;AAC5E,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,qDAAqD,CAAC;AAE7E,YAAQ,IAAI,MAAM,MAAM,gBAAgB,CAAC;AACzC,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAC/E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,oDAAoD,CAAC;AAC5E,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAE/E,YAAQ,IAAI,MAAM,MAAM,cAAc,CAAC;AACvC,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AACzF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,4DAA4D,CAAC;AACpF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AAEnF,YAAQ,IAAI,MAAM,MAAM,sBAAsB,CAAC;AAC/C,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,qDAAqD,CAAC;AAC7E,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAE9E,YAAQ,IAAI,MAAM,MAAM,aAAa,CAAC;AACtC,YAAQ,SAAS,QAAQ,CAAA,QAAO;AAC9B,cAAQ,IAAI,MAAM,KAAK,OAAO,IAAI,OAAO,OAAO,EAAE,CAAC,EAAE,GAAG,MAAM,KAAK,IAAI,YAAA,KAAiB,EAAE,CAAC;AAAA,IAC7F,CAAC;AAED,YAAQ,IAAI,WAAW,MAAM,KAAK,qBAAqB,GAAG,wBAAwB;AAAA,EACpF,CAAC;AAED,SAAO;AACT;"}
+{"version":3,"file":"index.js","sources":["../../src/cli/index.ts"],"sourcesContent":["/**\n * Knowledge Graph Agent CLI\n *\n * Main CLI setup and command registration.\n */\n\nimport { Command } from 'commander';\nimport chalk from 'chalk';\nimport { createInitCommand } from './commands/init.js';\nimport { createGraphCommand } from './commands/graph.js';\nimport { createDocsCommand } from './commands/docs.js';\nimport { createClaudeCommand } from './commands/claude.js';\nimport { createSyncCommand } from './commands/sync.js';\nimport { createStatsCommand } from './commands/stats.js';\nimport { createSearchCommand } from './commands/search.js';\nimport { createConvertCommand, createFrontmatterCommand } from './commands/convert.js';\nimport { createAnalyzeCommand } from './commands/analyze.js';\nimport { createSOPCommands } from './commands/sop.js';\nimport { createInitPrimitivesCommand, createAnalyzeCodebaseCommand } from './commands/init-primitives.js';\nimport { createCultivateCommand } from './commands/cultivate.js';\nimport { createCommitCommand } from './commands/commit.js';\nimport { createConfigCommand } from './commands/config.js';\nimport { createDiagnosticsCommand } from './commands/diagnostics.js';\nimport { createWorkflowCommand } from './commands/workflow.js';\nimport { createAuditCommand } from './commands/audit.js';\nimport { createVectorCommand } from './commands/vector.js';\nimport { createServeCommand } from './commands/serve.js';\nimport { createDashboardCommand } from './commands/dashboard.js';\nimport { createPluginCommand } from './commands/plugin.js';\nimport { createHiveMindCommand } from './commands/hive-mind/index.js';\n\n/**\n * CLI version\n */\nconst VERSION = '0.4.0';\n\n/**\n * Create and configure the CLI program\n */\nexport function createCLI(): Command {\n  const program = new Command();\n\n  program\n    .name('kg')\n    .description('Knowledge Graph Agent - Generate and manage knowledge graphs for Claude Code')\n    .version(VERSION, '-v, --version', 'Display version number');\n\n  // Configure help\n  program.configureHelp({\n    sortSubcommands: true,\n    sortOptions: true,\n  });\n\n  // Add commands\n  program.addCommand(createInitCommand());\n  program.addCommand(createGraphCommand());\n  program.addCommand(createDocsCommand());\n  program.addCommand(createClaudeCommand());\n  program.addCommand(createSyncCommand());\n  program.addCommand(createStatsCommand());\n  program.addCommand(createSearchCommand());\n  program.addCommand(createConvertCommand());\n  program.addCommand(createFrontmatterCommand());\n  program.addCommand(createAnalyzeCommand());\n  program.addCommand(createSOPCommands());\n  program.addCommand(createInitPrimitivesCommand());\n  program.addCommand(createAnalyzeCodebaseCommand());\n  program.addCommand(createCultivateCommand());\n  program.addCommand(createCommitCommand());\n  program.addCommand(createConfigCommand());\n  program.addCommand(createDiagnosticsCommand());\n  program.addCommand(createWorkflowCommand());\n  program.addCommand(createAuditCommand());\n  program.addCommand(createVectorCommand());\n  program.addCommand(createServeCommand());\n  program.addCommand(createDashboardCommand());\n  program.addCommand(createPluginCommand());\n  program.addCommand(createHiveMindCommand());\n\n  // Default action (show help)\n  program.action(() => {\n    console.log(chalk.cyan.bold('\\n  Knowledge Graph Agent\\n'));\n    console.log(chalk.gray('  Generate and manage knowledge graphs for Claude Code\\n'));\n\n    console.log(chalk.white('  Quick Start:'));\n    console.log(chalk.gray('    $ kg init                  # Initialize knowledge graph'));\n    console.log(chalk.gray('    $ kg docs init             # Initialize docs directory'));\n    console.log(chalk.gray('    $ kg graph                 # Generate knowledge graph'));\n    console.log(chalk.gray('    $ kg claude update         # Update CLAUDE.md'));\n    console.log(chalk.gray('    $ kg sync                  # Sync with claude-flow\\n'));\n\n    console.log(chalk.white('  Migration & Analysis:'));\n    console.log(chalk.gray('    $ kg analyze               # Analyze & migrate to knowledge graph'));\n    console.log(chalk.gray('    $ kg analyze deep          # Deep analysis with claude-flow'));\n    console.log(chalk.gray('    $ kg analyze report        # Generate analysis report'));\n    console.log(chalk.gray('    $ kg convert docs          # Convert docs/ → docs-nn/'));\n    console.log(chalk.gray('    $ kg frontmatter add       # Add frontmatter to files'));\n    console.log(chalk.gray('    $ kg frontmatter validate  # Validate frontmatter\\n'));\n\n    console.log(chalk.white('  AI-SDLC SOP Compliance:'));\n    console.log(chalk.gray('    $ kg sop init              # Initialize SOP standards layer'));\n    console.log(chalk.gray('    $ kg sop check             # Check compliance against SOPs'));\n    console.log(chalk.gray('    $ kg sop gaps              # Analyze compliance gaps'));\n    console.log(chalk.gray('    $ kg sop report            # Generate compliance report'));\n    console.log(chalk.gray('    $ kg sop list              # List available SOPs\\n'));\n\n    console.log(chalk.white('  Cultivation & Primitives:'));\n    console.log(chalk.gray('    $ kg init-primitives       # Bootstrap primitives from codebase'));\n    console.log(chalk.gray('    $ kg analyze-codebase      # Analyze dependencies & services'));\n    console.log(chalk.gray('    $ kg init-primitives --dry-run  # Preview without writing\\n'));\n\n    console.log(chalk.white('  Git Integration:'));\n    console.log(chalk.gray('    $ kg commit                # Show status and suggested message'));\n    console.log(chalk.gray('    $ kg commit -a             # Auto-commit with generated message'));\n    console.log(chalk.gray('    $ kg commit -i             # Interactive commit mode'));\n    console.log(chalk.gray('    $ kg commit -m \"message\"   # Commit with custom message'));\n    console.log(chalk.gray('    $ kg commit status         # Show git status with analysis'));\n    console.log(chalk.gray('    $ kg commit log            # Show recent commits'));\n    console.log(chalk.gray('    $ kg commit diff           # Show diff of changes\\n'));\n\n    console.log(chalk.white('  Diagnostics & Health:'));\n    console.log(chalk.gray('    $ kg diag run              # Run full diagnostics'));\n    console.log(chalk.gray('    $ kg diag run --fix        # Attempt to fix issues'));\n    console.log(chalk.gray('    $ kg diag health           # Check system health'));\n    console.log(chalk.gray('    $ kg diag repair           # Repair database issues'));\n    console.log(chalk.gray('    $ kg diag backup           # Create database backup'));\n    console.log(chalk.gray('    $ kg diag backup --list    # List existing backups'));\n    console.log(chalk.gray('    $ kg diag info             # Show system information\\n'));\n\n    console.log(chalk.white('  Workflow Management:'));\n    console.log(chalk.gray('    $ kg workflow start <type> # Start a workflow'));\n    console.log(chalk.gray('    $ kg workflow status [id]  # Check workflow status'));\n    console.log(chalk.gray('    $ kg workflow list         # List active workflows'));\n    console.log(chalk.gray('    $ kg workflow stop <id>    # Stop a workflow'));\n    console.log(chalk.gray('    $ kg workflow history      # Show workflow history\\n'));\n\n    console.log(chalk.white('  Vector Operations:'));\n    console.log(chalk.gray('    $ kg vector search <query> # Semantic search'));\n    console.log(chalk.gray('    $ kg vector stats          # Vector store statistics'));\n    console.log(chalk.gray('    $ kg vector rebuild        # Rebuild vector index'));\n    console.log(chalk.gray('    $ kg vector traj list      # List trajectories'));\n    console.log(chalk.gray('    $ kg vector traj show <id> # Show trajectory details'));\n    console.log(chalk.gray('    $ kg vector traj patterns  # Show detected patterns\\n'));\n\n    console.log(chalk.white('  Audit & Exochain:'));\n    console.log(chalk.gray('    $ kg audit query           # Query the audit log'));\n    console.log(chalk.gray('    $ kg audit checkpoint      # Create a checkpoint'));\n    console.log(chalk.gray('    $ kg audit verify          # Verify chain integrity'));\n    console.log(chalk.gray('    $ kg audit sync status     # Check sync status'));\n    console.log(chalk.gray('    $ kg audit sync peers      # List sync peers'));\n    console.log(chalk.gray('    $ kg audit export          # Export audit log\\n'));\n\n    console.log(chalk.white('  Server Mode:'));\n    console.log(chalk.gray('    $ kg serve                 # Start MCP server (stdio)'));\n    console.log(chalk.gray('    $ kg serve --graphql       # Start GraphQL server'));\n    console.log(chalk.gray('    $ kg serve --dashboard     # Start web dashboard'));\n    console.log(chalk.gray('    $ kg serve --all           # Start all servers'));\n    console.log(chalk.gray('    $ kg serve status          # Show server status\\n'));\n\n    console.log(chalk.white('  Dashboard:'));\n    console.log(chalk.gray('    $ kg dashboard start       # Start dashboard dev server'));\n    console.log(chalk.gray('    $ kg dashboard build       # Build dashboard for production'));\n    console.log(chalk.gray('    $ kg dashboard serve       # Serve built dashboard'));\n    console.log(chalk.gray('    $ kg dashboard open        # Open dashboard in browser'));\n    console.log(chalk.gray('    $ kg dashboard status      # Check dashboard status\\n'));\n\n    console.log(chalk.white('  Plugin Management:'));\n    console.log(chalk.gray('    $ kg plugin list           # List installed plugins'));\n    console.log(chalk.gray('    $ kg plugin install <pkg>  # Install a plugin'));\n    console.log(chalk.gray('    $ kg plugin uninstall <n>  # Uninstall a plugin'));\n    console.log(chalk.gray('    $ kg plugin enable <name>  # Enable a plugin'));\n    console.log(chalk.gray('    $ kg plugin disable <name> # Disable a plugin'));\n    console.log(chalk.gray('    $ kg plugin info <name>    # Show plugin details'));\n    console.log(chalk.gray('    $ kg plugin run <n> <file> # Run analyzer plugin'));\n    console.log(chalk.gray('    $ kg plugin create <name>  # Create new plugin\\n'));\n\n    console.log(chalk.white('  Hive Mind (Graph Reconnection):'));\n    console.log(chalk.gray('    $ kg hive-mind analyze-links <vault>     # Analyze wiki-links'));\n    console.log(chalk.gray('    $ kg hive-mind find-connections <vault>  # Find potential links'));\n    console.log(chalk.gray('    $ kg hive-mind validate-names <vault>    # Validate file names'));\n    console.log(chalk.gray('    $ kg hive-mind add-frontmatter <vault>   # Add YAML frontmatter\\n'));\n\n    console.log(chalk.white('  Commands:'));\n    program.commands.forEach(cmd => {\n      console.log(chalk.cyan(`    ${cmd.name().padEnd(20)}`), chalk.gray(cmd.description() || ''));\n    });\n\n    console.log('\\n  Run', chalk.cyan('kg <command> --help'), 'for more information\\n');\n  });\n\n  return program;\n}\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAkCA,MAAM,UAAU;AAKT,SAAS,YAAqB;AACnC,QAAM,UAAU,IAAI,QAAA;AAEpB,UACG,KAAK,IAAI,EACT,YAAY,8EAA8E,EAC1F,QAAQ,SAAS,iBAAiB,wBAAwB;AAG7D,UAAQ,cAAc;AAAA,IACpB,iBAAiB;AAAA,IACjB,aAAa;AAAA,EAAA,CACd;AAGD,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,sBAAsB;AACzC,UAAQ,WAAW,0BAA0B;AAC7C,UAAQ,WAAW,sBAAsB;AACzC,UAAQ,WAAW,mBAAmB;AACtC,UAAQ,WAAW,6BAA6B;AAChD,UAAQ,WAAW,8BAA8B;AACjD,UAAQ,WAAW,wBAAwB;AAC3C,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,0BAA0B;AAC7C,UAAQ,WAAW,uBAAuB;AAC1C,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,oBAAoB;AACvC,UAAQ,WAAW,wBAAwB;AAC3C,UAAQ,WAAW,qBAAqB;AACxC,UAAQ,WAAW,uBAAuB;AAG1C,UAAQ,OAAO,MAAM;AACnB,YAAQ,IAAI,MAAM,KAAK,KAAK,6BAA6B,CAAC;AAC1D,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAElF,YAAQ,IAAI,MAAM,MAAM,gBAAgB,CAAC;AACzC,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,4DAA4D,CAAC;AACpF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAElF,YAAQ,IAAI,MAAM,MAAM,yBAAyB,CAAC;AAClD,YAAQ,IAAI,MAAM,KAAK,uEAAuE,CAAC;AAC/F,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AACzF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AAEjF,YAAQ,IAAI,MAAM,MAAM,2BAA2B,CAAC;AACpD,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AACzF,YAAQ,IAAI,MAAM,KAAK,gEAAgE,CAAC;AACxF,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAEhF,YAAQ,IAAI,MAAM,MAAM,6BAA6B,CAAC;AACtD,YAAQ,IAAI,MAAM,KAAK,qEAAqE,CAAC;AAC7F,YAAQ,IAAI,MAAM,KAAK,kEAAkE,CAAC;AAC1F,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AAEzF,YAAQ,IAAI,MAAM,MAAM,oBAAoB,CAAC;AAC7C,YAAQ,IAAI,MAAM,KAAK,oEAAoE,CAAC;AAC5F,YAAQ,IAAI,MAAM,KAAK,qEAAqE,CAAC;AAC7F,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,gEAAgE,CAAC;AACxF,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AAEjF,YAAQ,IAAI,MAAM,MAAM,yBAAyB,CAAC;AAClD,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAC/E,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,4DAA4D,CAAC;AAEpF,YAAQ,IAAI,MAAM,MAAM,wBAAwB,CAAC;AACjD,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAElF,YAAQ,IAAI,MAAM,MAAM,sBAAsB,CAAC;AAC/C,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAC/E,YAAQ,IAAI,MAAM,KAAK,oDAAoD,CAAC;AAC5E,YAAQ,IAAI,MAAM,KAAK,0DAA0D,CAAC;AAClF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AAEnF,YAAQ,IAAI,MAAM,MAAM,qBAAqB,CAAC;AAC9C,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,oDAAoD,CAAC;AAC5E,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,qDAAqD,CAAC;AAE7E,YAAQ,IAAI,MAAM,MAAM,gBAAgB,CAAC;AACzC,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AACnF,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAC/E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,oDAAoD,CAAC;AAC5E,YAAQ,IAAI,MAAM,KAAK,uDAAuD,CAAC;AAE/E,YAAQ,IAAI,MAAM,MAAM,cAAc,CAAC;AACvC,YAAQ,IAAI,MAAM,KAAK,6DAA6D,CAAC;AACrF,YAAQ,IAAI,MAAM,KAAK,iEAAiE,CAAC;AACzF,YAAQ,IAAI,MAAM,KAAK,wDAAwD,CAAC;AAChF,YAAQ,IAAI,MAAM,KAAK,4DAA4D,CAAC;AACpF,YAAQ,IAAI,MAAM,KAAK,2DAA2D,CAAC;AAEnF,YAAQ,IAAI,MAAM,MAAM,sBAAsB,CAAC;AAC/C,YAAQ,IAAI,MAAM,KAAK,yDAAyD,CAAC;AACjF,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,qDAAqD,CAAC;AAC7E,YAAQ,IAAI,MAAM,KAAK,kDAAkD,CAAC;AAC1E,YAAQ,IAAI,MAAM,KAAK,mDAAmD,CAAC;AAC3E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,YAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAE9E,YAAQ,IAAI,MAAM,MAAM,mCAAmC,CAAC;AAC5D,YAAQ,IAAI,MAAM,KAAK,mEAAmE,CAAC;AAC3F,YAAQ,IAAI,MAAM,KAAK,qEAAqE,CAAC;AAC7F,YAAQ,IAAI,MAAM,KAAK,oEAAoE,CAAC;AAC5F,YAAQ,IAAI,MAAM,KAAK,uEAAuE,CAAC;AAE/F,YAAQ,IAAI,MAAM,MAAM,aAAa,CAAC;AACtC,YAAQ,SAAS,QAAQ,CAAA,QAAO;AAC9B,cAAQ,IAAI,MAAM,KAAK,OAAO,IAAI,OAAO,OAAO,EAAE,CAAC,EAAE,GAAG,MAAM,KAAK,IAAI,YAAA,KAAiB,EAAE,CAAC;AAAA,IAC7F,CAAC;AAED,YAAQ,IAAI,WAAW,MAAM,KAAK,qBAAqB,GAAG,wBAAwB;AAAA,EACpF,CAAC;AAED,SAAO;AACT;"}

package/dist/equilibrium/agent-equilibrium.d.ts

@@ -0,0 +1,194 @@
+/**
+ * Agent Equilibrium Selector (SPEC-006a)
+ *
+ * Implements Nash equilibrium-based agent selection to replace heuristic
+ * capability-matching in CoordinatorAgent. Uses game-theoretic principles
+ * where agents adjust their participation levels based on task fit and
+ * competition from other agents with similar capabilities.
+ *
+ * @module equilibrium/agent-equilibrium
+ */
+import { AgentType } from '../agents/types.js';
+import { type AgentInfo } from '../agents/planner-agent.js';
+/**
+ * Agent participation in a task allocation game
+ */
+export interface AgentParticipation {
+    /** Agent identifier */
+    agentId: string;
+    /** Agent type */
+    agentType: AgentType;
+    /** Participation level (0-1), equilibrium outcome */
+    participationLevel: number;
+    /** Effectiveness score for the task (0-1) */
+    effectivenessScore: number;
+    /** Penalty for overlapping with other agents */
+    redundancyPenalty: number;
+    /** Net utility from participation */
+    utility: number;
+}
+/**
+ * Configuration for equilibrium computation
+ */
+export interface EquilibriumConfig {
+    /** Learning rate for gradient updates (default: 0.1) */
+    learningRate: number;
+    /** Maximum iterations before stopping (default: 100) */
+    maxIterations: number;
+    /** Convergence threshold for participation changes (default: 0.001) */
+    convergenceThreshold: number;
+    /** Minimum participation level before collapsing to 0 (default: 0.01) */
+    minParticipation: number;
+}
+/**
+ * Task definition for equilibrium selection
+ */
+export interface Task {
+    /** Unique task identifier */
+    id: string;
+    /** Task description */
+    description: string;
+    /** Required capabilities for the task */
+    requiredCapabilities: string[];
+    /** Task priority */
+    priority: 'low' | 'medium' | 'high' | 'critical';
+    /** Task complexity (0-1) */
+    complexity: number;
+}
+/**
+ * Equilibrium computation result
+ */
+export interface EquilibriumResult {
+    /** Participating agents sorted by participation level */
+    participants: AgentParticipation[];
+    /** Number of iterations to converge */
+    iterations: number;
+    /** Whether equilibrium was reached */
+    converged: boolean;
+    /** Total utility at equilibrium */
+    totalUtility: number;
+}
+/**
+ * AgentEquilibriumSelector
+ *
+ * Computes Nash equilibrium for agent selection using iterative gradient
+ * updates. Each agent adjusts its participation level based on:
+ * - Effectiveness: How well the agent matches the task requirements
+ * - Competition: Overlap with other participating agents
+ * - Utility: Net benefit from participating
+ *
+ * Dominated agents (those with lower effectiveness and high overlap)
+ * naturally collapse to zero participation, leaving only the most
+ * suitable agents.
+ *
+ * @example
+ * ```typescript
+ * const selector = new AgentEquilibriumSelector();
+ * const selected = await selector.selectTopAgents(task, agents, 3);
+ * ```
+ */
+export declare class AgentEquilibriumSelector {
+    private config;
+    private participations;
+    private iterationHistory;
+    constructor(config?: Partial<EquilibriumConfig>);
+    /**
+     * Find Nash equilibrium for agent selection
+     *
+     * Each agent adjusts participation based on task match and competition.
+     * Returns agents with positive participation, sorted by level.
+     *
+     * @param task - The task to allocate
+     * @param availableAgents - Pool of available agents
+     * @returns Agents with positive participation at equilibrium
+     */
+    findEquilibrium(task: Task, availableAgents: AgentInfo[]): Promise<AgentParticipation[]>;
+    /**
+     * Select top N agents based on equilibrium
+     *
+     * @param task - The task to allocate
+     * @param availableAgents - Pool of available agents
+     * @param n - Maximum number of agents to select
+     * @returns Selected agents (may be less than n if not enough qualify)
+     */
+    selectTopAgents(task: Task, availableAgents: AgentInfo[], n: number): Promise<AgentInfo[]>;
+    /**
+     * Get iteration history for analysis/debugging
+     */
+    getIterationHistory(): Array<{
+        iteration: number;
+        totalUtility: number;
+    }>;
+    /**
+     * Get current participation state
+     */
+    getParticipations(): Map<string, AgentParticipation>;
+    /**
+     * Get configuration
+     */
+    getConfig(): EquilibriumConfig;
+    /**
+     * Initialize participation levels uniformly across agents
+     */
+    private initializeParticipations;
+    /**
+     * Update a single agent's participation based on game dynamics
+     */
+    private updateAgentParticipation;
+    /**
+     * Normalize participation levels to sum to at most 1
+     * This prevents runaway accumulation
+     */
+    private normalizeParticipations;
+    /**
+     * Calculate how effective an agent is for a given task
+     *
+     * Combines:
+     * - Capability match (70% weight)
+     * - Type boost for task keywords (30% weight)
+     */
+    calculateEffectiveness(agent: AgentInfo, task: Task): number;
+    /**
+     * Get type-based boost for matching task keywords
+     */
+    getTypeBoost(agentType: AgentType, task: Task): number;
+    /**
+     * Calculate competition pressure from other agents
+     *
+     * Competition increases with:
+     * - Number of other agents with overlapping capabilities
+     * - Participation levels of overlapping agents
+     */
+    calculateCompetition(agent: AgentInfo, allAgents: AgentInfo[]): number;
+    /**
+     * Calculate capability overlap between two agents
+     *
+     * Returns a value from 0 (no overlap) to 1 (complete overlap)
+     */
+    capabilityOverlap(a: AgentInfo, b: AgentInfo): number;
+    /**
+     * Create snapshot of current participation levels
+     */
+    private snapshotParticipations;
+    /**
+     * Check if participation levels have converged
+     */
+    private hasConverged;
+    /**
+     * Calculate total utility across all agents
+     */
+    calculateTotalUtility(): number;
+}
+/**
+ * Create a new AgentEquilibriumSelector with optional configuration
+ */
+export declare function createAgentEquilibriumSelector(config?: Partial<EquilibriumConfig>): AgentEquilibriumSelector;
+/**
+ * Create a task for equilibrium selection
+ */
+export declare function createEquilibriumTask(id: string, description: string, options?: {
+    requiredCapabilities?: string[];
+    priority?: 'low' | 'medium' | 'high' | 'critical';
+    complexity?: number;
+}): Task;
+//# sourceMappingURL=agent-equilibrium.d.ts.map

package/dist/equilibrium/agent-equilibrium.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-equilibrium.d.ts","sourceRoot":"","sources":["../../src/equilibrium/agent-equilibrium.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,KAAK,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAM5D;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,uBAAuB;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,iBAAiB;IACjB,SAAS,EAAE,SAAS,CAAC;IACrB,qDAAqD;IACrD,kBAAkB,EAAE,MAAM,CAAC;IAC3B,6CAA6C;IAC7C,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gDAAgD;IAChD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,qCAAqC;IACrC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,wDAAwD;IACxD,YAAY,EAAE,MAAM,CAAC;IACrB,wDAAwD;IACxD,aAAa,EAAE,MAAM,CAAC;IACtB,uEAAuE;IACvE,oBAAoB,EAAE,MAAM,CAAC;IAC7B,yEAAyE;IACzE,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,6BAA6B;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,uBAAuB;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,yCAAyC;IACzC,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAC/B,oBAAoB;IACpB,QAAQ,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,CAAC;IACjD,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,yDAAyD;IACzD,YAAY,EAAE,kBAAkB,EAAE,CAAC;IACnC,uCAAuC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,SAAS,EAAE,OAAO,CAAC;IACnB,mCAAmC;IACnC,YAAY,EAAE,MAAM,CAAC;CACtB;AAMD;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,cAAc,CAAkC;IACxD,OAAO,CAAC,gBAAgB,CAAqD;gBAEjE,MAAM,GAAE,OAAO,CAAC,iBAAiB,CAAM;IAgBnD;;;;;;;;;OASG;IACG,eAAe,CACnB,IAAI,EAAE,IAAI,EACV,eAAe,EAAE,SAAS,EAAE,GAC3B,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAqEhC;;;;;;;OAOG;IACG,eAAe,CACnB,IAAI,EAAE,IAAI,EACV,eAAe,EAAE,SAAS,EAAE,EAC5B,CAAC,EAAE,MAAM,GACR,OAAO,CAAC,SAAS,EAAE,CAAC;IAQvB;;OAEG;IACH,mBAAmB,IAAI,KAAK,CAAC;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;IAIzE;;OAEG;IACH,iBAAiB,IAAI,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC;IAIpD;;OAEG;IACH,SAAS,IAAI,iBAAiB;IAQ9B;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAqBhC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAsChC;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IAiB/B;;;;;;OAMG;IACH,sBAAsB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM;IAoB5D;;OAEG;IACH,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM;IAiCtD;;;;;;OAMG;IACH,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,MAAM;IAgBtE;;;;OAIG;IACH,iBAAiB,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,MAAM;IAsBrD;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAQ9B;;OAEG;IACH,OAAO,CAAC,YAAY;IAgBpB;;OAEG;IACH,qBAAqB,IAAI,MAAM;CAMhC;AAMD;;GAEG;AACH,wBAAgB,8BAA8B,CAC5C,MAAM,CAAC,EAAE,OAAO,CAAC,iBAAiB,CAAC,GAClC,wBAAwB,CAE1B;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,MAAM,EACV,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE;IACP,oBAAoB,CAAC,EAAE,MAAM,EAAE,CAAC;IAChC,QAAQ,CAAC,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,CAAC;IAClD,UAAU,CAAC,EAAE,MAAM,CAAC;CAChB,GACL,IAAI,CAQN"}

package/dist/equilibrium/agent-equilibrium.js

@@ -0,0 +1,304 @@
+import { AgentType } from "../agents/types.js";
+class AgentEquilibriumSelector {
+  config;
+  participations;
+  iterationHistory;
+  constructor(config = {}) {
+    this.config = {
+      learningRate: 0.1,
+      maxIterations: 100,
+      convergenceThreshold: 1e-3,
+      minParticipation: 0.01,
+      ...config
+    };
+    this.participations = /* @__PURE__ */ new Map();
+    this.iterationHistory = [];
+  }
+  // ==========================================================================
+  // Public API
+  // ==========================================================================
+  /**
+   * Find Nash equilibrium for agent selection
+   *
+   * Each agent adjusts participation based on task match and competition.
+   * Returns agents with positive participation, sorted by level.
+   *
+   * @param task - The task to allocate
+   * @param availableAgents - Pool of available agents
+   * @returns Agents with positive participation at equilibrium
+   */
+  async findEquilibrium(task, availableAgents) {
+    this.iterationHistory = [];
+    if (availableAgents.length === 0) {
+      return [];
+    }
+    if (availableAgents.length === 1) {
+      const agent = availableAgents[0];
+      const effectiveness = this.calculateEffectiveness(agent, task);
+      const participation = {
+        agentId: agent.id,
+        agentType: agent.type,
+        participationLevel: 1,
+        effectivenessScore: effectiveness,
+        redundancyPenalty: 0,
+        utility: effectiveness
+      };
+      this.participations.set(agent.id, participation);
+      return [participation];
+    }
+    this.initializeParticipations(availableAgents, task);
+    let converged = false;
+    let iteration = 0;
+    for (iteration = 0; iteration < this.config.maxIterations; iteration++) {
+      const prevState = this.snapshotParticipations();
+      for (const agent of availableAgents) {
+        this.updateAgentParticipation(agent, task, availableAgents);
+      }
+      this.normalizeParticipations();
+      if (this.hasConverged(prevState)) {
+        converged = true;
+        break;
+      }
+      this.iterationHistory.push({
+        iteration,
+        totalUtility: this.calculateTotalUtility()
+      });
+    }
+    if (!converged) {
+      console.debug(
+        `Equilibrium did not converge after ${this.config.maxIterations} iterations`
+      );
+    }
+    return [...this.participations.values()].filter((p) => p.participationLevel > 0).sort((a, b) => b.participationLevel - a.participationLevel);
+  }
+  /**
+   * Select top N agents based on equilibrium
+   *
+   * @param task - The task to allocate
+   * @param availableAgents - Pool of available agents
+   * @param n - Maximum number of agents to select
+   * @returns Selected agents (may be less than n if not enough qualify)
+   */
+  async selectTopAgents(task, availableAgents, n) {
+    const equilibrium = await this.findEquilibrium(task, availableAgents);
+    return equilibrium.slice(0, n).map((p) => availableAgents.find((a) => a.id === p.agentId)).filter(Boolean);
+  }
+  /**
+   * Get iteration history for analysis/debugging
+   */
+  getIterationHistory() {
+    return [...this.iterationHistory];
+  }
+  /**
+   * Get current participation state
+   */
+  getParticipations() {
+    return new Map(this.participations);
+  }
+  /**
+   * Get configuration
+   */
+  getConfig() {
+    return { ...this.config };
+  }
+  // ==========================================================================
+  // Initialization
+  // ==========================================================================
+  /**
+   * Initialize participation levels uniformly across agents
+   */
+  initializeParticipations(agents, task) {
+    this.participations.clear();
+    const uniformLevel = 1 / agents.length;
+    for (const agent of agents) {
+      const effectiveness = this.calculateEffectiveness(agent, task);
+      this.participations.set(agent.id, {
+        agentId: agent.id,
+        agentType: agent.type,
+        participationLevel: uniformLevel,
+        effectivenessScore: effectiveness,
+        redundancyPenalty: 0,
+        utility: 0
+      });
+    }
+  }
+  // ==========================================================================
+  // Gradient Update
+  // ==========================================================================
+  /**
+   * Update a single agent's participation based on game dynamics
+   */
+  updateAgentParticipation(agent, task, allAgents) {
+    const participation = this.participations.get(agent.id);
+    if (!participation) return;
+    const utility = participation.effectivenessScore * participation.participationLevel;
+    const competition = this.calculateCompetition(agent, allAgents);
+    participation.redundancyPenalty = competition * 0.5;
+    const netUtility = utility - participation.redundancyPenalty;
+    participation.utility = netUtility;
+    const delta = this.config.learningRate * (netUtility - competition);
+    participation.participationLevel = Math.max(
+      0,
+      Math.min(1, participation.participationLevel + delta)
+    );
+    if (participation.participationLevel < this.config.minParticipation) {
+      participation.participationLevel = 0;
+    }
+  }
+  /**
+   * Normalize participation levels to sum to at most 1
+   * This prevents runaway accumulation
+   */
+  normalizeParticipations() {
+    const total = [...this.participations.values()].reduce(
+      (sum, p) => sum + p.participationLevel,
+      0
+    );
+    if (total > 1) {
+      for (const p of this.participations.values()) {
+        p.participationLevel = p.participationLevel / total;
+      }
+    }
+  }
+  // ==========================================================================
+  // Effectiveness Calculation
+  // ==========================================================================
+  /**
+   * Calculate how effective an agent is for a given task
+   *
+   * Combines:
+   * - Capability match (70% weight)
+   * - Type boost for task keywords (30% weight)
+   */
+  calculateEffectiveness(agent, task) {
+    const requiredCaps = new Set(task.requiredCapabilities);
+    const agentCaps = new Set(agent.capabilities || []);
+    let matchCount = 0;
+    for (const cap of requiredCaps) {
+      if (agentCaps.has(cap)) matchCount++;
+    }
+    const capabilityMatch = requiredCaps.size > 0 ? matchCount / requiredCaps.size : 0.5;
+    const typeBoost = this.getTypeBoost(agent.type, task);
+    return capabilityMatch * 0.7 + typeBoost * 0.3;
+  }
+  /**
+   * Get type-based boost for matching task keywords
+   */
+  getTypeBoost(agentType, task) {
+    const desc = task.description.toLowerCase();
+    const boostMap = {
+      review: [AgentType.REVIEWER],
+      test: [AgentType.TESTER],
+      code: [AgentType.CODER],
+      implement: [AgentType.CODER],
+      document: [AgentType.DOCUMENTER],
+      plan: [AgentType.PLANNER],
+      optimize: [AgentType.OPTIMIZER],
+      research: [AgentType.RESEARCHER],
+      analyze: [AgentType.ANALYST],
+      architect: [AgentType.ARCHITECT],
+      design: [AgentType.ARCHITECT],
+      coordinate: [AgentType.COORDINATOR]
+    };
+    for (const [keyword, types] of Object.entries(boostMap)) {
+      if (desc.includes(keyword) && types.includes(agentType)) {
+        return 1;
+      }
+    }
+    return 0.3;
+  }
+  // ==========================================================================
+  // Competition Calculation
+  // ==========================================================================
+  /**
+   * Calculate competition pressure from other agents
+   *
+   * Competition increases with:
+   * - Number of other agents with overlapping capabilities
+   * - Participation levels of overlapping agents
+   */
+  calculateCompetition(agent, allAgents) {
+    let competition = 0;
+    for (const other of allAgents) {
+      if (other.id === agent.id) continue;
+      const overlap = this.capabilityOverlap(agent, other);
+      const otherParticipation = this.participations.get(other.id);
+      if (otherParticipation) {
+        competition += overlap * otherParticipation.participationLevel;
+      }
+    }
+    return competition;
+  }
+  /**
+   * Calculate capability overlap between two agents
+   *
+   * Returns a value from 0 (no overlap) to 1 (complete overlap)
+   */
+  capabilityOverlap(a, b) {
+    const capsA = new Set(a.capabilities || []);
+    const capsB = new Set(b.capabilities || []);
+    if (capsA.size === 0 || capsB.size === 0) {
+      return a.type === b.type ? 0.8 : 0.2;
+    }
+    let overlap = 0;
+    for (const cap of capsA) {
+      if (capsB.has(cap)) overlap++;
+    }
+    return overlap / Math.max(capsA.size, capsB.size);
+  }
+  // ==========================================================================
+  // Convergence Detection
+  // ==========================================================================
+  /**
+   * Create snapshot of current participation levels
+   */
+  snapshotParticipations() {
+    const snapshot = /* @__PURE__ */ new Map();
+    for (const [id, p] of this.participations) {
+      snapshot.set(id, p.participationLevel);
+    }
+    return snapshot;
+  }
+  /**
+   * Check if participation levels have converged
+   */
+  hasConverged(prevState) {
+    let maxDelta = 0;
+    for (const [id, p] of this.participations) {
+      const prev = prevState.get(id) ?? 0;
+      const delta = Math.abs(p.participationLevel - prev);
+      maxDelta = Math.max(maxDelta, delta);
+    }
+    return maxDelta < this.config.convergenceThreshold;
+  }
+  // ==========================================================================
+  // Utility Calculation
+  // ==========================================================================
+  /**
+   * Calculate total utility across all agents
+   */
+  calculateTotalUtility() {
+    return [...this.participations.values()].reduce(
+      (sum, p) => sum + p.utility,
+      0
+    );
+  }
+}
+function createAgentEquilibriumSelector(config) {
+  return new AgentEquilibriumSelector(config);
+}
+function createEquilibriumTask(id, description, options = {}) {
+  return {
+    id,
+    description,
+    requiredCapabilities: options.requiredCapabilities ?? [],
+    priority: options.priority ?? "medium",
+    complexity: options.complexity ?? 0.5
+  };
+}
+export {
+  AgentEquilibriumSelector,
+  createAgentEquilibriumSelector,
+  createEquilibriumTask
+};
+//# sourceMappingURL=agent-equilibrium.js.map

package/dist/equilibrium/agent-equilibrium.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-equilibrium.js","sources":["../../src/equilibrium/agent-equilibrium.ts"],"sourcesContent":["/**\n * Agent Equilibrium Selector (SPEC-006a)\n *\n * Implements Nash equilibrium-based agent selection to replace heuristic\n * capability-matching in CoordinatorAgent. Uses game-theoretic principles\n * where agents adjust their participation levels based on task fit and\n * competition from other agents with similar capabilities.\n *\n * @module equilibrium/agent-equilibrium\n */\n\nimport { AgentType } from '../agents/types.js';\nimport { type AgentInfo } from '../agents/planner-agent.js';\n\n// ============================================================================\n// Types and Interfaces\n// ============================================================================\n\n/**\n * Agent participation in a task allocation game\n */\nexport interface AgentParticipation {\n  /** Agent identifier */\n  agentId: string;\n  /** Agent type */\n  agentType: AgentType;\n  /** Participation level (0-1), equilibrium outcome */\n  participationLevel: number;\n  /** Effectiveness score for the task (0-1) */\n  effectivenessScore: number;\n  /** Penalty for overlapping with other agents */\n  redundancyPenalty: number;\n  /** Net utility from participation */\n  utility: number;\n}\n\n/**\n * Configuration for equilibrium computation\n */\nexport interface EquilibriumConfig {\n  /** Learning rate for gradient updates (default: 0.1) */\n  learningRate: number;\n  /** Maximum iterations before stopping (default: 100) */\n  maxIterations: number;\n  /** Convergence threshold for participation changes (default: 0.001) */\n  convergenceThreshold: number;\n  /** Minimum participation level before collapsing to 0 (default: 0.01) */\n  minParticipation: number;\n}\n\n/**\n * Task definition for equilibrium selection\n */\nexport interface Task {\n  /** Unique task identifier */\n  id: string;\n  /** Task description */\n  description: string;\n  /** Required capabilities for the task */\n  requiredCapabilities: string[];\n  /** Task priority */\n  priority: 'low' | 'medium' | 'high' | 'critical';\n  /** Task complexity (0-1) */\n  complexity: number;\n}\n\n/**\n * Equilibrium computation result\n */\nexport interface EquilibriumResult {\n  /** Participating agents sorted by participation level */\n  participants: AgentParticipation[];\n  /** Number of iterations to converge */\n  iterations: number;\n  /** Whether equilibrium was reached */\n  converged: boolean;\n  /** Total utility at equilibrium */\n  totalUtility: number;\n}\n\n// ============================================================================\n// Agent Equilibrium Selector\n// ============================================================================\n\n/**\n * AgentEquilibriumSelector\n *\n * Computes Nash equilibrium for agent selection using iterative gradient\n * updates. Each agent adjusts its participation level based on:\n * - Effectiveness: How well the agent matches the task requirements\n * - Competition: Overlap with other participating agents\n * - Utility: Net benefit from participating\n *\n * Dominated agents (those with lower effectiveness and high overlap)\n * naturally collapse to zero participation, leaving only the most\n * suitable agents.\n *\n * @example\n * ```typescript\n * const selector = new AgentEquilibriumSelector();\n * const selected = await selector.selectTopAgents(task, agents, 3);\n * ```\n */\nexport class AgentEquilibriumSelector {\n  private config: EquilibriumConfig;\n  private participations: Map<string, AgentParticipation>;\n  private iterationHistory: Array<{ iteration: number; totalUtility: number }>;\n\n  constructor(config: Partial<EquilibriumConfig> = {}) {\n    this.config = {\n      learningRate: 0.1,\n      maxIterations: 100,\n      convergenceThreshold: 0.001,\n      minParticipation: 0.01,\n      ...config,\n    };\n    this.participations = new Map();\n    this.iterationHistory = [];\n  }\n\n  // ==========================================================================\n  // Public API\n  // ==========================================================================\n\n  /**\n   * Find Nash equilibrium for agent selection\n   *\n   * Each agent adjusts participation based on task match and competition.\n   * Returns agents with positive participation, sorted by level.\n   *\n   * @param task - The task to allocate\n   * @param availableAgents - Pool of available agents\n   * @returns Agents with positive participation at equilibrium\n   */\n  async findEquilibrium(\n    task: Task,\n    availableAgents: AgentInfo[]\n  ): Promise<AgentParticipation[]> {\n    // Reset state for new computation\n    this.iterationHistory = [];\n\n    // Handle edge cases\n    if (availableAgents.length === 0) {\n      return [];\n    }\n\n    if (availableAgents.length === 1) {\n      // Single agent case - no competition\n      const agent = availableAgents[0];\n      const effectiveness = this.calculateEffectiveness(agent, task);\n      const participation: AgentParticipation = {\n        agentId: agent.id,\n        agentType: agent.type,\n        participationLevel: 1.0,\n        effectivenessScore: effectiveness,\n        redundancyPenalty: 0,\n        utility: effectiveness,\n      };\n      this.participations.set(agent.id, participation);\n      return [participation];\n    }\n\n    // 1. Initialize participation levels uniformly\n    this.initializeParticipations(availableAgents, task);\n\n    // 2. Iterate until convergence or max iterations\n    let converged = false;\n    let iteration = 0;\n\n    for (iteration = 0; iteration < this.config.maxIterations; iteration++) {\n      const prevState = this.snapshotParticipations();\n\n      // Update each agent's participation\n      for (const agent of availableAgents) {\n        this.updateAgentParticipation(agent, task, availableAgents);\n      }\n\n      // Normalize participation levels to prevent runaway values\n      this.normalizeParticipations();\n\n      // Check convergence\n      if (this.hasConverged(prevState)) {\n        converged = true;\n        break;\n      }\n\n      // Record history\n      this.iterationHistory.push({\n        iteration,\n        totalUtility: this.calculateTotalUtility(),\n      });\n    }\n\n    // Log convergence info\n    if (!converged) {\n      console.debug(\n        `Equilibrium did not converge after ${this.config.maxIterations} iterations`\n      );\n    }\n\n    // 3. Return agents with positive participation, sorted by level\n    return [...this.participations.values()]\n      .filter(p => p.participationLevel > 0)\n      .sort((a, b) => b.participationLevel - a.participationLevel);\n  }\n\n  /**\n   * Select top N agents based on equilibrium\n   *\n   * @param task - The task to allocate\n   * @param availableAgents - Pool of available agents\n   * @param n - Maximum number of agents to select\n   * @returns Selected agents (may be less than n if not enough qualify)\n   */\n  async selectTopAgents(\n    task: Task,\n    availableAgents: AgentInfo[],\n    n: number\n  ): Promise<AgentInfo[]> {\n    const equilibrium = await this.findEquilibrium(task, availableAgents);\n    return equilibrium\n      .slice(0, n)\n      .map(p => availableAgents.find(a => a.id === p.agentId)!)\n      .filter(Boolean);\n  }\n\n  /**\n   * Get iteration history for analysis/debugging\n   */\n  getIterationHistory(): Array<{ iteration: number; totalUtility: number }> {\n    return [...this.iterationHistory];\n  }\n\n  /**\n   * Get current participation state\n   */\n  getParticipations(): Map<string, AgentParticipation> {\n    return new Map(this.participations);\n  }\n\n  /**\n   * Get configuration\n   */\n  getConfig(): EquilibriumConfig {\n    return { ...this.config };\n  }\n\n  // ==========================================================================\n  // Initialization\n  // ==========================================================================\n\n  /**\n   * Initialize participation levels uniformly across agents\n   */\n  private initializeParticipations(agents: AgentInfo[], task: Task): void {\n    this.participations.clear();\n    const uniformLevel = 1.0 / agents.length;\n\n    for (const agent of agents) {\n      const effectiveness = this.calculateEffectiveness(agent, task);\n      this.participations.set(agent.id, {\n        agentId: agent.id,\n        agentType: agent.type,\n        participationLevel: uniformLevel,\n        effectivenessScore: effectiveness,\n        redundancyPenalty: 0,\n        utility: 0,\n      });\n    }\n  }\n\n  // ==========================================================================\n  // Gradient Update\n  // ==========================================================================\n\n  /**\n   * Update a single agent's participation based on game dynamics\n   */\n  private updateAgentParticipation(\n    agent: AgentInfo,\n    task: Task,\n    allAgents: AgentInfo[]\n  ): void {\n    const participation = this.participations.get(agent.id);\n    if (!participation) return;\n\n    // Calculate utility: effectiveness * participation (returns from participating)\n    const utility =\n      participation.effectivenessScore * participation.participationLevel;\n\n    // Calculate competition from similar agents (costs from competition)\n    const competition = this.calculateCompetition(agent, allAgents);\n\n    // Calculate redundancy penalty\n    participation.redundancyPenalty = competition * 0.5;\n\n    // Net utility (marginal benefit of participating)\n    const netUtility = utility - participation.redundancyPenalty;\n    participation.utility = netUtility;\n\n    // Gradient update toward equilibrium\n    // Agent increases participation if net utility exceeds competition\n    // Agent decreases participation if competition dominates\n    const delta = this.config.learningRate * (netUtility - competition);\n\n    participation.participationLevel = Math.max(\n      0,\n      Math.min(1, participation.participationLevel + delta)\n    );\n\n    // Dominated agents collapse to zero (below threshold)\n    if (participation.participationLevel < this.config.minParticipation) {\n      participation.participationLevel = 0;\n    }\n  }\n\n  /**\n   * Normalize participation levels to sum to at most 1\n   * This prevents runaway accumulation\n   */\n  private normalizeParticipations(): void {\n    const total = [...this.participations.values()].reduce(\n      (sum, p) => sum + p.participationLevel,\n      0\n    );\n\n    if (total > 1) {\n      for (const p of this.participations.values()) {\n        p.participationLevel = p.participationLevel / total;\n      }\n    }\n  }\n\n  // ==========================================================================\n  // Effectiveness Calculation\n  // ==========================================================================\n\n  /**\n   * Calculate how effective an agent is for a given task\n   *\n   * Combines:\n   * - Capability match (70% weight)\n   * - Type boost for task keywords (30% weight)\n   */\n  calculateEffectiveness(agent: AgentInfo, task: Task): number {\n    // Score based on capability match\n    const requiredCaps = new Set(task.requiredCapabilities);\n    const agentCaps = new Set(agent.capabilities || []);\n\n    let matchCount = 0;\n    for (const cap of requiredCaps) {\n      if (agentCaps.has(cap)) matchCount++;\n    }\n\n    const capabilityMatch =\n      requiredCaps.size > 0 ? matchCount / requiredCaps.size : 0.5;\n\n    // Boost for agent type matching task keywords\n    const typeBoost = this.getTypeBoost(agent.type, task);\n\n    // Combine with weights\n    return capabilityMatch * 0.7 + typeBoost * 0.3;\n  }\n\n  /**\n   * Get type-based boost for matching task keywords\n   */\n  getTypeBoost(agentType: AgentType, task: Task): number {\n    const desc = task.description.toLowerCase();\n\n    // Map keywords to relevant agent types\n    const boostMap: Record<string, AgentType[]> = {\n      review: [AgentType.REVIEWER],\n      test: [AgentType.TESTER],\n      code: [AgentType.CODER],\n      implement: [AgentType.CODER],\n      document: [AgentType.DOCUMENTER],\n      plan: [AgentType.PLANNER],\n      optimize: [AgentType.OPTIMIZER],\n      research: [AgentType.RESEARCHER],\n      analyze: [AgentType.ANALYST],\n      architect: [AgentType.ARCHITECT],\n      design: [AgentType.ARCHITECT],\n      coordinate: [AgentType.COORDINATOR],\n    };\n\n    for (const [keyword, types] of Object.entries(boostMap)) {\n      if (desc.includes(keyword) && types.includes(agentType)) {\n        return 1.0;\n      }\n    }\n\n    // Default low boost for non-matching types\n    return 0.3;\n  }\n\n  // ==========================================================================\n  // Competition Calculation\n  // ==========================================================================\n\n  /**\n   * Calculate competition pressure from other agents\n   *\n   * Competition increases with:\n   * - Number of other agents with overlapping capabilities\n   * - Participation levels of overlapping agents\n   */\n  calculateCompetition(agent: AgentInfo, allAgents: AgentInfo[]): number {\n    let competition = 0;\n\n    for (const other of allAgents) {\n      if (other.id === agent.id) continue;\n\n      const overlap = this.capabilityOverlap(agent, other);\n      const otherParticipation = this.participations.get(other.id);\n      if (otherParticipation) {\n        competition += overlap * otherParticipation.participationLevel;\n      }\n    }\n\n    return competition;\n  }\n\n  /**\n   * Calculate capability overlap between two agents\n   *\n   * Returns a value from 0 (no overlap) to 1 (complete overlap)\n   */\n  capabilityOverlap(a: AgentInfo, b: AgentInfo): number {\n    const capsA = new Set(a.capabilities || []);\n    const capsB = new Set(b.capabilities || []);\n\n    if (capsA.size === 0 || capsB.size === 0) {\n      // No capabilities defined - use type similarity as proxy\n      return a.type === b.type ? 0.8 : 0.2;\n    }\n\n    let overlap = 0;\n    for (const cap of capsA) {\n      if (capsB.has(cap)) overlap++;\n    }\n\n    // Jaccard-like coefficient using max instead of union\n    return overlap / Math.max(capsA.size, capsB.size);\n  }\n\n  // ==========================================================================\n  // Convergence Detection\n  // ==========================================================================\n\n  /**\n   * Create snapshot of current participation levels\n   */\n  private snapshotParticipations(): Map<string, number> {\n    const snapshot = new Map<string, number>();\n    for (const [id, p] of this.participations) {\n      snapshot.set(id, p.participationLevel);\n    }\n    return snapshot;\n  }\n\n  /**\n   * Check if participation levels have converged\n   */\n  private hasConverged(prevState: Map<string, number>): boolean {\n    let maxDelta = 0;\n\n    for (const [id, p] of this.participations) {\n      const prev = prevState.get(id) ?? 0;\n      const delta = Math.abs(p.participationLevel - prev);\n      maxDelta = Math.max(maxDelta, delta);\n    }\n\n    return maxDelta < this.config.convergenceThreshold;\n  }\n\n  // ==========================================================================\n  // Utility Calculation\n  // ==========================================================================\n\n  /**\n   * Calculate total utility across all agents\n   */\n  calculateTotalUtility(): number {\n    return [...this.participations.values()].reduce(\n      (sum, p) => sum + p.utility,\n      0\n    );\n  }\n}\n\n// ============================================================================\n// Factory Functions\n// ============================================================================\n\n/**\n * Create a new AgentEquilibriumSelector with optional configuration\n */\nexport function createAgentEquilibriumSelector(\n  config?: Partial<EquilibriumConfig>\n): AgentEquilibriumSelector {\n  return new AgentEquilibriumSelector(config);\n}\n\n/**\n * Create a task for equilibrium selection\n */\nexport function createEquilibriumTask(\n  id: string,\n  description: string,\n  options: {\n    requiredCapabilities?: string[];\n    priority?: 'low' | 'medium' | 'high' | 'critical';\n    complexity?: number;\n  } = {}\n): Task {\n  return {\n    id,\n    description,\n    requiredCapabilities: options.requiredCapabilities ?? [],\n    priority: options.priority ?? 'medium',\n    complexity: options.complexity ?? 0.5,\n  };\n}\n"],"names":[],"mappings":";AAuGO,MAAM,yBAAyB;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAY,SAAqC,IAAI;AACnD,SAAK,SAAS;AAAA,MACZ,cAAc;AAAA,MACd,eAAe;AAAA,MACf,sBAAsB;AAAA,MACtB,kBAAkB;AAAA,MAClB,GAAG;AAAA,IAAA;AAEL,SAAK,qCAAqB,IAAA;AAC1B,SAAK,mBAAmB,CAAA;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,gBACJ,MACA,iBAC+B;AAE/B,SAAK,mBAAmB,CAAA;AAGxB,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,CAAA;AAAA,IACT;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAEhC,YAAM,QAAQ,gBAAgB,CAAC;AAC/B,YAAM,gBAAgB,KAAK,uBAAuB,OAAO,IAAI;AAC7D,YAAM,gBAAoC;AAAA,QACxC,SAAS,MAAM;AAAA,QACf,WAAW,MAAM;AAAA,QACjB,oBAAoB;AAAA,QACpB,oBAAoB;AAAA,QACpB,mBAAmB;AAAA,QACnB,SAAS;AAAA,MAAA;AAEX,WAAK,eAAe,IAAI,MAAM,IAAI,aAAa;AAC/C,aAAO,CAAC,aAAa;AAAA,IACvB;AAGA,SAAK,yBAAyB,iBAAiB,IAAI;AAGnD,QAAI,YAAY;AAChB,QAAI,YAAY;AAEhB,SAAK,YAAY,GAAG,YAAY,KAAK,OAAO,eAAe,aAAa;AACtE,YAAM,YAAY,KAAK,uBAAA;AAGvB,iBAAW,SAAS,iBAAiB;AACnC,aAAK,yBAAyB,OAAO,MAAM,eAAe;AAAA,MAC5D;AAGA,WAAK,wBAAA;AAGL,UAAI,KAAK,aAAa,SAAS,GAAG;AAChC,oBAAY;AACZ;AAAA,MACF;AAGA,WAAK,iBAAiB,KAAK;AAAA,QACzB;AAAA,QACA,cAAc,KAAK,sBAAA;AAAA,MAAsB,CAC1C;AAAA,IACH;AAGA,QAAI,CAAC,WAAW;AACd,cAAQ;AAAA,QACN,sCAAsC,KAAK,OAAO,aAAa;AAAA,MAAA;AAAA,IAEnE;AAGA,WAAO,CAAC,GAAG,KAAK,eAAe,QAAQ,EACpC,OAAO,CAAA,MAAK,EAAE,qBAAqB,CAAC,EACpC,KAAK,CAAC,GAAG,MAAM,EAAE,qBAAqB,EAAE,kBAAkB;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,gBACJ,MACA,iBACA,GACsB;AACtB,UAAM,cAAc,MAAM,KAAK,gBAAgB,MAAM,eAAe;AACpE,WAAO,YACJ,MAAM,GAAG,CAAC,EACV,IAAI,CAAA,MAAK,gBAAgB,KAAK,CAAA,MAAK,EAAE,OAAO,EAAE,OAAO,CAAE,EACvD,OAAO,OAAO;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,sBAA0E;AACxE,WAAO,CAAC,GAAG,KAAK,gBAAgB;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAqD;AACnD,WAAO,IAAI,IAAI,KAAK,cAAc;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKA,YAA+B;AAC7B,WAAO,EAAE,GAAG,KAAK,OAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,yBAAyB,QAAqB,MAAkB;AACtE,SAAK,eAAe,MAAA;AACpB,UAAM,eAAe,IAAM,OAAO;AAElC,eAAW,SAAS,QAAQ;AAC1B,YAAM,gBAAgB,KAAK,uBAAuB,OAAO,IAAI;AAC7D,WAAK,eAAe,IAAI,MAAM,IAAI;AAAA,QAChC,SAAS,MAAM;AAAA,QACf,WAAW,MAAM;AAAA,QACjB,oBAAoB;AAAA,QACpB,oBAAoB;AAAA,QACpB,mBAAmB;AAAA,QACnB,SAAS;AAAA,MAAA,CACV;AAAA,IACH;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,yBACN,OACA,MACA,WACM;AACN,UAAM,gBAAgB,KAAK,eAAe,IAAI,MAAM,EAAE;AACtD,QAAI,CAAC,cAAe;AAGpB,UAAM,UACJ,cAAc,qBAAqB,cAAc;AAGnD,UAAM,cAAc,KAAK,qBAAqB,OAAO,SAAS;AAG9D,kBAAc,oBAAoB,cAAc;AAGhD,UAAM,aAAa,UAAU,cAAc;AAC3C,kBAAc,UAAU;AAKxB,UAAM,QAAQ,KAAK,OAAO,gBAAgB,aAAa;AAEvD,kBAAc,qBAAqB,KAAK;AAAA,MACtC;AAAA,MACA,KAAK,IAAI,GAAG,cAAc,qBAAqB,KAAK;AAAA,IAAA;AAItD,QAAI,cAAc,qBAAqB,KAAK,OAAO,kBAAkB;AACnE,oBAAc,qBAAqB;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,0BAAgC;AACtC,UAAM,QAAQ,CAAC,GAAG,KAAK,eAAe,OAAA,CAAQ,EAAE;AAAA,MAC9C,CAAC,KAAK,MAAM,MAAM,EAAE;AAAA,MACpB;AAAA,IAAA;AAGF,QAAI,QAAQ,GAAG;AACb,iBAAW,KAAK,KAAK,eAAe,OAAA,GAAU;AAC5C,UAAE,qBAAqB,EAAE,qBAAqB;AAAA,MAChD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,uBAAuB,OAAkB,MAAoB;AAE3D,UAAM,eAAe,IAAI,IAAI,KAAK,oBAAoB;AACtD,UAAM,YAAY,IAAI,IAAI,MAAM,gBAAgB,CAAA,CAAE;AAElD,QAAI,aAAa;AACjB,eAAW,OAAO,cAAc;AAC9B,UAAI,UAAU,IAAI,GAAG,EAAG;AAAA,IAC1B;AAEA,UAAM,kBACJ,aAAa,OAAO,IAAI,aAAa,aAAa,OAAO;AAG3D,UAAM,YAAY,KAAK,aAAa,MAAM,MAAM,IAAI;AAGpD,WAAO,kBAAkB,MAAM,YAAY;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,WAAsB,MAAoB;AACrD,UAAM,OAAO,KAAK,YAAY,YAAA;AAG9B,UAAM,WAAwC;AAAA,MAC5C,QAAQ,CAAC,UAAU,QAAQ;AAAA,MAC3B,MAAM,CAAC,UAAU,MAAM;AAAA,MACvB,MAAM,CAAC,UAAU,KAAK;AAAA,MACtB,WAAW,CAAC,UAAU,KAAK;AAAA,MAC3B,UAAU,CAAC,UAAU,UAAU;AAAA,MAC/B,MAAM,CAAC,UAAU,OAAO;AAAA,MACxB,UAAU,CAAC,UAAU,SAAS;AAAA,MAC9B,UAAU,CAAC,UAAU,UAAU;AAAA,MAC/B,SAAS,CAAC,UAAU,OAAO;AAAA,MAC3B,WAAW,CAAC,UAAU,SAAS;AAAA,MAC/B,QAAQ,CAAC,UAAU,SAAS;AAAA,MAC5B,YAAY,CAAC,UAAU,WAAW;AAAA,IAAA;AAGpC,eAAW,CAAC,SAAS,KAAK,KAAK,OAAO,QAAQ,QAAQ,GAAG;AACvD,UAAI,KAAK,SAAS,OAAO,KAAK,MAAM,SAAS,SAAS,GAAG;AACvD,eAAO;AAAA,MACT;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,qBAAqB,OAAkB,WAAgC;AACrE,QAAI,cAAc;AAElB,eAAW,SAAS,WAAW;AAC7B,UAAI,MAAM,OAAO,MAAM,GAAI;AAE3B,YAAM,UAAU,KAAK,kBAAkB,OAAO,KAAK;AACnD,YAAM,qBAAqB,KAAK,eAAe,IAAI,MAAM,EAAE;AAC3D,UAAI,oBAAoB;AACtB,uBAAe,UAAU,mBAAmB;AAAA,MAC9C;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,kBAAkB,GAAc,GAAsB;AACpD,UAAM,QAAQ,IAAI,IAAI,EAAE,gBAAgB,CAAA,CAAE;AAC1C,UAAM,QAAQ,IAAI,IAAI,EAAE,gBAAgB,CAAA,CAAE;AAE1C,QAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;AAExC,aAAO,EAAE,SAAS,EAAE,OAAO,MAAM;AAAA,IACnC;AAEA,QAAI,UAAU;AACd,eAAW,OAAO,OAAO;AACvB,UAAI,MAAM,IAAI,GAAG,EAAG;AAAA,IACtB;AAGA,WAAO,UAAU,KAAK,IAAI,MAAM,MAAM,MAAM,IAAI;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,yBAA8C;AACpD,UAAM,+BAAe,IAAA;AACrB,eAAW,CAAC,IAAI,CAAC,KAAK,KAAK,gBAAgB;AACzC,eAAS,IAAI,IAAI,EAAE,kBAAkB;AAAA,IACvC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,WAAyC;AAC5D,QAAI,WAAW;AAEf,eAAW,CAAC,IAAI,CAAC,KAAK,KAAK,gBAAgB;AACzC,YAAM,OAAO,UAAU,IAAI,EAAE,KAAK;AAClC,YAAM,QAAQ,KAAK,IAAI,EAAE,qBAAqB,IAAI;AAClD,iBAAW,KAAK,IAAI,UAAU,KAAK;AAAA,IACrC;AAEA,WAAO,WAAW,KAAK,OAAO;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,wBAAgC;AAC9B,WAAO,CAAC,GAAG,KAAK,eAAe,OAAA,CAAQ,EAAE;AAAA,MACvC,CAAC,KAAK,MAAM,MAAM,EAAE;AAAA,MACpB;AAAA,IAAA;AAAA,EAEJ;AACF;AASO,SAAS,+BACd,QAC0B;AAC1B,SAAO,IAAI,yBAAyB,MAAM;AAC5C;AAKO,SAAS,sBACd,IACA,aACA,UAII,CAAA,GACE;AACN,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,sBAAsB,QAAQ,wBAAwB,CAAA;AAAA,IACtD,UAAU,QAAQ,YAAY;AAAA,IAC9B,YAAY,QAAQ,cAAc;AAAA,EAAA;AAEtC;"}