@voltro/database 0.2.1 → 0.3.0

package/CHANGELOG.md

@@ -39,6 +39,42 @@ _Changes staged for the next release accumulate here (rolled up from
 
 ---
 
+## [0.3.0] — 2026-07-18
+
+### ⚠ BREAKING
+
+- **@voltro/cli** — `voltro build` precompiles the whole serve path (framework + effect + `@voltro` inlined, app modules as lazy chunks) into a single **serve bundle**, and `voltro serve` boots from it in-process — cutting `serve: ready` from ~1000 ms to ~180 ms (5–6×; the win is larger on a cold scale-to-zero container). The app's declared SQL driver is inlined (only the native leaf like `pg` stays external, resolved at runtime so it survives the deploy relocation). **Production now serves ONLY from the bundle and NEVER transpiles on demand:** the bundle build externalises unresolvable optional peers (e.g. `@react-email/render` behind `@voltro/plugin-mail`) so it always builds; a bundle-build failure is **fatal** (`voltro build` exits non-zero); and an unbuilt production `voltro serve` fails loud instead of falling back to tsx. The build toolchain (`tsx`, `esbuild`, `vite`, `@vitejs/plugin-react`, `@tailwindcss/vite` + their native tree: rolldown/lightningcss/postcss/jiti) moves to **`optionalDependencies`** of `@voltro/cli`, so `pnpm --prod --no-optional deploy` yields a serve image with none of it — a prod API image's `node_modules` drops ~305 MB → ~131 MB, structurally, with no fragile prune list. `voltro dev` and a non-production local `voltro serve` are unchanged (still tsx). **Migration:** in production (`NODE_ENV=production`) run `voltro build` before `voltro serve`. The generated Dockerfiles already do; a custom Dockerfile / start script adds a `voltro build .` step before `voltro serve .` (`voltro update` prints this — see the 0.3.0 codemod note).
+
+### Added
+
+- **@voltro/protocol, @voltro/runtime, @voltro/plugin-rbac** — Declarative authorization `guards:` on `defineMutation` / `defineQuery` / `defineAction`. The framework enforces the declared scope(s) in the dispatch spine BEFORE the executor (for a mutation, before the transaction opens), fails with a typed `ScopeError`, and auto-merges `ScopeError` into the wire error union so the client decodes the denial typed. Guards are browser-safe DATA (scope strings + a pure `resource: (input) => id` extractor). Checks run against the caller's EFFECTIVE scope set — raw subject scopes ∪ `@voltro/plugin-rbac` role-derived scopes — via a new canonical effective-scope seam in `@voltro/protocol` (`effectiveScopes` / `setEffectiveScopes` / `checkGuards`), which rbac now publishes to (so a role-granted scope satisfies a `guards:` entry and the in-handler `permission()` identically). Adds `ctx.access` (`has` / `hasAny` / `require` / `scopes`) — the cast-free typed authorization slice on every handler context. Enforcement is single-sourced in the shared serve pipeline, so `voltro dev` and `voltro serve` can't drift.
+- **@voltro/protocol, @voltro/client** — Nested / path-targeted auto-optimistic. A mutation `target` can now patch a nested array INSIDE a query's value — a JSON array column (`snapshot.projects`) or a computed/shaped result — at item granularity, via `path` (dot-path to the array), `by` (item key, default `id`), and `match` (a pure predicate that scopes the patch to the entries whose current value satisfies it, preventing a patch bleeding across sibling subscriptions that share a source table). Previously auto-optimistic only patched the flat top-level row array keyed by `id`; nested values needed a hand-written `.withOptimistic` reducer. `path`/`by`/`match` are browser-safe descriptor data (a dot-path string + pure predicate), same discipline as `identify`/`shape`. A path insert is applied even on a computed entry (it targets a known document, not a blind top-level add).
+- **@voltro/runtime** — `ctx.store.applyDefined(input, keys)` (and a standalone `applyDefined` export from `@voltro/runtime`) — builds a partial-update patch keeping only the listed keys whose value the caller actually provided (`!== undefined`; a defined falsy value like `0`/`''`/`false` is kept). Collapses the per-field `if (input.x !== undefined) patch.x = input.x` idiom every partial-update mutation hand-writes.
+- **@voltro/database** — `.uniqueActive([cols], opts?)` on the table builder — a portable partial-UNIQUE constraint that holds only among the rows matching a predicate (default `"deletedAt" IS NULL`, pairing with `.softDelete()`). Emits `CREATE UNIQUE INDEX … WHERE` on postgres / sqlite / mssql, so a soft-deleted row leaves the active set and a NEW row with the same key inserts cleanly — no hand-written `generatedAs("CASE WHEN …")` column and no resurrection footgun. On mysql / mariadb (no partial-index support) it FAILS LOUDLY at migrate time rather than silently emitting a full unique index that would forbid re-creating a soft-deleted key — the generated-STORED-column lowering for those dialects is a follow-up. Kept out of the declarative index snapshot (the incremental planner is predicate-blind and would misclassify a unique+partial index as a full constraint), so the fresh-schema DDL path is its sole emitter and there is no re-diff churn. Live-verified against postgres.
+- **@voltro/cli** — `voltro update` upgrades an app to the latest framework: it bumps every `@voltro/*` dependency, installs with the detected package manager, and runs the codemods shipped with the target version. Codemods are authored with `defineCodemod` + an import-scoped ts-morph helper toolkit (`renameImport`, `renameModuleSpecifier`, `renameJsxProp`, `renameObjectKey`, `add`/`removeImport`, structural `changeCallArgs`/`wrapCall`, `annotate`) and run against the app source; a `manual` kind surfaces written steps for changes that can't be automated. Breaking public-API changes now ship a codemod (or an explicit `codemod: none`), enforced by the changelog gate. Framework-owned `_voltro_*` table changes continue to ride the declarative differ on `voltro db apply` / `voltro dev` boot — `update` does not touch the database.
+
+### Fixed
+
+- **@voltro/database** — The core-table registry (`registerCoreTables` / `requireActors` / `requireTenants`) now stores its state on a process-global `Symbol.for` singleton, the same mechanism the main table registry already uses — instead of module-local `let` bindings. Module-local state splits when the `@voltro/database` module is duplicated in a process (e.g. resolved through both the `.` and `./sql` entry points, or a bundled framework copy alongside an externally-resolved one): one instance's `registerCoreTables` becomes invisible to the instance that reads it, surfacing as a spurious `core 'actors' table not registered` at store construction. Pinning it to `globalThis` makes every copy share one store, matching the table registry's already-global behaviour.
+
+---
+
+## [0.2.2] — 2026-07-17
+
+### Added
+
+- **@voltro/cli** — `voltro build` now precompiles the whole serve path (framework + effect + `@voltro` inlined, app modules as lazy chunks) into a single **serve bundle** (`.framework/dist-api/serveBundle/serveEntry.js`), and `voltro serve` boots from it in-process — no child `node --import tsx`, no CLI command graph, no per-module resolution of the ~2700-module framework graph. This cuts `serve: ready` from ~1000 ms to ~180 ms (~5–6×) on both driverless (memory) and driver-backed (postgres) apps; the win is larger on a cold scale-to-zero container where module resolution dominates. The app's declared SQL driver is inlined into the bundle so it shares the framework's single effect instance (only the native leaf like `pg` stays external, resolved at runtime so it survives the deploy relocation). Fully fallback-safe: a missing, stale, or corrupt bundle degrades to the standard tsx serve path, so it can never stop `voltro serve` from booting. Nothing to configure — building an API app produces the bundle and serving prefers it automatically.
+
+### Fixed
+
+- **@voltro/database** — The core-table registry (`registerCoreTables` / `requireActors` / `requireTenants`) now stores its state on a process-global `Symbol.for` singleton, the same mechanism the main table registry already uses — instead of module-local `let` bindings. Module-local state splits when the `@voltro/database` module is duplicated in a process (e.g. resolved through both the `.` and `./sql` entry points, or a bundled framework copy alongside an externally-resolved one): one instance's `registerCoreTables` becomes invisible to the instance that reads it, surfacing as a spurious `core 'actors' table not registered` at store construction. Pinning it to `globalThis` makes every copy share one store, matching the table registry's already-global behaviour.
+
+### Internal (no consumer-facing effect)
+
+- **@voltro/cli** — `appModuleLoader` now accepts lazy `() => import()` loaders alongside eager module namespaces (the eager path — today's `apiEntry.js` bundle — is unchanged). Groundwork for the serve bundle: app modules registered as lazy loaders evaluate on first `importAppModule` (during `runServe`, after `registerCoreTables`) rather than eagerly at bundle-import time. No consumer-facing effect on its own.
+
+---
+
 ## [0.2.1] — 2026-07-17
 
 ### Fixed

package/dist/{fileBased-cc9IzIjU.js → fileBased-CRXgPJkv.js}

@@ -530,6 +530,30 @@ var r = class e {
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
+		uniqueActive: ((...t) => {
+			let n, r, i, a = Array.isArray(t[0]);
+			if (a ? (r = t[0], i = t[1], n = z(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
+			if (y(e.tableName, n, a, r), e.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
+			let o = i?.where ?? "\"deletedAt\" IS NULL";
+			return V({
+				tableName: e.tableName,
+				fields: e.fields,
+				isReactive: e.isReactive,
+				appliedMixins: e.appliedMixins,
+				appliedIndexes: [...e.appliedIndexes, {
+					name: n,
+					fields: [...r],
+					where: o,
+					unique: !0
+				}],
+				appliedUniques: e.appliedUniques,
+				appliedFullText: e.appliedFullText,
+				appliedChecks: e.appliedChecks,
+				appliedPrimaryKey: e.appliedPrimaryKey,
+				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
+				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
+			});
+		}),
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
 			if (y(e.tableName, t, !1, []), e.appliedChecks.some((e) => e.name === t)) throw Error(`duplicate CHECK '${t}' on table '${e.tableName}': each constraint name must be unique within a table.`);

package/dist/index.d.ts

@@ -4532,6 +4532,37 @@ export declare interface Table<Name extends string, Fields extends Record<string
             dedup?: TableUnique['dedup'];
         }): Table<Name, Fields, Reactive, IxNames>;
     };
+    /**
+     * Declare a **partial UNIQUE** constraint that holds only among the rows
+     * matching a predicate — the portable answer to "unique among the rows that
+     * aren't soft-deleted". Emits a `CREATE UNIQUE INDEX … WHERE` on postgres /
+     * sqlite / mssql.
+     *
+     * ```ts
+     * table('project_roadmaps', { id, projectId, year, deletedAt, ... })
+     *   .softDelete()
+     *   .uniqueActive(['projectId', 'year'])            // one ACTIVE roadmap per (project, year)
+     * ```
+     *
+     * By default the predicate is `"deletedAt" IS NULL` (pairs with
+     * `.softDelete()`); override with `{ where }` for a custom active-set
+     * (`"status" = 'open'`). A soft-deleted row leaves the active set, so a NEW
+     * row with the same key is allowed — no hand-written
+     * `generatedAs("CASE WHEN …")` column, no resurrection footgun.
+     *
+     * **mysql / mariadb:** these engines have no partial-index support, so
+     * `.uniqueActive()` FAILS LOUDLY at migrate time (a full unique index would
+     * silently forbid re-creating a soft-deleted row). Use a generated STORED
+     * column + `.unique()` there until the framework lowers it for you.
+     */
+    uniqueActive: {
+        <const F extends readonly [keyof Fields & string, ...Array<keyof Fields & string>]>(fields: F, options?: {
+            where?: string;
+        }): Table<Name, Fields, Reactive, IxNames>;
+        <const IxName extends string, const F extends readonly [keyof Fields & string, ...Array<keyof Fields & string>]>(name: IxName, fields: F, options?: {
+            where?: string;
+        }): Table<Name, Fields, Reactive, IxNames | IxName>;
+    };
     /**
      * Declare a named table-level `CHECK` constraint — a DB-ENFORCED
      * invariant that holds regardless of which client writes the row
@@ -4700,6 +4731,20 @@ export declare interface TableIndex {
      * efConstruction, opclass}`). Ignored for kinds that don't read it.
      */
     readonly kindOptions?: IndexKindOptions;
+    /**
+     * UNIQUE partial index — set ONLY by `.uniqueActive(...)`. Emits
+     * `CREATE UNIQUE INDEX … WHERE <where>` on postgres / sqlite / mssql, so
+     * uniqueness holds only among rows matching `where` (e.g. the non-soft-
+     * deleted rows). Distinct from `.index(..., { where })` (non-unique) and
+     * from `.unique(...)` (a full constraint with no predicate). Because a
+     * unique+partial index has no `information_schema` constraint form and the
+     * declarative planner is predicate-blind, these are emitted by the
+     * fresh-schema DDL path (like every partial predicate) and kept OUT of the
+     * declarative index snapshot. mysql/mariadb have no partial-index support —
+     * `.uniqueActive()` fails loudly there (use a generated column) rather than
+     * silently dropping the predicate into a full unique index.
+     */
+    readonly unique?: boolean;
 }
 
 export declare interface TableLike {

package/dist/index.js

@@ -1,4 +1,4 @@
-import { $ as e, A as t, B as n, C as r, Ct as i, D as a, Dt as o, E as s, Et as c, F as l, G as u, H as d, I as f, J as p, K as m, L as h, M as g, N as _, O as ee, Ot as v, P as y, Q as b, R as x, S as te, St as S, T as C, Tt as ne, U as re, V as ie, W as ae, X as oe, Y as se, Z as ce, _ as le, _t as ue, a as de, at as fe, b as pe, bt as me, c as he, ct as ge, d as _e, dt as ve, et as ye, f as be, ft as xe, g as Se, gt as Ce, h as we, ht as Te, i as w, it as Ee, j as De, k as Oe, kt as ke, l as Ae, lt as je, m as Me, mt as Ne, n as Pe, nt as Fe, o as Ie, ot as Le, p as Re, pt as ze, q as Be, r as Ve, rt as He, s as Ue, st as We, t as Ge, tt as Ke, u as qe, ut as Je, v as Ye, vt as T, w as Xe, wt as Ze, x as Qe, xt as E, y as $e, yt as D, z as et } from "./fileBased-cc9IzIjU.js";
+import { $ as e, A as t, B as n, C as r, Ct as i, D as a, Dt as o, E as s, Et as c, F as l, G as u, H as d, I as f, J as p, K as m, L as h, M as g, N as _, O as ee, Ot as v, P as y, Q as b, R as x, S as te, St as S, T as C, Tt as ne, U as re, V as ie, W as ae, X as oe, Y as se, Z as ce, _ as le, _t as ue, a as de, at as fe, b as pe, bt as me, c as he, ct as ge, d as _e, dt as ve, et as ye, f as be, ft as xe, g as Se, gt as Ce, h as we, ht as Te, i as w, it as Ee, j as De, k as Oe, kt as ke, l as Ae, lt as je, m as Me, mt as Ne, n as Pe, nt as Fe, o as Ie, ot as Le, p as Re, pt as ze, q as Be, r as Ve, rt as He, s as Ue, st as We, t as Ge, tt as Ke, u as qe, ut as Je, v as Ye, vt as T, w as Xe, wt as Ze, x as Qe, xt as E, y as $e, yt as D, z as et } from "./fileBased-CRXgPJkv.js";
 import { Chunk as tt, Data as nt, Effect as rt, Option as O, Stream as it } from "effect";
 import { ansi as k } from "@voltro/logger";
 //#region src/arrayCodec.ts
@@ -859,13 +859,13 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		...t,
 		value: Hn(t.value)
 	};
-}, Hn = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Hn(e)) : e, Un, Wn, Gn = (e) => {
-	e.actors !== void 0 && (Un = e.actors), e.tenants !== void 0 && (Wn = e.tenants);
-}, Kn = (e, t) => () => {
+}, Hn = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Hn(e)) : e, Un = Symbol.for("@voltro/database/coreTablesRegistry"), Wn = globalThis, Gn = Wn[Un] ?? (Wn[Un] = {}), Kn = (e) => {
+	e.actors !== void 0 && (Gn.actors = e.actors), e.tenants !== void 0 && (Gn.tenants = e.tenants);
+}, qn = (e, t) => () => {
 	let n = e();
 	if (n === void 0) throw Error(`core '${t}' table not registered; expected the framework CLI or your migrate step to call registerCoreTables({ ${t}: () => ${t}Table }) before the database handle is constructed`);
 	return n();
-}, qn = () => Kn(() => Un, "actors"), Jn = () => Kn(() => Wn, "tenants"), Yn = n("actors", {
+}, Jn = () => qn(() => Gn.actors, "actors"), Yn = () => qn(() => Gn.tenants, "tenants"), Xn = n("actors", {
 	id: T(),
 	kind: o().oneOf([
 		"user",
@@ -875,65 +875,65 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	]),
 	displayName: o().nullable(),
 	createdAt: v().default("now")
-}), Xn = (e, t) => ({
+}), Zn = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Zn = (e, t) => ({
+}), Qn = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), Qn = (e, t) => ({
+}), $n = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), $n = (e, t) => ({
+}), er = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), er = (e, t) => ({
+}), tr = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), tr = (e, t) => ({
+}), nr = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), nr = (e, t) => ({
+}), rr = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), rr = (e, t) => ({
+}), ir = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), ir = (e, t) => ({
+}), ar = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), ar = (e, t) => ({
+}), or = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), or = (e, t) => ({
+}), sr = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), sr = (e, t) => ({
+}), cr = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), cr = (e) => ({
+}), lr = (e) => ({
 	column: e,
 	op: "isNull"
-}), lr = (e) => ({
+}), ur = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), ur = (e, t) => ({
+}), dr = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), dr = (...e) => ({ and: e }), fr = (...e) => ({ or: e }), pr = (e) => ({ not: e }), mr = (e, ...t) => {
+}), fr = (...e) => ({ and: e }), pr = (...e) => ({ or: e }), mr = (e) => ({ not: e }), hr = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
@@ -954,29 +954,29 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, hr = (e) => "descriptor" in e ? e.descriptor : e, gr = (e, t) => ({
+}, gr = (e) => "descriptor" in e ? e.descriptor : e, _r = (e, t) => ({
 	column: e,
 	op: "subquery-in",
-	subquery: hr(t)
-}), _r = (e, t) => ({
+	subquery: gr(t)
+}), vr = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
-	subquery: hr(t)
-}), vr = (e) => ({
-	op: "exists",
-	subquery: hr(e)
+	subquery: gr(t)
 }), yr = (e) => ({
+	op: "exists",
+	subquery: gr(e)
+}), br = (e) => ({
 	op: "not-exists",
-	subquery: hr(e)
-}), br = (e, t) => e == null || t == null ? null : typeof e == typeof t ? e === t ? 0 : e > t ? 1 : -1 : null, xr = (e, t, n = null) => {
+	subquery: gr(e)
+}), xr = (e, t) => e == null || t == null ? null : typeof e == typeof t ? e === t ? 0 : e > t ? 1 : -1 : null, Sr = (e, t, n = null) => {
 	if (!t) return !1;
-	if ("not" in e) return !xr(e.not, t, n);
+	if ("not" in e) return !Sr(e.not, t, n);
 	if ("and" in e) {
-		for (let r of e.and) if (!xr(r, t, n)) return !1;
+		for (let r of e.and) if (!Sr(r, t, n)) return !1;
 		return !0;
 	}
 	if ("or" in e) {
-		for (let r of e.or) if (xr(r, t, n)) return !0;
+		for (let r of e.or) if (Sr(r, t, n)) return !0;
 		return !1;
 	}
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
@@ -995,10 +995,10 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	switch (r.op) {
 		case "eq": return i === r.value;
 		case "neq": return i !== r.value;
-		case "gt": return (br(i, r.value) ?? -1) > 0;
-		case "gte": return (br(i, r.value) ?? -1) >= 0;
-		case "lt": return (br(i, r.value) ?? 1) < 0;
-		case "lte": return (br(i, r.value) ?? 1) <= 0;
+		case "gt": return (xr(i, r.value) ?? -1) > 0;
+		case "gte": return (xr(i, r.value) ?? -1) >= 0;
+		case "lt": return (xr(i, r.value) ?? 1) < 0;
+		case "lte": return (xr(i, r.value) ?? 1) <= 0;
 		case "in": return Array.isArray(r.value) && r.value.includes(i);
 		case "notIn": return Array.isArray(r.value) && !r.value.includes(i);
 		case "contains": return typeof i == "string" && typeof r.value == "string" && i.toLowerCase().includes(r.value.toLowerCase());
@@ -1015,17 +1015,17 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		case "isNotNull": return i != null;
 		case "spatial": throw Error("@voltro/plugin-postgis: spatial predicates (ST_DWithin / ST_Contains / ST_Within / ST_Intersects / bbox &&) are not evaluable in-memory — use them in one-shot ctx.store.query reads, not reactive subscriptions.");
 	}
-}, Sr = function* (e) {
+}, Cr = function* (e) {
 	if ("not" in e) {
-		yield* Sr(e.not);
+		yield* Cr(e.not);
 		return;
 	}
 	if ("and" in e) {
-		for (let t of e.and) yield* Sr(t);
+		for (let t of e.and) yield* Cr(t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* Sr(t);
+		for (let t of e.or) yield* Cr(t);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
@@ -1035,27 +1035,27 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		kind: "exists",
 		descriptor: e.subquery
 	});
-}, Cr = function* (e, t = !0) {
+}, wr = function* (e, t = !0) {
 	if ("not" in e) {
-		yield* Cr(e.not, !1);
+		yield* wr(e.not, !1);
 		return;
 	}
 	if ("and" in e) {
-		for (let n of e.and) yield* Cr(n, t);
+		for (let n of e.and) yield* wr(n, t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* Cr(t, !1);
+		for (let t of e.or) yield* wr(t, !1);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" || e.op === "exists" || e.op === "not-exists" || (yield {
 		...e,
 		conjunctive: t
 	});
-}, wr = class extends nt.TaggedError("TableStreamError") {}, Tr = 1e3, Er = (e, t, n, r) => {
+}, Tr = class extends nt.TaggedError("TableStreamError") {}, Er = 1e3, Dr = (e, t, n, r) => {
 	let i = O.match(r, {
 		onNone: () => e.where,
-		onSome: (n) => e.where ? dr(e.where, Qn(t, n)) : Qn(t, n)
+		onSome: (n) => e.where ? fr(e.where, $n(t, n)) : $n(t, n)
 	});
 	return {
 		table: e.table,
@@ -1070,19 +1070,19 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		...e.includeDeleted === void 0 ? {} : { includeDeleted: e.includeDeleted },
 		...e.crossTenant === void 0 ? {} : { crossTenant: e.crossTenant }
 	};
-}, Dr = (e, t) => {
-	let n = t.pk ?? "id", r = t.chunkSize ?? Tr;
+}, Or = (e, t) => {
+	let n = t.pk ?? "id", r = t.chunkSize ?? Er;
 	return it.paginateChunkEffect(O.none(), (i) => {
 		let a = rt.tryPromise({
-			try: () => e.query(Er(t, n, r, i)),
-			catch: (e) => new wr({
+			try: () => e.query(Dr(t, n, r, i)),
+			catch: (e) => new Tr({
 				table: t.table,
 				cause: e
 			})
 		});
 		return (t.retry ? a.pipe(rt.retry(t.retry)) : a).pipe(rt.map((e) => [tt.fromIterable(e), e.length === r && e.length > 0 ? O.some(O.some(e[e.length - 1][n])) : O.none()]));
 	});
-}, Or = (e) => {
+}, kr = (e) => {
 	let t = e.alpha ?? .5;
 	if (t < 0 || t > 1) throw Error(`hybridSearch: alpha must be in [0, 1], got ${t}`);
 	return (n) => {
@@ -1109,14 +1109,14 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 			}
 		};
 	};
-}, kr = async (e, t) => {
+}, Ar = async (e, t) => {
 	let n = e.as ?? "embedding", r = t.row[e.from];
 	if (typeof r != "string" || r.length === 0) return {};
 	let i = await t.embed(r);
 	return { [n]: i };
-}, Ar = (e) => {
+}, jr = (e) => {
 	if (!Number.isInteger(e.dimensions) || e.dimensions <= 0) throw Error(`vectorEmbedding: dimensions must be a positive integer, got ${String(e.dimensions)}.`);
-	let t = e.as ?? "embedding", n = (t) => kr(e, t);
+	let t = e.as ?? "embedding", n = (t) => Ar(e, t);
 	return d({
 		id: "voltro/vectorEmbedding",
 		fields: { [t]: ke(e.dimensions) },
@@ -1134,19 +1134,19 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 			beforeUpdate: n
 		}
 	});
-}, jr = 63, Mr = "br_pr", Y = class extends Error {
+}, Mr = 63, Nr = "br_pr", Y = class extends Error {
 	_tag = "BranchNameInvalid";
 	constructor(e) {
 		super(e), this.name = "BranchNameInvalid";
 	}
-}, Nr = (e, t) => {
+}, Pr = (e, t) => {
 	if (!Number.isInteger(t) || t < 0) throw new Y(`prNumber must be a non-negative integer, got ${String(t)}`);
 	let n = Zt(e);
 	if (n.replace(/_/g, "") === "") throw new Y(`app slug '${e}' has no usable identifier characters`);
-	let r = `${Mr}${t}_${n}`;
-	if (r.length > jr) throw new Y(`branch namespace '${r}' exceeds the ${jr}-byte identifier limit — use a shorter app slug`);
+	let r = `${Nr}${t}_${n}`;
+	if (r.length > Mr) throw new Y(`branch namespace '${r}' exceeds the ${Mr}-byte identifier limit — use a shorter app slug`);
 	return r;
-}, Pr = (e) => e.startsWith(Mr), Fr = {
+}, Fr = (e) => e.startsWith(Nr), Ir = {
 	requested: {
 		provision: "provisioning",
 		destroy: "destroying"
@@ -1165,18 +1165,18 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		fail: "failed"
 	},
 	destroyed: {}
-}, Ir = class extends Error {
+}, Lr = class extends Error {
 	from;
 	event;
 	_tag = "BranchTransitionInvalid";
 	constructor(e, t) {
 		super(`invalid branch transition: ${e} --${t}-->`), this.from = e, this.event = t, this.name = "BranchTransitionInvalid";
 	}
-}, Lr = (e, t) => {
-	let n = Fr[e][t];
-	if (n === void 0) throw new Ir(e, t);
+}, Rr = (e, t) => {
+	let n = Ir[e][t];
+	if (n === void 0) throw new Lr(e, t);
 	return n;
-}, Rr = (e, t, n, r) => {
+}, zr = (e, t, n, r) => {
 	if (n === "copy" && (r === void 0 || r === "")) throw new Y("seed 'copy' requires a parentNamespace to snapshot from");
 	let i = [{
 		kind: "create-namespace",
@@ -1197,13 +1197,13 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		detail: `run boot seeds into ${e}`
 	});
 	return i;
-}, zr = (e) => {
-	if (!Pr(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
+}, Br = (e) => {
+	if (!Fr(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
 	return [{
 		kind: "drop-namespace",
 		detail: e
 	}];
-}, Br = (e) => {
+}, Vr = (e) => {
 	if (e === void 0 || e === "") return !1;
 	try {
 		let t = new URL(e).hostname.toLowerCase();
@@ -1211,27 +1211,27 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	} catch {
 		return /\bneon\.(tech|build)\b/i.test(e);
 	}
-}, Vr = (e) => e.prefer === void 0 ? e.seed === "copy" && Br(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, Hr = (e, t = {}) => [{
+}, Hr = (e) => e.prefer === void 0 ? e.seed === "copy" && Vr(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, Ur = (e, t = {}) => [{
 	kind: "neon-branch-create",
 	detail: `${t.parentBranch ?? "main"} → ${e} (copy-on-write)`
-}], Ur = (e) => {
-	if (!Pr(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
+}], Wr = (e) => {
+	if (!Fr(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
 	return [{
 		kind: "neon-branch-delete",
 		detail: e
 	}];
-}, Wr = (e) => e.mechanism === "neon-cow" ? Hr(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : Rr(e.branchId, e.tableNames, e.seed, e.parentNamespace), Gr = (e, t) => e === "neon-cow" ? Ur(t) : zr(t), Kr = (e, t, n) => {
+}, Gr = (e) => e.mechanism === "neon-cow" ? Ur(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : zr(e.branchId, e.tableNames, e.seed, e.parentNamespace), Kr = (e, t) => e === "neon-cow" ? Wr(t) : Br(t), qr = (e, t, n) => {
 	let r = e.filter((e) => e.state !== "destroyed" && e.state !== "destroying"), i = r.filter((e) => n - e.createdAtMs > t.ttlMs).map((e) => e.namespace), a = new Set(i);
 	return {
 		evict: i,
 		rejectNew: r.filter((e) => !a.has(e.namespace)).length >= t.maxBranches
 	};
-}, qr = async (e, t) => {
-	let n = Nr(e.appSlug, e.prNumber), r = Vr({
+}, Jr = async (e, t) => {
+	let n = Pr(e.appSlug, e.prNumber), r = Hr({
 		seed: e.seed,
 		...e.dbUrl === void 0 ? {} : { dbUrl: e.dbUrl },
 		...e.prefer === void 0 ? {} : { prefer: e.prefer }
-	}), i = Wr({
+	}), i = Gr({
 		mechanism: r,
 		branchId: n,
 		tableNames: e.tableNames,
@@ -1256,10 +1256,10 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		mechanism: r,
 		steps: i
 	};
-}, Jr = async (e, t, n) => {
-	let r = Gr(t, e);
+}, Yr = async (e, t, n) => {
+	let r = Kr(t, e);
 	return t === "neon-cow" ? await n.neonBranchDelete(e) : await n.dropNamespace(e), r;
-}, Yr = (e, t, n) => Kr(e, t, n), X = (e) => `"${e.replace(/"/g, "\"\"")}"`, Xr = (e) => {
+}, Xr = (e, t, n) => qr(e, t, n), X = (e) => `"${e.replace(/"/g, "\"\"")}"`, Zr = (e) => {
 	let t = () => {
 		throw Error("namespace branch executor: Neon ops require a neon-cow executor (use a Neon connection for copy-on-write branches)");
 	};
@@ -1271,18 +1271,18 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		neonBranchCreate: t,
 		neonBranchDelete: t
 	};
-}, Zr = class extends Error {
+}, Qr = class extends Error {
 	_tag = "TenantResidencyUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantResidencyUnresolved";
 	}
-}, Qr = class extends Error {
+}, $r = class extends Error {
 	region;
 	_tag = "TenantRegionUnavailable";
 	constructor(e, t) {
 		super(t), this.region = e, this.name = "TenantRegionUnavailable";
 	}
-}, $r, ei = (e) => {
+}, ei, ti = (e) => {
 	if (e.homes === void 0) throw Error("setResidencyConfig: `homes` is required");
 	if (e.servableRegions === void 0 || e.servableRegions.length === 0) throw Error("setResidencyConfig: `servableRegions` must be non-empty (which regions this deployment serves)");
 	let t = /* @__PURE__ */ new Map();
@@ -1291,32 +1291,32 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		if (e !== void 0 && e !== n.region) throw Error(`residency: tenant '${n.tenantId}' is mapped to two regions ('${e}' and '${n.region}')`);
 		t.set(n.tenantId, n.region);
 	}
-	return $r = e, e;
-}, ti = () => $r, ni = () => {
-	$r = void 0;
-}, ri = (e, t) => {
-	if (e == null || e === "") throw new Zr("residency is on but the request has no resolvable tenant — refusing to bind a store");
+	return ei = e, e;
+}, ni = () => ei, ri = () => {
+	ei = void 0;
+}, ii = (e, t) => {
+	if (e == null || e === "") throw new Qr("residency is on but the request has no resolvable tenant — refusing to bind a store");
 	let n = t.homes.find((t) => t.tenantId === e);
-	if (n === void 0) throw new Zr(`no residency home is mapped for tenant '${e}' — refusing to fall back to a default store (would be a residency violation)`);
+	if (n === void 0) throw new Qr(`no residency home is mapped for tenant '${e}' — refusing to fall back to a default store (would be a residency violation)`);
 	return n;
-}, ii = (e, t) => t.servableRegions.includes(e), ai = (e, t) => {
-	let n = ri(e.tenantId, t), r = Qt(n.tenantId);
+}, ai = (e, t) => t.servableRegions.includes(e), oi = (e, t) => {
+	let n = ii(e.tenantId, t), r = Qt(n.tenantId);
 	return {
 		region: n.region,
 		namespace: r,
 		...n.connectionKey === void 0 ? {} : { connectionKey: n.connectionKey }
 	};
-}, oi = (e, t, n) => {
-	let r = ai(e, t);
-	if (!ii(r.region, t)) throw new Qr(r.region, `tenant homed in region '${r.region}', which this deployment does not serve — route to the home region`);
+}, si = (e, t, n) => {
+	let r = oi(e, t);
+	if (!ai(r.region, t)) throw new $r(r.region, `tenant homed in region '${r.region}', which this deployment does not serve — route to the home region`);
 	let i = n.get(r.region);
-	if (i === void 0) throw new Qr(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
+	if (i === void 0) throw new $r(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
 	return {
 		store: i,
 		placement: r
 	};
-}, si = async (e, t, n, r) => {
-	let { store: i, placement: a } = oi(e, t, n);
+}, ci = async (e, t, n, r) => {
+	let { store: i, placement: a } = si(e, t, n);
 	return await r(i, a), a;
 }, Z = (e) => {
 	if (typeof e == "string") return e;
@@ -1325,21 +1325,21 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		return `(json:${t}->${n.join(".")}${r ? "::num" : ""})`;
 	}
 	return `(${e.expr})`;
-}, Q = (e) => e.map(Z), ci = (e, t) => {
+}, Q = (e) => e.map(Z), li = (e, t) => {
 	if (e.length !== t.length) return !1;
 	for (let n = 0; n < e.length; n++) if (Z(e[n]) !== Z(t[n])) return !1;
 	return !0;
-}, li = (e, t) => {
+}, ui = (e, t) => {
 	if (e.length >= t.length) return !1;
 	for (let n = 0; n < e.length; n++) if (Z(e[n]) !== Z(t[n])) return !1;
 	return !0;
-}, ui = (e) => {
+}, di = (e) => {
 	let t = [], n = e.appliedIndexes, r = e.tableName;
 	for (let e = 0; e < n.length; e++) {
 		let i = n[e];
 		for (let a = e + 1; a < n.length; a++) {
 			let e = n[a];
-			if (ci(i.fields, e.fields)) {
+			if (li(i.fields, e.fields)) {
 				let [n, a] = i.name < e.name ? [i, e] : [e, i];
 				t.push({
 					kind: "duplicate-fields",
@@ -1350,13 +1350,13 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 				});
 				continue;
 			}
-			li(i.fields, e.fields) ? t.push({
+			ui(i.fields, e.fields) ? t.push({
 				kind: "redundant-prefix",
 				table: r,
 				redundant: i,
 				coveredBy: e,
 				message: `'${r}' index '${i.name}' on [${Q(i.fields).join(", ")}] is a leading prefix of '${e.name}' on [${Q(e.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Q(i.fields).join(", ")}] query from '${e.name}' too via the leading-prefix rule, so '${i.name}' adds write cost without read benefit. Drop '${i.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
-			}) : li(e.fields, i.fields) && t.push({
+			}) : ui(e.fields, i.fields) && t.push({
 				kind: "redundant-prefix",
 				table: r,
 				redundant: e,
@@ -1366,23 +1366,23 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		}
 	}
 	return t;
-}, di = (e) => {
+}, fi = (e) => {
 	let t = [];
-	for (let n of e) t.push(...ui(n));
+	for (let n of e) t.push(...di(n));
 	return t;
-}, fi = "\x1B[", pi = `${fi}38;2;245;158;11m`, mi = `${fi}38;2;16;185;129m`, hi = (e, t) => `${e}${t}${k.reset}`, $ = (e, t, n) => e ? typeof t == "function" ? t(n) : hi(t, n) : n, gi = (e, t = {}) => {
-	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => $(n, k.dim, e.padEnd(11)), a = (e) => $(n, (e) => k.bold(k.brand(e)), e), o = (e) => $(n, k.brightRed24, e), s = (e) => $(n, mi, e), c = (e) => $(n, pi, e), l = (e) => $(n, k.dim, e), u = `${c("index audit")} ${l("·")} ${$(n, k.bold, e.kind)}`, d = e.redundant.fields.length, f = Q(e.coveredBy.fields.slice(d)), p = (e, t) => {
+}, pi = "\x1B[", mi = `${pi}38;2;245;158;11m`, hi = `${pi}38;2;16;185;129m`, gi = (e, t) => `${e}${t}${k.reset}`, $ = (e, t, n) => e ? typeof t == "function" ? t(n) : gi(t, n) : n, _i = (e, t = {}) => {
+	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => $(n, k.dim, e.padEnd(11)), a = (e) => $(n, (e) => k.bold(k.brand(e)), e), o = (e) => $(n, k.brightRed24, e), s = (e) => $(n, hi, e), c = (e) => $(n, mi, e), l = (e) => $(n, k.dim, e), u = `${c("index audit")} ${l("·")} ${$(n, k.bold, e.kind)}`, d = e.redundant.fields.length, f = Q(e.coveredBy.fields.slice(d)), p = (e, t) => {
 		let n = e.slice(0, t), r = e.slice(t), i = [];
 		return n.length > 0 && i.push(s(`[${n.join(", ")}]`)), r.length > 0 && i.push(c(`+ [${r.join(", ")}]`)), i.join(" ");
 	}, m = [];
 	return m.push(u), m.push(""), m.push(`${i("table")}${a(e.table)}`), m.push(""), m.push(`${i("redundant")}${o(e.redundant.name)}`), m.push(`${i("")}${p(Q(e.redundant.fields), d)}`), m.push(""), m.push(`${i("covered by")}${s(e.coveredBy.name)}`), m.push(`${i("")}${p(Q(e.coveredBy.fields), d)}`), f.length > 0 && m.push(`${i("")}${l(`└ extra columns: ${f.join(", ")}`)}`), m.push(""), e.kind === "redundant-prefix" ? (m.push(`${i("why")}B-tree indexes serve queries that filter on a LEADING PREFIX of`), m.push(`${i("")}their column list. The wider index already covers every`), m.push(`${i("")}query the narrower one can serve.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)) : (m.push(`${i("why")}Two indexes on the same columns under different names.`), m.push(`${i("")}The B-tree engine builds both — same coverage, double cost.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)), m.push(""), m.push(`${i("cost")}Every ${a("INSERT")} / ${a("UPDATE")} / ${a("DELETE")} on this table writes`), m.push(`${i("")}to ${$(n, k.bold, "both")} B-trees. Pure write overhead, zero read benefit.`), m.push(""), m.push(`${i("fix")}Drop  ${o(e.redundant.name)}`), m.push(`${i("")}${l("Keep only if profiling shows the smaller index gives a")}`), m.push(`${i("")}${l("measurable cache-locality boost on a write-heavy hot path.")}`), m.push(`${i("")}${l("Silence with VOLTRO_INDEX_AUDIT=off if intentional.")}`), m.map((e) => `${r}${e}`).join("\n");
-}, _i = (e, t) => ({
+}, vi = (e, t) => ({
 	name: e,
 	body: t
-}), vi = (e) => {
+}), yi = (e) => {
 	if (e.lifecycle === "cron" && !e.cron) throw Error(`seed "${e.id}": lifecycle 'cron' requires a 'cron' field`);
 	if (e.lifecycle === "onSchemaChange" && (!e.watchedTables || e.watchedTables.length === 0)) throw Error(`seed "${e.id}": lifecycle 'onSchemaChange' requires at least one entry in 'watchedTables'`);
-	let t = e.steps({ step: _i });
+	let t = e.steps({ step: vi });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -1394,13 +1394,13 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, yi = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, bi = (e, { apply: t, undo: n }) => ({
+}, bi = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, xi = (e, { apply: t, undo: n }) => ({
 	name: e,
 	apply: t,
 	undo: n
-}), xi = (e) => {
+}), Si = (e) => {
 	if (!/^\d{14}_/.test(e.id)) throw Error(`migration "${e.id}": id must start with a 14-digit timestamp followed by "_" (convention: <YYYYMMDDHHMMSS>_<slug>)`);
-	let t = e.steps({ step: bi });
+	let t = e.steps({ step: xi });
 	if (t.length === 0) throw Error(`migration "${e.id}": at least one step is required`);
 	return {
 		__migration: !0,
@@ -1408,7 +1408,7 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 		name: e.name,
 		steps: t
 	};
-}, Si = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, Ci = n("_voltro_migrations", {
+}, Ci = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, wi = n("_voltro_migrations", {
 	id: T({ prefix: "mig" }),
 	name: o(),
 	hash: o(),
@@ -1420,7 +1420,7 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	workflowRunId: o().nullable(),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["status"]).reactive(), wi = n("_voltro_seeds", {
+}).index(["status"]).reactive(), Ti = n("_voltro_seeds", {
 	id: T({ prefix: "seed" }),
 	name: o(),
 	lifecycle: o(),
@@ -1436,7 +1436,7 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	workflowRunId: o().nullable(),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]).reactive(), Ti = n("_voltro_migration_plans", {
+}).index(["lifecycle"]).index(["nextRunAt"]).reactive(), Ei = n("_voltro_migration_plans", {
 	id: T({ prefix: "plan" }),
 	fingerprint: o(),
 	operations: E(),
@@ -1451,21 +1451,21 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	appliedAt: v().default("now"),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]).reactive(), Ei = n("_voltro_idempotency", {
+}).index(["fingerprint"]).index(["environment"]).reactive(), Di = n("_voltro_idempotency", {
 	id: T({ prefix: "idem" }),
 	scope: o(),
 	key: o(),
 	status: o(),
 	response: E().nullable(),
 	createdAt: v().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]).reactive(), Di = n("_voltro_kv", {
+}).unique(["scope", "key"]).index(["createdAt"]).reactive(), Oi = n("_voltro_kv", {
 	id: T({ prefix: "kv" }),
 	key: o().unique(),
 	value: o().nullable(),
 	expiresAt: v().nullable(),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["expiresAt"]).reactive(), Oi = n("_voltro_api_keys", {
+}).index(["expiresAt"]).reactive(), ki = n("_voltro_api_keys", {
 	id: T({ prefix: "apikey" }),
 	tenantId: o().nullable(),
 	name: o(),
@@ -1477,42 +1477,42 @@ var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqli
 	revokedAt: v().nullable(),
 	createdBy: o().nullable(),
 	createdAt: v().default("now")
-}).index("byTenant", ["tenantId"]).reactive(), ki = [
-	Ci,
+}).index("byTenant", ["tenantId"]).reactive(), Ai = [
 	wi,
-	Ti
-], Ai = (e, t, n) => ({
+	Ti,
+	Ei
+], ji = (e, t, n) => ({
 	_tag: "PrimaryKeyConflictError",
 	table: e,
 	key: t,
 	cause: n
-}), ji = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", Mi = /* @__PURE__ */ new Map(), Ni = (e) => {
+}), Mi = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", Ni = /* @__PURE__ */ new Map(), Pi = (e) => {
 	if (!e.table || !e.timeColumn) throw Error("registerRetention: table + timeColumn are required");
 	if (!Number.isFinite(e.ttlMs) || e.ttlMs <= 0) throw Error(`registerRetention(${e.table}): ttlMs must be a positive number`);
-	Mi.set(e.table, e);
-}, Pi = () => [...Mi.values()], Fi = () => Mi.clear(), Ii = async (e, t, n, r = 2e4) => {
+	Ni.set(e.table, e);
+}, Fi = () => [...Ni.values()], Ii = () => Ni.clear(), Li = async (e, t, n, r = 2e4) => {
 	let i = new Date(t - e.ttlMs), a = 0;
 	for (;;) {
 		let t = await n(e.table, e.timeColumn, i, r, e.where);
 		if (a += t, t < r) break;
 	}
 	return a;
-}, Li = (e, t) => {
+}, Ri = (e, t) => {
 	let n = Number(e ?? String(t));
 	return (Number.isFinite(n) && n > 0 ? n : t) * 36e5;
-}, Ri = "_voltro_cdc_offsets", zi = n(Ri, {
+}, zi = "_voltro_cdc_offsets", Bi = n(zi, {
 	id: T({ prefix: "cdcoff" }),
 	replicaId: o(),
 	streamName: o(),
 	binlogFile: o(),
 	binlogPosition: o(),
 	updatedAt: v()
-}).index(["replicaId"]), Bi = n(Ri, {
+}).index(["replicaId"]), Vi = n(zi, {
 	id: T({ prefix: "cdcoff" }),
 	replicaId: o(),
 	streamName: o(),
 	ctVersion: o(),
 	updatedAt: v()
-}).index(["replicaId"]), Vi = "postgres";
+}).index(["replicaId"]), Hi = "postgres";
 //#endregion
-export { Y as BranchNameInvalid, Ir as BranchTransitionInvalid, Ri as CDC_OFFSETS_TABLE, We as ColumnBuilder, lt as ENCRYPTED_PREFIX, Vi as ENGINE, Ge as FILE_MIGRATION_PATTERN, oe as MAX_IDENTIFIER_LENGTH, wr as TableStreamError, Jt as TenantNamespaceInvalid, qt as TenantNamespaceUnresolved, Qr as TenantRegionUnavailable, Zr as TenantResidencyUnresolved, ce as WARN_IDENTIFIER_LENGTH, Oi as _voltroApiKeysTable, zi as _voltroCdcOffsetsTable, Ei as _voltroIdempotencyTable, Di as _voltroKvTable, Ti as _voltroMigrationPlansTable, Ci as _voltroMigrationsTable, Bi as _voltroMssqlCdcOffsetsTable, wi as _voltroSeedsTable, Yn as actorsTable, Yr as admitBranch, He as allEnumRenames, kt as allRegisteredRelations, De as allRegisteredTables, dr as and, ge as array, ar as arrayContains, sr as arrayHas, or as arrayOverlaps, zt as attachEagerLoads, di as auditAllTableIndexes, ui as auditTableIndexes, Ae as avg, qe as avgOver, je as bigint, oi as bindResidentStore, Je as boolean, Nr as branchNamespaceName, ve as bytes, Ee as clearEnumRenames, At as clearRelationsRegistry, ni as clearResidencyConfig, Fi as clearRetentions, g as clearTableRegistry, Sr as collectSubqueries, _e as column, dn as compileEagerJson, R as compilePredicate, $t as compileRawFragment, z as compileSelect, kr as computeEmbedding, ir as contains, be as count, Re as countDistinct, Me as databaseHandle, xe as date, ze as dbEnum, Ne as decimal, fe as declareEnumRename, It as decodeRowsFromSchema, pt as decryptFieldsOnRead, xi as defineMigration, d as defineMixin, vi as defineSeed, we as denseRank, u as deriveTypeIdPrefix, ct as deserializeArraysOnRead, b as drainIdentifierWarnings, Te as dropped, Rt as encodeRowForSchema, ft as encryptFieldsForWrite, dt as encryptedColumnsOf, Kr as enforceBranchLimits, _ as ensureTableRegistered, Xn as eq, L as escapeLike, xr as evaluatePredicate, Se as except, vr as exists, gi as formatIndexAuditIssue, ki as frameworkTables, m as generateId, p as generateSnowflake, Ce as geography, ue as geometry, Le as getEnumRenames, Ot as getRelation, M as getRelations, ti as getResidencyConfig, y as getTable, Qn as gt, $n as gte, Kt as hasEagerLoads, Or as hybridSearch, T as id, nr as inSet, gr as inSubquery, A as inferForeignKey, D as integer, le as intersect, me as interval, Pr as isBranchNamespace, ut as isEncrypted, Pe as isFileMigration, Si as isMigrationDefinition, Br as isNeonConnection, lr as isNotNull, cr as isNull, ji as isPrimaryKeyConflictError, ii as isRegionServable, bt as isRelationsSpec, yi as isSeedDefinition, h as isSqliteFamily, de as isView, E as json, mr as jsonField, et as jsonIndex, Ye as lag, $e as lead, Pi as listRetentions, er as lt, tr as lte, Xr as makeNamespaceBranchExecutor, St as many, Ct as manyToMany, S as materializeFields, pe as max, Ve as migration, Qe as min, re as mixin, Zn as neq, Lr as nextBranchState, pr as not, yr as notExists, rr as notInSet, _r as notInSubquery, i as numeric, xt as one, fr as or, te as paginateById, Wr as planBranch, Rr as planBranchProvision, zr as planBranchTeardown, Gr as planBranchTeardownFor, Hr as planNeonBranchProvision, Ur as planNeonBranchTeardown, Ai as primaryKeyConflictError, qr as provisionBranch, si as provisionResidentTenant, I as qualifyTable, r as queryFor, Ie as queryForView, x as quoteIdent, Xe as rank, Ze as raw, ne as real, c as reference, Gn as registerCoreTables, Dt as registerDiscoveredRelations, Et as registerRelations, Ni as registerRetention, l as registerTable, yt as relations, qn as requireActors, f as requireTable, Jn as requireTenants, se as resetSnowflake, ai as residentPlacement, Vr as resolveBranchMechanism, C as resolveFullTextIndex, Be as resolveIdScheme, ae as resolveMixinGraph, ri as resolveTenantHome, Qt as resolveTenantNamespace, Li as retentionTtlMsFromEnv, s as rowNumber, Zt as sanitizeIdentifierFragment, st as serializeArraysForWrite, ei as setResidencyConfig, ur as spatialPredicate, Dr as streamTable, a as sum, ee as sumOver, Ii as sweepRetention, n as table, Jr as teardownBranch, o as text, v as timestamp, Oe as union, t as unionAll, e as validateColumnName, ye as validateIndexName, Ke as validateTableName, Fe as validateTypeIdPrefix, ke as vector, ie as vectorDistanceToOpclass, Ar as vectorEmbedding, Ue as view, he as viewSql, Cr as walkLeaves };
+export { Y as BranchNameInvalid, Lr as BranchTransitionInvalid, zi as CDC_OFFSETS_TABLE, We as ColumnBuilder, lt as ENCRYPTED_PREFIX, Hi as ENGINE, Ge as FILE_MIGRATION_PATTERN, oe as MAX_IDENTIFIER_LENGTH, Tr as TableStreamError, Jt as TenantNamespaceInvalid, qt as TenantNamespaceUnresolved, $r as TenantRegionUnavailable, Qr as TenantResidencyUnresolved, ce as WARN_IDENTIFIER_LENGTH, ki as _voltroApiKeysTable, Bi as _voltroCdcOffsetsTable, Di as _voltroIdempotencyTable, Oi as _voltroKvTable, Ei as _voltroMigrationPlansTable, wi as _voltroMigrationsTable, Vi as _voltroMssqlCdcOffsetsTable, Ti as _voltroSeedsTable, Xn as actorsTable, Xr as admitBranch, He as allEnumRenames, kt as allRegisteredRelations, De as allRegisteredTables, fr as and, ge as array, or as arrayContains, cr as arrayHas, sr as arrayOverlaps, zt as attachEagerLoads, fi as auditAllTableIndexes, di as auditTableIndexes, Ae as avg, qe as avgOver, je as bigint, si as bindResidentStore, Je as boolean, Pr as branchNamespaceName, ve as bytes, Ee as clearEnumRenames, At as clearRelationsRegistry, ri as clearResidencyConfig, Ii as clearRetentions, g as clearTableRegistry, Cr as collectSubqueries, _e as column, dn as compileEagerJson, R as compilePredicate, $t as compileRawFragment, z as compileSelect, Ar as computeEmbedding, ar as contains, be as count, Re as countDistinct, Me as databaseHandle, xe as date, ze as dbEnum, Ne as decimal, fe as declareEnumRename, It as decodeRowsFromSchema, pt as decryptFieldsOnRead, Si as defineMigration, d as defineMixin, yi as defineSeed, we as denseRank, u as deriveTypeIdPrefix, ct as deserializeArraysOnRead, b as drainIdentifierWarnings, Te as dropped, Rt as encodeRowForSchema, ft as encryptFieldsForWrite, dt as encryptedColumnsOf, qr as enforceBranchLimits, _ as ensureTableRegistered, Zn as eq, L as escapeLike, Sr as evaluatePredicate, Se as except, yr as exists, _i as formatIndexAuditIssue, Ai as frameworkTables, m as generateId, p as generateSnowflake, Ce as geography, ue as geometry, Le as getEnumRenames, Ot as getRelation, M as getRelations, ni as getResidencyConfig, y as getTable, $n as gt, er as gte, Kt as hasEagerLoads, kr as hybridSearch, T as id, rr as inSet, _r as inSubquery, A as inferForeignKey, D as integer, le as intersect, me as interval, Fr as isBranchNamespace, ut as isEncrypted, Pe as isFileMigration, Ci as isMigrationDefinition, Vr as isNeonConnection, ur as isNotNull, lr as isNull, Mi as isPrimaryKeyConflictError, ai as isRegionServable, bt as isRelationsSpec, bi as isSeedDefinition, h as isSqliteFamily, de as isView, E as json, hr as jsonField, et as jsonIndex, Ye as lag, $e as lead, Fi as listRetentions, tr as lt, nr as lte, Zr as makeNamespaceBranchExecutor, St as many, Ct as manyToMany, S as materializeFields, pe as max, Ve as migration, Qe as min, re as mixin, Qn as neq, Rr as nextBranchState, mr as not, br as notExists, ir as notInSet, vr as notInSubquery, i as numeric, xt as one, pr as or, te as paginateById, Gr as planBranch, zr as planBranchProvision, Br as planBranchTeardown, Kr as planBranchTeardownFor, Ur as planNeonBranchProvision, Wr as planNeonBranchTeardown, ji as primaryKeyConflictError, Jr as provisionBranch, ci as provisionResidentTenant, I as qualifyTable, r as queryFor, Ie as queryForView, x as quoteIdent, Xe as rank, Ze as raw, ne as real, c as reference, Kn as registerCoreTables, Dt as registerDiscoveredRelations, Et as registerRelations, Pi as registerRetention, l as registerTable, yt as relations, Jn as requireActors, f as requireTable, Yn as requireTenants, se as resetSnowflake, oi as residentPlacement, Hr as resolveBranchMechanism, C as resolveFullTextIndex, Be as resolveIdScheme, ae as resolveMixinGraph, ii as resolveTenantHome, Qt as resolveTenantNamespace, Ri as retentionTtlMsFromEnv, s as rowNumber, Zt as sanitizeIdentifierFragment, st as serializeArraysForWrite, ti as setResidencyConfig, dr as spatialPredicate, Or as streamTable, a as sum, ee as sumOver, Li as sweepRetention, n as table, Yr as teardownBranch, o as text, v as timestamp, Oe as union, t as unionAll, e as validateColumnName, ye as validateIndexName, Ke as validateTableName, Fe as validateTypeIdPrefix, ke as vector, ie as vectorDistanceToOpclass, jr as vectorEmbedding, Ue as view, he as viewSql, wr as walkLeaves };

package/dist/sql.d.ts

@@ -1754,6 +1754,37 @@ declare interface Table<Name extends string, Fields extends Record<string, Colum
             dedup?: TableUnique['dedup'];
         }): Table<Name, Fields, Reactive, IxNames>;
     };
+    /**
+     * Declare a **partial UNIQUE** constraint that holds only among the rows
+     * matching a predicate — the portable answer to "unique among the rows that
+     * aren't soft-deleted". Emits a `CREATE UNIQUE INDEX … WHERE` on postgres /
+     * sqlite / mssql.
+     *
+     * ```ts
+     * table('project_roadmaps', { id, projectId, year, deletedAt, ... })
+     *   .softDelete()
+     *   .uniqueActive(['projectId', 'year'])            // one ACTIVE roadmap per (project, year)
+     * ```
+     *
+     * By default the predicate is `"deletedAt" IS NULL` (pairs with
+     * `.softDelete()`); override with `{ where }` for a custom active-set
+     * (`"status" = 'open'`). A soft-deleted row leaves the active set, so a NEW
+     * row with the same key is allowed — no hand-written
+     * `generatedAs("CASE WHEN …")` column, no resurrection footgun.
+     *
+     * **mysql / mariadb:** these engines have no partial-index support, so
+     * `.uniqueActive()` FAILS LOUDLY at migrate time (a full unique index would
+     * silently forbid re-creating a soft-deleted row). Use a generated STORED
+     * column + `.unique()` there until the framework lowers it for you.
+     */
+    uniqueActive: {
+        <const F extends readonly [keyof Fields & string, ...Array<keyof Fields & string>]>(fields: F, options?: {
+            where?: string;
+        }): Table<Name, Fields, Reactive, IxNames>;
+        <const IxName extends string, const F extends readonly [keyof Fields & string, ...Array<keyof Fields & string>]>(name: IxName, fields: F, options?: {
+            where?: string;
+        }): Table<Name, Fields, Reactive, IxNames | IxName>;
+    };
     /**
      * Declare a named table-level `CHECK` constraint — a DB-ENFORCED
      * invariant that holds regardless of which client writes the row
@@ -1920,6 +1951,20 @@ declare interface TableIndex {
      * efConstruction, opclass}`). Ignored for kinds that don't read it.
      */
     readonly kindOptions?: IndexKindOptions;
+    /**
+     * UNIQUE partial index — set ONLY by `.uniqueActive(...)`. Emits
+     * `CREATE UNIQUE INDEX … WHERE <where>` on postgres / sqlite / mssql, so
+     * uniqueness holds only among rows matching `where` (e.g. the non-soft-
+     * deleted rows). Distinct from `.index(..., { where })` (non-unique) and
+     * from `.unique(...)` (a full constraint with no predicate). Because a
+     * unique+partial index has no `information_schema` constraint form and the
+     * declarative planner is predicate-blind, these are emitted by the
+     * fresh-schema DDL path (like every partial predicate) and kept OUT of the
+     * declarative index snapshot. mysql/mariadb have no partial-index support —
+     * `.uniqueActive()` fails loudly there (use a generated column) rather than
+     * silently dropping the predicate into a full unique index.
+     */
+    readonly unique?: boolean;
 }
 
 declare interface TableLike {

package/dist/sql.js

@@ -1,4 +1,4 @@
-import { L as e, R as t, V as n, a as r, c as i, et as a, i as o, n as s, ot as c, r as l, t as u } from "./fileBased-cc9IzIjU.js";
+import { L as e, R as t, V as n, a as r, c as i, et as a, i as o, n as s, ot as c, r as l, t as u } from "./fileBased-CRXgPJkv.js";
 import { Effect as d } from "effect";
 import { createLogger as f } from "@voltro/logger";
 import { SqlClient as p } from "@effect/sql";
@@ -347,11 +347,11 @@ var _ = (e, t, n, r = 400) => {
 			return `(${t.expr})`;
 		});
 		return n !== void 0 && i.length === 1 ? `${i[0]} ${n}` : i.join(", ");
-	}, d = (e, n, a, o, s, c = "") => {
-		let d = l(e, n, o, s);
-		if (d.skip) return "";
-		let f = u(a, d.opclass), p = `${d.withSuffix}${c}`, m = pe(n, r, i);
-		return r === "mssql" ? `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = '${e}') CREATE INDEX ${t(e, r)} ON ${m}${d.using} (${f})${p};` : r === "mysql" ? `CREATE INDEX ${t(e, r)} ON ${m}${d.using} (${f})${p};` : `CREATE INDEX IF NOT EXISTS ${t(e, r)} ON ${m}${d.using} (${f})${p};`;
+	}, d = (e, n, a, o, s, c = "", d = !1) => {
+		let f = l(e, n, o, s);
+		if (f.skip) return "";
+		let p = u(a, f.opclass), m = `${f.withSuffix}${c}`, h = pe(n, r, i), g = d ? "UNIQUE " : "";
+		return r === "mssql" ? `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = '${e}') CREATE ${g}INDEX ${t(e, r)} ON ${h}${f.using} (${p})${m};` : r === "mysql" ? `CREATE ${g}INDEX ${t(e, r)} ON ${h}${f.using} (${p})${m};` : `CREATE ${g}INDEX IF NOT EXISTS ${t(e, r)} ON ${h}${f.using} (${p})${m};`;
 	};
 	for (let n of e.appliedFullText ?? []) if (r === "postgres") {
 		let i = n.config ?? "english", o = `${n.name}_tsv`, s = n.columns.map((e) => {
@@ -369,9 +369,10 @@ var _ = (e, t, n, r = 400) => {
 			D(`[voltro:migrate] json-path index '${t.name}' on '${e.tableName}': ${r} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${r}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
 			continue;
 		}
+		if (t.unique && t.where !== void 0 && t.where.length > 0 && (r === "mysql" || r === "mariadb")) throw Error(`@voltro/migrate: uniqueActive index '${t.name}' on '${e.tableName}' cannot be expressed on ${r} — it has no partial (WHERE) index support, and a full UNIQUE index would forbid re-creating a soft-deleted row. Use a generated STORED column (text().generatedAs("CASE WHEN \`deletedAt\` IS NULL THEN <key> ELSE NULL END", { stored: true })) + .unique([...]) on ${r}, or move this table to postgres/sqlite/mssql.`);
 		let n = "";
 		t.where !== void 0 && t.where.length > 0 && (r === "mysql" || r === "mariadb" ? D(`[voltro:migrate] partial index '${t.name}' on '${e.tableName}': ${r} does not support WHERE clauses on indexes — emitting a full index`) : n = ` WHERE ${t.where}`);
-		let i = d(t.name, e.tableName, t.fields, t.kind, t.kindOptions, n);
+		let i = d(t.name, e.tableName, t.fields, t.kind, t.kindOptions, n, t.unique === !0);
 		i !== "" && a.push(i), t.fields.every((e) => typeof e == "string") && s.add(c(t.fields));
 	}
 	for (let [t, n] of Object.entries(e.fields)) {
@@ -660,6 +661,7 @@ BEGIN
 	});
 	let o = e.appliedIndexes ?? [];
 	for (let t of o) {
+		if (t.unique && t.where) continue;
 		let n = t.fields.map((e) => typeof e == "string" ? e : "jsonPath" in e ? `(json:${e.jsonPath.column}->${e.jsonPath.path.join(".")}${e.jsonPath.numeric ? "::num" : ""})` : `(${e.expr})`), i = t.fields.some((e) => typeof e != "string");
 		r({
 			name: t.name,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@voltro/database",
-  "version": "0.2.1",
+  "version": "0.3.0",
   "description": "Browser-safe schema DSL, query builder, and cross-dialect migration planner for Voltro — one schema, every SQL backend.",
   "keywords": [
     "voltro",
@@ -38,7 +38,7 @@
   },
   "dependencies": {
     "@effect/sql": "^0.51.1",
-    "@voltro/logger": "0.2.1",
+    "@voltro/logger": "0.3.0",
     "typeid-js": "^1.2.0",
     "ulidx": "^2.4.1"
   },