@dzhechkov/harness-core 0.3.112 → 0.3.114

package/dist/session-retro.js

@@ -0,0 +1,325 @@
+/**
+ * Per-session retro & co-learning loop (feature session-retro-colearn, ADR-001).
+ *
+ * At session end, `dz retro` mines the CURRENT session transcript for recurring PROCESS rakes, drills the
+ * user (socratic + checklist), and teaches/reinforces the agent — from the same mistake ("учиться вместе").
+ * The recurrence ledger IS the `dz teach` store (domain `retro`), so agent-recall and user-recurrence read
+ * ONE store (Step-0 recall: a feedback loop needs collect + rank + apply, not two write-only logs).
+ *
+ * parse/detect/render are PURE + deterministic (sorted, no clock/random); the stream/find helpers do disk
+ * I/O with TOP-LEVEL node:fs (harness-core is ESM — a lazy require() is undefined at runtime; the R1 footgun)
+ * and NEVER slurp a whole transcript (they reach ~95 MB — read + split lines, parse line-by-line).
+ *
+ * SAFETY PROPERTY (ADR-001 §3, load-bearing): a rake seen for the FIRST time (effective count < threshold)
+ * is taught silently but NOT drilled — no nagging on a one-off. Drills are for recurrent patterns only.
+ */
+import { existsSync, readFileSync, readdirSync, statSync, openSync, readSync, closeSync } from 'node:fs';
+import { join } from 'node:path';
+import { homedir } from 'node:os';
+export const RETRO_DOMAIN = 'retro';
+export const DEFAULT_DRILL_THRESHOLD = 2;
+export const PROCESS_SIGNATURES = [
+    {
+        id: 'claimed-done-without-verify',
+        label: 'claimed done/fixed without running a verification',
+        socratic: 'Before you typed "done" — what exact command would have PROVEN it? Predict it, then check whether you actually ran it.',
+        checklist: 'Run the verification (test / build / repro) and READ its output BEFORE claiming done. No completion claim without fresh evidence.',
+        skill: 'validate',
+    },
+    {
+        id: 'n-fix-cycles',
+        label: 'multiple fix→break→fix cycles on one file (no root cause)',
+        socratic: 'After the 2nd failed fix — did you find the ROOT cause, or keep patching symptoms? Predict the real cause before the next change.',
+        checklist: 'Stop after 2 failed attempts. Revert, find the root cause (trace the bad value to its source), then ONE fix.',
+        skill: 'systematic-debugging',
+    },
+    {
+        id: 'ignored-user-correction',
+        label: 'the user had to correct the same point repeatedly',
+        socratic: 'When the user said "нет/wrong" the 2nd time — what did you keep assuming? Predict the misread before re-reading their message.',
+        checklist: 'On the 2nd correction, STOP and re-read the user\'s messages literally. Restate the ask back before acting.',
+    },
+];
+for (const s of PROCESS_SIGNATURES)
+    Object.freeze(s);
+Object.freeze(PROCESS_SIGNATURES);
+const byStr = (a, b) => (a < b ? -1 : a > b ? 1 : 0);
+// NB: `\b` is an ASCII word boundary — it does NOT anchor Cyrillic (the R2 cross-model-QE lesson), so the
+// Russian alternatives use a leading letter-class lookbehind only (no TRAILING lookahead — it would reject
+// inflected stems like "прошли/проходят/исправила"; cross-model QE caught the truncated-stem miss).
+const DONE_RE = /(?<![a-zа-яё])(done|fixed|works now|passes|passing|готово|исправил\w*|работает|прошл\w*|проход\w*)/i;
+const VERIFY_RE = /\b(test|tests|vitest|pytest|jest|npm test|pnpm test|npm run|tsc|typecheck|noEmit|cargo test|go test|build|repro|coverage|lint)\b/i;
+// Negation immediately before a done-claim ("not done", "isn't fixed", "не готово") — suppress the accusation.
+const NEG_RE = /\b(not|isn'?t|aren'?t|wasn'?t|won'?t|can'?t|couldn'?t|didn'?t|no longer)\b|(?<![a-zа-яё])(не|нет|ещё не|еще не)(?![a-zа-яё])/i;
+// Explicit corrections only — dropped bare "again/wrong" (matched "thanks again" / "don't get me wrong").
+const CORRECTION_RE = /(?<![a-zа-яё])(нет,|не так|неверно|не то|переделай)(?![a-zа-яё])|\b(that'?s not right|not right|that'?s wrong|incorrect|redo this|you misread)\b/i;
+const WINDOW = 8;
+/**
+ * Detect PROCESS rakes over the event stream. PURE + deterministic. Conservative (high-precision): prefer a
+ * miss to a false accusation (a wrong "you claimed done without testing" erodes trust worse than a miss).
+ * Returns ONE aggregated hit per signature that fired, `withinSession` = occurrence count.
+ */
+export function detectProcessRakes(events) {
+    const counts = new Map();
+    const bump = (sig, ev) => {
+        const c = counts.get(sig) ?? { n: 0, evidence: [] };
+        c.n += 1;
+        if (c.evidence.length < 3)
+            c.evidence.push(ev.replace(/\s+/g, ' ').trim().slice(0, 120));
+        counts.set(sig, c);
+    };
+    // NB: no `didnt-read-before-edit` signature — the harness ENFORCES read-before-edit (an Edit fails
+    // without a prior Read), so a genuine violation is near-impossible; that signal was pure artifact
+    // (cross-session / bounded-window reads, 88 false hits on the dogfood) and was dropped after cross-model QE.
+    const editsPerFile = new Map();
+    const failedAfterEdit = new Set(); // files that had a TEST failure after being edited
+    let lastEditedFile;
+    const TESTFAIL_RE = /\b(fail(ed|ing|s)?|assertion|assert|expected|not ok|panic|traceback|error ts\d|\d+ failed)\b/i;
+    for (let i = 0; i < events.length; i++) {
+        const e = events[i];
+        if (e.kind === 'tool' && e.tool === 'Edit' && e.file) {
+            editsPerFile.set(e.file, (editsPerFile.get(e.file) ?? 0) + 1);
+            lastEditedFile = e.file;
+            const edits = editsPerFile.get(e.file);
+            if (edits >= 3 && failedAfterEdit.has(e.file)) {
+                bump('n-fix-cycles', `${edits} edits to ${e.file} with a failing test between`);
+                failedAfterEdit.delete(e.file);
+            }
+        }
+        // Only a TEST/BUILD failure (not a generic Read error) arms the most-recently-edited file, so an
+        // UNRELATED failure no longer globally triggers a fix-cycle (cross-model QE High).
+        if (e.kind === 'tool' && e.ok === false && lastEditedFile !== undefined && TESTFAIL_RE.test(e.text))
+            failedAfterEdit.add(lastEditedFile);
+        // claimed-done-without-verify: a done-claim that (a) FOLLOWS a code change in the window AND (b) has NO
+        // verification tool in the window. The change-in-window gate cuts prose "done"/"tests pass" that made
+        // no edit (measured over-firing on the dogfood — NFR-2 conservative).
+        if (e.kind === 'assistant') {
+            const m = DONE_RE.exec(e.text);
+            if (m) {
+                const before = e.text.slice(Math.max(0, m.index - 30), m.index);
+                const negated = NEG_RE.test(before) || NEG_RE.test(e.text.slice(m.index, m.index + 6));
+                if (!negated) {
+                    let verified = false, changed = false;
+                    for (let j = Math.max(0, i - WINDOW); j < i; j++) {
+                        const p = events[j];
+                        if (p.kind !== 'tool')
+                            continue;
+                        if (VERIFY_RE.test(`${p.tool ?? ''} ${p.text}`))
+                            verified = true;
+                        if (p.tool === 'Edit' || p.tool === 'Write')
+                            changed = true;
+                    }
+                    if (changed && !verified)
+                        bump('claimed-done-without-verify', e.text.slice(0, 120));
+                }
+            }
+        }
+        // ignored-user-correction: 2nd+ correction within a short window of user turns.
+        if (e.kind === 'user' && CORRECTION_RE.test(e.text)) {
+            let priorCorrections = 0;
+            for (let j = Math.max(0, i - WINDOW * 2); j < i; j++) {
+                const p = events[j];
+                if (p.kind === 'user' && CORRECTION_RE.test(p.text))
+                    priorCorrections++;
+            }
+            if (priorCorrections >= 1)
+                bump('ignored-user-correction', e.text);
+        }
+    }
+    const hits = [];
+    for (const sig of PROCESS_SIGNATURES) {
+        const c = counts.get(sig.id);
+        if (c)
+            hits.push({ signature: sig.id, label: sig.label, withinSession: c.n, evidence: c.evidence });
+    }
+    return hits.sort((a, b) => b.withinSession - a.withinSession || byStr(a.signature, b.signature));
+}
+const sigById = (id) => PROCESS_SIGNATURES.find((s) => s.id === id);
+/** The stable store-key lesson for a signature (so teach/reinforce dedups on it and the ledger counts it). */
+export function retroLessonText(sig) {
+    const s = sigById(sig);
+    return `Process rake [${sig}]: ${s ? s.label : sig}. ${s?.checklist ?? ''}`.trim();
+}
+/** Render the mix drill: a socratic predict-then-reveal prompt, a marker, then the concrete checklist. */
+export function renderDrill(sig, effective) {
+    const skill = sig.skill ? ` (see the \`${sig.skill}\` skill)` : '';
+    return [
+        `  🔁 ${sig.label} — ${effective}× (recurring)`,
+        `     ${sig.socratic}`,
+        `     --- reveal (cover this, predict first) ---`,
+        `     ✅ ${sig.checklist}${skill}`,
+    ].join('\n');
+}
+/**
+ * Build the retro. PURE. A hit is DRILLED only when `ledgerCount + withinSession >= threshold` (recurrent);
+ * otherwise it ACCRUES (taught silently, no drill) — the load-bearing anti-noise property (ADR-001 §3).
+ */
+export function buildRetro(hits, ledger, totalEvents, drillThreshold = DEFAULT_DRILL_THRESHOLD) {
+    const items = hits.map((hit) => {
+        const ledgerCount = ledger.get(hit.signature) ?? 0;
+        const effective = ledgerCount + hit.withinSession;
+        if (effective >= drillThreshold) {
+            const sig = sigById(hit.signature);
+            const drill = sig ? renderDrill(sig, effective) : undefined;
+            return drill !== undefined
+                ? { hit, ledgerCount, effective, status: 'drill', drill }
+                : { hit, ledgerCount, effective, status: 'drill' };
+        }
+        return { hit, ledgerCount, effective, status: 'accrue' };
+    });
+    return {
+        items,
+        drilled: items.filter((i) => i.status === 'drill').length,
+        accrued: items.filter((i) => i.status === 'accrue').length,
+        totalEvents,
+    };
+}
+/** Human render of the retro. Deterministic. */
+export function renderRetro(retro) {
+    if (retro.items.length === 0)
+        return `retro: no process rakes detected in ${retro.totalEvents} event(s). Clean session.`;
+    const lines = [`retro: ${retro.drilled} recurring rake(s) to drill, ${retro.accrued} accruing (from ${retro.totalEvents} events):`, ''];
+    for (const it of retro.items) {
+        if (it.status === 'drill' && it.drill) {
+            lines.push(it.drill);
+            lines.push('');
+        }
+    }
+    const accruing = retro.items.filter((i) => i.status === 'accrue');
+    if (accruing.length > 0) {
+        lines.push('  accruing (first time — taught, not drilled yet):');
+        for (const it of accruing)
+            lines.push(`    · ${it.hit.label} (×${it.hit.withinSession} this session)`);
+    }
+    return lines.join('\n');
+}
+/** Cap the read at the last N bytes for very large transcripts (a retro is about the RECENT session), so
+ * memory stays bounded rather than slurping a multi-hundred-MB file whole (cross-model QE). */
+const MAX_READ_BYTES = 48 * 1024 * 1024;
+function readBounded(path) {
+    let size = 0;
+    try {
+        size = statSync(path).size;
+    }
+    catch {
+        return '';
+    }
+    if (size <= MAX_READ_BYTES) {
+        try {
+            return readFileSync(path, 'utf8');
+        }
+        catch {
+            return '';
+        }
+    }
+    // Read only the tail; drop the first (partial) line.
+    const fd = openSync(path, 'r');
+    try {
+        const buf = Buffer.allocUnsafe(MAX_READ_BYTES);
+        const bytes = readSync(fd, buf, 0, MAX_READ_BYTES, size - MAX_READ_BYTES);
+        const tail = buf.toString('utf8', 0, bytes);
+        const nl = tail.indexOf('\n');
+        return nl >= 0 ? tail.slice(nl + 1) : tail;
+    }
+    catch {
+        return '';
+    }
+    finally {
+        closeSync(fd);
+    }
+}
+const isObj = (x) => x !== null && typeof x === 'object';
+/**
+ * Parse a Claude Code JSONL transcript into a normalized event stream. Bad/`null`/malformed lines are
+ * skipped (never throws — cross-model QE caught a crash on a `null` line and a `[null]` content block).
+ * Text blocks WITHIN one message are merged into a SINGLE assistant/user event, so a multi-block turn
+ * ("Done." + "Fixed.") counts as ONE claim, not two (else the anti-noise guarantee is defeated).
+ */
+export function streamSessionEvents(path) {
+    const out = [];
+    const raw = readBounded(path);
+    if (raw === '')
+        return out;
+    for (const line of raw.split('\n')) {
+        const t = line.trim();
+        if (t === '')
+            continue;
+        let obj;
+        try {
+            obj = JSON.parse(t);
+        }
+        catch {
+            continue;
+        }
+        if (!isObj(obj))
+            continue;
+        const msg = obj.message;
+        if (!isObj(msg))
+            continue;
+        const role = typeof msg.role === 'string' ? msg.role : '';
+        const content = msg.content;
+        if (typeof content === 'string') {
+            if (content.trim() !== '')
+                out.push({ kind: role === 'assistant' ? 'assistant' : 'user', text: content });
+            continue;
+        }
+        if (!Array.isArray(content))
+            continue;
+        const textParts = [];
+        for (const b of content) {
+            if (!isObj(b))
+                continue; // guard a `[null]` block (cross-model QE)
+            if (b.type === 'text' && typeof b.text === 'string') {
+                textParts.push(b.text);
+            }
+            else if (b.type === 'tool_use') {
+                const input = isObj(b.input) ? b.input : undefined;
+                const file = input?.file_path ?? input?.path;
+                const name = typeof b.name === 'string' ? b.name : undefined;
+                // Capture the Bash COMMAND as the event text so a real verification (`pnpm tsc`, `npm test`) is
+                // visible — dropping it made the "done without verify" check blind (cross-model QE).
+                const text = (name === 'Bash' && typeof input?.command === 'string') ? input.command : (name ?? '');
+                out.push({ kind: 'tool', text, ...(name ? { tool: name } : {}), ...(file ? { file } : {}) });
+            }
+            else if (b.type === 'tool_result') {
+                const c = b.content;
+                const text = typeof c === 'string' ? c : JSON.stringify(c ?? '');
+                out.push({ kind: 'tool', text: text.slice(0, 2000), ok: b.is_error !== true });
+            }
+        }
+        if (textParts.length > 0)
+            out.push({ kind: role === 'assistant' ? 'assistant' : 'user', text: textParts.join('\n') });
+    }
+    return out;
+}
+/** Find the most recently modified session transcript (roam state, then ~/.claude/projects). Null if none. */
+export function findLatestTranscript(repoRoot) {
+    let best = null;
+    const consider = (p) => {
+        try {
+            const st = statSync(p);
+            // tie-break on path so equal mtimes are deterministic (cross-model QE).
+            if (st.isFile() && (best === null || st.mtimeMs > best.mtime || (st.mtimeMs === best.mtime && p < best.path)))
+                best = { path: p, mtime: st.mtimeMs };
+        }
+        catch { /* skip */ }
+    };
+    const scanDir = (dir) => {
+        try {
+            if (existsSync(dir))
+                for (const e of readdirSync(dir))
+                    if (e.endsWith('.jsonl'))
+                        consider(join(dir, e));
+        }
+        catch { /* ignore */ }
+    };
+    scanDir(join(repoRoot, 'roam', 'claude-state'));
+    // ~/.claude/projects/<encoded-repoRoot>/<uuid>.jsonl (the contract's second source).
+    try {
+        const enc = repoRoot.replace(/\//g, '-');
+        scanDir(join(homedir(), '.claude', 'projects', enc));
+    }
+    catch { /* ignore */ }
+    return best === null ? null : best.path;
+}
+//# sourceMappingURL=session-retro.js.map

package/dist/session-retro.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"session-retro.js","sourceRoot":"","sources":["../src/session-retro.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACzG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAwClC,MAAM,CAAC,MAAM,YAAY,GAAG,OAAO,CAAC;AACpC,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAEzC,MAAM,CAAC,MAAM,kBAAkB,GAAgC;IAC7D;QACE,EAAE,EAAE,6BAA6B;QACjC,KAAK,EAAE,mDAAmD;QAC1D,QAAQ,EAAE,wHAAwH;QAClI,SAAS,EAAE,mIAAmI;QAC9I,KAAK,EAAE,UAAU;KAClB;IACD;QACE,EAAE,EAAE,cAAc;QAClB,KAAK,EAAE,2DAA2D;QAClE,QAAQ,EAAE,mIAAmI;QAC7I,SAAS,EAAE,8GAA8G;QACzH,KAAK,EAAE,sBAAsB;KAC9B;IACD;QACE,EAAE,EAAE,yBAAyB;QAC7B,KAAK,EAAE,mDAAmD;QAC1D,QAAQ,EAAE,gIAAgI;QAC1I,SAAS,EAAE,6GAA6G;KACzH;CACF,CAAC;AACF,KAAK,MAAM,CAAC,IAAI,kBAAkB;IAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACrD,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;AAElC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE7E,0GAA0G;AAC1G,2GAA2G;AAC3G,oGAAoG;AACpG,MAAM,OAAO,GAAG,qGAAqG,CAAC;AACtH,MAAM,SAAS,GAAG,mIAAmI,CAAC;AACtJ,+GAA+G;AAC/G,MAAM,MAAM,GAAG,+HAA+H,CAAC;AAC/I,0GAA0G;AAC1G,MAAM,aAAa,GAAG,mJAAmJ,CAAC;AAC1K,MAAM,MAAM,GAAG,CAAC,CAAC;AAEjB;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAA+B;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6C,CAAC;IACpE,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,EAAU,EAAQ,EAAE;QAC7C,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACT,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC;IAEF,mGAAmG;IACnG,kGAAkG;IAClG,6GAA6G;IAC7G,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC,CAAG,mDAAmD;IAChG,IAAI,cAAkC,CAAC;IACvC,MAAM,WAAW,GAAG,+FAA+F,CAAC;IAEpH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAErB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACrD,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,cAAc,GAAG,CAAC,CAAC,IAAI,CAAC;YACxB,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;YACxC,IAAI,KAAK,IAAI,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAC,IAAI,CAAC,cAAc,EAAE,GAAG,KAAK,aAAa,CAAC,CAAC,IAAI,8BAA8B,CAAC,CAAC;gBAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAC,CAAC;QACrK,CAAC;QAED,iGAAiG;QACjG,mFAAmF;QACnF,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,cAAc,KAAK,SAAS,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAEzI,wGAAwG;QACxG,sGAAsG;QACtG,sEAAsE;QACtE,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,EAAE,CAAC;gBACN,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAChE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvF,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,IAAI,QAAQ,GAAG,KAAK,EAAE,OAAO,GAAG,KAAK,CAAC;oBACtC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;wBACrB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;4BAAE,SAAS;wBAChC,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;4BAAE,QAAQ,GAAG,IAAI,CAAC;wBACjE,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;4BAAE,OAAO,GAAG,IAAI,CAAC;oBAC9D,CAAC;oBACD,IAAI,OAAO,IAAI,CAAC,QAAQ;wBAAE,IAAI,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACtF,CAAC;YACH,CAAC;QACH,CAAC;QAED,gFAAgF;QAChF,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACpD,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;gBACrB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;oBAAE,gBAAgB,EAAE,CAAC;YAC1E,CAAC;YACD,IAAI,gBAAgB,IAAI,CAAC;gBAAE,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;IACtG,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,IAAI,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;AACnG,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,EAAU,EAAgC,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAE1G,8GAA8G;AAC9G,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,OAAO,iBAAiB,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;AACrF,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,WAAW,CAAC,GAAqB,EAAE,SAAiB;IAClE,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IACnE,OAAO;QACL,QAAQ,GAAG,CAAC,KAAK,MAAM,SAAS,eAAe;QAC/C,QAAQ,GAAG,CAAC,QAAQ,EAAE;QACtB,iDAAiD;QACjD,UAAU,GAAG,CAAC,SAAS,GAAG,KAAK,EAAE;KAClC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,IAA2B,EAC3B,MAAmC,EACnC,WAAmB,EACnB,iBAAyB,uBAAuB;IAEhD,MAAM,KAAK,GAAgB,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC1C,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,WAAW,GAAG,GAAG,CAAC,aAAa,CAAC;QAClD,IAAI,SAAS,IAAI,cAAc,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5D,OAAO,KAAK,KAAK,SAAS;gBACxB,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,OAAgB,EAAE,KAAK,EAAE;gBAClE,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,OAAgB,EAAE,CAAC;QAChE,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,QAAiB,EAAE,CAAC;IACpE,CAAC,CAAC,CAAC;IACH,OAAO;QACL,KAAK;QACL,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,MAAM;QACzD,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,MAAM;QAC1D,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,WAAW,CAAC,KAAY;IACtC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,uCAAuC,KAAK,CAAC,WAAW,2BAA2B,CAAC;IACzH,MAAM,KAAK,GAAG,CAAC,UAAU,KAAK,CAAC,OAAO,gCAAgC,KAAK,CAAC,OAAO,mBAAmB,KAAK,CAAC,WAAW,WAAW,EAAE,EAAE,CAAC,CAAC;IACxI,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,EAAE,CAAC,MAAM,KAAK,OAAO,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAAC,CAAC;IAClF,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;IAClE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,oDAAoD,CAAC,CAAC;QACjE,KAAK,MAAM,EAAE,IAAI,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,KAAK,MAAM,EAAE,CAAC,GAAG,CAAC,aAAa,gBAAgB,CAAC,CAAC;IACzG,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAOD;+FAC+F;AAC/F,MAAM,cAAc,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAExC,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,CAAC;QAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;IACxD,IAAI,IAAI,IAAI,cAAc,EAAE,CAAC;QAC3B,IAAI,CAAC;YAAC,OAAO,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,EAAE,CAAC;QAAC,CAAC;IACjE,CAAC;IACD,qDAAqD;IACrD,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC/B,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,GAAG,cAAc,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;YAAS,CAAC;QAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAAC,CAAC;AACnD,CAAC;AAED,MAAM,KAAK,GAAG,CAAC,CAAU,EAAgC,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC;AAEhG;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,GAAG,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE;YAAE,SAAS;QACvB,IAAI,GAAY,CAAC;QACjB,IAAI,CAAC;YAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,SAAS;QAAC,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,SAAS;QAC1B,MAAM,GAAG,GAAI,GAAe,CAAC,OAAO,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,SAAS;QAC1B,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAI,GAAgD,CAAC,OAAO,CAAC;QAC1E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC1G,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YAAE,SAAS;QACtC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,SAAS,CAAmC,0CAA0C;YACrG,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACpD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;iBAAM,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACjC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,KAAiE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAChH,MAAM,IAAI,GAAG,KAAK,EAAE,SAAS,IAAI,KAAK,EAAE,IAAI,CAAC;gBAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC7D,gGAAgG;gBAChG,qFAAqF;gBACrF,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,KAAK,EAAE,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;gBACpG,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/F,CAAC;iBAAM,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBACpB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBACjE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8GAA8G;AAC9G,MAAM,UAAU,oBAAoB,CAAC,QAAgB;IACnD,IAAI,IAAI,GAA2C,IAAI,CAAC;IACxD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAQ,EAAE;QACnC,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,wEAAwE;YACxE,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,OAAO,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;gBAAE,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC;QACvJ,CAAC;QAAC,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;IACxB,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,GAAW,EAAQ,EAAE;QACpC,IAAI,CAAC;YAAC,IAAI,UAAU,CAAC,GAAG,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC;oBAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;wBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IACzI,CAAC,CAAC;IACF,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;IAChD,qFAAqF;IACrF,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IACxB,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,IAAyB,CAAC,IAAI,CAAC;AAChE,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dzhechkov/harness-core",
-  "version": "0.3.112",
+  "version": "0.3.114",
   "description": "Shared harness logic - skill loading, additive apply, and the init/sync/verify/doctor operations.",
   "type": "module",
   "license": "MIT",
@@ -30,13 +30,13 @@
     "@dzhechkov/adapter-openclaude": "^0.1.0",
     "@dzhechkov/adapter-opencode": "^0.2.0",
     "yaml": "^2.0.0",
+    "@dzhechkov/adapter-copilot": "0.1.1",
     "@dzhechkov/adapter-gemini": "0.1.1",
     "@dzhechkov/adapter-cursor": "0.1.1",
     "@dzhechkov/adapter-agents-md": "0.1.1",
-    "@dzhechkov/adapter-copilot": "0.1.1",
-    "@dzhechkov/core": "0.2.14",
+    "@dzhechkov/adapter-windsurf": "0.1.1",
     "@dzhechkov/memory": "0.2.9",
-    "@dzhechkov/adapter-windsurf": "0.1.1"
+    "@dzhechkov/core": "0.2.14"
   },
   "peerDependenciesMeta": {
     "@ruvector/rvf": {

package/src/index.ts

@@ -265,3 +265,5 @@ export type {
 export * from './safla-delta.js';
 export * from './architecture.js';
 export * from './project-skills.js';
+export * from './rake-analyzer.js';
+export * from './session-retro.js';

package/src/rake-analyzer.ts

@@ -0,0 +1,265 @@
+/**
+ * MR rake analyzer (feature mr-rake-analyzer, ADR-001).
+ *
+ * Mines a project's review corpus for RECURRING mistakes ("rakes") and closes them into self-learning.
+ * The parse/normalize/detect/render functions are PURE + deterministic (sorted, no clock/random) so the
+ * same corpus yields a byte-identical report; the load/scan helpers do disk I/O with TOP-LEVEL node:fs
+ * imports (harness-core is ESM — a lazy require() is undefined at runtime; the R1 footgun).
+ *
+ * Signature is DETERMINISTIC (ADR-001 §1): a rule table of known rake classes, with an unmatched finding
+ * falling to a normalized-text bucket so novel recurrences still cluster. LLM classification is an optional
+ * amplifier, never in this core.
+ *
+ * SAFETY PROPERTY (ADR-001 §3, load-bearing): a finding whose signature appears in fewer than
+ * `thresholds.candidate` DISTINCT sources is a one-off — it is NEVER a rake and never reaches teach/critic.
+ */
+
+import { existsSync, readFileSync, readdirSync, statSync, realpathSync } from 'node:fs';
+import { join } from 'node:path';
+
+export type Severity = 'blocker' | 'high' | 'medium' | 'low' | 'unknown';
+const SEVERITY_RANK: Record<Severity, number> = { blocker: 4, high: 3, medium: 2, low: 1, unknown: 0 };
+
+export interface Finding {
+  readonly source: string;      // artifact id (e.g. features/<slug>/08_qe_report.md)
+  readonly severity: Severity;
+  readonly text: string;
+  readonly site?: string;       // file:line if present
+}
+
+export interface Rake {
+  readonly signature: string;
+  readonly label: string;
+  readonly sources: readonly string[];    // DISTINCT sources (sorted)
+  readonly count: number;                 // = sources.length
+  readonly severity: Severity;            // max across the group
+  readonly examples: readonly Finding[];  // up to 3, sorted
+  readonly status: 'candidate' | 'confirmed';
+}
+
+export interface RakeThresholds { readonly candidate: number; readonly confirmed: number }
+export const DEFAULT_RAKE_THRESHOLDS: RakeThresholds = { candidate: 2, confirmed: 3 };
+
+export interface RakeReport {
+  readonly rakes: readonly Rake[];
+  readonly totalFindings: number;
+  readonly oneOffs: number;               // signatures below the candidate threshold (dropped)
+}
+
+export interface RakeSignature { readonly id: string; readonly label: string; readonly patterns: readonly RegExp[] }
+
+/**
+ * Known rake classes (extensible, data-only). Seeded from the classes that actually recur in this repo's
+ * QE reports — that IS the dogfood. First match in order wins; unmatched → normalized-text bucket.
+ */
+export const RAKE_SIGNATURES: readonly RakeSignature[] = [
+  { id: 'esm-require-footgun', label: 'ESM lazy require() undefined at runtime', patterns: [/require\(['"]node:/, /\besm\b.*require/i, /lazy require/i] },
+  { id: 'untested-adr-property', label: 'ADR-named safety property left untested', patterns: [/load-bearing.*(untested|not\s+tested|no\s+test)/i, /adr.*names.*(property|test)/i, /safety property.*test/i] },
+  { id: 'claim-check-fp', label: 'claim-check false positive / untagged count', patterns: [/claim-check.*(false positive|\bfp\b)/i, /untagged.*(count|claim)/i, /metric term/i] },
+  // "traversal" alone over-matches (AST/tree traversal); require a filesystem-scope token to CO-OCCUR
+  // (or a literal `../`) — cross-model QE caught the over-match.
+  { id: 'path-traversal', label: 'path not constrained to the repo (traversal)', patterns: [/\.\.\//, /(?=.*travers)(?=.*(repo|root|\bpath\b|director|\/etc\/))/i, /escapes.{0,12}repo/i] },
+  { id: 'silent-drop-or-inject', label: 'silent drop / silent injection (no report)', patterns: [/silent(ly)?\s+(drop|inject|discard|dropped)/i, /no silent (injection|caps|drop)/i] },
+  { id: 'swallow-generic-exception', label: 'generic except/catch swallows real bugs', patterns: [/except\s+Exception/i, /catch.*swallow/i, /generic (exception|catch)/i] },
+  { id: 'determinism-hole', label: 'non-deterministic output (unsorted/clock/random)', patterns: [/non-determinis/i, /determinism hole/i, /unsorted|not sorted/i] },
+  { id: 'cross-model-self-qe', label: 'coder self-QE instead of cross-model', patterns: [/self-qe/i, /coder.*(review|qe).*(itself|self)/i, /cross-model/i] },
+  { id: 'malformed-input-bypass', label: 'malformed input bypasses validation', patterns: [/array.*(pass|bypass)/i, /malformed.*(bypass|pass|manifest)/i, /typeof.*object/i] },
+];
+// Deep-freeze so an external caller can't inject a `/g`-flag regex whose `.test()` mutates lastIndex and
+// makes signatureOf non-deterministic (cross-model QE). None of the patterns above use `g`/`y`.
+for (const s of RAKE_SIGNATURES) { Object.freeze(s.patterns); Object.freeze(s); }
+Object.freeze(RAKE_SIGNATURES);
+
+const byStr = (a: string, b: string): number => (a < b ? -1 : a > b ? 1 : 0);
+const uniqSorted = (xs: readonly string[]): string[] => [...new Set(xs)].sort(byStr);
+const maxSeverity = (a: Severity, b: Severity): Severity => (SEVERITY_RANK[a] >= SEVERITY_RANK[b] ? a : b);
+
+const STOPWORDS = new Set(['the', 'a', 'an', 'and', 'or', 'to', 'of', 'in', 'on', 'is', 'it', 'that', 'this', 'for', 'with', 'as', 'at', 'by', 'be', 'not', 'no', 'its', 'when', 'if', 'was', 'are', 'но', 'и', 'в', 'на', 'что', 'это', 'не', 'из', 'за', 'для']);
+
+/** Normalize a finding's text to a stable clustering key: lowercase, strip sites/numbers/punct, top significant words. */
+export function normalizeText(text: string): string {
+  const cleaned = text
+    .toLowerCase()
+    .replace(/[\w./-]+:\d+/g, ' ')          // drop file:line
+    .replace(/`[^`]*`/g, ' ')               // drop code literals
+    .replace(/[^a-zа-я\s]/gi, ' ');         // drop digits/punct
+  const words = cleaned.split(/\s+/).filter((w) => w.length >= 4 && !STOPWORDS.has(w));
+  return uniqSorted(words).slice(0, 6).join(' ');
+}
+
+const SEV_MAP: Record<string, Severity> = {
+  blocker: 'blocker', critical: 'blocker', crit: 'blocker',
+  high: 'high', hi: 'high',
+  medium: 'medium', med: 'medium',
+  low: 'low', nit: 'low',
+};
+const toSeverity = (raw: string): Severity => SEV_MAP[raw.trim().toLowerCase()] ?? 'unknown';
+const SITE_RE = /([\w./-]+\.(?:ts|js|tsx|jsx|py|go|md|json|yml|yaml):\d+)/;
+
+/** The signature of a finding: first matching rule, else the normalized-text bucket. */
+export function signatureOf(finding: Finding): { id: string; label: string } {
+  for (const s of RAKE_SIGNATURES) {
+    if (s.patterns.some((p) => p.test(finding.text))) return { id: s.id, label: s.label };
+  }
+  const key = normalizeText(finding.text);
+  if (key !== '') return { id: `text:${key}`, label: key };
+  // No significant words (code-only / very short). Key on the LITERAL text so two DIFFERENT such findings
+  // never merge into a false "unclassified ×N" rake (cross-model QE) — but two IDENTICAL ones still cluster.
+  const literal = finding.text.toLowerCase().replace(/\s+/g, ' ').trim().slice(0, 80);
+  return { id: `literal:${literal}`, label: literal === '' ? 'unclassified finding' : literal };
+}
+
+/**
+ * Parse one markdown artifact into findings. Handles (a) severity table rows `| … | High | <text> | … |`,
+ * (b) inline markers `[High]` / `**High —**` / `Sev — <text>`. Deterministic; unknown formats yield nothing.
+ */
+export function extractFindings(markdown: string, source: string): Finding[] {
+  const out: Finding[] = [];
+  const push = (severity: Severity, text: string): void => {
+    const t = text.replace(/\s+/g, ' ').trim();
+    if (t.length < 8) return;                                  // too short to be a finding
+    const site = SITE_RE.exec(t)?.[1];
+    out.push(site ? { source, severity, text: t, site } : { source, severity, text: t });
+  };
+  for (const line of markdown.split('\n')) {
+    // (a) table row: | ... | <sev> | <finding> | ...
+    const cells = line.includes('|') ? line.split('|').map((c) => c.trim()) : null;
+    if (cells && cells.length >= 4) {
+      const sevCell = cells.find((c) => SEV_MAP[c.toLowerCase()] !== undefined);
+      if (sevCell) {
+        const sevIdx = cells.indexOf(sevCell);
+        const finding = cells.slice(sevIdx + 1).find((c) => c.length >= 8 && !/^-+$/.test(c));
+        if (finding) { push(toSeverity(sevCell), finding); continue; }
+      }
+    }
+    // (b) inline `[High] text` / `**High —** text` / `- High: text`. The bracketed form `[High] text`
+    // needs no separator (the brackets delimit); the bare form `High: text` requires one so prose like
+    // "high latency" doesn't register (cross-model QE: a missing separator silently dropped findings).
+    const bracketed = /^[\s\-*>]*\**\[(blocker|critical|high|medium|med|low)\]\**\s*[—:\-]?\s*(.+)$/i.exec(line);
+    const bare = /^[\s\-*>]*\**(blocker|critical|high|medium|med|low)\**\s*[—:]\s*(.+)$/i.exec(line);
+    const m = bracketed ?? bare;
+    if (m && m[1] && m[2]) push(toSeverity(m[1]), m[2]);
+  }
+  return out;
+}
+
+/**
+ * Detect rakes: group findings by signature, count DISTINCT sources, keep only groups at/above the candidate
+ * threshold (a below-threshold group is a one-off, NEVER a rake — the load-bearing anti-noise property).
+ * PURE + deterministic (ADR-001 §1): rakes sorted by (count desc, severity desc, signature asc).
+ */
+export function detectRakes(findings: readonly Finding[], thresholds: RakeThresholds = DEFAULT_RAKE_THRESHOLDS): RakeReport {
+  const groups = new Map<string, { label: string; findings: Finding[] }>();
+  for (const f of findings) {
+    const sig = signatureOf(f);
+    const g = groups.get(sig.id);
+    if (g) g.findings.push(f);
+    else groups.set(sig.id, { label: sig.label, findings: [f] });
+  }
+
+  const rakes: Rake[] = [];
+  let oneOffs = 0;
+  for (const [signature, g] of groups) {
+    const sources = uniqSorted(g.findings.map((f) => f.source));
+    const count = sources.length;
+    if (count < thresholds.candidate) { oneOffs++; continue; }
+    const severity = g.findings.reduce<Severity>((m, f) => maxSeverity(m, f.severity), 'unknown');
+    const examples = [...g.findings]
+      .sort((a, b) => SEVERITY_RANK[b.severity] - SEVERITY_RANK[a.severity] || byStr(a.source, b.source))
+      .slice(0, 3);
+    rakes.push({ signature, label: g.label, sources, count, severity, examples, status: count >= thresholds.confirmed ? 'confirmed' : 'candidate' });
+  }
+  rakes.sort((a, b) => b.count - a.count || SEVERITY_RANK[b.severity] - SEVERITY_RANK[a.severity] || byStr(a.signature, b.signature));
+  return { rakes, totalFindings: findings.length, oneOffs };
+}
+
+/** Human render of the rake report. Deterministic. */
+export function renderRakeReport(report: RakeReport): string {
+  if (report.rakes.length === 0) {
+    return `mr-rakes: no recurring rakes (${report.totalFindings} finding(s), ${report.oneOffs} one-off signature(s) below threshold).`;
+  }
+  const lines = [`mr-rakes: ${report.rakes.length} rake(s) from ${report.totalFindings} finding(s) (${report.oneOffs} one-off(s) dropped):`, ''];
+  for (const r of report.rakes) {
+    lines.push(`  [${r.status}] ${r.severity.toUpperCase()} ×${r.count} — ${r.label}  (${r.signature})`);
+    lines.push(`      sources: ${r.sources.join(', ')}`);
+  }
+  return lines.join('\n');
+}
+
+/** The teachable rule text for a rake (fed to `dz teach`). Deterministic. */
+export function rakeAsLesson(rake: Rake): string {
+  return `Project rake (recurred in ${rake.count} reviews): ${rake.label}. First seen: ${rake.examples[0]?.site ?? rake.sources[0]}. Watch for this class before it ships again.`;
+}
+
+/** Severity → teach reward. Higher-severity rakes are higher-signal lessons. */
+export function rakeReward(rake: Rake): number {
+  return ({ blocker: 0.95, high: 0.9, medium: 0.8, low: 0.7, unknown: 0.7 } as const)[rake.severity];
+}
+
+/** Render the CONFIRMED rakes as a project-critic SKILL.md section (sink B). Deterministic; confirmed only. */
+export function renderCriticSection(report: RakeReport): string {
+  const confirmed = report.rakes.filter((r) => r.status === 'confirmed');
+  const lines = [
+    '## Recurring mistakes (auto-mined by `dz mr-rakes`)',
+    '',
+    confirmed.length === 0
+      ? '_No confirmed recurring rakes yet._'
+      : 'These classes of mistake have recurred across this project\'s reviews. Flag them before they ship again:',
+    '',
+  ];
+  for (const r of confirmed) {
+    lines.push(`- **${r.label}** (${r.severity}, ×${r.count}) — e.g. ${r.examples[0]?.site ?? r.sources[0]}.`);
+  }
+  return lines.join('\n');
+}
+
+// ── Thin I/O (top-level fs; never throws) ────────────────────────────────────────────────────────────
+
+/** Find review artifacts: each `features/<slug>/08_qe_report.md` plus any `REVIEW`-named markdown. Sorted. */
+export function findReviewArtifacts(repoRoot: string): string[] {
+  if (typeof repoRoot !== 'string' || repoRoot === '') return [];   // fail-open on bad runtime input (cross-model QE)
+  const candidates: string[] = [];
+  const featuresDir = join(repoRoot, 'features');
+  try {
+    if (existsSync(featuresDir)) {
+      for (const slug of readdirSync(featuresDir)) {
+        const qe = join(featuresDir, slug, '08_qe_report.md');
+        if (existsSync(qe)) candidates.push(`features/${slug}/08_qe_report.md`);
+      }
+    }
+  } catch { /* ignore */ }
+  // Shallow scan of the repo root for REVIEW-named markdown (mr-review outputs land there).
+  try {
+    for (const entry of readdirSync(repoRoot)) {
+      if (/REVIEW.*\.md$/i.test(entry)) {
+        try { if (statSync(join(repoRoot, entry)).isFile()) candidates.push(entry); } catch { /* ignore */ }
+      }
+    }
+  } catch { /* ignore */ }
+
+  // Dedupe by PHYSICAL identity (realpath), not path string — two paths (e.g. a symlinked feature dir)
+  // pointing at ONE file must count as ONE source, else a single review fakes a rake (cross-model QE:
+  // the real load-bearing breach). Keep the first (sorted) relative path per physical file.
+  const seenReal = new Set<string>();
+  const out: string[] = [];
+  for (const rel of uniqSorted(candidates)) {
+    let real: string;
+    try { real = realpathSync(join(repoRoot, rel)); } catch { real = join(repoRoot, rel); }
+    if (seenReal.has(real)) continue;
+    seenReal.add(real);
+    out.push(rel);
+  }
+  return out;
+}
+
+/** Analyze the whole repo corpus. Impure wrapper: find artifacts → extract → detect. Never throws. */
+export function analyzeCorpus(repoRoot: string, thresholds: RakeThresholds = DEFAULT_RAKE_THRESHOLDS): RakeReport {
+  const findings: Finding[] = [];
+  for (const rel of findReviewArtifacts(repoRoot)) {
+    try {
+      const md = readFileSync(join(repoRoot, rel), 'utf8');
+      findings.push(...extractFindings(md, rel));
+    } catch { /* skip unreadable artifact */ }
+  }
+  return detectRakes(findings, thresholds);
+}