mixdog 0.9.63 → 0.9.65

package/src/runtime/memory/lib/core-memory-store.mjs

@@ -1,8 +1,5 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
+export { __mixdogMemoryLog };
 
 // User-curated core memory store — native PG-backed via core_entries table.
 // Per-project entries distinguished by project_id column (NULL = COMMON).
@@ -28,10 +25,10 @@ const VALID_CAT = new Set([
 // than cycle2's tier-1 (0.78) on purpose: LLM verdict is authoritative so
 // the recall side can afford broader recall.
 const SIM_RECALL = 0.65
-const CORE_DEDUP_TOP_K = 5
+export const CORE_DEDUP_TOP_K = 5
 
 export const CORE_SUMMARY_MAX = 100
-export const CORE_ELEMENT_MAX = 40
+const CORE_ELEMENT_MAX = 40
 
 function trimOrNull(v) {
   if (v == null) return null
@@ -62,7 +59,7 @@ export function normalizeCoreInput(input = {}, options = {}) {
   return { element, summary, category, suppliedCategory, errors }
 }
 
-function _getDb(dataDir) {
+export function _getDb(dataDir) {
   if (!dataDir) throw new Error('core-memory: dataDir required')
   const db = getDatabase(dataDir)
   if (!db) throw new Error('core-memory: database not open — call openDatabase first')
@@ -79,7 +76,7 @@ async function _embedFor(db, element, summary) {
 // Lazy repair of NULL embeddings on existing rows. Runs once per boot or
 // whenever a NULL slips back in via direct SQL. SELECT WHERE embedding IS NULL
 // returns 0 rows on a fully-populated table, so this is a fast no-op.
-function throwIfAborted(signal) {
+export function throwIfAborted(signal) {
   if (signal?.aborted) throw signal.reason ?? new Error('aborted')
 }
 
@@ -567,352 +564,5 @@ export async function reclassifyCore(dataDir, id, newProjectId, expect = null) {
 }
 
 // ─── Core-candidate promotion pipeline (proposal mode) ───────────────────────
-//
-// nominateCoreCandidates flags strong active entries as core-memory
-// candidates. NEVER auto-inserts into core_entries — a user approves each via
-// listCoreCandidates → promoteCoreCandidate. Durable-signal driven:
-//   - category grade: only durable knowledge types (rule/constraint/decision/
-//     preference/goal/fact) — transient task/issue never nominated.
-//   - score >= CANDIDATE_MIN_SCORE: survived age-decay / repeated gate reviews.
-//   - reviewed_at survival: entry has been through >= 1 gate review (reviewed_at
-//     set) so freshly-promoted noise is excluded.
-//   - core_overlap skip: entries whose embedding sits near an existing
-//     core_entries row (sim >= CANDIDATE_OVERLAP_SIM) are already covered by a
-//     user rule — skip to avoid duplicate promotion. Reuses the same cosine
-//     recall shape as cycle2 phase_merge core_overlap.
-// Terminal states ('promoted'/'dismissed') are never re-nominated. Caps at
-// CANDIDATE_CAP total live candidates.
-
-const CANDIDATE_CAP = 10
-// Durable categories worth surfacing for user-curated core memory. Mirrors the
-// high end of CATEGORY_GRADE (memory-score.mjs) — task/issue excluded.
-const CANDIDATE_CATEGORIES = new Set(['rule', 'constraint', 'decision', 'preference', 'goal', 'fact'])
-// Score floor: preference grade is 1.4, fact 1.6 — require the entry to still
-// be near its grade ceiling (i.e. survived decay), not a stale low-score root.
-const CANDIDATE_MIN_SCORE = 1.3
-// Embedding sim at/above which the active entry is considered already covered
-// by an existing core row → skip nomination. Matches cycle2 TIER1_THRESHOLD.
-const CANDIDATE_OVERLAP_SIM = 0.78
-// A promote left mid-flight ('promoting') longer than this is treated as a
-// crashed promotion and reverted to a live candidate by recoverStalePromotions.
-// Worst-case addCore duration bounds this: it runs up to CORE_DEDUP_TOP_K (5)
-// sequential LLM merge-judge calls at 30s timeout each (~150s) plus embedding
-// generation — call it ~3min worst case. 15min gives >5x margin so a slow-but-
-// live promote is never mistaken for a crash, while still recovering a genuine
-// crash within one hourly cycle2 pass. The finalize path ALSO tolerates a
-// racing recovery (rowCount=0 → re-claim, see promoteCoreCandidate) so an
-// over-tight cutoff can't corrupt state — this margin is defense-in-depth.
-const PROMOTING_STALE_MS = 15 * 60_000
-
-function _candidateReason(row) {
-  return `${row.category} grade, score ${Number(row.score).toFixed(2)}, survived gate review`
-}
-
-// Post-gate nomination pass. Cheap: one scan over durable high-score active
-// roots not already candidate/promoted/dismissed, one core-overlap cosine
-// probe per row, capped at CANDIDATE_CAP net-new. Returns count nominated.
-export async function nominateCoreCandidates(dataDir, options = {}) {
-  const signal = options?.signal
-  const db = _getDb(dataDir)
-  throwIfAborted(signal)
-  // Recover crashed promotions first: a root stuck in 'promoting' past
-  // PROMOTING_STALE_MS (claim tx committed but the process died before finalize)
-  // is reverted to a live candidate here, so it re-enters the pool below.
-  try {
-    await recoverStalePromotions(dataDir, { signal })
-    throwIfAborted(signal)
-  } catch (err) {
-    if (signal?.aborted) throw signal.reason ?? err
-    __mixdogMemoryLog(`[core-memory] stale-promotion recovery failed: ${err.message}\n`)
-  }
-  // Live candidate headroom: never exceed CANDIDATE_CAP total pending. Count
-  // only ACTIVE candidate roots — a candidate archived by cycle2 core_overlap
-  // between nomination and now must not eat headroom (it is also excluded from
-  // listCoreCandidates by the same status='active' guard).
-  const liveRes = await db.query(
-    `SELECT COUNT(*)::int AS n FROM entries WHERE is_root = 1 AND status = 'active' AND core_candidate_status = 'candidate'`,
-  )
-  const live = Number(liveRes.rows[0]?.n ?? 0)
-  const headroom = CANDIDATE_CAP - live
-  if (headroom <= 0) return 0
-
-  // Pull the strongest eligible roots that have never been nominated (status
-  // NULL) and have been through a gate review (reviewed_at set). Terminal
-  // 'promoted'/'dismissed' rows are excluded by the NULL predicate.
-  const cats = [...CANDIDATE_CATEGORIES]
-  const eligibleRes = await db.query(
-    `SELECT id, element, summary, category, score, project_id,
-            (embedding IS NOT NULL) AS has_embedding
-     FROM entries
-     WHERE is_root = 1 AND status = 'active'
-       AND core_candidate_status IS NULL
-       AND reviewed_at IS NOT NULL
-       AND category = ANY($1::text[])
-       AND score >= $2
-     ORDER BY score DESC, last_seen_at DESC, id ASC
-     LIMIT $3`,
-    [cats, CANDIDATE_MIN_SCORE, headroom * 3],
-  )
-  throwIfAborted(signal)
-
-  const now = Date.now()
-  let nominated = 0
-  for (const row of eligibleRes.rows) {
-    throwIfAborted(signal)
-    if (nominated >= headroom) break
-    // core_overlap skip: is this entry already covered by an existing core row?
-    // Compute similarity fully in SQL against the entry's own embedding
-    // (referenced by id) so no halfvec value round-trips through JS — mirrors
-    // the cycle2 phase_merge core_overlap probe shape. Same-pool + COMMON core
-    // are eligible matches.
-    if (row.has_embedding) {
-      const ov = await db.query(
-        `SELECT 1 - (e.embedding <=> c.embedding) AS sim
-         FROM entries e
-         CROSS JOIN LATERAL (
-           SELECT inner_c.embedding
-           FROM core_entries inner_c
-           WHERE inner_c.embedding IS NOT NULL
-            AND (inner_c.status IS NULL OR inner_c.status = 'active')
-             AND (inner_c.project_id IS NULL OR inner_c.project_id IS NOT DISTINCT FROM e.project_id)
-           ORDER BY inner_c.embedding <=> e.embedding
-           LIMIT 1
-         ) c
-         WHERE e.id = $1 AND e.embedding IS NOT NULL`,
-        [Number(row.id)],
-      )
-      throwIfAborted(signal)
-      if (ov.rows.length > 0 && Number(ov.rows[0].sim) >= CANDIDATE_OVERLAP_SIM) continue
-    }
-    const r = await db.query(
-      `UPDATE entries SET core_candidate_status = 'candidate', core_candidate_at = $1
-       WHERE id = $2 AND is_root = 1 AND core_candidate_status IS NULL`,
-      [now, Number(row.id)],
-    )
-    if (Number(r.rowCount ?? r.affectedRows ?? 0) > 0) nominated++
-  }
-  if (nominated > 0) {
-    __mixdogMemoryLog(`[core-memory] nominated ${nominated} core candidate(s)\n`)
-  }
-  return nominated
-}
-
-// List live candidates for the UI. Shape matches the deliver spec:
-// {id, element, summary, category, score, reason}.
-// `scope`: null → COMMON pool only (project_id NULL); '*' → all pools;
-// slug → that project's pool + COMMON. Mirrors the add/edit/delete + list
-// project isolation so an unscoped call can't leak another project's
-// candidates. status='active' guard: a candidate root archived by cycle2
-// core_overlap between nomination and listing must NOT stay listed (it also
-// no longer counts against CANDIDATE_CAP — see nominateCoreCandidates).
-export async function listCoreCandidates(dataDir, scope = null) {
-  const db = _getDb(dataDir)
-  let scopeClause = ''
-  const params = []
-  if (scope === '*') {
-    scopeClause = ''
-  } else if (scope == null) {
-    scopeClause = 'AND project_id IS NULL'
-  } else {
-    scopeClause = 'AND (project_id IS NULL OR project_id = $1)'
-    params.push(scope)
-  }
-  const r = await db.query(
-    `SELECT id, element, summary, category, score, project_id
-     FROM entries
-     WHERE is_root = 1 AND status = 'active' AND core_candidate_status = 'candidate'
-       ${scopeClause}
-     ORDER BY score DESC, core_candidate_at DESC, id ASC`,
-    params,
-  )
-  return r.rows.map(row => ({
-    id: Number(row.id),
-    element: row.element,
-    summary: row.summary,
-    category: row.category,
-    score: row.score == null ? null : Number(row.score),
-    project_id: row.project_id ?? null,
-    reason: _candidateReason(row),
-  }))
-}
-
-// Promote a candidate via a two-phase claim → insert → finalize with a
-// recoverable intermediate state ('promoting'), so a process crash at ANY point
-// is recoverable by the cycle2 recovery sweep (recoverStalePromotions).
-//
-// Phase 1 (claim tx): status='archived', core_candidate_status='promoting'.
-//   The embedding is NOT nulled here — deferred to finalize — so recovery can
-//   restore the row to active WITHOUT needing to re-embed. Archived-with-
-//   embedding for the brief promoting window is harmless: the recall scope
-//   filter excludes BOTH 'promoted' AND 'promoting' rows (and their members).
-// Phase 2: addCore (its own tx — advisory locks can't join an outer tx).
-// Phase 3 (finalize tx): core_candidate_status='promoted', embedding=NULL.
-//
-// Crash matrix:
-//   - crash after phase 1, before addCore commits → row is archived+'promoting'
-//     with NO core row → recovery sweep (stale > PROMOTING_STALE_MS) reverts it
-//     to active+'candidate' (embedding intact) → clean retry.
-//   - addCore threw → synchronous compensation reverts immediately (same shape).
-//   - crash after addCore commits, before finalize → core row exists + row is
-//     'promoting' → recovery reverts the ROOT to candidate, but the core row now
-//     exists, so the retry's addCore merge-judge/unique-index folds back into the
-//     same core row (element unchanged) → converges (no duplicate).  This is the
-//     one window where a retry relies on addCore dedup, but it is bounded and
-//     self-healing rather than a permanent orphan+stuck-root.
-//   - finalize committed → terminal 'promoted', embedding NULL → done.
-//
-// `scope` (from the index handler) enforces project isolation: the candidate
-// must belong to the resolved scope or COMMON — never another project's pool.
-export async function promoteCoreCandidate(dataDir, id, options = {}) {
-  const numId = Number(id)
-  if (!Number.isInteger(numId) || numId <= 0) throw new Error('integer id > 0 required')
-  const db = _getDb(dataDir)
-  // Require BOTH active status and a live candidate flag (finding #2): a stale
-  // archived/merged root must not be promotable by direct id.
-  const cur = (await db.query(
-    `SELECT id, element, summary, category, project_id, core_candidate_status
-     FROM entries WHERE id = $1 AND is_root = 1 AND status = 'active'`,
-    [numId],
-  )).rows[0]
-  if (!cur) throw new Error(`no active root entry with id=${numId} (already archived, merged, or deleted)`)
-  if (cur.core_candidate_status !== 'candidate') {
-    throw new Error(`entry id=${numId} is not a live core candidate (status=${cur.core_candidate_status ?? 'none'})`)
-  }
-  // Project-scope guard: reject cross-project promotion. scope null == COMMON;
-  // a scoped candidate is only promotable within its own pool (or if it is a
-  // COMMON candidate). Mirrors add/edit/delete project isolation.
-  const scope = options?.scope ?? null
-  const rowPid = cur.project_id ?? null
-  if (rowPid != null && rowPid !== scope) {
-    throw new Error(`candidate id=${numId} belongs to project "${rowPid}", not the resolved scope "${scope ?? 'common'}"`)
-  }
-  // Core summary cap: candidate summaries may exceed CORE_SUMMARY_MAX. Prefer
-  // the explicit override, else compress by truncation so addCore accepts it.
-  const summary = options?.summary ?? cur.summary
-  const cappedSummary = summary && String(summary).length > CORE_SUMMARY_MAX
-    ? String(summary).slice(0, CORE_SUMMARY_MAX)
-    : summary
-  const now = Date.now()
-  // Phase 1 — claim (active+candidate guarded so a concurrent archive/promote
-  // loses the race → 0 rows → nothing to promote). Embedding NOT nulled here
-  // (deferred to finalize) so recovery needs no re-embed.
-  const claim = await db.transaction(async (tx) => {
-    const r = await tx.query(
-      `UPDATE entries SET core_candidate_status = 'promoting', core_candidate_at = $1, status = 'archived'
-       WHERE id = $2 AND is_root = 1 AND status = 'active' AND core_candidate_status = 'candidate'`,
-      [now, numId],
-    )
-    return Number(r.rowCount ?? r.affectedRows ?? 0)
-  })
-  if (claim === 0) {
-    throw new Error(`candidate id=${numId} was concurrently promoted/archived — nothing to do`)
-  }
-  // Phase 2 — insert into core_entries. addCore's own tx commits independently.
-  let entry
-  try {
-    entry = await addCore(
-      dataDir,
-      { element: cur.element, summary: cappedSummary, category: cur.category },
-      rowPid,
-    )
-  } catch (err) {
-    // Synchronous compensation: revert the 'promoting' claim to the live-
-    // candidate state so a retry is clean and no core row was created. Embedding
-    // is intact (never nulled), so no re-embed needed.
-    try {
-      await db.transaction(async (tx) => {
-        await tx.query(
-          `UPDATE entries SET core_candidate_status = 'candidate', core_candidate_at = $1, status = 'active'
-           WHERE id = $2 AND is_root = 1 AND core_candidate_status = 'promoting' AND status = 'archived'`,
-          [Date.now(), numId],
-        )
-      })
-    } catch (compErr) {
-      __mixdogMemoryLog(`[core-memory] promote compensation failed id=${numId}: ${compErr.message} (root left 'promoting' — recovery sweep will revert)\n`)
-    }
-    throw err
-  }
-  // Phase 3 — finalize: terminal 'promoted' + null the embedding (now safe: the
-  // core row is committed, so nulling can't strand a recoverable row without its
-  // fact). Guarded on 'promoting'. If a racing recoverStalePromotions (slow
-  // addCore that overran PROMOTING_STALE_MS) already reverted the row to
-  // 'candidate'+active, this affects 0 rows — but the core row IS committed, so
-  // we must NOT return success while the root is still a live candidate (user
-  // would see success + the candidate re-listed). Re-claim from the recovered
-  // 'candidate' state (finding #2). If THAT also affects 0 rows, another actor
-  // changed the row (genuine re-promote, dismiss, archive) — don't clobber;
-  // log and still return the entry (the core row exists either way).
-  const finalize = await db.transaction(async (tx) => {
-    const r1 = await tx.query(
-      `UPDATE entries SET core_candidate_status = 'promoted', core_candidate_at = $1, embedding = NULL
-       WHERE id = $2 AND is_root = 1 AND core_candidate_status = 'promoting'`,
-      [Date.now(), numId],
-    )
-    if (Number(r1.rowCount ?? r1.affectedRows ?? 0) > 0) return 'finalized'
-    // Row was recovered back to candidate mid-flight — re-claim it (core row
-    // already committed). Guard on the exact recovery state (active+candidate).
-    const r2 = await tx.query(
-      `UPDATE entries SET core_candidate_status = 'promoted', core_candidate_at = $1, status = 'archived', embedding = NULL
-       WHERE id = $2 AND is_root = 1 AND status = 'active' AND core_candidate_status = 'candidate'`,
-      [Date.now(), numId],
-    )
-    return Number(r2.rowCount ?? r2.affectedRows ?? 0) > 0 ? 'reclaimed' : 'unchanged'
-  })
-  if (finalize === 'reclaimed') {
-    __mixdogMemoryLog(`[core-memory] promote id=${numId} finalized after a racing recovery revert (re-claimed)\n`)
-  } else if (finalize === 'unchanged') {
-    __mixdogMemoryLog(`[core-memory] promote id=${numId}: root changed by another actor before finalize; core row committed, root state left as-is\n`)
-  }
-  return entry
-}
-
-// Recovery sweep for crashed promotions: a root left in 'promoting' (claim tx
-// committed but the process died before finalize) is reverted to the live
-// candidate state (status='active', core_candidate_status='candidate') once it
-// is older than PROMOTING_STALE_MS. Embedding was never nulled in the claim, so
-// no re-embed is required. Runs from nominateCoreCandidates (hourly cycle2).
-// Idempotent: 0 stale rows → fast no-op. Returns count recovered.
-export async function recoverStalePromotions(dataDir, options = {}) {
-  const signal = options?.signal
-  const db = _getDb(dataDir)
-  throwIfAborted(signal)
-  const cutoff = Date.now() - PROMOTING_STALE_MS
-  const r = await db.query(
-    `UPDATE entries SET core_candidate_status = 'candidate', core_candidate_at = $1, status = 'active'
-     WHERE is_root = 1 AND core_candidate_status = 'promoting'
-       AND core_candidate_at IS NOT NULL AND core_candidate_at < $2`,
-    [Date.now(), cutoff],
-  )
-  const n = Number(r.rowCount ?? r.affectedRows ?? 0)
-  if (n > 0) __mixdogMemoryLog(`[core-memory] recovered ${n} stale 'promoting' root(s) → candidate\n`)
-  return n
-}
 
-// Dismiss a candidate: mark terminal so the nomination pass never re-nominates
-// the same root. Leaves status/score untouched — the entry stays active in
-// generated memory, it just won't be re-surfaced as a core candidate.
-// `scope` enforces project isolation (mirrors promote): a scoped caller can
-// only dismiss candidates in its own pool or COMMON.
-export async function dismissCoreCandidate(dataDir, id, options = {}) {
-  const numId = Number(id)
-  if (!Number.isInteger(numId) || numId <= 0) throw new Error('integer id > 0 required')
-  const db = _getDb(dataDir)
-  const scope = options?.scope ?? null
-  const cur = (await db.query(
-    `SELECT project_id, core_candidate_status FROM entries WHERE id = $1 AND is_root = 1`,
-    [numId],
-  )).rows[0]
-  if (!cur) throw new Error(`no root entry with id=${numId}`)
-  const rowPid = cur.project_id ?? null
-  if (rowPid != null && rowPid !== scope) {
-    throw new Error(`candidate id=${numId} belongs to project "${rowPid}", not the resolved scope "${scope ?? 'common'}"`)
-  }
-  const r = await db.query(
-    `UPDATE entries SET core_candidate_status = 'dismissed', core_candidate_at = $1
-     WHERE id = $2 AND is_root = 1 AND core_candidate_status = 'candidate'
-     RETURNING id, element, category`,
-    [Date.now(), numId],
-  )
-  if (r.rows.length === 0) throw new Error(`no live core candidate with id=${numId}`)
-  return r.rows[0]
-}
+export { nominateCoreCandidates, listCoreCandidates, promoteCoreCandidate, recoverStalePromotions, dismissCoreCandidate } from './core-memory-candidates.mjs';

package/src/runtime/memory/lib/cycle-signatures.mjs

@@ -20,7 +20,7 @@ export function scheduledCycle2Signature(config) {
   })
 }
 
-export function scheduledCycle3ApplyMode(config) {
+function scheduledCycle3ApplyMode(config) {
   const raw = String(config?.cycle3?.applyMode || 'conservative').trim().toLowerCase()
   return (raw === 'proposal' || raw === 'dry-run' || raw === 'dryrun') ? 'proposal' : 'conservative'
 }

package/src/runtime/memory/lib/embedding-model-config.mjs

@@ -24,7 +24,7 @@ export function getConfiguredEmbeddingModelId() {
   return clean(process.env.MIXDOG_EMBED_MODEL) || DEFAULT_MODEL_ID
 }
 
-export function getEmbeddingModelProfile(modelId = getConfiguredEmbeddingModelId()) {
+function getEmbeddingModelProfile(modelId = getConfiguredEmbeddingModelId()) {
   return MODEL_PROFILES[clean(modelId)] || null
 }
 

package/src/runtime/memory/lib/embedding-provider.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 /**
  * embedding-provider.mjs — Embedding provider with worker_threads isolation.

package/src/runtime/memory/lib/embedding-worker.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 import { parentPort } from 'worker_threads'
 import { createRequire } from 'module'

package/src/runtime/memory/lib/ko-morph.mjs

@@ -27,7 +27,7 @@ import zlib from 'node:zlib'
 // 0.23.0: its base model ships CoNg (72MB, ~940MB RSS after build) vs
 // KnLM's 35MB download / ~560MB build peak, and recall stemming gains
 // nothing from the CoNg accuracy delta.
-export const KIWI_MODEL_VERSION = 'v0.21.0'
+const KIWI_MODEL_VERSION = 'v0.21.0'
 const KIWI_MODEL_ASSET = `kiwi_model_${KIWI_MODEL_VERSION}_base.tgz`
 const KIWI_MODEL_URL = `https://github.com/bab2min/Kiwi/releases/download/${KIWI_MODEL_VERSION}/${KIWI_MODEL_ASSET}`
 
@@ -52,7 +52,7 @@ let _initMs = 0
 
 export function isReady() { return _state === 'ready' && _kiwi != null }
 export function state() { return _state }
-export function initLatencyMs() { return _initMs }
+function initLatencyMs() { return _initMs }
 
 function modelDir(dataDir) {
   return path.join(dataDir, 'kiwi-model', KIWI_MODEL_VERSION)

package/src/runtime/memory/lib/memory-config-flags.mjs

@@ -16,8 +16,8 @@ export function readMainConfig() {
 // default true) — the same file the session runtime persists via
 // saveConfigAndAdopt. The memory daemon runs as a detached cross-process HTTP
 // worker, so it re-reads this section from disk each cycle tick (poll-on-use)
-// rather than relying on IPC. A legacy `agent.modules.memory === false` flag is
-// still honored as recap off (migration folds it on the session-runtime side).
+// rather than relying on IPC.
+
 export function readRecapEnabled() {
   try {
     let agent = readSection('agent')
@@ -28,9 +28,6 @@ export function readRecapEnabled() {
     if (agent?.agent && agent.agent.providers) agent = agent.agent
     const recap = agent?.recap
     if (recap && typeof recap === 'object' && recap.enabled === false) return false
-    const legacyMemory = agent?.modules?.memory
-    if (legacyMemory === false) return false
-    if (legacyMemory && typeof legacyMemory === 'object' && legacyMemory.enabled === false) return false
     return true
   } catch {
     return true

package/src/runtime/memory/lib/memory-cycle-requests.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 const VALID_CYCLES = new Set(['cycle1', 'cycle2', 'cycle3'])
 const KEY_PREFIX = 'cycle_request.'
@@ -54,7 +50,7 @@ function cycleScheduleKey(kind, signature = 'default') {
   return `cycle_schedule.${normalized}.${sig}`
 }
 
-export async function claimScheduledCycle(db, kind, intervalMs, signature = 'default', options = {}) {
+async function claimScheduledCycle(db, kind, intervalMs, signature = 'default', options = {}) {
   const key = cycleScheduleKey(kind, signature)
   const now = Number.isFinite(Number(options?.now)) ? Number(options.now) : Date.now()
   const spacingMsRaw = Number.isFinite(Number(options?.spacingMs)) ? Number(options.spacingMs) : Number(intervalMs)
@@ -230,7 +226,7 @@ export function resolveCoalesceMaxDrains(config, fallback = 1) {
   return Math.max(0, Math.min(10, Math.floor(value)))
 }
 
-export function resolveCoalesceRetryDelayMs(config, fallback = 1000) {
+function resolveCoalesceRetryDelayMs(config, fallback = 1000) {
   const direct = Number(config?.coalesce_retry_delay_ms)
   const nested = Number(config?.coalesce?.retry_delay_ms)
   const env = Number(process.env.MIXDOG_MEMORY_CYCLE_COALESCE_RETRY_MS)

package/src/runtime/memory/lib/memory-cycle1.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 import { cleanMemoryText } from './memory.mjs'
 import { resolveMaintenancePreset } from '../../shared/llm/index.mjs'
@@ -113,7 +109,7 @@ function selectRootId(members) {
   return rootId
 }
 
-export function buildEntriesText(entries) {
+function buildEntriesText(entries) {
   // @N is a 1-based prompt-local index; cycle1-agent answers with @N indexes.
   return entries.map((e, i) => {
     const content = cleanMemoryText(String(e.content ?? '')).slice(0, 400)
@@ -135,14 +131,14 @@ const DEFAULT_CYCLE1_RULES = [
   `First character of your response must be a digit. Use bare @N indexes without @ in output.`,
 ]
 
-export function buildCycle1ChunkPrompt(rows, customRules = null) {
+function buildCycle1ChunkPrompt(rows, customRules = null) {
   const rules = Array.isArray(customRules) && customRules.length > 0
     ? customRules
     : DEFAULT_CYCLE1_RULES
   return [...rules, '', buildEntriesText(rows)].join('\n')
 }
 
-export function parseCycle1LineFormat(raw) {
+function parseCycle1LineFormat(raw) {
   if (raw == null) return null
   const text = String(raw).trim()
   if (!text) return null

package/src/runtime/memory/lib/memory-cycle2-gate.mjs

@@ -85,7 +85,7 @@ function formatUserCoreForPrompt(rows, pidMap) {
 // Returns { actions, rejected } or null when no parseable lines.
 // True when some entry id K in 1..N is also the row-ordinal label for a different
 // entry (token K is ambiguous between id K and "row K").
-export function batchOrdinalIdCollides(statusById, ordinalToId, rowCount) {
+function batchOrdinalIdCollides(statusById, ordinalToId, rowCount) {
   const n = Math.max(0, Number(rowCount) || 0)
   for (let k = 1; k <= n; k++) {
     if (!statusById.has(k)) continue

package/src/runtime/memory/lib/memory-cycle2-mutations.mjs

@@ -45,7 +45,7 @@ const TRANSIENT_SNAPSHOT_RE = new RegExp(
 // task/issue block by category. Durable knowledge categories are trusted and
 // skip the content scan. Everything else (e.g. 'fact') is content-scanned so
 // snapshots mis-categorized as durable are still blocked.
-export function isTransientPromotion(row) {
+function isTransientPromotion(row) {
   if (!row) return false
   const cat = String(row.category ?? '').toLowerCase()
   if (TRANSIENT_PROMOTE_CATEGORIES.has(cat)) return true

package/src/runtime/memory/lib/memory-cycle2-shared.mjs

@@ -3,11 +3,8 @@
 // No cycle2 business logic; safe to import from any cycle2 sub-module.
 import { fileURLToPath } from 'url'
 
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr)
-export function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true
-  return __mixdogMemoryStderrWrite(...args)
-}
+import { __mixdogMemoryLog } from './memory-log.mjs'
+export { __mixdogMemoryLog }
 
 export function throwIfAborted(signal) {
   if (signal?.aborted) throw signal.reason ?? new Error('aborted')

package/src/runtime/memory/lib/memory-cycle3.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 // Cycle 3 — user-curated core memory review.
 //

package/src/runtime/memory/lib/memory-embed.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 import { embedTexts, getEmbeddingModelId } from './embedding-provider.mjs'
 import { embeddingToSql } from './memory.mjs'
@@ -116,7 +112,7 @@ const RAW_EMBED_EXCLUDE_NON_CONVERSATION_CONTENT_RES = [
 ]
 const RAW_EMBED_CONVERSATION_ROLES = new Set(['user', 'assistant'])
 
-export function isRawEmbeddable(role, content) {
+function isRawEmbeddable(role, content) {
   const normRole = String(role ?? '').trim().toLowerCase()
   if (RAW_EMBED_EXCLUDE_ROLES.has(normRole)) return false
   const text = typeof content === 'string' ? content : ''

package/src/runtime/memory/lib/memory-log.mjs

@@ -0,0 +1,8 @@
+// Shared memory-daemon stderr logger. The write is captured at import time so
+// memory output stays visible even when a TUI log guard swaps
+// process.stderr.write later; MIXDOG_QUIET_MEMORY_LOG mutes it entirely.
+const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
+export function __mixdogMemoryLog(...args) {
+  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
+  return __mixdogMemoryStderrWrite(...args);
+}

package/src/runtime/memory/lib/memory-ops-policy.mjs

@@ -1,8 +1,4 @@
-const __mixdogMemoryStderrWrite = process.stderr.write.bind(process.stderr);
-function __mixdogMemoryLog(...args) {
-  if (process.env.MIXDOG_QUIET_MEMORY_LOG) return true;
-  return __mixdogMemoryStderrWrite(...args);
-}
+import { __mixdogMemoryLog } from './memory-log.mjs';
 
 import fs from 'node:fs'
 import path from 'node:path'
@@ -24,7 +20,7 @@ function normalizeBackfillScope(value) {
   return 'all'
 }
 
-export function resolveBackfillSinceMs(windowValue, now = Date.now()) {
+function resolveBackfillSinceMs(windowValue, now = Date.now()) {
   const normalized = normalizeBackfillWindow(windowValue)
   if (normalized === '1d') return now - (1 * 24 * 60 * 60 * 1000)
   if (normalized === '3d') return now - (3 * 24 * 60 * 60 * 1000)
@@ -33,7 +29,7 @@ export function resolveBackfillSinceMs(windowValue, now = Date.now()) {
   return null
 }
 
-export async function countUnclassified(db) {
+async function countUnclassified(db) {
   if (!db) return 0
   try {
     const row = (await db.query(`SELECT COUNT(*) c FROM entries WHERE chunk_root IS NULL`, [])).rows[0]
@@ -43,7 +39,7 @@ export async function countUnclassified(db) {
   }
 }
 
-export function selectBackfillTranscripts({ sinceMs = null, limit = null, projectsRoot = null } = {}) {
+function selectBackfillTranscripts({ sinceMs = null, limit = null, projectsRoot = null } = {}) {
   const root = projectsRoot || path.join(mixdogHome(), 'projects')
   if (!fs.existsSync(root)) return []
   const files = []