@actrun_ai/tastekit-core 0.1.0

package/dist/domains/general-agent/skills/task-orchestration.js

@@ -0,0 +1,101 @@
+/**
+ * Task Orchestration Skill
+ *
+ * Turn mixed requests into an executable, tracked plan with clear checkpoints.
+ */
+export const TaskOrchestrationSkill = {
+    skill_id: 'task-orchestration',
+    name: 'Task Orchestration',
+    description: 'Plans and executes multi-step tasks with explicit checkpoints, constraints, and escalation points. Use when handling complex requests that combine planning and execution, multi-step workflows with dependencies, or when the user asks to plan, orchestrate, or manage a task.',
+    tags: ['general', 'planning', 'execution'],
+    risk_level: 'low',
+    required_tools: ['file-system'],
+    compatible_runtimes: ['claude-code', 'openclaw', 'manus', 'autopilots'],
+    prerequisites: ['context-synthesis'],
+    pipeline_phase: 'process',
+    context_model: 'inherit',
+    skill_md_content: `# Task Orchestration
+
+## Purpose
+
+Convert a goal into a concrete execution plan, then drive progress with explicit checkpoints, guardrails, and status updates.
+
+## When to use
+
+- Multi-step tasks with dependencies
+- Requests that combine planning, research, and execution
+- Work that needs milestones, handoffs, and risk tracking
+- Ongoing operator workflows with periodic reprioritization
+
+## When NOT to use
+
+- Single-step tasks that can be completed immediately
+- Work requiring deep domain-specific expertise where a specialized skill exists
+- Situations with insufficient context and no permission to clarify
+
+## Inputs
+
+- **goal**: Desired outcome
+- **constraints**: Time, budget, policy, tooling, or scope constraints
+- **context_snapshot**: Current state, assumptions, and known dependencies
+- **priority_rule**: Optional prioritization criteria (impact/urgency/risk)
+
+## Outputs
+
+- **execution_plan**: Ordered steps with dependencies and owners
+- **checkpoint_log**: Milestone updates, blockers, and next actions
+- **escalation_events**: Issues requiring approval or human decision
+
+## Procedure
+
+### Step 1: Frame the objective
+
+- Restate goal and success criteria in one concise block
+- Identify constraints and unknowns before execution
+
+### Step 2: Decompose and order work
+
+- Break into phases with step-level outputs
+- Mark dependencies and parallelizable tracks
+- Highlight irreversible or high-risk actions
+
+### Step 3: Execute with checkpoints
+
+- Run one step at a time unless safe parallelization is clear
+- After each checkpoint, report status, artifacts, and blockers
+- Re-prioritize if constraints or context change
+
+### Step 4: Escalate intentionally
+
+- Escalate on policy risk, destructive actions, missing authority, or ambiguity
+- Present options with tradeoffs when escalation is needed
+
+### Step 5: Close with a decision-ready summary
+
+- Report completed steps, residual risks, and recommended next action
+
+## Quality checks
+
+- [ ] Plan includes clear success criteria and constraints
+- [ ] Dependencies and ordering are explicit
+- [ ] Checkpoints include concrete evidence of progress
+- [ ] Escalation triggers were respected
+- [ ] Final summary is decision-ready and actionable
+
+## Guardrail notes
+
+Do not perform destructive or irreversible actions without explicit approval when guardrails require it.
+
+## Progressive Disclosure
+
+### Minimal Context (Always Load)
+- Goal, constraints, and current priority policy
+
+### On Invoke (Load When Skill is Invoked)
+- Full decomposition/checkpoint workflow and escalation rules
+
+### On Demand Resources
+- Reusable checklist templates and incident-style escalation format
+`,
+};
+//# sourceMappingURL=task-orchestration.js.map

package/dist/domains/general-agent/skills/task-orchestration.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-orchestration.js","sourceRoot":"","sources":["../../../../domains/general-agent/skills/task-orchestration.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,CAAC,MAAM,sBAAsB,GAAG;IACpC,QAAQ,EAAE,oBAAoB;IAC9B,IAAI,EAAE,oBAAoB;IAC1B,WAAW,EAAE,kRAAkR;IAC/R,IAAI,EAAE,CAAC,SAAS,EAAE,UAAU,EAAE,WAAW,CAAC;IAC1C,UAAU,EAAE,KAAc;IAC1B,cAAc,EAAE,CAAC,aAAa,CAAC;IAC/B,mBAAmB,EAAE,CAAC,aAAa,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,CAAC;IACvE,aAAa,EAAE,CAAC,mBAAmB,CAAC;IACpC,cAAc,EAAE,SAAS;IACzB,aAAa,EAAE,SAAkB;IAEjC,gBAAgB,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAkFnB;CACA,CAAC"}

package/dist/domains/index.d.ts

@@ -0,0 +1,21 @@
+/**
+ * TasteKit Domains Registry
+ *
+ * Central registry of available domains.
+ * Ships with general-agent + development-agent.
+ */
+import { DomainRubric } from '../interview/rubric.js';
+export declare const AVAILABLE_DOMAINS: readonly [import("./types.js").DomainDefinition, import("./types.js").DomainDefinition];
+export declare function getDomainById(id: string): import("./types.js").DomainDefinition | undefined;
+export declare function getDomainRubric(id: string): DomainRubric | undefined;
+export declare function listDomains(): {
+    id: string;
+    name: string;
+    description: string;
+    version: string;
+    is_stub: boolean;
+    has_rubric: boolean;
+}[];
+export * from './development-agent/index.js';
+export * from './general-agent/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/domains/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../domains/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,eAAO,MAAM,iBAAiB,yFAGpB,CAAC;AAOX,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,qDAEvC;AAED,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAEpE;AAED,wBAAgB,WAAW;;;;;;;IAS1B;AAED,cAAc,8BAA8B,CAAC;AAC7C,cAAc,0BAA0B,CAAC"}

package/dist/domains/index.js

@@ -0,0 +1,37 @@
+/**
+ * TasteKit Domains Registry
+ *
+ * Central registry of available domains.
+ * Ships with general-agent + development-agent.
+ */
+import { DevelopmentAgentDomain } from './development-agent/domain.js';
+import { GeneralAgentDomain } from './general-agent/domain.js';
+import { DevelopmentAgentRubric } from './development-agent/rubric.js';
+import { GeneralAgentRubric } from './general-agent/rubric.js';
+export const AVAILABLE_DOMAINS = [
+    DevelopmentAgentDomain,
+    GeneralAgentDomain,
+];
+const DOMAIN_RUBRICS = {
+    'development-agent': DevelopmentAgentRubric,
+    'general-agent': GeneralAgentRubric,
+};
+export function getDomainById(id) {
+    return AVAILABLE_DOMAINS.find(d => d.id === id);
+}
+export function getDomainRubric(id) {
+    return DOMAIN_RUBRICS[id];
+}
+export function listDomains() {
+    return AVAILABLE_DOMAINS.map(d => ({
+        id: d.id,
+        name: d.name,
+        description: d.description,
+        version: d.version,
+        is_stub: d.version.includes('stub'),
+        has_rubric: d.id in DOMAIN_RUBRICS,
+    }));
+}
+export * from './development-agent/index.js';
+export * from './general-agent/index.js';
+//# sourceMappingURL=index.js.map

package/dist/domains/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../domains/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAG/D,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,sBAAsB;IACtB,kBAAkB;CACV,CAAC;AAEX,MAAM,cAAc,GAAiC;IACnD,mBAAmB,EAAE,sBAAsB;IAC3C,eAAe,EAAE,kBAAkB;CACpC,CAAC;AAEF,MAAM,UAAU,aAAa,CAAC,EAAU;IACtC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,EAAU;IACxC,OAAO,cAAc,CAAC,EAAE,CAAC,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,WAAW;IACzB,OAAO,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;QACnC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,cAAc;KACnC,CAAC,CAAC,CAAC;AACN,CAAC;AAED,cAAc,8BAA8B,CAAC;AAC7C,cAAc,0BAA0B,CAAC"}

package/dist/domains/types.d.ts

@@ -0,0 +1,22 @@
+export interface DomainVocabulary {
+    principles_heading?: string;
+    guardrails_heading?: string;
+    skills_heading?: string;
+    constitution_label?: string;
+    skill_label?: string;
+    playbook_label?: string;
+    compile_verb?: string;
+    drift_verb?: string;
+    custom?: Record<string, string>;
+}
+export interface DomainDefinition {
+    id: string;
+    name: string;
+    description: string;
+    version: string;
+    use_cases: string[];
+    recommended_tools: string[];
+    default_autonomy_level: number;
+    vocabulary?: DomainVocabulary;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/domains/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../domains/types.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,gBAAgB;IAC/B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,UAAU,CAAC,EAAE,gBAAgB,CAAC;CAC/B"}

package/dist/domains/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/domains/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../domains/types.ts"],"names":[],"mappings":""}

package/dist/drift/consolidator.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Memory Consolidator
+ *
+ * Consolidates memory based on salience and retention policy.
+ * Includes merge detection for similar memories using content overlap.
+ */
+export interface ConsolidationPlan {
+    timestamp: string;
+    memories_to_keep: string[];
+    memories_to_prune: string[];
+    memories_to_merge: Array<{
+        source_ids: string[];
+        merged_content: string;
+    }>;
+}
+export interface MemoryEntry {
+    id: string;
+    content: string;
+    salience: number;
+    timestamp: string;
+}
+export declare class MemoryConsolidator {
+    /**
+     * Generate a consolidation plan based on salience scores and retention policy.
+     *
+     * Steps:
+     * 1. Separate memories by retention eligibility (age + salience)
+     * 2. Among kept memories, detect mergeable pairs (high content overlap)
+     * 3. Return plan for runtime to execute
+     */
+    generateConsolidationPlan(memories: MemoryEntry[], retentionDays: number): ConsolidationPlan;
+    /**
+     * Detect memories that are similar enough to merge.
+     * Uses word-level Jaccard similarity (threshold: 0.6).
+     */
+    private detectMerges;
+    /**
+     * Word-level Jaccard similarity between two strings.
+     */
+    private jaccardSimilarity;
+    /**
+     * Extract content from source that is not already in primary.
+     */
+    private extractUniqueContent;
+    private tokenize;
+}
+//# sourceMappingURL=consolidator.d.ts.map

package/dist/drift/consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../../drift/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,iBAAiB,EAAE,KAAK,CAAC;QACvB,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,qBAAa,kBAAkB;IAC7B;;;;;;;OAOG;IACH,yBAAyB,CACvB,QAAQ,EAAE,WAAW,EAAE,EACvB,aAAa,EAAE,MAAM,GACpB,iBAAiB;IAmCpB;;;OAGG;IACH,OAAO,CAAC,YAAY;IA+CpB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAgBzB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAO5B,OAAO,CAAC,QAAQ;CAGjB"}

package/dist/drift/consolidator.js

@@ -0,0 +1,116 @@
+/**
+ * Memory Consolidator
+ *
+ * Consolidates memory based on salience and retention policy.
+ * Includes merge detection for similar memories using content overlap.
+ */
+export class MemoryConsolidator {
+    /**
+     * Generate a consolidation plan based on salience scores and retention policy.
+     *
+     * Steps:
+     * 1. Separate memories by retention eligibility (age + salience)
+     * 2. Among kept memories, detect mergeable pairs (high content overlap)
+     * 3. Return plan for runtime to execute
+     */
+    generateConsolidationPlan(memories, retentionDays) {
+        const now = new Date();
+        const cutoffDate = new Date(now.getTime() - retentionDays * 24 * 60 * 60 * 1000);
+        const toKeep = [];
+        const toPrune = [];
+        for (const memory of memories) {
+            const memoryDate = new Date(memory.timestamp);
+            // Keep if recent or high salience
+            if (memoryDate >= cutoffDate || memory.salience > 0.7) {
+                toKeep.push(memory);
+            }
+            else {
+                toPrune.push(memory.id);
+            }
+        }
+        // Detect merge candidates among kept memories
+        const merges = this.detectMerges(toKeep);
+        // Remove merged memory IDs from the keep list
+        const mergedIds = new Set(merges.flatMap(m => m.source_ids));
+        const keepIds = toKeep
+            .filter(m => !mergedIds.has(m.id))
+            .map(m => m.id);
+        return {
+            timestamp: now.toISOString(),
+            memories_to_keep: keepIds,
+            memories_to_prune: toPrune,
+            memories_to_merge: merges,
+        };
+    }
+    /**
+     * Detect memories that are similar enough to merge.
+     * Uses word-level Jaccard similarity (threshold: 0.6).
+     */
+    detectMerges(memories) {
+        const merges = [];
+        const merged = new Set();
+        for (let i = 0; i < memories.length; i++) {
+            if (merged.has(memories[i].id))
+                continue;
+            const group = [memories[i]];
+            for (let j = i + 1; j < memories.length; j++) {
+                if (merged.has(memories[j].id))
+                    continue;
+                const similarity = this.jaccardSimilarity(memories[i].content, memories[j].content);
+                if (similarity >= 0.6) {
+                    group.push(memories[j]);
+                    merged.add(memories[j].id);
+                }
+            }
+            if (group.length > 1) {
+                merged.add(memories[i].id);
+                // Merge by keeping the highest-salience version and appending unique details
+                const sorted = group.sort((a, b) => b.salience - a.salience);
+                const primary = sorted[0];
+                const additionalDetails = sorted.slice(1)
+                    .map(m => this.extractUniqueContent(m.content, primary.content))
+                    .filter(detail => detail.length > 0);
+                let mergedContent = primary.content;
+                if (additionalDetails.length > 0) {
+                    mergedContent += '\n\nAdditional context: ' + additionalDetails.join('; ');
+                }
+                merges.push({
+                    source_ids: group.map(m => m.id),
+                    merged_content: mergedContent,
+                });
+            }
+        }
+        return merges;
+    }
+    /**
+     * Word-level Jaccard similarity between two strings.
+     */
+    jaccardSimilarity(a, b) {
+        const wordsA = new Set(this.tokenize(a));
+        const wordsB = new Set(this.tokenize(b));
+        if (wordsA.size === 0 && wordsB.size === 0)
+            return 1;
+        if (wordsA.size === 0 || wordsB.size === 0)
+            return 0;
+        let intersection = 0;
+        for (const word of wordsA) {
+            if (wordsB.has(word))
+                intersection++;
+        }
+        const union = wordsA.size + wordsB.size - intersection;
+        return union === 0 ? 0 : intersection / union;
+    }
+    /**
+     * Extract content from source that is not already in primary.
+     */
+    extractUniqueContent(source, primary) {
+        const primaryWords = new Set(this.tokenize(primary));
+        const sourceWords = this.tokenize(source);
+        const unique = sourceWords.filter(w => !primaryWords.has(w));
+        return unique.join(' ');
+    }
+    tokenize(text) {
+        return text.toLowerCase().split(/\s+/).filter(w => w.length > 2);
+    }
+}
+//# sourceMappingURL=consolidator.js.map

package/dist/drift/consolidator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.js","sourceRoot":"","sources":["../../drift/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAmBH,MAAM,OAAO,kBAAkB;IAC7B;;;;;;;OAOG;IACH,yBAAyB,CACvB,QAAuB,EACvB,aAAqB;QAErB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;QAEjF,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAE9C,kCAAkC;YAClC,IAAI,UAAU,IAAI,UAAU,IAAI,MAAM,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC;gBACtD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAEzC,8CAA8C;QAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,MAAM;aACnB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAElB,OAAO;YACL,SAAS,EAAE,GAAG,CAAC,WAAW,EAAE;YAC5B,gBAAgB,EAAE,OAAO;YACzB,iBAAiB,EAAE,OAAO;YAC1B,iBAAiB,EAAE,MAAM;SAC1B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,QAAuB;QAC1C,MAAM,MAAM,GAA2C,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEzC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAEzC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CACvC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EACnB,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CACpB,CAAC;gBAEF,IAAI,UAAU,IAAI,GAAG,EAAE,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3B,6EAA6E;gBAC7E,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;gBAC7D,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,iBAAiB,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;qBACtC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;qBAC/D,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAEvC,IAAI,aAAa,GAAG,OAAO,CAAC,OAAO,CAAC;gBACpC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACjC,aAAa,IAAI,0BAA0B,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7E,CAAC;gBAED,MAAM,CAAC,IAAI,CAAC;oBACV,UAAU,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChC,cAAc,EAAE,aAAa;iBAC9B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAS,EAAE,CAAS;QAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACrD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAErD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,YAAY,EAAE,CAAC;QACvC,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,YAAY,CAAC;QACvD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,MAAc,EAAE,OAAe;QAC1D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEO,QAAQ,CAAC,IAAY;QAC3B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnE,CAAC;CACF"}

package/dist/drift/detector.d.ts

@@ -0,0 +1,79 @@
+import { TraceEvent } from '../schemas/trace.js';
+import { SkillsManifestV1 } from '../schemas/skills.js';
+import { DriftProposal, DriftSignalType, SkillAmendmentProposal } from './proposal.js';
+/**
+ * Drift Detector — Operational Learning Loop
+ *
+ * Detects drift from traces using 7 signal types:
+ *  1. repeated_edit     — user repeatedly rejects agent actions
+ *  2. principle_violation — errors suggest principles being broken
+ *  3. user_correction   — user edits right after agent output
+ *  4. tool_change       — user switches tools for same task type
+ *  5. staleness         — constitution hasn't been recompiled in >30 days
+ *  6. coverage_gap      — tools/skills used but not in manifest
+ *  7. assertion_mismatch — "never X" principle but agent does X
+ *
+ * Also aggregates observations and tensions for threshold-triggered review.
+ */
+export interface DriftDetectionOptions {
+    since?: Date;
+    skillId?: string;
+    mode?: 'violations' | 'staleness';
+    /** Path to constitution for staleness/assertion checks */
+    constitutionPath?: string;
+    /** Skills manifest data for coverage gap detection */
+    knownSkillIds?: string[];
+    /** Known tool bindings for coverage gap detection */
+    knownToolRefs?: string[];
+}
+export interface DriftSignal {
+    type: DriftSignalType;
+    frequency: number;
+    context: Record<string, unknown>;
+}
+export declare class DriftDetector {
+    private reader;
+    constructor();
+    detectFromTraces(tracePaths: string[], options?: DriftDetectionOptions): DriftProposal[];
+    private detectSignals;
+    /** Signal 1: Repeated rejections of agent actions */
+    private detectRepeatedEdits;
+    /** Signal 2: Error accumulation suggests principle violations */
+    private detectPrincipleViolations;
+    /** Signal 3: User edits shortly after agent produces output */
+    private detectUserCorrections;
+    /** Signal 4: User switches tools for similar tasks */
+    private detectToolChanges;
+    /** Signal 5: Constitution staleness — gap between constitution age and latest traces */
+    private detectStaleness;
+    /** Signal 6: Tools/skills used in traces that aren't in the manifest */
+    private detectCoverageGaps;
+    /** Signal 7: "never X" principles but traces show X happening */
+    private detectAssertionMismatches;
+    private createProposalFromSignal;
+}
+/** Aggregate observation events from traces */
+export declare function aggregateObservations(events: TraceEvent[]): {
+    total: number;
+    by_category: Record<string, number>;
+    recent: TraceEvent[];
+};
+/** Aggregate tension events from traces */
+export declare function aggregateTensions(events: TraceEvent[]): {
+    total: number;
+    pending: number;
+    recent: TraceEvent[];
+};
+export interface SkillDriftOptions {
+    /** Success rate below this triggers a proposal. Default: 0.7 */
+    successThreshold?: number;
+    /** Minimum runs before a skill is evaluated. Default: 3 */
+    minRuns?: number;
+}
+/**
+ * Detect underperforming skills from traces and generate amendment proposals.
+ */
+export declare function detectSkillDrift(events: TraceEvent[], manifest?: SkillsManifestV1, options?: SkillDriftOptions): SkillAmendmentProposal[];
+/** Check if accumulated observations/tensions warrant a meta-review */
+export declare function shouldTriggerReview(observations: ReturnType<typeof aggregateObservations>, tensions: ReturnType<typeof aggregateTensions>): boolean;
+//# sourceMappingURL=detector.d.ts.map

package/dist/drift/detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detector.d.ts","sourceRoot":"","sources":["../../drift/detector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAExD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAkC,sBAAsB,EAAE,MAAM,eAAe,CAAC;AAIvH;;;;;;;;;;;;;GAaG;AAEH,MAAM,WAAW,qBAAqB;IACpC,KAAK,CAAC,EAAE,IAAI,CAAC;IACb,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,YAAY,GAAG,WAAW,CAAC;IAClC,0DAA0D;IAC1D,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,sDAAsD;IACtD,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,qDAAqD;IACrD,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,eAAe,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAClC;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAc;;IAM5B,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE,qBAA0B,GAAG,aAAa,EAAE;IAkC5F,OAAO,CAAC,aAAa;IA+BrB,qDAAqD;IACrD,OAAO,CAAC,mBAAmB;IAwB3B,iEAAiE;IACjE,OAAO,CAAC,yBAAyB;IAejC,+DAA+D;IAC/D,OAAO,CAAC,qBAAqB;IAuC7B,sDAAsD;IACtD,OAAO,CAAC,iBAAiB;IAyBzB,wFAAwF;IACxF,OAAO,CAAC,eAAe;IAgCvB,wEAAwE;IACxE,OAAO,CAAC,kBAAkB;IA4B1B,iEAAiE;IACjE,OAAO,CAAC,yBAAyB;IAyBjC,OAAO,CAAC,wBAAwB;CAiHjC;AAMD,+CAA+C;AAC/C,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG;IAC3D,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,EAAE,UAAU,EAAE,CAAC;CACtB,CAcA;AAED,2CAA2C;AAC3C,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG;IACvD,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,UAAU,EAAE,CAAC;CACtB,CASA;AAMD,MAAM,WAAW,iBAAiB;IAChC,gEAAgE;IAChE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,2DAA2D;IAC3D,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,UAAU,EAAE,EACpB,QAAQ,CAAC,EAAE,gBAAgB,EAC3B,OAAO,GAAE,iBAAsB,GAC9B,sBAAsB,EAAE,CAqC1B;AAuCD,uEAAuE;AACvE,wBAAgB,mBAAmB,CACjC,YAAY,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,EACtD,QAAQ,EAAE,UAAU,CAAC,OAAO,iBAAiB,CAAC,GAC7C,OAAO,CAET"}