forge-workflow 0.0.9 → 0.1.0-beta.2

package/lib/kernel/sqlite-driver.js

@@ -0,0 +1,2504 @@
+'use strict';
+
+const fs = require('node:fs');
+const os = require('node:os');
+const path = require('node:path');
+const { randomUUID } = require('node:crypto');
+
+const {
+	ISSUE_COMMAND_SCHEMA_VERSION,
+	ISSUE_COMMAND_EXIT_CODES,
+	formatIssueCommandError,
+	normalizePriority,
+	resolveNextCommands,
+} = require('./issue-command-contract');
+const { buildReadinessIndex } = require('./readiness-model');
+const { buildMemoryProjectionMigration, memoryFtsDdl } = require('./migrations');
+const { rankForPriorityLabel } = require('./taxonomy-validator');
+const { isLeaseExpired } = require('./lease-enforcer');
+const { CONFLICT_SIGNAL, classifyConflictSignal } = require('./conflict-signal');
+
+const BUILTIN_SQLITE_RUNTIME_ORDER = Object.freeze(['bun:sqlite', 'node:sqlite']);
+let probeCounter = 0;
+
+function isModuleUnavailable(error) {
+	return error && (
+		error.code === 'MODULE_NOT_FOUND'
+		|| error.code === 'ERR_UNKNOWN_BUILTIN_MODULE'
+		|| /Cannot find module|No such built-in module/i.test(String(error.message || error))
+	);
+}
+
+function loadRuntimeDescriptor(id, sqliteModule) {
+	if (id === 'bun:sqlite') {
+		if (typeof sqliteModule.Database !== 'function') {
+			throw new Error('bun:sqlite is present but does not expose Database');
+		}
+		return {
+			id,
+			module: sqliteModule,
+			databaseClassName: 'Database',
+			nativeCompileDependency: false,
+			experimental: false,
+		};
+	}
+
+	if (id === 'node:sqlite') {
+		if (typeof sqliteModule.DatabaseSync !== 'function') {
+			throw new Error('node:sqlite is present but does not expose DatabaseSync');
+		}
+		const hasBackupApi = typeof sqliteModule.backup === 'function'
+			|| typeof sqliteModule.DatabaseSync.prototype.backup === 'function';
+		if (!hasBackupApi) {
+			throw new Error('node:sqlite is present but does not expose backup support; run with Node >= 22.16 or Bun >= 1.2');
+		}
+		return {
+			id,
+			module: sqliteModule,
+			databaseClassName: 'DatabaseSync',
+			nativeCompileDependency: false,
+			experimental: true,
+		};
+	}
+
+	throw new Error(`Unsupported builtin SQLite runtime: ${id}`);
+}
+
+// Requiring `node:sqlite` emits a one-time Node ExperimentalWarning via
+// process.emitWarning AT REQUIRE TIME (before any CLI flag context exists), which
+// would prepend noise to the CLI's human/JSON output. Suppress ONLY that SQLite
+// warning around the require and restore process.emitWarning immediately after — every
+// other warning passes through untouched. This never re-execs with --no-warnings.
+function requireSqliteRuntimeModule(requireModule, id) {
+	if (id !== 'node:sqlite') {
+		return requireModule(id);
+	}
+	const originalEmitWarning = process.emitWarning;
+	process.emitWarning = function suppressSqliteExperimentalWarning(warning, ...rest) {
+		const message = typeof warning === 'string' ? warning : (warning && warning.message) || '';
+		if (/SQLite/i.test(String(message))) {
+			return undefined;
+		}
+		return originalEmitWarning.call(process, warning, ...rest);
+	};
+	try {
+		return requireModule(id);
+	} finally {
+		process.emitWarning = originalEmitWarning;
+	}
+}
+
+function selectBuiltinSQLiteRuntime(deps = {}) {
+	const requireModule = deps.requireModule || require;
+	const unavailable = [];
+
+	for (const id of BUILTIN_SQLITE_RUNTIME_ORDER) {
+		try {
+			return loadRuntimeDescriptor(id, requireSqliteRuntimeModule(requireModule, id));
+		} catch (error) {
+			if (!isModuleUnavailable(error)) {
+				throw error;
+			}
+			unavailable.push(`${id}: ${error.message || error}`);
+		}
+	}
+
+	throw new Error([
+		'Forge Kernel requires a builtin SQLite runtime: bun:sqlite or node:sqlite.',
+		'Install/run Forge with Bun >= 1.2 or Node >= 22.16 with node:sqlite backup support.',
+		'No native-compile SQLite package is installed by default.',
+		`Detection failures: ${unavailable.join('; ')}`,
+	].join(' '));
+}
+
+function ensureFileBackedDatabaseDirectory(databasePath) {
+	if (!databasePath || databasePath === ':memory:' || String(databasePath).startsWith('file:')) {
+		return;
+	}
+	const databaseDir = path.dirname(databasePath);
+	if (databaseDir && databaseDir !== '.') {
+		fs.mkdirSync(databaseDir, { recursive: true });
+	}
+}
+
+function createDatabase(runtime, databasePath) {
+	ensureFileBackedDatabaseDirectory(databasePath);
+	if (runtime.id === 'bun:sqlite') {
+		return new runtime.module.Database(databasePath, { create: true });
+	}
+	if (runtime.id === 'node:sqlite') {
+		return new runtime.module.DatabaseSync(databasePath);
+	}
+	throw new Error(`Unsupported builtin SQLite runtime: ${runtime.id}`);
+}
+
+function execSql(_runtime, db, sql) {
+	db.exec(sql);
+}
+
+function queryAll(runtime, db, sql) {
+	if (runtime.id === 'bun:sqlite') {
+		return db.query(sql).all();
+	}
+	return db.prepare(sql).all();
+}
+
+function queryOne(runtime, db, sql) {
+	return queryAll(runtime, db, sql)[0] || {};
+}
+
+// Parameterized statement helpers — bun:sqlite and node:sqlite both bind positional
+// `?` params, but expose them through different APIs. All issue-layer SQL MUST use these
+// (never string interpolation of values) to stay injection-safe.
+function allParams(runtime, db, sql, params = []) {
+	if (runtime.id === 'bun:sqlite') {
+		return db.query(sql).all(...params);
+	}
+	return db.prepare(sql).all(...params);
+}
+
+// Parameterized write helper (INSERT/UPDATE/DELETE). Like allParams, both runtimes
+// bind positional `?` params but expose .run() through different statement APIs. All
+// mutating issue-layer SQL MUST use this (never interpolate values) to stay
+// injection-safe. Native UNIQUE-constraint errors are intentionally allowed to
+// propagate unmodified — the broker parses their raw message to convert an
+// idempotency/lease collision into a duplicate replay.
+function runParams(runtime, db, sql, params = []) {
+	if (runtime.id === 'bun:sqlite') {
+		return db.query(sql).run(...params);
+	}
+	return db.prepare(sql).run(...params);
+}
+
+// A table may not exist on a partially-migrated DB; readiness inputs degrade to empty.
+// ONLY a missing-table error is tolerated — a locked/corrupt DB or a real SQL
+// regression must surface, not silently produce wrong readiness/stats/projection.
+function safeAll(runtime, db, sql, params = []) {
+	try {
+		return allParams(runtime, db, sql, params);
+	} catch (error) {
+		if (/no such table/i.test(String(error?.message || ''))) {
+			return [];
+		}
+		throw error;
+	}
+}
+
+// Labels are stored as a JSON-array TEXT column (canonical, written by KAP-4) but a
+// legacy comma-separated value is tolerated. Always returns a string[] — [] when the
+// column is null/empty/unparseable — so the projection never surfaces a raw blob.
+function parseLabels(raw) {
+	if (raw == null || raw === '') return [];
+	if (Array.isArray(raw)) return raw.map(String);
+	if (typeof raw !== 'string') return [];
+	const trimmed = raw.trim();
+	if (!trimmed) return [];
+	if (trimmed.startsWith('[')) {
+		try {
+			const parsed = JSON.parse(trimmed);
+			return Array.isArray(parsed) ? parsed.map(String) : [];
+		} catch {
+			return [];
+		}
+	}
+	return trimmed.split(',').map(value => value.trim()).filter(Boolean);
+}
+
+function rowToIssueSummary(row, readinessEntry, claimedBy = null, dependencyIds = [], dependentIds = []) {
+	return {
+		id: row.id,
+		title: row.title,
+		body: row.body ?? null,
+		type: row.type,
+		status: row.status,
+		// priority is the stored label (notNull default 'P2'); rank is the numeric sort key.
+		priority: row.priority,
+		rank: Number(row.priority_rank) || 0,
+		revision: Number(row.entity_revision) || 0,
+		blocked: readinessEntry ? Boolean(readinessEntry.blocked) : false,
+		// kernel_issues has no claimed_by column; the active lease in kernel_claims is
+		// the authority. Derive the holder from the issue's active claim (the
+		// partial-UNIQUE index guarantees at most one), defaulting to null when free.
+		claimed_by: claimedBy ?? row.claimed_by ?? null,
+		// KAP-2: parent/labels/dependencies/created_at are all stored; surface them so
+		// agents get the full issue shape without a second query. dependencies are the
+		// ids this issue depends on (blocks_issue_id where issue_id === this row).
+		parent_id: row.parent_id ?? null,
+		labels: parseLabels(row.labels),
+		dependencies: Array.isArray(dependencyIds) ? dependencyIds : [],
+		// Epic/reverse-dependency exposure: `dependents` are the ids that depend on this
+		// issue (the inverse of `dependencies` — issue_id where blocks_issue_id === this
+		// row), and `blocked_by` is the readiness model's LIVE blocker subset (dependencies
+		// still open; done/cancelled blockers dropped). Both are a strict additive superset
+		// surfaced on every read op so consumers never run a second reverse-scan query.
+		dependents: Array.isArray(dependentIds) ? dependentIds : [],
+		blocked_by: readinessEntry ? (readinessEntry.blocked_by ?? []) : [],
+		created_at: row.created_at,
+		updated_at: row.updated_at,
+		// KAP-10 (acceptance_criteria/design/notes) + KAP-11 (assignee): authored
+		// content fields and the persistent assignee, each null when unset. assignee is
+		// distinct from claimed_by (the transient lease holder) — both coexist.
+		acceptance_criteria: row.acceptance_criteria ?? null,
+		design: row.design ?? null,
+		notes: row.notes ?? null,
+		assignee: row.assignee ?? null,
+		// Beads full-fidelity import: author, close timestamp, raw close reason and the
+		// verbatim metadata JSON blob, each null when the column is unset.
+		created_by: row.created_by ?? null,
+		closed_at: row.closed_at ?? null,
+		close_reason: row.close_reason ?? null,
+		metadata: row.metadata ?? null,
+	};
+}
+
+function okIssueResponse(command, data, nextCommands) {
+	return {
+		ok: true,
+		schema_version: ISSUE_COMMAND_SCHEMA_VERSION,
+		command,
+		data,
+		// Default the read-op next_commands from the contract catalog (KAP-1's envelope
+		// is worthless to agents if it carries an empty array). An explicit array still
+		// wins; otherwise resolve + substitute the concrete id for single-issue responses.
+		next_commands: Array.isArray(nextCommands) ? nextCommands : resolveNextCommands(command, data),
+	};
+}
+
+// Derive the whole-board readiness read model (D18) from the authority tables.
+function loadBoardReadiness(runtime, db, context = {}) {
+	const issues = allParams(runtime, db, 'SELECT * FROM kernel_issues');
+	const dependencies = safeAll(runtime, db, 'SELECT * FROM kernel_dependencies');
+	const conflicts = safeAll(runtime, db, 'SELECT * FROM kernel_conflicts');
+	const claims = safeAll(runtime, db, 'SELECT * FROM kernel_claims');
+	const index = buildReadinessIndex({
+		issues,
+		dependencies,
+		conflicts,
+		claims,
+		now: context.now,
+		actor: context.actor,
+	});
+	// Surface the active lease holder per issue for issue summaries. Filter on state
+	// only (matches loadActiveKernelClaimRow); the partial-UNIQUE active-lease index
+	// guarantees at most one active row per issue, so the map is unambiguous.
+	// Null-prototype map: issue ids are unconstrained external strings, so a literal `{}`
+	// keyed by them would be a prototype-pollution vector (matches buildReadinessIndex).
+	const claimedById = Object.create(null);
+	for (const claim of claims) {
+		if ((claim.state || 'active') === 'active' && claim.issue_id) {
+			claimedById[claim.issue_id] = claim.actor ?? null;
+		}
+	}
+	// Per-issue declared dependency edges (the ids each issue depends on, i.e.
+	// blocks_issue_id where issue_id === the dependent). Distinct from readiness'
+	// blocked_by, which drops done/cancelled blockers — this is the full declared set.
+	// Null-prototype map: issue ids are unconstrained external strings.
+	const dependenciesById = Object.create(null);
+	// Per-issue reverse edges (the ids that depend ON each issue, i.e. issue_id where
+	// blocks_issue_id === the blocker). This is the inverse of dependenciesById and the
+	// same query computeNewlyUnblocked runs on the close path, lifted to the board load
+	// so every read op can surface `dependents` without a second reverse scan.
+	// Null-prototype map: issue ids are unconstrained external strings.
+	const dependentsById = Object.create(null);
+	for (const dependency of dependencies) {
+		if (!dependency.issue_id || dependency.blocks_issue_id == null) continue;
+		const list = dependenciesById[dependency.issue_id]
+			|| (dependenciesById[dependency.issue_id] = []);
+		list.push(dependency.blocks_issue_id);
+		const dependents = dependentsById[dependency.blocks_issue_id]
+			|| (dependentsById[dependency.blocks_issue_id] = []);
+		dependents.push(dependency.issue_id);
+	}
+	for (const issueId of Object.keys(dependenciesById)) {
+		dependenciesById[issueId] = [...new Set(dependenciesById[issueId])]
+			.sort((a, b) => String(a).localeCompare(String(b)));
+	}
+	for (const issueId of Object.keys(dependentsById)) {
+		dependentsById[issueId] = [...new Set(dependentsById[issueId])]
+			.sort((a, b) => String(a).localeCompare(String(b)));
+	}
+	return { issues, index, claimedById, dependenciesById, dependentsById };
+}
+
+function firstPositional(args = []) {
+	return (args || []).find(value => typeof value === 'string' && !value.startsWith('-'));
+}
+
+// KAP-6: parse the `list` op's --status / --type / --label flags from the arg array.
+// Accepts both `--flag value` (value is the next array element) and `--flag=value`
+// (value follows the `=`). A key is only set when a value is actually present, so an
+// absent flag leaves it undefined and does not constrain that dimension. Unknown flags
+// are ignored. Values are never interpolated into SQL — filtering runs JS-side over the
+// already-built issue summaries (status/type/labels[]).
+const LIST_FILTER_FLAGS = Object.freeze(['status', 'type', 'label', 'priority']);
+
+function parseListFilters(args = []) {
+	const filters = Object.create(null);
+	const list = args || [];
+	for (let i = 0; i < list.length; i += 1) {
+		const arg = list[i];
+		if (typeof arg !== 'string' || !arg.startsWith('--')) continue;
+		const eq = arg.indexOf('=');
+		const name = (eq === -1 ? arg.slice(2) : arg.slice(2, eq));
+		if (!LIST_FILTER_FLAGS.includes(name)) continue;
+		if (eq !== -1) {
+			// `--status=` (empty value) is treated as MISSING, not an empty-string filter
+			// that would match nothing — matches the documented "only set when present".
+			const value = arg.slice(eq + 1);
+			if (value !== '') {
+				filters[name] = value;
+			}
+			continue;
+		}
+		const next = list[i + 1];
+		if (typeof next === 'string' && !next.startsWith('-')) {
+			filters[name] = next;
+			i += 1;
+		}
+	}
+	return filters;
+}
+
+// KAP-7: parse the `stale` op's --days threshold (both `--days <n>` and `--days=<n>`
+// forms). Returns the integer day window. A missing flag, or a NaN / non-positive
+// value, falls back to STALE_DEFAULT_DAYS — a zero/negative window would make every
+// open issue "stale", which is never the intended query. Mirrors parseListFilters'
+// flag-scan; the value is never interpolated into SQL (the threshold compares JS-side).
+const STALE_DEFAULT_DAYS = 14;
+
+function parseStaleDays(args = []) {
+	const list = args || [];
+	for (let i = 0; i < list.length; i += 1) {
+		const arg = list[i];
+		if (typeof arg !== 'string') continue;
+		let raw;
+		if (arg === '--days') {
+			raw = list[i + 1];
+		} else if (arg.startsWith('--days=')) {
+			raw = arg.slice('--days='.length);
+		} else {
+			continue;
+		}
+		const parsed = Number(raw);
+		if (Number.isFinite(parsed) && parsed > 0) {
+			return Math.floor(parsed);
+		}
+		return STALE_DEFAULT_DAYS;
+	}
+	return STALE_DEFAULT_DAYS;
+}
+
+// KAP-7: shared list-style sort for derived read queries (rank asc, then id) — the
+// exact ordering `list`/the contract tests expect, so blocked/stale/orphans are
+// deterministic.
+function sortIssueSummaries(summaries) {
+	return summaries.sort((a, b) => (a.rank - b.rank) || String(a.id).localeCompare(String(b.id)));
+}
+
+// Epic rollup over a list of child issue summaries. The kernel owns the status
+// vocabulary (open|in_progress|review|done|cancelled), so emitting the rollup means
+// consumers never hard-code status names (notably the beads `closed` the shells used
+// to count). Locked maintainer decisions: percentage is done-ONLY (cancelled does NOT
+// count toward complete) and `total` is the direct-children count. `blocked` counts
+// children whose readiness model flips blocked. `by_status` is the full per-status
+// histogram; an unknown status (taxonomy-validator forbids it) is counted in `total`
+// but not bucketed.
+const ROLLUP_STATUSES = Object.freeze(['open', 'in_progress', 'review', 'done', 'cancelled', 'backlog']);
+
+function buildRollup(children) {
+	const byStatus = Object.create(null);
+	for (const status of ROLLUP_STATUSES) {
+		byStatus[status] = 0;
+	}
+	let blocked = 0;
+	for (const child of children) {
+		if (Object.prototype.hasOwnProperty.call(byStatus, child.status)) {
+			byStatus[child.status] += 1;
+		}
+		if (child.blocked) blocked += 1;
+	}
+	const total = children.length;
+	const done = byStatus.done;
+	const percentage = total === 0 ? 0 : Math.round((done / total) * 100);
+	return {
+		total,
+		done,
+		in_progress: byStatus.in_progress,
+		open: byStatus.open,
+		review: byStatus.review,
+		cancelled: byStatus.cancelled,
+		backlog: byStatus.backlog,
+		blocked,
+		percentage,
+		by_status: { ...byStatus },
+	};
+}
+
+// Read-side of driver.issueOperation: ready/list/show/search/stats as parameterized
+// SELECTs returning issue-command-contract shapes. Mutations are handled separately
+// through the broker's guarded-event path (later wave).
+function runIssueReadOperation(runtime, db, operation, args, context) {
+	if (operation === 'list') {
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		// KAP-6: server-side --status/--type/--label filtering. Filter the summaries (they
+		// already carry status/type/parsed labels[]) so the readiness load stays shared and
+		// untouched. status/type are exact-match; --label keeps issues whose labels[] include
+		// the value. Multiple filters AND; an absent filter does not constrain that dimension;
+		// an unknown value simply matches nothing (exact-match → empty result, no special case).
+		const filters = parseListFilters(args);
+		// Normalize the --priority filter ONCE to its canonical label; each candidate's
+		// stored priority is normalized too before the exact-match compare. Legacy rows
+		// store a mixed bare-int / P-label form, so '1' and 'P1' rows both match
+		// --priority=1 AND --priority=P1 (the filter arg and the stored value canonicalize
+		// to the same label). An unknown value normalizes to itself and matches nothing.
+		const priorityFilter = filters.priority === undefined ? undefined : normalizePriority(filters.priority);
+		const summaries = issues
+			.map(row => rowToIssueSummary(row, index.readinessById[row.id], claimedById[row.id], dependenciesById[row.id], dependentsById[row.id]))
+			.filter(summary => (filters.status === undefined || summary.status === filters.status)
+				&& (filters.type === undefined || summary.type === filters.type)
+				&& (filters.label === undefined || summary.labels.includes(filters.label))
+				&& (priorityFilter === undefined || normalizePriority(summary.priority) === priorityFilter))
+			.sort((a, b) => (a.rank - b.rank) || String(a.id).localeCompare(String(b.id)));
+		return okIssueResponse('issue.list', { issues: summaries, count: summaries.length });
+	}
+	if (operation === 'ready') {
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		const byId = new Map(issues.map(row => [row.id, row]));
+		const summaries = index.readyQueue.map(id => rowToIssueSummary(byId.get(id), index.readinessById[id], claimedById[id], dependenciesById[id], dependentsById[id]));
+		return okIssueResponse('issue.ready', { issues: summaries, count: summaries.length });
+	}
+	if (operation === 'show') {
+		const id = firstPositional(args);
+		const rows = allParams(runtime, db, 'SELECT * FROM kernel_issues WHERE id = ?', [id]);
+		if (!rows[0]) {
+			return formatIssueCommandError({
+				command: 'issue.show',
+				code: 'FORGE_ISSUE_NOT_FOUND',
+				message: `Issue ${id ?? '<missing id>'} not found`,
+				exitCode: ISSUE_COMMAND_EXIT_CODES.notFound,
+			});
+		}
+		const { index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		// KAP-3: `show` (and only `show`) attaches the issue's comments, ordered oldest
+		// first. Map to the contract's { id, body, actor, created_at } shape — never the
+		// raw row — so the projection stays stable.
+		const commentRows = allParams(
+			runtime, db,
+			'SELECT * FROM kernel_comments WHERE issue_id = ? ORDER BY created_at ASC, id ASC',
+			[id],
+		);
+		const comments = commentRows.map(comment => ({
+			id: comment.id,
+			body: comment.body ?? null,
+			actor: comment.actor,
+			created_at: comment.created_at,
+		}));
+		// f61601ab: surface the REAL workflow phase from kernel_stage_runs (latest
+		// active, else latest completed) so consumers read the phase instead of
+		// guessing from status+claim. Null when no stage runs exist.
+		const currentStageRow = loadCurrentStageRunRow(runtime, db, id);
+		return okIssueResponse('issue.show', {
+			...rowToIssueSummary(rows[0], index.readinessById[id], claimedById[id], dependenciesById[id], dependentsById[id]),
+			current_stage: currentStageRow ? currentStageRow.stage : null,
+			current_stage_status: currentStageRow ? currentStageRow.status : null,
+			comments,
+		});
+	}
+	if (operation === 'owns') {
+		// Lease-ownership verification (kernel d71a824b). A claim returning ok:true does
+		// not prove the caller won the lease: a duplicate replay also returns ok:true, so
+		// a worker must CONFIRM it holds the live lease before mutating a claimed issue.
+		// `owned` is true iff the resolving actor holds the SINGLE active claim AND that
+		// lease has not expired. read summaries derive `claimed_by` from state='active'
+		// only (never expiry — see loadActiveKernelClaimRow), so owns re-applies the
+		// expiry check here: an expired-but-not-yet-reclaimed lease is NOT ownership
+		// (planClaimAcquisition would supersede it). Actor resolution mirrors the mutation
+		// path's `context.actor || 'forge'` default so a bare CLI invocation matches its
+		// own claims; `now` falls back to the wall clock like the mutation route.
+		const id = firstPositional(args);
+		const rows = allParams(runtime, db, 'SELECT * FROM kernel_issues WHERE id = ?', [id]);
+		if (!rows[0]) {
+			return formatIssueCommandError({
+				command: 'issue.owns',
+				code: 'FORGE_ISSUE_NOT_FOUND',
+				message: `Issue ${id ?? '<missing id>'} not found`,
+				exitCode: ISSUE_COMMAND_EXIT_CODES.notFound,
+			});
+		}
+		const now = context.now || new Date().toISOString();
+		const actor = context.actor || 'forge';
+		const claim = loadActiveKernelClaimRow(runtime, db, id);
+		const claimedBy = claim ? (claim.actor ?? null) : null;
+		const expired = claim ? isLeaseExpired(claim, now) : false;
+		// Ownership is per-SESSION, not just per-actor (kernel d71a824b): two agents
+		// sharing one human actor but running as DIFFERENT sessions must not both read
+		// OWNED for a lease only one of them holds. When BOTH the caller and the live
+		// lease carry a session-id they must match; if either side is session-less (a
+		// no-env caller, or a pre-session claim) we fall back to actor-only ownership so
+		// historical behavior is preserved byte-for-byte. An empty/whitespace-only
+		// session-id counts as session-LESS on BOTH sides — the SAME trim-truthy test the
+		// claim-key write uses (buildClaimMutationEvent in lib/kernel/broker.js) — so ''
+		// can never count as "present" here and "absent" there.
+		const normalizeSession = value => (typeof value === 'string' && value.trim() !== '' ? value : null);
+		const contextSession = normalizeSession(context.sessionId);
+		const claimSession = claim ? normalizeSession(claim.session_id) : null;
+		const sessionMismatch = contextSession !== null
+			&& claimSession !== null
+			&& contextSession !== claimSession;
+		const owned = Boolean(claim) && !expired && claimedBy === actor && !sessionMismatch;
+		return okIssueResponse('issue.owns', {
+			id,
+			actor,
+			claimed_by: claimedBy,
+			owned,
+			expired,
+			expires_at: claim ? (claim.expires_at ?? null) : null,
+		});
+	}
+	if (operation === 'search') {
+		const term = `%${firstPositional(args) || ''}%`;
+		const rows = allParams(
+			runtime, db,
+			'SELECT * FROM kernel_issues WHERE title LIKE ? OR body LIKE ? ORDER BY priority_rank ASC, id ASC',
+			[term, term],
+		);
+		const { index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		const summaries = rows.map(row => rowToIssueSummary(row, index.readinessById[row.id], claimedById[row.id], dependenciesById[row.id], dependentsById[row.id]));
+		return okIssueResponse('issue.search', { issues: summaries, count: summaries.length });
+	}
+	if (operation === 'stats') {
+		const { index } = loadBoardReadiness(runtime, db, context);
+		const statusRows = allParams(runtime, db, 'SELECT status, COUNT(*) AS n FROM kernel_issues GROUP BY status');
+		const counts = {};
+		for (const row of statusRows) {
+			counts[row.status] = Number(row.n);
+		}
+		const activeClaims = Number(
+			safeAll(runtime, db, "SELECT COUNT(*) AS n FROM kernel_claims WHERE state = 'active'")[0]?.n || 0,
+		);
+		return okIssueResponse('issue.stats', {
+			counts,
+			ready_count: index.readyQueue.length,
+			blocked_count: index.blocked.length,
+			active_claims: activeClaims,
+		});
+	}
+	// KAP-7: derived read query — every issue whose readiness is blocked
+	// (index.readinessById[id].blocked === true; dependency/conflict/quarantine).
+	// Summaries are sorted like `list` for deterministic output.
+	if (operation === 'blocked') {
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		const summaries = sortIssueSummaries(
+			issues
+				.filter(row => Boolean(index.readinessById[row.id]?.blocked))
+				.map(row => rowToIssueSummary(row, index.readinessById[row.id], claimedById[row.id], dependenciesById[row.id], dependentsById[row.id])),
+		);
+		return okIssueResponse('issue.blocked', { issues: summaries, count: summaries.length });
+	}
+	// KAP-7: derived read query — open/in_progress issues whose updated_at is
+	// STRICTLY older than (now - threshold_days). Default 14 days; --days <n> /
+	// --days=<n> overrides (NaN/<=0 → default). "now" is context.now when the broker
+	// supplies a deterministic clock, else the wall clock. review/done/cancelled are
+	// excluded — only actively-open work can go stale. The cutoff compares the stored
+	// ISO updated_at lexicographically, which is correct for UTC `Z` ISO-8601 strings.
+	if (operation === 'stale') {
+		const thresholdDays = parseStaleDays(args);
+		// Guard a malformed context.now: Date.parse → NaN would make new Date(NaN)
+		// throw "Invalid time value" on toISOString(); fall back to the wall clock.
+		const parsedNow = typeof context?.now === 'string' ? Date.parse(context.now) : NaN;
+		const nowMs = Number.isFinite(parsedNow) ? parsedNow : Date.now();
+		const cutoffIso = new Date(nowMs - thresholdDays * 24 * 60 * 60 * 1000).toISOString();
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		// Only actively-open work can go stale. backlog (parked ideas) is deliberately
+		// excluded alongside review/done/cancelled — parked work is never stale.
+		const STALE_STATUSES = new Set(['open', 'in_progress']);
+		const summaries = sortIssueSummaries(
+			issues
+				.filter(row => STALE_STATUSES.has(row.status) && String(row.updated_at) < cutoffIso)
+				.map(row => rowToIssueSummary(row, index.readinessById[row.id], claimedById[row.id], dependenciesById[row.id], dependentsById[row.id])),
+		);
+		return okIssueResponse('issue.stale', { issues: summaries, count: summaries.length, threshold_days: thresholdDays });
+	}
+	// KAP-7: derived read query — issues touched by a DANGLING dependency edge. An
+	// orphan edge is a kernel_dependencies row whose issue_id OR blocks_issue_id
+	// names an id absent from kernel_issues (normally prevented by the FK, but
+	// detectable if FK enforcement was ever bypassed or data was migrated in). The
+	// EXISTING endpoint(s) of each dangling edge are the affected issues; both
+	// endpoints missing contributes nothing. Results are deduped and sorted like list.
+	if (operation === 'orphans') {
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		const byId = new Map(issues.map(row => [row.id, row]));
+		const dependencies = safeAll(runtime, db, 'SELECT * FROM kernel_dependencies');
+		const orphanIds = new Set();
+		for (const edge of dependencies) {
+			const issueExists = byId.has(edge.issue_id);
+			const blocksExists = byId.has(edge.blocks_issue_id);
+			if (issueExists && blocksExists) continue; // clean edge
+			// One endpoint dangles: the existing endpoint(s) are the affected issues.
+			if (issueExists) orphanIds.add(edge.issue_id);
+			if (blocksExists) orphanIds.add(edge.blocks_issue_id);
+		}
+		const summaries = sortIssueSummaries(
+			[...orphanIds].map(id => rowToIssueSummary(byId.get(id), index.readinessById[id], claimedById[id], dependenciesById[id], dependentsById[id])),
+		);
+		return okIssueResponse('issue.orphans', { issues: summaries, count: summaries.length });
+	}
+	// KAP-12: read-only content lint — issues that FAIL required-content validation.
+	// An issue FAILS iff its type is task|bug AND acceptance_criteria is null or
+	// empty/whitespace-only. epic/decision are EXEMPT (no acceptance_criteria
+	// requirement). Each failing issue carries its standard summary PLUS a
+	// `validation: { rules_failed: ['missing_acceptance_criteria'] }`. The predicate
+	// references ONLY base-existing columns (type/acceptance_criteria); both arrive on
+	// the loadBoardReadiness rows via `SELECT *`. Results sort like list (rank asc).
+	if (operation === 'lint') {
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		const LINTED_TYPES = new Set(['task', 'bug']);
+		const summaries = sortIssueSummaries(
+			issues
+				.filter(row => LINTED_TYPES.has(row.type) && String(row.acceptance_criteria ?? '').trim() === '')
+				.map(row => ({
+					...rowToIssueSummary(row, index.readinessById[row.id], claimedById[row.id], dependenciesById[row.id], dependentsById[row.id]),
+					validation: { rules_failed: ['missing_acceptance_criteria'] },
+				})),
+		);
+		return okIssueResponse('issue.lint', { issues: summaries, count: summaries.length });
+	}
+	// Epic support: DIRECT children of <epic> (one level — `WHERE parent_id = ?`, the
+	// membership model is the first-class parent_id field, NOT dependency edges) plus a
+	// kernel-computed rollup. The target is accepted as ANY existing id (not gated on
+	// type === 'epic' — parent_id is generic); a missing id returns FORGE_ISSUE_NOT_FOUND
+	// (mirrors `show`, and epic.sh already has a not-found path). Children carry the full
+	// summary (assignee/status/blocked_by/dependents), so consumers build their
+	// per-developer + blocked views off this single query.
+	if (operation === 'children') {
+		const epicId = firstPositional(args);
+		const epicRows = allParams(runtime, db, 'SELECT * FROM kernel_issues WHERE id = ?', [epicId]);
+		if (!epicRows[0]) {
+			return formatIssueCommandError({
+				command: 'issue.children',
+				code: 'FORGE_ISSUE_NOT_FOUND',
+				message: `Issue ${epicId ?? '<missing id>'} not found`,
+				exitCode: ISSUE_COMMAND_EXIT_CODES.notFound,
+			});
+		}
+		const epicRow = epicRows[0];
+		const { issues, index, claimedById, dependenciesById, dependentsById } = loadBoardReadiness(runtime, db, context);
+		const children = sortIssueSummaries(
+			issues
+				.filter(row => row.parent_id === epicId)
+				.map(row => rowToIssueSummary(row, index.readinessById[row.id], claimedById[row.id], dependenciesById[row.id], dependentsById[row.id])),
+		);
+		return okIssueResponse('issue.children', {
+			epic: { id: epicRow.id, title: epicRow.title, type: epicRow.type, status: epicRow.status },
+			children,
+			rollup: buildRollup(children),
+			count: children.length,
+		});
+	}
+	// Issue 7dc229d4: active lease/claims read for the dashboard live layer. The
+	// kernel_claims lease row carries the full who/what/where set (actor,
+	// session_id, worktree_id, expires_at, issue_id) — the CLI previously exposed
+	// only `claimed_by` (the actor). A lease is LIVE iff state='active' AND it has
+	// NOT expired at the read `now` (isLeaseExpired; a null expires_at never
+	// expires). An expired-but-not-yet-reclaimed lease is deliberately excluded:
+	// planClaimAcquisition would supersede it, so it is not a live presence signal
+	// (this mirrors the expiry check the `owns` verdict re-applies). Reads that
+	// derive claimed_by (loadBoardReadiness/loadActiveKernelClaimRow) filter on
+	// state only; THIS read additionally honors the lease TTL. Sorted by
+	// claimed_at (then issue_id) for deterministic output. The kernel_claims
+	// schema has NO `agent` column — the lease's who-dimension is actor +
+	// session_id + worktree_id — so no agent field is surfaced.
+	if (operation === 'claims') {
+		const nowIso = context.now || new Date().toISOString();
+		const rows = safeAll(runtime, db, "SELECT * FROM kernel_claims WHERE state = 'active'");
+		const claims = rows
+			.filter(row => !isLeaseExpired(row, nowIso))
+			.map(row => ({
+				id: row.id,
+				issue_id: row.issue_id,
+				actor: row.actor ?? null,
+				session_id: row.session_id ?? null,
+				worktree_id: row.worktree_id ?? null,
+				claimed_at: row.claimed_at ?? null,
+				expires_at: row.expires_at ?? null,
+			}))
+			.sort((a, b) => String(a.claimed_at).localeCompare(String(b.claimed_at))
+				|| String(a.issue_id).localeCompare(String(b.issue_id)));
+		return okIssueResponse('issue.claims', { claims, count: claims.length });
+	}
+	return null;
+}
+
+// --- Event-store primitives (Wave 2) -------------------------------------------
+// Low-level reads/writes over kernel_events + kernel_issues that the broker's
+// guarded-event path composes. Signatures mirror the inline fake drivers in
+// broker-*.test.js exactly. CAS/idempotency/lease orchestration lives in the
+// broker; these stay deliberately mechanical.
+
+const KERNEL_EVENT_COLUMNS = Object.freeze([
+	'id',
+	'entity_type',
+	'entity_id',
+	'event_type',
+	'idempotency_key',
+	'expected_revision',
+	'actor',
+	'origin',
+	'payload_json',
+	'created_at',
+]);
+
+// Persist one event. The id is supplied by the caller or minted here (event ids are
+// TEXT, not autoincrement). The event's payload is stored as payload_json: a
+// pre-serialized payload_json wins, else the payload object is JSON-stringified. The
+// native UNIQUE(idempotency_key) error is intentionally NOT caught here.
+function insertKernelEventRow(runtime, db, event) {
+	const id = event.id || randomUUID();
+	const payloadJson = event.payload_json ?? JSON.stringify(event.payload ?? {});
+	const row = {
+		id,
+		entity_type: event.entity_type,
+		entity_id: event.entity_id,
+		event_type: event.event_type,
+		idempotency_key: event.idempotency_key,
+		expected_revision: event.expected_revision,
+		actor: event.actor,
+		origin: event.origin,
+		payload_json: payloadJson,
+		created_at: event.created_at,
+	};
+	const placeholders = KERNEL_EVENT_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_events (${KERNEL_EVENT_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+		KERNEL_EVENT_COLUMNS.map(column => row[column]),
+	);
+	// Return what we wrote (minted id included) so callers can build the projection
+	// outbox entry — don't depend on .run()'s return shape across runtimes.
+	return { ...event, ...row };
+}
+
+// Read the entity-revision row for an issue (the CAS authority). Only issues store
+// entity_revision; any other entity type has no stored revision, so return null and
+// let the evaluator treat it as a brand-new (revision-0) entity.
+function loadKernelEntityRow(runtime, db, entityType, entityId) {
+	if (entityType !== 'issue') return null;
+	const rows = allParams(runtime, db, 'SELECT * FROM kernel_issues WHERE id = ?', [entityId]);
+	return rows[0] || null;
+}
+
+// Read the full event stream for one entity, oldest first (matches
+// idx_kernel_events_entity_created; there is no seq column, so created_at is the
+// ordering key).
+function listKernelEventRows(runtime, db, entityType, entityId) {
+	return allParams(
+		runtime,
+		db,
+		'SELECT * FROM kernel_events WHERE entity_type = ? AND entity_id = ? ORDER BY created_at ASC',
+		[entityType, entityId],
+	);
+}
+
+// Look up the committed event for an idempotency key (the duplicate-replay probe).
+// The broker calls this unconditionally inside a Promise.all even for keyless
+// events, so guard a falsy key up front rather than binding undefined.
+function loadKernelEventByIdempotencyKeyRow(runtime, db, idempotencyKey) {
+	if (!idempotencyKey) return null;
+	const rows = allParams(
+		runtime,
+		db,
+		'SELECT * FROM kernel_events WHERE idempotency_key = ?',
+		[idempotencyKey],
+	);
+	return rows[0] || null;
+}
+
+// --- Guarded-event commit writes (Wave 3) -------------------------------------
+// commitGuardedAccept (broker) opens BEGIN IMMEDIATE, inserts the event + outbox,
+// and — via the typeof-guarded applyAcceptedIssueMutation hook — calls back into
+// the driver to apply the accepted issue mutation to the authority tables. These
+// writes run on the SAME connection inside the broker's transaction, so an event
+// insert and its issue-row effect commit (or roll back) atomically.
+
+// kernel_conflicts has no `reason`/`payload` columns; persist only the stored
+// schema columns (the evaluator's reason is encoded inside payload_json).
+const KERNEL_CONFLICT_COLUMNS = Object.freeze([
+	'id',
+	'entity_type',
+	'entity_id',
+	'expected_revision',
+	'actual_revision',
+	'status',
+	'payload_json',
+	'created_at',
+]);
+
+function insertKernelConflictRow(runtime, db, conflict) {
+	const row = {
+		id: conflict.id || randomUUID(),
+		entity_type: conflict.entity_type,
+		entity_id: conflict.entity_id,
+		expected_revision: Number(conflict.expected_revision || 0),
+		actual_revision: Number(conflict.actual_revision || 0),
+		status: conflict.status || 'quarantined',
+		payload_json: conflict.payload_json ?? JSON.stringify(conflict.payload ?? {}),
+		created_at: conflict.created_at,
+	};
+	const placeholders = KERNEL_CONFLICT_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_conflicts (${KERNEL_CONFLICT_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+		KERNEL_CONFLICT_COLUMNS.map(column => row[column]),
+	);
+	return { ...conflict, id: row.id };
+}
+
+// kernel_outbox status/attempts default in the schema, but we write them explicitly
+// so a freshly-enqueued entry is fully specified regardless of runtime defaults.
+const KERNEL_OUTBOX_COLUMNS = Object.freeze([
+	'id',
+	'event_id',
+	'target',
+	'status',
+	'attempts',
+	'next_attempt_at',
+	'created_at',
+]);
+
+function enqueueKernelProjectionRow(runtime, db, entry) {
+	const row = {
+		id: entry.id || randomUUID(),
+		event_id: entry.event_id,
+		target: entry.target,
+		status: entry.status || 'pending',
+		attempts: Number(entry.attempts || 0),
+		next_attempt_at: entry.next_attempt_at ?? null,
+		created_at: entry.created_at,
+	};
+	const placeholders = KERNEL_OUTBOX_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_outbox (${KERNEL_OUTBOX_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+		KERNEL_OUTBOX_COLUMNS.map(column => row[column]),
+	);
+	return { ...entry, id: row.id };
+}
+
+// --- Projection-outbox read/update primitives (Wave 5) ------------------------
+// The outbox consumer (projection-jsonl-writer.runJsonlProjectionConsumer) is the
+// PRECISE spec for these shapes. They are additive read/update writes over
+// kernel_outbox + kernel_dead_letters — they NEVER touch the append/CAS path
+// (insertKernelEvent / enqueueKernelProjection) and never mutate Kernel authority
+// tables. A projection failure is recorded out-of-band so the event log stays
+// the single source of truth.
+
+// List the drainable outbox rows for one target. `now` gates backoff: a row that
+// failed and was scheduled forward (next_attempt_at in the future) MUST NOT be
+// re-listed until its backoff elapses, else recordProjectionFailure's exponential
+// backoff is dead and a poison row re-drains every tick. A NULL next_attempt_at
+// (never-retried) is always eligible. Ordered by created_at so the snapshot the
+// consumer takes reflects insertion order deterministically.
+function listProjectionOutboxRows(runtime, db, filter = {}) {
+	const clauses = [];
+	const params = [];
+	if (filter.target !== undefined) {
+		clauses.push('target = ?');
+		params.push(filter.target);
+	}
+	if (filter.status !== undefined) {
+		clauses.push('status = ?');
+		params.push(filter.status);
+	}
+	if (filter.now !== undefined) {
+		clauses.push('(next_attempt_at IS NULL OR next_attempt_at <= ?)');
+		params.push(filter.now);
+	}
+	const where = clauses.length ? ` WHERE ${clauses.join(' AND ')}` : '';
+	return allParams(
+		runtime,
+		db,
+		`SELECT * FROM kernel_outbox${where} ORDER BY created_at ASC, id ASC`,
+		params,
+	);
+}
+
+// The full projection read-model: every authority issue/comment/dependency row.
+// The consumer renders ONE full snapshot per drain, so this returns the whole
+// board (not a delta). Tables may be empty on a fresh DB; safeAll degrades a
+// partially-migrated table to [].
+function loadProjectionModelRows(runtime, db) {
+	return {
+		issues: safeAll(runtime, db, 'SELECT * FROM kernel_issues ORDER BY id ASC'),
+		comments: safeAll(runtime, db, 'SELECT * FROM kernel_comments ORDER BY issue_id ASC, created_at ASC, id ASC'),
+		dependencies: safeAll(runtime, db, 'SELECT * FROM kernel_dependencies ORDER BY issue_id ASC, blocks_issue_id ASC, id ASC'),
+	};
+}
+
+// Mark the drained outbox rows delivered. Builds one `?` placeholder per id (never
+// interpolate ids) and guards an empty list so we don't emit `IN ()` (a syntax
+// error on both runtimes). Returns {updated:n} — the count the consumer reports.
+function markProjectionDeliveredRows(runtime, db, ids = [], _meta = {}) {
+	const list = Array.isArray(ids) ? ids.filter(id => id !== undefined && id !== null) : [];
+	if (list.length === 0) return { updated: 0 };
+	const placeholders = list.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`UPDATE kernel_outbox SET status = 'delivered' WHERE id IN (${placeholders})`,
+		list,
+	);
+	return { updated: list.length };
+}
+
+// Record a transient projection failure: bump attempts + schedule the next retry
+// while keeping the row pending. kernel_outbox has NO error column, so the
+// record.error has nowhere to land here (it is surfaced only when the row is
+// finally dead-lettered) — that is intentional, not a dropped field.
+function recordProjectionFailureRows(runtime, db, record = {}) {
+	runParams(
+		runtime,
+		db,
+		"UPDATE kernel_outbox SET status = 'pending', attempts = ?, next_attempt_at = ? WHERE id = ?",
+		[Number(record.attempts || 0), record.next_attempt_at ?? null, record.id],
+	);
+	return { id: record.id, attempts: Number(record.attempts || 0) };
+}
+
+const KERNEL_DEAD_LETTER_COLUMNS = Object.freeze([
+	'id',
+	'outbox_id',
+	'target',
+	'status',
+	'error',
+	'payload_json',
+	'created_at',
+]);
+
+// Terminal projection failure: insert a dead_letters row AND transition the source
+// outbox row out of 'pending' (→ 'dead') so it is never re-drained. Both writes run
+// on the same connection; the consumer calls this from its catch path, not inside a
+// guarded transaction, so the two writes are best-effort sequential (a projection
+// failure must not block authority). Returns {id} (the new dead-letter id).
+function deadLetterProjectionRows(runtime, db, record = {}) {
+	const id = record.id || randomUUID();
+	const row = {
+		id,
+		outbox_id: record.outbox_id ?? null,
+		target: record.target,
+		status: record.status || 'open',
+		error: record.error ?? '',
+		payload_json: record.payload_json ?? JSON.stringify(record.payload ?? {}),
+		created_at: record.created_at ?? record.now,
+	};
+	const placeholders = KERNEL_DEAD_LETTER_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_dead_letters (${KERNEL_DEAD_LETTER_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+		KERNEL_DEAD_LETTER_COLUMNS.map(column => row[column]),
+	);
+	if (record.outbox_id) {
+		runParams(
+			runtime,
+			db,
+			"UPDATE kernel_outbox SET status = 'dead' WHERE id = ?",
+			[record.outbox_id],
+		);
+	}
+	return { id };
+}
+
+// All blocking edges, so the evaluator can detect a cycle the new dependency.add
+// edge would close. The broker only calls this for dependency.add events with a
+// complete scope; an empty/absent table degrades to []. The cycle check needs the
+// whole graph (not just the scoped edge), so `scope` is currently informational.
+function listKernelDependencyRows(runtime, db, _scope = {}) {
+	return safeAll(runtime, db, 'SELECT * FROM kernel_dependencies');
+}
+
+// Read the single live-lease candidate for an issue: the row in state='active'.
+// Filter on STATE ONLY, never on expiry — planClaimAcquisition needs the
+// expired-but-active row to fire its reclaim/supersede branch. Dropping it here
+// would null the active row and the next insert would collide on the partial
+// UNIQUE index (idx_kernel_claims_active_lease). The partial index guarantees at
+// most one such row, so the first match is authoritative.
+function loadActiveKernelClaimRow(runtime, db, issueId) {
+	const rows = allParams(
+		runtime,
+		db,
+		"SELECT * FROM kernel_claims WHERE issue_id = ? AND state = 'active' ORDER BY claimed_at ASC LIMIT 1",
+		[issueId],
+	);
+	return rows[0] || null;
+}
+
+// The 8 columns buildClaimRow (lease-enforcer) produces. The native
+// partial-UNIQUE(issue_id WHERE state='active') error is intentionally NOT caught
+// here — the broker's recoverGuardedFailure parses it to convert a cross-owner
+// lease collision into a claim_conflict quarantine.
+const KERNEL_CLAIM_COLUMNS = Object.freeze([
+	'id',
+	'issue_id',
+	'actor',
+	'state',
+	'session_id',
+	'worktree_id',
+	'claimed_at',
+	'expires_at',
+]);
+
+function insertKernelClaimRow(runtime, db, claim) {
+	const row = {
+		id: claim.id || randomUUID(),
+		issue_id: claim.issue_id,
+		actor: claim.actor,
+		state: claim.state || 'active',
+		session_id: claim.session_id ?? null,
+		worktree_id: claim.worktree_id ?? null,
+		claimed_at: claim.claimed_at,
+		expires_at: claim.expires_at ?? null,
+	};
+	const placeholders = KERNEL_CLAIM_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_claims (${KERNEL_CLAIM_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+		KERNEL_CLAIM_COLUMNS.map(column => row[column]),
+	);
+	return { ...claim, id: row.id };
+}
+
+// Transition a claim row's state (e.g. active → reclaimable when superseding an
+// expired lease). Moving a row out of 'active' frees the partial-UNIQUE slot so a
+// fresh active lease can be inserted in the same transaction.
+function updateKernelClaimStateRow(runtime, db, claimId, state) {
+	runParams(
+		runtime,
+		db,
+		'UPDATE kernel_claims SET state = ? WHERE id = ?',
+		[state, claimId],
+	);
+	return { id: claimId, state };
+}
+
+// --- Worktree-linkage primitives (P0 kernel linkage backbone). The kernel_worktrees
+// table is a plain authority registry (NOT event-sourced): `forge worktree create`
+// writes a row here so the kernel records issue → worktree → work-folder, and
+// orientation / `forge worktree list` read it back instead of guessing. The row is
+// keyed by absolute worktree `path`; re-registering the same path UPDATEs in place so
+// the write is idempotent (a worktree can be re-created / re-linked without duplicating).
+const KERNEL_WORKTREE_COLUMNS = Object.freeze([
+	'id',
+	'git_common_dir',
+	'path',
+	'branch',
+	'actor',
+	'issue_id',
+	'work_folder',
+	'registered_at',
+	'state',
+]);
+
+function loadWorktreeRowByPath(runtime, db, worktreePath) {
+	if (!worktreePath) return null;
+	const rows = safeAll(
+		runtime,
+		db,
+		'SELECT * FROM kernel_worktrees WHERE path = ? ORDER BY registered_at DESC LIMIT 1',
+		[worktreePath],
+	);
+	return rows[0] || null;
+}
+
+function upsertWorktreeRow(runtime, db, input) {
+	const existing = loadWorktreeRowByPath(runtime, db, input.path);
+	const row = {
+		id: input.id || existing?.id || randomUUID(),
+		git_common_dir: input.git_common_dir,
+		path: input.path,
+		branch: input.branch,
+		actor: input.actor ?? null,
+		issue_id: input.issue_id ?? null,
+		work_folder: input.work_folder ?? null,
+		registered_at: input.registered_at || new Date().toISOString(),
+		state: input.state || 'active',
+	};
+	if (existing) {
+		runParams(
+			runtime,
+			db,
+			'UPDATE kernel_worktrees SET git_common_dir = ?, branch = ?, actor = ?, issue_id = ?, work_folder = ?, registered_at = ?, state = ? WHERE id = ?',
+			[row.git_common_dir, row.branch, row.actor, row.issue_id, row.work_folder, row.registered_at, row.state, row.id],
+		);
+	} else {
+		const placeholders = KERNEL_WORKTREE_COLUMNS.map(() => '?').join(', ');
+		runParams(
+			runtime,
+			db,
+			`INSERT INTO kernel_worktrees (${KERNEL_WORKTREE_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+			KERNEL_WORKTREE_COLUMNS.map(column => row[column]),
+		);
+	}
+	return row;
+}
+
+function listWorktreeRows(runtime, db, filter = {}) {
+	if (filter && filter.state) {
+		return safeAll(
+			runtime,
+			db,
+			'SELECT * FROM kernel_worktrees WHERE state = ? ORDER BY registered_at DESC',
+			[filter.state],
+		);
+	}
+	return safeAll(runtime, db, 'SELECT * FROM kernel_worktrees ORDER BY registered_at DESC');
+}
+
+// --- Stage-run registry (f61601ab). kernel_stage_runs records the REAL workflow
+// phase per issue so the dashboard/`show` read the phase instead of guessing it
+// from status+claim (a claimed-open issue with a merged PR would otherwise still
+// show "dev"). Like kernel_worktrees this is a plain authority registry written
+// DIRECTLY (not event-sourced): a stage row is keyed by (issue_id, stage) and the
+// write is idempotent per that pair — re-starting a stage UPDATEs in place instead
+// of duplicating. `start` opens an active row (started_at, completed_at NULL);
+// `complete` stamps completed_at + status='done' on that same row.
+const KERNEL_STAGE_RUN_COLUMNS = Object.freeze([
+	'id',
+	'issue_id',
+	'stage',
+	'substage',
+	'status',
+	'started_at',
+	'completed_at',
+	'evidence_id',
+]);
+
+function loadStageRunRow(runtime, db, issueId, stage) {
+	if (!issueId || !stage) return null;
+	const rows = safeAll(
+		runtime,
+		db,
+		'SELECT * FROM kernel_stage_runs WHERE issue_id = ? AND stage = ? ORDER BY started_at DESC LIMIT 1',
+		[issueId, stage],
+	);
+	return rows[0] || null;
+}
+
+// Idempotent per (issue_id, stage). action 'start' opens/keeps an active row;
+// action 'complete' stamps completed_at + status='done' (creating the row first
+// if the stage was never explicitly started, so a bare `complete` still records
+// that the stage ran).
+function recordStageRunRow(runtime, db, input) {
+	const stage = input.stage;
+	if (!input.issue_id || !stage) {
+		throw new Error('recordStageRun requires issue_id and stage');
+	}
+	const action = input.action || 'start';
+	if (action !== 'start' && action !== 'complete') {
+		throw new Error(`recordStageRun: unknown action "${action}" (expected start|complete)`);
+	}
+	const now = input.now || new Date().toISOString();
+	const existing = loadStageRunRow(runtime, db, input.issue_id, stage);
+
+	if (action === 'start') {
+		if (existing) {
+			// Re-start is idempotent: keep the id + original started_at, ensure the row
+			// is active again (supports a rework loop re-opening a completed stage).
+			const row = {
+				...existing,
+				substage: input.substage ?? existing.substage ?? null,
+				status: 'active',
+				completed_at: null,
+				evidence_id: input.evidence_id ?? existing.evidence_id ?? null,
+			};
+			runParams(
+				runtime,
+				db,
+				'UPDATE kernel_stage_runs SET substage = ?, status = ?, completed_at = ?, evidence_id = ? WHERE id = ?',
+				[row.substage, row.status, row.completed_at, row.evidence_id, row.id],
+			);
+			return row;
+		}
+		const row = {
+			id: input.id || randomUUID(),
+			issue_id: input.issue_id,
+			stage,
+			substage: input.substage ?? null,
+			status: 'active',
+			started_at: input.started_at || now,
+			completed_at: null,
+			evidence_id: input.evidence_id ?? null,
+		};
+		const placeholders = KERNEL_STAGE_RUN_COLUMNS.map(() => '?').join(', ');
+		runParams(
+			runtime,
+			db,
+			`INSERT INTO kernel_stage_runs (${KERNEL_STAGE_RUN_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+			KERNEL_STAGE_RUN_COLUMNS.map(column => row[column]),
+		);
+		return row;
+	}
+
+	// action === 'complete'
+	if (existing) {
+		const row = {
+			...existing,
+			substage: input.substage ?? existing.substage ?? null,
+			status: 'done',
+			completed_at: now,
+			evidence_id: input.evidence_id ?? existing.evidence_id ?? null,
+		};
+		runParams(
+			runtime,
+			db,
+			'UPDATE kernel_stage_runs SET substage = ?, status = ?, completed_at = ?, evidence_id = ? WHERE id = ?',
+			[row.substage, row.status, row.completed_at, row.evidence_id, row.id],
+		);
+		return row;
+	}
+	const row = {
+		id: input.id || randomUUID(),
+		issue_id: input.issue_id,
+		stage,
+		substage: input.substage ?? null,
+		status: 'done',
+		started_at: input.started_at || now,
+		completed_at: now,
+		evidence_id: input.evidence_id ?? null,
+	};
+	const placeholders = KERNEL_STAGE_RUN_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_stage_runs (${KERNEL_STAGE_RUN_COLUMNS.join(', ')}) VALUES (${placeholders})`,
+		KERNEL_STAGE_RUN_COLUMNS.map(column => row[column]),
+	);
+	return row;
+}
+
+// Atomic stage transition: complete the `from` stage and start the `to` stage as
+// ONE all-or-nothing write. Auto-recording from a `stage: <from> -> <to>` comment
+// (5a5ba3a6) used to issue these as two separate recordStageRun calls at the caller;
+// if the second threw, the first had already persisted — leaving a half-transition
+// (from marked done, to never started) so `current_stage` was wrong. Wrapping both
+// writes in a single BEGIN IMMEDIATE transaction makes a mid-transition failure roll
+// back cleanly. Best-effort/non-blocking is the CALLER's contract; this method still
+// throws on failure so the caller can observe it (and roll back has happened).
+function recordStageTransitionRow(runtime, db, input) {
+	const issueId = input && input.issue_id;
+	const from = input && input.from;
+	const to = input && input.to;
+	if (!issueId || !from || !to) {
+		throw new Error('recordStageTransition requires issue_id, from, and to');
+	}
+	const now = input.now || new Date().toISOString();
+	execSql(runtime, db, 'BEGIN IMMEDIATE;');
+	try {
+		const completed = recordStageRunRow(runtime, db, {
+			issue_id: issueId, stage: from, action: 'complete', now,
+		});
+		const started = recordStageRunRow(runtime, db, {
+			issue_id: issueId, stage: to, action: 'start', now,
+		});
+		execSql(runtime, db, 'COMMIT;');
+		return { from: completed, to: started };
+	} catch (error) {
+		try {
+			execSql(runtime, db, 'ROLLBACK;');
+		} catch {
+			// A rollback failure must not mask the original transition error.
+		}
+		throw error;
+	}
+}
+
+function listStageRunRows(runtime, db, issueId) {
+	if (!issueId) return [];
+	// Deterministic order: started_at first, then rowid (the implicit INSERT sequence)
+	// as a STABLE tie-break. Fast callers can mint two runs in the same millisecond, so
+	// ordering by started_at alone leaves ties undefined (differs local vs CI vs OS).
+	// rowid gives intuitive insertion order for a history list; the random-UUID `id`
+	// would not reflect insertion order, so it is unsuitable as the tie-break.
+	return safeAll(
+		runtime,
+		db,
+		'SELECT * FROM kernel_stage_runs WHERE issue_id = ? ORDER BY started_at ASC, rowid ASC',
+		[issueId],
+	);
+}
+
+// Current stage = latest ACTIVE run (completed_at IS NULL) by started_at; when none
+// is active, the latest COMPLETED run by completed_at. Returns null when the issue
+// has no stage runs (caller falls back to the status+claim heuristic).
+function loadCurrentStageRunRow(runtime, db, issueId) {
+	const rows = listStageRunRows(runtime, db, issueId);
+	if (rows.length === 0) return null;
+	const active = rows.filter(row => !row.completed_at);
+	if (active.length > 0) {
+		return active.reduce((latest, row) => (String(row.started_at) >= String(latest.started_at) ? row : latest));
+	}
+	return rows.reduce((latest, row) => (
+		String(row.completed_at || row.started_at) >= String(latest.completed_at || latest.started_at) ? row : latest
+	));
+}
+
+// Columns the issue upsert may set from an accepted event payload. id/title are
+// required for a create; the rest are optional and only overwritten when present.
+const ISSUE_MUTABLE_COLUMNS = Object.freeze([
+	'title',
+	'body',
+	'type',
+	'status',
+	'priority',
+	'priority_rank',
+	'parent_id',
+	'sprint_id',
+	'release_id',
+	'stage_state',
+	'labels',
+	'acceptance_criteria',
+	'estimate',
+	// KAP-10 (design/notes) + KAP-11 (assignee): persisted on create AND update via
+	// the same assignment loop. assignee is the persistent owner, distinct from the
+	// transient kernel_claims lease.
+	'design',
+	'notes',
+	'assignee',
+	// Author, close timestamp + raw close reason, and a verbatim metadata JSON blob.
+	// The importer sets these explicitly on an issue event payload; a native CLI close
+	// also auto-fills closed_at/close_reason from the close event (9197b0c8) — explicit
+	// payload values always win, preserving import fidelity.
+	'created_by',
+	'closed_at',
+	'close_reason',
+	'metadata',
+]);
+
+// close drives the issue to a terminal status; an explicit payload.status (rework
+// transitions) still wins so the broker can model any accepted lifecycle move.
+function resolveMutationStatus(eventType, payload) {
+	if (typeof payload.status === 'string' && payload.status) return payload.status;
+	if (eventType === 'issue.close') return 'done';
+	return null;
+}
+
+// KAP-8: after a close COMMITS the issue to a terminal status, compute the issues
+// that become newly READY because this issue is now done. This is a LOCALIZED
+// post-write read on the SAME connection/transaction — the issue row is already
+// `done`, so loadBoardReadiness sees the post-close state. We restrict the result
+// to DIRECT dependents of the closed issue (kernel_dependencies rows where
+// blocks_issue_id === closedId) whose readiness now flips to ready (the closed
+// blocker is terminal and dropped, and they carry no OTHER live blocker). Sorted
+// for a deterministic response.
+function computeNewlyUnblocked(runtime, db, closedIssueId, context = {}) {
+	const dependents = safeAll(
+		runtime,
+		db,
+		'SELECT DISTINCT issue_id FROM kernel_dependencies WHERE blocks_issue_id = ?',
+		[closedIssueId],
+	).map(row => row.issue_id).filter(Boolean);
+	if (dependents.length === 0) return [];
+	const { index } = loadBoardReadiness(runtime, db, context);
+	return dependents
+		.filter(id => Boolean(index.readinessById[id]?.ready))
+		.sort((a, b) => String(a).localeCompare(String(b)));
+}
+
+// Upsert the issue row for an accepted issue event and bump entity_revision. The
+// evaluator already enforced CAS (expected_revision === stored), so the new
+// revision is monotonic: stored + 1 for an update, 0 for a fresh create.
+function applyAcceptedIssueEvent(runtime, db, event, context = {}) {
+	const payload = event.payload || (event.payload_json ? JSON.parse(event.payload_json) : {});
+	const issueId = event.entity_id;
+	const now = event.created_at;
+	const existing = loadKernelEntityRow(runtime, db, 'issue', issueId);
+	const status = resolveMutationStatus(event.event_type, payload);
+
+	// 9197b0c8: a native close must persist its OWN close metadata. The importer
+	// supplies closed_at/close_reason explicitly, but a CLI `close --reason` only
+	// carries the event-payload `reason` — both COLUMNS stayed NULL and every real
+	// close failed gate.issue_verify's read-back. Stamp the columns from the close
+	// event (explicit payload values, e.g. import fidelity, still win).
+	if (event.event_type === 'issue.close') {
+		if (payload.closed_at === undefined || payload.closed_at === null) {
+			payload.closed_at = now;
+		}
+		if (
+			(payload.close_reason === undefined || payload.close_reason === null)
+			&& typeof payload.reason === 'string' && payload.reason
+		) {
+			payload.close_reason = payload.reason;
+		}
+	}
+
+	if (!existing) {
+		// Fresh create: seed required NOT NULL columns, then overwrite with any
+		// supplied payload values via the shared column map below. priority_rank is
+		// DERIVED from the (possibly defaulted) priority LABEL so a no-`--priority`
+		// create still sorts by its P2 default — seeding rank 0 would otherwise rank the
+		// common default-priority issue ABOVE an explicit P1 in `list` (priority order
+		// inverted). The CLI/broker already supplies priority_rank when --priority is
+		// given, so this fallback only fires for the defaulted/raw-event path.
+		const priorityLabel = payload.priority ?? 'P2';
+		runParams(
+			runtime,
+			db,
+			`INSERT INTO kernel_issues (id, title, type, status, priority, priority_rank, created_at, updated_at, entity_revision)
+				VALUES (?, ?, ?, ?, ?, ?, ?, ?, 0)`,
+			[
+				issueId,
+				payload.title ?? issueId,
+				payload.type ?? 'task',
+				status ?? payload.status ?? 'open',
+				priorityLabel,
+				Number(payload.priority_rank ?? rankForPriorityLabel(priorityLabel)),
+				now,
+				now,
+			],
+		);
+	}
+
+	const assignments = [];
+	const values = [];
+	for (const column of ISSUE_MUTABLE_COLUMNS) {
+		const value = column === 'status' ? status : payload[column];
+		if (value === undefined || value === null) continue;
+		assignments.push(`${column} = ?`);
+		// KAP-4: labels arrive as a string[] (broker parseLabelFlag). SQLite cannot
+		// bind an array param, so persist as JSON-array TEXT — the canonical form
+		// parseLabels reads back on the read side. Every other column binds as-is.
+		values.push(column === 'labels' ? JSON.stringify(value) : value);
+	}
+	assignments.push('updated_at = ?');
+	values.push(now);
+	// Monotonic CAS bump: increment the stored revision on every accepted write
+	// (a create stays at 0 because the INSERT seeded 0 and this UPDATE runs once).
+	const expectedRevision = Number(existing ? existing.entity_revision || 0 : 0);
+	const nextRevision = existing ? expectedRevision + 1 : 0;
+	assignments.push('entity_revision = ?');
+	values.push(nextRevision);
+	if (existing) {
+		// Optimistic CAS at the row write for revision-bumping mutations (update/close).
+		// The evaluator pre-reads the entity OUTSIDE this transaction, so two writers
+		// that both pre-read rev=N both pass the evaluator; BEGIN IMMEDIATE then
+		// serializes them and the second would otherwise apply on top of N+1 — a silent
+		// lost update. Gate the WHERE on the event's expected_revision: if the row's
+		// actual revision has moved (0 rows changed), throw a tagged conflict the broker
+		// converts into a stale_revision quarantine. A create INSERTs a fresh row (the PK
+		// guards it) so it takes the un-gated path below.
+		const result = runParams(
+			runtime,
+			db,
+			`UPDATE kernel_issues SET ${assignments.join(', ')} WHERE id = ? AND entity_revision = ?`,
+			[...values, issueId, Number(event.expected_revision || 0)],
+		);
+		// Both runtimes' run() return a changed-row count (bun:sqlite .changes;
+		// node:sqlite StatementSync.run() → { changes, lastInsertRowid }). 0 changes
+		// means the CAS predicate (entity_revision = expected) matched no row.
+		if (Number(result?.changes || 0) === 0) {
+			const error = new Error('kernel issue revision conflict');
+			// Driver-supplied TYPED conflict signal (issues 89bf8930 / d4ce47bb): the
+			// broker branches on this code, never on error text. kernelRevisionConflict
+			// is retained as the structural marker classifyConflictSignal also honors.
+			error.conflictSignal = CONFLICT_SIGNAL.CAS_STALE;
+			error.kernelRevisionConflict = true;
+			error.entityId = issueId;
+			error.expectedRevision = Number(event.expected_revision || 0);
+			error.actualRevision = expectedRevision;
+			throw error;
+		}
+		return finalizeIssueMutation(runtime, db, event, issueId, nextRevision, context);
+	}
+	runParams(
+		runtime,
+		db,
+		`UPDATE kernel_issues SET ${assignments.join(', ')} WHERE id = ?`,
+		[...values, issueId],
+	);
+	return finalizeIssueMutation(runtime, db, event, issueId, nextRevision, context);
+}
+
+// Build the issue-mutation summary, attaching KAP-8 newly_unblocked for a close.
+// The issue row is already at its terminal status here (the UPDATE above committed
+// on this connection), so computeNewlyUnblocked sees the post-close readiness.
+function finalizeIssueMutation(runtime, db, event, issueId, revision, context) {
+	const summary = { id: issueId, revision };
+	if (event.event_type === 'issue.close') {
+		summary.newly_unblocked = computeNewlyUnblocked(runtime, db, issueId, context);
+	}
+	return summary;
+}
+
+// Append a comment row for an accepted issue.comment event.
+function applyAcceptedCommentEvent(runtime, db, event) {
+	const payload = event.payload || (event.payload_json ? JSON.parse(event.payload_json) : {});
+	const commentId = payload.comment_id || randomUUID();
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_comments (id, issue_id, body, actor, visibility, created_at)
+			VALUES (?, ?, ?, ?, ?, ?)`,
+		[
+			commentId,
+			payload.issue_id ?? event.entity_id,
+			payload.body ?? '',
+			event.actor ?? payload.actor ?? 'forge',
+			payload.visibility ?? 'local',
+			event.created_at,
+		],
+	);
+	// A comment never bumps the issue revision; report the host issue's current one.
+	const issue = loadKernelEntityRow(runtime, db, 'issue', payload.issue_id ?? event.entity_id);
+	return { id: payload.issue_id ?? event.entity_id, revision: Number(issue?.entity_revision || 0), comment_id: commentId };
+}
+
+// Insert the dependency edge for an accepted dependency.add event. The event's
+// entity_id IS the dependency row id (the broker scopes the event on the
+// 'dependency' entity stream), so the row is uniquely keyed without minting a new
+// id. This is the ONLY place dependency rows are written — the cycle guard already
+// fired in the evaluator before this accepted event reached the commit.
+function applyAcceptedDependencyAddEvent(runtime, db, event) {
+	const payload = event.payload || (event.payload_json ? JSON.parse(event.payload_json) : {});
+	const dependencyId = event.entity_id;
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_dependencies (id, issue_id, blocks_issue_id, dependency_type, created_at)
+			VALUES (?, ?, ?, ?, ?)`,
+		[
+			dependencyId,
+			payload.issue_id,
+			payload.blocks_issue_id,
+			payload.dependency_type || 'blocks',
+			event.created_at,
+		],
+	);
+	return { id: dependencyId, revision: 0, dependency_id: dependencyId };
+}
+
+// Delete the dependency edge for an accepted dependency.remove event, keyed by the
+// (issue_id, blocks_issue_id) pair the payload names — the dependent's id is not
+// the dependency row id, so delete by the edge endpoints, not entity_id.
+function applyAcceptedDependencyRemoveEvent(runtime, db, event) {
+	const payload = event.payload || (event.payload_json ? JSON.parse(event.payload_json) : {});
+	runParams(
+		runtime,
+		db,
+		'DELETE FROM kernel_dependencies WHERE issue_id = ? AND blocks_issue_id = ?',
+		[payload.issue_id, payload.blocks_issue_id],
+	);
+	return { id: event.entity_id, revision: 0, dependency_id: event.entity_id };
+}
+
+// Clear the active lease for an accepted claim.release event. Conservatively
+// releases the issue's active lease (the required ownership model is same-actor
+// "release clears it"; cross-owner authorization is deliberately out of scope).
+// claim.create is NOT handled here — its lease row is inserted by the broker's
+// insertKernelClaim inside commitGuardedAccept; re-inserting it here would be a
+// double-INSERT that trips the partial-UNIQUE index.
+function applyAcceptedClaimReleaseEvent(runtime, db, event) {
+	const payload = event.payload || (event.payload_json ? JSON.parse(event.payload_json) : {});
+	runParams(
+		runtime,
+		db,
+		"UPDATE kernel_claims SET state = 'released' WHERE issue_id = ? AND state = 'active'",
+		[payload.issue_id],
+	);
+	return { id: event.entity_id, revision: 0, claim_id: event.entity_id };
+}
+
+// Apply an accepted event's authority-table effect. Returns the mutation summary
+// ({id, revision, comment_id?/dependency_id?/claim_id?}) the broker threads back
+// into the issue-command response, or null for events with no synchronous
+// side effect here (claim.create's lease is written by the broker's
+// insertKernelClaim inside the transaction). The entity_type guard is critical:
+// dependency/claim events must NEVER fall into the issue-upsert branch, which
+// would corrupt kernel_issues with a bogus row keyed by the dep/claim id.
+function applyAcceptedMutation(runtime, db, event, context = {}) {
+	if (event.entity_type === 'dependency') {
+		if (event.event_type === 'dependency.remove') {
+			return applyAcceptedDependencyRemoveEvent(runtime, db, event);
+		}
+		return applyAcceptedDependencyAddEvent(runtime, db, event);
+	}
+	if (event.entity_type === 'claim') {
+		if (event.event_type === 'claim.release') {
+			return applyAcceptedClaimReleaseEvent(runtime, db, event);
+		}
+		// claim.create: the lease row is written by the broker's insertKernelClaim
+		// inside commitGuardedAccept; no authority-table effect to apply here.
+		return null;
+	}
+	if (event.entity_type === 'issue' && event.event_type === 'issue.comment') {
+		return applyAcceptedCommentEvent(runtime, db, event);
+	}
+	if (event.entity_type === 'issue') {
+		// context carries now/actor so KAP-8's post-close readiness recompute uses the
+		// same clock/actor the rest of the guarded path did.
+		return applyAcceptedIssueEvent(runtime, db, event, context);
+	}
+	return null;
+}
+
+// --- Faithful import write path (beads → kernel) ------------------------------
+// Direct authority-table writes that PRESERVE an imported issue's ORIGINAL
+// created_at/updated_at, terminal status (done/cancelled), priority(+rank), labels,
+// acceptance/content and beads-fidelity columns — BYPASSING applyAcceptedIssueEvent's
+// now-stamping create/CAS path. This is the ONLY path that writes an issue's original
+// timestamps; the normal create/update flow is unchanged. Consumed exclusively by the
+// broker's importIssues entry point (the `forge migrate` write path). Each call is
+// idempotent (ON CONFLICT(id) DO NOTHING — an existing id is skipped, never duplicated
+// or thrown) and transactional (one BEGIN IMMEDIATE per call; all-or-nothing).
+
+// The full kernel_issues column set the importer writes. Every NOT NULL column is
+// seeded with a default in buildImportIssueRow, so a sparse record (only id/title)
+// still inserts a valid row, while a full-fidelity record round-trips verbatim.
+const IMPORT_ISSUE_COLUMNS = Object.freeze([
+	'id', 'title', 'body', 'type', 'status', 'priority', 'priority_rank',
+	'created_at', 'updated_at', 'entity_revision',
+	'parent_id', 'sprint_id', 'release_id', 'stage_state', 'labels',
+	'acceptance_criteria', 'estimate', 'design', 'notes', 'assignee',
+	'created_by', 'closed_at', 'close_reason', 'metadata',
+]);
+
+const IMPORT_COMMENT_COLUMNS = Object.freeze(['id', 'issue_id', 'body', 'actor', 'visibility', 'created_at']);
+const IMPORT_DEPENDENCY_COLUMNS = Object.freeze(['id', 'issue_id', 'blocks_issue_id', 'dependency_type', 'created_at']);
+// The kernel_events column set the importer writes for legacy beads activity events +
+// interactions (records.activityEvents). Every NOT NULL column is seeded with a default in
+// buildImportEventRow so a sparse record still inserts a valid row.
+const IMPORT_EVENT_COLUMNS = Object.freeze([
+	'id', 'entity_type', 'entity_id', 'event_type', 'idempotency_key',
+	'expected_revision', 'actor', 'origin', 'payload_json', 'created_at',
+]);
+
+// The mapper carries an issue's terminal close metadata on a SEPARATE
+// `beads.issue.closed` event (kernel.events), not on the issue record — mirror the
+// adapter's getCloseMetadataByIssue so closed_at/close_reason land on the issue row.
+function buildImportCloseMetadata(events = []) {
+	const byIssue = new Map();
+	for (const event of Array.isArray(events) ? events : []) {
+		if (!event || event.event_type !== 'beads.issue.closed') continue;
+		let payload;
+		try {
+			payload = event.payload_json ? JSON.parse(event.payload_json) : (event.payload || {});
+		} catch {
+			payload = {};
+		}
+		byIssue.set(event.entity_id, {
+			closed_at: payload.closed_at ?? event.created_at ?? null,
+			close_reason: payload.close_reason ?? null,
+		});
+	}
+	return byIssue;
+}
+
+// Build the full insert row for one imported issue record. NOT NULL columns default so a
+// sparse record stays valid; created_at/updated_at fall back to the original created_at
+// (then `now`) rather than always-now, so the imported issue's history is preserved.
+// labels are stored verbatim (the mapper already JSON-encodes them) — an accidental array
+// is re-encoded defensively. Close metadata prefers a record-level column, else the
+// close-event sidecar.
+function buildImportIssueRow(record, closeMeta, now) {
+	const priority = record.priority ?? 'P2';
+	const createdAt = record.created_at ?? now;
+	const close = closeMeta || {};
+	const labels = Array.isArray(record.labels) ? JSON.stringify(record.labels) : (record.labels ?? null);
+	return {
+		id: record.id,
+		title: record.title ?? record.id,
+		body: record.body ?? null,
+		type: record.type ?? 'task',
+		status: record.status ?? 'open',
+		priority,
+		priority_rank: Number(record.priority_rank ?? rankForPriorityLabel(priority)),
+		created_at: createdAt,
+		updated_at: record.updated_at ?? createdAt,
+		entity_revision: Number(record.entity_revision ?? 0),
+		parent_id: record.parent_id ?? null,
+		sprint_id: record.sprint_id ?? null,
+		release_id: record.release_id ?? null,
+		stage_state: record.stage_state ?? null,
+		labels,
+		acceptance_criteria: record.acceptance_criteria ?? null,
+		estimate: record.estimate ?? null,
+		design: record.design ?? null,
+		notes: record.notes ?? null,
+		assignee: record.assignee ?? null,
+		created_by: record.created_by ?? null,
+		closed_at: record.closed_at ?? close.closed_at ?? null,
+		close_reason: record.close_reason ?? close.close_reason ?? null,
+		metadata: record.metadata ?? null,
+	};
+}
+
+// Build the full insert row for one imported activity event (records.activityEvents: legacy
+// beads events.jsonl + interactions.jsonl mapped to kernel_events). NOT NULL columns default so
+// a sparse record stays valid; the mapper already supplies a deterministic id/idempotency_key so
+// the insert is idempotent under ON CONFLICT(id).
+function buildImportEventRow(record, now) {
+	return {
+		id: record.id,
+		entity_type: record.entity_type ?? 'issue',
+		entity_id: record.entity_id ?? '',
+		event_type: record.event_type ?? 'beads.event',
+		idempotency_key: record.idempotency_key ?? record.id,
+		expected_revision: Number(record.expected_revision ?? 0),
+		actor: record.actor ?? 'beads',
+		origin: record.origin ?? 'beads_import',
+		payload_json: record.payload_json ?? JSON.stringify(record.payload ?? {}),
+		created_at: record.created_at ?? now,
+	};
+}
+
+// Insert a kernel records bundle ({ issues, comments, dependencies, events, activityEvents })
+// into the authority tables inside ONE transaction. Order is issues → comments → dependencies →
+// activity events so every child FK resolves; children whose endpoint id is absent (a dangling
+// edge) are filtered out rather than aborting the whole batch on the live FK. activityEvents
+// (kernel_events has no entity FK) always insert. Returns per-table {inserted, skipped} counts
+// (skipped = an id that already existed or a filtered child).
+function importIssueRecords(runtime, db, records = {}, options = {}) {
+	const now = options.now || new Date().toISOString();
+	const issues = Array.isArray(records.issues) ? records.issues : [];
+	const comments = Array.isArray(records.comments) ? records.comments : [];
+	const dependencies = Array.isArray(records.dependencies) ? records.dependencies : [];
+	const activityEvents = Array.isArray(records.activityEvents) ? records.activityEvents : [];
+	const closeByIssue = buildImportCloseMetadata(records.events);
+	const summary = {
+		issues: { inserted: 0, skipped: 0 },
+		comments: { inserted: 0, skipped: 0 },
+		dependencies: { inserted: 0, skipped: 0 },
+		events: { inserted: 0, skipped: 0 },
+	};
+	const wasInserted = result => Number(result?.changes || 0) > 0;
+
+	execSql(runtime, db, 'BEGIN IMMEDIATE;');
+	try {
+		const issueSql = `INSERT INTO kernel_issues (${IMPORT_ISSUE_COLUMNS.join(', ')})`
+			+ ` VALUES (${IMPORT_ISSUE_COLUMNS.map(() => '?').join(', ')}) ON CONFLICT(id) DO NOTHING`;
+		for (const record of issues) {
+			if (!record || record.id == null) { summary.issues.skipped += 1; continue; }
+			const row = buildImportIssueRow(record, closeByIssue.get(record.id), now);
+			const result = runParams(runtime, db, issueSql, IMPORT_ISSUE_COLUMNS.map(column => row[column]));
+			summary.issues[wasInserted(result) ? 'inserted' : 'skipped'] += 1;
+		}
+
+		// FK-safe child filtering: an id present after the issue inserts (imported OR
+		// pre-existing) is a valid endpoint; anything else would trip the live FK.
+		const existingIds = new Set(allParams(runtime, db, 'SELECT id FROM kernel_issues').map(issue => issue.id));
+
+		const commentSql = `INSERT INTO kernel_comments (${IMPORT_COMMENT_COLUMNS.join(', ')})`
+			+ ` VALUES (${IMPORT_COMMENT_COLUMNS.map(() => '?').join(', ')}) ON CONFLICT(id) DO NOTHING`;
+		for (const comment of comments) {
+			if (!comment || comment.id == null || !existingIds.has(comment.issue_id)) { summary.comments.skipped += 1; continue; }
+			const result = runParams(runtime, db, commentSql, [
+				comment.id,
+				comment.issue_id,
+				comment.body ?? '',
+				comment.actor ?? 'beads',
+				comment.visibility ?? 'local',
+				comment.created_at ?? now,
+			]);
+			summary.comments[wasInserted(result) ? 'inserted' : 'skipped'] += 1;
+		}
+
+		const dependencySql = `INSERT INTO kernel_dependencies (${IMPORT_DEPENDENCY_COLUMNS.join(', ')})`
+			+ ` VALUES (${IMPORT_DEPENDENCY_COLUMNS.map(() => '?').join(', ')}) ON CONFLICT(id) DO NOTHING`;
+		for (const dependency of dependencies) {
+			if (!dependency || dependency.id == null
+				|| !existingIds.has(dependency.issue_id) || !existingIds.has(dependency.blocks_issue_id)) {
+				summary.dependencies.skipped += 1;
+				continue;
+			}
+			const result = runParams(runtime, db, dependencySql, [
+				dependency.id,
+				dependency.issue_id,
+				dependency.blocks_issue_id,
+				dependency.dependency_type ?? 'blocks',
+				dependency.created_at ?? now,
+			]);
+			summary.dependencies[wasInserted(result) ? 'inserted' : 'skipped'] += 1;
+		}
+
+		// Legacy activity log → kernel_events. No entity FK, so every record inserts; the
+		// deterministic id (ON CONFLICT DO NOTHING) makes re-migration idempotent.
+		const eventSql = `INSERT INTO kernel_events (${IMPORT_EVENT_COLUMNS.join(', ')})`
+			+ ` VALUES (${IMPORT_EVENT_COLUMNS.map(() => '?').join(', ')}) ON CONFLICT(id) DO NOTHING`;
+		for (const event of activityEvents) {
+			if (!event || event.id == null) { summary.events.skipped += 1; continue; }
+			const row = buildImportEventRow(event, now);
+			const result = runParams(runtime, db, eventSql, IMPORT_EVENT_COLUMNS.map(column => row[column]));
+			summary.events[wasInserted(result) ? 'inserted' : 'skipped'] += 1;
+		}
+
+		execSql(runtime, db, 'COMMIT;');
+	} catch (error) {
+		try {
+			execSql(runtime, db, 'ROLLBACK;');
+		} catch {
+			// A rollback failure must not mask the original import error.
+		}
+		throw error;
+	}
+	return summary;
+}
+
+// --- Project-memory read-model primitives -------------------------------------
+// kernel_memories is a Forge read model written DIRECTLY (NOT through the guarded-event
+// path), so these are plain synchronous SQL helpers. project-memory.js owns the memory
+// entry shape; here we (de)serialize the JSON columns and upsert by key. The driver
+// methods are synchronous so the (synchronous) project-memory facade can persist without
+// awaiting the async broker.initialize().
+const KERNEL_MEMORY_COLUMNS = Object.freeze([
+	'key',
+	'value_json',
+	'source_agent',
+	'scope',
+	'confidence',
+	'tags_json',
+	'supersedes_json',
+	'beads_refs_json',
+	'created_at',
+	'updated_at',
+]);
+
+function parseMemoryJsonColumn(raw, fallback) {
+	if (raw === null || raw === undefined || raw === '') return fallback;
+	try {
+		return JSON.parse(raw);
+	} catch {
+		return fallback;
+	}
+}
+
+// Map a stored row back to the memory entry shape. Optional fields are omitted when
+// unset (matches the legacy entry shape); tags and timestamp are always present. The
+// entry's logical `timestamp` is the mutable "as-of" time (updated_at), so re-writing a
+// key surfaces the latest write — matching the legacy single-timestamp behavior, where
+// every write refreshed the stored timestamp. created_at stays as immutable first-seen
+// provenance and is intentionally not part of the entry shape.
+function memoryRowToEntry(row) {
+	if (!row) return null;
+	const entry = {
+		key: row.key,
+		value: parseMemoryJsonColumn(row.value_json, row.value_json),
+		sourceAgent: row.source_agent,
+		tags: parseMemoryJsonColumn(row.tags_json, []),
+		timestamp: row.updated_at,
+	};
+	if (row.scope !== null && row.scope !== undefined) entry.scope = row.scope;
+	if (row.confidence !== null && row.confidence !== undefined) entry.confidence = Number(row.confidence);
+	const supersedes = parseMemoryJsonColumn(row.supersedes_json, undefined);
+	if (Array.isArray(supersedes)) entry.supersedes = supersedes;
+	const beadsRefs = parseMemoryJsonColumn(row.beads_refs_json, undefined);
+	if (Array.isArray(beadsRefs)) entry.beadsRefs = beadsRefs;
+	return entry;
+}
+
+function memoryEntryToRow(entry, now) {
+	const tags = Array.isArray(entry.tags) ? entry.tags : [];
+	return {
+		key: entry.key,
+		value_json: JSON.stringify(entry.value ?? null),
+		source_agent: entry.sourceAgent ?? entry['source-agent'] ?? '',
+		scope: entry.scope ?? null,
+		confidence: entry.confidence ?? null,
+		tags_json: JSON.stringify(tags),
+		supersedes_json: Array.isArray(entry.supersedes) ? JSON.stringify(entry.supersedes) : null,
+		beads_refs_json: Array.isArray(entry.beadsRefs) ? JSON.stringify(entry.beadsRefs) : null,
+		// created_at is first-seen provenance (kept across upserts); updated_at is the
+		// entry's logical timestamp (the "as-of" the read model surfaces). Both default to
+		// the wall clock when the caller omits a timestamp (e.g. a direct driver write).
+		created_at: entry.timestamp || now,
+		updated_at: entry.timestamp || now,
+	};
+}
+
+// Upsert by key: insert a fresh row, or refresh every value column on a key collision
+// while keeping the original created_at (only updated_at advances).
+function upsertMemoryRow(runtime, db, entry) {
+	const now = new Date().toISOString();
+	const row = memoryEntryToRow(entry, now);
+	const placeholders = KERNEL_MEMORY_COLUMNS.map(() => '?').join(', ');
+	runParams(
+		runtime,
+		db,
+		`INSERT INTO kernel_memories (${KERNEL_MEMORY_COLUMNS.join(', ')}) VALUES (${placeholders})
+			ON CONFLICT(key) DO UPDATE SET
+				value_json = excluded.value_json,
+				source_agent = excluded.source_agent,
+				scope = excluded.scope,
+				confidence = excluded.confidence,
+				tags_json = excluded.tags_json,
+				supersedes_json = excluded.supersedes_json,
+				beads_refs_json = excluded.beads_refs_json,
+				updated_at = excluded.updated_at`,
+		KERNEL_MEMORY_COLUMNS.map(column => row[column]),
+	);
+	return memoryRowToEntry(row);
+}
+
+function loadMemoryRow(runtime, db, key) {
+	const rows = allParams(runtime, db, 'SELECT * FROM kernel_memories WHERE key = ?', [key]);
+	return memoryRowToEntry(rows[0] || null);
+}
+
+function listMemoryRows(runtime, db) {
+	return allParams(runtime, db, 'SELECT * FROM kernel_memories ORDER BY key ASC').map(memoryRowToEntry);
+}
+
+// Token-AND LIKE search across key + value_json. Each whitespace-separated token must
+// appear (in either column); an empty query lists everything. Parameterized, so the
+// tokens never interpolate into SQL.
+function searchMemoryRows(runtime, db, query) {
+	const tokens = String(query ?? '').trim().split(/\s+/).filter(Boolean);
+	if (tokens.length === 0) {
+		return listMemoryRows(runtime, db);
+	}
+	const clauses = tokens.map(() => '(key LIKE ? OR value_json LIKE ?)').join(' AND ');
+	const params = tokens.flatMap(token => {
+		const like = `%${token}%`;
+		return [like, like];
+	});
+	return allParams(
+		runtime,
+		db,
+		`SELECT * FROM kernel_memories WHERE ${clauses} ORDER BY key ASC`,
+		params,
+	).map(memoryRowToEntry);
+}
+
+// Optional source_agent allow-list → a parameterized `WHERE source_agent IN (...)` clause.
+// Lets the default `recall` view show only human `remember` notes without loading and
+// filtering the whole table in JS. Returns { clause, params }; empty when no filter.
+function memoryAgentFilter(agents) {
+	if (!Array.isArray(agents) || agents.length === 0) {
+		return { clause: '', params: [] };
+	}
+	const placeholders = agents.map(() => '?').join(', ');
+	return { clause: ` WHERE source_agent IN (${placeholders})`, params: [...agents] };
+}
+
+// The newest `limit` entries by logical (as-of) timestamp — the default read model for
+// `recall` with no query. rowid breaks ties so same-timestamp rows are still deterministic.
+// An optional `agents` allow-list scopes the view (e.g. to human `remember` notes).
+function recentMemoryRows(runtime, db, limit, agents) {
+	const capped = Number.isInteger(limit) && limit > 0 ? limit : 20;
+	const { clause, params } = memoryAgentFilter(agents);
+	return allParams(
+		runtime,
+		db,
+		`SELECT * FROM kernel_memories${clause} ORDER BY updated_at DESC, rowid DESC LIMIT ?`,
+		[...params, capped],
+	).map(memoryRowToEntry);
+}
+
+// Total number of stored memories (optionally scoped by `agents`) — paired with
+// recentMemoryRows so `recall` can report "showing N of TOTAL" instead of silently truncating.
+function countMemoryRows(runtime, db, agents) {
+	const { clause, params } = memoryAgentFilter(agents);
+	const rows = allParams(runtime, db, `SELECT count(*) AS count FROM kernel_memories${clause}`, params);
+	return Number((rows[0] || {}).count) || 0;
+}
+
+// Turn a free-form query into an FTS5 MATCH expression: extract alphanumeric barewords,
+// quote each as a phrase (so an FTS operator token can never break the syntax), and AND
+// them together. Order-independent token-AND matching — "auth bug" matches a note holding
+// both tokens in any order. Returns '' when the query has no usable tokens.
+function buildMemoryFtsMatch(query) {
+	const tokens = String(query ?? '').match(/[\p{L}\p{N}]+/gu);
+	if (!tokens || tokens.length === 0) return '';
+	return tokens.map(token => `"${token}"`).join(' AND ');
+}
+
+// BM25 top-N recall over the kernel_memories_fts index (migration 008). Joins the FTS
+// rowid back to the memory row and orders by bm25 (lower = better match). An empty/tokenless
+// query falls back to recent entries so `recall` never returns a bare full dump.
+function searchMemoryRowsRanked(runtime, db, query, limit) {
+	const capped = Number.isInteger(limit) && limit > 0 ? limit : 20;
+	const match = buildMemoryFtsMatch(query);
+	if (!match) {
+		return recentMemoryRows(runtime, db, capped);
+	}
+	return allParams(
+		runtime,
+		db,
+		`SELECT m.* FROM kernel_memories m
+			JOIN kernel_memories_fts ON kernel_memories_fts.rowid = m.rowid
+			WHERE kernel_memories_fts MATCH ?
+			ORDER BY bm25(kernel_memories_fts)
+			LIMIT ?`,
+		[match, capped],
+	).map(memoryRowToEntry);
+}
+
+function closeDatabase(db) {
+	if (db && typeof db.close === 'function') {
+		db.close();
+	}
+}
+
+function createDriver(runtime, configuredDatabasePath) {
+	let db;
+	let openedDatabasePath;
+	let memorySchemaEnsured = false;
+
+	// kernel_memories is created by migration 005 through broker.initialize(), but the
+	// synchronous project-memory facade writes WITHOUT first running migrations. Lazily
+	// ensure the table (idempotent CREATE IF NOT EXISTS, rendered from the same migration)
+	// plus a busy_timeout for the second connection the issue backend may hold open.
+	function ensureMemorySchema(database) {
+		if (memorySchemaEnsured) return;
+		execSql(runtime, database, 'PRAGMA busy_timeout=5000;');
+		for (const statement of buildMemoryProjectionMigration().apply) {
+			execSql(runtime, database, statement);
+		}
+		// FTS5 recall index (migration 008): create the virtual table + sync triggers
+		// idempotently so a synchronous memory write stays indexed without a prior
+		// broker.initialize(). When the index is NEWLY created, rebuild once to backfill any
+		// rows written before it existed (a DB upgraded from before this feature, or rows the
+		// insights engine wrote straight to kernel_memories) — the sync triggers keep it
+		// current thereafter, so steady-state process starts skip the reindex.
+		//
+		// Staleness is detected by TABLE EXISTENCE (sqlite_master), never by count(*): on an
+		// external-content FTS5 table `count(*)` returns the CONTENT row count, not the
+		// indexed-doc count, so it can never reveal an un-backfilled index.
+		const ftsDdl = memoryFtsDdl();
+		const ftsExisted = Number(queryOne(
+			runtime,
+			database,
+			"SELECT count(*) AS count FROM sqlite_master WHERE type = 'table' AND name = 'kernel_memories_fts'",
+		).count) > 0;
+		execSql(runtime, database, ftsDdl.create);
+		for (const trigger of ftsDdl.triggers) {
+			execSql(runtime, database, trigger);
+		}
+		if (!ftsExisted) {
+			execSql(runtime, database, ftsDdl.rebuild);
+		}
+		memorySchemaEnsured = true;
+	}
+
+	function resolveDatabasePath(config) {
+		const brokerDatabasePath = config && config.databasePath;
+		if (configuredDatabasePath && brokerDatabasePath && configuredDatabasePath !== brokerDatabasePath) {
+			throw new Error([
+				'Kernel SQLite driver databasePath mismatch:',
+				`driver is configured for ${configuredDatabasePath}`,
+				`but broker config uses ${brokerDatabasePath}`,
+			].join(' '));
+		}
+		const databasePath = brokerDatabasePath || configuredDatabasePath;
+		if (!databasePath) {
+			throw new Error('Kernel SQLite driver requires a databasePath or broker config databasePath');
+		}
+		return databasePath;
+	}
+
+	function getDatabase(config) {
+		const databasePath = resolveDatabasePath(config);
+		if (!db) {
+			db = createDatabase(runtime, databasePath);
+			openedDatabasePath = databasePath;
+		} else if (openedDatabasePath !== databasePath) {
+			throw new Error(`Kernel SQLite driver is already open for ${openedDatabasePath}`);
+		}
+		return db;
+	}
+
+	return {
+		runtime: {
+			id: runtime.id,
+			databaseClassName: runtime.databaseClassName,
+			nativeCompileDependency: runtime.nativeCompileDependency,
+			experimental: runtime.experimental,
+		},
+		databasePath: configuredDatabasePath,
+		async exec(statement, config) {
+			execSql(runtime, getDatabase(config), statement);
+		},
+		async queryAll(statement, config) {
+			return queryAll(runtime, getDatabase(config), statement);
+		},
+		async issueOperation(operation, args = [], context = {}, config = {}) {
+			const database = getDatabase(config);
+			const READ_OPERATIONS = new Set(['ready', 'list', 'show', 'search', 'stats', 'blocked', 'stale', 'orphans', 'lint', 'children', 'owns', 'claims']);
+			if (READ_OPERATIONS.has(operation)) {
+				return runIssueReadOperation(runtime, database, operation, args, context);
+			}
+			// Mutations (create/update/close/comment/dep.add/dep.remove/claim/release) are
+			// implemented through the broker's guarded-event path in a later wave.
+			throw new Error(`Kernel SQLite driver issueOperation: mutation operation '${operation}' is not implemented yet (reads only)`);
+		},
+		// Git-style short-id support (kernel 9556660b): the candidate ids (+ titles)
+		// whose id starts with `prefix`. Parameterized LIKE with escaped wildcards;
+		// ordered by id ascending so an EXACT match (the shortest id sharing the
+		// prefix) always sorts first and is never pushed out by the limit. Consumed
+		// by the broker's issue-id prefix resolver, never by the contract directly.
+		async findIssueIdsByPrefix(prefix, limit = 6, _context = {}, config = {}) {
+			const escaped = String(prefix).replace(/[\\%_]/g, match => `\\${match}`);
+			return allParams(
+				runtime, getDatabase(config),
+				"SELECT id, title FROM kernel_issues WHERE id LIKE ? ESCAPE '\\' ORDER BY id ASC LIMIT ?",
+				[`${escaped}%`, limit],
+			);
+		},
+		// --- Event-store primitives (Wave 2) — composed by broker.runGuardedEvent.
+		// `context` is part of the broker contract but unused by these direct SQL
+		// reads/writes (prefixed `_` for eslint no-unused-vars).
+		async insertKernelEvent(event, _context = {}, config = {}) {
+			return insertKernelEventRow(runtime, getDatabase(config), event);
+		},
+		async loadKernelEntity(entityType, entityId, _context = {}, config = {}) {
+			return loadKernelEntityRow(runtime, getDatabase(config), entityType, entityId);
+		},
+		async listKernelEvents(entityType, entityId, _context = {}, config = {}) {
+			return listKernelEventRows(runtime, getDatabase(config), entityType, entityId);
+		},
+		async loadKernelEventByIdempotencyKey(idempotencyKey, _context = {}, config = {}) {
+			return loadKernelEventByIdempotencyKeyRow(runtime, getDatabase(config), idempotencyKey);
+		},
+		async insertKernelConflict(conflict, _context = {}, config = {}) {
+			return insertKernelConflictRow(runtime, getDatabase(config), conflict);
+		},
+		async enqueueKernelProjection(entry, _context = {}, config = {}) {
+			return enqueueKernelProjectionRow(runtime, getDatabase(config), entry);
+		},
+		// --- Projection-outbox read/update surface (Wave 5) — composed by the
+		// broker's projection-outbox methods, consumed by runJsonlProjectionConsumer.
+		// These never touch the append/CAS path; `context` is part of the broker
+		// contract but unused by these direct reads/writes (prefixed `_`).
+		async listProjectionOutbox(filter = {}, _context = {}, config = {}) {
+			return listProjectionOutboxRows(runtime, getDatabase(config), filter);
+		},
+		async loadProjectionModel(_context = {}, config = {}) {
+			return loadProjectionModelRows(runtime, getDatabase(config));
+		},
+		async markProjectionDelivered(ids = [], meta = {}, _context = {}, config = {}) {
+			return markProjectionDeliveredRows(runtime, getDatabase(config), ids, meta);
+		},
+		async recordProjectionFailure(record, _context = {}, config = {}) {
+			return recordProjectionFailureRows(runtime, getDatabase(config), record);
+		},
+		async deadLetterProjection(record, _context = {}, config = {}) {
+			return deadLetterProjectionRows(runtime, getDatabase(config), record);
+		},
+		async listKernelDependencies(scope, _context = {}, config = {}) {
+			return listKernelDependencyRows(runtime, getDatabase(config), scope);
+		},
+		// Claim-lease primitives (Wave 4) — composed by commitGuardedAccept /
+		// resolveClaimAcquisition. loadActiveKernelClaim feeds planClaimAcquisition;
+		// insertKernelClaim / updateKernelClaimState are the lease writes. The DB
+		// partial-UNIQUE index (idx_kernel_claims_active_lease) enforces the
+		// single-active-claim-per-issue invariant under concurrent writers.
+		async loadActiveKernelClaim(issueId, _context = {}, config = {}) {
+			return loadActiveKernelClaimRow(runtime, getDatabase(config), issueId);
+		},
+		async insertKernelClaim(claim, _context = {}, config = {}) {
+			return insertKernelClaimRow(runtime, getDatabase(config), claim);
+		},
+		async updateKernelClaimState(claimId, state, _context = {}, config = {}) {
+			return updateKernelClaimStateRow(runtime, getDatabase(config), claimId, state);
+		},
+		// commitGuardedAccept invokes this (typeof-guarded) INSIDE its BEGIN IMMEDIATE
+		// transaction to apply an accepted issue event to the authority tables. The
+		// returned summary ({id, revision, comment_id?}) flows back through
+		// runGuardedEvent's result so runIssueOperation can shape the mutation response.
+		async applyAcceptedIssueMutation(event, context = {}, config = {}) {
+			return applyAcceptedMutation(runtime, getDatabase(config), event, context);
+		},
+		// Faithful-import write path: insert a kernel records bundle ({ issues, comments,
+		// dependencies, events, activityEvents }) DIRECTLY into the authority tables,
+		// preserving each issue's original created_at/updated_at + terminal status (bypassing
+		// the now-stamping create/CAS path) and landing the legacy beads activity log in
+		// kernel_events. Idempotent + transactional. `context` is part of the driver contract
+		// but unused by this direct write (prefixed `_`).
+		async importIssues(records = {}, options = {}, _context = {}, config = {}) {
+			return importIssueRecords(runtime, getDatabase(config), records, options);
+		},
+		// --- Project-memory read model (written directly, not via the guarded path).
+		// Synchronous by design: the project-memory facade is synchronous, and these
+		// lazily ensure the kernel_memories table so a write never needs a prior
+		// (async) broker.initialize().
+		// --- Worktree-linkage registry (written directly, not via the guarded event
+		// path). Synchronous like the memory facade so `forge worktree create` and the
+		// synchronous orientation read can use them without a prior broker.initialize().
+		// registerWorktree requires the 007 columns (callers use a migrated driver);
+		// getWorktreeLinkage/listWorktrees tolerate a missing/empty table (safeAll) and
+		// return null/[] so orientation falls back to the folder heuristic.
+		registerWorktree(input, config = {}) {
+			return upsertWorktreeRow(runtime, getDatabase(config), input);
+		},
+		getWorktreeLinkage(filter = {}, config = {}) {
+			return loadWorktreeRowByPath(runtime, getDatabase(config), filter.path);
+		},
+		listWorktrees(filter = {}, config = {}) {
+			return listWorktreeRows(runtime, getDatabase(config), filter);
+		},
+		// --- Stage-run registry (f61601ab). Direct writes like the worktree registry
+		// (bypass the guarded event path), synchronous so a CLI verb / orientation read
+		// can use them without a prior async broker.initialize(). Idempotent per
+		// (issue_id, stage). getCurrentStage powers the real workflow-phase read.
+		recordStageRun(input, config = {}) {
+			return recordStageRunRow(runtime, getDatabase(config), input);
+		},
+		// Atomic complete(from)+start(to) in ONE transaction: a mid-transition failure
+		// rolls back both writes so `current_stage` never reflects a half-transition.
+		recordStageTransition(input, config = {}) {
+			return recordStageTransitionRow(runtime, getDatabase(config), input);
+		},
+		listStageRuns(filter = {}, config = {}) {
+			return listStageRunRows(runtime, getDatabase(config), filter.issue_id);
+		},
+		getCurrentStage(filter = {}, config = {}) {
+			return loadCurrentStageRunRow(runtime, getDatabase(config), filter.issue_id);
+		},
+		recordMemory(entry, config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return upsertMemoryRow(runtime, database, entry);
+		},
+		loadMemory(key, config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return loadMemoryRow(runtime, database, key);
+		},
+		searchMemories(query, config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return searchMemoryRows(runtime, database, query);
+		},
+		// BM25 top-N recall over the FTS5 index (token-AND). An empty query falls back to
+		// the newest `limit` entries so recall never returns a bare full dump.
+		searchMemoriesRanked(query, limit, config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return searchMemoryRowsRanked(runtime, database, query, limit);
+		},
+		// The newest `limit` entries (default recall with no query). `options.agents` scopes
+		// the read to a source_agent allow-list (e.g. human `remember` notes only).
+		recentMemories(limit, options = {}, config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return recentMemoryRows(runtime, database, limit, options.agents);
+		},
+		// Total stored memories (optionally scoped by `options.agents`) — lets recall report
+		// "showing N of TOTAL".
+		countMemories(options = {}, config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return countMemoryRows(runtime, database, options.agents);
+		},
+		listMemories(config = {}) {
+			const database = getDatabase(config);
+			ensureMemorySchema(database);
+			return listMemoryRows(runtime, database);
+		},
+		close() {
+			closeDatabase(db);
+			db = null;
+			openedDatabasePath = null;
+			memorySchemaEnsured = false;
+		},
+	};
+}
+
+function assertCapability(runtime, capability, detail) {
+	if (!detail.ok) {
+		throw new Error(`Builtin SQLite runtime ${runtime.id} failed ${capability} validation: ${detail.reason}`);
+	}
+	return true;
+}
+
+function validateWal(runtime, db) {
+	const row = queryOne(runtime, db, 'PRAGMA journal_mode=WAL;');
+	const mode = String(row.journal_mode || '').toLowerCase();
+	return { ok: mode === 'wal', reason: `journal_mode=${mode || 'unknown'}` };
+}
+
+function validateBusyTimeout(runtime, db) {
+	const row = queryOne(runtime, db, 'PRAGMA busy_timeout=5000;');
+	const timeout = Number(row.timeout);
+	return { ok: timeout === 5000, reason: `timeout=${Number.isNaN(timeout) ? 'unknown' : timeout}` };
+}
+
+function createProbeTableName(prefix) {
+	probeCounter += 1;
+	return `${prefix}_${process.pid}_${probeCounter}`;
+}
+
+function validateTransactions(runtime, db) {
+	const tableName = createProbeTableName('forge_transaction_probe');
+	let committed = false;
+	try {
+		execSql(runtime, db, [
+			'BEGIN IMMEDIATE;',
+			`CREATE TABLE ${tableName} (id INTEGER PRIMARY KEY, value TEXT NOT NULL);`,
+			`INSERT INTO ${tableName} (value) VALUES ('ok');`,
+			'COMMIT;',
+		].join('\n'));
+		committed = true;
+		const row = queryOne(runtime, db, `SELECT value FROM ${tableName} WHERE id = 1;`);
+		return { ok: row.value === 'ok', reason: `value=${row.value || 'missing'}` };
+	} catch (error) {
+		if (!committed) {
+			try {
+				execSql(runtime, db, 'ROLLBACK;');
+			} catch {
+				// Ignore rollback errors from runtimes that already closed the failed transaction.
+			}
+		}
+		return { ok: false, reason: error.message || String(error) };
+	} finally {
+		try {
+			execSql(runtime, db, `DROP TABLE IF EXISTS ${tableName};`);
+		} catch {
+			// Probe cleanup must not hide the original capability result.
+		}
+	}
+}
+
+function validateFts5(runtime, db) {
+	const tableName = createProbeTableName('forge_fts_probe');
+	try {
+		execSql(runtime, db, `CREATE VIRTUAL TABLE ${tableName} USING fts5(content);`);
+		execSql(runtime, db, `INSERT INTO ${tableName} (content) VALUES ('kernel sqlite driver');`);
+		const row = queryOne(runtime, db, `SELECT count(*) AS count FROM ${tableName} WHERE ${tableName} MATCH 'sqlite';`);
+		return { ok: Number(row.count) === 1, reason: `count=${row.count || 0}` };
+	} catch (error) {
+		return { ok: false, reason: error.message || String(error) };
+	} finally {
+		try {
+			execSql(runtime, db, `DROP TABLE IF EXISTS ${tableName};`);
+		} catch {
+			// Probe cleanup must not hide the original capability result.
+		}
+	}
+}
+
+function validateCheckpoint(runtime, db) {
+	try {
+		const row = queryOne(runtime, db, 'PRAGMA wal_checkpoint(TRUNCATE);');
+		return { ok: Number(row.busy) === 0, reason: `busy=${row.busy}` };
+	} catch (error) {
+		return { ok: false, reason: error.message || String(error) };
+	}
+}
+
+async function createBackup(runtime, db, backupPath) {
+	ensureFileBackedDatabaseDirectory(backupPath);
+	if (fs.existsSync(backupPath)) {
+		fs.rmSync(backupPath, { force: true });
+	}
+
+	if (runtime.id === 'node:sqlite') {
+		if (typeof runtime.module.backup === 'function') {
+			await runtime.module.backup(db, backupPath);
+			return;
+		}
+		if (typeof db.backup === 'function') {
+			await db.backup(backupPath);
+			return;
+		}
+		throw new Error('node:sqlite backup API is unavailable');
+	}
+
+	if (runtime.id === 'bun:sqlite') {
+		if (typeof db.serialize !== 'function') {
+			throw new Error('bun:sqlite Database.serialize() is unavailable');
+		}
+		fs.writeFileSync(backupPath, db.serialize());
+		return;
+	}
+
+	throw new Error(`Unsupported builtin SQLite runtime: ${runtime.id}`);
+}
+
+async function validateBackup(runtime, db, backupPath) {
+	const tableName = createProbeTableName('forge_backup_probe');
+	try {
+		execSql(runtime, db, `CREATE TABLE ${tableName} (id INTEGER PRIMARY KEY, value TEXT NOT NULL);`);
+		execSql(runtime, db, `INSERT INTO ${tableName} (value) VALUES ('ok');`);
+		await createBackup(runtime, db, backupPath);
+		const backupDb = createDatabase(runtime, backupPath);
+		try {
+			const row = queryOne(runtime, backupDb, `SELECT value FROM ${tableName} WHERE id = 1;`);
+			return {
+				ok: row.value === 'ok' && fs.existsSync(backupPath),
+				reason: `value=${row.value || 'missing'}`,
+			};
+		} finally {
+			closeDatabase(backupDb);
+		}
+	} catch (error) {
+		return { ok: false, reason: error.message || String(error) };
+	} finally {
+		try {
+			execSql(runtime, db, `DROP TABLE IF EXISTS ${tableName};`);
+		} catch {
+			// Probe cleanup must not hide the original capability result.
+		}
+	}
+}
+
+async function validateBuiltinSQLiteRuntimeDriver(options = {}, deps = {}) {
+	const runtime = options.runtime || selectBuiltinSQLiteRuntime(deps);
+	let tempDir = options.tempDir;
+	let ownsTempDir = false;
+	if (!tempDir && !options.databasePath && !options.backupPath) {
+		tempDir = fs.mkdtempSync(path.join(os.tmpdir(), 'forge-kernel-sqlite-'));
+		ownsTempDir = true;
+	}
+	const databasePath = options.databasePath
+		|| (tempDir ? path.join(tempDir, 'kernel.sqlite') : `${options.backupPath}.source.sqlite`);
+	const backupPath = options.backupPath
+		|| (tempDir ? path.join(tempDir, 'kernel.backup.sqlite') : `${databasePath}.backup.sqlite`);
+	let db;
+
+	try {
+		db = createDatabase(runtime, databasePath);
+		const capabilities = {
+			wal: assertCapability(runtime, 'WAL', validateWal(runtime, db)),
+			busyTimeout: assertCapability(runtime, 'busy_timeout', validateBusyTimeout(runtime, db)),
+			transactions: assertCapability(runtime, 'transaction', validateTransactions(runtime, db)),
+			fts5: assertCapability(runtime, 'FTS5', validateFts5(runtime, db)),
+			checkpoint: assertCapability(runtime, 'checkpoint', validateCheckpoint(runtime, db)),
+			backup: assertCapability(runtime, 'backup', await validateBackup(runtime, db, backupPath)),
+			nativeCompileDependency: runtime.nativeCompileDependency,
+		};
+
+		return {
+			runtime: {
+				id: runtime.id,
+				databaseClassName: runtime.databaseClassName,
+				nativeCompileDependency: runtime.nativeCompileDependency,
+				experimental: runtime.experimental,
+			},
+			databasePath,
+			backupPath,
+			capabilities,
+		};
+	} finally {
+		closeDatabase(db);
+		if (ownsTempDir) {
+			fs.rmSync(tempDir, { recursive: true, force: true });
+		}
+	}
+}
+
+function createBuiltinSQLiteDriver(options = {}, deps = {}) {
+	const runtime = options.runtime || selectBuiltinSQLiteRuntime(deps);
+	return createDriver(runtime, options.databasePath);
+}
+
+module.exports = {
+	BUILTIN_SQLITE_RUNTIME_ORDER,
+	CONFLICT_SIGNAL,
+	classifyConflictSignal,
+	createBuiltinSQLiteDriver,
+	requireSqliteRuntimeModule,
+	selectBuiltinSQLiteRuntime,
+	validateBuiltinSQLiteRuntimeDriver,
+};