@coffre/vault 0.10.0 → 0.10.1

package/dist/{vault-COqZ12ny.js → vault-B0YiPBgi.js}

@@ -1,155 +1,15 @@
 import { ACCESS_ACTIONS, POLICY_REVISION, checkpointMessage, checkpointVerifier, describeAccessFault, handsBack, policyRevision } from "@coffre/core/vault";
 import { DEK_BYTES, KEY_CHECK, KEY_CHECK_CONTEXT, KEY_CHECK_VALUE, KekBadClaimError, KekCancelledError, KekUnavailableError, LocalKekProvider } from "@coffre/core/kek";
-import { createHmac, hkdfSync, randomUUID, timingSafeEqual } from "node:crypto";
-import { tablesOf } from "@coffre/db";
+import { createHash, createHmac, hkdfSync, randomUUID, timingSafeEqual } from "node:crypto";
+import { prepared, tablesOf } from "@coffre/db";
 import { DEFAULT_POLICY, EVERYWHERE, EVERY_ENVIRONMENT, FIXED_ROLES, INSTANCE_ROLES, NOTHING, PROJECT_ONLY_PERMISSIONS, ROLES, ROLE_ID, UNWRITTEN_FORK_MS, allows, assignableToEnvironment, definitionProblem, givesService, grantKind, isBuiltinRole, isCredentialScope, isInstanceRole, isRole, isScope, managesService, mayManageAccess, normalDefinition, normalScope, ownsInstance, runsInstance, setsUpServices, unscoped, withinCredential } from "@coffre/core/access";
 import { GENESIS_HASH, deriveLogKey, verifyEntries } from "@coffre/core/audit";
 import { checkContext, ownerKey } from "@coffre/core/envelope";
 import { shownMember } from "@coffre/core/schemas";
-import { SNAPSHOT, clockMillis, engineOf, forUpdate, isUniqueViolation, tombstone, truth } from "@coffre/db/dialect";
+import { SNAPSHOT, clockMillis, engineOf, forUpdate, isUniqueViolation, isUnreachable, tombstone, truth } from "@coffre/db/dialect";
 import { accessEntriesAbout, everyProjectConversion, insertGrant, liveProjects, newestAccess, readGrants, reportStands, roleColumns, storedRole } from "@coffre/db/grants";
-import { LOOK_BACK, appendEntries, entryColumns, lockLogHead, newestAuthentic, newestVaultEntries, newestVaultSeq, withinBytes } from "@coffre/db/log";
-import { and, asc, count, desc, eq, gt, gte, inArray, isNotNull, isNull, lt, lte, or, sql } from "drizzle-orm";
-//#region src/accounting.ts
-const KEY_ACTIONS = /* @__PURE__ */ new Set([
-	"secret.read",
-	"key.wrap",
-	"key.rewrap"
-]);
-/**
-* Every key operation's intent and its outcomes, entry by entry, oldest
-* first, as the full check reads the vault's entries (`add`); then what is
-* still open (`result`). The chain can hold while a process died between an
-* intent and its outcomes: only a missed deadline is a fault.
-*/
-var KeyAccounting = class {
-	#intents = /* @__PURE__ */ new Map();
-	#ids = /* @__PURE__ */ new Set();
-	#fault = null;
-	add(entry) {
-		if (this.#fault !== null || entry.author !== "vault") return;
-		const broken = (reason) => {
-			this.#fault = {
-				ok: false,
-				failedAtSeq: Number(entry.seq),
-				reason
-			};
-		};
-		if (entry.action === "key.intent") {
-			const parsed = parseIntent(entry);
-			if (typeof parsed === "string") return broken(parsed);
-			if (this.#ids.has(parsed.intentId)) return broken("key intent repeats an operation identity");
-			this.#ids.add(parsed.intentId);
-			if (parsed.keys.length > 0) this.#intents.set(entry.seq, {
-				...parsed,
-				entry,
-				seen: /* @__PURE__ */ new Set()
-			});
-		} else if (KEY_ACTIONS.has(entry.action) && entry.relatedSeq !== null) {
-			const parsed = parseOutcome(entry);
-			if (typeof parsed === "string") return broken(parsed);
-			const intent = this.#intents.get(parsed.relatedSeq);
-			for (const outcome of parsed.items) {
-				const key = intent?.keys[outcome.item];
-				if (intent === void 0 || key === void 0 || intent.seen.has(outcome.item)) return broken("key outcome does not identify one item of its intent");
-				if (parsed.intentId !== intent.intentId || entry.actor !== intent.entry.actor || entry.action !== intent.operation) return broken("key outcome belongs to another operation");
-				if (outcome.secretId !== key.secretId || outcome.version !== key.version || outcome.subject !== key.subject) return broken("key outcome does not match its intended secret");
-				intent.seen.add(outcome.item);
-			}
-			if (intent !== void 0 && intent.seen.size === intent.keys.length) this.#intents.delete(intent.entry.seq);
-		}
-	}
-	/** The first fault, or the batches still under way at `at`: live calls can finish after the snapshot. */
-	result(at) {
-		if (this.#fault !== null) return this.#fault;
-		const intents = [...this.#intents.values()];
-		const overdue = intents.filter((intent) => intent.expiresAt <= at).sort((a, b) => a.expiresAt - b.expiresAt);
-		if (overdue.length === 0) return {
-			ok: true,
-			pending: intents.length
-		};
-		const reason = overdue.map((intent) => {
-			const missing = intent.keys.length - intent.seen.size;
-			return `key intent ${intent.intentId} is overdue: ${missing} of ${intent.keys.length} outcomes missing`;
-		}).join("; ");
-		return {
-			ok: false,
-			failedAtSeq: Number(overdue[0].entry.seq),
-			reason
-		};
-	}
-};
-function parseIntent(entry) {
-	const detail = payload(entry.metadata);
-	if (detail === null) return "key intent has no valid accounting payload";
-	const { intent, operation, expiresAt } = detail;
-	if (typeof intent !== "string") return "key intent has no operation identity";
-	if (typeof operation !== "string" || !KEY_ACTIONS.has(operation)) return "key intent has an invalid operation";
-	if (typeof expiresAt !== "number" || !Number.isSafeInteger(expiresAt) || expiresAt < entry.occurredAt) return "key intent has no valid deadline";
-	if (!Array.isArray(detail.keys)) return "key intent has no valid item list";
-	const keys = [];
-	for (const [index, value] of detail.keys.entries()) {
-		const key = record(value);
-		if (key === null || key.item !== index) return "key intent items are not numbered in order";
-		const { secretId, version, subject } = key;
-		if (typeof secretId !== "string" || typeof subject !== "string") return "key intent item has no secret identity";
-		if (typeof version !== "number" || !Number.isSafeInteger(version) || version < 1) return "key intent item has no valid version";
-		keys.push({
-			item: index,
-			secretId,
-			version,
-			subject
-		});
-	}
-	return {
-		intentId: intent,
-		operation,
-		expiresAt,
-		keys
-	};
-}
-function parseOutcome(entry) {
-	const detail = payload(entry.metadata);
-	if (detail === null) return "key outcome has no valid accounting payload";
-	const { intent } = detail;
-	if (typeof intent !== "string" || entry.relatedSeq === null) return "key outcome has no intent identity";
-	const many = detail.secrets;
-	if (many !== void 0 && (!Array.isArray(many) || many.length === 0)) return "key outcome has no valid item list";
-	const listed = many === void 0 ? [{
-		...detail,
-		secretId: entry.secretId ?? detail.secretId
-	}] : many.map(record);
-	const items = [];
-	for (const one of listed) {
-		if (one === null) return "key outcome has no valid item list";
-		const { item, secretId, version, subject } = one;
-		if (typeof item !== "number" || !Number.isSafeInteger(item) || item < 0) return "key outcome has no valid item number";
-		if (typeof secretId !== "string" || typeof subject !== "string") return "key outcome has no secret identity";
-		if (typeof version !== "number" || !Number.isSafeInteger(version) || version < 1) return "key outcome has no valid version";
-		items.push({
-			item,
-			secretId,
-			version,
-			subject
-		});
-	}
-	return {
-		intentId: intent,
-		relatedSeq: entry.relatedSeq,
-		items
-	};
-}
-function payload(text) {
-	try {
-		return record(JSON.parse(text));
-	} catch {
-		return null;
-	}
-}
-function record(value) {
-	return value !== null && typeof value === "object" && !Array.isArray(value) ? value : null;
-}
-//#endregion
+import { appendEntries, entryColumns, lockLogHead, missingEntry, newestAuthentic, newestVaultEntries, newestVaultSeq, withinBytes } from "@coffre/db/log";
+import { and, asc, desc, eq, gt, gte, inArray, isNotNull, isNull, lt, lte, or, sql } from "drizzle-orm";
 //#region src/checkpoint.ts
 const PKCS8_ED25519 = [
 	48,
@@ -193,10 +53,10 @@ async function boundLockWaits(tx, ms) {
 }
 /** The database's clock, now. */
 async function now(db) {
-	const { auditChainHead } = tablesOf(db);
-	const [{ at }] = await db.select({ at: clockMillis(db) }).from(auditChainHead);
+	const [{ at }] = await clock(db);
 	return at;
 }
+const clock = prepared((db) => db.select({ at: clockMillis(db) }).from(tablesOf(db).auditChainHead));
 function memberColumns(db) {
 	const { vaultMembers } = tablesOf(db);
 	return {
@@ -234,10 +94,13 @@ function storedChange(change) {
 	};
 }
 async function member(db, principal) {
-	const { vaultMembers } = tablesOf(db);
-	const [row] = await db.select(memberColumns(db)).from(vaultMembers).where(eq(vaultMembers.principal, principal));
+	const [row] = await memberRow(db, { principal });
 	return row === void 0 ? void 0 : memberOf(row);
 }
+const memberRow = prepared((db) => {
+	const { vaultMembers } = tablesOf(db);
+	return db.select(memberColumns(db)).from(vaultMembers).where(eq(vaultMembers.principal, sql.placeholder("principal")));
+});
 async function allMembers(db) {
 	const { vaultMembers } = tablesOf(db);
 	return (await db.select(memberColumns(db)).from(vaultMembers).orderBy(asc(vaultMembers.principal))).map(memberOf);
@@ -366,11 +229,17 @@ const RELEASE = "secret.read";
 * several (`secrets`), a read logged once per place.
 */
 async function releasesSince(db, principal, after) {
-	const { auditLog } = tablesOf(db);
-	const listed = engineOf(db) === "postgres" ? sql`jsonb_array_length((${auditLog.metadata})::jsonb -> 'secrets')` : sql`json_array_length(${auditLog.metadata}, '$.secrets')`;
-	const [{ n }] = await db.select({ n: sql`SUM(COALESCE(${listed}, 1))` }).from(auditLog).where(and(eq(auditLog.author, "vault"), eq(auditLog.actor, principal), eq(auditLog.action, RELEASE), eq(auditLog.decision, "allow"), gt(auditLog.occurredAt, after)));
+	const [{ n }] = await released(db, {
+		principal,
+		after
+	});
 	return Number(n ?? 0);
 }
+const released = prepared((db) => {
+	const { auditLog } = tablesOf(db);
+	const listed = engineOf(db) === "postgres" ? sql`jsonb_array_length((${auditLog.metadata})::jsonb -> 'secrets')` : sql`json_array_length(${auditLog.metadata}, '$.secrets')`;
+	return db.select({ n: sql`SUM(COALESCE(${listed}, 1))` }).from(auditLog).where(and(eq(auditLog.author, "vault"), eq(auditLog.actor, sql.placeholder("principal")), eq(auditLog.action, RELEASE), eq(auditLog.decision, "allow"), gt(auditLog.occurredAt, sql.placeholder("after"))));
+});
 /** Rows of the log as the chain's codec reads them: `author` and `decision` are checked by the table. */
 function stored(rows) {
 	return rows;
@@ -405,16 +274,6 @@ async function hashesAt(db, seqs) {
 }
 /** How many entries' hashes one query asks for: a checkpoint every five minutes is tens of thousands of a year. */
 const HASHES_AT_ONCE = 5e3;
-/**
-* Whether every entry from the first through `seq` is there. Seqs are the
-* primary key, so the count is `seq + 1` exactly when none is missing: one
-* pass over the key's index, never the entries.
-*/
-async function complete(db, seq) {
-	const { auditLog } = tablesOf(db);
-	const [{ n }] = await db.select({ n: count() }).from(auditLog).where(and(gte(auditLog.seq, 0n), lte(auditLog.seq, seq)));
-	return BigInt(n) === seq + 1n;
-}
 /** The entry at `seq`'s hash, or undefined when there is none. */
 async function hashAt(db, seq) {
 	const { auditLog } = tablesOf(db);
@@ -529,6 +388,51 @@ async function latestVaultEntry(db, actions) {
 	const [row] = await db.select(entryColumns(db)).from(auditLog).where(and(eq(auditLog.author, "vault"), inArray(auditLog.action, [...actions]), eq(auditLog.decision, "allow"))).orderBy(desc(auditLog.seq)).limit(1);
 	return row === void 0 ? void 0 : stored([row])[0];
 }
+/**
+* The vault's newest checkpoint that keeps a tally, allowed, or undefined:
+* one written since 0.10.1, which names the last entry of the prefix it
+* signs as related (`related_seq`); those before name none.
+*/
+async function latestTallied(db) {
+	const { auditLog } = tablesOf(db);
+	const [row] = await db.select(entryColumns(db)).from(auditLog).where(and(eq(auditLog.author, "vault"), eq(auditLog.action, "audit.checkpoint"), eq(auditLog.decision, "allow"), isNotNull(auditLog.relatedSeq))).orderBy(desc(auditLog.seq)).limit(1);
+	return row === void 0 ? void 0 : stored([row])[0];
+}
+/** The vault's newest `audit.checkpoint` entry, signed or refused, or undefined. */
+async function newestCheckpointEntry(db) {
+	const { auditLog } = tablesOf(db);
+	const [row] = await db.select(entryColumns(db)).from(auditLog).where(and(eq(auditLog.author, "vault"), eq(auditLog.action, "audit.checkpoint"))).orderBy(desc(auditLog.seq)).limit(1);
+	return row === void 0 ? void 0 : stored([row])[0];
+}
+/**
+* The vault's checkpoints that keep a tally after entry `after` and through
+* `through`, oldest first, whole: as many as `BATCH_BYTES` of what they say
+* holds, but always one. A reader asks again after the last.
+*/
+async function talliedWithin(db, after, through, limit) {
+	const { auditLog } = tablesOf(db);
+	const tallied = and(eq(auditLog.author, "vault"), eq(auditLog.action, "audit.checkpoint"), eq(auditLog.decision, "allow"), isNotNull(auditLog.relatedSeq), gt(auditLog.seq, after), lte(auditLog.seq, through));
+	const batch = await withinBytes(db, tallied, limit);
+	if (batch === null) return [];
+	return stored(await db.select(entryColumns(db)).from(auditLog).where(and(tallied, gte(auditLog.seq, batch.from), lte(auditLog.seq, batch.to))).orderBy(asc(auditLog.seq)));
+}
+/** The vault's newest refusal of `action` with `code` after entry `after`, or undefined: one range of the (author, action, seq) index. */
+async function newestRefusal(db, action, code, after) {
+	const { auditLog } = tablesOf(db);
+	const [row] = await db.select(entryColumns(db)).from(auditLog).where(and(eq(auditLog.author, "vault"), eq(auditLog.action, action), gt(auditLog.seq, after), eq(auditLog.decision, "deny"), eq(auditLog.code, code))).orderBy(desc(auditLog.seq)).limit(1);
+	return row === void 0 ? void 0 : stored([row])[0];
+}
+/** Up to `limit` of the vault's checkpoints that keep a tally after entry `after`, oldest first: each one's entry, and the last entry it signs. */
+async function talliedAfter(db, after, limit) {
+	const { auditLog } = tablesOf(db);
+	return (await db.select({
+		seq: auditLog.seq,
+		signs: auditLog.relatedSeq
+	}).from(auditLog).where(and(eq(auditLog.author, "vault"), eq(auditLog.action, "audit.checkpoint"), eq(auditLog.decision, "allow"), isNotNull(auditLog.relatedSeq), gt(auditLog.seq, after))).orderBy(asc(auditLog.seq)).limit(limit)).map(({ seq, signs }) => ({
+		seq,
+		signs
+	}));
+}
 /** The vault's newest allowed access entry about each member who has one. */
 async function newestAccessEntries(db) {
 	const { auditLog } = tablesOf(db);
@@ -621,86 +525,158 @@ async function versions(db, ids) {
 function vaultLogKey(signingKey) {
 	return deriveLogKey("vault", signingKey);
 }
-/** Before the first entry: nothing verified yet. */
-const UNVERIFIED = {
-	nextSeq: 0n,
-	hash: GENESIS_HASH,
-	vaultEntries: 0,
-	vaultKeys: []
+/** Before the first entry. */
+const START = {
+	seq: -1n,
+	hash: GENESIS_HASH
 };
-/** The further of two anchors, when two calls verified at once. */
+/** The further of two positions, when two calls walked at once. */
 function further(a, b) {
-	return b.nextSeq > a.nextSeq ? b : a;
+	return b.seq > a.seq ? b : a;
 }
 /** Entries read at once, at most, and no more than `BATCH_BYTES` of what they say: well within a Worker's memory, and a fifth of the round trips of 1000. */
 const VERIFY_BATCH = 5e3;
 /**
-* Check the chain, a batch in memory at a time, and return where it is now
-* verified to. Three parts:
-*
-* - `shown`, the page a reader is looking at: each entry against its own
-*   hash and MAC;
-* - `anchor`, the head at the last check: still there, unchanged. A rewrite
-*   of anything before it, chained again to hide, changes its hash;
-* - every entry after the anchor, or from the first.
+* Walk the chain on from `from`, a batch in memory at a time, through `to`
+* or the log's last entry, and no more than `limit` entries: every link and
+* hash recomputed, each of the vault's entries by its MAC, its keys moving
+* only forward, and each fed to `walk`. Where it got to, and whether that
+* is as far as it was to go: a walk cut short by `limit` goes on from there
+* another time.
 *
-* So a view rehashes only what is new since the last one. What it leaves
-* out is an entry before the anchor edited in place, not chained again, and
-* not on the page: a full check, which starts from `UNVERIFIED`, finds that,
-* as does the first view after a start, which has no anchor. `onBatch` sees
-* each batch once it has verified, for checks that read the same entries.
+* It takes `from` as given: whether the log still holds it is the caller's
+* to check, with the other heads it must hold, in one read.
 */
-async function verifyChain(db, logKeys, shown, anchor, onBatch = () => {}) {
-	const broken = (failedAtSeq, reason) => ({
-		verification: {
-			ok: false,
-			failedAtSeq: Number(failedAtSeq),
-			reason: withCause(reason)
-		},
-		anchor
-	});
-	const keys = {
-		keys: logKeys,
-		chainOnly: ["app"]
-	};
-	for (const row of [...shown].sort((a, b) => a.seq < b.seq ? -1 : 1)) {
-		const result = verifyEntries([row], {
-			...keys,
-			startSeq: row.seq,
-			startPrevHash: row.prevHash
+async function rehash(db, logKeys, from, walk, { to, limit = Infinity }) {
+	let at = from;
+	for (let left = limit;;) {
+		if (to !== void 0 && at.seq >= to) return {
+			ok: true,
+			at,
+			done: true
+		};
+		if (left <= 0) return {
+			ok: true,
+			at,
+			done: !(await entriesFrom(db, at.seq + 1n, 1)).some((entry) => to === void 0 || entry.seq <= to)
+		};
+		let batch = await entriesFrom(db, at.seq + 1n, Math.min(VERIFY_BATCH, left));
+		if (to !== void 0) batch = batch.filter((entry) => entry.seq <= to);
+		if (batch.length === 0) return {
+			ok: true,
+			at,
+			done: to === void 0
+		};
+		const result = verifyEntries(batch, {
+			keys: logKeys,
+			chainOnly: ["app"],
+			startSeq: at.seq + 1n,
+			startPrevHash: at.hash
 		});
-		if (!result.ok) return broken(result.failedAtSeq, result.reason);
+		if (!result.ok) return {
+			ok: false,
+			failedAtSeq: Number(result.failedAtSeq),
+			reason: withCause(result.reason)
+		};
+		for (const entry of batch) {
+			const moved = entry.author === "vault" ? walk.add(entry, logKeys[0].keyId) : null;
+			if (moved !== null) return {
+				ok: false,
+				failedAtSeq: Number(moved.failedAtSeq),
+				reason: moved.reason
+			};
+		}
+		at = {
+			seq: result.nextSeq - 1n,
+			hash: result.head
+		};
+		left -= batch.length;
 	}
-	if (anchor.nextSeq > 0n && !(await hashAt(db, anchor.nextSeq - 1n))?.equals(anchor.hash)) return broken(anchor.nextSeq - 1n, "changed since the vault last verified it");
-	let verified = anchor;
-	for (;;) {
-		const batch = await entriesFrom(db, verified.nextSeq, VERIFY_BATCH);
+}
+/**
+* The chain again from `from`, through `to` and no more than `limit`
+* entries: each hash recomputed from its entry and each link checked, and
+* nothing else, so a stretch costs a hash an entry. What a checkpoint does
+* in the background to the prefixes signed before (`#scrub` in vault.ts):
+* each entry's MAC was checked when it was signed over, and its hash pins
+* it since, so all that can change behind a signed prefix and keep the
+* chain is an entry edited in place, its stored hash left, which its hash
+* finds.
+*/
+async function relink(db, from, to, limit) {
+	let at = from;
+	while (at.seq < to && limit > 0) {
+		const batch = (await entriesFrom(db, at.seq + 1n, Math.min(VERIFY_BATCH, limit))).filter((entry) => entry.seq <= to);
 		if (batch.length === 0) break;
 		const result = verifyEntries(batch, {
-			...keys,
-			startSeq: verified.nextSeq,
-			startPrevHash: verified.hash
+			keys: [],
+			chainOnly: ["app", "vault"],
+			startSeq: at.seq + 1n,
+			startPrevHash: at.hash
 		});
-		if (!result.ok) return broken(result.failedAtSeq, result.reason);
-		const moved = forward(batch, verified.vaultKeys, logKeys[0].keyId);
-		if ("failedAtSeq" in moved) return broken(moved.failedAtSeq, moved.reason);
-		onBatch(batch);
-		verified = {
-			nextSeq: result.nextSeq,
-			hash: result.head,
-			vaultEntries: verified.vaultEntries + result.authenticated,
-			vaultKeys: moved.keys
+		if (!result.ok) return {
+			ok: false,
+			failedAtSeq: Number(result.failedAtSeq),
+			reason: result.reason
 		};
+		at = {
+			seq: result.nextSeq - 1n,
+			hash: result.head
+		};
+		limit -= batch.length;
 	}
 	return {
-		verification: {
-			ok: true,
-			entries: verified.vaultEntries
-		},
-		anchor: verified
+		ok: true,
+		at
 	};
 }
 /**
+* The vault's own entries after `after`, through `to` or its last, no more
+* than `limit` of them, oldest first: each against its own hash, and by its
+* MAC, over the link it names, its keys moving only forward, each fed to
+* `walk`. The links between entries are the caller's to recompute, as the
+* app does over the same stretch. The last it read, and whether that is as
+* far as it was to go.
+*/
+async function ownEntries(db, logKeys, after, walk, { to, limit = Infinity }) {
+	for (let left = limit;;) {
+		if (left <= 0) return {
+			ok: true,
+			at: after,
+			done: !(await vaultEntriesAfter(db, after, 1)).some((entry) => to === void 0 || entry.seq <= to)
+		};
+		let batch = await vaultEntriesAfter(db, after, Math.min(VERIFY_BATCH, left));
+		if (to !== void 0) batch = batch.filter((entry) => entry.seq <= to);
+		if (batch.length === 0) return {
+			ok: true,
+			at: after,
+			done: true
+		};
+		for (const entry of batch) {
+			const result = verifyEntries([entry], {
+				startSeq: entry.seq,
+				startPrevHash: entry.prevHash,
+				keys: logKeys
+			});
+			if (!result.ok) return {
+				ok: false,
+				failedAtSeq: Number(result.failedAtSeq),
+				reason: withCause(result.reason)
+			};
+		}
+		for (const entry of batch) {
+			const moved = walk.add(entry, logKeys[0].keyId);
+			if (moved !== null) return {
+				ok: false,
+				failedAtSeq: Number(moved.failedAtSeq),
+				reason: moved.reason
+			};
+		}
+		after = batch[batch.length - 1].seq;
+		left -= batch.length;
+	}
+}
+/**
 * The vault's keys only move forward. Once its entries move from one key to
 * the next, the one before writes no more; once they reach `current`, the
 * key it writes with now, no other key writes again. So a key it replaced,
@@ -963,59 +939,429 @@ function rowKey(signingKey) {
 	return Buffer.from(hkdfSync("sha256", signingKey, /* @__PURE__ */ new Uint8Array(0), "coffre.vault.rows.v1", 32));
 }
 /**
-* A member's grants as the MAC covers them: each one's place, role, end and
-* grant, as a sorted set. A grant is kept by what its row names first: its
-* environment, its project, or neither, which is a grant on every project
-* of 0.4, with the slug it covers, or null, until the vault replaces it. A member who holds none of those has the
-* set, and so the MAC, they had before there were any.
+* A member's grants as the MAC covers them: each one's place, role, end and
+* grant, as a sorted set. A grant is kept by what its row names first: its
+* environment, its project, or neither, which is a grant on every project
+* of 0.4, with the slug it covers, or null, until the vault replaces it. A member who holds none of those has the
+* set, and so the MAC, they had before there were any.
+*/
+function grantSet(grants) {
+	return grants.map((grant) => [
+		grant.environmentId !== null ? "environment" : grant.projectId !== null ? "project" : "every-project",
+		grant.environmentId ?? grant.projectId ?? grant.environmentSlug,
+		grant.role,
+		grant.expiresAt,
+		grant.grantedAt,
+		grant.grantedBy
+	]).map((tuple) => JSON.stringify(tuple)).sort();
+}
+/** Whether two reads of a member's grants are the same set, as the MAC sees them. */
+function sameGrants(a, b) {
+	const [x, y] = [grantSet(a), grantSet(b)];
+	return x.length === y.length && x.every((tuple, i) => tuple === y[i]);
+}
+/**
+* A member's instance role and its scope, as the MAC covers them: as 0.4
+* did, whether they are an owner, for a Member or an Admin everywhere, so
+* that every row 0.4 sealed holds as it is; otherwise the role and the
+* scope, which no row of 0.4 can match.
+*/
+function standing(member) {
+	const scope = normalScope(member.scope);
+	if (unscoped(scope) && (member.role === "member" || member.role === "admin")) return member.role === "admin";
+	return [member.role, scope];
+}
+function memberMac(key, member, grants) {
+	const held = grantSet(grants);
+	const tuple = [
+		"coffre.vault.member.v1",
+		member.principal,
+		member.status,
+		standing(member),
+		member.generation,
+		member.accessSeq.toString(),
+		member.createdAt,
+		member.createdBy,
+		member.statusChangedAt,
+		member.statusChangedBy,
+		held
+	];
+	return createHmac("sha256", key).update(JSON.stringify(tuple)).digest();
+}
+/** Whether `member`'s MAC is the vault's, over this row and these grants. */
+function sealed(key, member, grants) {
+	const expected = memberMac(key, member, grants);
+	return member.mac.length === expected.length && timingSafeEqual(member.mac, expected);
+}
+//#endregion
+//#region src/accounting.ts
+const KEY_ACTIONS = /* @__PURE__ */ new Set([
+	"secret.read",
+	"key.wrap",
+	"key.rewrap"
+]);
+/**
+* Every key operation's intent and its outcomes, entry by entry, oldest
+* first, as a walk reads the vault's entries (`add`); then what is still
+* open (`result`). The chain can hold while a process died between an
+* intent and its outcomes: only a missed deadline is a fault.
+*
+* A walk resumes from a checkpoint's `state()`: the batches open there, and
+* nothing of those that closed. So an intent's identity is checked against
+* those still open and those since, not every one the log ever held: a
+* closed batch takes no more outcomes in any case, since each names its
+* intent's entry.
+*/
+var KeyAccounting = class {
+	#intents = /* @__PURE__ */ new Map();
+	#ids = /* @__PURE__ */ new Set();
+	#fault = null;
+	constructor(from = {
+		intents: [],
+		fault: null
+	}) {
+		for (const { seq, seen, ...open } of from.intents) {
+			this.#intents.set(BigInt(seq), {
+				...open,
+				seq: BigInt(seq),
+				seen: new Set(seen)
+			});
+			this.#ids.add(open.intentId);
+		}
+		this.#fault = from.fault === null ? null : {
+			ok: false,
+			...from.fault
+		};
+	}
+	/** Where it stands, to resume from: the batches open, oldest first. */
+	state() {
+		return {
+			intents: [...this.#intents.values()].sort((a, b) => a.seq < b.seq ? -1 : 1).map(({ seq, seen, ...open }) => ({
+				...open,
+				seq: Number(seq),
+				seen: [...seen].sort((a, b) => a - b)
+			})),
+			fault: this.#fault === null ? null : {
+				failedAtSeq: this.#fault.failedAtSeq,
+				reason: this.#fault.reason
+			}
+		};
+	}
+	add(entry) {
+		if (this.#fault !== null || entry.author !== "vault") return;
+		const broken = (reason) => {
+			this.#fault = {
+				ok: false,
+				failedAtSeq: Number(entry.seq),
+				reason
+			};
+		};
+		if (entry.action === "key.intent") {
+			const parsed = parseIntent(entry);
+			if (typeof parsed === "string") return broken(parsed);
+			if (this.#ids.has(parsed.intentId)) return broken("key intent repeats an operation identity");
+			this.#ids.add(parsed.intentId);
+			if (parsed.keys.length > 0) this.#intents.set(entry.seq, {
+				...parsed,
+				seq: entry.seq,
+				actor: entry.actor,
+				seen: /* @__PURE__ */ new Set()
+			});
+		} else if (KEY_ACTIONS.has(entry.action) && entry.relatedSeq !== null) {
+			const parsed = parseOutcome(entry);
+			if (typeof parsed === "string") return broken(parsed);
+			const intent = this.#intents.get(parsed.relatedSeq);
+			for (const outcome of parsed.items) {
+				const key = intent?.keys[outcome.item];
+				if (intent === void 0 || key === void 0 || intent.seen.has(outcome.item)) return broken("key outcome does not identify one item of its intent");
+				if (parsed.intentId !== intent.intentId || entry.actor !== intent.actor || entry.action !== intent.operation) return broken("key outcome belongs to another operation");
+				if (outcome.secretId !== key.secretId || outcome.version !== key.version || outcome.subject !== key.subject) return broken("key outcome does not match its intended secret");
+				intent.seen.add(outcome.item);
+			}
+			if (intent !== void 0 && intent.seen.size === intent.keys.length) this.#intents.delete(intent.seq);
+		}
+	}
+	/** The first fault, or the batches still under way at `at`: live calls can finish after the snapshot. */
+	result(at) {
+		if (this.#fault !== null) return this.#fault;
+		const intents = [...this.#intents.values()];
+		const overdue = intents.filter((intent) => intent.expiresAt <= at).sort((a, b) => a.expiresAt - b.expiresAt);
+		if (overdue.length === 0) return {
+			ok: true,
+			pending: intents.length
+		};
+		const reason = overdue.map((intent) => {
+			const missing = intent.keys.length - intent.seen.size;
+			return `key intent ${intent.intentId} is overdue: ${missing} of ${intent.keys.length} outcomes missing`;
+		}).join("; ");
+		return {
+			ok: false,
+			failedAtSeq: Number(overdue[0].seq),
+			reason
+		};
+	}
+};
+function parseIntent(entry) {
+	const detail = payload(entry.metadata);
+	if (detail === null) return "key intent has no valid accounting payload";
+	const { intent, operation, expiresAt } = detail;
+	if (typeof intent !== "string") return "key intent has no operation identity";
+	if (typeof operation !== "string" || !KEY_ACTIONS.has(operation)) return "key intent has an invalid operation";
+	if (typeof expiresAt !== "number" || !Number.isSafeInteger(expiresAt) || expiresAt < entry.occurredAt) return "key intent has no valid deadline";
+	if (!Array.isArray(detail.keys)) return "key intent has no valid item list";
+	const keys = [];
+	for (const [index, value] of detail.keys.entries()) {
+		const key = record(value);
+		if (key === null || key.item !== index) return "key intent items are not numbered in order";
+		const { secretId, version, subject } = key;
+		if (typeof secretId !== "string" || typeof subject !== "string") return "key intent item has no secret identity";
+		if (typeof version !== "number" || !Number.isSafeInteger(version) || version < 1) return "key intent item has no valid version";
+		keys.push({
+			item: index,
+			secretId,
+			version,
+			subject
+		});
+	}
+	return {
+		intentId: intent,
+		operation,
+		expiresAt,
+		keys
+	};
+}
+function parseOutcome(entry) {
+	const detail = payload(entry.metadata);
+	if (detail === null) return "key outcome has no valid accounting payload";
+	const { intent } = detail;
+	if (typeof intent !== "string" || entry.relatedSeq === null) return "key outcome has no intent identity";
+	const many = detail.secrets;
+	if (many !== void 0 && (!Array.isArray(many) || many.length === 0)) return "key outcome has no valid item list";
+	const listed = many === void 0 ? [{
+		...detail,
+		secretId: entry.secretId ?? detail.secretId
+	}] : many.map(record);
+	const items = [];
+	for (const one of listed) {
+		if (one === null) return "key outcome has no valid item list";
+		const { item, secretId, version, subject } = one;
+		if (typeof item !== "number" || !Number.isSafeInteger(item) || item < 0) return "key outcome has no valid item number";
+		if (typeof secretId !== "string" || typeof subject !== "string") return "key outcome has no secret identity";
+		if (typeof version !== "number" || !Number.isSafeInteger(version) || version < 1) return "key outcome has no valid version";
+		items.push({
+			item,
+			secretId,
+			version,
+			subject
+		});
+	}
+	return {
+		intentId: intent,
+		relatedSeq: entry.relatedSeq,
+		items
+	};
+}
+function payload(text) {
+	try {
+		return record(JSON.parse(text));
+	} catch {
+		return null;
+	}
+}
+function record(value) {
+	return value !== null && typeof value === "object" && !Array.isArray(value) ? value : null;
+}
+//#endregion
+//#region src/tally.ts
+/** Before the first entry. */
+const EMPTY_TALLY = {
+	entries: 0,
+	keys: [],
+	accounting: {
+		intents: [],
+		fault: null
+	},
+	access: {
+		members: [],
+		grants: [],
+		newest: []
+	},
+	replayFault: null
+};
+/** The digest of what `access` says, over its canonical form. */
+function accessDigest(access) {
+	return createHash("sha256").update(canonical(access)).digest("hex");
+}
+/**
+* What two tallies are compared by, so that they match whatever order
+* their maps were built in: the members and grants by their digest, which
+* a stretch passing many checkpoints computes once a change; and a fault by
+* where it was found, since the words for it may change from one release
+* to the next.
 */
-function grantSet(grants) {
-	return grants.map((grant) => [
-		grant.environmentId !== null ? "environment" : grant.projectId !== null ? "project" : "every-project",
-		grant.environmentId ?? grant.projectId ?? grant.environmentSlug,
-		grant.role,
-		grant.expiresAt,
-		grant.grantedAt,
-		grant.grantedBy
-	]).map((tuple) => JSON.stringify(tuple)).sort();
-}
-/** Whether two reads of a member's grants are the same set, as the MAC sees them. */
-function sameGrants(a, b) {
-	const [x, y] = [grantSet(a), grantSet(b)];
-	return x.length === y.length && x.every((tuple, i) => tuple === y[i]);
+function tallyKey({ accounting, entries, keys, replayFault }, digest) {
+	return canonical({
+		entries,
+		keys,
+		replayFault,
+		accounting: {
+			...accounting,
+			fault: accounting.fault?.failedAtSeq ?? null
+		},
+		access: digest
+	});
 }
 /**
-* A member's instance role and its scope, as the MAC covers them: as 0.4
-* did, whether they are an owner, for a Member or an Admin everywhere, so
-* that every row 0.4 sealed holds as it is; otherwise the role and the
-* scope, which no row of 0.4 can match.
+* What a walk must come to at a checkpoint, from the tally it keeps: its
+* members and grants by the digest it keeps of them, never read.
 */
-function standing(member) {
-	const scope = normalScope(member.scope);
-	if (unscoped(scope) && (member.role === "member" || member.role === "admin")) return member.role === "admin";
-	return [member.role, scope];
-}
-function memberMac(key, member, grants) {
-	const held = grantSet(grants);
-	const tuple = [
-		"coffre.vault.member.v1",
-		member.principal,
-		member.status,
-		standing(member),
-		member.generation,
-		member.accessSeq.toString(),
-		member.createdAt,
-		member.createdBy,
-		member.statusChangedAt,
-		member.statusChangedBy,
-		held
-	];
-	return createHmac("sha256", key).update(JSON.stringify(tuple)).digest();
+function expectedKey(stored) {
+	return tallyKey(stored, stored.access.digest);
 }
-/** Whether `member`'s MAC is the vault's, over this row and these grants. */
-function sealed(key, member, grants) {
-	const expected = memberMac(key, member, grants);
-	return member.mac.length === expected.length && timingSafeEqual(member.mac, expected);
+/**
+* The vault's entries walked, oldest first, each after its MAC was checked,
+* gathered into what the checks after the walk need: the tally it started
+* from, carried on.
+*/
+var Walk = class {
+	accounting;
+	replayed;
+	/** Each member's newest allowed access entry, by seq. */
+	newestAccess;
+	/** The first access entry the replay could not apply. */
+	replayFault;
+	/** The vault's entries so far, those before the walk included. */
+	entries;
+	/** The vault's log keys, as the log moved through them. */
+	keys;
+	/** The checkpoints walked, each to be checked against its signature and the prefix it signed once the walk ends: what it signed, and nothing it keeps beside. */
+	checkpoints = [];
+	/** The tallies the walk must come to as it passes them, oldest first (`expect`). */
+	#expected = [];
+	/** The first it did not come to, and why. */
+	mismatch = null;
+	/** The digest of the members and grants as the walk has them, until an access entry changes them. */
+	#digest = null;
+	/** The digest of the members and grants as the walk has them: the tally's it started from, until an access entry. */
+	digest() {
+		return this.#digest ??= accessDigest(this.tally().access);
+	}
+	/** The tally but for its members and grants, which `digest` stands for. */
+	#unaccessed() {
+		return {
+			entries: this.entries,
+			keys: [...this.keys],
+			accounting: this.accounting.state(),
+			replayFault: this.replayFault
+		};
+	}
+	/** `digest` is that of `from`'s members and grants, when the caller has it: a beat with no access entry hashes none. */
+	constructor(from, digest) {
+		this.#digest = digest ?? null;
+		this.accounting = new KeyAccounting(from.accounting);
+		this.replayed = {
+			members: new Map(from.access.members.map((member) => [member.principal, {
+				...member,
+				accessSeq: BigInt(member.accessSeq)
+			}])),
+			held: /* @__PURE__ */ new Map()
+		};
+		for (const grant of from.access.grants) {
+			const held = this.replayed.held.get(grant.principal) ?? /* @__PURE__ */ new Map();
+			this.replayed.held.set(grant.principal, held);
+			held.set(placeKey$1(grant), { ...grant });
+		}
+		this.newestAccess = new Map(from.access.newest.map(([principal, seq]) => [principal, BigInt(seq)]));
+		this.replayFault = from.replayFault;
+		this.entries = from.entries;
+		this.keys = from.keys;
+	}
+	/**
+	* Hold the walk to these tallies, each as the walk stands once it has
+	* read every entry through the prefix's end: before the vault's next
+	* entry, since only the vault's change a tally, or at `finish`.
+	*/
+	expect(expected) {
+		this.#expected = [...expected].sort((a, b) => a.through < b.through ? -1 : 1);
+	}
+	/** The tallies expected through `through`, held to the walk. */
+	finish(through) {
+		this.#reach(through + 1n);
+	}
+	#reach(before) {
+		while (this.#expected.length > 0 && this.#expected[0].through < before) {
+			const expected = this.#expected.shift();
+			if (this.mismatch !== null) continue;
+			if ("unreadable" in expected) this.mismatch = {
+				entry: expected.entry,
+				reason: expected.unreadable
+			};
+			else if (tallyKey(this.#unaccessed(), this.digest()) !== expected.key) this.mismatch = {
+				entry: expected.entry,
+				reason: "the tally this checkpoint keeps does not follow from the log before it"
+			};
+		}
+	}
+	/**
+	* One of the vault's entries, its MAC checked, in the log's order: a
+	* fault when it is under a key the vault had moved past (`forward`).
+	*/
+	add(entry, current) {
+		this.#reach(entry.seq);
+		const moved = forward([entry], this.keys, current);
+		if ("failedAtSeq" in moved) return moved;
+		this.keys = moved.keys;
+		this.entries += 1;
+		this.accounting.add(entry);
+		if (entry.decision !== "allow") return null;
+		if (ACCESS.has(entry.action)) {
+			this.#digest = null;
+			this.replayFault ??= apply(this.replayed, entry);
+			if (entry.subjectPrincipal !== null) this.newestAccess.set(entry.subjectPrincipal, entry.seq);
+		} else if (entry.action === "audit.checkpoint") {
+			const { seq, hash, signedAt, keyId, signature } = JSON.parse(entry.metadata);
+			this.checkpoints.push({
+				entry: {
+					seq: entry.seq,
+					keyId: entry.keyId,
+					relatedSeq: entry.relatedSeq
+				},
+				checkpoint: {
+					seq,
+					hash,
+					signedAt,
+					keyId,
+					signature
+				}
+			});
+		}
+		return null;
+	}
+	/** Where the walk stands, to resume from. */
+	tally() {
+		const byPrincipal = (entries) => [...entries].sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0);
+		return {
+			entries: this.entries,
+			keys: [...this.keys],
+			accounting: this.accounting.state(),
+			access: {
+				members: byPrincipal(this.replayed.members).map(([, member]) => ({
+					...member,
+					accessSeq: Number(member.accessSeq)
+				})),
+				grants: byPrincipal(this.replayed.held).flatMap(([, held]) => byPrincipal(held).map(([, grant]) => grant)),
+				newest: byPrincipal(this.newestAccess).map(([principal, seq]) => [principal, Number(seq)])
+			},
+			replayFault: this.replayFault
+		};
+	}
+};
+/** The action of the vault's entry that signs a prefix of the log. */
+const CHECKPOINT = "audit.checkpoint";
+const ACCESS = new Set(ACCESS_ACTIONS);
+/** JSON with every object's keys sorted: one text for one value, however it was built. */
+function canonical(value) {
+	return JSON.stringify(value, (_, inner) => inner !== null && typeof inner === "object" && !Array.isArray(inner) ? Object.fromEntries(Object.entries(inner).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0)) : inner);
 }
 //#endregion
 //#region src/vault.ts
@@ -1025,9 +1371,13 @@ async function prepareVault(config, options = {}) {
 		...await keysOf(config.signingKeys),
 		options: {
 			keyBudgetMs: options.keyBudgetMs ?? KEY_BUDGET_MS,
-			clockOffset: options.clockOffset ?? (() => 0)
+			clockOffset: options.clockOffset ?? (() => 0),
+			walks: {
+				...WALKS,
+				...options.walks
+			}
 		},
-		verified: UNVERIFIED,
+		verified: START,
 		reported: /* @__PURE__ */ new Set(),
 		since: null,
 		superseded: null,
@@ -1076,8 +1426,6 @@ const UNSEALED = {
 };
 /** Why a change to a tampered member is refused. */
 const TAMPERED_SUBJECT = "this member's record failed the vault's integrity check: remove them to start over";
-/** The action of the vault's entry that signs a prefix of the log. */
-const CHECKPOINT = "audit.checkpoint";
 /** The action of the vault's entry that holds the instance's settings, and changes them (`settings`). */
 const SETTINGS = "settings.change";
 /** The settings before anyone changed them: people set up service accounts anywhere they hold access. */
@@ -1122,12 +1470,6 @@ function declaredOwner(principal) {
 const NOT_THEIRS = "a person gives a service account at most what they hold, where the instance lets them set one up, and only to one whose every grant they hold";
 /** Who asks for checkpoints: the app's scheduled job. */
 const SCHEDULER = "system:coffre-scheduler";
-/**
-* How often a checkpoint recomputes the chain from its first entry: the
-* first of each hour, by the vault's clock. The others resume from the
-* prefix the last one signed (`#recompute`).
-*/
-const FULL_RECOMPUTE_MS = 36e5;
 /** A refusal and the entries that record it. */
 var Refused = class {
 	refusal;
@@ -1372,14 +1714,17 @@ var VaultService = class {
 	}
 	/** Whether `entry` carries the vault's MAC: under any of its keys before `since`, and only its current one from there. */
 	#authentic(entry) {
-		const { logKeys, since } = this.#prepared;
-		const keys = since !== null && entry.seq >= since ? logKeys.slice(0, 1) : logKeys;
 		return verifyEntries([entry], {
 			startSeq: entry.seq,
 			startPrevHash: entry.prevHash,
-			keys
+			keys: this.#keysFor(entry)
 		}).ok;
 	}
+	/** The vault's log keys an entry may be under: any of them before `since`, and only its current one from there. */
+	#keysFor(entry) {
+		const { logKeys, since } = this.#prepared;
+		return since !== null && entry.seq >= since ? logKeys.slice(0, 1) : logKeys;
+	}
 	/**
 	* Whether `row`, with these grants, carries the MAC of the vault's row
 	* key, or of one it replaced before the rotation sealed every row again
@@ -1933,15 +2278,19 @@ var VaultService = class {
 			if (!intent.ok) return intent;
 			intentSeq = intent.seq;
 		}
-		return this.#decide([principal], async (d) => {
+		const late = call.remote;
+		const decided = async (d) => {
 			try {
 				await check(d);
 			} catch (error) {
 				if (error instanceof Refused) throw new Refused(error.refusal, secrets.map((secret, item) => outcomeEntry(secret, item, "deny", error.entries[item].code ?? error.refusal.code)));
 				throw error;
 			}
+		};
+		return this.#decide([principal], async (d) => {
+			await decided(d);
 			const { vet } = call;
-			if (vet !== void 0) d.underLock.push(async (locked) => {
+			if (late && vet !== void 0) d.underLock.push(async (locked) => {
 				const codes = await vet(locked);
 				const first = codes.find((code) => code !== null);
 				if (first === void 0 || first === null) return;
@@ -1957,16 +2306,13 @@ var VaultService = class {
 				if (unanswered > 0) throw new Outage(new KekUnavailableError(`the key service did not answer for ${unanswered} of ${secrets.length} keys`, outcomes.some((outcome) => !outcome.ok && outcome.code === "kms_uncertain")), entries());
 				if (expired) throw new Outage(new KekUnavailableError("key operation exceeded its deadline"), entries());
 				if (done.length < outcomes.length) throw new Refused(refusal("bad_claim", MESSAGES.bad_claim), entries());
-				await lockLogHead(d.tx);
-				try {
-					await check(d);
-				} catch (error) {
-					if (error instanceof Refused) throw new Refused(error.refusal, secrets.map((secret, item) => outcomeEntry(secret, item, "deny", error.entries[item].code ?? error.refusal.code)));
-					throw error;
+				if (late) {
+					await lockLogHead(d.tx);
+					await decided(d);
+					const places = secrets.flatMap((secret, i) => [secret, call.places?.[i] ?? secret]);
+					const now = await environmentsById(d.tx, places.map((place) => place.environmentId));
+					if (places.some((place) => now.get(place.environmentId)?.deleted ?? false)) throw new Refused(refusal("deleted", MESSAGES.deleted), secrets.map((secret, i) => outcomeEntry(secret, i, "deny", "deleted")));
 				}
-				const places = secrets.flatMap((secret, i) => [secret, call.places?.[i] ?? secret]);
-				const now = await environmentsById(d.tx, places.map((place) => place.environmentId));
-				if (places.some((place) => now.get(place.environmentId)?.deleted ?? false)) throw new Refused(refusal("deleted", MESSAGES.deleted), secrets.map((secret, i) => outcomeEntry(secret, i, "deny", "deleted")));
 				const released = secrets.map((secret, i) => outcomeEntry(secret, i, "allow", null));
 				d.log.push(...released);
 				const answer = result(done);
@@ -1975,7 +2321,7 @@ var VaultService = class {
 			} finally {
 				for (const value of done) value.wipe();
 			}
-		}, true);
+		}, late);
 	}
 	/** Whether `n` more keys would take `principal` past the bulk limit; counted under their row's lock, so exactly. */
 	async #overBulkLimit(d, principal, n) {
@@ -2760,7 +3106,7 @@ var VaultService = class {
 	* the default: otherwise whoever can insert rows could open it again.
 	*/
 	async #settingsAt(db, reports) {
-		const entry = await newestAuthentic((before) => newestVaultEntries(db, SETTINGS, LOOK_BACK.page, before), this.#check(reports, null));
+		const entry = await newestAuthentic((limit, before) => newestVaultEntries(db, SETTINGS, limit, before), this.#check(reports, null));
 		if (entry === "none") return DEFAULT_SETTINGS;
 		if (typeof entry === "string") return CLOSED_SETTINGS;
 		const { serviceAccounts } = JSON.parse(entry.metadata);
@@ -2782,7 +3128,7 @@ var VaultService = class {
 	* could unprotect them. Its edits are then unknown, not none.
 	*/
 	async #policyAt(db, reports, at) {
-		const entry = await newestAuthentic((before) => newestVaultEntries(db, POLICY, LOOK_BACK.page, before), this.#check(reports, null));
+		const entry = await newestAuthentic((limit, before) => newestVaultEntries(db, POLICY, limit, before), this.#check(reports, null));
 		if (entry === "none") return {
 			policy: DEFAULT_POLICY,
 			edits: NO_EDITS,
@@ -3077,63 +3423,162 @@ var VaultService = class {
 		}
 		return checks;
 	}
-	/** The last checkpoint the vault signed, and the entry that holds it: its newest allowed `audit.checkpoint`. */
-	async #latest(db) {
-		const row = await latestVaultEntry(db, [CHECKPOINT]);
-		return row === void 0 ? null : {
-			checkpoint: JSON.parse(row.metadata),
-			seq: row.seq,
-			keyId: row.keyId
+	/**
+	* Where a walk of the log resumes: the first entry (`start`), a
+	* checkpoint's entry that keeps a tally, or the newest such entry, the
+	* first entry while there is none. The entry must be the vault's, by its
+	* MAC, and its tally whole: the members and grants it keeps, or the
+	* earlier checkpoint it names keeps, match the digest it carries.
+	*
+	* Its signature is left to the walk: the entry comes after the prefix it
+	* signs, so a walk from there reads it, as it reads every other.
+	*/
+	async #resume(db, from) {
+		if (from === "start") return FIRST_ENTRY;
+		const entry = from === "newest" ? await latestTallied(db) : (await entriesAt(db, [from])).get(from);
+		if (entry === void 0) return from === "newest" ? FIRST_ENTRY : {
+			ok: false,
+			failedAtSeq: Number(from),
+			reason: "no checkpoint at this entry"
 		};
+		return (await this.#resumeEach(db, [entry]))[0];
+	}
+	/** `#resume` for each of these checkpoint entries, the entries their members and grants are kept in read at once. */
+	async #resumeEach(db, entries) {
+		const reads = entries.map((entry) => this.#tallied(entry));
+		const named = reads.flatMap((read) => typeof read !== "string" && "at" in read.tally.access ? [BigInt(read.tally.access.at)] : []);
+		const carriers = new Map([...await entriesAt(db, named)].map(([seq, held]) => [seq, this.#tallied(held)]));
+		return entries.map((entry, i) => {
+			const broken = (reason) => ({
+				ok: false,
+				failedAtSeq: Number(entry.seq),
+				reason
+			});
+			const read = reads[i];
+			if (typeof read === "string") return broken(read);
+			let carrier = entry.seq;
+			let { access } = read.tally;
+			if ("at" in access) {
+				carrier = BigInt(access.at);
+				const holder = carrier < entry.seq ? carriers.get(carrier) : void 0;
+				if (holder === void 0 || typeof holder === "string" || "at" in holder.tally.access) return broken(`its tally keeps its members and grants in entry ${carrier}, which holds none`);
+				access = holder.tally.access;
+			}
+			const kept = {
+				members: access.members,
+				grants: access.grants,
+				newest: access.newest
+			};
+			if (keptDigest(access) !== read.tally.access.digest) return broken("its tally's members and grants do not match their digest");
+			return {
+				ok: true,
+				entry: entry.seq,
+				at: {
+					seq: BigInt(read.seq),
+					hash: Buffer.from(read.hash, "hex")
+				},
+				tally: {
+					...read.tally,
+					access: kept
+				},
+				digest: read.tally.access.digest,
+				carrier,
+				scrub: read.scrub === null ? null : {
+					at: positionOf(read.scrub.at),
+					end: positionOf(read.scrub.end)
+				}
+			};
+		});
+	}
+	/** A checkpoint's entry that keeps a tally, as it says, or why it is not one the vault wrote. */
+	#tallied(entry) {
+		const not = "not a checkpoint of the vault's that keeps a tally";
+		if (entry.author !== "vault" || entry.action !== "audit.checkpoint" || entry.decision !== "allow" || entry.relatedSeq === null) return not;
+		const authentic = verifyEntries([entry], {
+			startSeq: entry.seq,
+			startPrevHash: entry.prevHash,
+			keys: this.#keysFor(entry)
+		});
+		if (!authentic.ok) return withCause(authentic.reason);
+		const read = metadataOf(entry);
+		if (read?.tally?.v !== 1 || read.scrub === void 0 || typeof read.seq !== "number" || BigInt(read.seq) !== entry.relatedSeq) return not;
+		return read;
+	}
+	/** Which of `heads` the log still holds where they were, in one read. */
+	async #holding(db, heads) {
+		const hashes = await hashesAt(db, [...new Set(heads.filter((head) => head.seq >= 0).map((head) => BigInt(head.seq)))]);
+		return (head) => head.hash === GENESIS_HASH.toString("hex") || hashes.get(BigInt(head.seq))?.toString("hex") === head.hash;
 	}
 	/**
-	* The chain recomputed to its last entry, for a checkpoint to sign: from
-	* its first entry at the first checkpoint of each hour, and otherwise from
-	* the prefix the last checkpoint signed, if that one was signed this hour.
-	*
-	* Resuming never signs what the vault did not recompute. The vault
-	* recomputed the last checkpoint's prefix itself, from entry 0 at the
-	* hour's first checkpoint and onward at each one since, and the entry
-	* that holds it is the first one checked again, by its MAC. The next
-	* signature extends that same chain.
+	* Sign the log up to its last entry, from the newest checkpoint's tally.
 	*
-	* What resuming does not do is recompute the rows of that prefix again.
-	* They can change while the hash stored at its end stays, so it first
-	* checks the two things that are cheap: that hash is still there, which a
-	* prefix rewritten and chained again changes, and every entry of the
-	* prefix is, which a cut changes. Either failing, it recomputes from entry
-	* 0, which names what broke. An entry edited in place, its hash left as
-	* it was, is the one change left to the next full pass, within the hour.
+	* In one snapshot, and without the log's lock, so that no append waits on
+	* it: every member's row checked, since rows changed around the vault
+	* write nothing to the log; the prefix the newest checkpoint signed still
+	* there, its hash where it was, which a rewrite chained again changes, and
+	* every entry of it, which a cut changes; the chain recomputed from there,
+	* every hash from content and every vault entry by its MAC, no further
+	* than one walk (`walks.checkpoint`); and a stretch of the prefixes signed
+	* before rehashed (`#scrub`). Then, under the lock, the entries appended
+	* since the snapshot, so that it signs the head.
 	*
-	* It resumes only from a checkpoint under the key the vault writes with
-	* now: once the log reaches that key, no other writes again (`forward`).
-	* After a rotation, the next pass is full.
+	* A walk cut short signs where it got to, behind the head: the log after
+	* an upgrade from 0.10.0, whose checkpoints kept no tally, is signed again
+	* from the first entry, one walk a call, and `/readyz` stays red until the
+	* checkpoints reach the newest heartbeat.
 	*/
-	async #recompute(tx) {
-		const { logKeys } = this.#prepared;
-		const latest = await this.#latest(tx);
-		const hour = (ms) => Math.floor(ms / FULL_RECOMPUTE_MS);
-		if (!(latest !== null && latest.keyId === logKeys[0].keyId && latest.seq === BigInt(latest.checkpoint.seq) + 1n && hour(Date.parse(latest.checkpoint.signedAt)) === hour(await this.#now(tx)) && await carries(tx, latest.checkpoint) && await complete(tx, BigInt(latest.checkpoint.seq)))) return verifyChain(tx, logKeys, [], UNVERIFIED);
-		const { seq, hash } = latest.checkpoint;
-		return verifyChain(tx, logKeys, [], {
-			nextSeq: BigInt(seq) + 1n,
-			hash: Buffer.from(hash, "hex"),
-			vaultEntries: 0,
-			vaultKeys: [logKeys[0].keyId]
-		});
-	}
 	async checkpoint() {
 		await this.#settled();
-		const { wrongKek } = this.#prepared;
+		const { wrongKek, logKeys } = this.#prepared;
+		const { walks } = this.#prepared.options;
 		const found = [];
-		const whole = await this.#db.transaction(async (tx) => {
+		let seen = null;
+		const walked = await this.#db.transaction(async (tx) => {
+			seen = (await newestCheckpointEntry(tx))?.seq ?? null;
 			await this.#sweep(tx, found);
-			return this.#recompute(tx);
+			const from = await this.#resume(tx, "newest");
+			if (!from.ok) return from;
+			const signed = headOf(from.at);
+			if (!(await this.#holding(tx, [signed]))(signed)) return {
+				ok: false,
+				failedAtSeq: null,
+				reason: `the log up to entry ${signed.seq} is not the prefix the last checkpoint signed`
+			};
+			const gap = await missingEntry(tx, from.at.seq);
+			if (gap !== null) return {
+				ok: false,
+				failedAtSeq: Number(gap.found),
+				reason: `sequence gap: expected seq ${gap.expected}, found ${gap.found}`
+			};
+			const walk = new Walk(from.tally, from.digest);
+			const chain = await rehash(tx, logKeys, from.at, walk, { limit: walks.checkpoint });
+			if (!chain.ok) return chain;
+			const unsigned = await this.#checkpointFault(tx, walk.checkpoints);
+			if (unsigned !== null) return unsigned;
+			return {
+				ok: true,
+				from,
+				tally: walk.tally(),
+				digest: walk.digest(),
+				at: chain.at,
+				done: chain.done
+			};
 		}, SNAPSHOT);
+		let scrub = {
+			ok: true,
+			next: walked.ok ? walked.from.scrub : null
+		};
+		let stalled = null;
+		if (walked.ok) try {
+			scrub = await this.#db.transaction((tx) => this.#scrub(tx, walked.from), SNAPSHOT);
+		} catch (error) {
+			if (!isUnreachable(error) && !timedOut(error)) throw error;
+			stalled = `the rehash of the past did not run, and goes on where it was next time: ${error.message}`;
+		}
 		return this.#decide([], async (d) => {
 			for (const entry of found) if (!d.reports.includes(entry)) d.reports.push(entry);
 			const head = await lockLogHead(d.tx);
-			const latest = await this.#latest(d.tx);
+			const latest = await latestVaultEntry(d.tx, [CHECKPOINT]);
 			const refused = (code, detail, message = MESSAGES[code]) => new Refused(refusal(code, message), [{
 				actor: SCHEDULER,
 				action: CHECKPOINT,
@@ -3143,21 +3588,57 @@ var VaultService = class {
 			}]);
 			if (head.nextSeq === 0n) throw new Refused(refusal("invalid", "the log is empty"), []);
 			if (wrongKek !== null) throw refused("wrong_kek", { reason: wrongKek }, wrongKek);
-			if (!whole.verification.ok) throw refused("log_broken", {
-				failedAtSeq: whole.verification.failedAtSeq,
-				reason: whole.verification.reason
+			if (!walked.ok) throw refused("log_broken", {
+				failedAtSeq: walked.failedAtSeq,
+				reason: walked.reason
 			});
-			if (latest !== null && latest.seq === head.nextSeq - 1n) return { checkpoint: latest.checkpoint };
-			if (latest !== null && !await carries(d.tx, latest.checkpoint)) throw refused("log_broken", { reason: `the log up to entry ${latest.checkpoint.seq} is not the prefix the last checkpoint signed` });
-			const { verification: held, anchor: verified } = await verifyChain(d.tx, this.#prepared.logKeys, [], whole.anchor);
-			if (!held.ok) throw refused("log_broken", {
-				failedAtSeq: held.failedAtSeq,
-				reason: held.reason
+			if (!scrub.ok) throw refused("log_broken", {
+				failedAtSeq: scrub.failedAtSeq,
+				reason: scrub.reason
 			});
-			if (verified.nextSeq !== head.nextSeq || !verified.hash.equals(head.headHash)) throw refused("log_broken", { reason: "the chain head does not name the last entry" });
+			const newest = latest === void 0 ? null : JSON.parse(latest.metadata);
+			if (stalled !== null || ((await newestCheckpointEntry(d.tx))?.seq ?? null) !== seen) {
+				const standing = await this.#standingRefusal(d.tx);
+				if (standing !== null) throw refused("log_broken", standing);
+				if (stalled === null && newest !== null) return { checkpoint: signedPart(newest) };
+			}
+			if (newest !== null && latest.seq === head.nextSeq - 1n && latest.relatedSeq === latest.seq - 1n) return { checkpoint: signedPart(newest) };
+			if (newest !== null && !await carries(d.tx, newest)) throw refused("log_broken", { reason: `the log up to entry ${newest.seq} is not the prefix the last checkpoint signed` });
+			const walk = new Walk(walked.tally, walked.digest);
+			let { at } = walked;
+			if (walked.done) {
+				if (!await carries(d.tx, headOf(at))) throw refused("log_broken", {
+					failedAtSeq: Number(at.seq),
+					reason: `the log up to entry ${at.seq} changed while the vault walked it`
+				});
+				const rest = await rehash(d.tx, logKeys, at, walk, {});
+				if (!rest.ok) throw refused("log_broken", {
+					failedAtSeq: rest.failedAtSeq,
+					reason: rest.reason
+				});
+				const unsigned = await this.#checkpointFault(d.tx, walk.checkpoints);
+				if (unsigned !== null) throw refused("log_broken", {
+					failedAtSeq: unsigned.failedAtSeq,
+					reason: unsigned.reason
+				});
+				at = rest.at;
+				if (at.seq !== head.nextSeq - 1n || !at.hash.equals(head.headHash)) throw refused("log_broken", { reason: "the chain head does not name the last entry" });
+			} else if (!await carries(d.tx, headOf(at))) throw refused("log_broken", { reason: `the log up to entry ${at.seq} changed while the vault walked it` });
+			if (newest !== null && latest.relatedSeq !== null && latest.relatedSeq >= at.seq) return { checkpoint: signedPart(newest) };
+			this.#prepared.verified = further(this.#prepared.verified, at);
+			const tally = walk.tally();
+			const digest = walk.digest();
+			const { from } = walked;
+			const access = digest === from.digest && from.carrier !== null ? {
+				digest,
+				at: Number(from.carrier)
+			} : {
+				digest,
+				...tally.access
+			};
 			const signed = {
-				seq: Number(verified.nextSeq - 1n),
-				hash: verified.hash.toString("hex"),
+				seq: Number(at.seq),
+				hash: at.hash.toString("hex"),
 				signedAt: iso(d.at)
 			};
 			const checkpoint = {
@@ -3165,15 +3646,85 @@ var VaultService = class {
 				keyId: this.#prepared.signer.keyId,
 				signature: await this.#prepared.signer.sign(checkpointMessage(signed))
 			};
+			const lap = scrub.next === null ? null : {
+				at: headOf(scrub.next.at),
+				end: headOf(scrub.next.end)
+			};
+			const kept = {
+				...checkpoint,
+				tally: {
+					v: 1,
+					...tally,
+					access
+				},
+				scrub: lap
+			};
 			d.log.push({
 				actor: SCHEDULER,
 				action: CHECKPOINT,
 				decision: "allow",
-				metadata: JSON.stringify(checkpoint)
+				relatedSeq: at.seq,
+				metadata: JSON.stringify(kept)
 			});
-			return { checkpoint };
+			return stalled === null ? { checkpoint } : {
+				checkpoint,
+				warning: stalled
+			};
 		});
 	}
+	/**
+	* The prefixes signed before, rehashed a stretch at a time, in laps: a lap
+	* runs from the first entry to the prefix the newest checkpoint signed
+	* when it began, which it keeps (`end`), `walks.scrub` entries a call, each
+	* hash recomputed from its entry and each link checked (`relink`); the
+	* next lap runs to the prefix signed then. A checkpoint resumes from the
+	* newest one's tally and never reads what it signed again, and an entry
+	* before it edited in place, its stored hash left as it was, keeps the
+	* chain: this is what finds it, within two laps at most, each the length
+	* of the log when it began over `walks.scrub` beats, however fast the log
+	* grows meanwhile. The lap as it goes on, null between laps.
+	*/
+	async #scrub(db, newest) {
+		const lap = newest.scrub ?? {
+			at: START,
+			end: newest.at
+		};
+		if (lap.end.seq < 0n) return {
+			ok: true,
+			next: null
+		};
+		const relinked = await relink(db, lap.at, lap.end.seq, this.#prepared.options.walks.scrub);
+		if (!relinked.ok) return relinked;
+		if (relinked.at.seq < lap.end.seq) return {
+			ok: true,
+			next: {
+				at: relinked.at,
+				end: lap.end
+			}
+		};
+		if (!relinked.at.hash.equals(lap.end.hash)) return {
+			ok: false,
+			failedAtSeq: Number(lap.end.seq),
+			reason: `the log up to entry ${lap.end.seq} is not the prefix a checkpoint signed`
+		};
+		return {
+			ok: true,
+			next: null
+		};
+	}
+	/**
+	* The newest refusal for a broken log since the newest checkpoint was
+	* signed, by the vault's MAC, as it said: it stands, for every
+	* verification and checkpoint, until a checkpoint is signed, which takes
+	* the check that found it running again and passing. A refusal of
+	* another kind since, a wrong KEK, hides none.
+	*/
+	async #standingRefusal(db) {
+		const signed = await latestVaultEntry(db, [CHECKPOINT]);
+		const refused = await newestRefusal(db, CHECKPOINT, "log_broken", signed?.seq ?? -1n);
+		if (refused === void 0 || !this.#authentic(refused)) return null;
+		return JSON.parse(refused.metadata);
+	}
 	async about() {
 		await this.#settled();
 		const { signers, since } = this.#prepared;
@@ -3202,65 +3753,181 @@ var VaultService = class {
 			checks
 		};
 	}
-	verifyLog(input) {
-		return this.#verifyAll(input.upTo ?? null);
-	}
 	/**
-	* The whole log, in one snapshot and one pass over the vault's entries:
-	* each by its MAC, the keys it moved through, and what the other checks
-	* need of it, gathered as it goes (`Findings`); then every checkpoint, the
-	* heads that must still be there, the key batches accounted for, and the
-	* members and grants replayed.
+	* The log from a checkpoint's tally, in one snapshot: the vault's
+	* entries since, each by its MAC, the keys it moved through, and what the
+	* other checks need of it (`Walk`); then every checkpoint walked, the
+	* heads that must still be there, and, for a walk that ends at the
+	* present, the key batches accounted for and the members and grants
+	* replayed against their rows.
 	*
 	* With `upTo`, the head the app verified to, the links and hashes of the
-	* chain are the app's to recompute, as it just has, over its own snapshot,
-	* through that head; `carries(upTo)` ties this snapshot to that one. So
-	* the vault reads only its own entries, each checked against its own hash
-	* and MAC over the link it names. Without `upTo`, nobody else recomputed
-	* the chain: the vault reads it all, and rehashes every link.
+	* chain are the app's to recompute, as it just has, over its own
+	* snapshot, through that head; holding `upTo` ties this snapshot to that
+	* one. So the vault reads only its own entries, each checked against its
+	* own hash and MAC over the link it names. Without `upTo`, nobody else
+	* recomputed the chain: the vault reads it all, and rehashes every link,
+	* no further than one walk (`walks.verify`).
 	*/
-	async #verifyAll(upTo) {
+	async verifyLog(input) {
 		await this.#settled();
+		const upTo = input.upTo ?? null;
+		const { logKeys } = this.#prepared;
+		const { walks } = this.#prepared.options;
 		return this.#db.transaction(async (tx) => {
 			const remembered = this.#prepared.verified;
-			const findings = new Findings();
-			const read = upTo === null ? await this.#rehashed(tx, findings) : await this.#ownEntries(tx, findings);
-			if (!read.ok) return read;
-			const heads = [...upTo === null ? [] : [upTo], ...findings.checkpoints.map(({ checkpoint }) => checkpoint)];
-			const rememberedHead = remembered.nextSeq > 0n ? {
-				seq: Number(remembered.nextSeq - 1n),
-				hash: remembered.hash.toString("hex")
-			} : null;
-			if (rememberedHead !== null) heads.push(rememberedHead);
-			const hashes = await hashesAt(tx, [...new Set(heads.map((head) => BigInt(head.seq)))]);
-			const holds = (head) => head.hash === GENESIS_HASH.toString("hex") || hashes.get(BigInt(head.seq))?.toString("hex") === head.hash;
+			const from = await this.#resume(tx, input.from === void 0 ? "newest" : input.from === "start" ? "start" : BigInt(input.from));
+			if (!from.ok) return from;
+			const to = input.to === void 0 ? null : BigInt(input.to);
+			const ends = to === null ? null : (await entriesAt(tx, [to])).get(to)?.relatedSeq ?? -1n;
+			if (ends !== null && (ends <= from.at.seq || upTo !== null && BigInt(upTo.seq) !== ends)) return {
+				ok: false,
+				failedAtSeq: Number(to),
+				reason: "not a checkpoint after the one the walk starts from, whose prefix ends where the app verified to"
+			};
+			if (!(await this.#holding(tx, [headOf(from.at)]))(headOf(from.at))) return {
+				ok: false,
+				failedAtSeq: Number(from.entry),
+				reason: `the log up to entry ${from.at.seq} is not the prefix this checkpoint signed: it was rewritten`
+			};
+			const gap = await missingEntry(tx, from.at.seq);
+			if (gap !== null) return {
+				ok: false,
+				failedAtSeq: Number(gap.found),
+				reason: `sequence gap: expected seq ${gap.expected}, found ${gap.found}`
+			};
+			const walk = new Walk(from.tally, from.digest);
+			const passed = (await talliedAfter(tx, from.entry ?? -1n, walks.verify)).filter(({ seq }) => to === null || seq <= to);
+			if (to !== null && passed.at(-1)?.seq !== to) return {
+				ok: false,
+				failedAtSeq: Number(to),
+				reason: `a stretch passes no more than ${walks.verify} checkpoints: end one sooner`
+			};
+			const holding = /* @__PURE__ */ new Map();
+			const carried = async (carrier) => {
+				if (!holding.has(carrier)) {
+					const entry = (await entriesAt(tx, [carrier])).get(carrier);
+					const read = entry === void 0 ? "missing" : this.#tallied(entry);
+					holding.set(carrier, typeof read === "string" || "at" in read.tally.access ? null : keptDigest(read.tally.access));
+				}
+				return holding.get(carrier);
+			};
+			const expected = [];
+			let endSigned = null;
+			for (let after = from.entry ?? -1n, last = passed.at(-1)?.seq; last !== void 0 && after < last;) {
+				const batch = await talliedWithin(tx, after, last, walks.verify + 1);
+				if (batch.length === 0) break;
+				for (const entry of batch) {
+					const read = this.#tallied(entry);
+					const point = {
+						entry: entry.seq,
+						through: entry.relatedSeq
+					};
+					if (typeof read === "string") {
+						expected.push({
+							...point,
+							unreadable: read
+						});
+						continue;
+					}
+					if (entry.seq === to) endSigned = read.hash;
+					const { access } = read.tally;
+					if (!("at" in access)) holding.set(entry.seq, keptDigest(access));
+					const kept = "at" in access ? BigInt(access.at) < entry.seq ? await carried(BigInt(access.at)) : null : holding.get(entry.seq);
+					expected.push(kept === access.digest ? {
+						...point,
+						key: expectedKey(read.tally)
+					} : {
+						...point,
+						unreadable: kept === null ? `its tally keeps its members and grants in entry ${"at" in access ? access.at : entry.seq}, which holds none` : "its tally's members and grants do not match their digest"
+					});
+				}
+				after = batch.at(-1).seq;
+			}
+			walk.expect(expected);
+			let through = from.at.seq;
+			let reached = headOf(from.at).hash;
+			let present = false;
+			if (upTo === null) {
+				const chain = await rehash(tx, logKeys, from.at, walk, ends === null ? { limit: walks.verify } : { to: ends });
+				if (!chain.ok) return chain;
+				[through, reached, present] = [
+					chain.at.seq,
+					headOf(chain.at).hash,
+					chain.done && ends === null
+				];
+				this.#prepared.verified = further(this.#prepared.verified, chain.at);
+			} else {
+				const own = await ownEntries(tx, logKeys, from.at.seq, walk, ends === null ? { limit: walks.verify } : { to: ends });
+				if (!own.ok) return own;
+				if (!own.done && input.from === void 0) return {
+					ok: false,
+					failedAtSeq: null,
+					reason: `the vault verifies no more than ${walks.verify} of its entries a call, and its checkpoints are catching up: update the app`
+				};
+				const short = own.at < BigInt(upTo.seq) ? own.at : BigInt(upTo.seq) - 1n;
+				[through, reached, present] = [
+					own.done ? BigInt(upTo.seq) : short,
+					upTo.hash,
+					own.done && ends === null
+				];
+			}
+			walk.finish(ends ?? through);
+			const rememberedHead = remembered.seq >= 0n ? headOf(remembered) : null;
+			const heads = [...upTo === null ? [] : [upTo], ...rememberedHead === null ? [] : [rememberedHead]];
+			const holds = await this.#holding(tx, [...heads, ...walk.checkpoints.map(({ checkpoint }) => checkpoint)]);
 			if (upTo !== null && !holds(upTo)) return {
 				ok: false,
 				failedAtSeq: upTo.seq,
 				reason: "not the entry the app verified up to: the log changed between the two checks"
 			};
-			const unsigned = await this.#checkpointFault(findings, holds);
+			const unsigned = await this.#checkpointFault(tx, walk.checkpoints, holds);
 			if (unsigned !== null) return unsigned;
 			if (rememberedHead !== null && !holds(rememberedHead)) return {
 				ok: false,
 				failedAtSeq: rememberedHead.seq,
 				reason: "changed since the vault last verified it"
 			};
+			if (walk.mismatch !== null) return {
+				ok: false,
+				failedAtSeq: Number(walk.mismatch.entry),
+				reason: walk.mismatch.reason
+			};
+			if (ends !== null) {
+				if (upTo === null && through !== ends || endSigned !== reached) return {
+					ok: false,
+					failedAtSeq: Number(to),
+					reason: `the log up to entry ${ends} is not the prefix this checkpoint signed: it was rewritten`
+				};
+				return {
+					ok: true,
+					entries: walk.entries,
+					through: Number(ends)
+				};
+			}
+			const standing = await this.#standingRefusal(tx);
+			if (standing !== null) return {
+				ok: false,
+				failedAtSeq: standing.failedAtSeq ?? null,
+				reason: `the last checkpoint was refused: ${standing.reason ?? "the log is broken"}`
+			};
+			const verified = {
+				ok: true,
+				entries: walk.entries,
+				through: Number(through)
+			};
+			if (!present) return verified;
 			const at = await this.#now(tx);
-			const accounting = findings.accounting.result(at);
+			const accounting = walk.accounting.result(at);
 			if (!accounting.ok) return accounting;
 			const [rows, held] = await Promise.all([allMembers(tx), grants(tx)]);
-			const fault = this.#unsealed(rows, held, findings.newestAccess) ?? findings.replayFault ?? replayFault(findings.replayed, rows, held, at);
+			const fault = this.#unsealed(rows, held, walk.newestAccess) ?? walk.replayFault ?? replayFault(walk.replayed, rows, held, at);
 			if (fault !== null) return {
 				ok: false,
 				failedAtSeq: null,
 				reason: describeAccessFault(fault),
 				fault
 			};
-			const verified = {
-				ok: true,
-				entries: findings.entries
-			};
 			return accounting.pending === 0 ? verified : {
 				...verified,
 				pending: accounting.pending
@@ -3268,55 +3935,15 @@ var VaultService = class {
 		}, SNAPSHOT);
 	}
 	/**
-	* The vault's own entries, oldest first: each against its own hash, and by
-	* its MAC, over the link it names, which the app checked; and the vault's
-	* keys moving only forward through them.
-	*/
-	async #ownEntries(tx, findings) {
-		const { logKeys } = this.#prepared;
-		let keys = [];
-		for (let after = -1n;;) {
-			const batch = await vaultEntriesAfter(tx, after, VERIFY_BATCH);
-			if (batch.length === 0) return { ok: true };
-			for (const entry of batch) {
-				const result = verifyEntries([entry], {
-					startSeq: entry.seq,
-					startPrevHash: entry.prevHash,
-					keys: logKeys
-				});
-				if (!result.ok) return {
-					ok: false,
-					failedAtSeq: Number(result.failedAtSeq),
-					reason: withCause(result.reason)
-				};
-			}
-			const moved = forward(batch, keys, logKeys[0].keyId);
-			if ("failedAtSeq" in moved) return {
-				ok: false,
-				failedAtSeq: Number(moved.failedAtSeq),
-				reason: moved.reason
-			};
-			keys = moved.keys;
-			for (const entry of batch) findings.add(entry);
-			after = batch[batch.length - 1].seq;
-		}
-	}
-	/** The whole chain from its first entry: every link and hash, the vault's MACs; the furthest verified is kept for checkpoints. */
-	async #rehashed(tx, findings) {
-		const { verification, anchor } = await verifyChain(tx, this.#prepared.logKeys, [], UNVERIFIED, (batch) => {
-			for (const entry of batch) if (entry.author === "vault") findings.add(entry);
-		});
-		if (!verification.ok) return verification;
-		this.#prepared.verified = further(this.#prepared.verified, anchor);
-		return { ok: true };
-	}
-	/**
-	* Every checkpoint, not only the newest: each signed by the key whose log
-	* key wrote its entry, over a prefix the log still holds (`holds`), entry
-	* for entry. Its entry's MAC is checked by now, and one under a key the
-	* vault replaced comes before the rotation.
+	* Every checkpoint walked, not only the newest: each signed by the key
+	* whose log key wrote its entry, over a prefix the log still holds,
+	* entry for entry, which one that keeps a tally names as related. Its
+	* entry's MAC is checked by now, and one under a key the vault replaced
+	* comes before the rotation.
 	*/
-	async #checkpointFault(findings, holds) {
+	async #checkpointFault(db, checkpoints, known) {
+		if (checkpoints.length === 0) return null;
+		const holds = known ?? await this.#holding(db, checkpoints.map(({ checkpoint }) => checkpoint));
 		const { logKeys, signers } = this.#prepared;
 		const verifiers = /* @__PURE__ */ new Map();
 		const signed = (checkpoint, by) => {
@@ -3324,14 +3951,13 @@ var VaultService = class {
 			if (verifier === void 0) verifiers.set(by.keyId, verifier = checkpointVerifier(by.publicKey));
 			return verifier.then((verify) => verify(checkpoint));
 		};
-		const { checkpoints } = findings;
 		for (let from = 0; from < checkpoints.length; from += SIGNATURES_AT_ONCE) {
 			const chunk = checkpoints.slice(from, from + SIGNATURES_AT_ONCE);
 			const faults = await Promise.all(chunk.map(async ({ entry, checkpoint }) => {
 				const by = signers[logKeys.findIndex((key) => key.keyId === entry.keyId)];
 				if (by?.keyId !== checkpoint.keyId) return `a checkpoint signed under ${checkpoint.keyId}, in an entry written under ${entry.keyId}: each key signs only its own`;
 				if (!await signed(checkpoint, by)) return "a checkpoint the vault did not sign";
-				if (BigInt(checkpoint.seq) >= entry.seq || !holds(checkpoint)) return `the log up to entry ${checkpoint.seq} is not the prefix this checkpoint signed: it was rewritten`;
+				if (BigInt(checkpoint.seq) >= entry.seq || !holds(checkpoint) || entry.relatedSeq !== null && entry.relatedSeq !== BigInt(checkpoint.seq)) return `the log up to entry ${checkpoint.seq} is not the prefix this checkpoint signed: it was rewritten`;
 				return null;
 			}));
 			const at = faults.findIndex((fault) => fault !== null);
@@ -3345,8 +3971,8 @@ var VaultService = class {
 	}
 	/**
 	* The first member whose row fails its MAC, or names an older access
-	* entry than the log's newest about them (`newest`, from the full check's
-	* pass, where each entry's MAC was checked).
+	* entry than the log's newest about them (`newest`, from the walk, where
+	* each entry's MAC was checked, on from the tally).
 	*/
 	#unsealed(rows, held, newest) {
 		for (const row of rows) {
@@ -3365,44 +3991,71 @@ var VaultService = class {
 		return null;
 	}
 };
+/** Whether a statement was cancelled for taking too long: Postgres's `query_canceled`, a statement timeout among them. */
+function timedOut(error) {
+	for (let cause = error; typeof cause === "object" && cause !== null; cause = cause.cause) if (cause.code === "57014") return true;
+	return false;
+}
+const FIRST_ENTRY = {
+	ok: true,
+	entry: null,
+	at: START,
+	tally: EMPTY_TALLY,
+	digest: accessDigest(EMPTY_TALLY.access),
+	carrier: null,
+	scrub: null
+};
 /**
-* What one pass over the vault's entries gathers for the other checks of a
-* full verification, so that the log is read once: the key batches, the
-* access entries replayed, each member's newest, and the checkpoints. Each
-* entry comes after its MAC was checked.
+* A walk rehashes, MACs and replays some 40 µs of CPU an entry, and 95
+* with V8's optimizer off, as on a cold isolate: 10,000 entries is a beat
+* of catching up, about a second, and a team's instance writes fewer than
+* a thousand a day. The rehash of the past is a hash an entry, 14 µs warm
+* and 55 cold, beside two reads: 100 entries keep it near 6 ms a beat.
 */
-var Findings = class {
-	accounting = new KeyAccounting();
-	replayed = {
-		members: /* @__PURE__ */ new Map(),
-		held: /* @__PURE__ */ new Map()
-	};
-	/** The first access entry the replay could not apply. */
-	replayFault = null;
-	/** Each member's newest allowed access entry, by seq. */
-	newestAccess = /* @__PURE__ */ new Map();
-	/** Every allowed checkpoint, with its entry's seq and key: tens of thousands a year, so nothing more of it. */
-	checkpoints = [];
-	/** The vault's entries read. */
-	entries = 0;
-	add(entry) {
-		this.entries += 1;
-		this.accounting.add(entry);
-		if (entry.decision !== "allow") return;
-		if (ACCESS.has(entry.action)) {
-			this.replayFault ??= apply(this.replayed, entry);
-			if (entry.subjectPrincipal !== null) this.newestAccess.set(entry.subjectPrincipal, entry.seq);
-		} else if (entry.action === CHECKPOINT) this.checkpoints.push({
-			entry: {
-				seq: entry.seq,
-				keyId: entry.keyId
-			},
-			checkpoint: JSON.parse(entry.metadata)
-		});
-	}
+const WALKS = {
+	checkpoint: 1e4,
+	scrub: 100,
+	verify: 1e4
 };
-const ACCESS = new Set(ACCESS_ACTIONS);
-/** Checkpoint signatures checked at once, in a full verification. */
+/** The digest of the members and grants a checkpoint keeps whole, beside the digest it says they have. */
+function keptDigest({ members, grants, newest }) {
+	return accessDigest({
+		members,
+		grants,
+		newest
+	});
+}
+/** Each checkpoint entry's metadata, parsed once however many times it is asked about: one may hold every member and grant. */
+const parsed = /* @__PURE__ */ new WeakMap();
+function metadataOf(entry) {
+	if (!parsed.has(entry)) parsed.set(entry, JSON.parse(entry.metadata));
+	return parsed.get(entry);
+}
+/** A head, as an entry keeps it, as a walk goes on from it. */
+function positionOf(head) {
+	return {
+		seq: BigInt(head.seq),
+		hash: Buffer.from(head.hash, "hex")
+	};
+}
+/** A position as the log's heads are named, in hex. */
+function headOf(position) {
+	return {
+		seq: Number(position.seq),
+		hash: position.hash.toString("hex")
+	};
+}
+/** What a checkpoint's signature covers, and nothing it keeps beside it. */
+function signedPart({ seq, hash, signedAt, keyId, signature }) {
+	return {
+		seq,
+		hash,
+		signedAt,
+		keyId,
+		signature
+	};
+}
+/** Checkpoint signatures checked at once. */
 const SIGNATURES_AT_ONCE = 256;
 /** Settle every operation before releasing the member lock, including cancelled requests. */
 async function settle(operations, budgetMs) {