@aquex/cmos-mcp 1.0.0

package/dist/intelligence/complexity-scorer.js

@@ -0,0 +1,299 @@
+"use strict";
+/**
+ * Mission Complexity Scorer
+ *
+ * Implements the Composite Complexity Score (CCS) framework from research mission R4.2.
+ * Combines Token Score, Structural Score, Time Horizon Score, and Computational Complexity
+ * to determine when a mission should be split.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ComplexityScorer = void 0;
+const abort_1 = require("../utils/abort");
+/**
+ * Default configuration values
+ */
+const DEFAULT_WEIGHTS = {
+    token: 0.35,
+    structural: 0.25,
+    timeHorizon: 0.3,
+    computational: 0.1,
+};
+const DEFAULT_THRESHOLDS = {
+    compositeScore: 8.0, // On a scale of 1-10
+    tokenPercentage: 0.8, // 80% of context window
+    timeHorizonMultiplier: 1.5, // 150% of agent's capability
+};
+/**
+ * Procedural dependency keywords that signal atomic operations
+ */
+const DEPENDENCY_KEYWORDS = [
+    'then',
+    'next',
+    'after',
+    'once',
+    'before',
+    'first',
+    'second',
+    'third',
+    'finally',
+    'subsequently',
+    'following',
+    'preceding',
+];
+/**
+ * Complexity indicators in mission text
+ */
+const COMPLEXITY_INDICATORS = {
+    loops: /\b(for each|while|iterate|loop|repeat)\b/gi,
+    conditionals: /\b(if|else|when|unless|depending|whether)\b/gi,
+    nested: /\b(nested|hierarchical|multi-level|recursive)\b/gi,
+    integration: /\b(integrate|connect|combine|merge|sync)\b/gi,
+    optimization: /\b(optimize|improve|refactor|enhance)\b/gi,
+};
+/**
+ * ComplexityScorer class
+ *
+ * Calculates the Composite Complexity Score (CCS) for missions
+ */
+class ComplexityScorer {
+    constructor(tokenCounter, config) {
+        this.tokenCounter = tokenCounter;
+        this.config = {
+            ...config,
+            weights: config.weights || DEFAULT_WEIGHTS,
+            thresholds: config.thresholds || DEFAULT_THRESHOLDS,
+        };
+    }
+    /**
+     * Calculate the Composite Complexity Score for a mission
+     */
+    async calculateCCS(mission, options = {}) {
+        const { signal } = options;
+        (0, abort_1.throwIfAborted)(signal, 'Complexity scoring aborted');
+        const missionText = typeof mission === 'string' ? mission : this.serializeMission(mission);
+        const missionObj = typeof mission === 'string' ? null : mission;
+        // Calculate individual components
+        const tokenCount = await this.tokenCounter.count(missionText, this.config.model, options);
+        (0, abort_1.throwIfAborted)(signal, 'Complexity scoring aborted');
+        const tokenScore = this.calculateTokenScoreFromCount(tokenCount.count);
+        const structuralScore = this.calculateStructuralScore(missionText, missionObj);
+        (0, abort_1.throwIfAborted)(signal, 'Complexity scoring aborted');
+        const timeHorizonScore = this.calculateTimeHorizonScore(missionText, missionObj);
+        const computationalScore = this.calculateComputationalScore(missionText);
+        const components = {
+            tokenScore,
+            structuralScore,
+            timeHorizonScore,
+            computationalScore,
+        };
+        // Calculate composite score using weighted sum
+        const compositeScore = this.computeCompositeScore(components);
+        // Determine if split is needed
+        const { shouldSplit, reasons } = this.evaluateSplitNeed(compositeScore, components);
+        (0, abort_1.throwIfAborted)(signal, 'Complexity scoring aborted');
+        const analysis = {
+            compositeScore,
+            components,
+            shouldSplit,
+            reasons,
+            estimatedHumanHours: this.estimateHumanHours(missionText, missionObj),
+            tokenDetails: tokenCount,
+        };
+        (0, abort_1.throwIfAborted)(signal, 'Complexity scoring aborted');
+        return analysis;
+    }
+    /**
+     * Token Score (TS): Normalized score representing proximity to context limit
+     * TS = mission_token_count / model_context_window
+     */
+    calculateTokenScoreFromCount(tokenCount) {
+        const ratio = tokenCount / this.config.contextWindow;
+        // Normalize to 0-10 scale, with 1.0 ratio = 10
+        return Math.min(ratio * 10, 10);
+    }
+    /**
+     * Structural Score (SS): Static analysis of mission complexity
+     * Analyzes discrete instructions, logical operators, nested goals, dependencies
+     */
+    calculateStructuralScore(missionText, mission) {
+        let score = 0;
+        // Count discrete instructions (bullet points, numbered items, sentences)
+        const instructions = this.countInstructions(missionText);
+        score += Math.min(instructions / 20, 3); // Max 3 points for instructions
+        // Count logical operators
+        const logicalOps = this.countLogicalOperators(missionText);
+        score += Math.min(logicalOps / 10, 2); // Max 2 points for operators
+        // Count dependencies
+        if (mission?.context?.dependencies) {
+            score += Math.min(mission.context.dependencies.length / 5, 2); // Max 2 points for dependencies
+        }
+        // Count nested structures (indentation, sub-items)
+        const nestingLevel = this.estimateNestingLevel(missionText);
+        score += Math.min(nestingLevel, 2); // Max 2 points for nesting
+        // Count deliverables (more deliverables = more complex)
+        if (mission?.deliverables) {
+            score += Math.min(mission.deliverables.length / 10, 1); // Max 1 point for deliverables
+        }
+        return Math.min(score, 10); // Normalize to 0-10
+    }
+    /**
+     * Time Horizon Score (THS): Ratio of estimated duration to agent capability
+     * THS = estimated_human_completion_time / agent_time_horizon
+     */
+    calculateTimeHorizonScore(missionText, mission) {
+        const estimatedMinutes = this.estimateHumanHours(missionText, mission) * 60;
+        const ratio = estimatedMinutes / this.config.agentTimeHorizon;
+        // Normalize to 0-10 scale, with ratio > 1.0 indicating exceeding capacity
+        return Math.min(ratio * 5, 10); // ratio of 2.0 = score of 10
+    }
+    /**
+     * Computational Complexity Score: Assessment of algorithmic complexity
+     * Distinguishes between O(n) and O(2^n) operations
+     */
+    calculateComputationalScore(missionText) {
+        let score = 0;
+        // Check for complexity indicators
+        for (const [type, pattern] of Object.entries(COMPLEXITY_INDICATORS)) {
+            const matches = (missionText.match(pattern) || []).length;
+            if (type === 'nested' || type === 'optimization') {
+                score += matches * 1.5; // Higher weight for nested/optimization
+            }
+            else {
+                score += matches * 0.5;
+            }
+        }
+        // Check for exponential complexity keywords
+        const exponentialKeywords = /\b(all combinations|permutations|exponential|factorial|brute[ -]?force)\b/gi;
+        const exponentialMatches = (missionText.match(exponentialKeywords) || []).length;
+        score += exponentialMatches * 3;
+        return Math.min(score, 10); // Normalize to 0-10
+    }
+    /**
+     * Compute the weighted composite score
+     */
+    computeCompositeScore(components) {
+        const { weights } = this.config;
+        const score = weights.token * components.tokenScore +
+            weights.structural * components.structuralScore +
+            weights.timeHorizon * components.timeHorizonScore +
+            weights.computational * components.computationalScore;
+        return Math.min(score, 10); // Ensure 0-10 range
+    }
+    /**
+     * Evaluate whether mission should be split
+     */
+    evaluateSplitNeed(compositeScore, components) {
+        const reasons = [];
+        let shouldSplit = false;
+        // Check composite score threshold
+        if (compositeScore > this.config.thresholds.compositeScore) {
+            shouldSplit = true;
+            reasons.push(`Composite complexity score (${compositeScore.toFixed(2)}) exceeds threshold (${this.config.thresholds.compositeScore})`);
+        }
+        // Check token threshold
+        const tokenRatio = components.tokenScore / 10; // Convert back to ratio
+        if (tokenRatio > this.config.thresholds.tokenPercentage) {
+            shouldSplit = true;
+            reasons.push(`Token count at ${(tokenRatio * 100).toFixed(0)}% of context window`);
+        }
+        // Check time horizon threshold
+        const timeRatio = components.timeHorizonScore / 5; // Convert back to ratio
+        if (timeRatio > this.config.thresholds.timeHorizonMultiplier) {
+            shouldSplit = true;
+            reasons.push(`Estimated duration exceeds agent time horizon by ${((timeRatio - 1) * 100).toFixed(0)}%`);
+        }
+        return { shouldSplit, reasons };
+    }
+    /**
+     * Estimate human completion time in hours
+     */
+    estimateHumanHours(missionText, mission) {
+        // Base estimate on word count (avg reading speed ~200 wpm)
+        const words = missionText.split(/\s+/).length;
+        let hours = words / 200 / 60; // Convert to hours
+        // Adjust based on deliverables (30 min per deliverable)
+        if (mission?.deliverables) {
+            hours += mission.deliverables.length * 0.5;
+        }
+        // Adjust based on success criteria (15 min per criterion)
+        if (mission?.successCriteria) {
+            hours += mission.successCriteria.length * 0.25;
+        }
+        // Adjust for complexity indicators
+        for (const pattern of Object.values(COMPLEXITY_INDICATORS)) {
+            const matches = (missionText.match(pattern) || []).length;
+            hours += matches * 0.5; // 30 min per complexity indicator
+        }
+        return Math.max(hours, 0.5); // Minimum 30 minutes
+    }
+    /**
+     * Count discrete instructions in mission text
+     */
+    countInstructions(text) {
+        // Count numbered items
+        const numberedItems = (text.match(/^\s*\d+[.)]\s+/gm) || []).length;
+        // Count bullet points
+        const bulletPoints = (text.match(/^\s*[-*+]\s+/gm) || []).length;
+        // Count sentences with imperative verbs (crude estimate)
+        const imperativeVerbs = /\b(create|build|implement|write|test|verify|ensure|update|add|remove|delete|check|validate|generate)\b/gi;
+        const sentences = text.split(/[.!?]+/).filter((s) => s.trim().length > 0);
+        const imperativeSentences = sentences.filter((s) => imperativeVerbs.test(s)).length;
+        return Math.max(numberedItems, bulletPoints, imperativeSentences);
+    }
+    /**
+     * Count logical operators in text
+     */
+    countLogicalOperators(text) {
+        let count = 0;
+        // Count conditionals
+        count += (text.match(COMPLEXITY_INDICATORS.conditionals) || []).length;
+        // Count loops
+        count += (text.match(COMPLEXITY_INDICATORS.loops) || []).length;
+        // Count dependency keywords
+        for (const keyword of DEPENDENCY_KEYWORDS) {
+            const regex = new RegExp(`\\b${keyword}\\b`, 'gi');
+            count += (text.match(regex) || []).length;
+        }
+        return count;
+    }
+    /**
+     * Estimate nesting level from indentation
+     */
+    estimateNestingLevel(text) {
+        const lines = text.split('\n');
+        let maxNesting = 0;
+        for (const line of lines) {
+            // Count leading spaces/tabs
+            const leadingWhitespace = line.match(/^[\s\t]*/)?.[0] || '';
+            const spaces = leadingWhitespace.replace(/\t/g, '  ').length;
+            const nestingLevel = Math.floor(spaces / 2);
+            maxNesting = Math.max(maxNesting, nestingLevel);
+        }
+        return maxNesting;
+    }
+    /**
+     * Serialize mission object to text for analysis
+     */
+    serializeMission(mission) {
+        const parts = [
+            `Mission ID: ${mission.missionId}`,
+            `\nObjective: ${mission.objective}`,
+        ];
+        if (mission.context) {
+            if (mission.context.background) {
+                parts.push(`\nContext: ${mission.context.background}`);
+            }
+            if (mission.context.dependencies?.length) {
+                parts.push(`\nDependencies: ${mission.context.dependencies.join(', ')}`);
+            }
+            if (mission.context.constraints?.length) {
+                parts.push(`\nConstraints: ${mission.context.constraints.join(', ')}`);
+            }
+        }
+        parts.push(`\nSuccess Criteria:\n${mission.successCriteria.map((c, i) => `${i + 1}. ${c}`).join('\n')}`);
+        parts.push(`\nDeliverables:\n${mission.deliverables.map((d, i) => `${i + 1}. ${d}`).join('\n')}`);
+        return parts.join('');
+    }
+}
+exports.ComplexityScorer = ComplexityScorer;
+//# sourceMappingURL=complexity-scorer.js.map

package/dist/intelligence/complexity-scorer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-scorer.js","sourceRoot":"","sources":["../../src/intelligence/complexity-scorer.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAIH,0CAAgD;AA4ChD;;GAEG;AACH,MAAM,eAAe,GAAG;IACtB,KAAK,EAAE,IAAI;IACX,UAAU,EAAE,IAAI;IAChB,WAAW,EAAE,GAAG;IAChB,aAAa,EAAE,GAAG;CACnB,CAAC;AAEF,MAAM,kBAAkB,GAAG;IACzB,cAAc,EAAE,GAAG,EAAE,qBAAqB;IAC1C,eAAe,EAAE,GAAG,EAAE,wBAAwB;IAC9C,qBAAqB,EAAE,GAAG,EAAE,6BAA6B;CAC1D,CAAC;AAEF;;GAEG;AACH,MAAM,mBAAmB,GAAG;IAC1B,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,OAAO;IACP,SAAS;IACT,cAAc;IACd,WAAW;IACX,WAAW;CACZ,CAAC;AAEF;;GAEG;AACH,MAAM,qBAAqB,GAAG;IAC5B,KAAK,EAAE,4CAA4C;IACnD,YAAY,EAAE,+CAA+C;IAC7D,MAAM,EAAE,mDAAmD;IAC3D,WAAW,EAAE,8CAA8C;IAC3D,YAAY,EAAE,2CAA2C;CAC1D,CAAC;AAEF;;;;GAIG;AACH,MAAa,gBAAgB;IAI3B,YAAY,YAA2B,EAAE,MAA8B;QACrE,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG;YACZ,GAAG,MAAM;YACT,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,eAAe;YAC1C,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,kBAAkB;SACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,OAAgC,EAChC,UAA4B,EAAE;QAE9B,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAC3B,IAAA,sBAAc,EAAC,MAAM,EAAE,4BAA4B,CAAC,CAAC;QAErD,MAAM,WAAW,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3F,MAAM,UAAU,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;QAEhE,kCAAkC;QAClC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC1F,IAAA,sBAAc,EAAC,MAAM,EAAE,4BAA4B,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvE,MAAM,eAAe,GAAG,IAAI,CAAC,wBAAwB,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QAC/E,IAAA,sBAAc,EAAC,MAAM,EAAE,4BAA4B,CAAC,CAAC;QACrD,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACjF,MAAM,kBAAkB,GAAG,IAAI,CAAC,2BAA2B,CAAC,WAAW,CAAC,CAAC;QAEzE,MAAM,UAAU,GAAyB;YACvC,UAAU;YACV,eAAe;YACf,gBAAgB;YAChB,kBAAkB;SACnB,CAAC;QAEF,+CAA+C;QAC/C,MAAM,cAAc,GAAG,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAE9D,+BAA+B;QAC/B,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;QAEpF,IAAA,sBAAc,EAAC,MAAM,EAAE,4BAA4B,CAAC,CAAC;QAErD,MAAM,QAAQ,GAAuB;YACnC,cAAc;YACd,UAAU;YACV,WAAW;YACX,OAAO;YACP,mBAAmB,EAAE,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,UAAU,CAAC;YACrE,YAAY,EAAE,UAAU;SACzB,CAAC;QAEF,IAAA,sBAAc,EAAC,MAAM,EAAE,4BAA4B,CAAC,CAAC;QAErD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,4BAA4B,CAAC,UAAkB;QACrD,MAAM,KAAK,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAErD,+CAA+C;QAC/C,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACK,wBAAwB,CAAC,WAAmB,EAAE,OAA8B;QAClF,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,yEAAyE;QACzE,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;QACzD,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,gCAAgC;QAEzE,0BAA0B;QAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAC3D,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,6BAA6B;QAEpE,qBAAqB;QACrB,IAAI,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;YACnC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gCAAgC;QACjG,CAAC;QAED,mDAAmD;QACnD,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,WAAW,CAAC,CAAC;QAC5D,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,2BAA2B;QAE/D,wDAAwD;QACxD,IAAI,OAAO,EAAE,YAAY,EAAE,CAAC;YAC1B,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,+BAA+B;QACzF,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;IAClD,CAAC;IAED;;;OAGG;IACK,yBAAyB,CAAC,WAAmB,EAAE,OAA8B;QACnF,MAAM,gBAAgB,GAAG,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAC5E,MAAM,KAAK,GAAG,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC;QAE9D,0EAA0E;QAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,6BAA6B;IAC/D,CAAC;IAED;;;OAGG;IACK,2BAA2B,CAAC,WAAmB;QACrD,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,kCAAkC;QAClC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC,EAAE,CAAC;YACpE,MAAM,OAAO,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YAC1D,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC;gBACjD,KAAK,IAAI,OAAO,GAAG,GAAG,CAAC,CAAC,wCAAwC;YAClE,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,OAAO,GAAG,GAAG,CAAC;YACzB,CAAC;QACH,CAAC;QAED,4CAA4C;QAC5C,MAAM,mBAAmB,GACvB,6EAA6E,CAAC;QAChF,MAAM,kBAAkB,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QACjF,KAAK,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAEhC,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;IAClD,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,UAAgC;QAC5D,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QAEhC,MAAM,KAAK,GACT,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,UAAU;YACrC,OAAO,CAAC,UAAU,GAAG,UAAU,CAAC,eAAe;YAC/C,OAAO,CAAC,WAAW,GAAG,UAAU,CAAC,gBAAgB;YACjD,OAAO,CAAC,aAAa,GAAG,UAAU,CAAC,kBAAkB,CAAC;QAExD,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;IAClD,CAAC;IAED;;OAEG;IACK,iBAAiB,CACvB,cAAsB,EACtB,UAAgC;QAEhC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,kCAAkC;QAClC,IAAI,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC;YAC3D,WAAW,GAAG,IAAI,CAAC;YACnB,OAAO,CAAC,IAAI,CACV,+BAA+B,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,wBAAwB,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,cAAc,GAAG,CACzH,CAAC;QACJ,CAAC;QAED,wBAAwB;QACxB,MAAM,UAAU,GAAG,UAAU,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC,wBAAwB;QACvE,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,eAAe,EAAE,CAAC;YACxD,WAAW,GAAG,IAAI,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC;QACrF,CAAC;QAED,+BAA+B;QAC/B,MAAM,SAAS,GAAG,UAAU,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,wBAAwB;QAC3E,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,qBAAqB,EAAE,CAAC;YAC7D,WAAW,GAAG,IAAI,CAAC;YACnB,OAAO,CAAC,IAAI,CACV,oDAAoD,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAC1F,CAAC;QACJ,CAAC;QAED,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,WAAmB,EAAE,OAA8B;QAC5E,2DAA2D;QAC3D,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;QAC9C,IAAI,KAAK,GAAG,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,mBAAmB;QAEjD,wDAAwD;QACxD,IAAI,OAAO,EAAE,YAAY,EAAE,CAAC;YAC1B,KAAK,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,GAAG,CAAC;QAC7C,CAAC;QAED,0DAA0D;QAC1D,IAAI,OAAO,EAAE,eAAe,EAAE,CAAC;YAC7B,KAAK,IAAI,OAAO,CAAC,eAAe,CAAC,MAAM,GAAG,IAAI,CAAC;QACjD,CAAC;QAED,mCAAmC;QACnC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,EAAE,CAAC;YAC3D,MAAM,OAAO,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YAC1D,KAAK,IAAI,OAAO,GAAG,GAAG,CAAC,CAAC,kCAAkC;QAC5D,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,qBAAqB;IACpD,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,IAAY;QACpC,uBAAuB;QACvB,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAEpE,sBAAsB;QACtB,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAEjE,yDAAyD;QACzD,MAAM,eAAe,GACnB,0GAA0G,CAAC;QAC7G,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1E,MAAM,mBAAmB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAEpF,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,YAAY,EAAE,mBAAmB,CAAC,CAAC;IACpE,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,IAAY;QACxC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,qBAAqB;QACrB,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAEvE,cAAc;QACd,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAEhE,4BAA4B;QAC5B,KAAK,MAAM,OAAO,IAAI,mBAAmB,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,MAAM,OAAO,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAC5C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,IAAY;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,4BAA4B;YAC5B,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5D,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;YAC7D,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE5C,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,OAAuB;QAC9C,MAAM,KAAK,GAAa;YACtB,eAAe,OAAO,CAAC,SAAS,EAAE;YAClC,gBAAgB,OAAO,CAAC,SAAS,EAAE;SACpC,CAAC;QAEF,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CAAC,cAAc,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;YACzD,CAAC;YACD,IAAI,OAAO,CAAC,OAAO,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC;gBACzC,KAAK,CAAC,IAAI,CAAC,mBAAmB,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,IAAI,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;gBACxC,KAAK,CAAC,IAAI,CAAC,kBAAkB,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CACR,wBAAwB,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC7F,CAAC;QACF,KAAK,CAAC,IAAI,CACR,oBAAoB,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACtF,CAAC;QAEF,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;CACF;AAzTD,4CAyTC"}

package/dist/intelligence/compression-rules.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Compression Rules
+ *
+ * Implements the multi-pass compression pipeline from R4.1:
+ * Pass 1: Sanitization (remove fillers and redundancy)
+ * Pass 2: Structural Refactoring (prose to lists/structured data)
+ * Pass 3: Linguistic Simplification (passive to active, sentence simplification)
+ */
+import { CompressionRule, CompressionRuleset, CompressionLevel } from './types';
+/**
+ * Default compression rules for sanitization pass
+ */
+export declare const sanitizationRules: CompressionRule[];
+/**
+ * Default structural refactoring rules
+ */
+export declare const structuralRules: CompressionRule[];
+/**
+ * Default linguistic simplification rules
+ */
+export declare const linguisticRules: CompressionRule[];
+/**
+ * Preserve patterns - content matching these should not be compressed
+ */
+export declare const defaultPreservePatterns: RegExp[];
+/**
+ * Get default ruleset for a compression level
+ */
+export declare function getDefaultRuleset(level: CompressionLevel): CompressionRuleset;
+/**
+ * Apply sanitization rules to text
+ */
+export declare function applySanitization(text: string, rules: CompressionRule[]): string;
+/**
+ * Convert prose to list format
+ */
+export declare function convertProseToList(text: string, delimiters: string[]): string;
+/**
+ * Convert passive voice to active (simplified heuristic)
+ */
+export declare function convertPassiveToActive(text: string): string;
+/**
+ * Apply structural refactoring rules
+ */
+export declare function applyStructuralRefactoring(text: string, rules: CompressionRule[]): string;
+/**
+ * Apply linguistic simplification rules
+ */
+export declare function applyLinguisticSimplification(text: string, rules: CompressionRule[]): string;
+/**
+ * Extract preserved sections from text
+ */
+export declare function extractPreservedSections(text: string, patterns: RegExp[]): Map<string, string>;
+/**
+ * Replace preserved sections with placeholders
+ */
+export declare function replaceWithPlaceholders(text: string, preserved: Map<string, string>): string;
+/**
+ * Restore preserved sections from placeholders
+ */
+export declare function restorePreservedSections(text: string, preserved: Map<string, string>): string;
+//# sourceMappingURL=compression-rules.d.ts.map

package/dist/intelligence/compression-rules.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compression-rules.d.ts","sourceRoot":"","sources":["../../src/intelligence/compression-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAEhF;;GAEG;AACH,eAAO,MAAM,iBAAiB,EAAE,eAAe,EAgE9C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,eAAe,EAW5C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,eAAe,EA8B5C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,uBAAuB,EAAE,MAAM,EAI3C,CAAC;AAEF;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,GAAG,kBAAkB,CA6B7E;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CAehF;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,MAAM,CA0B7E;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAc3D;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CAYzF;AAED;;GAEG;AACH,wBAAgB,6BAA6B,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CAkB5F;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAc9F;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAQ5F;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAQ7F"}

package/dist/intelligence/compression-rules.js

@@ -0,0 +1,303 @@
+"use strict";
+/**
+ * Compression Rules
+ *
+ * Implements the multi-pass compression pipeline from R4.1:
+ * Pass 1: Sanitization (remove fillers and redundancy)
+ * Pass 2: Structural Refactoring (prose to lists/structured data)
+ * Pass 3: Linguistic Simplification (passive to active, sentence simplification)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultPreservePatterns = exports.linguisticRules = exports.structuralRules = exports.sanitizationRules = void 0;
+exports.getDefaultRuleset = getDefaultRuleset;
+exports.applySanitization = applySanitization;
+exports.convertProseToList = convertProseToList;
+exports.convertPassiveToActive = convertPassiveToActive;
+exports.applyStructuralRefactoring = applyStructuralRefactoring;
+exports.applyLinguisticSimplification = applyLinguisticSimplification;
+exports.extractPreservedSections = extractPreservedSections;
+exports.replaceWithPlaceholders = replaceWithPlaceholders;
+exports.restorePreservedSections = restorePreservedSections;
+/**
+ * Default compression rules for sanitization pass
+ */
+exports.sanitizationRules = [
+    // Remove conversational fillers
+    {
+        type: 'regex_replace',
+        pattern: /could you (please )?(explain|generate|provide|create|write|implement)/gi,
+        replacement: '$2',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /I (was wondering|would like|need you to)/gi,
+        replacement: '',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /in order to/gi,
+        replacement: 'to',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /it would be great if you could/gi,
+        replacement: '',
+        enabled: true,
+    },
+    // Remove redundant phrases
+    {
+        type: 'regex_replace',
+        pattern: /provide a detailed explanation of/gi,
+        replacement: 'explain',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /the purpose of this is to/gi,
+        replacement: 'purpose:',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /as you can see/gi,
+        replacement: '',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /it is important to note that/gi,
+        replacement: 'note:',
+        enabled: true,
+    },
+    // Normalize whitespace
+    {
+        type: 'regex_replace',
+        pattern: /\s+/g,
+        replacement: ' ',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /\n{3,}/g,
+        replacement: '\n\n',
+        enabled: true,
+    },
+];
+/**
+ * Default structural refactoring rules
+ */
+exports.structuralRules = [
+    {
+        type: 'convert_prose_to_list',
+        enabled: true,
+        delimiters: ['First,', 'Then,', 'Next,', 'Finally,', 'Lastly,'],
+    },
+    {
+        type: 'convert_prose_to_list',
+        enabled: true,
+        delimiters: ['1.', '2.', '3.', '4.', '5.'],
+    },
+];
+/**
+ * Default linguistic simplification rules
+ */
+exports.linguisticRules = [
+    {
+        type: 'convert_passive_to_active',
+        enabled: true,
+    },
+    // Simplify verbose constructions
+    {
+        type: 'regex_replace',
+        pattern: /is able to/gi,
+        replacement: 'can',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /has the ability to/gi,
+        replacement: 'can',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /at this point in time/gi,
+        replacement: 'now',
+        enabled: true,
+    },
+    {
+        type: 'regex_replace',
+        pattern: /due to the fact that/gi,
+        replacement: 'because',
+        enabled: true,
+    },
+];
+/**
+ * Preserve patterns - content matching these should not be compressed
+ */
+exports.defaultPreservePatterns = [
+    /<preserve>.*?<\/preserve>/gs,
+    /successCriteria:[\s\S]*?(?=\n\w+:|$)/g,
+    /constraintToRespect:[\s\S]*?(?=\n\w+:|$)/g,
+];
+/**
+ * Get default ruleset for a compression level
+ */
+function getDefaultRuleset(level) {
+    switch (level) {
+        case 'conservative':
+            return {
+                sanitizationRules: exports.sanitizationRules.filter((r) => r.type === 'regex_replace'),
+                structuralRules: [],
+                linguisticRules: [],
+                preservePatterns: exports.defaultPreservePatterns,
+            };
+        case 'balanced':
+            return {
+                sanitizationRules: exports.sanitizationRules,
+                structuralRules: exports.structuralRules,
+                linguisticRules: exports.linguisticRules.slice(0, 2), // Only simple replacements
+                preservePatterns: exports.defaultPreservePatterns,
+            };
+        case 'aggressive':
+            return {
+                sanitizationRules: exports.sanitizationRules,
+                structuralRules: exports.structuralRules,
+                linguisticRules: exports.linguisticRules,
+                preservePatterns: exports.defaultPreservePatterns,
+            };
+        default:
+            return getDefaultRuleset('balanced');
+    }
+}
+/**
+ * Apply sanitization rules to text
+ */
+function applySanitization(text, rules) {
+    let result = text;
+    for (const rule of rules) {
+        if (!rule.enabled || rule.type !== 'regex_replace')
+            continue;
+        if (!rule.pattern)
+            continue;
+        const pattern = rule.pattern instanceof RegExp
+            ? rule.pattern
+            : new RegExp(rule.pattern, rule.flags || undefined);
+        result = result.replace(pattern, rule.replacement || '');
+    }
+    return result;
+}
+/**
+ * Convert prose to list format
+ */
+function convertProseToList(text, delimiters) {
+    // Check if text contains sequential delimiters
+    let delimiterCount = 0;
+    for (const delimiter of delimiters) {
+        if (text.includes(delimiter)) {
+            delimiterCount++;
+        }
+    }
+    // Only convert if we have multiple sequential items
+    if (delimiterCount < 2) {
+        return text;
+    }
+    // Split by delimiters and create a list
+    let result = text;
+    for (const delimiter of delimiters) {
+        // Create list item format
+        const delimiterRegex = new RegExp(`\\s*${delimiter.replace(/[.*+?^${}()|[\]\\]/g, '\\$&')}\\s*`, 'gi');
+        result = result.replace(delimiterRegex, '\n- ');
+    }
+    return result;
+}
+/**
+ * Convert passive voice to active (simplified heuristic)
+ */
+function convertPassiveToActive(text) {
+    // Simple pattern matching for common passive constructions
+    const passivePatterns = [
+        { pattern: /(\w+) should be (\w+ed) by (\w+)/gi, replacement: '$3 should $2 $1' },
+        { pattern: /(\w+) will be (\w+ed) by (\w+)/gi, replacement: '$3 will $2 $1' },
+        { pattern: /(\w+) is (\w+ed) by (\w+)/gi, replacement: '$3 $2s $1' },
+    ];
+    let result = text;
+    for (const { pattern, replacement } of passivePatterns) {
+        result = result.replace(pattern, replacement);
+    }
+    return result;
+}
+/**
+ * Apply structural refactoring rules
+ */
+function applyStructuralRefactoring(text, rules) {
+    let result = text;
+    for (const rule of rules) {
+        if (!rule.enabled)
+            continue;
+        if (rule.type === 'convert_prose_to_list' && rule.delimiters) {
+            result = convertProseToList(result, rule.delimiters);
+        }
+    }
+    return result;
+}
+/**
+ * Apply linguistic simplification rules
+ */
+function applyLinguisticSimplification(text, rules) {
+    let result = text;
+    for (const rule of rules) {
+        if (!rule.enabled)
+            continue;
+        if (rule.type === 'regex_replace' && rule.pattern) {
+            const pattern = rule.pattern instanceof RegExp
+                ? rule.pattern
+                : new RegExp(rule.pattern, rule.flags || undefined);
+            result = result.replace(pattern, rule.replacement || '');
+        }
+        else if (rule.type === 'convert_passive_to_active') {
+            result = convertPassiveToActive(result);
+        }
+    }
+    return result;
+}
+/**
+ * Extract preserved sections from text
+ */
+function extractPreservedSections(text, patterns) {
+    const preserved = new Map();
+    let index = 0;
+    for (const pattern of patterns) {
+        const matches = text.matchAll(pattern);
+        for (const match of matches) {
+            const placeholder = `__PRESERVED_${index}__`;
+            preserved.set(placeholder, match[0]);
+            index++;
+        }
+    }
+    return preserved;
+}
+/**
+ * Replace preserved sections with placeholders
+ */
+function replaceWithPlaceholders(text, preserved) {
+    let result = text;
+    for (const [placeholder, content] of preserved.entries()) {
+        result = result.replace(content, placeholder);
+    }
+    return result;
+}
+/**
+ * Restore preserved sections from placeholders
+ */
+function restorePreservedSections(text, preserved) {
+    let result = text;
+    for (const [placeholder, content] of preserved.entries()) {
+        result = result.replace(placeholder, content);
+    }
+    return result;
+}
+//# sourceMappingURL=compression-rules.js.map