@dzhechkov/harness-core 0.3.149 → 0.4.1

package/src/recall-domain-boost.ts

@@ -0,0 +1,178 @@
+/**
+ * Domain-aware recall re-ranking — the pure half of `dz recall --domain <name>`.
+ *
+ * WHY THIS EXISTS. `dz teach --domain <name>` has always recorded a domain, and
+ * `dz recall --all --stats` prints the per-domain histogram — but the RANKING path
+ * (`recallHybrid`: lexical FTS5 + optional vector leg merged by RRF) never looked at
+ * the field. So a store shared by different KINDS of work returns them interleaved:
+ * medical-research lessons dilute a coding recall and vice versa, and the dilution
+ * gets worse as either side grows.
+ *
+ * WHY A BOOST AND NOT A FILTER. Cross-pollination here is real, not theoretical:
+ * "a reviewer's evidence needs the same execute-don't-describe discipline as your
+ * own claims" was learned reviewing code and applies verbatim to medical sources;
+ * the medical report's core insight ("was the source ever opened?") is the same
+ * principle as our claim-check. A hard filter would cut exactly the transfers that
+ * make one store worth more than two. So: matching-domain hits move UP, foreign
+ * ones stay in the list.
+ *
+ * THE PROMISE, NARROWLY: this reorders. It NEVER drops a hit, never invents one,
+ * and never changes how many are returned. If the boost is wrong, the cost is
+ * ordering; it can't hide a lesson from you.
+ */
+
+import type { RecallHit } from './patterns.js';
+
+/** How many places a same-domain lesson may climb. STATED AS POSITIONS, not as a
+ * score multiplier: "moves up at most two places" is a sentence a reader can check
+ * against the output, while "index × 0.55" is an opaque constant whose behaviour
+ * changes with position (it could not lift index 2 past index 1 at all, but did
+ * lift index 3 past index 2 — an accident, not a design). A bounded lift keeps
+ * lexical relevance dominant: a domain tag is a hint about relevance, not evidence
+ * of it, so it breaks near-ties instead of overruling the ranking. */
+export const DOMAIN_LIFT_EXACT = 2;
+
+/** A prefix/suffix relative (`health-research` against `health`) climbs less. */
+export const DOMAIN_LIFT_RELATED = 1;
+
+export type DomainMatch = 'exact' | 'related' | 'none';
+
+/** Normalize a domain tag for comparison: case- and separator-insensitive, so
+ * `Health-Research`, `health_research` and `health research` are one domain. */
+export function normalizeDomain(domain: string | null | undefined): string {
+  return String(domain ?? '')
+    .toLowerCase()
+    .replace(/[\s_]+/g, '-')
+    // COLLAPSE hyphen runs. `Health - Research` became `health---research`, which the
+    // doc comment above calls one domain with `health-research` and the code then
+    // treated as unrelated. Only ordering is at stake here — the export hold-out has its
+    // own stricter key — but a comment that describes behaviour the code lacks is the
+    // same defect wherever it sits.
+    .replace(/-{2,}/g, '-')
+    .replace(/^-+|-+$/g, '');
+}
+
+/** How a hit's domain relates to the requested one. `related` covers the common
+ * hierarchy shapes (`health` ↔ `health-research`) without a taxonomy: a taxonomy
+ * nobody maintains drifts, and a wrong taxonomy is worse than none. */
+export function domainMatch(hitDomain: string | null | undefined, wanted: string | null | undefined): DomainMatch {
+  const a = normalizeDomain(hitDomain);
+  const b = normalizeDomain(wanted);
+  if (a === '' || b === '') return 'none';
+  if (a === b) return 'exact';
+  if (a.startsWith(`${b}-`) || b.startsWith(`${a}-`)) return 'related';
+  return 'none';
+}
+
+export interface DomainBoostResult {
+  readonly hits: readonly RecallHit[];
+  /** How many hits MATCHED the domain (exactly / relatedly). */
+  readonly exact: number;
+  readonly related: number;
+  /** How many hits actually CHANGED position. Counted separately because the note
+   * used to print the match counts as "lifted" — an exact match already at rank 0,
+   * or a list that is entirely one domain, matches without moving, and calling that
+   * "lifted" tells the reader the ranking changed when it did not. */
+  readonly moved: number;
+  /** True when NOTHING in the result matched: the caller says so out loud rather
+   * than implying the ranking is domain-aware when it had nothing to work with. */
+  readonly noMatches: boolean;
+}
+
+/**
+ * Re-rank hits so same-domain lessons surface first, keeping every hit.
+ *
+ * Effective position = `index - lift`. The original relevance order dominates; the
+ * domain only breaks near-ties, and the lift is BOUNDED so a tail match can never
+ * teleport to the top. Ties keep the incoming order (stable sort), so the function
+ * is deterministic — the same input always yields the same output, which is what
+ * makes it testable at all.
+ */
+export function applyDomainBoost(hits: readonly RecallHit[], wanted: string | null | undefined): DomainBoostResult {
+  const target = normalizeDomain(wanted);
+  if (target === '' || hits.length === 0) {
+    return { hits, exact: 0, related: 0, moved: 0, noMatches: true };
+  }
+  let exact = 0;
+  let related = 0;
+  const scored = hits.map((hit, index) => {
+    const match = domainMatch(hit.pattern.domain, target);
+    if (match === 'exact') exact += 1;
+    else if (match === 'related') related += 1;
+    const lift = match === 'exact' ? DOMAIN_LIFT_EXACT : match === 'related' ? DOMAIN_LIFT_RELATED : 0;
+    return { hit, index, lift, effective: index - lift };
+  });
+  // Tie-break: at equal effective position the LIFTED hit goes first, then the
+  // original order. Without this the foreign hit it landed level with won the tie
+  // by having the lower original index, so a lift of N moved the hit only N-1
+  // places — the code quietly delivered less than the constant promised. A test
+  // asserting the documented bound caught it; the fix is here, not in the test.
+  scored.sort((a, b) => (a.effective - b.effective) || (b.lift - a.lift) || (a.index - b.index));
+  const reordered = scored.map((s) => s.hit);
+  let moved = 0;
+  scored.forEach((s, newIndex) => { if (s.index !== newIndex) moved += 1; });
+  return { hits: reordered, exact, related, moved, noMatches: exact === 0 && related === 0 };
+}
+
+/**
+ * How many hits the CUT hid that an unboosted recall would have shown.
+ *
+ * WHY THIS EXISTS. `applyDomainBoost` never drops a hit — but the CLI still cuts the
+ * list at `--limit`, and a promotion INTO the top N necessarily pushes something out
+ * of it. Cross-model review found the resulting sentence to be a lie by omission: the
+ * note said "foreign-domain lessons kept" while `foreign-B`, visible without
+ * `--domain`, had vanished from the printed output. Both statements were true of
+ * different lists, which is exactly how an honest tool ends up misleading its reader.
+ *
+ * The fix is not to stop promoting — that would be the filter we refused to build. It
+ * is to COUNT what fell past the cut and say so, because the reader can act on that
+ * (raise `--limit`) only if they know it happened.
+ *
+ * Compares by identity: both lists hold the same hit objects.
+ */
+export function countDisplacedByCut(
+  original: readonly RecallHit[],
+  boosted: readonly RecallHit[],
+  limit: number,
+): number {
+  if (!Number.isFinite(limit) || limit <= 0) return 0;
+  const shownAfter = new Set(boosted.slice(0, limit));
+  let displaced = 0;
+  for (const hit of original.slice(0, limit)) {
+    if (!shownAfter.has(hit)) displaced += 1;
+  }
+  return displaced;
+}
+
+/** The line that reports the cut. Empty when nothing was displaced, so the common
+ * case stays quiet. */
+export function renderDomainCutNote(displaced: number, limit: number): string {
+  if (displaced <= 0) return '';
+  const plural = displaced === 1 ? 'lesson' : 'lessons';
+  return `  ${displaced} lower-ranked ${plural} fell past the --limit ${limit} cut to make room — raise --limit to see them (the boost promotes; the cut is what hides)`;
+}
+
+/** One honest line about what the boost did — including the case where it did
+ * nothing, which a silent reorder would hide.
+ *
+ * The two tail phrases below are a WIRE CONTRACT: `learning_bridge.py` in the
+ * `goap-research-ed25519` skill detects whether the installed `dz` supports
+ * `--domain` by looking for them, because an older CLI ignores the flag and exits 0
+ * (so an exit code cannot tell the versions apart). A test pins both strings — if you
+ * reword them, update the bridge in the same change or you switch that loop into
+ * permanent degraded mode without a single test turning red. */
+export function renderDomainBoostNote(result: DomainBoostResult, wanted: string): string {
+  if (result.noMatches) {
+    return `  domain "${wanted}": no lesson in this result carries it — order unchanged, nothing was hidden`;
+  }
+  const parts = [`${result.exact} exact`];
+  if (result.related > 0) parts.push(`${result.related} related`);
+  const effect = result.moved === 0
+    ? 'the order was already correct — nothing moved'
+    : `${result.moved} changed position`;
+  // The counts describe the CANDIDATES the boost ranked, which is a longer list than
+  // the one printed (the caller over-fetches, then cuts at --limit). Saying "3 changed
+  // position" above two printed lines reads as an arithmetic error unless the note
+  // names the list it is talking about — so it does.
+  return `  domain "${wanted}": among ${result.hits.length} candidate(s) — ${parts.join(', ')} match(es), ${effect}; foreign-domain lessons kept (a boost, not a filter)`;
+}

package/src/store-lock.ts

@@ -0,0 +1,258 @@
+/**
+ * Cross-process exclusive lock for the JSON pattern store — built on `proper-lockfile`.
+ *
+ * WHY THIS EXISTS. The JSON backend writes ATOMICALLY (temp file + rename), so no reader
+ * ever sees a torn file. That is a different property from the one needed here. A teach is
+ * a read-modify-write: load every record, add one, write them all back. Two teaches that
+ * overlap both load the same N records, and each writes back N+1 — the second rename wins
+ * and the first lesson is gone. BOTH processes report success, so a lost lesson is silent.
+ * Atomicity prevents corruption; only mutual exclusion prevents a lost update.
+ *
+ * The SQLite backend has its own transaction locking and does not go through here.
+ *
+ * WHY `proper-lockfile` AND NOT THE PREVIOUS HAND-ROLLED LOCK. An independent review
+ * (Codex gpt-5.6-sol) graded the hand-rolled `wx`-file lock F. Its findings, and how this
+ * implementation answers them:
+ *
+ * 1. *Stale-break deleted a successor's live lock* — the old code `rmSync`'d a lock file
+ *    by PATHNAME after deciding it was stale, so two waiters breaking the same stale lock
+ *    could delete each other's freshly created locks in a cascade. `proper-lockfile`
+ *    acquires with an atomic `mkdir`, and a waiter that breaks a stale lock retries with
+ *    staleness DISABLED, so per acquisition attempt it can remove at most the one lock it
+ *    observed as stale — never a successor's fresh lock in a loop. The residual
+ *    microsecond window (stat-stale → holder replaced → rmdir) is closed by DETECTION:
+ *    every holder heartbeats its lock's mtime and treats a foreign mtime as ECOMPROMISED,
+ *    which {@link withStoreLock} converts into a loud error instead of a silent lost
+ *    update. (This is also the model the RVF spec uses for `.rvf` writer locks:
+ *    single-writer advisory lock file + ownership verification before unlink —
+ *    `ruvector/docs/research/rvf/spec/09-concurrency-versioning.md`.)
+ *
+ * 2. *"Unparseable means dead" deleted live locks* — there is no lock BODY to parse any
+ *    more. The lock is a directory; its existence is the lock, so the empty-file /
+ *    half-written-file misclassification class is structurally gone.
+ *
+ * 3. *Age was mistaken for liveness* — staleness is now filesystem mtime plus a HEARTBEAT:
+ *    the holder refreshes the lock's mtime on a timer (every `staleMs / 2`, ≥ 1s), so a
+ *    holder slower than `staleMs` is never broken while alive, and a crashed holder's lock
+ *    stops being refreshed and is reclaimed after `staleMs`. Nothing trusts a
+ *    self-reported timestamp, so a forged far-future `ts` can no longer block forever.
+ *    NOTE: the heartbeat runs on the event loop, so a SYNCHRONOUS critical section longer
+ *    than `staleMs` could still be observed as stale — keep {@link withStoreLockSync}
+ *    bodies short (they are: single-file JSON rewrites) or raise `staleMs`.
+ *
+ * 4. *The timeout was not an acquisition deadline* — the retry loops below compute a real
+ *    deadline (`now + timeoutMs`), re-check it after EVERY sleep, clamp the last sleep to
+ *    the remaining budget, and never acquire after the deadline has passed.
+ *
+ * 5. *The lock was not store-wide* — every JSON-tier writer in `patterns.ts` now runs
+ *    under this lock (see the writer inventory in that module).
+ *
+ * On timeout this THROWS ({@link StoreLockTimeoutError}) rather than proceeding unlocked.
+ * Proceeding would restore exactly the silent lost-update this exists to stop, and a teach
+ * that failed loudly can be retried — one that vanished cannot.
+ *
+ * MIGRATION: the pre-`proper-lockfile` implementation left a regular FILE at
+ * `.dz/store.lock`; the library's lock is a DIRECTORY at the same path. A leftover file
+ * from a crashed old process is removed only once it is older than `staleMs` — a fresh
+ * one is honoured as held, same as any other lock.
+ */
+
+import { mkdirSync, rmSync, statSync } from 'node:fs';
+import { join, resolve } from 'node:path';
+import { lockSync } from 'proper-lockfile';
+
+/** A lock whose HEARTBEAT stopped this long ago is presumed abandoned (crashed holder). */
+export const STALE_LOCK_MS = 30_000;
+/** Give up waiting after this long and say so, rather than blocking a CLI forever. */
+export const LOCK_TIMEOUT_MS = 10_000;
+
+/** `proper-lockfile` silently clamps `stale` up to this minimum. */
+const MIN_STALE_MS = 2_000;
+
+/** Path of the lock guarding a project's pattern store (a DIRECTORY when held). */
+export function storeLockPath(projectRoot: string): string {
+  return join(projectRoot, '.dz', 'store.lock');
+}
+
+/** Options accepted by {@link withStoreLock} / {@link withStoreLockSync}. */
+export interface StoreLockOptions {
+  /** Heartbeat-stopped threshold before a lock is presumed abandoned (min 2000, lib-enforced). */
+  readonly staleMs?: number;
+  /** Acquisition deadline. Also overridable via `DZ_STORE_LOCK_TIMEOUT_MS` (tests/ops). */
+  readonly timeoutMs?: number;
+  /** Delay between acquisition attempts while the lock is held by someone else. */
+  readonly pollMs?: number;
+}
+
+/** Acquisition gave up at the deadline. Nothing was written; the operation can be retried. */
+export class StoreLockTimeoutError extends Error {
+  readonly code = 'ELOCKTIMEOUT';
+  constructor(lockPath: string, waitedMs: number) {
+    super(
+      `the pattern store at ${lockPath} stayed locked for ${waitedMs}ms — ` +
+      'another dz process is still writing. Nothing was written; retry.',
+    );
+    this.name = 'StoreLockTimeoutError';
+  }
+}
+
+/**
+ * The holder detected that its lock was broken out from under it (ECOMPROMISED) — e.g. a
+ * waiter reclaimed the lock after this process was suspended past `staleMs`. The critical
+ * section DID run, but it may have raced another writer, so the operation must be treated
+ * as failed and retried (store writes are idempotent by deterministic record id).
+ */
+export class StoreLockCompromisedError extends Error {
+  readonly code = 'ECOMPROMISED';
+  constructor(lockPath: string, cause: Error) {
+    super(`the pattern store lock at ${lockPath} was compromised while held (${cause.message}) — retry the operation.`);
+    this.name = 'StoreLockCompromisedError';
+  }
+}
+
+const defaultTimeoutMs = (): number => {
+  const env = Number(process.env['DZ_STORE_LOCK_TIMEOUT_MS']);
+  return Number.isFinite(env) && env > 0 ? env : LOCK_TIMEOUT_MS;
+};
+
+const sleep = (ms: number): Promise<void> => new Promise((r) => { setTimeout(r, ms); });
+
+/** Synchronous sleep without spinning (Atomics.wait on a throwaway buffer). */
+const sleepSync = (ms: number): void => {
+  Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, ms);
+};
+
+/**
+ * Remove a REGULAR-FILE lock left by the pre-`proper-lockfile` implementation, but only
+ * once it is stale — a fresh legacy lock belongs to a live old-version process and is
+ * honoured. (Never deletes a directory: that is a live library lock.)
+ */
+function clearStaleLegacyLockFile(lockPath: string, staleMs: number): void {
+  try {
+    const st = statSync(lockPath);
+    if (st.isFile() && Date.now() - st.mtimeMs >= staleMs) rmSync(lockPath, { force: true });
+  } catch { /* gone already — fine */ }
+}
+
+interface Acquired {
+  readonly release: () => void;
+  readonly compromise: () => Error | undefined;
+}
+
+/**
+ * One acquisition attempt. Returns `'held'` when someone else holds the lock (retry later);
+ * throws on real I/O errors. `mkdir`-based, so creation is atomic; staleness is heartbeat
+ * mtime, and the library's own stale-break retries with staleness disabled (see header §1).
+ */
+function tryAcquire(projectRoot: string, staleMs: number, onCompromised: (e: Error) => void): Acquired | 'held' {
+  const lockPath = storeLockPath(projectRoot);
+  try {
+    const release = lockSync(resolve(projectRoot, '.dz', 'store'), {
+      lockfilePath: lockPath,
+      stale: staleMs,
+      realpath: false, // the guarded resource is a concept, not an existing file
+      onCompromised,
+    });
+    return {
+      release: () => {
+        try {
+          release();
+        } catch { /* ERELEASED after a compromise — the lock is no longer ours to remove */ }
+      },
+      compromise: () => undefined,
+    };
+  } catch (err) {
+    const code = (err as NodeJS.ErrnoException).code;
+    if (code === 'ELOCKED') return 'held';
+    if (code === 'ENOTDIR') {
+      // A stale legacy FILE lock: the library can only rmdir directories. Clear it (only
+      // if actually stale) and report 'held' so the caller's loop retries.
+      clearStaleLegacyLockFile(lockPath, staleMs);
+      return 'held';
+    }
+    throw err;
+  }
+}
+
+function resolveOpts(opts: StoreLockOptions): { staleMs: number; timeoutMs: number; pollMs: number } {
+  return {
+    staleMs: Math.max(opts.staleMs ?? STALE_LOCK_MS, MIN_STALE_MS),
+    timeoutMs: opts.timeoutMs ?? defaultTimeoutMs(),
+    pollMs: opts.pollMs ?? 25,
+  };
+}
+
+/**
+ * Run `fn` while holding the store lock, releasing it however `fn` ends.
+ *
+ * Throws {@link StoreLockTimeoutError} when the lock cannot be acquired by the deadline
+ * (nothing has run), and {@link StoreLockCompromisedError} when the lock was broken while
+ * `fn` ran (it DID run, but may have raced — retry; store writes are idempotent).
+ */
+export async function withStoreLock<T>(
+  projectRoot: string,
+  fn: () => Promise<T>,
+  opts: StoreLockOptions = {},
+): Promise<T> {
+  const { staleMs, timeoutMs, pollMs } = resolveOpts(opts);
+  mkdirSync(join(projectRoot, '.dz'), { recursive: true });
+  const started = Date.now();
+  const deadline = started + timeoutMs;
+  let compromised: Error | undefined;
+  const onCompromised = (e: Error): void => { compromised = e; };
+  for (;;) {
+    const got = tryAcquire(projectRoot, staleMs, onCompromised);
+    if (got !== 'held') {
+      let result: T;
+      try {
+        result = await fn();
+      } finally {
+        got.release();
+      }
+      if (compromised !== undefined) throw new StoreLockCompromisedError(storeLockPath(projectRoot), compromised);
+      return result;
+    }
+    const now = Date.now();
+    if (now >= deadline) throw new StoreLockTimeoutError(storeLockPath(projectRoot), now - started);
+    await sleep(Math.min(pollMs, deadline - now));
+  }
+}
+
+/**
+ * Synchronous {@link withStoreLock}, for the store's synchronous writers (prune / remove).
+ * Same deadline and failure semantics. The heartbeat cannot fire while `fn` blocks the
+ * event loop, so keep bodies well under `staleMs` (they are: single-file JSON rewrites).
+ *
+ * CAVEAT: do not contend with an ASYNC `withStoreLock` holder in the SAME process — the
+ * sync wait blocks the event loop that would release that holder, so the wait can only
+ * end in the loud {@link StoreLockTimeoutError} (never a lost update). Cross-process
+ * contention, the case this lock exists for, is unaffected.
+ */
+export function withStoreLockSync<T>(
+  projectRoot: string,
+  fn: () => T,
+  opts: StoreLockOptions = {},
+): T {
+  const { staleMs, timeoutMs, pollMs } = resolveOpts(opts);
+  mkdirSync(join(projectRoot, '.dz'), { recursive: true });
+  const started = Date.now();
+  const deadline = started + timeoutMs;
+  let compromised: Error | undefined;
+  const onCompromised = (e: Error): void => { compromised = e; };
+  for (;;) {
+    const got = tryAcquire(projectRoot, staleMs, onCompromised);
+    if (got !== 'held') {
+      let result: T;
+      try {
+        result = fn();
+      } finally {
+        got.release();
+      }
+      if (compromised !== undefined) throw new StoreLockCompromisedError(storeLockPath(projectRoot), compromised);
+      return result;
+    }
+    const now = Date.now();
+    if (now >= deadline) throw new StoreLockTimeoutError(storeLockPath(projectRoot), now - started);
+    sleepSync(Math.min(pollMs, deadline - now));
+  }
+}

package/src/workflows.ts

@@ -1,123 +1,24 @@
 /**
- * Dynamic workflow templates for Opus 4.8+ orchestration.
+ * RETIRED — the ADR-005 workflow templates are gone (feature loop-designer, AM-6 / architecture
+ * §8.2). They emitted a pre-`meta`/`phases` format (`export default {tasks, maxConcurrency}`) the
+ * current Workflow runtime cannot execute — a broken command, not a feature.
  *
- * Per ADR-005: workflows live in the orchestration layer only.
- * They generate JS scripts that Claude Code's dynamic workflow engine executes.
- * Core schema, adapters, and skill content remain model-agnostic.
+ * Replacement: `dz workflow init` (scaffold a `loop-plan/1` plan), `dz workflow validate`,
+ * `dz workflow render` (plan → executable region-delimited loop script), plus the sibling gates
+ * `dz workflow-lint` and `dz workflow-trace`. See `loop-plan.ts` / `loop-render.ts`.
  *
- * @packageDocumentation
+ * BREAKING (deliberate, channeled): removing `WorkflowTemplate`/`WORKFLOWS`/`getWorkflow` is a
+ * public API change for harness-core. harness-core is 0.x, where MINOR is this repo's breaking
+ * channel; the removal is named in the CHANGELOG and README — never silent. The only internal
+ * importer was `harness-cli`'s `cmdWorkflow` (MEASURED at plan time), rewritten in the same change.
+ *
+ * This module stays as a deprecation shim so stale imports fail LOUDLY with a pointer, not with a
+ * confusing "module not found".
  */
 
-/** A workflow template — generates a JS orchestration script from parameters. */
-export interface WorkflowTemplate {
-  readonly name: string;
-  readonly description: string;
-  readonly generate: (options: WorkflowOptions) => string;
-}
-
-/** Options passed to workflow generation. */
-export interface WorkflowOptions {
-  readonly projectRoot: string;
-  readonly dryRun?: boolean;
-  readonly packages?: readonly string[];
-}
-
-const coverageLift: WorkflowTemplate = {
-  name: 'coverage-lift',
-  description: 'Lift Tier-A package coverage to ≥95% using parallel agents per package.',
-  generate: (opts) => `
-// Dynamic Workflow: Coverage Lift
-// Generated for: ${opts.projectRoot}
-// Per ADR-005: orchestration only — no adapter/core changes
-
-const tierA = ${JSON.stringify(opts.packages ?? [
-    'core', 'memory', 'harness-core', 'harness-cli',
-    'harness-presets', 'mcp-server-tools',
-    'adapter-claude', 'adapter-codex', 'adapter-opencode', 'adapter-hermes',
-    'skills-qe',
-  ])};
-
-const tasks = tierA.map(pkg => ({
-  name: \`coverage-\${pkg}\`,
-  description: \`Lift @dzhechkov/\${pkg} to ≥95% line coverage. Run: pnpm --filter @dzhechkov/\${pkg} test -- --coverage. Add tests for uncovered lines.\`,
-}));
-
-// Claude Code dynamic workflow engine will:
-// 1. Spawn one agent per task (up to 16 concurrent)
-// 2. Each agent reads coverage, writes tests, re-runs coverage
-// 3. Results aggregated when all agents complete
-export default { tasks, maxConcurrency: 4${opts.dryRun ? ', dryRun: true' : ''} };
-`.trim(),
-};
-
-const mutationKill: WorkflowTemplate = {
-  name: 'mutation-kill',
-  description: 'Kill surviving mutants across core packages using parallel Stryker runs.',
-  generate: (opts) => `
-// Dynamic Workflow: Mutation Kill
-// Generated for: ${opts.projectRoot}
-
-const packages = ${JSON.stringify(opts.packages ?? ['core', 'memory', 'harness-core'])};
-
-const tasks = packages.map(pkg => ({
-  name: \`mutate-\${pkg}\`,
-  description: \`Run Stryker on @dzhechkov/\${pkg}, analyze survivors, write tests to kill them. Target: ≥80% mutation score.\`,
-}));
-
-export default { tasks, maxConcurrency: 3${opts.dryRun ? ', dryRun: true' : ''} };
-`.trim(),
-};
-
-const canonicalize: WorkflowTemplate = {
-  name: 'canonicalize',
-  description: 'Canonicalize packages from vendored directories into @dzhechkov/* namespace.',
-  generate: (opts) => `
-// Dynamic Workflow: Canonicalize
-// Generated for: ${opts.projectRoot}
-
-const tasks = [
-  { name: 'discover', description: 'Scan vendored directories for un-canonicalized packages.' },
-  { name: 'copy', description: 'Copy discovered packages to packages/@dzhechkov/. Exclude node_modules, .git, runtime state.' },
-  { name: 'metadata', description: 'Add publishConfig, repository, homepage to each package.json.' },
-  { name: 'verify', description: 'Run byte-level diff between source and canonical. 0 missing, 0 changed.' },
-  { name: 'test', description: 'Run canonical-packages structural tests. All must pass.' },
-];
-
-export default { tasks, maxConcurrency: 2${opts.dryRun ? ', dryRun: true' : ''} };
-`.trim(),
-};
-
-const securityAudit: WorkflowTemplate = {
-  name: 'security-audit',
-  description: 'Run adversarial security audit with parallel boundary scanning.',
-  generate: (opts) => `
-// Dynamic Workflow: Security Audit
-// Generated for: ${opts.projectRoot}
-
-const tasks = [
-  { name: 'npm-audit', description: 'Run pnpm audit, capture baseline.' },
-  { name: 'gitleaks', description: 'Run gitleaks detect, document findings.' },
-  { name: 'boundaries', description: 'Verify all 8 input boundaries have runtime guards.' },
-  { name: 'payloads', description: 'Test aidefence payloads against boundaries.' },
-  { name: 'report', description: 'Generate security-audit.md with 6 H2 sections.' },
-];
-
-export default { tasks, maxConcurrency: 3${opts.dryRun ? ', dryRun: true' : ''} };
-`.trim(),
-};
-
-/** All registered workflow templates. */
-export const WORKFLOWS: Record<string, WorkflowTemplate> = {
-  'coverage-lift': coverageLift,
-  'mutation-kill': mutationKill,
-  'canonicalize': canonicalize,
-  'security-audit': securityAudit,
-};
-
-/** Valid workflow names. */
-export const WORKFLOW_NAMES = Object.keys(WORKFLOWS);
+/** The pinned retirement message the CLI prints (tested by workflow-legacy-shim.test.ts). */
+export const WORKFLOW_TEMPLATES_RETIRED_MESSAGE =
+  'dz workflow: the ADR-005 templates are retired (they emitted a pre-meta format the runtime cannot run) — use dz workflow init/render';
 
-/** Look up a workflow by name. */
-export function getWorkflow(name: string): WorkflowTemplate | undefined {
-  return WORKFLOWS[name];
-}
+/** Empty by design: no legacy template names remain. */
+export const WORKFLOW_NAMES: string[] = [];