@cloudbitmaps/core 0.9.0 → 0.11.0

package/dist/driver-kit.js

@@ -0,0 +1,275 @@
+import {
+  DEFAULT_NAMESPACE,
+  IntegrityError,
+  NotFoundError,
+  STORAGE_BACKEND,
+  TransientError,
+  ValidationError,
+  WriteConflictError,
+  applyRegistryPatch,
+  brandAsBackend,
+  decodeNameFromKey,
+  encodeNameForKey,
+  encodeNameForPath,
+  isNotFoundError,
+  isValidationError,
+  isWriteConflictError,
+  mapWithConcurrency,
+  namespaceKeyPart,
+  namespacePathPart,
+  parseRegistryEnvelope,
+  recordFromNew,
+  registryCounterOf,
+  serializeRegistryEnvelope,
+  validateNewRegistryRecord,
+  validateRegistryPatch,
+  validateSegmentRef
+} from "./chunk-5OMC5U7U.js";
+
+// src/drivers/_shared/object-registry-keys.ts
+var REGISTRY_SUFFIX = ".reg";
+function prefixPart(prefix) {
+  if (prefix === void 0) return "";
+  const trimmed = prefix.replace(/^\/+|\/+$/g, "");
+  return trimmed === "" ? "" : `${trimmed}/`;
+}
+function normalizeObjectPrefix(prefix) {
+  if (prefix === void 0) return void 0;
+  for (const ch of prefix) {
+    const code = ch.charCodeAt(0);
+    if (code < 32 || code === 127) {
+      throw new ValidationError("prefix must not contain control characters");
+    }
+  }
+  if (prefix.includes("\\")) {
+    throw new ValidationError(
+      `prefix must not contain backslashes (a path separator on some backends): ${JSON.stringify(prefix)}`
+    );
+  }
+  let decoded;
+  try {
+    decoded = decodeURIComponent(prefix);
+  } catch {
+    decoded = prefix;
+  }
+  for (const source of decoded === prefix ? [prefix] : [prefix, decoded]) {
+    for (const segment of source.split("/")) {
+      if (segment === "." || segment === "..") {
+        throw new ValidationError(
+          `prefix must not contain "." or ".." path segments: ${JSON.stringify(prefix)}`
+        );
+      }
+    }
+  }
+  return prefix;
+}
+function registryPrefix(prefix) {
+  return `${prefixPart(prefix)}registry/`;
+}
+function registryObjectKey(prefix, ref) {
+  validateSegmentRef(ref);
+  return `${registryPrefix(prefix)}${namespaceKeyPart(ref.namespace)}/${encodeNameForKey(ref.segment)}${REGISTRY_SUFFIX}`;
+}
+function registryListPrefix(prefix, namespace) {
+  const base = registryPrefix(prefix);
+  return namespace === void 0 ? base : `${base}${namespaceKeyPart(namespace)}/`;
+}
+function parseRegistryKey(prefix, objectKey) {
+  const base = registryPrefix(prefix);
+  if (!objectKey.startsWith(base) || !objectKey.endsWith(REGISTRY_SUFFIX)) return null;
+  const rest = objectKey.slice(base.length, objectKey.length - REGISTRY_SUFFIX.length);
+  const slash = rest.indexOf("/");
+  if (slash < 0) return null;
+  const nsPart = rest.slice(0, slash);
+  const encodedSegment = rest.slice(slash + 1);
+  if (encodedSegment.length === 0 || encodedSegment.includes("/")) return null;
+  const segment = decodeNameFromKey(encodedSegment);
+  const namespace = nsPart === DEFAULT_NAMESPACE ? void 0 : decodeNameFromKey(nsPart);
+  if (encodeNameForKey(segment) !== encodedSegment) return null;
+  if (namespace !== void 0 && encodeNameForKey(namespace) !== nsPart) return null;
+  const ref = { segment, namespace };
+  try {
+    validateSegmentRef(ref);
+  } catch {
+    return null;
+  }
+  return ref;
+}
+
+// src/drivers/_shared/object-registry.ts
+var MAX_ROW_BYTES = 1 * 1024 * 1024;
+var MAX_DELETE_ATTEMPTS = 8;
+var MAX_READ_ATTEMPTS = 8;
+var LIST_READ_CONCURRENCY = 16;
+var ObjectVersionRaced = class extends Error {
+  constructor(objectKey) {
+    super(`registry object was overwritten mid-read: ${objectKey}`);
+    this.name = "ObjectVersionRaced";
+  }
+};
+var ObjectStoreRegistry = class {
+  constructor(store, prefix, now) {
+    this.store = store;
+    this.prefix = prefix;
+    this.now = now;
+  }
+  store;
+  prefix;
+  now;
+  capabilities() {
+    return { strongRead: true };
+  }
+  async get(ref) {
+    const current = await this.readRow(registryObjectKey(this.prefix, ref));
+    return current && !current.env.deleted ? current.env.record : null;
+  }
+  async create(ref, record) {
+    validateNewRegistryRecord(record);
+    const key = registryObjectKey(this.prefix, ref);
+    const current = await this.readRow(key);
+    if (current !== null && !current.env.deleted) {
+      throw new WriteConflictError(`registry row already exists for segment ${ref.segment}`);
+    }
+    const token = String(current ? registryCounterOf(current.env.record) + 1 : 0);
+    const env = {
+      deleted: false,
+      record: recordFromNew(ref, record, this.now(), token)
+    };
+    await this.putRow(key, env, current ? { version: current.version } : "absent");
+    return { token };
+  }
+  async compareAndSwap(ref, expected, patch) {
+    validateRegistryPatch(patch);
+    const key = registryObjectKey(this.prefix, ref);
+    const current = await this.readRow(key);
+    if (current === null || current.env.deleted || current.env.record.token !== expected) {
+      throw new WriteConflictError(`OCC token mismatch for registry row ${ref.segment}`);
+    }
+    const token = String(registryCounterOf(current.env.record) + 1);
+    const env = {
+      deleted: false,
+      record: applyRegistryPatch(current.env.record, patch, this.now(), token)
+    };
+    await this.putRow(key, env, { version: current.version });
+    return { token };
+  }
+  async *list(namespace) {
+    const prefix = registryListPrefix(this.prefix, namespace);
+    let page = [];
+    const flush = async function* (keys) {
+      const rows = await mapWithConcurrency(
+        keys,
+        LIST_READ_CONCURRENCY,
+        (key) => this.readRow(key)
+      );
+      for (const current of rows) {
+        if (current && !current.env.deleted) yield current.env.record;
+      }
+    }.bind(this);
+    for await (const key of this.store.listKeys(prefix)) {
+      if (parseRegistryKey(this.prefix, key) === null) continue;
+      page.push(key);
+      if (page.length >= LIST_READ_CONCURRENCY) {
+        yield* flush(page);
+        page = [];
+      }
+    }
+    if (page.length > 0) yield* flush(page);
+  }
+  async delete(ref, expected) {
+    const key = registryObjectKey(this.prefix, ref);
+    for (let attempt = 0; attempt < MAX_DELETE_ATTEMPTS; attempt++) {
+      const current = await this.readRow(key);
+      if (expected !== void 0) {
+        if (current === null || current.env.deleted || current.env.record.token !== expected) {
+          throw new WriteConflictError(`OCC token mismatch for registry row ${ref.segment}`);
+        }
+      } else if (current === null || current.env.deleted) {
+        return;
+      }
+      const token = String(registryCounterOf(current.env.record) + 1);
+      const env = {
+        deleted: true,
+        record: { ...current.env.record, token, updatedAt: this.now() }
+      };
+      try {
+        await this.putRow(key, env, { version: current.version });
+        return;
+      } catch (err) {
+        if (isWriteConflictError(err)) continue;
+        throw err;
+      }
+    }
+    throw new WriteConflictError(
+      `registry delete: contention tombstoning "${ref.segment}" \u2014 retry`
+    );
+  }
+  /**
+   * Read + parse a registry object, returning its envelope and version fence, or null if absent.
+   *
+   * A store that pins a version to read consistently ({@link ObjectVersionRaced}) loses that pin whenever a
+   * concurrent writer lands mid-read. Re-reading is the whole answer — the next read simply observes the
+   * newer version — and it is bounded so a row under permanent write saturation fails typed instead of
+   * spinning. Only a store racing itself gets here; S3 never does.
+   */
+  async readRow(objectKey) {
+    const row = await this.readRaced(objectKey);
+    if (row === null) return null;
+    if (row.bytes.length > MAX_ROW_BYTES) {
+      throw new IntegrityError(
+        `registry object ${row.bytes.length}B exceeds cap ${MAX_ROW_BYTES}B`
+      );
+    }
+    if (row.version.length === 0) {
+      throw new IntegrityError(
+        `registry object has no version fence (needed for compare-and-swap): ${objectKey}`
+      );
+    }
+    const env = parseRegistryEnvelope(new TextDecoder().decode(row.bytes), objectKey);
+    return { env, version: row.version };
+  }
+  /** {@link ObjectRegistryStore.read}, retrying the bounded number of times a mid-read overwrite allows. */
+  async readRaced(objectKey) {
+    for (let attempt = 0; attempt < MAX_READ_ATTEMPTS; attempt++) {
+      try {
+        return await this.store.read(objectKey);
+      } catch (err) {
+        if (!(err instanceof ObjectVersionRaced)) throw err;
+      }
+    }
+    throw new TransientError(
+      `registry read: ${this.store.label} object "${objectKey}" was overwritten on every one of ${MAX_READ_ATTEMPTS} attempts \u2014 retry`
+    );
+  }
+  /** Conditional write of an envelope. The store maps a lost precondition to {@link WriteConflictError}. */
+  async putRow(objectKey, env, expect) {
+    const body = new TextEncoder().encode(serializeRegistryEnvelope(env));
+    if (body.length > MAX_ROW_BYTES) {
+      throw new ValidationError(`registry object ${body.length}B exceeds cap ${MAX_ROW_BYTES}B`);
+    }
+    await this.store.write(objectKey, body, expect);
+  }
+};
+export {
+  IntegrityError,
+  MAX_ROW_BYTES,
+  NotFoundError,
+  ObjectStoreRegistry,
+  ObjectVersionRaced,
+  STORAGE_BACKEND,
+  TransientError,
+  ValidationError,
+  WriteConflictError,
+  brandAsBackend,
+  encodeNameForKey,
+  encodeNameForPath,
+  isNotFoundError,
+  isValidationError,
+  isWriteConflictError,
+  namespaceKeyPart,
+  namespacePathPart,
+  normalizeObjectPrefix,
+  prefixPart,
+  validateSegmentRef
+};
+//# sourceMappingURL=driver-kit.js.map

package/dist/driver-kit.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/drivers/_shared/object-registry-keys.ts", "../src/drivers/_shared/object-registry.ts"],
+  "sourcesContent": ["/**\n * The registry object layout, shared by every object-store registry (S3, GCS, Azure Blob).\n *\n * One tiny JSON object per segment at `<prefix>registry/<ns>/<segment>.reg`, **registry-first** \u2014 separate\n * from the namespace-first storage layout (`<prefix><ns>/segments/\u2026`) \u2014 so discovery is a single list over\n * `registry/` for all namespaces, or `registry/<ns>/` for one, never entangled with the `.crbm` payloads.\n *\n * It lives here rather than in a driver because all three object stores encode names the same way\n * (`encodeNameForKey`, `namespaceKeyPart`) and build byte-identical keys. Three copies of this would be\n * three chances for one cloud's layout to drift from the others \u2014 and a drifted key is not a visible bug, it\n * is a segment that quietly cannot be found by a store pointed at the same bucket.\n */\nimport { ValidationError } from '@/core/errors';\nimport { validateSegmentRef } from '@/core/validate';\nimport type { SegmentRef } from '@/core/ports';\nimport { DEFAULT_NAMESPACE, decodeNameFromKey, encodeNameForKey, namespaceKeyPart } from './keys';\n\nconst REGISTRY_SUFFIX = '.reg';\n\n/** Normalize an optional caller prefix to either `''` or `trimmed/` (no leading/trailing slashes). */\nexport function prefixPart(prefix: string | undefined): string {\n  if (prefix === undefined) return '';\n  const trimmed = prefix.replace(/^\\/+|\\/+$/g, '');\n  return trimmed === '' ? '' : `${trimmed}/`;\n}\n\n/**\n * Validate a caller-supplied key prefix (trusted config, but make it a real containment boundary): reject\n * control characters and `.`/`..` path segments so a prefix cannot traverse out of its intended space.\n * Returns it unchanged \u2014 the key builders normalize slashes.\n *\n * The traversal check covers three spellings, because the tools that walk these buckets do. A bare `..` is\n * the obvious one. A **backslash** segment matters on ADLS Gen2 and to Windows-side tooling, which treat it\n * as a separator this code otherwise would not. And a percent-encoded `..` matters because `gsutil`,\n * `s3fs`, `gcsfuse` and `azcopy` decode a key on their way to a local path \u2014 the same reasoning\n * `name-codec.ts` already applies to segment names, which a prefix has no reason to be exempt from.\n */\nexport function normalizeObjectPrefix(prefix: string | undefined): string | undefined {\n  if (prefix === undefined) return undefined;\n  for (const ch of prefix) {\n    const code = ch.charCodeAt(0);\n    // C0 plus DEL: a bare `< 0x20` lets U+007F through, and it is as unprintable as the rest.\n    if (code < 0x20 || code === 0x7f) {\n      throw new ValidationError('prefix must not contain control characters');\n    }\n  }\n  if (prefix.includes('\\\\')) {\n    throw new ValidationError(\n      `prefix must not contain backslashes (a path separator on some backends): ${JSON.stringify(prefix)}`,\n    );\n  }\n  // Check the decoded spelling too, so an encoded `..` cannot slip past the literal comparison.\n  let decoded: string;\n  try {\n    decoded = decodeURIComponent(prefix);\n  } catch {\n    decoded = prefix; // not valid percent-encoding; the literal check still applies\n  }\n  for (const source of decoded === prefix ? [prefix] : [prefix, decoded]) {\n    for (const segment of source.split('/')) {\n      if (segment === '.' || segment === '..') {\n        throw new ValidationError(\n          `prefix must not contain \".\" or \"..\" path segments: ${JSON.stringify(prefix)}`,\n        );\n      }\n    }\n  }\n  return prefix;\n}\n\n/** The key prefix under which every registry object lives: `<prefix>registry/`. */\nexport function registryPrefix(prefix: string | undefined): string {\n  return `${prefixPart(prefix)}registry/`;\n}\n\n/** The full key of one segment's registry object: `<prefix>registry/<ns>/<segment>.reg`. */\nexport function registryObjectKey(prefix: string | undefined, ref: SegmentRef): string {\n  validateSegmentRef(ref);\n  return `${registryPrefix(prefix)}${namespaceKeyPart(ref.namespace)}/${encodeNameForKey(ref.segment)}${REGISTRY_SUFFIX}`;\n}\n\n/** The list prefix for discovery: registry-wide, or scoped to one namespace. */\nexport function registryListPrefix(prefix: string | undefined, namespace?: string): string {\n  const base = registryPrefix(prefix);\n  return namespace === undefined ? base : `${base}${namespaceKeyPart(namespace)}/`;\n}\n\n/**\n * Parse a `<prefix>registry/<ns>/<segment>.reg` key back to its {@link SegmentRef}, or `null` if it does not\n * match \u2014 a stray or foreign object under the prefix, or one whose parsed ref fails the round-trip check.\n * `_default` maps back to the absent namespace. A name is percent-encoded on the way in, so no encoded name\n * can contain `/` and the split stays unambiguous whatever the caller named their segment.\n */\nexport function parseRegistryKey(prefix: string | undefined, objectKey: string): SegmentRef | null {\n  const base = registryPrefix(prefix);\n  if (!objectKey.startsWith(base) || !objectKey.endsWith(REGISTRY_SUFFIX)) return null;\n  const rest = objectKey.slice(base.length, objectKey.length - REGISTRY_SUFFIX.length);\n  const slash = rest.indexOf('/');\n  if (slash < 0) return null;\n  const nsPart = rest.slice(0, slash);\n  const encodedSegment = rest.slice(slash + 1);\n  if (encodedSegment.length === 0 || encodedSegment.includes('/')) return null;\n  const segment = decodeNameFromKey(encodedSegment);\n  const namespace = nsPart === DEFAULT_NAMESPACE ? undefined : decodeNameFromKey(nsPart);\n  // The encoding must ROUND-TRIP, not merely decode: a foreign object placed under our prefix could spell a\n  // name two ways, and reporting both would hand a sweep one segment under two identities.\n  if (encodeNameForKey(segment) !== encodedSegment) return null;\n  if (namespace !== undefined && encodeNameForKey(namespace) !== nsPart) return null;\n  const ref: SegmentRef = { segment, namespace };\n  try {\n    validateSegmentRef(ref); // reject a hostile/foreign key that isn't a valid ref\n  } catch {\n    return null;\n  }\n  return ref;\n}\n", "/**\n * `ObjectStoreRegistry` \u2014 an {@link IRegistryDriver} over any object store with conditional writes.\n *\n * Lets a **read-mostly deployment run on one bucket alone** \u2014 storage `.crbm` generations plus the registry in\n * the same place, with no separate database. One tiny JSON object per segment at\n * `<prefix>registry/<ns>/<segment>.reg` holding the `{ deleted, record }` envelope (the same shape LocalFs\n * persists). The OCC token is a monotonic counter, advanced on every mutation and even across a `delete`\n * (which **tombstones** rather than removes the object) so a deleted-then-recreated row never re-issues an\n * old token (ABA-safe) \u2014 identical semantics to the LocalFs registry, so it passes the same conformance suite.\n *\n * **The atomic swap is offloaded to the store's conditional writes.** `create` writes only if absent (or\n * over a tombstone under its version), and `compareAndSwap`/`delete` write only if the object still carries\n * the version we read \u2014 so a concurrent writer between our read and our write loses, and the loss surfaces\n * as {@link WriteConflictError}. No in-process lock is needed (unlike LocalFs): the precondition fences\n * writers *across processes*.\n *\n * **Why this is shared rather than written per cloud.** Every object store worth using has the same two\n * primitives under different names \u2014 S3 `If-None-Match: *` / `If-Match: <etag>`, GCS `ifGenerationMatch: 0`\n * / `ifGenerationMatch: <generation>`, Azure `If-None-Match: *` / `If-Match: <etag>` \u2014 so the only thing\n * that differs is three I/O calls, which is what {@link ObjectRegistryStore} abstracts. The parts that are\n * genuinely hard (the ABA-safe counter, the tombstone, the bounded delete retry, the round-trip key check)\n * exist once. Three copies would be three chances for one cloud to drift, and a drifted registry is not a\n * visible bug \u2014 it is a lost `currentGen` swap.\n *\n * **Deployment requirements** (a backend that violates these silently corrupts the registry):\n * - The store **must honor the conditional write**. One that accepts the precondition header and ignores it\n *   degrades compare-and-swap to last-write-wins \u2192 lost `currentGen` swaps.\n * - Reads must be **strongly consistent** \u2014 true of S3 (since 2020), GCS and Azure Blob \u2014 since the registry\n *   advertises `strongRead` and generation resolution depends on it.\n * - **Do not apply a lifecycle-expiration rule to the `registry/` prefix that expires a current version.**\n *   `delete` tombstones (keeps the object with an advanced counter) for ABA-safety; expiring a tombstone would let a recreate reset the\n *   token to 0 and re-issue a stale one.\n *\n * **`list()` is fail-closed, and one bad object stops it for everyone.** An object under the `registry/`\n * prefix whose key parses but whose body does not aborts the whole enumeration \u2014 every namespace, not just\n * the affected segment \u2014 and it stays that way until an operator removes the object. The error names the\n * offending key.\n *\n * That is the deliberate choice, and it is the *safer* one rather than the more convenient one. Skipping the\n * unreadable row would keep discovery running, but `list()` is what tells orphan generation collection which\n * segments exist: a row missing from the enumeration makes its storage `.crbm` generations look unreferenced,\n * and the next GC pass would delete them. Silently skipping turns a parse error into data loss. Refusing to\n * enumerate keeps every sweep off a set it cannot vouch for (invariant 5 \u2014 bytes from the tier are\n * untrusted). **Recovery:** read the named object, and either restore a valid envelope or delete it; nothing\n * else is damaged, and discovery resumes on its own.\n */\nimport {\n  IntegrityError,\n  TransientError,\n  ValidationError,\n  WriteConflictError,\n  isWriteConflictError,\n} from '@/core/errors';\nimport type {\n  IRegistryDriver,\n  NewRegistryRecord,\n  RegCaps,\n  RegistryPatch,\n  RegistryRecord,\n  SegmentRef,\n  Token,\n} from '@/core/ports';\nimport { mapWithConcurrency } from '@/core/concurrency';\nimport {\n  applyRegistryPatch,\n  parseRegistryEnvelope,\n  recordFromNew,\n  registryCounterOf,\n  serializeRegistryEnvelope,\n  validateNewRegistryRecord,\n  validateRegistryPatch,\n  type RegistryEnvelope,\n} from './registry';\nimport { parseRegistryKey, registryListPrefix, registryObjectKey } from './object-registry-keys';\n\n/** Defensive cap on a single registry object read from storage, before allocation (rows are tiny; ~1 KB). */\nexport const MAX_ROW_BYTES = 1 * 1024 * 1024;\n/** Bounded retry for `delete`'s read\u2192tombstone under cross-process contention (converges; then fails typed). */\nconst MAX_DELETE_ATTEMPTS = 8;\n/** Bounded re-read when a store's pinned version is overwritten mid-read (see {@link ObjectVersionRaced}). */\nconst MAX_READ_ATTEMPTS = 8;\n/** In-flight reads per `list()` page \u2014 turns the serial N+1 into one list plus bounded parallel reads. */\nconst LIST_READ_CONCURRENCY = 16;\n\n/**\n * Raised by a store when the version it pinned for a read vanished before it could fetch the bytes \u2014\n * a concurrent writer overwrote or deleted the object in between.\n *\n * This is deliberately **neither** of the two things it superficially resembles. It is not absence: the row\n * is very likely still live, just one version further on. And it is not a write conflict: the caller may be\n * a read-only `get()`, which has nothing to conflict with. Either is an easy misreading for a store that reads a\n * row in two calls, as the GCS and Azure Blob stores do, which is why the signal is part of the port rather than\n * left to each store's judgement. {@link ObjectStoreRegistry} answers it the only way that is correct for every\n * caller: it reads again.\n *\n * Stores whose read is atomic (S3 serves bytes and `ETag` from one `GetObject`) can never raise it.\n */\nexport class ObjectVersionRaced extends Error {\n  constructor(objectKey: string) {\n    super(`registry object was overwritten mid-read: ${objectKey}`);\n    this.name = 'ObjectVersionRaced';\n  }\n}\n\n/** One object as read, with the opaque version that fences a later conditional write. */\nexport interface ObjectRow {\n  readonly bytes: Uint8Array;\n  /** The store's version fence \u2014 an S3/Azure ETag, a GCS generation. Opaque to this class. */\n  readonly version: string;\n}\n\n/**\n * The three I/O calls an object store must provide to host a registry. Everything else \u2014 the OCC counter,\n * tombstones, the delete retry, key parsing \u2014 is implemented once above.\n */\nexport interface ObjectRegistryStore {\n  /** A label for error messages, e.g. `GCS` or `Azure Blob`. */\n  readonly label: string;\n  /**\n   * Read one object, or `null` when it is absent.\n   *\n   * **`null` means the object does not exist** \u2014 nothing weaker. A store that reads in two round trips\n   * (metadata for the version fence, then the bytes pinned to it) can find that version already gone; it\n   * MUST report that with {@link ObjectVersionRaced} rather than `null` or {@link WriteConflictError}, and\n   * the caller re-reads. Retryable faults throw {@link TransientError}.\n   *\n   * `bytes` and `version` MUST describe the **same** observation of the object: `version` is the fence a\n   * later conditional write is conditioned on, so a pair drawn from two different versions would either\n   * fail a write that should have succeeded or, worse, pass one that should not.\n   */\n  read(key: string): Promise<ObjectRow | null>;\n  /**\n   * Write one object under a precondition: `'absent'` means create-only, a version means\n   * compare-and-swap against exactly that version. A lost race MUST throw {@link WriteConflictError}.\n   *\n   * A store must not replay this write after a lost response without telling the replay apart: the replay meets\n   * the row it just wrote and its precondition fails, which would read as a lost race. Send it once, or store a\n   * write id with the row and treat a conflict whose stored row carries it as success. Retryable faults throw\n   * {@link TransientError}.\n   */\n  write(key: string, body: Uint8Array, expect: 'absent' | { version: string }): Promise<void>;\n  /** Every object key under `prefix`, paginated internally. */\n  listKeys(prefix: string): AsyncIterable<string>;\n}\n\nexport class ObjectStoreRegistry implements IRegistryDriver {\n  constructor(\n    private readonly store: ObjectRegistryStore,\n    private readonly prefix: string | undefined,\n    private readonly now: () => number,\n  ) {}\n\n  capabilities(): RegCaps {\n    return { strongRead: true };\n  }\n\n  async get(ref: SegmentRef): Promise<RegistryRecord | null> {\n    const current = await this.readRow(registryObjectKey(this.prefix, ref));\n    return current && !current.env.deleted ? current.env.record : null;\n  }\n\n  async create(ref: SegmentRef, record: NewRegistryRecord): Promise<{ token: Token }> {\n    validateNewRegistryRecord(record);\n    const key = registryObjectKey(this.prefix, ref);\n    const current = await this.readRow(key);\n    if (current !== null && !current.env.deleted) {\n      throw new WriteConflictError(`registry row already exists for segment ${ref.segment}`);\n    }\n    // Advance across a tombstone so a recreate never re-issues an old token (ABA-safe).\n    const token = String(current ? registryCounterOf(current.env.record) + 1 : 0);\n    const env: RegistryEnvelope = {\n      deleted: false,\n      record: recordFromNew(ref, record, this.now(), token),\n    };\n    // Create-only when truly absent; overwrite the tombstone under its version when recreating. Either way\n    // a concurrent create loses the precondition and surfaces as a conflict.\n    await this.putRow(key, env, current ? { version: current.version } : 'absent');\n    return { token };\n  }\n\n  async compareAndSwap(\n    ref: SegmentRef,\n    expected: Token,\n    patch: RegistryPatch,\n  ): Promise<{ token: Token }> {\n    validateRegistryPatch(patch);\n    const key = registryObjectKey(this.prefix, ref);\n    const current = await this.readRow(key);\n    if (current === null || current.env.deleted || current.env.record.token !== expected) {\n      throw new WriteConflictError(`OCC token mismatch for registry row ${ref.segment}`);\n    }\n    const token = String(registryCounterOf(current.env.record) + 1);\n    const env: RegistryEnvelope = {\n      deleted: false,\n      record: applyRegistryPatch(current.env.record, patch, this.now(), token),\n    };\n    // The version we read fences a concurrent writer between that read and this write.\n    await this.putRow(key, env, { version: current.version });\n    return { token };\n  }\n\n  async *list(namespace?: string): AsyncIterable<RegistryRecord> {\n    const prefix = registryListPrefix(this.prefix, namespace);\n    // One list plus bounded parallel reads. A serial await-in-loop made this O(N) sequential round trips.\n    let page: string[] = [];\n    const flush = async function* (\n      this: ObjectStoreRegistry,\n      keys: string[],\n    ): AsyncIterable<RegistryRecord> {\n      const rows = await mapWithConcurrency(keys, LIST_READ_CONCURRENCY, (key) =>\n        this.readRow(key),\n      );\n      for (const current of rows) {\n        if (current && !current.env.deleted) yield current.env.record;\n      }\n    }.bind(this);\n\n    for await (const key of this.store.listKeys(prefix)) {\n      if (parseRegistryKey(this.prefix, key) === null) continue; // stray or foreign object\n      page.push(key);\n      if (page.length >= LIST_READ_CONCURRENCY) {\n        yield* flush(page);\n        page = [];\n      }\n    }\n    if (page.length > 0) yield* flush(page);\n  }\n\n  async delete(ref: SegmentRef, expected?: Token): Promise<void> {\n    const key = registryObjectKey(this.prefix, ref);\n    // Tombstone (advance the counter) rather than remove the object \u2014 keeps the token monotonic for\n    // ABA-safety. Retry the read\u2192tombstone on a cross-process race; it converges, then fails typed rather\n    // than silently leaving the row live.\n    for (let attempt = 0; attempt < MAX_DELETE_ATTEMPTS; attempt++) {\n      const current = await this.readRow(key);\n      if (expected !== undefined) {\n        // Fenced: the row must still carry the token the caller read. Re-checked on every attempt, so a row\n        // that was swapped, or deleted and re-created, between two attempts is refused rather than tombstoned.\n        if (current === null || current.env.deleted || current.env.record.token !== expected) {\n          throw new WriteConflictError(`OCC token mismatch for registry row ${ref.segment}`);\n        }\n      } else if (current === null || current.env.deleted) {\n        return; // idempotent \u2014 already gone\n      }\n      const token = String(registryCounterOf(current.env.record) + 1);\n      const env: RegistryEnvelope = {\n        deleted: true,\n        record: { ...current.env.record, token, updatedAt: this.now() },\n      };\n      try {\n        await this.putRow(key, env, { version: current.version });\n        return;\n      } catch (err) {\n        if (isWriteConflictError(err)) continue; // raced \u2014 re-read and re-tombstone\n        throw err;\n      }\n    }\n    throw new WriteConflictError(\n      `registry delete: contention tombstoning \"${ref.segment}\" \u2014 retry`,\n    );\n  }\n\n  /**\n   * Read + parse a registry object, returning its envelope and version fence, or null if absent.\n   *\n   * A store that pins a version to read consistently ({@link ObjectVersionRaced}) loses that pin whenever a\n   * concurrent writer lands mid-read. Re-reading is the whole answer \u2014 the next read simply observes the\n   * newer version \u2014 and it is bounded so a row under permanent write saturation fails typed instead of\n   * spinning. Only a store racing itself gets here; S3 never does.\n   */\n  private async readRow(\n    objectKey: string,\n  ): Promise<{ env: RegistryEnvelope; version: string } | null> {\n    const row = await this.readRaced(objectKey);\n    if (row === null) return null;\n    if (row.bytes.length > MAX_ROW_BYTES) {\n      throw new IntegrityError(\n        `registry object ${row.bytes.length}B exceeds cap ${MAX_ROW_BYTES}B`,\n      );\n    }\n    if (row.version.length === 0) {\n      // The version is the OCC fence for CAS; a backend that omits it cannot be used safely as a registry.\n      throw new IntegrityError(\n        `registry object has no version fence (needed for compare-and-swap): ${objectKey}`,\n      );\n    }\n    const env = parseRegistryEnvelope(new TextDecoder().decode(row.bytes), objectKey);\n    return { env, version: row.version };\n  }\n\n  /** {@link ObjectRegistryStore.read}, retrying the bounded number of times a mid-read overwrite allows. */\n  private async readRaced(objectKey: string): Promise<ObjectRow | null> {\n    for (let attempt = 0; attempt < MAX_READ_ATTEMPTS; attempt++) {\n      try {\n        return await this.store.read(objectKey);\n      } catch (err) {\n        if (!(err instanceof ObjectVersionRaced)) throw err;\n      }\n    }\n    throw new TransientError(\n      `registry read: ${this.store.label} object \"${objectKey}\" was overwritten on every one of ` +\n        `${MAX_READ_ATTEMPTS} attempts \u2014 retry`,\n    );\n  }\n\n  /** Conditional write of an envelope. The store maps a lost precondition to {@link WriteConflictError}. */\n  private async putRow(\n    objectKey: string,\n    env: RegistryEnvelope,\n    expect: 'absent' | { version: string },\n  ): Promise<void> {\n    const body = new TextEncoder().encode(serializeRegistryEnvelope(env));\n    if (body.length > MAX_ROW_BYTES) {\n      // Belt-and-braces: the governance/DEK fields are already capped by validate*, so this cannot fire for\n      // valid input \u2014 but never write a row that would later be unreadable.\n      throw new ValidationError(`registry object ${body.length}B exceeds cap ${MAX_ROW_BYTES}B`);\n    }\n    await this.store.write(objectKey, body, expect);\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiBA,IAAM,kBAAkB;AAGjB,SAAS,WAAW,QAAoC;AAC7D,MAAI,WAAW,OAAW,QAAO;AACjC,QAAM,UAAU,OAAO,QAAQ,cAAc,EAAE;AAC/C,SAAO,YAAY,KAAK,KAAK,GAAG,OAAO;AACzC;AAaO,SAAS,sBAAsB,QAAgD;AACpF,MAAI,WAAW,OAAW,QAAO;AACjC,aAAW,MAAM,QAAQ;AACvB,UAAM,OAAO,GAAG,WAAW,CAAC;AAE5B,QAAI,OAAO,MAAQ,SAAS,KAAM;AAChC,YAAM,IAAI,gBAAgB,4CAA4C;AAAA,IACxE;AAAA,EACF;AACA,MAAI,OAAO,SAAS,IAAI,GAAG;AACzB,UAAM,IAAI;AAAA,MACR,4EAA4E,KAAK,UAAU,MAAM,CAAC;AAAA,IACpG;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACF,cAAU,mBAAmB,MAAM;AAAA,EACrC,QAAQ;AACN,cAAU;AAAA,EACZ;AACA,aAAW,UAAU,YAAY,SAAS,CAAC,MAAM,IAAI,CAAC,QAAQ,OAAO,GAAG;AACtE,eAAW,WAAW,OAAO,MAAM,GAAG,GAAG;AACvC,UAAI,YAAY,OAAO,YAAY,MAAM;AACvC,cAAM,IAAI;AAAA,UACR,sDAAsD,KAAK,UAAU,MAAM,CAAC;AAAA,QAC9E;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,eAAe,QAAoC;AACjE,SAAO,GAAG,WAAW,MAAM,CAAC;AAC9B;AAGO,SAAS,kBAAkB,QAA4B,KAAyB;AACrF,qBAAmB,GAAG;AACtB,SAAO,GAAG,eAAe,MAAM,CAAC,GAAG,iBAAiB,IAAI,SAAS,CAAC,IAAI,iBAAiB,IAAI,OAAO,CAAC,GAAG,eAAe;AACvH;AAGO,SAAS,mBAAmB,QAA4B,WAA4B;AACzF,QAAM,OAAO,eAAe,MAAM;AAClC,SAAO,cAAc,SAAY,OAAO,GAAG,IAAI,GAAG,iBAAiB,SAAS,CAAC;AAC/E;AAQO,SAAS,iBAAiB,QAA4B,WAAsC;AACjG,QAAM,OAAO,eAAe,MAAM;AAClC,MAAI,CAAC,UAAU,WAAW,IAAI,KAAK,CAAC,UAAU,SAAS,eAAe,EAAG,QAAO;AAChF,QAAM,OAAO,UAAU,MAAM,KAAK,QAAQ,UAAU,SAAS,gBAAgB,MAAM;AACnF,QAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,MAAI,QAAQ,EAAG,QAAO;AACtB,QAAM,SAAS,KAAK,MAAM,GAAG,KAAK;AAClC,QAAM,iBAAiB,KAAK,MAAM,QAAQ,CAAC;AAC3C,MAAI,eAAe,WAAW,KAAK,eAAe,SAAS,GAAG,EAAG,QAAO;AACxE,QAAM,UAAU,kBAAkB,cAAc;AAChD,QAAM,YAAY,WAAW,oBAAoB,SAAY,kBAAkB,MAAM;AAGrF,MAAI,iBAAiB,OAAO,MAAM,eAAgB,QAAO;AACzD,MAAI,cAAc,UAAa,iBAAiB,SAAS,MAAM,OAAQ,QAAO;AAC9E,QAAM,MAAkB,EAAE,SAAS,UAAU;AAC7C,MAAI;AACF,uBAAmB,GAAG;AAAA,EACxB,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACvCO,IAAM,gBAAgB,IAAI,OAAO;AAExC,IAAM,sBAAsB;AAE5B,IAAM,oBAAoB;AAE1B,IAAM,wBAAwB;AAevB,IAAM,qBAAN,cAAiC,MAAM;AAAA,EAC5C,YAAY,WAAmB;AAC7B,UAAM,6CAA6C,SAAS,EAAE;AAC9D,SAAK,OAAO;AAAA,EACd;AACF;AA2CO,IAAM,sBAAN,MAAqD;AAAA,EAC1D,YACmB,OACA,QACA,KACjB;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EAHgB;AAAA,EACA;AAAA,EACA;AAAA,EAGnB,eAAwB;AACtB,WAAO,EAAE,YAAY,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAM,IAAI,KAAiD;AACzD,UAAM,UAAU,MAAM,KAAK,QAAQ,kBAAkB,KAAK,QAAQ,GAAG,CAAC;AACtE,WAAO,WAAW,CAAC,QAAQ,IAAI,UAAU,QAAQ,IAAI,SAAS;AAAA,EAChE;AAAA,EAEA,MAAM,OAAO,KAAiB,QAAsD;AAClF,8BAA0B,MAAM;AAChC,UAAM,MAAM,kBAAkB,KAAK,QAAQ,GAAG;AAC9C,UAAM,UAAU,MAAM,KAAK,QAAQ,GAAG;AACtC,QAAI,YAAY,QAAQ,CAAC,QAAQ,IAAI,SAAS;AAC5C,YAAM,IAAI,mBAAmB,2CAA2C,IAAI,OAAO,EAAE;AAAA,IACvF;AAEA,UAAM,QAAQ,OAAO,UAAU,kBAAkB,QAAQ,IAAI,MAAM,IAAI,IAAI,CAAC;AAC5E,UAAM,MAAwB;AAAA,MAC5B,SAAS;AAAA,MACT,QAAQ,cAAc,KAAK,QAAQ,KAAK,IAAI,GAAG,KAAK;AAAA,IACtD;AAGA,UAAM,KAAK,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,QAAQ,QAAQ,IAAI,QAAQ;AAC7E,WAAO,EAAE,MAAM;AAAA,EACjB;AAAA,EAEA,MAAM,eACJ,KACA,UACA,OAC2B;AAC3B,0BAAsB,KAAK;AAC3B,UAAM,MAAM,kBAAkB,KAAK,QAAQ,GAAG;AAC9C,UAAM,UAAU,MAAM,KAAK,QAAQ,GAAG;AACtC,QAAI,YAAY,QAAQ,QAAQ,IAAI,WAAW,QAAQ,IAAI,OAAO,UAAU,UAAU;AACpF,YAAM,IAAI,mBAAmB,uCAAuC,IAAI,OAAO,EAAE;AAAA,IACnF;AACA,UAAM,QAAQ,OAAO,kBAAkB,QAAQ,IAAI,MAAM,IAAI,CAAC;AAC9D,UAAM,MAAwB;AAAA,MAC5B,SAAS;AAAA,MACT,QAAQ,mBAAmB,QAAQ,IAAI,QAAQ,OAAO,KAAK,IAAI,GAAG,KAAK;AAAA,IACzE;AAEA,UAAM,KAAK,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ,QAAQ,CAAC;AACxD,WAAO,EAAE,MAAM;AAAA,EACjB;AAAA,EAEA,OAAO,KAAK,WAAmD;AAC7D,UAAM,SAAS,mBAAmB,KAAK,QAAQ,SAAS;AAExD,QAAI,OAAiB,CAAC;AACtB,UAAM,QAAQ,iBAEZ,MAC+B;AAC/B,YAAM,OAAO,MAAM;AAAA,QAAmB;AAAA,QAAM;AAAA,QAAuB,CAAC,QAClE,KAAK,QAAQ,GAAG;AAAA,MAClB;AACA,iBAAW,WAAW,MAAM;AAC1B,YAAI,WAAW,CAAC,QAAQ,IAAI,QAAS,OAAM,QAAQ,IAAI;AAAA,MACzD;AAAA,IACF,EAAE,KAAK,IAAI;AAEX,qBAAiB,OAAO,KAAK,MAAM,SAAS,MAAM,GAAG;AACnD,UAAI,iBAAiB,KAAK,QAAQ,GAAG,MAAM,KAAM;AACjD,WAAK,KAAK,GAAG;AACb,UAAI,KAAK,UAAU,uBAAuB;AACxC,eAAO,MAAM,IAAI;AACjB,eAAO,CAAC;AAAA,MACV;AAAA,IACF;AACA,QAAI,KAAK,SAAS,EAAG,QAAO,MAAM,IAAI;AAAA,EACxC;AAAA,EAEA,MAAM,OAAO,KAAiB,UAAiC;AAC7D,UAAM,MAAM,kBAAkB,KAAK,QAAQ,GAAG;AAI9C,aAAS,UAAU,GAAG,UAAU,qBAAqB,WAAW;AAC9D,YAAM,UAAU,MAAM,KAAK,QAAQ,GAAG;AACtC,UAAI,aAAa,QAAW;AAG1B,YAAI,YAAY,QAAQ,QAAQ,IAAI,WAAW,QAAQ,IAAI,OAAO,UAAU,UAAU;AACpF,gBAAM,IAAI,mBAAmB,uCAAuC,IAAI,OAAO,EAAE;AAAA,QACnF;AAAA,MACF,WAAW,YAAY,QAAQ,QAAQ,IAAI,SAAS;AAClD;AAAA,MACF;AACA,YAAM,QAAQ,OAAO,kBAAkB,QAAQ,IAAI,MAAM,IAAI,CAAC;AAC9D,YAAM,MAAwB;AAAA,QAC5B,SAAS;AAAA,QACT,QAAQ,EAAE,GAAG,QAAQ,IAAI,QAAQ,OAAO,WAAW,KAAK,IAAI,EAAE;AAAA,MAChE;AACA,UAAI;AACF,cAAM,KAAK,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ,QAAQ,CAAC;AACxD;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,qBAAqB,GAAG,EAAG;AAC/B,cAAM;AAAA,MACR;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR,4CAA4C,IAAI,OAAO;AAAA,IACzD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAc,QACZ,WAC4D;AAC5D,UAAM,MAAM,MAAM,KAAK,UAAU,SAAS;AAC1C,QAAI,QAAQ,KAAM,QAAO;AACzB,QAAI,IAAI,MAAM,SAAS,eAAe;AACpC,YAAM,IAAI;AAAA,QACR,mBAAmB,IAAI,MAAM,MAAM,iBAAiB,aAAa;AAAA,MACnE;AAAA,IACF;AACA,QAAI,IAAI,QAAQ,WAAW,GAAG;AAE5B,YAAM,IAAI;AAAA,QACR,uEAAuE,SAAS;AAAA,MAClF;AAAA,IACF;AACA,UAAM,MAAM,sBAAsB,IAAI,YAAY,EAAE,OAAO,IAAI,KAAK,GAAG,SAAS;AAChF,WAAO,EAAE,KAAK,SAAS,IAAI,QAAQ;AAAA,EACrC;AAAA;AAAA,EAGA,MAAc,UAAU,WAA8C;AACpE,aAAS,UAAU,GAAG,UAAU,mBAAmB,WAAW;AAC5D,UAAI;AACF,eAAO,MAAM,KAAK,MAAM,KAAK,SAAS;AAAA,MACxC,SAAS,KAAK;AACZ,YAAI,EAAE,eAAe,oBAAqB,OAAM;AAAA,MAClD;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR,kBAAkB,KAAK,MAAM,KAAK,YAAY,SAAS,qCAClD,iBAAiB;AAAA,IACxB;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,OACZ,WACA,KACA,QACe;AACf,UAAM,OAAO,IAAI,YAAY,EAAE,OAAO,0BAA0B,GAAG,CAAC;AACpE,QAAI,KAAK,SAAS,eAAe;AAG/B,YAAM,IAAI,gBAAgB,mBAAmB,KAAK,MAAM,iBAAiB,aAAa,GAAG;AAAA,IAC3F;AACA,UAAM,KAAK,MAAM,MAAM,WAAW,MAAM,MAAM;AAAA,EAChD;AACF;",
+  "names": []
+}

package/dist/drivers/_shared/keys.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Shared key-grammar fragments used by every driver's logical-ref → physical-key mapping.
+ *
+ * One copy of the `_default` namespace sentinel for every driver that maps a namespace to a key or a path. Pure
+ * string logic, no SDK, no I/O — it lives in the SDK-free `_shared` bundle so any driver may import it.
+ */
+/**
+ * The physical stand-in for an **absent** namespace. A caller MAY name a namespace `_default`; it simply does not collide, because
+ * `namespaceKeyPart`/`namespacePathPart` encode the caller's namespace (to `%5Fdefault`) and emit this
+ * sentinel literally. The separation is a property of the encoding, not of a grammar; reading it as a grammar is
+ * exactly what would make the collision easy to reintroduce.
+ */
+export declare const DEFAULT_NAMESPACE = "_default";
+/**
+ * The physical namespace component of an **object key**: the caller's namespace encoded, or the sentinel.
+ *
+ * The sentinel is emitted **literally, never encoded**, and that asymmetry is the whole point. Encoding it too
+ * would send an absent namespace to `%5Fdefault` — exactly where a caller who names their namespace `_default`
+ * already goes, since the encoder escapes their leading underscore. Both would land in one place and read each
+ * other's data. Encoding only the caller's side means `_default` (ours) and `%5Fdefault` (theirs) are two
+ * different strings, and no caller can produce the first.
+ */
+export declare function namespaceKeyPart(namespace: string | undefined): string;
+/** As {@link namespaceKeyPart}, for a filesystem path component. */
+export declare function namespacePathPart(namespace: string | undefined): string;
+export { encodeNameForKey, decodeNameFromKey, encodeNameForPath, decodeNameFromPath, } from '../../core/name-codec.js';

package/dist/drivers/_shared/object-registry-keys.d.ts

@@ -0,0 +1,28 @@
+import type { SegmentRef } from '../../core/ports.js';
+/** Normalize an optional caller prefix to either `''` or `trimmed/` (no leading/trailing slashes). */
+export declare function prefixPart(prefix: string | undefined): string;
+/**
+ * Validate a caller-supplied key prefix (trusted config, but make it a real containment boundary): reject
+ * control characters and `.`/`..` path segments so a prefix cannot traverse out of its intended space.
+ * Returns it unchanged — the key builders normalize slashes.
+ *
+ * The traversal check covers three spellings, because the tools that walk these buckets do. A bare `..` is
+ * the obvious one. A **backslash** segment matters on ADLS Gen2 and to Windows-side tooling, which treat it
+ * as a separator this code otherwise would not. And a percent-encoded `..` matters because `gsutil`,
+ * `s3fs`, `gcsfuse` and `azcopy` decode a key on their way to a local path — the same reasoning
+ * `name-codec.ts` already applies to segment names, which a prefix has no reason to be exempt from.
+ */
+export declare function normalizeObjectPrefix(prefix: string | undefined): string | undefined;
+/** The key prefix under which every registry object lives: `<prefix>registry/`. */
+export declare function registryPrefix(prefix: string | undefined): string;
+/** The full key of one segment's registry object: `<prefix>registry/<ns>/<segment>.reg`. */
+export declare function registryObjectKey(prefix: string | undefined, ref: SegmentRef): string;
+/** The list prefix for discovery: registry-wide, or scoped to one namespace. */
+export declare function registryListPrefix(prefix: string | undefined, namespace?: string): string;
+/**
+ * Parse a `<prefix>registry/<ns>/<segment>.reg` key back to its {@link SegmentRef}, or `null` if it does not
+ * match — a stray or foreign object under the prefix, or one whose parsed ref fails the round-trip check.
+ * `_default` maps back to the absent namespace. A name is percent-encoded on the way in, so no encoded name
+ * can contain `/` and the split stays unambiguous whatever the caller named their segment.
+ */
+export declare function parseRegistryKey(prefix: string | undefined, objectKey: string): SegmentRef | null;

package/dist/drivers/_shared/object-registry.d.ts

@@ -0,0 +1,89 @@
+import type { IRegistryDriver, NewRegistryRecord, RegCaps, RegistryPatch, RegistryRecord, SegmentRef, Token } from '../../core/ports.js';
+/** Defensive cap on a single registry object read from storage, before allocation (rows are tiny; ~1 KB). */
+export declare const MAX_ROW_BYTES: number;
+/**
+ * Raised by a store when the version it pinned for a read vanished before it could fetch the bytes —
+ * a concurrent writer overwrote or deleted the object in between.
+ *
+ * This is deliberately **neither** of the two things it superficially resembles. It is not absence: the row
+ * is very likely still live, just one version further on. And it is not a write conflict: the caller may be
+ * a read-only `get()`, which has nothing to conflict with. Either is an easy misreading for a store that reads a
+ * row in two calls, as the GCS and Azure Blob stores do, which is why the signal is part of the port rather than
+ * left to each store's judgement. {@link ObjectStoreRegistry} answers it the only way that is correct for every
+ * caller: it reads again.
+ *
+ * Stores whose read is atomic (S3 serves bytes and `ETag` from one `GetObject`) can never raise it.
+ */
+export declare class ObjectVersionRaced extends Error {
+    constructor(objectKey: string);
+}
+/** One object as read, with the opaque version that fences a later conditional write. */
+export interface ObjectRow {
+    readonly bytes: Uint8Array;
+    /** The store's version fence — an S3/Azure ETag, a GCS generation. Opaque to this class. */
+    readonly version: string;
+}
+/**
+ * The three I/O calls an object store must provide to host a registry. Everything else — the OCC counter,
+ * tombstones, the delete retry, key parsing — is implemented once above.
+ */
+export interface ObjectRegistryStore {
+    /** A label for error messages, e.g. `GCS` or `Azure Blob`. */
+    readonly label: string;
+    /**
+     * Read one object, or `null` when it is absent.
+     *
+     * **`null` means the object does not exist** — nothing weaker. A store that reads in two round trips
+     * (metadata for the version fence, then the bytes pinned to it) can find that version already gone; it
+     * MUST report that with {@link ObjectVersionRaced} rather than `null` or {@link WriteConflictError}, and
+     * the caller re-reads. Retryable faults throw {@link TransientError}.
+     *
+     * `bytes` and `version` MUST describe the **same** observation of the object: `version` is the fence a
+     * later conditional write is conditioned on, so a pair drawn from two different versions would either
+     * fail a write that should have succeeded or, worse, pass one that should not.
+     */
+    read(key: string): Promise<ObjectRow | null>;
+    /**
+     * Write one object under a precondition: `'absent'` means create-only, a version means
+     * compare-and-swap against exactly that version. A lost race MUST throw {@link WriteConflictError}.
+     *
+     * A store must not replay this write after a lost response without telling the replay apart: the replay meets
+     * the row it just wrote and its precondition fails, which would read as a lost race. Send it once, or store a
+     * write id with the row and treat a conflict whose stored row carries it as success. Retryable faults throw
+     * {@link TransientError}.
+     */
+    write(key: string, body: Uint8Array, expect: 'absent' | {
+        version: string;
+    }): Promise<void>;
+    /** Every object key under `prefix`, paginated internally. */
+    listKeys(prefix: string): AsyncIterable<string>;
+}
+export declare class ObjectStoreRegistry implements IRegistryDriver {
+    private readonly store;
+    private readonly prefix;
+    private readonly now;
+    constructor(store: ObjectRegistryStore, prefix: string | undefined, now: () => number);
+    capabilities(): RegCaps;
+    get(ref: SegmentRef): Promise<RegistryRecord | null>;
+    create(ref: SegmentRef, record: NewRegistryRecord): Promise<{
+        token: Token;
+    }>;
+    compareAndSwap(ref: SegmentRef, expected: Token, patch: RegistryPatch): Promise<{
+        token: Token;
+    }>;
+    list(namespace?: string): AsyncIterable<RegistryRecord>;
+    delete(ref: SegmentRef, expected?: Token): Promise<void>;
+    /**
+     * Read + parse a registry object, returning its envelope and version fence, or null if absent.
+     *
+     * A store that pins a version to read consistently ({@link ObjectVersionRaced}) loses that pin whenever a
+     * concurrent writer lands mid-read. Re-reading is the whole answer — the next read simply observes the
+     * newer version — and it is bounded so a row under permanent write saturation fails typed instead of
+     * spinning. Only a store racing itself gets here; S3 never does.
+     */
+    private readRow;
+    /** {@link ObjectRegistryStore.read}, retrying the bounded number of times a mid-read overwrite allows. */
+    private readRaced;
+    /** Conditional write of an envelope. The store maps a lost precondition to {@link WriteConflictError}. */
+    private putRow;
+}

package/dist/drivers/_shared/registry.d.ts

@@ -0,0 +1,66 @@
+import type { NewRegistryRecord, RegistryPatch, RegistryRecord, SegmentRef, Token } from '../../core/ports.js';
+/**
+ * The fields a stored record may carry: {@link RegistryRecord}'s, and nothing else. A field no reader resolves
+ * through is refused on read-back like any other corruption (invariant 5), rather than ignored.
+ */
+export declare const RECORD_FIELDS: readonly ["namespace", "segment", "currentGen", "wrappedDeks", "keyId", "status", "retention", "residency", "createdAt", "updatedAt", "token"];
+/** Validate the caller-settable fields at `create`. */
+export declare function validateNewRegistryRecord(rec: NewRegistryRecord): void;
+/** Validate the caller-settable fields in a `compareAndSwap` patch. */
+export declare function validateRegistryPatch(patch: RegistryPatch): void;
+/**
+ * The persisted envelope for a registry row: the record plus a tombstone flag. A **deleted** row keeps its
+ * record (with an advanced counter) rather than being removed, so the monotonic token survives a
+ * delete→recreate — ABA-safety. Shared by the persistent drivers (LocalFs file, S3 object).
+ *
+ * `schemaVersion` is a wire-only concern — it stamps the persisted bytes, not the in-memory domain object —
+ * so it lives on the serialize/parse boundary ({@link serializeRegistryEnvelope} /
+ * {@link parseRegistryEnvelope}), never on this interface.
+ */
+export interface RegistryEnvelope {
+    readonly deleted: boolean;
+    readonly record: RegistryRecord;
+}
+/**
+ * Current registry-row schema version — a pre-1.0 format-freeze prerequisite. Every persistent
+ * registry driver — every one of which persists the `{ deleted, record }` envelope — stamps its rows
+ * with this so a reader can fail-closed on a future, incompatible layout instead of misparsing it. Bump only
+ * on a backward-incompatible change. Policy: a **higher** stamp than this build knows → `UnsupportedError`
+ * (fail-closed); an **absent** or malformed stamp → `IntegrityError`, since every row this build writes has one.
+ */
+export declare const REGISTRY_SCHEMA_VERSION = 1;
+/**
+ * Validate a persisted registry row's `schemaVersion` (untrusted bytes, invariant 5): an absent or malformed value
+ * → `IntegrityError`; a version newer than this build → `UnsupportedError` (fail-closed rather than misread a
+ * format we don't understand).
+ */
+export declare function assertRegistrySchemaVersion(raw: unknown, ctx: string): void;
+/** Serialize a registry envelope for persistence, stamping the current {@link REGISTRY_SCHEMA_VERSION}. */
+export declare function serializeRegistryEnvelope(env: RegistryEnvelope): string;
+/**
+ * The OCC counter encoded in a record's token. A published row always has a **canonical decimal** token
+ * (`String(counter)`), so anything else (`"1e3"`, `"0x10"`, `" 5 "`, `""`, a >2^53 value) is corruption /
+ * tampering — reject it (invariant 5) rather than let `Number()` coerce it and silently break monotonicity.
+ */
+export declare function registryCounterOf(record: RegistryRecord): number;
+/**
+ * Parse + structurally validate a persisted `{ deleted, record }` envelope from stored bytes. A published row
+ * is always whole (atomic write), so a parse failure or a missing/mistyped field means corruption/tampering —
+ * fail fast (invariant 5), never silently report "absent". `ctx` names the source (path/key) for the message.
+ */
+export declare function parseRegistryEnvelope(text: string, ctx: string): RegistryEnvelope;
+/** Build a full record from a {@link NewRegistryRecord} plus identity, audit timestamps, and an OCC token. */
+export declare function recordFromNew(ref: SegmentRef, rec: NewRegistryRecord, now: number, token: Token): RegistryRecord;
+/**
+ * Fail-fast structural check on a record read back from a persistent tier (untrusted bytes, invariant 5):
+ * a published row is always whole, so a missing/mistyped required field means corruption/tampering — reject
+ * it rather than silently report "absent". `token` is checked by the caller (its source differs per backend:
+ * an in-body field vs a derived OCC counter).
+ */
+export declare function assertStoredRecordShape(r: Record<string, unknown>, ctx: string): void;
+/**
+ * Apply a patch to an existing record, returning a new one with a fresh `updatedAt` + `token` (identity and
+ * `createdAt` are preserved). Optional fields use `'k' in patch` so a patch can *clear* them (set to
+ * `undefined`, e.g. dropping `keyId` on crypto-shred); required fields use `??` (they always have a value).
+ */
+export declare function applyRegistryPatch(prev: RegistryRecord, patch: RegistryPatch, now: number, token: Token): RegistryRecord;

package/dist/drivers/backends.d.ts

@@ -0,0 +1,43 @@
+import { STORAGE_BACKEND } from '../core/ports.js';
+import type { IRegistryDriver, IStorageDriver, StorageBackend } from '../core/ports.js';
+export interface MemoryStorageOptions {
+    /** Injected clock for the registry's `createdAt`/`updatedAt`; defaults to `Date.now`. */
+    readonly now?: () => number;
+}
+/**
+ * An in-process backend — nothing to install, nothing to clean up, and it disappears with the process.
+ *
+ * This is the one to reach for in tests and in the first five minutes. It is **not** a cache in front of
+ * anything: it is the whole store, held in RAM, so a restart is a data loss.
+ */
+export declare class MemoryStorage implements StorageBackend {
+    /** Cross-bundle brand, stamped non-enumerably in the constructor so a spread cannot carry it. */
+    readonly [STORAGE_BACKEND]: true;
+    readonly storage: IStorageDriver;
+    readonly registry: IRegistryDriver;
+    constructor(options?: MemoryStorageOptions);
+}
+export interface LocalFsStorageOptions {
+    /** Injected clock for the registry's `createdAt`/`updatedAt`; defaults to `Date.now`. */
+    readonly now?: () => number;
+}
+/**
+ * A local-filesystem backend rooted at one directory: generations under `<root>/storage`, pointers under
+ * `<root>/registry`.
+ *
+ * The layout is stated here rather than by the caller, which is the point — two paths a caller wrote out
+ * separately could name different roots, and nothing would stop them. It is also the layout
+ * the `export-segments` CLI expects, so a store built this way can be ejected without being told where to look.
+ *
+ * A root is for **one process**. Every instance in a process that names the same root shares one lock per
+ * registry row, however the root is spelled (relative path, symlink), so they cannot both advance a row from
+ * one token. Two processes on one root are **not** fenced from each other.
+ */
+export declare class LocalFsStorage implements StorageBackend {
+    readonly root: string;
+    /** Cross-bundle brand, stamped non-enumerably in the constructor so a spread cannot carry it. */
+    readonly [STORAGE_BACKEND]: true;
+    readonly storage: IStorageDriver;
+    readonly registry: IRegistryDriver;
+    constructor(root: string, options?: LocalFsStorageOptions);
+}

package/dist/drivers/crypto.d.ts

@@ -0,0 +1,38 @@
+import type { Aead, AeadSealed, IKeystore, WrappedDek } from '../core/crypto.js';
+/** AES-256-GCM AEAD bound to one 32-byte key. A fresh CSPRNG 96-bit nonce per `seal`; `aad` is authenticated,
+ * never stored. Nonce-reuse safety: the random-96-bit birthday bound is ~q²/2⁹⁷, negligible below ~2³² seals
+ * under one key. A per-segment DEK is **reused across all generations** (every load and rewrite encrypts under it), so
+ * seal count is cumulative over the segment's life — a segment approaching ~2³² lifetime chunk-seals should be
+ * re-seeded (a fresh segment ⇒ fresh DEK). Far beyond any realistic workload; noted for completeness. */
+export declare class NodeAead implements Aead {
+    private readonly key;
+    constructor(key: Uint8Array);
+    seal(plaintext: Uint8Array, aad: Uint8Array): AeadSealed;
+    open(sealed: AeadSealed, aad: Uint8Array): Uint8Array;
+}
+/**
+ * Options for {@link InProcessKeystore}. `keys` maps a `keyId` → its 32-byte KEK; `activeKeyId` names the KEK
+ * new DEKs are wrapped under; an optional `recoveryKeyId` additionally wraps each new DEK under a second
+ * (e.g. offline) KEK, so losing the active KEK isn't fatal. Rotating the active KEK needs no data
+ * re-encryption: add the new KEK, point `activeKeyId` at it, keep the old one to unwrap existing segments.
+ */
+export interface InProcessKeystoreOptions {
+    readonly keys: Readonly<Record<string, Uint8Array>>;
+    readonly activeKeyId: string;
+    readonly recoveryKeyId?: string;
+}
+/**
+ * Dependency-free BYOK keystore: envelope-wraps a fresh random per-segment DEK under the active (and optional
+ * recovery) KEK using `node:crypto`. No external service. The raw DEK never leaves a returned {@link NodeAead}.
+ */
+export declare class InProcessKeystore implements IKeystore {
+    private readonly keys;
+    private readonly activeKeyId;
+    private readonly recoveryKeyId;
+    constructor(options: InProcessKeystoreOptions);
+    createDek(): Promise<{
+        wrapped: WrappedDek[];
+        aead: Aead;
+    }>;
+    openDek(wrapped: readonly WrappedDek[]): Promise<Aead>;
+}