@voltro/database 0.55.0 → 0.56.0

package/dist/index.js

@@ -1,8 +1,8 @@
 import { $ as e, $t as t, A as n, At as r, B as i, Bt as a, C as o, Ct as s, D as c, Dt as l, E as u, Et as d, F as f, Ft as p, G as m, Gt as h, H as g, Ht as _, I as ee, It as te, J as ne, Jt as v, K as y, Kt as re, L as b, Lt as ie, M as ae, Mt as oe, N as x, Nt as se, O as ce, Ot as le, P as ue, Pt as de, Q as fe, Qt as pe, R as me, Rt as he, S as ge, St as _e, T as ve, Tt as ye, U as be, Ut as S, V as xe, Vt as Se, W as Ce, Wt as we, X as Te, Xt as Ee, Y as De, Yt as Oe, Z as ke, Zt as Ae, _ as je, _t as Me, a as Ne, at as Pe, b as Fe, bt as Ie, c as Le, ct as Re, d as ze, dt as Be, en as C, et as Ve, f as He, ft as Ue, g as We, gt as Ge, h as w, ht as Ke, it as T, j as qe, jt as Je, k as Ye, kt as Xe, l as Ze, lt as Qe, m as $e, mt as et, n as tt, nt, o as rt, ot as it, p as at, pt as ot, q as E, qt as st, r as ct, rt as lt, s as ut, st as dt, t as ft, tn as pt, tt as mt, u as ht, ut as gt, v as _t, vt, w as yt, wt as bt, x as xt, xt as St, y as Ct, yt as wt, z as Tt, zt as Et } from "./frameworkLiveTables-CwDemhjW.js";
 import { timestampMs as Dt, timestampMsOrNull as Ot } from "./wire.js";
 import { Cause as kt, Chunk as At, Data as jt, Effect as D, Exit as Mt, Metric as O, MetricBoundaries as Nt, Option as k, Runtime as Pt, Schedule as Ft, Schema as A, Stream as It } from "effect";
-import { AsyncLocalStorage as Lt } from "node:async_hooks";
-import { createHash as Rt } from "node:crypto";
+import { createHash as Lt } from "node:crypto";
+import { AsyncLocalStorage as Rt } from "node:async_hooks";
 import { TransactionConnection as zt } from "@effect/sql/SqlClient";
 import { ansi as j } from "@voltro/logger";
 import { SqlClient as Bt } from "@effect/sql";
@@ -1206,7 +1206,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 }, fi = (e, t, n) => {
 	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = ci(o, e.children, n, e.junction);
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${I(e.branch.where, r)}`, u = U(e, s, r), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : r`, ${pi(e.junction, s, r)} AS ${r(Qr)}`;
+	let l = e.branch.where === void 0 ? r`` : r` AND ${I(e.branch.where, r)}`, u = Bi(e, s, r), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : r`, ${pi(e.junction, s, r)} AS ${r(Qr)}`;
 	return r`COALESCE((SELECT jsonb_agg(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), '[]'::jsonb)`;
 }, pi = (e, t, n) => e.present.length === 0 ? n`jsonb_build_object()` : n`jsonb_build_object(${n.csv(e.present.map((e) => n`${B(e, n)}, ${z(t, e, n)}`))})`, L = (e, t, n) => t === void 0 || t.length === 0 ? n`` : n` ORDER BY ${n.csv(t.map((t) => t.direction === "desc" ? n`${z(e, t.column, n)} DESC` : n`${z(e, t.column, n)} ASC`))}`, mi = (e, t) => e === void 0 || e.length === 0 ? t`` : t` ORDER BY ${t.csv(e.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`, hi = (e, t, n) => {
 	let r = n.sql, i = n.nextAlias(), a = gi(i, t.table, t.children, n);
@@ -1246,7 +1246,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 }, Ci = (e, t, n) => {
 	let r = n.sql, i = n.nextAlias(), a = gi(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(W(e.branch.where), r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
+	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
 	return r`COALESCE((SELECT json_group_array(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), json('[]'))`;
 }, wi = (e, t, n) => {
 	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = gi(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
@@ -1254,7 +1254,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		source: yi(o)
 	});
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${I(W(e.branch.where), r)}`, u = U(e, s, r, !0), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : vi(e.junction, s, r);
+	let l = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, u = Bi(e, s, r, !0), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : vi(e.junction, s, r);
 	return r`COALESCE((SELECT json_group_array(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), json('[]'))`;
 }, Ti = (e, t, n) => {
 	let r = n.sql, i = n.nextAlias(), a = R(i, t.table, t.children, n);
@@ -1293,7 +1293,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 }, Oi = (e, t, n) => {
 	let r = n.sql, i = n.nextAlias(), a = R(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(W(e.branch.where), r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
+	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
 	return r`COALESCE((SELECT JSON_ARRAYAGG(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), JSON_ARRAY())`;
 }, ki = (e, t, n) => {
 	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = R(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
@@ -1301,12 +1301,12 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		source: yi(o)
 	});
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${I(W(e.branch.where), r)}`, u = U(e, s, r, !0), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : vi(e.junction, s, r);
+	let l = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, u = Bi(e, s, r, !0), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : vi(e.junction, s, r);
 	return r`COALESCE((SELECT JSON_ARRAYAGG(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), JSON_ARRAY())`;
 }, Ai = (e, t, n) => {
 	let r = n.sql, i = n.nextAlias(), a = R(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(W(e.branch.where), r)}`, c = e.branch.orderBy ?? [];
+	let o = r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, c = e.branch.orderBy ?? [];
 	if (e.branch.limit === void 0 && e.branch.offset === void 0) return r`COALESCE((SELECT JSON_ARRAYAGG(${a}${c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${z(i, e.column, r)} DESC` : r`${z(i, e.column, r)} ASC`))}` : r``}) FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o}${s}), JSON_ARRAY())`;
 	let l = c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${r(e.column)} DESC` : r`${r(e.column)} ASC`))}` : r` ORDER BY ${r("id")}`, u = e.branch.limit, d = e.branch.offset, f = u !== void 0 && d !== void 0 ? r` AND ${z(i, "rn", r)} > ${V(d, r)} AND ${z(i, "rn", r)} <= ${V(d + u, r)}` : u === void 0 ? r` AND ${z(i, "rn", r)} > ${V(d, r)}` : r` AND ${z(i, "rn", r)} <= ${V(u, r)}`;
 	return r`COALESCE((SELECT JSON_ARRAYAGG(${a} ORDER BY ${z(i, "rn", r)}) FROM (SELECT *, ROW_NUMBER() OVER (PARTITION BY ${r(e.foreignKey)}${l}) AS rn FROM ${r(e.target.tableName)}) AS ${r(i)} WHERE ${o}${s}${f}), JSON_ARRAY())`;
@@ -1314,12 +1314,12 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = (t) => e.junction === void 0 ? void 0 : {
 		projection: e.junction,
 		source: t
-	}, l = r`${z(s, i.sourceKey, r)} = ${z(t, "id", r)}`, u = r`${z(o, "id", r)} = ${z(s, i.targetKey, r)}`, d = e.branch.where === void 0 ? r`` : r` AND ${I(W(e.branch.where), r)}`, f = U(e, s, r, !0), p = e.branch.orderBy ?? [];
+	}, l = r`${z(s, i.sourceKey, r)} = ${z(t, "id", r)}`, u = r`${z(o, "id", r)} = ${z(s, i.targetKey, r)}`, d = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, f = Bi(e, s, r, !0), p = e.branch.orderBy ?? [];
 	if (e.branch.limit === void 0 && e.branch.offset === void 0) {
 		let t = R(o, e.target, e.children, n, c(bi(s)));
 		return t === null ? null : r`COALESCE((SELECT JSON_ARRAYAGG(${t}${p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${z(o, e.column, r)} DESC` : r`${z(o, e.column, r)} ASC`))}` : r``}) FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u} WHERE ${l}${f}${d}), JSON_ARRAY())`;
 	}
-	let m = p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${z(o, e.column, r)} DESC` : r`${z(o, e.column, r)} ASC`))}` : r` ORDER BY ${z(o, "id", r)}`, h = e.branch.limit, g = e.branch.offset, _ = h !== void 0 && g !== void 0 ? r` AND ${z(o, "rn", r)} > ${V(g, r)} AND ${z(o, "rn", r)} <= ${V(g + h, r)}` : h === void 0 ? r` AND ${z(o, "rn", r)} > ${V(g, r)}` : r` AND ${z(o, "rn", r)} <= ${V(h, r)}`, ee = e.branch.onJunction === void 0 ? r`` : r` WHERE ${H(W(e.branch.onJunction), s, r)}`, te = R(o, e.target, e.children, n, c(yi(o)));
+	let m = p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${z(o, e.column, r)} DESC` : r`${z(o, e.column, r)} ASC`))}` : r` ORDER BY ${z(o, "id", r)}`, h = e.branch.limit, g = e.branch.offset, _ = h !== void 0 && g !== void 0 ? r` AND ${z(o, "rn", r)} > ${V(g, r)} AND ${z(o, "rn", r)} <= ${V(g + h, r)}` : h === void 0 ? r` AND ${z(o, "rn", r)} > ${V(g, r)}` : r` AND ${z(o, "rn", r)} <= ${V(h, r)}`, ee = e.branch.onJunction === void 0 ? r`` : r` WHERE ${H(U(e.branch.onJunction), s, r)}`, te = R(o, e.target, e.children, n, c(yi(o)));
 	if (te === null) return null;
 	let ne = e.junction === void 0 ? r`` : vi(e.junction, s, r);
 	return r`COALESCE((SELECT JSON_ARRAYAGG(${te} ORDER BY ${z(o, "rn", r)}) FROM (SELECT ${r(o)}.*${ne}, ${z(s, i.sourceKey, r)} AS ${r(`__src_${i.sourceKey}`)}, ROW_NUMBER() OVER (PARTITION BY ${z(s, i.sourceKey, r)}${m}) AS rn FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u}${ee}) AS ${r(o)} WHERE ${z(o, `__src_${i.sourceKey}`, r)} = ${z(t, "id", r)}${d}${_}), JSON_ARRAY())`;
@@ -1379,18 +1379,18 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		source: bi(s)
 	});
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${H(e.branch.where, o, r)}`, u = U(e, s, r), d = L(o, e.branch.orderBy, r), { top: f, pagination: p, finalOrder: m } = Li(e.branch, d, r);
+	let l = e.branch.where === void 0 ? r`` : r` AND ${H(e.branch.where, o, r)}`, u = Bi(e, s, r), d = L(o, e.branch.orderBy, r), { top: f, pagination: p, finalOrder: m } = Li(e.branch, d, r);
 	return r`ISNULL(JSON_QUERY((SELECT ${f}${c} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${m}${p} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
 }, z = (e, t, n) => e === void 0 ? n`${n(t)}` : n`${n(e)}.${n(t)}`, B = (e, t) => t.unsafe(`'${e.replace(/'/g, "''")}'`), V = (e, t) => {
 	if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw Error(`literalInt: expected non-negative integer, got ${e}`);
 	return t.unsafe(String(e));
-}, H = (e, t, n) => I(Bi(e, t), n), U = (e, t, n, r = !1) => {
+}, H = (e, t, n) => I(Vi(e, t), n), Bi = (e, t, n, r = !1) => {
 	let i = e.branch.onJunction;
-	return i === void 0 ? n`` : n` AND ${H(r ? W(i) : i, t, n)}`;
-}, Bi = (e, t) => {
-	if ("not" in e) return { not: Bi(e.not, t) };
-	if ("and" in e) return { and: e.and.map((e) => Bi(e, t)) };
-	if ("or" in e) return { or: e.or.map((e) => Bi(e, t)) };
+	return i === void 0 ? n`` : n` AND ${H(r ? U(i) : i, t, n)}`;
+}, Vi = (e, t) => {
+	if ("not" in e) return { not: Vi(e.not, t) };
+	if ("and" in e) return { and: e.and.map((e) => Vi(e, t)) };
+	if ("or" in e) return { or: e.or.map((e) => Vi(e, t)) };
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
 		let n = e;
 		return {
@@ -1404,23 +1404,23 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		...n,
 		column: `${t}.${n.column}`
 	};
-}, W = (e) => {
-	if ("not" in e) return { not: W(e.not) };
-	if ("and" in e) return { and: e.and.map((e) => W(e)) };
-	if ("or" in e) return { or: e.or.map((e) => W(e)) };
+}, U = (e) => {
+	if ("not" in e) return { not: U(e.not) };
+	if ("and" in e) return { and: e.and.map((e) => U(e)) };
+	if ("or" in e) return { or: e.or.map((e) => U(e)) };
 	if (e.op === "subquery-in" || e.op === "subquery-not-in" || e.op === "exists" || e.op === "not-exists") return e;
 	let t = e;
 	return {
 		...t,
-		value: Vi(t.value)
+		value: Hi(t.value)
 	};
-}, Vi = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Vi(e)) : e, Hi = Symbol.for("@voltro/database/coreTablesRegistry"), Ui = globalThis, Wi = Ui[Hi] ?? (Ui[Hi] = {}), Gi = (e) => {
-	e.actors !== void 0 && (Wi.actors = e.actors), e.tenants !== void 0 && (Wi.tenants = e.tenants);
-}, Ki = (e, t) => () => {
+}, Hi = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Hi(e)) : e, Ui = Symbol.for("@voltro/database/coreTablesRegistry"), Wi = globalThis, Gi = Wi[Ui] ?? (Wi[Ui] = {}), Ki = (e) => {
+	e.actors !== void 0 && (Gi.actors = e.actors), e.tenants !== void 0 && (Gi.tenants = e.tenants);
+}, qi = (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();
-}, qi = () => Ki(() => Wi.actors, "actors"), Ji = () => Ki(() => Wi.tenants, "tenants"), Yi = T("actors", {
+}, Ji = () => qi(() => Gi.actors, "actors"), Yi = () => qi(() => Gi.tenants, "tenants"), Xi = T("actors", {
 	id: _(),
 	kind: t().oneOf([
 		"user",
@@ -1430,73 +1430,73 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	]),
 	displayName: t().nullable(),
 	createdAt: C().default("now")
-}), Xi = (e, t) => ({
+}), Zi = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Zi = (e, t) => ({
+}), Qi = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), Qi = (e, t) => ({
+}), $i = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), $i = (e, t) => ({
+}), ea = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), ea = (e, t) => ({
+}), ta = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), ta = (e, t) => ({
+}), na = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), na = (e, t) => ({
+}), ra = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), ra = (e, t) => ({
+}), ia = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), ia = (e, t) => ({
+}), aa = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), aa = (e, t) => ({
+}), oa = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), oa = (e, t) => ({
+}), sa = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), sa = (e, t) => ({
+}), ca = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), ca = (e, t) => ({
+}), la = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), la = {
+}), ua = {
 	column: "id",
 	op: "in",
 	value: []
-}, ua = (e) => ({
+}, da = (e) => ({
 	column: e,
 	op: "isNull"
-}), da = (e) => ({
+}), fa = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), fa = (e, t) => ({
+}), pa = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), pa = (...e) => ({ and: e }), ma = (...e) => ({ or: e }), ha = (e) => ({ not: e }), ga = (e, ...t) => {
+}), ma = (...e) => ({ and: e }), ha = (...e) => ({ or: e }), ga = (e) => ({ not: e }), _a = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
@@ -1518,33 +1518,33 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, _a = (e) => "descriptor" in e ? e.descriptor : e, va = (e, t) => ({
+}, va = (e) => "descriptor" in e ? e.descriptor : e, ya = (e, t) => ({
 	column: e,
 	op: "subquery-in",
-	subquery: _a(t)
-}), ya = (e, t) => ({
+	subquery: va(t)
+}), ba = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
-	subquery: _a(t)
-}), ba = (e) => ({
-	op: "exists",
-	subquery: _a(e)
+	subquery: va(t)
 }), xa = (e) => ({
+	op: "exists",
+	subquery: va(e)
+}), Sa = (e) => ({
 	op: "not-exists",
-	subquery: _a(e)
-}), Sa = (e, t) => e === t || e instanceof Date && t instanceof Date && e.getTime() === t.getTime(), Ca = (e, t) => {
+	subquery: va(e)
+}), Ca = (e, t) => e === t || e instanceof Date && t instanceof Date && e.getTime() === t.getTime(), wa = (e, t) => {
 	if (e == null || t == null) return null;
 	let n = e instanceof Date ? e.getTime() : e, r = t instanceof Date ? t.getTime() : t;
 	return typeof n == typeof r ? n === r ? 0 : n > r ? 1 : -1 : null;
-}, wa = (e, t, n = null) => {
+}, Ta = (e, t, n = null) => {
 	if (!t) return !1;
-	if ("not" in e) return !wa(e.not, t, n);
+	if ("not" in e) return !Ta(e.not, t, n);
 	if ("and" in e) {
-		for (let r of e.and) if (!wa(r, t, n)) return !1;
+		for (let r of e.and) if (!Ta(r, t, n)) return !1;
 		return !0;
 	}
 	if ("or" in e) {
-		for (let r of e.or) if (wa(r, t, n)) return !0;
+		for (let r of e.or) if (Ta(r, t, n)) return !0;
 		return !1;
 	}
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
@@ -1561,14 +1561,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	}
 	let r = e, i = t[r.column];
 	switch (r.op) {
-		case "eq": return Sa(i, r.value);
-		case "neq": return !Sa(i, r.value);
-		case "gt": return (Ca(i, r.value) ?? -1) > 0;
-		case "gte": return (Ca(i, r.value) ?? -1) >= 0;
-		case "lt": return (Ca(i, r.value) ?? 1) < 0;
-		case "lte": return (Ca(i, r.value) ?? 1) <= 0;
-		case "in": return Array.isArray(r.value) && r.value.some((e) => Sa(i, e));
-		case "notIn": return Array.isArray(r.value) && !r.value.some((e) => Sa(i, e));
+		case "eq": return Ca(i, r.value);
+		case "neq": return !Ca(i, r.value);
+		case "gt": return (wa(i, r.value) ?? -1) > 0;
+		case "gte": return (wa(i, r.value) ?? -1) >= 0;
+		case "lt": return (wa(i, r.value) ?? 1) < 0;
+		case "lte": return (wa(i, r.value) ?? 1) <= 0;
+		case "in": return Array.isArray(r.value) && r.value.some((e) => Ca(i, e));
+		case "notIn": return Array.isArray(r.value) && !r.value.some((e) => Ca(i, e));
 		case "contains": return typeof i == "string" && typeof r.value == "string" && i.toLowerCase().includes(r.value.toLowerCase());
 		case "startsWith": return typeof i == "string" && typeof r.value == "string" && i.startsWith(r.value);
 		case "arrayContains": {
@@ -1584,17 +1584,17 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		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.");
 	}
-}, Ta = function* (e) {
+}, Ea = function* (e) {
 	if ("not" in e) {
-		yield* Ta(e.not);
+		yield* Ea(e.not);
 		return;
 	}
 	if ("and" in e) {
-		for (let t of e.and) yield* Ta(t);
+		for (let t of e.and) yield* Ea(t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* Ta(t);
+		for (let t of e.or) yield* Ea(t);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
@@ -1604,46 +1604,46 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		kind: "exists",
 		descriptor: e.subquery
 	});
-}, Ea = function* (e, t = !0) {
+}, Da = function* (e, t = !0) {
 	if ("not" in e) {
-		yield* Ea(e.not, !1);
+		yield* Da(e.not, !1);
 		return;
 	}
 	if ("and" in e) {
-		for (let n of e.and) yield* Ea(n, t);
+		for (let n of e.and) yield* Da(n, t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* Ea(t, !1);
+		for (let t of e.or) yield* Da(t, !1);
 		return;
 	}
 	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
 		...e,
 		conjunctive: t
 	});
-}, Da = (e, t) => ({
+}, Oa = (e, t) => ({
 	...t,
 	...e,
 	origin: e.origin ?? "injected"
-}), Oa = (e, t, n = {}) => ({
+}), ka = (e, t, n = {}) => ({
 	table: e,
 	op: "insert",
 	old: null,
 	new: t,
 	...n
-}), ka = (e, t, n, r = {}) => ({
+}), Aa = (e, t, n, r = {}) => ({
 	table: e,
 	op: "update",
 	old: t,
 	new: n,
 	...r
-}), Aa = (e, t, n = {}) => ({
+}), ja = (e, t, n = {}) => ({
 	table: e,
 	op: "delete",
 	old: t,
 	new: null,
 	...n
-}), ja = (e, t, n = {}) => {
+}), Ma = (e, t, n = {}) => {
 	let { at: r = "2026-01-01T00:00:00.000Z", column: i = "deletedAt", ...a } = n;
 	return {
 		table: e,
@@ -1658,67 +1658,127 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		},
 		...a
 	};
-}, Ma = new Lt(), Na = (e, t) => Ma.run(e, t), Pa = () => Ma.getStore(), Fa = (e) => {
-	let t = e ?? Ma.getStore();
+}, Na = (e) => e == null ? "null" : e instanceof Date ? JSON.stringify(e.toISOString()) : typeof e == "bigint" ? JSON.stringify(e.toString()) : Array.isArray(e) ? `[${e.map(Na).join(",")}]` : typeof e == "object" ? `{${Object.entries(e).filter(([, e]) => e !== void 0).sort(([e], [t]) => e < t ? -1 : +(e > t)).map(([e, t]) => `${JSON.stringify(e)}:${Na(t)}`).join(",")}}` : JSON.stringify(e) ?? "null", Pa = (e) => Lt("sha256").update([
+	e.pipe,
+	e.op,
+	e.key,
+	Na(e.next),
+	Na(e.prev)
+].join("\0")).digest("hex").slice(0, 32), Fa = (e, t) => `${e}:${t}`, Ia = (e) => {
+	let t = e.lastIndexOf(":");
+	if (t <= 0) return null;
+	let n = Number(e.slice(t + 1));
+	return !Number.isInteger(n) || n < 0 ? null : {
+		digest: e.slice(0, t),
+		occurrence: n
+	};
+}, La = class {
+	#e = /* @__PURE__ */ new Map();
+	#t;
+	#n;
+	constructor(e) {
+		this.#t = e.windowMs, this.#n = Math.max(1, e.maxEntries);
+	}
+	get size() {
+		return this.#e.size;
+	}
+	next(e, t) {
+		let n = this.#e.get(e);
+		if (n === void 0) return this.#e.set(e, {
+			count: 1,
+			lastMs: t
+		}), this.#r(), 0;
+		n.lastMs = t;
+		let r = n.count;
+		return n.count += 1, this.#e.delete(e), this.#e.set(e, n), r;
+	}
+	seedFromChangeKeys(e, t) {
+		for (let n of e) {
+			let e = Ia(n);
+			if (e === null) continue;
+			let r = this.#e.get(e.digest), i = Math.max(r?.count ?? 0, e.occurrence + 1);
+			this.#e.set(e.digest, {
+				count: i,
+				lastMs: r?.lastMs ?? t
+			});
+		}
+		this.#r();
+	}
+	prune(e) {
+		let t = e - this.#t;
+		for (let [e, n] of this.#e) n.lastMs < t && this.#e.delete(e);
+	}
+	#r() {
+		for (; this.#e.size > this.#n;) {
+			let e = this.#e.keys().next();
+			if (e.done === !0) return;
+			this.#e.delete(e.value);
+		}
+	}
+}, Ra = "VOLTRO_CHANGE_CLAIMS_TTL_HOURS", za = 1, Ba = (e = process.env) => {
+	let t = Number(e[Ra]);
+	return (Number.isFinite(t) && t > 0 ? t : 1) * 2 * 36e5;
+}, Va = new Rt(), Ha = (e, t) => Va.run(e, t), Ua = () => Va.getStore(), Wa = (e) => {
+	let t = e ?? Va.getStore();
 	return t === void 0 ? {} : {
 		...t.traceId === void 0 ? {} : { traceId: t.traceId },
 		...t.subjectId === void 0 ? {} : { subjectId: t.subjectId },
 		...t.procedure === void 0 ? {} : { procedure: t.procedure },
 		...t.via === void 0 ? {} : { via: t.via }
 	};
-}, Ia = (e) => {
-	let t = Ma.getStore();
-	return t === void 0 ? e(void 0) : Ma.run(t, () => e(t));
-}, La = 3e4, Ra = 1e4, G = /* @__PURE__ */ new Map(), K = 0, za = (e, t, n) => `${e}\u0000${t}\u0000${String(n)}`, Ba = (e) => {
-	for (let [t, n] of G) {
-		let r = n.filter((t) => e - t.at < La);
-		K -= n.length - r.length, r.length === 0 ? G.delete(t) : r.length !== n.length && G.set(t, r);
-	}
-}, Va = (e, t) => {
+}, Ga = (e) => {
+	let t = Va.getStore();
+	return t === void 0 ? e(void 0) : Va.run(t, () => e(t));
+}, Ka = 3e4, qa = 1e4, W = /* @__PURE__ */ new Map(), G = 0, Ja = (e, t, n) => `${e}\u0000${t}\u0000${String(n)}`, Ya = (e) => {
+	for (let [t, n] of W) {
+		let r = n.filter((t) => e - t.at < Ka);
+		G -= n.length - r.length, r.length === 0 ? W.delete(t) : r.length !== n.length && W.set(t, r);
+	}
+}, Xa = (e, t) => {
 	if (t.traceId === void 0 && t.subjectId === void 0 && t.procedure === void 0) return;
 	let n = Date.now();
-	if (K >= Ra && Ba(n), K >= Ra) return;
-	let r = G.get(e);
-	r === void 0 ? G.set(e, [{
+	if (G >= qa && Ya(n), G >= qa) return;
+	let r = W.get(e);
+	r === void 0 ? W.set(e, [{
 		attribution: t,
 		at: n
 	}]) : r.push({
 		attribution: t,
 		at: n
-	}), K += 1;
-}, Ha = (e) => {
-	let t = G.get(e);
+	}), G += 1;
+}, Za = (e) => {
+	let t = W.get(e);
 	if (t === void 0 || t.length === 0) return;
 	let n = t.shift();
-	if (--K, t.length === 0 && G.delete(e), !(Date.now() - n.at >= La)) return n.attribution;
-}, Ua = (e) => (G.get(e)?.length ?? 0) > 0, q = /* @__PURE__ */ new Map(), Wa = /* @__PURE__ */ new Map(), Ga = /* @__PURE__ */ new Map(), Ka = 250, qa = (e) => {
-	let t = Wa.get(e);
+	if (--G, t.length === 0 && W.delete(e), !(Date.now() - n.at >= Ka)) return n.attribution;
+}, Qa = (e) => (W.get(e)?.length ?? 0) > 0, K = /* @__PURE__ */ new Map(), $a = /* @__PURE__ */ new Map(), eo = /* @__PURE__ */ new Map(), to = 250, no = (e) => {
+	let t = $a.get(e);
 	if (t === void 0) return;
-	Wa.delete(e);
-	let n = Ga.get(e);
-	n !== void 0 && (clearTimeout(n), Ga.delete(e));
+	$a.delete(e);
+	let n = eo.get(e);
+	n !== void 0 && (clearTimeout(n), eo.delete(e));
 	for (let e of t) e();
-}, Ja = (e) => {
-	q.set(e, (q.get(e) ?? 0) + 1);
-}, Ya = (e) => {
-	let t = (q.get(e) ?? 0) - 1;
+}, ro = (e) => {
+	K.set(e, (K.get(e) ?? 0) + 1);
+}, io = (e) => {
+	let t = (K.get(e) ?? 0) - 1;
 	if (t > 0) {
-		q.set(e, t);
+		K.set(e, t);
 		return;
 	}
-	q.delete(e), qa(e);
-}, Xa = (e, t, n, r) => {
-	let i = n == null ? void 0 : za(e, t, n), a = () => r(i === void 0 ? void 0 : Ha(i));
+	K.delete(e), no(e);
+}, ao = (e, t, n, r) => {
+	let i = n == null ? void 0 : Ja(e, t, n), a = () => r(i === void 0 ? void 0 : Za(i));
 	if (i === void 0) {
 		a();
 		return;
 	}
-	if (Ua(i)) {
+	if (Qa(i)) {
 		a();
 		return;
 	}
-	let o = Wa.get(e);
-	if (o === void 0 && (q.get(e) ?? 0) === 0) {
+	let o = $a.get(e);
+	if (o === void 0 && (K.get(e) ?? 0) === 0) {
 		a();
 		return;
 	}
@@ -1726,91 +1786,91 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		o.push(a);
 		return;
 	}
-	Wa.set(e, [a]);
-	let s = setTimeout(() => qa(e), Ka);
-	typeof s == "object" && typeof s.unref == "function" && s.unref(), Ga.set(e, s);
-}, Za = () => {
-	G.clear(), K = 0, q.clear();
-	for (let e of Ga.values()) clearTimeout(e);
-	Ga.clear(), Wa.clear();
-}, Qa = () => K, $a = 64, eo = "\0", to = 32, no = (e, ...t) => `${e}_${Rt("sha256").update(t.map(String).join(eo)).digest("hex").slice(0, to)}`, ro = (e) => e.length + 1 + to, J = /* @__PURE__ */ new Map(), io = (e, t) => {
-	J.set(e, {
+	$a.set(e, [a]);
+	let s = setTimeout(() => no(e), to);
+	typeof s == "object" && typeof s.unref == "function" && s.unref(), eo.set(e, s);
+}, oo = () => {
+	W.clear(), G = 0, K.clear();
+	for (let e of eo.values()) clearTimeout(e);
+	eo.clear(), $a.clear();
+}, so = () => G, co = 64, lo = "\0", uo = 32, fo = (e, ...t) => `${e}_${Lt("sha256").update(t.map(String).join(lo)).digest("hex").slice(0, uo)}`, po = (e) => e.length + 1 + uo, q = /* @__PURE__ */ new Map(), mo = (e, t) => {
+	q.set(e, {
 		recorder: t.recorder,
 		tables: new Set(t.tables),
 		ownTables: new Set(t.ownTables)
 	});
-}, ao = (e) => {
-	J.delete(e);
-}, oo = () => J.clear(), so = new Lt(), co = (e) => so.run({ n: 1 }, e), lo = (e) => D.suspend(() => {
-	let t = so.getStore();
+}, ho = (e) => {
+	q.delete(e);
+}, go = () => q.clear(), _o = new Rt(), vo = (e) => _o.run({ n: 1 }, e), yo = (e) => D.suspend(() => {
+	let t = _o.getStore();
 	if (t !== void 0) return t.n += 1, D.ensuring(e, D.sync(() => {
 		--t.n;
 	}));
 	let n = { n: 1 };
-	return so.enterWith(n), D.ensuring(e, D.sync(() => {
+	return _o.enterWith(n), D.ensuring(e, D.sync(() => {
 		--n.n;
 	}));
-}), uo = () => (so.getStore()?.n ?? 0) > 0, fo = (e) => {
-	if (J.size === 0 || (so.getStore()?.n ?? 0) > 0) return !1;
-	for (let t of J.values()) if (!t.ownTables.has(e) && t.tables.has(e)) return !0;
+}), bo = () => (_o.getStore()?.n ?? 0) > 0, xo = (e) => {
+	if (q.size === 0 || (_o.getStore()?.n ?? 0) > 0) return !1;
+	for (let t of q.values()) if (!t.ownTables.has(e) && t.tables.has(e)) return !0;
 	return !1;
-}, po = async (e, t) => {
-	if (J.size !== 0) {
-		for (let [n, r] of J.entries()) if (!r.ownTables.has(t.table) && r.tables.has(t.table)) try {
+}, So = async (e, t) => {
+	if (q.size !== 0) {
+		for (let [n, r] of q.entries()) if (!r.ownTables.has(t.table) && r.tables.has(t.table)) try {
 			await r.recorder(e, t);
 		} catch (e) {
 			let r = gn(e);
 			throw r === void 0 ? e : Error(`write recorder '${n}' failed while recording a ${t.op} on '${t.table}': ${r}`, { cause: e });
 		}
 	}
-}, mo = Nt.exponential({
+}, Co = Nt.exponential({
 	start: 5e-4,
 	factor: 2,
 	count: 16
-}), ho = O.counter("voltro_db_queries_total", { description: "Database operations executed, by dialect and operation kind." }), go = O.histogram("voltro_db_query_duration_seconds", mo, "Database operation duration in seconds, by dialect and operation kind."), _o = O.counter("voltro_db_errors_total", { description: "Database operations that threw, by dialect and operation kind." }), vo = O.gauge("voltro_db_operations_in_flight", { description: "Database operations currently executing, by dialect. An upper bound on connections the framework holds; NOT the driver pool's waiting count." }), yo = O.counter("voltro_db_eager_fallback_total", { description: "Eager-load queries that degraded from the single-roundtrip JSON-agg path to the multi-query walker, by dialect and reason." }), bo = [], xo = /* @__PURE__ */ new Map(), So = /* @__PURE__ */ new Map(), Co = /* @__PURE__ */ new Map(), wo = (e, t) => {
-	let n = `${e}\u0000${t}`, r = xo.get(n);
+}), wo = O.counter("voltro_db_queries_total", { description: "Database operations executed, by dialect and operation kind." }), To = O.histogram("voltro_db_query_duration_seconds", Co, "Database operation duration in seconds, by dialect and operation kind."), Eo = O.counter("voltro_db_errors_total", { description: "Database operations that threw, by dialect and operation kind." }), Do = O.gauge("voltro_db_operations_in_flight", { description: "Database operations currently executing, by dialect. An upper bound on connections the framework holds; NOT the driver pool's waiting count." }), Oo = O.counter("voltro_db_eager_fallback_total", { description: "Eager-load queries that degraded from the single-roundtrip JSON-agg path to the multi-query walker, by dialect and reason." }), ko = [], Ao = /* @__PURE__ */ new Map(), jo = /* @__PURE__ */ new Map(), Mo = /* @__PURE__ */ new Map(), No = (e, t) => {
+	let n = `${e}\u0000${t}`, r = Ao.get(n);
 	if (r !== void 0) return r;
 	let i = (n) => O.tagged(O.tagged(n, "dialect", e), "op", t), a = {
-		count: i(ho),
-		duration: i(go),
-		errors: i(_o)
+		count: i(wo),
+		duration: i(To),
+		errors: i(Eo)
 	};
-	return xo.set(n, a), a;
-}, To = () => {
-	xo.clear(), So.clear(), Co.clear();
-}, Eo = () => xo.size + So.size + Co.size, Do = /* @__PURE__ */ new Map(), Oo = (e, t) => {
-	let n = Math.max(0, (Do.get(e) ?? 0) + t);
-	n === 0 ? Do.delete(e) : Do.set(e, n);
-	let r = So.get(e);
-	r === void 0 && (r = O.tagged(vo, "dialect", e), So.set(e, r)), r.unsafeUpdate(n, bo);
-}, ko = (e) => Do.get(e) ?? 0, Ao = (e) => {
-	let t = wo(String(e.dialect), e.op);
-	t.count.unsafeUpdate(1, bo), t.duration.unsafeUpdate(e.durationMs / 1e3, bo), e.status === "error" && t.errors.unsafeUpdate(1, bo);
-}, jo = async (e, t, n) => {
+	return Ao.set(n, a), a;
+}, Po = () => {
+	Ao.clear(), jo.clear(), Mo.clear();
+}, Fo = () => Ao.size + jo.size + Mo.size, Io = /* @__PURE__ */ new Map(), Lo = (e, t) => {
+	let n = Math.max(0, (Io.get(e) ?? 0) + t);
+	n === 0 ? Io.delete(e) : Io.set(e, n);
+	let r = jo.get(e);
+	r === void 0 && (r = O.tagged(Do, "dialect", e), jo.set(e, r)), r.unsafeUpdate(n, ko);
+}, Ro = (e) => Io.get(e) ?? 0, zo = (e) => {
+	let t = No(String(e.dialect), e.op);
+	t.count.unsafeUpdate(1, ko), t.duration.unsafeUpdate(e.durationMs / 1e3, ko), e.status === "error" && t.errors.unsafeUpdate(1, ko);
+}, Bo = async (e, t, n) => {
 	let r = performance.now(), i = String(e);
-	Oo(i, 1);
+	Lo(i, 1);
 	let a = "ok";
 	try {
 		return await n();
 	} catch (e) {
 		throw a = "error", e;
 	} finally {
-		Oo(i, -1), Ao({
+		Lo(i, -1), zo({
 			dialect: e,
 			op: t,
 			durationMs: performance.now() - r,
 			status: a
 		});
 	}
-}, Mo = 3e5, No = (e) => {
+}, Vo = 3e5, Ho = (e) => {
 	if (e == null || e === "") return;
 	let t = Number(e);
 	return Number.isFinite(t) && t >= 0 ? Math.floor(t) : void 0;
-}, Po = (e, t = process.env) => No(t.VOLTRO_DB_EAGER_FALLBACK_WARN_INTERVAL_MS) ?? No(e) ?? 3e5, Fo = (e, t = {}) => {
-	let n = Po(t.warnIntervalMs), r = t.now ?? (() => Date.now()), i = /* @__PURE__ */ new Map();
+}, Uo = (e, t = process.env) => Ho(t.VOLTRO_DB_EAGER_FALLBACK_WARN_INTERVAL_MS) ?? Ho(e) ?? 3e5, Wo = (e, t = {}) => {
+	let n = Uo(t.warnIntervalMs), r = t.now ?? (() => Date.now()), i = /* @__PURE__ */ new Map();
 	return (t) => {
-		let a = `${t.dialect} ${t.reason}`, o = Co.get(a);
-		o === void 0 && (o = O.tagged(O.tagged(yo, "dialect", String(t.dialect)), "reason", t.reason), Co.set(a, o)), o.unsafeUpdate(1, bo);
+		let a = `${t.dialect} ${t.reason}`, o = Mo.get(a);
+		o === void 0 && (o = O.tagged(O.tagged(Oo, "dialect", String(t.dialect)), "reason", t.reason), Mo.set(a, o)), o.unsafeUpdate(1, ko);
 		let s = `${t.table}\u0000${t.reason}`, c = i.get(s), l = c === void 0 || n > 0 && r() - c >= n, u = {
 			table: t.table,
 			dialect: String(t.dialect),
@@ -1824,10 +1884,10 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 		i.set(s, r()), e.warn(t.reason === "execute-failed" ? "eager-load JSON-agg statement FAILED and was re-run on the multi-query walker — this query pays both paths on every call. Counted as voltro_db_eager_fallback_total{reason=\"execute-failed\"}." : "eager-load could not be compiled to a single JSON-agg roundtrip and is running on the multi-query walker — one round trip per relation level, on every call. Counted as voltro_db_eager_fallback_total{reason=\"not-compilable\"}.", u);
 	};
-}, Io = (e) => {
+}, Go = (e) => {
 	if (Mt.isSuccess(e)) return e.value;
 	throw kt.squash(e.cause);
-}, Lo = "10 millis", Ro = 3, zo = async (e) => {
+}, Ko = "10 millis", qo = 3, Jo = async (e) => {
 	let t = 0, n = D.suspend(() => {
 		let n = ++t;
 		return e.withTransaction(D.flatMap(D.serviceOption(zt), (t) => {
@@ -1838,10 +1898,10 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			});
 			return e.prepare === void 0 ? i : D.flatMap(e.prepare(r), () => i);
 		})).pipe(D.catchAllDefect((t) => e.isRetryable(t) ? D.fail(t) : D.die(t)));
-	}), r = Ft.exponential(Lo).pipe(Ft.compose(Ft.recurs(Ro)), Ft.whileInput(e.isRetryable)), i = n.pipe(D.retry(r), D.withSpan(e.span.name, { attributes: { ...e.span.attributes } }));
-	return jo(e.dialect, "transaction", async () => Io(await e.runPromiseExit(e.wrapProgram === void 0 ? i : e.wrapProgram(i))));
-}, Bo = async (e) => {
-	let t = Pa(), n = t === void 0 ? (e) => e() : (e) => Na(t, e), r = await zo({
+	}), r = Ft.exponential(Ko).pipe(Ft.compose(Ft.recurs(qo)), Ft.whileInput(e.isRetryable)), i = n.pipe(D.retry(r), D.withSpan(e.span.name, { attributes: { ...e.span.attributes } }));
+	return Bo(e.dialect, "transaction", async () => Go(await e.runPromiseExit(e.wrapProgram === void 0 ? i : e.wrapProgram(i))));
+}, Yo = async (e) => {
+	let t = Ua(), n = t === void 0 ? (e) => e() : (e) => Ha(t, e), r = await Jo({
 		...e,
 		body: (r) => {
 			let i = e.makeView(r, t);
@@ -1852,14 +1912,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 	});
 	return r.view.commitEvents(), r.result;
-}, Vo = class extends A.TaggedError()("VersionConflict", {
+}, Xo = class extends A.TaggedError()("VersionConflict", {
 	table: A.String,
 	id: A.String,
 	expected: A.Number,
 	actual: A.NullOr(A.Number)
-}) {}, Ho = (e) => {
+}) {}, Zo = (e) => {
 	for (let [t, n] of Object.entries(e)) if (n?.definition?.versionColumn === !0) return t;
-}, Uo = (e) => {
+}, Qo = (e) => {
 	let { versionColumn: t, patch: n } = e;
 	if (t === void 0) return {
 		nextVersion: void 0,
@@ -1872,28 +1932,28 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		expected: i,
 		patch: a
 	};
-}, Wo = (e) => {
-	if (e.expected !== void 0 && (e.current === null || e.current !== e.expected)) return new Vo({
+}, $o = (e) => {
+	if (e.expected !== void 0 && (e.current === null || e.current !== e.expected)) return new Xo({
 		table: e.table,
 		id: e.id,
 		expected: e.expected,
 		actual: e.current
 	});
-}, Go = 1, Ko = "voltro/expires", qo = () => it({
-	id: Ko,
+}, es = 1, ts = "voltro/expires", ns = () => it({
+	id: ts,
 	fields: { expiresAt: C().nullable() },
 	behaviors: { defaultWhere: () => "expiresAt IS NULL OR expiresAt > now()" }
-}), Jo = "voltro/localFirst", Yo = () => it({
-	id: Jo,
+}), rs = "voltro/localFirst", is = () => it({
+	id: rs,
 	fields: {}
-}), Xo = (e) => e.appliedMixins.some((e) => e.id === Jo), Zo = (e) => {
+}), as = (e) => e.appliedMixins.some((e) => e.id === rs), os = (e) => {
 	let t = [];
-	for (let n of Object.values(e)) Xo(n) && t.push(n.tableName);
+	for (let n of Object.values(e)) as(n) && t.push(n.tableName);
 	return t;
-}, Qo = class extends jt.TaggedError("TableStreamError") {}, $o = 1e3, es = (e, t, n, r) => {
+}, ss = class extends jt.TaggedError("TableStreamError") {}, cs = 1e3, ls = (e, t, n, r) => {
 	let i = k.match(r, {
 		onNone: () => e.where,
-		onSome: (n) => e.where ? pa(e.where, Qi(t, n)) : Qi(t, n)
+		onSome: (n) => e.where ? ma(e.where, $i(t, n)) : $i(t, n)
 	});
 	return {
 		table: e.table,
@@ -1908,19 +1968,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		...e.includeDeleted === void 0 ? {} : { includeDeleted: e.includeDeleted },
 		...e.crossTenant === void 0 ? {} : { crossTenant: e.crossTenant }
 	};
-}, ts = (e, t) => {
-	let n = t.pk ?? "id", r = t.chunkSize ?? $o;
+}, us = (e, t) => {
+	let n = t.pk ?? "id", r = t.chunkSize ?? cs;
 	return It.paginateChunkEffect(k.none(), (i) => {
 		let a = D.tryPromise({
-			try: () => e.query(es(t, n, r, i)),
-			catch: (e) => new Qo({
+			try: () => e.query(ls(t, n, r, i)),
+			catch: (e) => new ss({
 				table: t.table,
 				cause: e
 			})
 		});
 		return (t.retry ? a.pipe(D.retry(t.retry)) : a).pipe(D.map((e) => [At.fromIterable(e), e.length === r && e.length > 0 ? k.some(k.some(e[e.length - 1][n])) : k.none()]));
 	});
-}, ns = (e) => {
+}, ds = (e) => {
 	let t = e.alpha ?? .5;
 	if (t < 0 || t > 1) throw Error(`hybridSearch: alpha must be in [0, 1], got ${t}`);
 	return (n) => {
@@ -1947,14 +2007,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			}
 		};
 	};
-}, rs = async (e, t) => {
+}, fs = 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 };
-}, is = (e) => {
+}, ps = (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) => rs(e, t);
+	let t = e.as ?? "embedding", n = (t) => fs(e, t);
 	return it({
 		id: "voltro/vectorEmbedding",
 		fields: { [t]: pt(e.dimensions) },
@@ -1972,19 +2032,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			beforeUpdate: n
 		}
 	});
-}, as = 63, os = "br_pr", Y = class extends Error {
+}, ms = 63, hs = "br_pr", J = class extends Error {
 	_tag = "BranchNameInvalid";
 	constructor(e) {
 		super(e), this.name = "BranchNameInvalid";
 	}
-}, ss = (e, t) => {
-	if (!Number.isInteger(t) || t < 0) throw new Y(`prNumber must be a non-negative integer, got ${String(t)}`);
+}, gs = (e, t) => {
+	if (!Number.isInteger(t) || t < 0) throw new J(`prNumber must be a non-negative integer, got ${String(t)}`);
 	let n = Tr(e);
-	if (n.replace(/_/g, "") === "") throw new Y(`app slug '${e}' has no usable identifier characters`);
-	let r = `${os}${t}_${n}`;
-	if (r.length > as) throw new Y(`branch namespace '${r}' exceeds the ${as}-byte identifier limit — use a shorter app slug`);
+	if (n.replace(/_/g, "") === "") throw new J(`app slug '${e}' has no usable identifier characters`);
+	let r = `${hs}${t}_${n}`;
+	if (r.length > ms) throw new J(`branch namespace '${r}' exceeds the ${ms}-byte identifier limit — use a shorter app slug`);
 	return r;
-}, cs = (e) => e.startsWith(os), ls = {
+}, _s = (e) => e.startsWith(hs), vs = {
 	requested: {
 		provision: "provisioning",
 		destroy: "destroying"
@@ -2003,19 +2063,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		fail: "failed"
 	},
 	destroyed: {}
-}, us = class extends Error {
+}, ys = 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";
 	}
-}, ds = (e, t) => {
-	let n = ls[e][t];
-	if (n === void 0) throw new us(e, t);
+}, bs = (e, t) => {
+	let n = vs[e][t];
+	if (n === void 0) throw new ys(e, t);
 	return n;
-}, fs = (e, t, n, r, i = [], a = []) => {
-	if (n === "copy" && (r === void 0 || r === "")) throw new Y("seed 'copy' requires a parentNamespace to snapshot from");
+}, xs = (e, t, n, r, i = [], a = []) => {
+	if (n === "copy" && (r === void 0 || r === "")) throw new J("seed 'copy' requires a parentNamespace to snapshot from");
 	let o = [{
 		kind: "create-namespace",
 		detail: e
@@ -2044,13 +2104,13 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		kind: "seed",
 		detail: `run boot seeds into ${e}`
 	}), o;
-}, ps = (e) => {
-	if (!cs(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
+}, Ss = (e) => {
+	if (!_s(e)) throw new J(`refusing to plan teardown of '${e}' — not a branch namespace`);
 	return [{
 		kind: "drop-namespace",
 		detail: e
 	}];
-}, ms = (e) => {
+}, Cs = (e) => {
 	if (e === void 0 || e === "") return !1;
 	try {
 		let t = new URL(e).hostname.toLowerCase();
@@ -2058,27 +2118,27 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	} catch {
 		return /\bneon\.(tech|build)\b/i.test(e);
 	}
-}, hs = (e) => e.prefer === void 0 ? e.seed === "copy" && ms(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, gs = (e, t = {}) => [{
+}, ws = (e) => e.prefer === void 0 ? e.seed === "copy" && Cs(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, Ts = (e, t = {}) => [{
 	kind: "neon-branch-create",
 	detail: `${t.parentBranch ?? "main"} → ${e} (copy-on-write)`
-}], _s = (e) => {
-	if (!cs(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
+}], Es = (e) => {
+	if (!_s(e)) throw new J(`refusing to plan teardown of '${e}' — not a branch namespace`);
 	return [{
 		kind: "neon-branch-delete",
 		detail: e
 	}];
-}, vs = (e) => e.mechanism === "neon-cow" ? gs(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : fs(e.branchId, e.tableNames, e.seed, e.parentNamespace, e.foreignKeys, e.indexNames), ys = (e, t) => e === "neon-cow" ? _s(t) : ps(t), bs = (e, t, n) => {
+}, Ds = (e) => e.mechanism === "neon-cow" ? Ts(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : xs(e.branchId, e.tableNames, e.seed, e.parentNamespace, e.foreignKeys, e.indexNames), Os = (e, t) => e === "neon-cow" ? Es(t) : Ss(t), ks = (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
 	};
-}, xs = async (e, t) => {
-	let n = ss(e.appSlug, e.prNumber), r = hs({
+}, As = async (e, t) => {
+	let n = gs(e.appSlug, e.prNumber), r = ws({
 		seed: e.seed,
 		...e.dbUrl === void 0 ? {} : { dbUrl: e.dbUrl },
 		...e.prefer === void 0 ? {} : { prefer: e.prefer }
-	}), i = vs({
+	}), i = Ds({
 		mechanism: r,
 		branchId: n,
 		tableNames: e.tableNames,
@@ -2107,16 +2167,16 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		mechanism: r,
 		steps: i
 	};
-}, Ss = async (e, t, n) => {
-	let r = ys(t, e);
+}, js = async (e, t, n) => {
+	let r = Os(t, e);
 	return t === "neon-cow" ? await n.neonBranchDelete(e) : await n.dropNamespace(e), r;
-}, Cs = (e, t, n) => bs(e, t, n), X = (e) => `"${e.replace(/"/g, "\"\"")}"`, ws = {
+}, Ms = (e, t, n) => ks(e, t, n), Y = (e) => `"${e.replace(/"/g, "\"\"")}"`, Ns = {
 	cascade: "CASCADE",
 	restrict: "RESTRICT",
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
-}, Z = (e) => `'${e.replace(/'/g, "''")}'`, Ts = (e, t) => {
-	let n = t.columns.map(Z).join(", ");
+}, X = (e) => `'${e.replace(/'/g, "''")}'`, Ps = (e, t) => {
+	let n = t.columns.map(X).join(", ");
 	return `DO $voltro_branch$
 DECLARE derived name;
 BEGIN
@@ -2125,11 +2185,11 @@ BEGIN
     JOIN pg_class i ON i.oid = x.indexrelid
     JOIN pg_class c ON c.oid = x.indrelid
     JOIN pg_namespace nsp ON nsp.oid = c.relnamespace
-   WHERE nsp.nspname = ${Z(e)}
-     AND c.relname = ${Z(t.table)}
+   WHERE nsp.nspname = ${X(e)}
+     AND c.relname = ${X(t.table)}
      AND NOT x.indisprimary
      AND x.indisunique = ${t.unique ? "true" : "false"}
-     AND i.relname <> ${Z(t.name)}
+     AND i.relname <> ${X(t.name)}
      AND (
        SELECT array_agg(att.attname::text ORDER BY k.ord)
          FROM unnest(x.indkey::int2[]) WITH ORDINALITY AS k(attnum, ord)
@@ -2138,39 +2198,39 @@ BEGIN
    LIMIT 1;
   IF derived IS NOT NULL THEN
     EXECUTE format('ALTER INDEX %I.%I RENAME TO %I',
-      ${Z(e)}, derived, ${Z(t.name)});
+      ${X(e)}, derived, ${X(t.name)});
   END IF;
 END
 $voltro_branch$`;
-}, Es = (e, t) => {
-	let n = t.onDelete === void 0 ? "" : ` ON DELETE ${ws[t.onDelete]}`, r = t.onUpdate === void 0 ? "" : ` ON UPDATE ${ws[t.onUpdate]}`;
-	return `ALTER TABLE ${X(e)}.${X(t.table)} ADD FOREIGN KEY (${X(t.column)}) REFERENCES ${X(e)}.${X(t.targetTable)} (${X(t.targetColumn)})${n}${r}`;
-}, Ds = (e) => {
+}, Fs = (e, t) => {
+	let n = t.onDelete === void 0 ? "" : ` ON DELETE ${Ns[t.onDelete]}`, r = t.onUpdate === void 0 ? "" : ` ON UPDATE ${Ns[t.onUpdate]}`;
+	return `ALTER TABLE ${Y(e)}.${Y(t.table)} ADD FOREIGN KEY (${Y(t.column)}) REFERENCES ${Y(e)}.${Y(t.targetTable)} (${Y(t.targetColumn)})${n}${r}`;
+}, Is = (e) => {
 	let t = () => {
 		throw Error("namespace branch executor: Neon ops require a neon-cow executor (use a Neon connection for copy-on-write branches)");
 	};
 	return {
-		createNamespace: (t) => e.run(`CREATE SCHEMA IF NOT EXISTS ${X(t)}`),
-		createTable: (t, n) => e.run(`CREATE TABLE IF NOT EXISTS ${X(t)}.${X(n)} (LIKE ${X(n)} INCLUDING ALL)`),
-		copyTable: (t, n, r) => e.run(`INSERT INTO ${X(n)}.${X(r)} SELECT * FROM ${X(t)}.${X(r)}`),
-		addForeignKey: (t, n) => e.run(Es(t, n)),
-		restoreIndexName: (t, n) => e.run(Ts(t, n)),
-		dropNamespace: (t) => e.run(`DROP SCHEMA IF EXISTS ${X(t)} CASCADE`),
+		createNamespace: (t) => e.run(`CREATE SCHEMA IF NOT EXISTS ${Y(t)}`),
+		createTable: (t, n) => e.run(`CREATE TABLE IF NOT EXISTS ${Y(t)}.${Y(n)} (LIKE ${Y(n)} INCLUDING ALL)`),
+		copyTable: (t, n, r) => e.run(`INSERT INTO ${Y(n)}.${Y(r)} SELECT * FROM ${Y(t)}.${Y(r)}`),
+		addForeignKey: (t, n) => e.run(Fs(t, n)),
+		restoreIndexName: (t, n) => e.run(Ps(t, n)),
+		dropNamespace: (t) => e.run(`DROP SCHEMA IF EXISTS ${Y(t)} CASCADE`),
 		neonBranchCreate: t,
 		neonBranchDelete: t
 	};
-}, Os = class extends Error {
+}, Ls = class extends Error {
 	_tag = "TenantResidencyUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantResidencyUnresolved";
 	}
-}, ks = class extends Error {
+}, Rs = class extends Error {
 	region;
 	_tag = "TenantRegionUnavailable";
 	constructor(e, t) {
 		super(t), this.region = e, this.name = "TenantRegionUnavailable";
 	}
-}, As, js = (e) => {
+}, zs, Bs = (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();
@@ -2179,98 +2239,98 @@ $voltro_branch$`;
 		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 As = e, e;
-}, Ms = () => As, Ns = () => {
-	As = void 0;
-}, Ps = (e, t) => {
-	if (e == null || e === "") throw new Os("residency is on but the request has no resolvable tenant — refusing to bind a store");
+	return zs = e, e;
+}, Vs = () => zs, Hs = () => {
+	zs = void 0;
+}, Us = (e, t) => {
+	if (e == null || e === "") throw new Ls("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 Os(`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 Ls(`no residency home is mapped for tenant '${e}' — refusing to fall back to a default store (would be a residency violation)`);
 	return n;
-}, Fs = (e, t) => t.servableRegions.includes(e), Is = (e, t) => {
-	let n = Ps(e.tenantId, t), r = Er(n.tenantId);
+}, Ws = (e, t) => t.servableRegions.includes(e), Gs = (e, t) => {
+	let n = Us(e.tenantId, t), r = Er(n.tenantId);
 	return {
 		region: n.region,
 		namespace: r,
 		...n.connectionKey === void 0 ? {} : { connectionKey: n.connectionKey }
 	};
-}, Ls = (e, t, n) => {
-	let r = Is(e, t);
-	if (!Fs(r.region, t)) throw new ks(r.region, `tenant homed in region '${r.region}', which this deployment does not serve — route to the home region`);
+}, Ks = (e, t, n) => {
+	let r = Gs(e, t);
+	if (!Ws(r.region, t)) throw new Rs(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 ks(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
+	if (i === void 0) throw new Rs(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
 	return {
 		store: i,
 		placement: r
 	};
-}, Rs = async (e, t, n, r) => {
-	let { store: i, placement: a } = Ls(e, t, n);
+}, qs = async (e, t, n, r) => {
+	let { store: i, placement: a } = Ks(e, t, n);
 	return await r(i, a), a;
-}, zs = (e) => {
+}, Js = (e) => {
 	if (typeof e == "string") return e;
 	if ("jsonPath" in e) {
 		let { column: t, path: n, numeric: r } = e.jsonPath;
 		return `(json:${t}->${n.join(".")}${r ? "::num" : ""})`;
 	}
 	return `(${e.expr})`;
-}, Q = (e) => e.map(zs), Bs = (e, t) => {
+}, Z = (e) => e.map(Js), Ys = (e, t) => {
 	if (e.length !== t.length) return !1;
-	for (let n = 0; n < e.length; n++) if (zs(e[n]) !== zs(t[n])) return !1;
+	for (let n = 0; n < e.length; n++) if (Js(e[n]) !== Js(t[n])) return !1;
 	return !0;
-}, Vs = (e, t) => {
+}, Xs = (e, t) => {
 	if (e.length >= t.length) return !1;
-	for (let n = 0; n < e.length; n++) if (zs(e[n]) !== zs(t[n])) return !1;
+	for (let n = 0; n < e.length; n++) if (Js(e[n]) !== Js(t[n])) return !1;
 	return !0;
-}, Hs = (e) => {
+}, Zs = (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 (Bs(i.fields, e.fields)) {
+			if (Ys(i.fields, e.fields)) {
 				let [n, a] = i.name < e.name ? [i, e] : [e, i];
 				t.push({
 					kind: "duplicate-fields",
 					table: r,
 					redundant: n,
 					coveredBy: a,
-					message: `'${r}' has two indexes on the same fields [${Q(i.fields).join(", ")}]: '${i.name}' and '${e.name}'. The B-tree engine builds both, costing write throughput + disk space for no read benefit. Drop '${n.name}' (or '${a.name}' if you prefer the other name). Applies to every supported dialect (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
+					message: `'${r}' has two indexes on the same fields [${Z(i.fields).join(", ")}]: '${i.name}' and '${e.name}'. The B-tree engine builds both, costing write throughput + disk space for no read benefit. Drop '${n.name}' (or '${a.name}' if you prefer the other name). Applies to every supported dialect (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
 				});
 				continue;
 			}
-			Vs(i.fields, e.fields) ? t.push({
+			Xs(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).`
-			}) : Vs(e.fields, i.fields) && t.push({
+				message: `'${r}' index '${i.name}' on [${Z(i.fields).join(", ")}] is a leading prefix of '${e.name}' on [${Z(e.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Z(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).`
+			}) : Xs(e.fields, i.fields) && t.push({
 				kind: "redundant-prefix",
 				table: r,
 				redundant: e,
 				coveredBy: i,
-				message: `'${r}' index '${e.name}' on [${Q(e.fields).join(", ")}] is a leading prefix of '${i.name}' on [${Q(i.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Q(e.fields).join(", ")}] query from '${i.name}' too via the leading-prefix rule, so '${e.name}' adds write cost without read benefit. Drop '${e.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
+				message: `'${r}' index '${e.name}' on [${Z(e.fields).join(", ")}] is a leading prefix of '${i.name}' on [${Z(i.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Z(e.fields).join(", ")}] query from '${i.name}' too via the leading-prefix rule, so '${e.name}' adds write cost without read benefit. Drop '${e.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
 			});
 		}
 	}
 	return t;
-}, Us = (e) => {
+}, Qs = (e) => {
 	let t = [];
-	for (let n of e) t.push(...Hs(n));
+	for (let n of e) t.push(...Zs(n));
 	return t;
-}, Ws = "\x1B[", Gs = `${Ws}38;2;245;158;11m`, Ks = `${Ws}38;2;16;185;129m`, qs = (e, t) => `${e}${t}${j.reset}`, $ = (e, t, n) => e ? typeof t == "function" ? t(n) : qs(t, n) : n, Js = (e, t = {}) => {
-	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => $(n, j.dim, e.padEnd(11)), a = (e) => $(n, (e) => j.bold(j.brand(e)), e), o = (e) => $(n, j.brightRed24, e), s = (e) => $(n, Ks, e), c = (e) => $(n, Gs, e), l = (e) => $(n, j.dim, e), u = `${c("index audit")} ${l("·")} ${$(n, j.bold, e.kind)}`, d = e.redundant.fields.length, f = Q(e.coveredBy.fields.slice(d)), p = (e, t) => {
+}, $s = "\x1B[", ec = `${$s}38;2;245;158;11m`, tc = `${$s}38;2;16;185;129m`, nc = (e, t) => `${e}${t}${j.reset}`, Q = (e, t, n) => e ? typeof t == "function" ? t(n) : nc(t, n) : n, rc = (e, t = {}) => {
+	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => Q(n, j.dim, e.padEnd(11)), a = (e) => Q(n, (e) => j.bold(j.brand(e)), e), o = (e) => Q(n, j.brightRed24, e), s = (e) => Q(n, tc, e), c = (e) => Q(n, ec, e), l = (e) => Q(n, j.dim, e), u = `${c("index audit")} ${l("·")} ${Q(n, j.bold, e.kind)}`, d = e.redundant.fields.length, f = Z(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, j.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");
-}, Ys = (e, { apply: t, undo: n }) => ({
+	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(Z(e.redundant.fields), d)}`), m.push(""), m.push(`${i("covered by")}${s(e.coveredBy.name)}`), m.push(`${i("")}${p(Z(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 ${Q(n, j.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");
+}, ic = (e, { apply: t, undo: n }) => ({
 	name: e,
 	apply: t,
 	undo: n
-}), Xs = (e) => {
+}), ac = (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: Ys });
+	let t = e.steps({ step: ic });
 	if (t.length === 0) throw Error(`migration "${e.id}": at least one step is required`);
 	return {
 		__migration: !0,
@@ -2278,7 +2338,7 @@ $voltro_branch$`;
 		name: e.name,
 		steps: t
 	};
-}, Zs = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, Qs = T("_voltro_migrations", {
+}, oc = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, sc = T("_voltro_migrations", {
 	id: _({ prefix: "mig" }),
 	name: t(),
 	hash: t(),
@@ -2290,7 +2350,7 @@ $voltro_branch$`;
 	workflowRunId: t().nullable(),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["status"]), $s = T("_voltro_seeds", {
+}).index(["status"]), cc = T("_voltro_seeds", {
 	id: _({ prefix: "seed" }),
 	name: t(),
 	lifecycle: t(),
@@ -2306,7 +2366,7 @@ $voltro_branch$`;
 	workflowRunId: t().nullable(),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), ec = T("_voltro_migration_plans", {
+}).index(["lifecycle"]).index(["nextRunAt"]), lc = T("_voltro_migration_plans", {
 	id: _({ prefix: "plan" }),
 	fingerprint: t(),
 	liveFingerprint: t().nullable(),
@@ -2322,21 +2382,21 @@ $voltro_branch$`;
 	appliedAt: C().default("now"),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), tc = T("_voltro_idempotency", {
+}).index(["fingerprint"]).index(["environment"]), uc = T("_voltro_idempotency", {
 	id: _({ prefix: "idem" }),
 	scope: t(),
 	key: t(),
 	status: t(),
 	response: h().nullable(),
 	createdAt: C().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), nc = T("_voltro_kv", {
+}).unique(["scope", "key"]).index(["createdAt"]), dc = T("_voltro_kv", {
 	id: _({ prefix: "kv" }),
 	key: t().unique(),
 	value: t().nullable(),
 	expiresAt: C().nullable(),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["expiresAt"]), rc = T("_voltro_api_keys", {
+}).index(["expiresAt"]), fc = T("_voltro_api_keys", {
 	id: _({ prefix: "apikey" }),
 	tenantId: t().nullable(),
 	name: t(),
@@ -2351,11 +2411,20 @@ $voltro_branch$`;
 	onBehalfOf: t().nullable(),
 	metadata: h().nullable(),
 	createdAt: C().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), ic = [
-	Qs,
-	$s,
-	ec
-], ac = "_voltro_replace_in_progress", oc = T(ac, {
+}).index("byApiKeyTenant", ["tenantId"]), pc = T("_voltro_replica_observations", {
+	id: _({ prefix: "robs" }),
+	replicaId: t().maxLength(191),
+	startedAt: C(),
+	version: t().maxLength(64).nullable(),
+	kind: t().maxLength(64),
+	payload: t().nullable(),
+	reachableAt: t().maxLength(255).nullable(),
+	writtenAt: C().default("now").onUpdate("now")
+}).unique(["replicaId", "kind"]).index(["kind"]), mc = [
+	sc,
+	cc,
+	lc
+], hc = "_voltro_replace_in_progress", gc = T(hc, {
 	id: _({ prefix: "repl" }),
 	startedAt: C().default("now"),
 	kind: t().default("replace"),
@@ -2365,10 +2434,10 @@ $voltro_branch$`;
 	staging: t().nullable(),
 	heartbeatAt: C().nullable(),
 	resumable: r().nullable()
-}), sc = 30, cc = (e, t) => {
+}), _c = 30, vc = (e, t) => {
 	let n = typeof t == "number" && Number.isFinite(t) && t > 0 ? t : 30, r = Number(e.VOLTRO_STAGING_STALE_MINUTES);
 	return (Number.isFinite(r) && r > 0 ? r : n) * 6e4;
-}, lc = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), uc = (e) => {
+}, yc = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), bc = (e) => {
 	let t = e.filter((e) => e.kind !== "staging");
 	if (t.length !== 0) return `refusing to start: a destructive data operation did not finish.
 ${t.map((e) => {
@@ -2383,7 +2452,7 @@ ${t.map((e) => {
 
   When the data is back, or you have decided the current state is correct, clear the marker:
       voltro data clear-replace-marker --yes`;
-}, dc = (e, t, n) => {
+}, xc = (e, t, n) => {
 	let r = e.filter((e) => e.kind === "staging");
 	return {
 		all: r,
@@ -2393,7 +2462,7 @@ ${t.map((e) => {
 			return Number.isFinite(r) ? t - r >= n : !1;
 		})
 	};
-}, fc = (e, t) => {
+}, Sc = (e, t) => {
 	if (e.all.length === 0) return;
 	let n = new Set(e.droppable.map((e) => e.id));
 	return `staged data-import leftovers:
@@ -2402,22 +2471,22 @@ ${e.all.map((e) => {
 		return n.has(e.id) ? `  - ${a} — DROPPED: the run is not resumable and has been silent long enough that nothing is loading into them.` : e.resumable ? `  - ${a} — KEPT: the run was started \`--no-atomic\`, so these ARE its resume point. Re-run the same\n    bundle to continue from them, or drop them with: voltro data clear-staging --yes` : `  - ${a} — KEPT: still beating, so an import is loading into them right now.`;
 	}).join("\n")}\n  The target of a staged \`replace\` is untouched until one short swap at the end, so none of this is
   a reason to refuse the boot — it is a reason to know the disk is holding a copy of a bundle.`;
-}, pc = "id", mc = (e, t) => {
+}, $ = "id", Cc = (e, t) => {
 	let n = E(e);
 	if (n === void 0) return t;
-	let r = n.fields[pc]?.idScheme;
-	if (r === void 0 || t[pc] != null) return t;
+	let r = n.fields[$]?.idScheme;
+	if (r === void 0 || t[$] != null) return t;
 	if (r.kind === "numeric") {
-		if (!(pc in t)) return t;
+		if (!($ in t)) return t;
 		let e = { ...t };
-		return delete e[pc], e;
+		return delete e[$], e;
 	}
 	let i = gt(r, e);
 	return i === null ? t : {
 		...t,
-		[pc]: i
+		[$]: i
 	};
-}, hc = (e, t) => t.map((t) => mc(e, t)), gc = {
+}, wc = (e, t) => t.map((t) => Cc(e, t)), Tc = {
 	postgres: { maxBindParameters: 65535 },
 	mysql: { maxBindParameters: 65535 },
 	mariadb: { maxBindParameters: 65535 },
@@ -2427,25 +2496,25 @@ ${e.all.map((e) => {
 	},
 	sqlite: { maxBindParameters: 32766 },
 	turso: { maxBindParameters: 32766 }
-}, _c = (e) => gc[e], vc = (e) => {
+}, Ec = (e) => Tc[e], Dc = (e) => {
 	let t = /* @__PURE__ */ new Set();
 	for (let n of e) for (let e of Object.keys(n)) t.add(e);
 	return t.size;
-}, yc = (e, t) => {
+}, Oc = (e, t) => {
 	if (t === void 0 || e.length === 0) return [e];
-	let n = Math.max(1, vc(e)), r = Math.floor(t.maxBindParameters / n), i = t.maxRowsPerStatement ?? Infinity, a = Math.max(1, Math.min(r, i));
+	let n = Math.max(1, Dc(e)), r = Math.floor(t.maxBindParameters / n), i = t.maxRowsPerStatement ?? Infinity, a = Math.max(1, Math.min(r, i));
 	if (e.length <= a) return [e];
 	let o = [];
 	for (let t = 0; t < e.length; t += a) o.push(e.slice(t, t + a));
 	return o;
-}, bc = (e, t) => {
+}, kc = (e, t) => {
 	let n = [], r = t;
 	for (let [t, i] of Object.entries(e.fields)) {
 		let e = i;
 		e.nullable || e.hasDefault || e.idScheme !== void 0 || e.generatedAs !== void 0 || (r[t] === void 0 || r[t] === null) && n.push(t);
 	}
 	return n;
-}, xc = (e, t, n) => {
+}, Ac = (e, t, n) => {
 	let r = n, i = new Set(e === void 0 ? [] : Object.entries(e.fields).filter(([, e]) => e.generatedAs !== void 0).map(([e]) => e)), a = [];
 	for (let e of t) i.has(e) || (r[e] === void 0 ? a.push({
 		column: e,
@@ -2455,28 +2524,28 @@ ${e.all.map((e) => {
 		reason: "null"
 	}));
 	return a;
-}, Sc = (e, t, n) => e.insert(t.tableName, n), Cc = (e, t, n, r) => e.upsert(t.tableName, n, {
+}, jc = (e, t, n) => e.insert(t.tableName, n), Mc = (e, t, n, r) => e.upsert(t.tableName, n, {
 	conflictColumns: r.conflictColumns,
 	...r.update === void 0 ? {} : { update: r.update }
-}), wc = (e, t, n, r) => e.updateMany(t.tableName, n, { where: r.where }), Tc = 512, Ec = (e) => {
+}), Nc = (e, t, n, r) => e.updateMany(t.tableName, n, { where: r.where }), Pc = 512, Fc = (e) => {
 	e.setMaxListeners(512);
-}, Dc = (e, t, n) => ({
+}, Ic = (e, t, n) => ({
 	_tag: "PrimaryKeyConflictError",
 	table: e,
 	key: t,
 	cause: n
-}), Oc = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", kc = {
+}), Lc = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", Rc = {
 	postgres: 5432,
 	mysql: 3306,
 	mariadb: 3306,
 	mssql: 1433
-}, Ac = /* @__PURE__ */ new Set([
+}, zc = /* @__PURE__ */ new Set([
 	"localhost",
 	"127.0.0.1",
 	"::1",
 	"[::1]",
 	"0.0.0.0"
-]), jc = (e) => {
+]), Bc = (e) => {
 	let t = e.host, n = e.port, r = e.database;
 	if (e.url !== void 0 && e.url !== "") try {
 		let i = new URL(e.url);
@@ -2485,29 +2554,29 @@ ${e.all.map((e) => {
 		return;
 	}
 	if (t === void 0 || t === "" || r === void 0 || r === "") return;
-	let i = n ?? kc[(e.dialect ?? "").toLowerCase()];
+	let i = n ?? Rc[(e.dialect ?? "").toLowerCase()];
 	if (i === void 0 || !Number.isFinite(i)) return;
 	let a = t.toLowerCase();
 	return {
-		host: Ac.has(a) ? "localhost" : a,
+		host: zc.has(a) ? "localhost" : a,
 		port: i,
 		database: r.toLowerCase()
 	};
-}, Mc = (e) => {
-	let t = jc(e);
-	if (t !== void 0) return Rt("sha256").update(`${t.host}\u0000${t.port}\u0000${t.database}`).digest("hex").slice(0, 32);
-}, Nc = (e, t) => e === void 0 || t === void 0 ? "unknown" : e === t ? "same" : "different", Pc = {
+}, Vc = (e) => {
+	let t = Bc(e);
+	if (t !== void 0) return Lt("sha256").update(`${t.host}\u0000${t.port}\u0000${t.database}`).digest("hex").slice(0, 32);
+}, Hc = (e, t) => e === void 0 || t === void 0 ? "unknown" : e === t ? "same" : "different", Uc = {
 	app: 3,
 	plugin: 2,
 	framework: 1
-}, Fc = /* @__PURE__ */ new Map(), Ic = [], Lc = () => [...Ic], Rc = (e) => {
+}, Wc = /* @__PURE__ */ new Map(), Gc = [], Kc = () => [...Gc], qc = (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`);
-	let t = e.source ?? "app", n = Fc.get(e.table);
+	let t = e.source ?? "app", n = Wc.get(e.table);
 	if (n !== void 0) {
 		let r = n.source ?? "app", i = n.ttlMs !== e.ttlMs || n.where !== void 0 != (e.where !== void 0);
-		if (Pc[t] < Pc[r]) {
-			i && Ic.push({
+		if (Uc[t] < Uc[r]) {
+			i && Gc.push({
 				table: e.table,
 				kept: {
 					source: r,
@@ -2520,7 +2589,7 @@ ${e.all.map((e) => {
 			});
 			return;
 		}
-		i && r !== t && Ic.push({
+		i && r !== t && Gc.push({
 			table: e.table,
 			kept: {
 				source: t,
@@ -2532,36 +2601,36 @@ ${e.all.map((e) => {
 			}
 		});
 	}
-	Fc.set(e.table, {
+	Wc.set(e.table, {
 		...e,
 		source: t
 	});
-}, zc = () => [...Fc.values()], Bc = () => {
-	Fc.clear(), Ic.length = 0;
-}, Vc = async (e, t, n, r = 2e4) => {
+}, Jc = () => [...Wc.values()], Yc = () => {
+	Wc.clear(), Gc.length = 0;
+}, Xc = 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;
-}, Hc = (e, t) => {
+}, Zc = (e, t) => {
 	let n = Number(e ?? String(t));
 	return (Number.isFinite(n) && n > 0 ? n : t) * 36e5;
-}, Uc = "_voltro_cdc_offsets", Wc = T(Uc, {
+}, Qc = "_voltro_cdc_offsets", $c = T(Qc, {
 	id: _({ prefix: "cdcoff" }),
 	replicaId: t(),
 	streamName: t(),
 	binlogFile: t(),
 	binlogPosition: t(),
 	updatedAt: C()
-}).index(["replicaId"]), Gc = T(Uc, {
+}).index(["replicaId"]), el = T(Qc, {
 	id: _({ prefix: "cdcoff" }),
 	replicaId: t(),
 	streamName: t(),
 	ctVersion: t(),
 	updatedAt: C()
-}).index(["replicaId"]), Kc = "_voltro_data_transfers", qc = T(Kc, {
+}).index(["replicaId"]), tl = "_voltro_data_transfers", nl = T(tl, {
 	id: _({ prefix: "dimp" }),
 	startedAt: C().default("now"),
 	finishedAt: C().nullable(),
@@ -2574,9 +2643,9 @@ ${e.all.map((e) => {
 	rowsWritten: S().default(0),
 	failure: t().nullable(),
 	staged: r().nullable()
-}).renamedFrom("_voltro_data_imports").nonReactive(), Jc = (e) => {
+}).renamedFrom("_voltro_data_imports").nonReactive(), rl = (e) => {
 	let t = Number.isFinite(e.startedAt.getTime()) ? e.startedAt.toISOString() : "an unknown time", n = e.direction === "import" ? e.mode : `${e.direction} ${e.mode}`, r = e.failure === null ? e.finishedAt === null ? `${n} — started and never reported finishing` : e.direction === "backup" || e.direction === "restore" ? `${n} — finished${e.rowsWritten > 0 ? ` (${e.rowsWritten} blob(s))` : ""}` : `${n} — ${e.rowsWritten} row(s) across ${e.tablesWritten} table(s)` : `FAILED ${n} — ${e.failure}`, i = e.staged === null ? "" : e.staged ? " · staged (target untouched until the swap)" : " · NOT staged (target emptied first)";
 	return `${t} · ${r} · via ${e.via}${i}` + (e.bundle === null ? "" : ` · from ${e.bundle}`) + (e.sourceFingerprint === null ? "" : ` · source schema ${e.sourceFingerprint}`);
-}, Yc = "postgres";
+}, il = "postgres";
 //#endregion
-export { nt as AUTO_FILLED_COLUMNS, gc as BULK_INSERT_LIMITS, Y as BranchNameInvalid, us as BranchTransitionInvalid, Uc as CDC_OFFSETS_TABLE, Tc as CHANGE_LISTENER_CEILING, l as ColumnBuilder, Kc as DATA_TRANSFERS_TABLE, fe as DEFAULT_ACQUIRE_TIMEOUT_MS, Mo as DEFAULT_EAGER_FALLBACK_WARN_INTERVAL_MS, Gn as DEFAULT_SUBJECT_GRAPH_DEPTH, qt as ENCRYPTED_PREFIX, Yc as ENGINE, cr as EagerCardinalityError, rt as FILE_MIGRATION_PATTERN, ft as FRAMEWORK_LIVE_TABLES, Jt as FieldDecryptionError, $a as ID_COLUMN_MAX_LENGTH, Go as INITIAL_VERSION, la as MATCHES_NO_ROWS, et as MAX_IDENTIFIER_LENGTH, ac as REPLACE_IN_PROGRESS_TABLE, sc as STAGING_STALE_MINUTES, tt as STAGING_TABLE_PREFIX, Bt as SqlClient, Qo as TableStreamError, Sr as TenantNamespaceInvalid, xr as TenantNamespaceUnresolved, ks as TenantRegionUnavailable, Os as TenantResidencyUnresolved, Ko as VOLTRO_EXPIRES_MIXIN_ID, Jo as VOLTRO_LOCAL_FIRST_MIXIN_ID, Vo as VersionConflict, Ke as WARN_IDENTIFIER_LENGTH, rc as _voltroApiKeysTable, Wc as _voltroCdcOffsetsTable, qc as _voltroDataTransfersTable, tc as _voltroIdempotencyTable, nc as _voltroKvTable, ec as _voltroMigrationPlansTable, Qs as _voltroMigrationsTable, Gc as _voltroMssqlCdcOffsetsTable, oc as _voltroReplaceInProgressTable, $s as _voltroSeedsTable, Yi as actorsTable, Cs as admitBranch, St as allEnumRenames, Hn as allRegisteredRelations, Ce as allRegisteredTables, pa as and, le as array, oa as arrayContains, ca as arrayHas, sa as arrayOverlaps, ur as attachEagerLoads, Fa as attributionFields, za as attributionKey, Us as auditAllTableIndexes, Hs as auditTableIndexes, Fe as avg, xt as avgOver, Ja as beginLocalWrite, Xe as bigint, Ls as bindResidentStore, r as boolean, ss as branchNamespaceName, _c as bulkInsertLimitsFor, Je as bytes, Aa as changeDelete, Oa as changeInsert, ja as changeSoftDelete, ka as changeUpdate, yc as chunkRowsForInsert, Ha as claimPendingAttribution, pn as classifyConstraintViolation, _e as clearEnumRenames, Za as clearPendingAttribution, Wn as clearRelationsRegistry, Ns as clearResidencyConfig, Bc as clearRetentions, m as clearTableRegistry, oo as clearWriteRecorders, W as coercePredicateForSqlite, Ar as coercePredicateValue, jr as coercePredicateValues, Vi as coerceValueForSqlite, Ta as collectSubqueries, ge as column, yn as columnSchema, vc as columnsPerRow, Gr as compileEagerJson, I as compilePredicate, Mr as compileRawFragment, Wr as compileSelect, rs as computeEmbedding, Mc as connectionIdentity, ia as contains, o as count, yt as countDistinct, oe as crdtDoc, se as crdtManagedColumns, de as crdtManagedColumnsOf, p as crdtText, Pa as currentWriteAttribution, ve as databaseHandle, te as date, ie as dbEnum, Eo as dbMetricTagCacheSizeForTests, ko as dbOperationsInFlight, he as decimal, s as declareEnumRename, $t as decodeFieldValue, ar as decodeRowsFromSchema, an as decryptFieldsOnRead, Xs as defineMigration, it as defineMixin, Ze as defineSeed, u as denseRank, Qn as deriveSubjectGraph, Qe as deriveTypeIdPrefix, no as derivedRowId, ro as derivedRowIdLength, gn as describeDriverError, _n as describeRowBindings, Jc as describeTransferRun, Kt as deserializeArraysOnRead, Ge as drainIdentifierWarnings, Et as dropped, Zt as encodeFieldValue, sr as encodeRowForSchema, rn as encryptFieldsForWrite, nn as encryptedColumnsOf, Ya as endLocalWrite, bs as enforceBranchLimits, y as ensureTableRegistered, Xi as eq, Nr as escapeLike, wa as evaluatePredicate, c as except, ba as exists, qo as expires, Da as externalChangeEvent, un as extractDbCause, ht as fireSchemaChangeSeeds, ze as fireTenantCreateSeeds, Js as formatIndexAuditIssue, $n as formatSubjectGraph, ic as frameworkTables, gt as generateId, Ue as generateSnowflake, a as geography, Se as geometry, bt as getEnumRenames, Vn as getRelation, Bn as getRelations, Ms as getResidencyConfig, E as getTable, Qi as gt, $i as gte, br as hasEagerLoads, ns as hybridSearch, _ as id, na as inSet, va as inSubquery, P as inferForeignKey, Sc as insertRow, S as integer, uc as interruptedReplaceRefusal, ce as intersect, we as interval, cs as isBranchNamespace, Dn as isEmptyRelationsSpec, Xt as isEncrypted, Yt as isFieldDecryptionError, ut as isFileMigration, mn as isForeignKeyViolation, ct as isFrameworkOwnedLiveTable, Xo as isLocalFirst, Zs as isMigrationDefinition, e as isMysqlFamily, ms as isNeonConnection, da as isNotNull, ua as isNull, Oc as isPrimaryKeyConflictError, hn as isQueryTimeout, en as isRawEncoding, Fs as isRegionServable, On as isRelationsSpec, He as isSeedDefinition, Ve as isSqliteFamily, Ne as isStagingTableName, ne as isTableReactive, We as isView, h as json, ga as jsonField, lt as jsonIndex, Ye as lag, n as lead, Lc as listRetentionConflicts, zc as listRetentions, Yo as localFirst, Zo as localFirstTables, ea as lt, ta as lte, Fo as makeEagerFallbackReporter, Ds as makeNamespaceBranchExecutor, An as many, jn as manyToMany, re as materializeFields, qe as max, Le as migration, ae as min, xc as missingConflictColumns, bc as missingRequiredColumns, dt as mixin, Zi as neq, ds as nextBranchState, jc as normaliseTarget, ha as not, xa as notExists, ra as notInSet, ya as notInSubquery, st as numeric, jo as observeDbOp, kn as one, lr as oneCardinalityMessage, ma as or, x as orderClausesOf, ue as paginateBy, f as paginateById, Qa as pendingAttributionCount, vs as planBranch, fs as planBranchProvision, ps as planBranchTeardown, ys as planBranchTeardownFor, gs as planNeonBranchProvision, _s as planNeonBranchTeardown, Uo as planVersionedUpdate, ye as pluginRef, d as pluginRefSpecOf, Dc as primaryKeyConflictError, xs as provisionBranch, Rs as provisionResidentTenant, Dr as qualifyTable, ee as queryFor, je as queryForView, mt as quoteIdent, Ec as raiseChangeListenerCeiling, b as rank, v as raw, Oe as readableByColumns, Ee as real, Ao as recordDbOp, fo as recordsTable, Ae as reference, Gi as registerCoreTables, zn as registerDiscoveredRelations, Va as registerPendingAttribution, Rn as registerRelations, Rc as registerRetention, De as registerTable, io as registerWriteRecorder, En as relations, qi as requireActors, Te as requireTable, Ji as requireTenants, To as resetDbMetricTagCacheForTests, ot as resetSnowflake, Is as residentPlacement, Ht as resolveActorSnapshot, hs as resolveBranchMechanism, Po as resolveEagerFallbackWarnIntervalMs, Xa as resolveEchoAttribution, me as resolveFullTextIndex, Be as resolveIdScheme, Re as resolveMixinGraph, Ps as resolveTenantHome, Er as resolveTenantNamespace, Hc as retentionTtlMsFromEnv, Tt as rowNumber, bn as rowSchema, zo as runRetryingTransaction, Bo as runStoreTransaction, Na as runWithWriteAttribution, po as runWriteRecorders, Nc as sameDatabase, Tr as sanitizeIdentifierFragment, Gt as serializeArraysForWrite, pe as serverOnlyColumns, js as setResidencyConfig, at as setSchemaChangeSeedHook, $e as setTenantCreateSeedHook, Io as settleTransactionExit, Wo as settleVersionedUpdate, fa as spatialPredicate, fc as stagingLeftoverReport, dc as stagingLeftovers, lc as stagingNamesOf, cc as stagingStaleAfterMs, mc as stampGeneratedId, hc as stampGeneratedIds, aa as startsWith, ts as streamTable, i as sum, xe as sumOver, co as suspendWriteRecorders, lo as suspendWriteRecordersEffect, Vc as sweepRetention, T as table, Ss as teardownBranch, t as text, C as timestamp, Dt as timestampMs, Ot as timestampMsOrNull, g as union, be as unionAll, ke as unregisterTable, ao as unregisterWriteRecorder, wc as updateManyRow, Cc as upsertRow, Me as validateColumnName, vt as validateIndexName, Un as validateRegisteredRelations, Fn as validateRelationConfig, wt as validateTableName, Ie as validateTypeIdPrefix, pt as vector, Pe as vectorDistanceToOpclass, is as vectorEmbedding, Ho as versionColumnOf, _t as view, Ct as viewSql, Ea as walkLeaves, Ia as withCapturedAttribution, uo as writeRecordersSuspended };
+export { nt as AUTO_FILLED_COLUMNS, Tc as BULK_INSERT_LIMITS, J as BranchNameInvalid, ys as BranchTransitionInvalid, Qc as CDC_OFFSETS_TABLE, Ra as CHANGE_CLAIM_TTL_ENV, Pc as CHANGE_LISTENER_CEILING, l as ColumnBuilder, tl as DATA_TRANSFERS_TABLE, fe as DEFAULT_ACQUIRE_TIMEOUT_MS, za as DEFAULT_CHANGE_CLAIM_TTL_HOURS, Vo as DEFAULT_EAGER_FALLBACK_WARN_INTERVAL_MS, Gn as DEFAULT_SUBJECT_GRAPH_DEPTH, qt as ENCRYPTED_PREFIX, il as ENGINE, cr as EagerCardinalityError, rt as FILE_MIGRATION_PATTERN, ft as FRAMEWORK_LIVE_TABLES, Jt as FieldDecryptionError, co as ID_COLUMN_MAX_LENGTH, es as INITIAL_VERSION, ua as MATCHES_NO_ROWS, et as MAX_IDENTIFIER_LENGTH, La as OccurrenceCounter, hc as REPLACE_IN_PROGRESS_TABLE, _c as STAGING_STALE_MINUTES, tt as STAGING_TABLE_PREFIX, Bt as SqlClient, ss as TableStreamError, Sr as TenantNamespaceInvalid, xr as TenantNamespaceUnresolved, Rs as TenantRegionUnavailable, Ls as TenantResidencyUnresolved, ts as VOLTRO_EXPIRES_MIXIN_ID, rs as VOLTRO_LOCAL_FIRST_MIXIN_ID, Xo as VersionConflict, Ke as WARN_IDENTIFIER_LENGTH, fc as _voltroApiKeysTable, $c as _voltroCdcOffsetsTable, nl as _voltroDataTransfersTable, uc as _voltroIdempotencyTable, dc as _voltroKvTable, lc as _voltroMigrationPlansTable, sc as _voltroMigrationsTable, el as _voltroMssqlCdcOffsetsTable, gc as _voltroReplaceInProgressTable, pc as _voltroReplicaObservationsTable, cc as _voltroSeedsTable, Xi as actorsTable, Ms as admitBranch, St as allEnumRenames, Hn as allRegisteredRelations, Ce as allRegisteredTables, ma as and, le as array, sa as arrayContains, la as arrayHas, ca as arrayOverlaps, ur as attachEagerLoads, Wa as attributionFields, Ja as attributionKey, Qs as auditAllTableIndexes, Zs as auditTableIndexes, Fe as avg, xt as avgOver, ro as beginLocalWrite, Xe as bigint, Ks as bindResidentStore, r as boolean, gs as branchNamespaceName, Ec as bulkInsertLimitsFor, Je as bytes, ja as changeDelete, Pa as changeDigest, ka as changeInsert, Ma as changeSoftDelete, Aa as changeUpdate, Oc as chunkRowsForInsert, Za as claimPendingAttribution, pn as classifyConstraintViolation, _e as clearEnumRenames, oo as clearPendingAttribution, Wn as clearRelationsRegistry, Hs as clearResidencyConfig, Yc as clearRetentions, m as clearTableRegistry, go as clearWriteRecorders, U as coercePredicateForSqlite, Ar as coercePredicateValue, jr as coercePredicateValues, Hi as coerceValueForSqlite, Ea as collectSubqueries, ge as column, yn as columnSchema, Dc as columnsPerRow, Gr as compileEagerJson, I as compilePredicate, Mr as compileRawFragment, Wr as compileSelect, Fa as composeChangeKey, fs as computeEmbedding, Vc as connectionIdentity, aa as contains, o as count, yt as countDistinct, oe as crdtDoc, se as crdtManagedColumns, de as crdtManagedColumnsOf, p as crdtText, Ua as currentWriteAttribution, ve as databaseHandle, te as date, ie as dbEnum, Fo as dbMetricTagCacheSizeForTests, Ro as dbOperationsInFlight, he as decimal, s as declareEnumRename, $t as decodeFieldValue, ar as decodeRowsFromSchema, an as decryptFieldsOnRead, ac as defineMigration, it as defineMixin, Ze as defineSeed, u as denseRank, Qn as deriveSubjectGraph, Qe as deriveTypeIdPrefix, fo as derivedRowId, po as derivedRowIdLength, gn as describeDriverError, _n as describeRowBindings, rl as describeTransferRun, Kt as deserializeArraysOnRead, Ge as drainIdentifierWarnings, Et as dropped, Zt as encodeFieldValue, sr as encodeRowForSchema, rn as encryptFieldsForWrite, nn as encryptedColumnsOf, io as endLocalWrite, ks as enforceBranchLimits, y as ensureTableRegistered, Zi as eq, Nr as escapeLike, Ta as evaluatePredicate, c as except, xa as exists, ns as expires, Oa as externalChangeEvent, un as extractDbCause, ht as fireSchemaChangeSeeds, ze as fireTenantCreateSeeds, rc as formatIndexAuditIssue, $n as formatSubjectGraph, mc as frameworkTables, gt as generateId, Ue as generateSnowflake, a as geography, Se as geometry, bt as getEnumRenames, Vn as getRelation, Bn as getRelations, Vs as getResidencyConfig, E as getTable, $i as gt, ea as gte, br as hasEagerLoads, ds as hybridSearch, _ as id, ra as inSet, ya as inSubquery, P as inferForeignKey, jc as insertRow, S as integer, bc as interruptedReplaceRefusal, ce as intersect, we as interval, _s as isBranchNamespace, Dn as isEmptyRelationsSpec, Xt as isEncrypted, Yt as isFieldDecryptionError, ut as isFileMigration, mn as isForeignKeyViolation, ct as isFrameworkOwnedLiveTable, as as isLocalFirst, oc as isMigrationDefinition, e as isMysqlFamily, Cs as isNeonConnection, fa as isNotNull, da as isNull, Lc as isPrimaryKeyConflictError, hn as isQueryTimeout, en as isRawEncoding, Ws as isRegionServable, On as isRelationsSpec, He as isSeedDefinition, Ve as isSqliteFamily, Ne as isStagingTableName, ne as isTableReactive, We as isView, h as json, _a as jsonField, lt as jsonIndex, Ye as lag, n as lead, Kc as listRetentionConflicts, Jc as listRetentions, is as localFirst, os as localFirstTables, ta as lt, na as lte, Wo as makeEagerFallbackReporter, Is as makeNamespaceBranchExecutor, An as many, jn as manyToMany, re as materializeFields, qe as max, Le as migration, ae as min, Ac as missingConflictColumns, kc as missingRequiredColumns, dt as mixin, Qi as neq, bs as nextBranchState, Bc as normaliseTarget, ga as not, Sa as notExists, ia as notInSet, ba as notInSubquery, st as numeric, Bo as observeDbOp, Ba as occurrenceWindowMs, kn as one, lr as oneCardinalityMessage, ha as or, x as orderClausesOf, ue as paginateBy, f as paginateById, Ia as parseChangeKey, so as pendingAttributionCount, Ds as planBranch, xs as planBranchProvision, Ss as planBranchTeardown, Os as planBranchTeardownFor, Ts as planNeonBranchProvision, Es as planNeonBranchTeardown, Qo as planVersionedUpdate, ye as pluginRef, d as pluginRefSpecOf, Ic as primaryKeyConflictError, As as provisionBranch, qs as provisionResidentTenant, Dr as qualifyTable, ee as queryFor, je as queryForView, mt as quoteIdent, Fc as raiseChangeListenerCeiling, b as rank, v as raw, Oe as readableByColumns, Ee as real, zo as recordDbOp, xo as recordsTable, Ae as reference, Ki as registerCoreTables, zn as registerDiscoveredRelations, Xa as registerPendingAttribution, Rn as registerRelations, qc as registerRetention, De as registerTable, mo as registerWriteRecorder, En as relations, Ji as requireActors, Te as requireTable, Yi as requireTenants, Po as resetDbMetricTagCacheForTests, ot as resetSnowflake, Gs as residentPlacement, Ht as resolveActorSnapshot, ws as resolveBranchMechanism, Uo as resolveEagerFallbackWarnIntervalMs, ao as resolveEchoAttribution, me as resolveFullTextIndex, Be as resolveIdScheme, Re as resolveMixinGraph, Us as resolveTenantHome, Er as resolveTenantNamespace, Zc as retentionTtlMsFromEnv, Tt as rowNumber, bn as rowSchema, Jo as runRetryingTransaction, Yo as runStoreTransaction, Ha as runWithWriteAttribution, So as runWriteRecorders, Hc as sameDatabase, Tr as sanitizeIdentifierFragment, Gt as serializeArraysForWrite, pe as serverOnlyColumns, Bs as setResidencyConfig, at as setSchemaChangeSeedHook, $e as setTenantCreateSeedHook, Go as settleTransactionExit, $o as settleVersionedUpdate, pa as spatialPredicate, Sc as stagingLeftoverReport, xc as stagingLeftovers, yc as stagingNamesOf, vc as stagingStaleAfterMs, Cc as stampGeneratedId, wc as stampGeneratedIds, oa as startsWith, us as streamTable, i as sum, xe as sumOver, vo as suspendWriteRecorders, yo as suspendWriteRecordersEffect, Xc as sweepRetention, T as table, js as teardownBranch, t as text, C as timestamp, Dt as timestampMs, Ot as timestampMsOrNull, g as union, be as unionAll, ke as unregisterTable, ho as unregisterWriteRecorder, Nc as updateManyRow, Mc as upsertRow, Me as validateColumnName, vt as validateIndexName, Un as validateRegisteredRelations, Fn as validateRelationConfig, wt as validateTableName, Ie as validateTypeIdPrefix, pt as vector, Pe as vectorDistanceToOpclass, ps as vectorEmbedding, Zo as versionColumnOf, _t as view, Ct as viewSql, Da as walkLeaves, Ga as withCapturedAttribution, bo as writeRecordersSuspended };