open-multi-agent-kit 0.97.0 → 0.98.0

package/dist/core/lean-ctx.js

@@ -1,225 +0,0 @@
-// OMK v6.2 — Lean CTX Engine (TypeScript)
-// =========================================
-// packages/coding-agent/src/core/lean-ctx.ts
-//
-// 매 프롬프트 입력 시 자동으로 context 분석/압축을 수행하는 엔진.
-// 순수 로컬 모드 — API 호출 0회.
-import { EventEmitter } from "events";
-// ── 상수 및 설정 ────────────────────────────────────────────────────────
-const DEFAULT_CONFIG = {
-    recencyWindow: 4,
-    relevanceThreshold: 0.3,
-    keyTurnReserve: 2,
-    summaryEvery: 3,
-    maxContextTokens: 2000,
-    compressionTarget: 0.6,
-    tfidfWeight: 0.5,
-    semanticWeight: 0.3,
-    recencyWeight: 0.2,
-    keywordBoost: 1.5,
-    lruWeight: 0.4,
-    frequencyWeight: 0.3,
-    recencyDecayWeight: 0.3,
-    protectedKeywords: ["refusal", "error", "strategy_change", "phase_transition"],
-    hardTokenLimit: 15000,
-    softTokenLimit: 12000,
-    warningThreshold: 0.8,
-    criticalThreshold: 0.95,
-    gracefulDegradation: true,
-    opportunisticExpansion: true,
-    autoCompress: true,
-    compressOnEveryPrompt: true,
-    minTokensToCompress: 500,
-    maxTurnsBeforeCompress: 8,
-};
-// ── ContextCompressor ───────────────────────────────────────────────────
-export class ContextCompressor extends EventEmitter {
-    config;
-    charsPerToken = 4;
-    constructor(config) {
-        super();
-        this.config = { ...DEFAULT_CONFIG, ...config };
-    }
-    compress(context, currentTurn) {
-        const originalTokens = this.estimateTokens(context);
-        if (originalTokens < this.config.minTokensToCompress) {
-            return {
-                turns: context,
-                summary: "",
-                originalTokens,
-                compressedTokens: originalTokens,
-                compressionRatio: 1.0,
-                techniqueUsed: "none",
-                keyTurnsPreserved: 0,
-                evictedCount: 0,
-            };
-        }
-        const keyTurns = this.extractKeyTurns(context);
-        const recent = this.applyRecencyWindow(context);
-        const relevant = this.filterByRelevance(context, currentTurn, keyTurns);
-        const summary = this.hierarchicalSummarize(context, recent, keyTurns, relevant);
-        const compressed = this.assembleCompressed(keyTurns, relevant, recent, summary);
-        const compressedTokens = this.estimateTokens(compressed);
-        const ratio = originalTokens > 0 ? compressedTokens / originalTokens : 1.0;
-        return {
-            turns: compressed,
-            summary,
-            originalTokens,
-            compressedTokens,
-            compressionRatio: ratio,
-            techniqueUsed: "hierarchical+selective",
-            keyTurnsPreserved: keyTurns.length,
-            evictedCount: context.length - compressed.length,
-        };
-    }
-    estimateTokens(turns) {
-        return turns.reduce((sum, t) => sum + Math.ceil(t.content.length / this.charsPerToken), 0);
-    }
-    extractKeyTurns(context) {
-        const keyTurns = [];
-        const protectedKeywords = this.config.protectedKeywords;
-        for (const turn of context) {
-            const contentLower = turn.content.toLowerCase();
-            let isKey = protectedKeywords.some((kw) => contentLower.includes(kw.toLowerCase()));
-            if (turn.metadata?.isKeyTurn || turn.metadata?.phaseTransition) {
-                isKey = true;
-            }
-            if (turn.role === "assistant" &&
-                ["refuse", "cannot", "unable", "sorry", "거부", "죄송"].some((w) => contentLower.includes(w))) {
-                isKey = true;
-            }
-            if (isKey) {
-                turn.isKeyTurn = true;
-                keyTurns.push(turn);
-            }
-        }
-        return keyTurns;
-    }
-    applyRecencyWindow(context) {
-        const windowSize = this.config.recencyWindow;
-        if (context.length <= windowSize)
-            return [...context];
-        return context.slice(-windowSize);
-    }
-    filterByRelevance(context, currentTurn, keyTurns) {
-        if (!currentTurn)
-            return [...context];
-        const threshold = this.config.relevanceThreshold;
-        const keyIndices = new Set(keyTurns?.map((t) => t.index) ?? []);
-        return context.filter((turn) => {
-            if (keyIndices.has(turn.index))
-                return true;
-            const score = this.calculateRelevance(turn, currentTurn);
-            return score >= threshold;
-        });
-    }
-    calculateRelevance(turn, currentTurn) {
-        const tfidfScore = this.tfidfSimilarity(turn.content, currentTurn.content);
-        const recencyScore = Math.exp(-(Date.now() - turn.timestamp) / 3600000);
-        return tfidfScore * this.config.tfidfWeight + recencyScore * this.config.recencyWeight;
-    }
-    tfidfSimilarity(text1, text2) {
-        const words1 = text1.toLowerCase().split(/\s+/);
-        const words2 = text2.toLowerCase().split(/\s+/);
-        const set1 = new Set(words1);
-        const set2 = new Set(words2);
-        const intersection = new Set([...set1].filter((x) => set2.has(x)));
-        return intersection.size / Math.sqrt(set1.size * set2.size);
-    }
-    hierarchicalSummarize(_context, recent, keyTurns, relevant) {
-        const allImportant = [...new Set([...keyTurns, ...relevant, ...recent])].sort((a, b) => a.index - b.index);
-        const chunks = [];
-        for (let i = 0; i < allImportant.length; i += this.config.summaryEvery) {
-            const chunk = allImportant.slice(i, i + this.config.summaryEvery);
-            const summary = chunk.map((t) => `[${t.role}]: ${t.content.substring(0, 100)}`).join(" | ");
-            chunks.push(summary);
-        }
-        return chunks.join("\n");
-    }
-    assembleCompressed(keyTurns, relevant, recent, _summary) {
-        const important = new Map();
-        for (const turn of keyTurns)
-            important.set(turn.index, turn);
-        for (const turn of relevant)
-            important.set(turn.index, turn);
-        for (const turn of recent)
-            important.set(turn.index, turn);
-        return Array.from(important.values()).sort((a, b) => a.index - b.index);
-    }
-}
-// ── TokenBudgetEnforcer ─────────────────────────────────────────────────
-export class TokenBudgetEnforcer extends EventEmitter {
-    config;
-    constructor(config) {
-        super();
-        this.config = { ...DEFAULT_CONFIG, ...config };
-    }
-    check(usedTokens) {
-        const total = this.config.hardTokenLimit;
-        const ratio = usedTokens / total;
-        const remaining = total - usedTokens;
-        let level = "green";
-        if (ratio >= 1.0)
-            level = "exceeded";
-        else if (ratio >= this.config.criticalThreshold)
-            level = "red";
-        else if (ratio >= this.config.warningThreshold)
-            level = "orange";
-        else if (ratio >= 0.6)
-            level = "yellow";
-        return {
-            usedTokens,
-            totalTokens: total,
-            ratio,
-            level,
-            remaining,
-            canAddAgents: level === "green" || level === "yellow",
-        };
-    }
-    autoCompressIfNeeded(context) {
-        const tokens = context.reduce((sum, t) => sum + Math.ceil(t.content.length / 4), 0);
-        const status = this.check(tokens);
-        if (status.level === "red" || status.level === "exceeded") {
-            const compressor = new ContextCompressor(this.config);
-            const result = compressor.compress(context);
-            return { compressed: result.turns, status: this.check(result.compressedTokens) };
-        }
-        return { compressed: context, status };
-    }
-}
-// ── LeanCTXEngine (통합 엔진) ───────────────────────────────────────────
-export class LeanCTXEngine extends EventEmitter {
-    compressor;
-    budgetEnforcer;
-    history = [];
-    constructor(config) {
-        super();
-        this.compressor = new ContextCompressor(config);
-        this.budgetEnforcer = new TokenBudgetEnforcer(config);
-    }
-    processPrompt(prompt, role = "user") {
-        const currentTurn = {
-            index: this.history.length,
-            role,
-            content: prompt,
-            timestamp: Date.now(),
-        };
-        const result = this.compressor.compress(this.history, currentTurn);
-        this.budgetEnforcer.autoCompressIfNeeded(result.turns);
-        this.history.push(currentTurn);
-        if (this.history.length > 100)
-            this.history = this.history.slice(-50);
-        return result;
-    }
-    preToolCall(_toolName, _toolArgs, context) {
-        return this.budgetEnforcer.autoCompressIfNeeded(context);
-    }
-    getStats() {
-        return { historyLength: this.history.length, lastCompression: Date.now() };
-    }
-    clearHistory() {
-        this.history = [];
-    }
-}
-export default LeanCTXEngine;
-//# sourceMappingURL=lean-ctx.js.map

package/dist/core/lean-ctx.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lean-ctx.js","sourceRoot":"","sources":["../../src/core/lean-ctx.ts"],"names":[],"mappings":"AAAA,4CAA0C;AAC1C,4CAA4C;AAC5C,6CAA6C;AAC7C,EAAE;AACF,yFAA2C;AAC3C,4CAAwB;AAExB,OAAO,EAAE,YAAY,EAAE,MAAM,QAAQ,CAAC;AAEtC,oMAAsE;AAEtE,MAAM,cAAc,GAAG;IACtB,aAAa,EAAE,CAAC;IAChB,kBAAkB,EAAE,GAAG;IACvB,cAAc,EAAE,CAAC;IACjB,YAAY,EAAE,CAAC;IACf,gBAAgB,EAAE,IAAI;IACtB,iBAAiB,EAAE,GAAG;IAEtB,WAAW,EAAE,GAAG;IAChB,cAAc,EAAE,GAAG;IACnB,aAAa,EAAE,GAAG;IAClB,YAAY,EAAE,GAAG;IAEjB,SAAS,EAAE,GAAG;IACd,eAAe,EAAE,GAAG;IACpB,kBAAkB,EAAE,GAAG;IACvB,iBAAiB,EAAE,CAAC,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,CAAC;IAE9E,cAAc,EAAE,KAAK;IACrB,cAAc,EAAE,KAAK;IACrB,gBAAgB,EAAE,GAAG;IACrB,iBAAiB,EAAE,IAAI;IACvB,mBAAmB,EAAE,IAAI;IACzB,sBAAsB,EAAE,IAAI;IAE5B,YAAY,EAAE,IAAI;IAClB,qBAAqB,EAAE,IAAI;IAC3B,mBAAmB,EAAE,GAAG;IACxB,sBAAsB,EAAE,CAAC;CACzB,CAAC;AAsCF,qLAA2E;AAE3E,MAAM,OAAO,iBAAkB,SAAQ,YAAY;IAC1C,MAAM,CAAwB;IAC9B,aAAa,GAAG,CAAC,CAAC;IAE1B,YAAY,MAAuC,EAAE;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAAA,CAC/C;IAED,QAAQ,CAAC,OAAoB,EAAE,WAAuB,EAAqB;QAC1E,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAEpD,IAAI,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;YACtD,OAAO;gBACN,KAAK,EAAE,OAAO;gBACd,OAAO,EAAE,EAAE;gBACX,cAAc;gBACd,gBAAgB,EAAE,cAAc;gBAChC,gBAAgB,EAAE,GAAG;gBACrB,aAAa,EAAE,MAAM;gBACrB,iBAAiB,EAAE,CAAC;gBACpB,YAAY,EAAE,CAAC;aACf,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QACxE,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAChF,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAEhF,MAAM,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;QAE3E,OAAO;YACN,KAAK,EAAE,UAAU;YACjB,OAAO;YACP,cAAc;YACd,gBAAgB;YAChB,gBAAgB,EAAE,KAAK;YACvB,aAAa,EAAE,wBAAwB;YACvC,iBAAiB,EAAE,QAAQ,CAAC,MAAM;YAClC,YAAY,EAAE,OAAO,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM;SAChD,CAAC;IAAA,CACF;IAEO,cAAc,CAAC,KAAkB,EAAU;QAClD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;IAAA,CAC3F;IAEO,eAAe,CAAC,OAAoB,EAAe;QAC1D,MAAM,QAAQ,GAAgB,EAAE,CAAC;QACjC,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;QAExD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YAChD,IAAI,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAEpF,IAAI,IAAI,CAAC,QAAQ,EAAE,SAAS,IAAI,IAAI,CAAC,QAAQ,EAAE,eAAe,EAAE,CAAC;gBAChE,KAAK,GAAG,IAAI,CAAC;YACd,CAAC;YAED,IACC,IAAI,CAAC,IAAI,KAAK,WAAW;gBACzB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAI,EAAE,QAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EACxF,CAAC;gBACF,KAAK,GAAG,IAAI,CAAC;YACd,CAAC;YAED,IAAI,KAAK,EAAE,CAAC;gBACX,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QAED,OAAO,QAAQ,CAAC;IAAA,CAChB;IAEO,kBAAkB,CAAC,OAAoB,EAAe;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAC7C,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;YAAE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;QACtD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;IAAA,CAClC;IAEO,iBAAiB,CAAC,OAAoB,EAAE,WAAuB,EAAE,QAAsB,EAAe;QAC7G,IAAI,CAAC,WAAW;YAAE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;QAEtC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC;QACjD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAEhE,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/B,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YACzD,OAAO,KAAK,IAAI,SAAS,CAAC;QAAA,CAC1B,CAAC,CAAC;IAAA,CACH;IAEO,kBAAkB,CAAC,IAAe,EAAE,WAAsB,EAAU;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC;QAC3E,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC;QACxE,OAAO,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;IAAA,CACvF;IAEO,eAAe,CAAC,KAAa,EAAE,KAAa,EAAU;QAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,OAAO,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAAA,CAC5D;IAEO,qBAAqB,CAC5B,QAAqB,EACrB,MAAmB,EACnB,QAAqB,EACrB,QAAqB,EACZ;QACT,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3G,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACxE,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5F,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,CAAC;QAED,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAAA,CACzB;IAEO,kBAAkB,CACzB,QAAqB,EACrB,QAAqB,EACrB,MAAmB,EACnB,QAAgB,EACF;QACd,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;QAE/C,KAAK,MAAM,IAAI,IAAI,QAAQ;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,MAAM;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE3D,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAAA,CACxE;CACD;AAED,iLAA2E;AAE3E,MAAM,OAAO,mBAAoB,SAAQ,YAAY;IAC5C,MAAM,CAAwB;IAEtC,YAAY,MAAuC,EAAE;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAAA,CAC/C;IAED,KAAK,CAAC,UAAkB,EAAgB;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,GAAG,KAAK,CAAC;QACjC,MAAM,SAAS,GAAG,KAAK,GAAG,UAAU,CAAC;QAErC,IAAI,KAAK,GAA0B,OAAO,CAAC;QAC3C,IAAI,KAAK,IAAI,GAAG;YAAE,KAAK,GAAG,UAAU,CAAC;aAChC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB;YAAE,KAAK,GAAG,KAAK,CAAC;aAC1D,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,gBAAgB;YAAE,KAAK,GAAG,QAAQ,CAAC;aAC5D,IAAI,KAAK,IAAI,GAAG;YAAE,KAAK,GAAG,QAAQ,CAAC;QAExC,OAAO;YACN,UAAU;YACV,WAAW,EAAE,KAAK;YAClB,KAAK;YACL,KAAK;YACL,SAAS;YACT,YAAY,EAAE,KAAK,KAAK,OAAO,IAAI,KAAK,KAAK,QAAQ;SACrD,CAAC;IAAA,CACF;IAED,oBAAoB,CAAC,OAAoB,EAAqD;QAC7F,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAElC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;YAC3D,MAAM,UAAU,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAClF,CAAC;QAED,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAAA,CACvC;CACD;AAED,yKAAuE;AAEvE,MAAM,OAAO,aAAc,SAAQ,YAAY;IACtC,UAAU,CAAoB;IAC9B,cAAc,CAAsB;IACpC,OAAO,GAAgB,EAAE,CAAC;IAElC,YAAY,MAAuC,EAAE;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,cAAc,GAAG,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAC;IAAA,CACtD;IAED,aAAa,CAAC,MAAc,EAAE,IAAI,GAAoC,MAAM,EAAqB;QAChG,MAAM,WAAW,GAAc;YAC9B,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YAC1B,IAAI;YACJ,OAAO,EAAE,MAAM;YACf,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACrB,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACnE,IAAI,CAAC,cAAc,CAAC,oBAAoB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEvD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG;YAAE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAEtE,OAAO,MAAM,CAAC;IAAA,CACd;IAED,WAAW,CACV,SAAiB,EACjB,SAA8B,EAC9B,OAAoB,EACgC;QACpD,OAAO,IAAI,CAAC,cAAc,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAAA,CACzD;IAED,QAAQ,GAAuD;QAC9D,OAAO,EAAE,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IAAA,CAC3E;IAED,YAAY,GAAS;QACpB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IAAA,CAClB;CACD;AAED,eAAe,aAAa,CAAC","sourcesContent":["// OMK v6.2 — Lean CTX Engine (TypeScript)\n// =========================================\n// packages/coding-agent/src/core/lean-ctx.ts\n//\n// 매 프롬프트 입력 시 자동으로 context 분석/압축을 수행하는 엔진.\n// 순수 로컬 모드 — API 호출 0회.\n\nimport { EventEmitter } from \"events\";\n\n// ── 상수 및 설정 ────────────────────────────────────────────────────────\n\nconst DEFAULT_CONFIG = {\n\trecencyWindow: 4,\n\trelevanceThreshold: 0.3,\n\tkeyTurnReserve: 2,\n\tsummaryEvery: 3,\n\tmaxContextTokens: 2000,\n\tcompressionTarget: 0.6,\n\n\ttfidfWeight: 0.5,\n\tsemanticWeight: 0.3,\n\trecencyWeight: 0.2,\n\tkeywordBoost: 1.5,\n\n\tlruWeight: 0.4,\n\tfrequencyWeight: 0.3,\n\trecencyDecayWeight: 0.3,\n\tprotectedKeywords: [\"refusal\", \"error\", \"strategy_change\", \"phase_transition\"],\n\n\thardTokenLimit: 15000,\n\tsoftTokenLimit: 12000,\n\twarningThreshold: 0.8,\n\tcriticalThreshold: 0.95,\n\tgracefulDegradation: true,\n\topportunisticExpansion: true,\n\n\tautoCompress: true,\n\tcompressOnEveryPrompt: true,\n\tminTokensToCompress: 500,\n\tmaxTurnsBeforeCompress: 8,\n};\n\n// ── 데이터 모델 ─────────────────────────────────────────────────────────\n\nexport interface TurnEntry {\n\tindex: number;\n\trole: \"user\" | \"assistant\" | \"system\" | \"tool\";\n\tcontent: string;\n\ttimestamp: number;\n\tmetadata?: Record<string, any>;\n\ttokenCount?: number;\n\tisKeyTurn?: boolean;\n\trelevanceScore?: number;\n\taccessCount?: number;\n\tlastAccessed?: number;\n}\n\nexport interface CompressedContext {\n\tturns: TurnEntry[];\n\tsummary: string;\n\toriginalTokens: number;\n\tcompressedTokens: number;\n\tcompressionRatio: number;\n\ttechniqueUsed: string;\n\tkeyTurnsPreserved: number;\n\tevictedCount: number;\n\tmetadata?: Record<string, any>;\n}\n\nexport interface BudgetStatus {\n\tusedTokens: number;\n\ttotalTokens: number;\n\tratio: number;\n\tlevel: \"green\" | \"yellow\" | \"orange\" | \"red\" | \"exceeded\";\n\tremaining: number;\n\tcanAddAgents: boolean;\n}\n\n// ── ContextCompressor ───────────────────────────────────────────────────\n\nexport class ContextCompressor extends EventEmitter {\n\tprivate config: typeof DEFAULT_CONFIG;\n\tprivate charsPerToken = 4;\n\n\tconstructor(config?: Partial<typeof DEFAULT_CONFIG>) {\n\t\tsuper();\n\t\tthis.config = { ...DEFAULT_CONFIG, ...config };\n\t}\n\n\tcompress(context: TurnEntry[], currentTurn?: TurnEntry): CompressedContext {\n\t\tconst originalTokens = this.estimateTokens(context);\n\n\t\tif (originalTokens < this.config.minTokensToCompress) {\n\t\t\treturn {\n\t\t\t\tturns: context,\n\t\t\t\tsummary: \"\",\n\t\t\t\toriginalTokens,\n\t\t\t\tcompressedTokens: originalTokens,\n\t\t\t\tcompressionRatio: 1.0,\n\t\t\t\ttechniqueUsed: \"none\",\n\t\t\t\tkeyTurnsPreserved: 0,\n\t\t\t\tevictedCount: 0,\n\t\t\t};\n\t\t}\n\n\t\tconst keyTurns = this.extractKeyTurns(context);\n\t\tconst recent = this.applyRecencyWindow(context);\n\t\tconst relevant = this.filterByRelevance(context, currentTurn, keyTurns);\n\t\tconst summary = this.hierarchicalSummarize(context, recent, keyTurns, relevant);\n\t\tconst compressed = this.assembleCompressed(keyTurns, relevant, recent, summary);\n\n\t\tconst compressedTokens = this.estimateTokens(compressed);\n\t\tconst ratio = originalTokens > 0 ? compressedTokens / originalTokens : 1.0;\n\n\t\treturn {\n\t\t\tturns: compressed,\n\t\t\tsummary,\n\t\t\toriginalTokens,\n\t\t\tcompressedTokens,\n\t\t\tcompressionRatio: ratio,\n\t\t\ttechniqueUsed: \"hierarchical+selective\",\n\t\t\tkeyTurnsPreserved: keyTurns.length,\n\t\t\tevictedCount: context.length - compressed.length,\n\t\t};\n\t}\n\n\tprivate estimateTokens(turns: TurnEntry[]): number {\n\t\treturn turns.reduce((sum, t) => sum + Math.ceil(t.content.length / this.charsPerToken), 0);\n\t}\n\n\tprivate extractKeyTurns(context: TurnEntry[]): TurnEntry[] {\n\t\tconst keyTurns: TurnEntry[] = [];\n\t\tconst protectedKeywords = this.config.protectedKeywords;\n\n\t\tfor (const turn of context) {\n\t\t\tconst contentLower = turn.content.toLowerCase();\n\t\t\tlet isKey = protectedKeywords.some((kw) => contentLower.includes(kw.toLowerCase()));\n\n\t\t\tif (turn.metadata?.isKeyTurn || turn.metadata?.phaseTransition) {\n\t\t\t\tisKey = true;\n\t\t\t}\n\n\t\t\tif (\n\t\t\t\tturn.role === \"assistant\" &&\n\t\t\t\t[\"refuse\", \"cannot\", \"unable\", \"sorry\", \"거부\", \"죄송\"].some((w) => contentLower.includes(w))\n\t\t\t) {\n\t\t\t\tisKey = true;\n\t\t\t}\n\n\t\t\tif (isKey) {\n\t\t\t\tturn.isKeyTurn = true;\n\t\t\t\tkeyTurns.push(turn);\n\t\t\t}\n\t\t}\n\n\t\treturn keyTurns;\n\t}\n\n\tprivate applyRecencyWindow(context: TurnEntry[]): TurnEntry[] {\n\t\tconst windowSize = this.config.recencyWindow;\n\t\tif (context.length <= windowSize) return [...context];\n\t\treturn context.slice(-windowSize);\n\t}\n\n\tprivate filterByRelevance(context: TurnEntry[], currentTurn?: TurnEntry, keyTurns?: TurnEntry[]): TurnEntry[] {\n\t\tif (!currentTurn) return [...context];\n\n\t\tconst threshold = this.config.relevanceThreshold;\n\t\tconst keyIndices = new Set(keyTurns?.map((t) => t.index) ?? []);\n\n\t\treturn context.filter((turn) => {\n\t\t\tif (keyIndices.has(turn.index)) return true;\n\t\t\tconst score = this.calculateRelevance(turn, currentTurn);\n\t\t\treturn score >= threshold;\n\t\t});\n\t}\n\n\tprivate calculateRelevance(turn: TurnEntry, currentTurn: TurnEntry): number {\n\t\tconst tfidfScore = this.tfidfSimilarity(turn.content, currentTurn.content);\n\t\tconst recencyScore = Math.exp(-(Date.now() - turn.timestamp) / 3600000);\n\t\treturn tfidfScore * this.config.tfidfWeight + recencyScore * this.config.recencyWeight;\n\t}\n\n\tprivate tfidfSimilarity(text1: string, text2: string): number {\n\t\tconst words1 = text1.toLowerCase().split(/\\s+/);\n\t\tconst words2 = text2.toLowerCase().split(/\\s+/);\n\t\tconst set1 = new Set(words1);\n\t\tconst set2 = new Set(words2);\n\t\tconst intersection = new Set([...set1].filter((x) => set2.has(x)));\n\t\treturn intersection.size / Math.sqrt(set1.size * set2.size);\n\t}\n\n\tprivate hierarchicalSummarize(\n\t\t_context: TurnEntry[],\n\t\trecent: TurnEntry[],\n\t\tkeyTurns: TurnEntry[],\n\t\trelevant: TurnEntry[],\n\t): string {\n\t\tconst allImportant = [...new Set([...keyTurns, ...relevant, ...recent])].sort((a, b) => a.index - b.index);\n\t\tconst chunks: string[] = [];\n\n\t\tfor (let i = 0; i < allImportant.length; i += this.config.summaryEvery) {\n\t\t\tconst chunk = allImportant.slice(i, i + this.config.summaryEvery);\n\t\t\tconst summary = chunk.map((t) => `[${t.role}]: ${t.content.substring(0, 100)}`).join(\" | \");\n\t\t\tchunks.push(summary);\n\t\t}\n\n\t\treturn chunks.join(\"\\n\");\n\t}\n\n\tprivate assembleCompressed(\n\t\tkeyTurns: TurnEntry[],\n\t\trelevant: TurnEntry[],\n\t\trecent: TurnEntry[],\n\t\t_summary: string,\n\t): TurnEntry[] {\n\t\tconst important = new Map<number, TurnEntry>();\n\n\t\tfor (const turn of keyTurns) important.set(turn.index, turn);\n\t\tfor (const turn of relevant) important.set(turn.index, turn);\n\t\tfor (const turn of recent) important.set(turn.index, turn);\n\n\t\treturn Array.from(important.values()).sort((a, b) => a.index - b.index);\n\t}\n}\n\n// ── TokenBudgetEnforcer ─────────────────────────────────────────────────\n\nexport class TokenBudgetEnforcer extends EventEmitter {\n\tprivate config: typeof DEFAULT_CONFIG;\n\n\tconstructor(config?: Partial<typeof DEFAULT_CONFIG>) {\n\t\tsuper();\n\t\tthis.config = { ...DEFAULT_CONFIG, ...config };\n\t}\n\n\tcheck(usedTokens: number): BudgetStatus {\n\t\tconst total = this.config.hardTokenLimit;\n\t\tconst ratio = usedTokens / total;\n\t\tconst remaining = total - usedTokens;\n\n\t\tlet level: BudgetStatus[\"level\"] = \"green\";\n\t\tif (ratio >= 1.0) level = \"exceeded\";\n\t\telse if (ratio >= this.config.criticalThreshold) level = \"red\";\n\t\telse if (ratio >= this.config.warningThreshold) level = \"orange\";\n\t\telse if (ratio >= 0.6) level = \"yellow\";\n\n\t\treturn {\n\t\t\tusedTokens,\n\t\t\ttotalTokens: total,\n\t\t\tratio,\n\t\t\tlevel,\n\t\t\tremaining,\n\t\t\tcanAddAgents: level === \"green\" || level === \"yellow\",\n\t\t};\n\t}\n\n\tautoCompressIfNeeded(context: TurnEntry[]): { compressed: TurnEntry[]; status: BudgetStatus } {\n\t\tconst tokens = context.reduce((sum, t) => sum + Math.ceil(t.content.length / 4), 0);\n\t\tconst status = this.check(tokens);\n\n\t\tif (status.level === \"red\" || status.level === \"exceeded\") {\n\t\t\tconst compressor = new ContextCompressor(this.config);\n\t\t\tconst result = compressor.compress(context);\n\t\t\treturn { compressed: result.turns, status: this.check(result.compressedTokens) };\n\t\t}\n\n\t\treturn { compressed: context, status };\n\t}\n}\n\n// ── LeanCTXEngine (통합 엔진) ───────────────────────────────────────────\n\nexport class LeanCTXEngine extends EventEmitter {\n\tprivate compressor: ContextCompressor;\n\tprivate budgetEnforcer: TokenBudgetEnforcer;\n\tprivate history: TurnEntry[] = [];\n\n\tconstructor(config?: Partial<typeof DEFAULT_CONFIG>) {\n\t\tsuper();\n\t\tthis.compressor = new ContextCompressor(config);\n\t\tthis.budgetEnforcer = new TokenBudgetEnforcer(config);\n\t}\n\n\tprocessPrompt(prompt: string, role: \"user\" | \"assistant\" | \"system\" = \"user\"): CompressedContext {\n\t\tconst currentTurn: TurnEntry = {\n\t\t\tindex: this.history.length,\n\t\t\trole,\n\t\t\tcontent: prompt,\n\t\t\ttimestamp: Date.now(),\n\t\t};\n\n\t\tconst result = this.compressor.compress(this.history, currentTurn);\n\t\tthis.budgetEnforcer.autoCompressIfNeeded(result.turns);\n\n\t\tthis.history.push(currentTurn);\n\t\tif (this.history.length > 100) this.history = this.history.slice(-50);\n\n\t\treturn result;\n\t}\n\n\tpreToolCall(\n\t\t_toolName: string,\n\t\t_toolArgs: Record<string, any>,\n\t\tcontext: TurnEntry[],\n\t): { compressed: TurnEntry[]; status: BudgetStatus } {\n\t\treturn this.budgetEnforcer.autoCompressIfNeeded(context);\n\t}\n\n\tgetStats(): { historyLength: number; lastCompression: number } {\n\t\treturn { historyLength: this.history.length, lastCompression: Date.now() };\n\t}\n\n\tclearHistory(): void {\n\t\tthis.history = [];\n\t}\n}\n\nexport default LeanCTXEngine;\n"]}

package/dist/core/read-anchors.d.ts

@@ -1,110 +0,0 @@
-/**
- * `omk.read-anchor` — pure hash-anchored read/edit primitives.
- *
- * A read anchor binds a read result to the exact bytes the model saw: the
- * newline-normalized SHA-256 of the whole file plus the SHA-256 of the specific
- * line block that was read. Edits can then carry the anchor so the core can
- * reject stale edits (the file changed under the model) before applying them.
- *
- * All hashing in this module is performed on newline-normalized (LF) UTF-8
- * content so anchors are robust to CRLF/CR differences, matching the edit
- * pipeline which normalizes to LF before matching.
- *
- * Side-effect free: no filesystem access; `node:crypto` only.
- *
- * Derived clean-room from the lane C plan
- * (`.omk/runs/omk-package-hardening-plan/recovery-readseek.md`); no legacy
- * package source is imported or copied.
- */
-export declare const READ_ANCHOR_SCHEMA_VERSION = "omk.read-anchor.v1";
-export interface ReadAnchorRange {
-    /** 1-indexed start line (resolved). */
-    readonly offset: number;
-    /** Number of lines included in the block (resolved). */
-    readonly limit: number;
-    /** 1-indexed last line included, inclusive. Equals `offset - 1` for an empty block. */
-    readonly endLine: number;
-}
-export interface ReadAnchor {
-    readonly schemaVersion: typeof READ_ANCHOR_SCHEMA_VERSION;
-    readonly readId: string;
-    readonly path: string;
-    /** SHA-256 (hex) of the newline-normalized full file content. */
-    readonly fileSha256: string;
-    readonly range: ReadAnchorRange;
-    /** SHA-256 (hex) of the newline-normalized read block content. */
-    readonly blockSha256: string;
-}
-export interface CreateReadAnchorInput {
-    readonly path: string;
-    /** Full file content as read. */
-    readonly content: string;
-    /** 1-indexed start line; defaults to 1 (whole file). */
-    readonly offset?: number;
-    /** Maximum number of lines; defaults to the rest of the file. */
-    readonly limit?: number;
-    /** Optional deterministic id (otherwise a UUID is generated). */
-    readonly readId?: string;
-}
-/**
- * Create a hash anchor for a read. Hashes both the full (normalized) file and
- * the specific line block so a later edit can prove it is operating on the same
- * bytes the model saw.
- */
-export declare function createReadAnchor(input: CreateReadAnchorInput): ReadAnchor;
-export interface ReadAnchorVerification {
-    readonly ok: boolean;
-    readonly fileMatches: boolean;
-    readonly blockMatches: boolean;
-    readonly currentFileSha256: string;
-    readonly currentBlockSha256: string;
-}
-/**
- * Verify an anchor against the current file content. `fileMatches` is the strict
- * whole-file check; `blockMatches` re-extracts the anchored range and compares
- * the block hash (useful for lenient relocation diagnostics).
- */
-export declare function verifyReadAnchor(anchor: ReadAnchor, currentContent: string): ReadAnchorVerification;
-/** Validate an untrusted value as a {@link ReadAnchor}. Pure and fail-closed. */
-export declare function validateReadAnchor(value: unknown): {
-    ok: boolean;
-    errors: readonly string[];
-    anchor?: ReadAnchor;
-};
-export type AnchoredEditMode = "strict" | "lenient";
-export type AnchoredEditVerdict = "allow" | "allow-lenient" | "reject-stale";
-export interface AnchoredEditDecisionInput {
-    readonly anchor: ReadAnchor;
-    /** Current full file content at edit time. */
-    readonly currentContent: string;
-    /** Defaults to `strict`. */
-    readonly mode?: AnchoredEditMode;
-    /**
-     * The exact anchored block text (typically the edit's `oldText`). Required
-     * for lenient relocation when the file has changed; must hash to
-     * `anchor.blockSha256` to be trusted.
-     */
-    readonly anchoredBlockText?: string;
-}
-export interface AnchoredEditDecision {
-    readonly verdict: AnchoredEditVerdict;
-    readonly reason: string;
-    readonly currentFileSha256: string;
-    readonly fileChanged: boolean;
-    /** Lenient mode only: whether the anchored block was uniquely relocated. */
-    readonly blockRelocated?: boolean;
-    /** Lenient mode only: occurrences of the anchored block in current content. */
-    readonly occurrences?: number;
-}
-/**
- * Decide whether an anchored edit may proceed.
- *
- *  - Unchanged file -> `allow` (the common fast path).
- *  - Changed file, strict mode -> `reject-stale` (the default; forces a re-read).
- *  - Changed file, lenient mode -> `allow-lenient` only when the anchored block
- *    text is supplied, hashes to the recorded `blockSha256`, and still occurs
- *    exactly once in the current content (unique, non-overlapping relocation).
- *    Zero or multiple occurrences -> `reject-stale`.
- */
-export declare function decideAnchoredEdit(input: AnchoredEditDecisionInput): AnchoredEditDecision;
-//# sourceMappingURL=read-anchors.d.ts.map

package/dist/core/read-anchors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"read-anchors.d.ts","sourceRoot":"","sources":["../../src/core/read-anchors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,eAAO,MAAM,0BAA0B,uBAAuB,CAAC;AAE/D,MAAM,WAAW,eAAe;IAC/B,uCAAuC;IACvC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wDAAwD;IACxD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uFAAuF;IACvF,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IAC1B,QAAQ,CAAC,aAAa,EAAE,OAAO,0BAA0B,CAAC;IAC1D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,iEAAiE;IACjE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,eAAe,CAAC;IAChC,kEAAkE;IAClE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B;AAqCD,MAAM,WAAW,qBAAqB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,iCAAiC;IACjC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,wDAAwD;IACxD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,iEAAiE;IACjE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,iEAAiE;IACjE,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,qBAAqB,GAAG,UAAU,CAWzE;AAED,MAAM,WAAW,sBAAsB;IACtC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;IACrB,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;IAC/B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;CACpC;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,GAAG,sBAAsB,CAcnG;AAED,iFAAiF;AACjF,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG;IAAE,EAAE,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,MAAM,CAAC,EAAE,UAAU,CAAA;CAAE,CA+BlH;AAED,MAAM,MAAM,gBAAgB,GAAG,QAAQ,GAAG,SAAS,CAAC;AAEpD,MAAM,MAAM,mBAAmB,GAAG,OAAO,GAAG,eAAe,GAAG,cAAc,CAAC;AAE7E,MAAM,WAAW,yBAAyB;IACzC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,8CAA8C;IAC9C,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,4BAA4B;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,oBAAoB;IACpC,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,4EAA4E;IAC5E,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC,+EAA+E;IAC/E,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC9B;AAeD;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,yBAAyB,GAAG,oBAAoB,CAwDzF","sourcesContent":["/**\n * `omk.read-anchor` — pure hash-anchored read/edit primitives.\n *\n * A read anchor binds a read result to the exact bytes the model saw: the\n * newline-normalized SHA-256 of the whole file plus the SHA-256 of the specific\n * line block that was read. Edits can then carry the anchor so the core can\n * reject stale edits (the file changed under the model) before applying them.\n *\n * All hashing in this module is performed on newline-normalized (LF) UTF-8\n * content so anchors are robust to CRLF/CR differences, matching the edit\n * pipeline which normalizes to LF before matching.\n *\n * Side-effect free: no filesystem access; `node:crypto` only.\n *\n * Derived clean-room from the lane C plan\n * (`.omk/runs/omk-package-hardening-plan/recovery-readseek.md`); no legacy\n * package source is imported or copied.\n */\n\nimport { createHash, randomUUID } from \"node:crypto\";\n\nexport const READ_ANCHOR_SCHEMA_VERSION = \"omk.read-anchor.v1\";\n\nexport interface ReadAnchorRange {\n\t/** 1-indexed start line (resolved). */\n\treadonly offset: number;\n\t/** Number of lines included in the block (resolved). */\n\treadonly limit: number;\n\t/** 1-indexed last line included, inclusive. Equals `offset - 1` for an empty block. */\n\treadonly endLine: number;\n}\n\nexport interface ReadAnchor {\n\treadonly schemaVersion: typeof READ_ANCHOR_SCHEMA_VERSION;\n\treadonly readId: string;\n\treadonly path: string;\n\t/** SHA-256 (hex) of the newline-normalized full file content. */\n\treadonly fileSha256: string;\n\treadonly range: ReadAnchorRange;\n\t/** SHA-256 (hex) of the newline-normalized read block content. */\n\treadonly blockSha256: string;\n}\n\nconst HEX64 = /^[0-9a-f]{64}$/i;\n\nfunction normalizeNewlines(content: string): string {\n\treturn content.replace(/\\r\\n/g, \"\\n\").replace(/\\r/g, \"\\n\");\n}\n\nfunction sha256Hex(content: string): string {\n\treturn createHash(\"sha256\").update(content, \"utf8\").digest(\"hex\");\n}\n\ninterface ExtractedBlock {\n\treadonly text: string;\n\treadonly range: ReadAnchorRange;\n}\n\n/**\n * Extract a line block from already newline-normalized content using read-tool\n * semantics: `offset` is a 1-indexed start line, `limit` is the maximum number\n * of lines. Out-of-range requests clamp to an empty block at the end of file.\n */\nfunction extractBlock(normalized: string, offset: number | undefined, limit: number | undefined): ExtractedBlock {\n\tconst lines = normalized.split(\"\\n\");\n\tconst start = Math.max(1, Math.floor(offset ?? 1));\n\tif (start > lines.length) {\n\t\treturn { text: \"\", range: { offset: start, limit: 0, endLine: start - 1 } };\n\t}\n\tconst available = lines.length - (start - 1);\n\tconst count = limit === undefined ? available : Math.max(0, Math.min(Math.floor(limit), available));\n\tconst blockLines = lines.slice(start - 1, start - 1 + count);\n\treturn {\n\t\ttext: blockLines.join(\"\\n\"),\n\t\trange: { offset: start, limit: count, endLine: start - 1 + count },\n\t};\n}\n\nexport interface CreateReadAnchorInput {\n\treadonly path: string;\n\t/** Full file content as read. */\n\treadonly content: string;\n\t/** 1-indexed start line; defaults to 1 (whole file). */\n\treadonly offset?: number;\n\t/** Maximum number of lines; defaults to the rest of the file. */\n\treadonly limit?: number;\n\t/** Optional deterministic id (otherwise a UUID is generated). */\n\treadonly readId?: string;\n}\n\n/**\n * Create a hash anchor for a read. Hashes both the full (normalized) file and\n * the specific line block so a later edit can prove it is operating on the same\n * bytes the model saw.\n */\nexport function createReadAnchor(input: CreateReadAnchorInput): ReadAnchor {\n\tconst normalized = normalizeNewlines(input.content);\n\tconst block = extractBlock(normalized, input.offset, input.limit);\n\treturn {\n\t\tschemaVersion: READ_ANCHOR_SCHEMA_VERSION,\n\t\treadId: input.readId ?? randomUUID(),\n\t\tpath: input.path,\n\t\tfileSha256: sha256Hex(normalized),\n\t\trange: block.range,\n\t\tblockSha256: sha256Hex(block.text),\n\t};\n}\n\nexport interface ReadAnchorVerification {\n\treadonly ok: boolean;\n\treadonly fileMatches: boolean;\n\treadonly blockMatches: boolean;\n\treadonly currentFileSha256: string;\n\treadonly currentBlockSha256: string;\n}\n\n/**\n * Verify an anchor against the current file content. `fileMatches` is the strict\n * whole-file check; `blockMatches` re-extracts the anchored range and compares\n * the block hash (useful for lenient relocation diagnostics).\n */\nexport function verifyReadAnchor(anchor: ReadAnchor, currentContent: string): ReadAnchorVerification {\n\tconst normalized = normalizeNewlines(currentContent);\n\tconst currentFileSha256 = sha256Hex(normalized);\n\tconst block = extractBlock(normalized, anchor.range.offset, anchor.range.limit);\n\tconst currentBlockSha256 = sha256Hex(block.text);\n\tconst fileMatches = currentFileSha256 === anchor.fileSha256;\n\tconst blockMatches = currentBlockSha256 === anchor.blockSha256;\n\treturn {\n\t\tok: fileMatches && blockMatches,\n\t\tfileMatches,\n\t\tblockMatches,\n\t\tcurrentFileSha256,\n\t\tcurrentBlockSha256,\n\t};\n}\n\n/** Validate an untrusted value as a {@link ReadAnchor}. Pure and fail-closed. */\nexport function validateReadAnchor(value: unknown): { ok: boolean; errors: readonly string[]; anchor?: ReadAnchor } {\n\tconst errors: string[] = [];\n\tif (typeof value !== \"object\" || value === null || Array.isArray(value)) {\n\t\treturn { ok: false, errors: [\"anchor must be an object\"] };\n\t}\n\tconst anchor = value as Record<string, unknown>;\n\tif (anchor.schemaVersion !== READ_ANCHOR_SCHEMA_VERSION) {\n\t\terrors.push(`schemaVersion must be ${READ_ANCHOR_SCHEMA_VERSION}`);\n\t}\n\tif (typeof anchor.readId !== \"string\" || anchor.readId.length === 0)\n\t\terrors.push(\"readId must be a non-empty string\");\n\tif (typeof anchor.path !== \"string\" || anchor.path.length === 0) errors.push(\"path must be a non-empty string\");\n\tif (typeof anchor.fileSha256 !== \"string\" || !HEX64.test(anchor.fileSha256)) {\n\t\terrors.push(\"fileSha256 must be a 64-char hex digest\");\n\t}\n\tif (typeof anchor.blockSha256 !== \"string\" || !HEX64.test(anchor.blockSha256)) {\n\t\terrors.push(\"blockSha256 must be a 64-char hex digest\");\n\t}\n\tconst range = anchor.range;\n\tif (typeof range !== \"object\" || range === null || Array.isArray(range)) {\n\t\terrors.push(\"range must be an object\");\n\t} else {\n\t\tconst r = range as Record<string, unknown>;\n\t\tfor (const key of [\"offset\", \"limit\", \"endLine\"]) {\n\t\t\tif (typeof r[key] !== \"number\" || !Number.isInteger(r[key]) || (r[key] as number) < 0) {\n\t\t\t\terrors.push(`range.${key} must be a non-negative integer`);\n\t\t\t}\n\t\t}\n\t}\n\tif (errors.length > 0) return { ok: false, errors };\n\treturn { ok: true, errors: [], anchor: value as unknown as ReadAnchor };\n}\n\nexport type AnchoredEditMode = \"strict\" | \"lenient\";\n\nexport type AnchoredEditVerdict = \"allow\" | \"allow-lenient\" | \"reject-stale\";\n\nexport interface AnchoredEditDecisionInput {\n\treadonly anchor: ReadAnchor;\n\t/** Current full file content at edit time. */\n\treadonly currentContent: string;\n\t/** Defaults to `strict`. */\n\treadonly mode?: AnchoredEditMode;\n\t/**\n\t * The exact anchored block text (typically the edit's `oldText`). Required\n\t * for lenient relocation when the file has changed; must hash to\n\t * `anchor.blockSha256` to be trusted.\n\t */\n\treadonly anchoredBlockText?: string;\n}\n\nexport interface AnchoredEditDecision {\n\treadonly verdict: AnchoredEditVerdict;\n\treadonly reason: string;\n\treadonly currentFileSha256: string;\n\treadonly fileChanged: boolean;\n\t/** Lenient mode only: whether the anchored block was uniquely relocated. */\n\treadonly blockRelocated?: boolean;\n\t/** Lenient mode only: occurrences of the anchored block in current content. */\n\treadonly occurrences?: number;\n}\n\nfunction countOccurrences(haystack: string, needle: string): number {\n\tif (needle.length === 0) return 0;\n\tlet count = 0;\n\tlet index = haystack.indexOf(needle);\n\twhile (index !== -1) {\n\t\tcount += 1;\n\t\tindex = haystack.indexOf(needle, index + needle.length);\n\t}\n\treturn count;\n}\n\nconst STALE_REREAD_HINT = \"stale read: the file changed since it was read; re-read the file before editing\";\n\n/**\n * Decide whether an anchored edit may proceed.\n *\n *  - Unchanged file -> `allow` (the common fast path).\n *  - Changed file, strict mode -> `reject-stale` (the default; forces a re-read).\n *  - Changed file, lenient mode -> `allow-lenient` only when the anchored block\n *    text is supplied, hashes to the recorded `blockSha256`, and still occurs\n *    exactly once in the current content (unique, non-overlapping relocation).\n *    Zero or multiple occurrences -> `reject-stale`.\n */\nexport function decideAnchoredEdit(input: AnchoredEditDecisionInput): AnchoredEditDecision {\n\tconst mode = input.mode ?? \"strict\";\n\tconst normalized = normalizeNewlines(input.currentContent);\n\tconst currentFileSha256 = sha256Hex(normalized);\n\tconst fileChanged = currentFileSha256 !== input.anchor.fileSha256;\n\n\tif (!fileChanged) {\n\t\treturn { verdict: \"allow\", reason: \"current file hash matches the anchor\", currentFileSha256, fileChanged };\n\t}\n\n\tif (mode === \"strict\") {\n\t\treturn { verdict: \"reject-stale\", reason: STALE_REREAD_HINT, currentFileSha256, fileChanged };\n\t}\n\n\tconst blockText = input.anchoredBlockText;\n\tif (blockText === undefined || blockText.length === 0) {\n\t\treturn {\n\t\t\tverdict: \"reject-stale\",\n\t\t\treason: \"lenient relocation requires the anchored block text\",\n\t\t\tcurrentFileSha256,\n\t\t\tfileChanged,\n\t\t};\n\t}\n\n\tconst normalizedBlock = normalizeNewlines(blockText);\n\tif (sha256Hex(normalizedBlock) !== input.anchor.blockSha256) {\n\t\treturn {\n\t\t\tverdict: \"reject-stale\",\n\t\t\treason: \"supplied block text does not match the anchored block hash\",\n\t\t\tcurrentFileSha256,\n\t\t\tfileChanged,\n\t\t};\n\t}\n\n\tconst occurrences = countOccurrences(normalized, normalizedBlock);\n\tif (occurrences === 1) {\n\t\treturn {\n\t\t\tverdict: \"allow-lenient\",\n\t\t\treason: \"file changed but the anchored block is still uniquely locatable\",\n\t\t\tcurrentFileSha256,\n\t\t\tfileChanged,\n\t\t\tblockRelocated: true,\n\t\t\toccurrences,\n\t\t};\n\t}\n\treturn {\n\t\tverdict: \"reject-stale\",\n\t\treason:\n\t\t\toccurrences === 0\n\t\t\t\t? \"anchored block no longer exists in the current file\"\n\t\t\t\t: \"anchored block is ambiguous (multiple matches) in the current file\",\n\t\tcurrentFileSha256,\n\t\tfileChanged,\n\t\tblockRelocated: false,\n\t\toccurrences,\n\t};\n}\n"]}

package/dist/core/read-anchors.js

@@ -1,193 +0,0 @@
-/**
- * `omk.read-anchor` — pure hash-anchored read/edit primitives.
- *
- * A read anchor binds a read result to the exact bytes the model saw: the
- * newline-normalized SHA-256 of the whole file plus the SHA-256 of the specific
- * line block that was read. Edits can then carry the anchor so the core can
- * reject stale edits (the file changed under the model) before applying them.
- *
- * All hashing in this module is performed on newline-normalized (LF) UTF-8
- * content so anchors are robust to CRLF/CR differences, matching the edit
- * pipeline which normalizes to LF before matching.
- *
- * Side-effect free: no filesystem access; `node:crypto` only.
- *
- * Derived clean-room from the lane C plan
- * (`.omk/runs/omk-package-hardening-plan/recovery-readseek.md`); no legacy
- * package source is imported or copied.
- */
-import { createHash, randomUUID } from "node:crypto";
-export const READ_ANCHOR_SCHEMA_VERSION = "omk.read-anchor.v1";
-const HEX64 = /^[0-9a-f]{64}$/i;
-function normalizeNewlines(content) {
-    return content.replace(/\r\n/g, "\n").replace(/\r/g, "\n");
-}
-function sha256Hex(content) {
-    return createHash("sha256").update(content, "utf8").digest("hex");
-}
-/**
- * Extract a line block from already newline-normalized content using read-tool
- * semantics: `offset` is a 1-indexed start line, `limit` is the maximum number
- * of lines. Out-of-range requests clamp to an empty block at the end of file.
- */
-function extractBlock(normalized, offset, limit) {
-    const lines = normalized.split("\n");
-    const start = Math.max(1, Math.floor(offset ?? 1));
-    if (start > lines.length) {
-        return { text: "", range: { offset: start, limit: 0, endLine: start - 1 } };
-    }
-    const available = lines.length - (start - 1);
-    const count = limit === undefined ? available : Math.max(0, Math.min(Math.floor(limit), available));
-    const blockLines = lines.slice(start - 1, start - 1 + count);
-    return {
-        text: blockLines.join("\n"),
-        range: { offset: start, limit: count, endLine: start - 1 + count },
-    };
-}
-/**
- * Create a hash anchor for a read. Hashes both the full (normalized) file and
- * the specific line block so a later edit can prove it is operating on the same
- * bytes the model saw.
- */
-export function createReadAnchor(input) {
-    const normalized = normalizeNewlines(input.content);
-    const block = extractBlock(normalized, input.offset, input.limit);
-    return {
-        schemaVersion: READ_ANCHOR_SCHEMA_VERSION,
-        readId: input.readId ?? randomUUID(),
-        path: input.path,
-        fileSha256: sha256Hex(normalized),
-        range: block.range,
-        blockSha256: sha256Hex(block.text),
-    };
-}
-/**
- * Verify an anchor against the current file content. `fileMatches` is the strict
- * whole-file check; `blockMatches` re-extracts the anchored range and compares
- * the block hash (useful for lenient relocation diagnostics).
- */
-export function verifyReadAnchor(anchor, currentContent) {
-    const normalized = normalizeNewlines(currentContent);
-    const currentFileSha256 = sha256Hex(normalized);
-    const block = extractBlock(normalized, anchor.range.offset, anchor.range.limit);
-    const currentBlockSha256 = sha256Hex(block.text);
-    const fileMatches = currentFileSha256 === anchor.fileSha256;
-    const blockMatches = currentBlockSha256 === anchor.blockSha256;
-    return {
-        ok: fileMatches && blockMatches,
-        fileMatches,
-        blockMatches,
-        currentFileSha256,
-        currentBlockSha256,
-    };
-}
-/** Validate an untrusted value as a {@link ReadAnchor}. Pure and fail-closed. */
-export function validateReadAnchor(value) {
-    const errors = [];
-    if (typeof value !== "object" || value === null || Array.isArray(value)) {
-        return { ok: false, errors: ["anchor must be an object"] };
-    }
-    const anchor = value;
-    if (anchor.schemaVersion !== READ_ANCHOR_SCHEMA_VERSION) {
-        errors.push(`schemaVersion must be ${READ_ANCHOR_SCHEMA_VERSION}`);
-    }
-    if (typeof anchor.readId !== "string" || anchor.readId.length === 0)
-        errors.push("readId must be a non-empty string");
-    if (typeof anchor.path !== "string" || anchor.path.length === 0)
-        errors.push("path must be a non-empty string");
-    if (typeof anchor.fileSha256 !== "string" || !HEX64.test(anchor.fileSha256)) {
-        errors.push("fileSha256 must be a 64-char hex digest");
-    }
-    if (typeof anchor.blockSha256 !== "string" || !HEX64.test(anchor.blockSha256)) {
-        errors.push("blockSha256 must be a 64-char hex digest");
-    }
-    const range = anchor.range;
-    if (typeof range !== "object" || range === null || Array.isArray(range)) {
-        errors.push("range must be an object");
-    }
-    else {
-        const r = range;
-        for (const key of ["offset", "limit", "endLine"]) {
-            if (typeof r[key] !== "number" || !Number.isInteger(r[key]) || r[key] < 0) {
-                errors.push(`range.${key} must be a non-negative integer`);
-            }
-        }
-    }
-    if (errors.length > 0)
-        return { ok: false, errors };
-    return { ok: true, errors: [], anchor: value };
-}
-function countOccurrences(haystack, needle) {
-    if (needle.length === 0)
-        return 0;
-    let count = 0;
-    let index = haystack.indexOf(needle);
-    while (index !== -1) {
-        count += 1;
-        index = haystack.indexOf(needle, index + needle.length);
-    }
-    return count;
-}
-const STALE_REREAD_HINT = "stale read: the file changed since it was read; re-read the file before editing";
-/**
- * Decide whether an anchored edit may proceed.
- *
- *  - Unchanged file -> `allow` (the common fast path).
- *  - Changed file, strict mode -> `reject-stale` (the default; forces a re-read).
- *  - Changed file, lenient mode -> `allow-lenient` only when the anchored block
- *    text is supplied, hashes to the recorded `blockSha256`, and still occurs
- *    exactly once in the current content (unique, non-overlapping relocation).
- *    Zero or multiple occurrences -> `reject-stale`.
- */
-export function decideAnchoredEdit(input) {
-    const mode = input.mode ?? "strict";
-    const normalized = normalizeNewlines(input.currentContent);
-    const currentFileSha256 = sha256Hex(normalized);
-    const fileChanged = currentFileSha256 !== input.anchor.fileSha256;
-    if (!fileChanged) {
-        return { verdict: "allow", reason: "current file hash matches the anchor", currentFileSha256, fileChanged };
-    }
-    if (mode === "strict") {
-        return { verdict: "reject-stale", reason: STALE_REREAD_HINT, currentFileSha256, fileChanged };
-    }
-    const blockText = input.anchoredBlockText;
-    if (blockText === undefined || blockText.length === 0) {
-        return {
-            verdict: "reject-stale",
-            reason: "lenient relocation requires the anchored block text",
-            currentFileSha256,
-            fileChanged,
-        };
-    }
-    const normalizedBlock = normalizeNewlines(blockText);
-    if (sha256Hex(normalizedBlock) !== input.anchor.blockSha256) {
-        return {
-            verdict: "reject-stale",
-            reason: "supplied block text does not match the anchored block hash",
-            currentFileSha256,
-            fileChanged,
-        };
-    }
-    const occurrences = countOccurrences(normalized, normalizedBlock);
-    if (occurrences === 1) {
-        return {
-            verdict: "allow-lenient",
-            reason: "file changed but the anchored block is still uniquely locatable",
-            currentFileSha256,
-            fileChanged,
-            blockRelocated: true,
-            occurrences,
-        };
-    }
-    return {
-        verdict: "reject-stale",
-        reason: occurrences === 0
-            ? "anchored block no longer exists in the current file"
-            : "anchored block is ambiguous (multiple matches) in the current file",
-        currentFileSha256,
-        fileChanged,
-        blockRelocated: false,
-        occurrences,
-    };
-}
-//# sourceMappingURL=read-anchors.js.map

package/dist/core/read-anchors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"read-anchors.js","sourceRoot":"","sources":["../../src/core/read-anchors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErD,MAAM,CAAC,MAAM,0BAA0B,GAAG,oBAAoB,CAAC;AAsB/D,MAAM,KAAK,GAAG,iBAAiB,CAAC;AAEhC,SAAS,iBAAiB,CAAC,OAAe,EAAU;IACnD,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAAA,CAC3D;AAED,SAAS,SAAS,CAAC,OAAe,EAAU;IAC3C,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAAA,CAClE;AAOD;;;;GAIG;AACH,SAAS,YAAY,CAAC,UAAkB,EAAE,MAA0B,EAAE,KAAyB,EAAkB;IAChH,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC;IAC7E,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IACpG,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC7D,OAAO;QACN,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;QAC3B,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE;KAClE,CAAC;AAAA,CACF;AAcD;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B,EAAc;IAC1E,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAClE,OAAO;QACN,aAAa,EAAE,0BAA0B;QACzC,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,UAAU,EAAE;QACpC,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,UAAU,EAAE,SAAS,CAAC,UAAU,CAAC;QACjC,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,WAAW,EAAE,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;KAClC,CAAC;AAAA,CACF;AAUD;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAkB,EAAE,cAAsB,EAA0B;IACpG,MAAM,UAAU,GAAG,iBAAiB,CAAC,cAAc,CAAC,CAAC;IACrD,MAAM,iBAAiB,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChF,MAAM,kBAAkB,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjD,MAAM,WAAW,GAAG,iBAAiB,KAAK,MAAM,CAAC,UAAU,CAAC;IAC5D,MAAM,YAAY,GAAG,kBAAkB,KAAK,MAAM,CAAC,WAAW,CAAC;IAC/D,OAAO;QACN,EAAE,EAAE,WAAW,IAAI,YAAY;QAC/B,WAAW;QACX,YAAY;QACZ,iBAAiB;QACjB,kBAAkB;KAClB,CAAC;AAAA,CACF;AAED,iFAAiF;AACjF,MAAM,UAAU,kBAAkB,CAAC,KAAc,EAAmE;IACnH,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,0BAA0B,CAAC,EAAE,CAAC;IAC5D,CAAC;IACD,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,IAAI,MAAM,CAAC,aAAa,KAAK,0BAA0B,EAAE,CAAC;QACzD,MAAM,CAAC,IAAI,CAAC,yBAAyB,0BAA0B,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAClE,MAAM,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;IAClD,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;IAChH,IAAI,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7E,MAAM,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,OAAO,MAAM,CAAC,WAAW,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;QAC/E,MAAM,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzE,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IACxC,CAAC;SAAM,CAAC;QACP,MAAM,CAAC,GAAG,KAAgC,CAAC;QAC3C,KAAK,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;YAClD,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC,CAAC,GAAG,CAAY,GAAG,CAAC,EAAE,CAAC;gBACvF,MAAM,CAAC,IAAI,CAAC,SAAS,GAAG,iCAAiC,CAAC,CAAC;YAC5D,CAAC;QACF,CAAC;IACF,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IACpD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAA8B,EAAE,CAAC;AAAA,CACxE;AA+BD,SAAS,gBAAgB,CAAC,QAAgB,EAAE,MAAc,EAAU;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC;QACX,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,KAAK,CAAC;AAAA,CACb;AAED,MAAM,iBAAiB,GAAG,iFAAiF,CAAC;AAE5G;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAgC,EAAwB;IAC1F,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,QAAQ,CAAC;IACpC,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC3D,MAAM,iBAAiB,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,iBAAiB,KAAK,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC;IAElE,IAAI,CAAC,WAAW,EAAE,CAAC;QAClB,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,sCAAsC,EAAE,iBAAiB,EAAE,WAAW,EAAE,CAAC;IAC7G,CAAC;IAED,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACvB,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,WAAW,EAAE,CAAC;IAC/F,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,iBAAiB,CAAC;IAC1C,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvD,OAAO;YACN,OAAO,EAAE,cAAc;YACvB,MAAM,EAAE,qDAAqD;YAC7D,iBAAiB;YACjB,WAAW;SACX,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACrD,IAAI,SAAS,CAAC,eAAe,CAAC,KAAK,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QAC7D,OAAO;YACN,OAAO,EAAE,cAAc;YACvB,MAAM,EAAE,4DAA4D;YACpE,iBAAiB;YACjB,WAAW;SACX,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,gBAAgB,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;IAClE,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACN,OAAO,EAAE,eAAe;YACxB,MAAM,EAAE,iEAAiE;YACzE,iBAAiB;YACjB,WAAW;YACX,cAAc,EAAE,IAAI;YACpB,WAAW;SACX,CAAC;IACH,CAAC;IACD,OAAO;QACN,OAAO,EAAE,cAAc;QACvB,MAAM,EACL,WAAW,KAAK,CAAC;YAChB,CAAC,CAAC,qDAAqD;YACvD,CAAC,CAAC,oEAAoE;QACxE,iBAAiB;QACjB,WAAW;QACX,cAAc,EAAE,KAAK;QACrB,WAAW;KACX,CAAC;AAAA,CACF","sourcesContent":["/**\n * `omk.read-anchor` — pure hash-anchored read/edit primitives.\n *\n * A read anchor binds a read result to the exact bytes the model saw: the\n * newline-normalized SHA-256 of the whole file plus the SHA-256 of the specific\n * line block that was read. Edits can then carry the anchor so the core can\n * reject stale edits (the file changed under the model) before applying them.\n *\n * All hashing in this module is performed on newline-normalized (LF) UTF-8\n * content so anchors are robust to CRLF/CR differences, matching the edit\n * pipeline which normalizes to LF before matching.\n *\n * Side-effect free: no filesystem access; `node:crypto` only.\n *\n * Derived clean-room from the lane C plan\n * (`.omk/runs/omk-package-hardening-plan/recovery-readseek.md`); no legacy\n * package source is imported or copied.\n */\n\nimport { createHash, randomUUID } from \"node:crypto\";\n\nexport const READ_ANCHOR_SCHEMA_VERSION = \"omk.read-anchor.v1\";\n\nexport interface ReadAnchorRange {\n\t/** 1-indexed start line (resolved). */\n\treadonly offset: number;\n\t/** Number of lines included in the block (resolved). */\n\treadonly limit: number;\n\t/** 1-indexed last line included, inclusive. Equals `offset - 1` for an empty block. */\n\treadonly endLine: number;\n}\n\nexport interface ReadAnchor {\n\treadonly schemaVersion: typeof READ_ANCHOR_SCHEMA_VERSION;\n\treadonly readId: string;\n\treadonly path: string;\n\t/** SHA-256 (hex) of the newline-normalized full file content. */\n\treadonly fileSha256: string;\n\treadonly range: ReadAnchorRange;\n\t/** SHA-256 (hex) of the newline-normalized read block content. */\n\treadonly blockSha256: string;\n}\n\nconst HEX64 = /^[0-9a-f]{64}$/i;\n\nfunction normalizeNewlines(content: string): string {\n\treturn content.replace(/\\r\\n/g, \"\\n\").replace(/\\r/g, \"\\n\");\n}\n\nfunction sha256Hex(content: string): string {\n\treturn createHash(\"sha256\").update(content, \"utf8\").digest(\"hex\");\n}\n\ninterface ExtractedBlock {\n\treadonly text: string;\n\treadonly range: ReadAnchorRange;\n}\n\n/**\n * Extract a line block from already newline-normalized content using read-tool\n * semantics: `offset` is a 1-indexed start line, `limit` is the maximum number\n * of lines. Out-of-range requests clamp to an empty block at the end of file.\n */\nfunction extractBlock(normalized: string, offset: number | undefined, limit: number | undefined): ExtractedBlock {\n\tconst lines = normalized.split(\"\\n\");\n\tconst start = Math.max(1, Math.floor(offset ?? 1));\n\tif (start > lines.length) {\n\t\treturn { text: \"\", range: { offset: start, limit: 0, endLine: start - 1 } };\n\t}\n\tconst available = lines.length - (start - 1);\n\tconst count = limit === undefined ? available : Math.max(0, Math.min(Math.floor(limit), available));\n\tconst blockLines = lines.slice(start - 1, start - 1 + count);\n\treturn {\n\t\ttext: blockLines.join(\"\\n\"),\n\t\trange: { offset: start, limit: count, endLine: start - 1 + count },\n\t};\n}\n\nexport interface CreateReadAnchorInput {\n\treadonly path: string;\n\t/** Full file content as read. */\n\treadonly content: string;\n\t/** 1-indexed start line; defaults to 1 (whole file). */\n\treadonly offset?: number;\n\t/** Maximum number of lines; defaults to the rest of the file. */\n\treadonly limit?: number;\n\t/** Optional deterministic id (otherwise a UUID is generated). */\n\treadonly readId?: string;\n}\n\n/**\n * Create a hash anchor for a read. Hashes both the full (normalized) file and\n * the specific line block so a later edit can prove it is operating on the same\n * bytes the model saw.\n */\nexport function createReadAnchor(input: CreateReadAnchorInput): ReadAnchor {\n\tconst normalized = normalizeNewlines(input.content);\n\tconst block = extractBlock(normalized, input.offset, input.limit);\n\treturn {\n\t\tschemaVersion: READ_ANCHOR_SCHEMA_VERSION,\n\t\treadId: input.readId ?? randomUUID(),\n\t\tpath: input.path,\n\t\tfileSha256: sha256Hex(normalized),\n\t\trange: block.range,\n\t\tblockSha256: sha256Hex(block.text),\n\t};\n}\n\nexport interface ReadAnchorVerification {\n\treadonly ok: boolean;\n\treadonly fileMatches: boolean;\n\treadonly blockMatches: boolean;\n\treadonly currentFileSha256: string;\n\treadonly currentBlockSha256: string;\n}\n\n/**\n * Verify an anchor against the current file content. `fileMatches` is the strict\n * whole-file check; `blockMatches` re-extracts the anchored range and compares\n * the block hash (useful for lenient relocation diagnostics).\n */\nexport function verifyReadAnchor(anchor: ReadAnchor, currentContent: string): ReadAnchorVerification {\n\tconst normalized = normalizeNewlines(currentContent);\n\tconst currentFileSha256 = sha256Hex(normalized);\n\tconst block = extractBlock(normalized, anchor.range.offset, anchor.range.limit);\n\tconst currentBlockSha256 = sha256Hex(block.text);\n\tconst fileMatches = currentFileSha256 === anchor.fileSha256;\n\tconst blockMatches = currentBlockSha256 === anchor.blockSha256;\n\treturn {\n\t\tok: fileMatches && blockMatches,\n\t\tfileMatches,\n\t\tblockMatches,\n\t\tcurrentFileSha256,\n\t\tcurrentBlockSha256,\n\t};\n}\n\n/** Validate an untrusted value as a {@link ReadAnchor}. Pure and fail-closed. */\nexport function validateReadAnchor(value: unknown): { ok: boolean; errors: readonly string[]; anchor?: ReadAnchor } {\n\tconst errors: string[] = [];\n\tif (typeof value !== \"object\" || value === null || Array.isArray(value)) {\n\t\treturn { ok: false, errors: [\"anchor must be an object\"] };\n\t}\n\tconst anchor = value as Record<string, unknown>;\n\tif (anchor.schemaVersion !== READ_ANCHOR_SCHEMA_VERSION) {\n\t\terrors.push(`schemaVersion must be ${READ_ANCHOR_SCHEMA_VERSION}`);\n\t}\n\tif (typeof anchor.readId !== \"string\" || anchor.readId.length === 0)\n\t\terrors.push(\"readId must be a non-empty string\");\n\tif (typeof anchor.path !== \"string\" || anchor.path.length === 0) errors.push(\"path must be a non-empty string\");\n\tif (typeof anchor.fileSha256 !== \"string\" || !HEX64.test(anchor.fileSha256)) {\n\t\terrors.push(\"fileSha256 must be a 64-char hex digest\");\n\t}\n\tif (typeof anchor.blockSha256 !== \"string\" || !HEX64.test(anchor.blockSha256)) {\n\t\terrors.push(\"blockSha256 must be a 64-char hex digest\");\n\t}\n\tconst range = anchor.range;\n\tif (typeof range !== \"object\" || range === null || Array.isArray(range)) {\n\t\terrors.push(\"range must be an object\");\n\t} else {\n\t\tconst r = range as Record<string, unknown>;\n\t\tfor (const key of [\"offset\", \"limit\", \"endLine\"]) {\n\t\t\tif (typeof r[key] !== \"number\" || !Number.isInteger(r[key]) || (r[key] as number) < 0) {\n\t\t\t\terrors.push(`range.${key} must be a non-negative integer`);\n\t\t\t}\n\t\t}\n\t}\n\tif (errors.length > 0) return { ok: false, errors };\n\treturn { ok: true, errors: [], anchor: value as unknown as ReadAnchor };\n}\n\nexport type AnchoredEditMode = \"strict\" | \"lenient\";\n\nexport type AnchoredEditVerdict = \"allow\" | \"allow-lenient\" | \"reject-stale\";\n\nexport interface AnchoredEditDecisionInput {\n\treadonly anchor: ReadAnchor;\n\t/** Current full file content at edit time. */\n\treadonly currentContent: string;\n\t/** Defaults to `strict`. */\n\treadonly mode?: AnchoredEditMode;\n\t/**\n\t * The exact anchored block text (typically the edit's `oldText`). Required\n\t * for lenient relocation when the file has changed; must hash to\n\t * `anchor.blockSha256` to be trusted.\n\t */\n\treadonly anchoredBlockText?: string;\n}\n\nexport interface AnchoredEditDecision {\n\treadonly verdict: AnchoredEditVerdict;\n\treadonly reason: string;\n\treadonly currentFileSha256: string;\n\treadonly fileChanged: boolean;\n\t/** Lenient mode only: whether the anchored block was uniquely relocated. */\n\treadonly blockRelocated?: boolean;\n\t/** Lenient mode only: occurrences of the anchored block in current content. */\n\treadonly occurrences?: number;\n}\n\nfunction countOccurrences(haystack: string, needle: string): number {\n\tif (needle.length === 0) return 0;\n\tlet count = 0;\n\tlet index = haystack.indexOf(needle);\n\twhile (index !== -1) {\n\t\tcount += 1;\n\t\tindex = haystack.indexOf(needle, index + needle.length);\n\t}\n\treturn count;\n}\n\nconst STALE_REREAD_HINT = \"stale read: the file changed since it was read; re-read the file before editing\";\n\n/**\n * Decide whether an anchored edit may proceed.\n *\n *  - Unchanged file -> `allow` (the common fast path).\n *  - Changed file, strict mode -> `reject-stale` (the default; forces a re-read).\n *  - Changed file, lenient mode -> `allow-lenient` only when the anchored block\n *    text is supplied, hashes to the recorded `blockSha256`, and still occurs\n *    exactly once in the current content (unique, non-overlapping relocation).\n *    Zero or multiple occurrences -> `reject-stale`.\n */\nexport function decideAnchoredEdit(input: AnchoredEditDecisionInput): AnchoredEditDecision {\n\tconst mode = input.mode ?? \"strict\";\n\tconst normalized = normalizeNewlines(input.currentContent);\n\tconst currentFileSha256 = sha256Hex(normalized);\n\tconst fileChanged = currentFileSha256 !== input.anchor.fileSha256;\n\n\tif (!fileChanged) {\n\t\treturn { verdict: \"allow\", reason: \"current file hash matches the anchor\", currentFileSha256, fileChanged };\n\t}\n\n\tif (mode === \"strict\") {\n\t\treturn { verdict: \"reject-stale\", reason: STALE_REREAD_HINT, currentFileSha256, fileChanged };\n\t}\n\n\tconst blockText = input.anchoredBlockText;\n\tif (blockText === undefined || blockText.length === 0) {\n\t\treturn {\n\t\t\tverdict: \"reject-stale\",\n\t\t\treason: \"lenient relocation requires the anchored block text\",\n\t\t\tcurrentFileSha256,\n\t\t\tfileChanged,\n\t\t};\n\t}\n\n\tconst normalizedBlock = normalizeNewlines(blockText);\n\tif (sha256Hex(normalizedBlock) !== input.anchor.blockSha256) {\n\t\treturn {\n\t\t\tverdict: \"reject-stale\",\n\t\t\treason: \"supplied block text does not match the anchored block hash\",\n\t\t\tcurrentFileSha256,\n\t\t\tfileChanged,\n\t\t};\n\t}\n\n\tconst occurrences = countOccurrences(normalized, normalizedBlock);\n\tif (occurrences === 1) {\n\t\treturn {\n\t\t\tverdict: \"allow-lenient\",\n\t\t\treason: \"file changed but the anchored block is still uniquely locatable\",\n\t\t\tcurrentFileSha256,\n\t\t\tfileChanged,\n\t\t\tblockRelocated: true,\n\t\t\toccurrences,\n\t\t};\n\t}\n\treturn {\n\t\tverdict: \"reject-stale\",\n\t\treason:\n\t\t\toccurrences === 0\n\t\t\t\t? \"anchored block no longer exists in the current file\"\n\t\t\t\t: \"anchored block is ambiguous (multiple matches) in the current file\",\n\t\tcurrentFileSha256,\n\t\tfileChanged,\n\t\tblockRelocated: false,\n\t\toccurrences,\n\t};\n}\n"]}