@voltro/database 0.69.1 → 0.71.0

package/dist/sql.js

@@ -1,13 +1,48 @@
-import { C as e, Jt as t, Ot as n, St as r, a as i, an as a, at as o, b as s, c, ct as l, d as u, f as d, h as f, i as p, it as m, lt as h, m as g, o as _, on as v, qt as y, rt as b, s as x, u as S, y as C } from "./frameworkLiveTables-CWbTSnjk.js";
-import { Effect as w, Exit as T, Schedule as ee, Scope as te } from "effect";
-import { createHash as ne } from "node:crypto";
-import { createLogger as re } from "@voltro/logger";
+import { C as e, Jt as t, Ot as n, St as r, a as i, an as a, at as o, b as s, c, ct as l, d as u, f as d, h as f, i as p, it as m, lt as h, m as g, o as _, on as v, qt as y, rt as b, s as x, u as S, y as C } from "./frameworkLiveTables-D53uncZH.js";
+import { Cause as w, Effect as T, Equal as ee, Exit as te, Schedule as ne, Scope as re } from "effect";
+import { createHash as ie } from "node:crypto";
+import { createLogger as ae } from "@voltro/logger";
 import { SqlClient as E } from "@effect/sql";
-import { promises as ie } from "node:fs";
-import { join as ae } from "node:path";
-import { pathToFileURL as oe } from "node:url";
-//#region src/migrations/ddlError.ts
-var se = (e, t, n, r = 400) => {
+import { promises as oe } from "node:fs";
+import { join as se } from "node:path";
+import { pathToFileURL as ce } from "node:url";
+//#region src/indexStorage.ts
+var le = (e, t = "float32") => {
+	let n = e?.hnsw, r = n?.m ?? 16, i = n?.efConstruction ?? 64;
+	for (let [e, t] of Object.entries({
+		m: r,
+		efConstruction: i
+	})) if (!Number.isSafeInteger(t) || t <= 0) throw Error(`HNSW ${e} must be a positive safe integer`);
+	let a = n?.opclass ?? h(n?.distance, t);
+	if (!/^[a-z_][a-z0-9_$]*(?:\.[a-z_][a-z0-9_$]*)?$/i.test(a)) throw Error("HNSW opclass must be an unquoted, optionally schema-qualified identifier");
+	return {
+		m: r,
+		efConstruction: i,
+		opclass: a.toLowerCase().replace(/^public\./, "")
+	};
+}, ue = (e, t) => t === void 0 || t === "postgres" ? e ?? "btree" : e === "hnsw" || e === "gin" && (t === "mysql" || t === "mariadb") ? null : "btree", D = (e, t) => ({
+	...e !== void 0 && e !== "btree" ? { kind: e } : {},
+	...e === "hnsw" ? { kindOptions: { hnsw: le(t) } } : {}
+}), de = (e, t, n = "float32") => {
+	if (e === void 0 || e === "btree") return {
+		using: "",
+		withSuffix: "",
+		skip: !1
+	};
+	if (!/^[a-z_][a-z0-9_]*$/i.test(e)) throw Error("Index kind must be an SQL access-method identifier");
+	if (e !== "hnsw") return {
+		using: ` USING ${e.toUpperCase()}`,
+		withSuffix: "",
+		skip: !1
+	};
+	let r = le(t, n);
+	return {
+		using: " USING hnsw",
+		withSuffix: ` WITH (m = ${r.m}, ef_construction = ${r.efConstruction})`,
+		opclass: r.opclass,
+		skip: !1
+	};
+}, fe = (e, t, n, r = 400) => {
 	let i = n, a = i.cause ?? {}, o = (e) => {
 		let t = a[e];
 		return t == null || t === "" ? void 0 : String(t);
@@ -38,21 +73,21 @@ var se = (e, t, n, r = 400) => {
 		let t = o(e);
 		t !== void 0 && s.push(`db.${e}: ${t}`);
 	}
-	let c = ce(o("code"));
+	let c = pe(o("code"));
 	return c !== void 0 && s.push("", c), s.push(""), s.join("\n");
-}, ce = (e) => e === "3F000" ? "remedy: the connection's search_path names a schema that does not exist. Voltro sets it from DB_SCHEMA — create the schema (`CREATE SCHEMA \"<name>\"`) or unset DB_SCHEMA to use the connection default. Voltro creates TABLES, never the schema itself: that is a namespace decision, and inventing one from a typo is how a migration lands somewhere nobody is looking." : void 0, le = (e) => e.unique === !0 && typeof e.where == "string" && e.where.length > 0, ue = (e) => e.replace(/"/g, "`"), de = (e) => typeof e == "string" ? e : e.name ?? String(e), fe = (e, t) => `_ua_${t}_${e}`.slice(0, 64), pe = (e, t) => {
-	if (t !== "mysql" && t !== "mariadb" || !e.appliedIndexes.some(le)) return e;
+}, pe = (e) => e === "3F000" ? "remedy: the connection's search_path names a schema that does not exist. Voltro sets it from DB_SCHEMA — create the schema (`CREATE SCHEMA \"<name>\"`) or unset DB_SCHEMA to use the connection default. Voltro creates TABLES, never the schema itself: that is a namespace decision, and inventing one from a typo is how a migration lands somewhere nobody is looking." : void 0, me = (e) => e.unique === !0 && typeof e.where == "string" && e.where.length > 0, he = (e) => e.replace(/"/g, "`"), ge = (e) => typeof e == "string" ? e : e.name ?? String(e), _e = (e, t) => `_ua_${t}_${e}`.slice(0, 64), ve = (e, t) => {
+	if (t !== "mysql" && t !== "mariadb" || !e.appliedIndexes.some(me)) return e;
 	let n = { ...e.fields }, r = [], i = [];
 	for (let t of e.appliedIndexes) {
-		if (!le(t)) {
+		if (!me(t)) {
 			r.push(t);
 			continue;
 		}
-		let a = ue(t.where), o = [];
+		let a = he(t.where), o = [];
 		for (let r of t.fields) {
-			let i = de(r);
+			let i = ge(r);
 			if (!(i in e.fields)) throw Error(`@voltro/migrate: uniqueActive '${t.name}' on '${e.tableName}' references unknown column '${i}'.`);
-			let s = fe(t.name, i);
+			let s = _e(t.name, i);
 			o.push(s), n[s] = {
 				type: "text",
 				nullable: !0,
@@ -75,82 +110,82 @@ var se = (e, t, n, r = 400) => {
 		appliedIndexes: r,
 		appliedUniques: [...e.appliedUniques ?? [], ...i]
 	};
-}, D = (e, t) => `${e}::${t}`, me = (e, t) => {
+}, O = (e, t) => `${e}::${t}`, ye = (e, t) => {
 	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = (e) => {
 		n.add(e);
 		let o = [...t(e)].filter((t) => t.target !== e).sort((e, t) => e.column.localeCompare(t.column));
-		for (let t of o) n.has(t.target) ? i.add(D(e, t.column)) : r.has(t.target) || a(t.target);
+		for (let t of o) n.has(t.target) ? i.add(O(e, t.column)) : r.has(t.target) || a(t.target);
 		n.delete(e), r.add(e);
 	};
 	for (let t of [...e].sort()) r.has(t) || a(t);
 	return i;
-}, O = (e, t) => e.executeUnprepared(t, [], void 0), he = 6322741009312437n, ge = (e) => {
+}, k = (e, t) => e.executeUnprepared(t, [], void 0), be = 6322741009312437n, xe = (e) => {
 	let t = e?.trim();
 	return t === void 0 || t === "" || t === "public" ? void 0 : t;
-}, _e = (e) => e?.schema === void 0 ? ge(process.env.DB_SCHEMA) : ge(e.schema), ve = 14695981039346656037n, ye = 1099511628211n, be = 18446744073709551615n, xe = (e) => {
-	let t = ve;
-	for (let n of new TextEncoder().encode(e)) t ^= BigInt(n), t = t * ye & be;
+}, Se = (e) => e?.schema === void 0 ? xe(process.env.DB_SCHEMA) : xe(e.schema), Ce = 14695981039346656037n, we = 1099511628211n, Te = 18446744073709551615n, Ee = (e) => {
+	let t = Ce;
+	for (let n of new TextEncoder().encode(e)) t ^= BigInt(n), t = t * we & Te;
 	return t;
-}, Se = (e) => {
-	let t = ge(e);
-	return t === void 0 ? he : xe(`voltro_migration_lock:${t}`) & 9223372036854775807n;
-}, Ce = (e) => {
-	let t = `voltro_migration_${he.toString(36)}`, n = ge(e);
+}, De = (e) => {
+	let t = xe(e);
+	return t === void 0 ? be : Ee(`voltro_migration_lock:${t}`) & 9223372036854775807n;
+}, Oe = (e) => {
+	let t = `voltro_migration_${be.toString(36)}`, n = xe(e);
 	if (n === void 0) return t;
 	let r = `${t}_${n}`;
-	return /^[A-Za-z0-9_]+$/.test(n) && r.length <= 64 ? r : `${t}_h${(xe(`voltro_migration_lock:${n}`) & be).toString(16)}`;
-}, we = 250, Te = () => {
+	return /^[A-Za-z0-9_]+$/.test(n) && r.length <= 64 ? r : `${t}_h${(Ee(`voltro_migration_lock:${n}`) & Te).toString(16)}`;
+}, ke = 250, Ae = () => {
 	let e = Number(process.env.VOLTRO_MIGRATION_LOCK_TIMEOUT_MS);
 	return Number.isFinite(e) && e > 0 ? e : 3e4;
-}, Ee = (e, t) => w.gen(function* () {
-	let n = Te(), r = Date.now();
+}, je = (e, t) => T.gen(function* () {
+	let n = Ae(), r = Date.now();
 	for (;;) {
-		if ((yield* O(e, `SELECT pg_try_advisory_lock(${t.toString()}::bigint) AS got`))[0]?.got) return;
-		Date.now() - r >= n && (yield* w.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(n / 1e3)}s. Another migration is in progress, or a prior boot crashed while holding it. (A crashed process's session-level advisory lock is released once its DB connection closes; if this persists, find + terminate the holder via pg_stat_activity, or raise VOLTRO_MIGRATION_LOCK_TIMEOUT_MS.)`))), yield* w.sleep(`${we} millis`);
+		if ((yield* k(e, `SELECT pg_try_advisory_lock(${t.toString()}::bigint) AS got`))[0]?.got) return;
+		Date.now() - r >= n && (yield* T.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(n / 1e3)}s. Another migration is in progress, or a prior boot crashed while holding it. (A crashed process's session-level advisory lock is released once its DB connection closes; if this persists, find + terminate the holder via pg_stat_activity, or raise VOLTRO_MIGRATION_LOCK_TIMEOUT_MS.)`))), yield* T.sleep(`${ke} millis`);
 	}
-}), De = (e, t) => w.asVoid(O(e, `SELECT pg_advisory_unlock(${t.toString()}::bigint)`)), Oe = 30, ke = (e, t) => w.gen(function* () {
-	(yield* O(e, `SELECT GET_LOCK('${t}', ${String(Oe)}) AS got`))[0]?.got !== 1 && (yield* w.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' within ${Oe}s (another migration is in progress, or a prior one left it held).`)));
-}), Ae = (e, t) => w.asVoid(O(e, `SELECT RELEASE_LOCK('${t}')`)), je = 3e4, Me = (e, t) => w.gen(function* () {
-	let n = yield* O(e, `
+}), Me = (e, t) => T.asVoid(k(e, `SELECT pg_advisory_unlock(${t.toString()}::bigint)`)), Ne = 30, Pe = (e, t) => T.gen(function* () {
+	(yield* k(e, `SELECT GET_LOCK('${t}', ${String(Ne)}) AS got`))[0]?.got !== 1 && (yield* T.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' within ${Ne}s (another migration is in progress, or a prior one left it held).`)));
+}), Fe = (e, t) => T.asVoid(k(e, `SELECT RELEASE_LOCK('${t}')`)), Ie = 3e4, Le = (e, t) => T.gen(function* () {
+	let n = yield* k(e, `
       DECLARE @res int;
       EXEC @res = sp_getapplock @Resource = '${t}', @LockMode = 'Exclusive',
-        @LockOwner = 'Session', @LockTimeout = ${String(je)};
+        @LockOwner = 'Session', @LockTimeout = ${String(Ie)};
       SELECT @res AS res`);
-	(n[0]?.res ?? -999) < 0 && (yield* w.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' (sp_getapplock returned ${n[0]?.res ?? "no row"}; another migration is in progress).`)));
-}), Ne = (e, t) => w.asVoid(O(e, `EXEC sp_releaseapplock @Resource = '${t}', @LockOwner = 'Session'`)), Pe = w.void, Fe = (e, t) => w.gen(function* () {
-	let n = _e(t), r = Ce(n), i = Se(n);
+	(n[0]?.res ?? -999) < 0 && (yield* T.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' (sp_getapplock returned ${n[0]?.res ?? "no row"}; another migration is in progress).`)));
+}), Re = (e, t) => T.asVoid(k(e, `EXEC sp_releaseapplock @Resource = '${t}', @LockOwner = 'Session'`)), ze = T.void, Be = (e, t) => T.gen(function* () {
+	let n = Se(t), r = Oe(n), i = De(n);
 	if (!e.onDialectOrElse({
 		mysql: () => !0,
 		mssql: () => !0,
 		sqlite: () => !1,
 		orElse: () => !0
-	})) return { release: Pe };
-	let a = yield* te.make(), o = yield* w.provideService(e.reserve, te.Scope, a), s = te.close(a, T.void);
+	})) return { release: ze };
+	let a = yield* re.make(), o = yield* T.provideService(e.reserve, re.Scope, a), s = re.close(a, te.void);
 	return yield* e.onDialectOrElse({
-		mysql: () => ke(o, r),
-		mssql: () => Me(o, r),
-		sqlite: () => Pe,
-		orElse: () => Ee(o, i)
-	}).pipe(w.onExit((e) => T.isSuccess(e) ? w.void : s)), { release: e.onDialectOrElse({
-		mysql: () => Ae(o, r),
-		mssql: () => Ne(o, r),
-		sqlite: () => Pe,
-		orElse: () => De(o, i)
-	}).pipe(w.ensuring(s)) };
-}), Ie = (e, t, n) => w.acquireUseRelease(Fe(e, n), () => t, (e) => e.release.pipe(w.orDie)), Le = (e) => e.onDialectOrElse({
+		mysql: () => Pe(o, r),
+		mssql: () => Le(o, r),
+		sqlite: () => ze,
+		orElse: () => je(o, i)
+	}).pipe(T.onExit((e) => te.isSuccess(e) ? T.void : s)), { release: e.onDialectOrElse({
+		mysql: () => Fe(o, r),
+		mssql: () => Re(o, r),
+		sqlite: () => ze,
+		orElse: () => Me(o, i)
+	}).pipe(T.ensuring(s)) };
+}), Ve = (e, t, n) => T.acquireUseRelease(Be(e, n), () => t, (e) => e.release.pipe(T.orDie)), He = (e) => e.onDialectOrElse({
 	pg: () => "postgres",
 	mysql: () => "mysql",
 	mssql: () => "mssql",
 	sqlite: () => "sqlite",
 	orElse: () => "sqlite"
-}), Re = {
+}), Ue = {
 	postgres: "plan-transactional",
 	mssql: "plan-transactional",
 	mysql: "per-operation",
 	mariadb: "per-operation",
 	sqlite: "per-operation",
 	turso: "per-operation"
-}, ze = (e) => Re[e], k = "_voltro_migration_ops", Be = l(k, {
+}, We = (e) => Ue[e], A = "_voltro_migration_ops", Ge = l(A, {
 	id: y({ prefix: "mop" }),
 	runId: a(),
 	planFingerprint: a(),
@@ -163,7 +198,7 @@ var se = (e, t, n, r = 400) => {
 	appliedAt: v().nullable(),
 	durationMs: t().nullable(),
 	createdAt: v().default("now")
-}), Ve = (e) => {
+}), Ke = (e) => {
 	switch (e.kind) {
 		case "create-table": return /* @__PURE__ */ new Set([
 			`table:${e.table}`,
@@ -183,18 +218,19 @@ var se = (e, t, n, r = 400) => {
 		case "add-foreign-key":
 		case "drop-foreign-key":
 		case "add-check":
-		case "drop-check": return /* @__PURE__ */ new Set([`column:${e.table}.${e.column}`]);
+		case "drop-check":
+		case "reconcile-json-check": return /* @__PURE__ */ new Set([`column:${e.table}.${e.column}`]);
 		case "add-index": return /* @__PURE__ */ new Set([`index:${e.table}.${e.index.name}`]);
 		case "drop-index": return /* @__PURE__ */ new Set([`index:${e.table}.${e.index}`]);
 		case "rename-index": return /* @__PURE__ */ new Set([`index:${e.table}.${e.from}`, `index:${e.table}.${e.to}`]);
 		case "add-unique-composite":
 		case "drop-unique-composite": return /* @__PURE__ */ new Set([`unique:${e.table}.${e.name}`]);
 	}
-}, He = (e) => [...Ve(e)].join(" "), Ue = (e, t) => {
-	let n = Ve(t);
-	for (let t of Ve(e)) if (n.has(t)) return !0;
+}, qe = (e) => [...Ke(e)].join(" "), Je = (e, t) => {
+	let n = Ke(t);
+	for (let t of Ke(e)) if (n.has(t)) return !0;
 	return !1;
-}, We = (e, t) => e.operations.some((e) => Ue(e.op, t)), Ge = "__voltro_rebuild", Ke = "__shadow", qe = "__old", Je = /* @__PURE__ */ new Set([
+}, Ye = (e, t) => e.operations.some((e) => Je(e.op, t)), Xe = "__voltro_rebuild", Ze = "__shadow", Qe = "__old", $e = /* @__PURE__ */ new Set([
 	"add-unique",
 	"drop-unique",
 	"add-unique-composite",
@@ -206,21 +242,59 @@ var se = (e, t, n, r = 400) => {
 	"alter-column-nullability",
 	"alter-column-type",
 	"alter-column-default"
-]), Ye = /* @__PURE__ */ new Set(["alter-column-default", "alter-column-nullability"]), Xe = (e, t, n) => {
+]), et = /* @__PURE__ */ new Set(["alter-column-default", "alter-column-nullability"]), tt = (e, t, n) => {
 	let r = n === "sqlite" || n === "turso";
-	return e.kind === "alter-column-type" && t === "online-required" || r && Je.has(e.kind) ? "artefact-repair" : Ye.has(e.kind) ? "idempotent" : "probe-then-replay";
+	return e.kind === "alter-column-type" && t === "online-required" || r && $e.has(e.kind) ? "artefact-repair" : et.has(e.kind) ? "idempotent" : "probe-then-replay";
 };
-Object.keys(Re);
+Object.keys(Ue);
 //#endregion
-//#region src/migrations/reactiveTriggerName.ts
-var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "framework_changes" ? `${Ze}${e}` : `${Ze}${t}_${e}`, $e = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, et = "voltro:notify:v2", tt = (e, t) => {
+//#region src/mssqlJsonValueCheck.ts
+var nt = (e) => {
+	let t = `(N'{"v":' + ${e} + N'}')`, n = `ISJSON(${t}) = 1`, r = `JSON_MODIFY(CASE WHEN ${n} THEN ${t} ELSE N'{}' END, '$.v', NULL)`;
+	return `(${e} IS NULL OR (${n} AND ${[
+		32,
+		9,
+		10,
+		13
+	].reduce((e, t) => `REPLACE(${e}, NCHAR(${t}), N'')`, r)} = N'{}'))`;
+}, rt = (e) => {
+	let t = [], n = /\s+|N?'(?:''|[^'])*'|\[(?:\]\]|[^\]])*\]|[A-Za-z_][A-Za-z_0-9]*|[0-9]+|[()+,=]/giy, r = 0;
+	for (; r < e.length;) {
+		n.lastIndex = r;
+		let i = n.exec(e);
+		if (!i) return;
+		let a = i[0];
+		/^\s+$/.test(a) || t.push(/^(?:N?')|^\[/i.test(a) ? a.replace(/^n'/, "N'") : a.toLowerCase()), r = n.lastIndex;
+	}
+	return t;
+}, it = (e, t) => {
+	let n = `[${e.replaceAll("]", "]]")}]`, r = `(N'{"v":'+${n})+N'}'`, i = `isjson(${r})=(1)`, a = `json_modify(case when ${i} then ${r} else N'{}' end,'$.v',NULL)`, o = [
+		32,
+		9,
+		10,
+		13
+	].reduce((e, t) => `replace(${e},nchar((${t})),N'')`, a), s = [
+		["value", nt(n)],
+		["value", `(${n} IS NULL OR ${i} AND ${o}=N'{}')`],
+		["container", `(${n} IS NULL OR ISJSON(${n}) = 1)`],
+		["container", `(${n} IS NULL OR isjson(${n})=(1))`]
+	], c = rt(t);
+	if (c) return s.find(([, e]) => {
+		let t = rt(e);
+		return t?.length === c.length && t.every((e, t) => e === c[t]);
+	})?.[0];
+}, at = (e) => {
+	if (e.length === 0) return;
+	let t = e.filter((e) => e.enabled);
+	return t.some((e) => e.validation === "container") ? t.some((e) => e.validation === "container" && e.trusted) ? "container" : "unverified" : t.some((e) => e.validation === "value" && e.trusted) ? "value" : "unverified";
+}, j = "framework_changes", ot = "framework_changes_", st = (e, t) => t === "framework_changes" ? `${ot}${e}` : `${ot}${t}_${e}`, ct = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, lt = "voltro:notify:v2", ut = (e, t) => {
 	if (e.type === "text" && e.generatedAs === void 0) {
 		if (e.maxLength !== void 0) return e.maxLength;
 		if (t || e.hasDefault && e.defaultFactory === void 0 || e.oneOf !== void 0 && e.oneOf.length > 0) return 450;
 	}
-}, nt = re({ scope: "voltro:migrate" }), j = (e) => {
-	nt.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
-}, M = (e, t) => {
+}, dt = ae({ scope: "voltro:migrate" }), M = (e) => {
+	dt.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
+}, N = (e, t) => {
 	let n = e.type;
 	if (e.spatial) {
 		if (t === "postgres") return `${e.spatial.kind}(${e.spatial.geomKind},${e.spatial.srid})`;
@@ -231,7 +305,7 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		return e.rawDdl;
 	}
 	if (n === "array" && e.arrayElement) {
-		if (t === "postgres") return `${M({
+		if (t === "postgres") return `${N({
 			...e,
 			type: e.arrayElement,
 			arrayElement: void 0
@@ -302,7 +376,7 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 	if (t === "mssql") switch (n) {
 		case "id": return "NVARCHAR(64)";
 		case "text": {
-			let t = tt(e, !1);
+			let t = ut(e, !1);
 			return t === void 0 ? "NVARCHAR(MAX)" : `NVARCHAR(${t})`;
 		}
 		case "integer": return "INT";
@@ -334,22 +408,22 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		case "array": return "TEXT[]";
 		case "interval": return "INTERVAL";
 	}
-}, rt = (e, t) => {
+}, ft = (e, t) => {
 	if (!e.hasDefault || e.defaultFactory !== void 0) return null;
 	let n = e.defaultValue;
-	return n === "now" ? m(t) ? "DEFAULT CURRENT_TIMESTAMP" : t === "mssql" ? "DEFAULT SYSUTCDATETIME()" : t === "mysql" || t === "mariadb" ? "DEFAULT CURRENT_TIMESTAMP(6)" : "DEFAULT now()" : typeof n == "boolean" ? t === "postgres" ? `DEFAULT ${n}` : `DEFAULT ${+!!n}` : typeof n == "number" ? `DEFAULT ${n}` : typeof n == "string" ? `DEFAULT '${n.replace(/'/g, "''")}'` : Array.isArray(n) ? it(n, e, t) : typeof n == "object" && n ? N(n, t) : null;
-}, it = (e, t, n) => {
-	if (n !== "postgres" || t.type !== "array" || t.arrayElement === void 0) return N(e, n);
-	let r = M({
+	return n === "now" ? m(t) ? "DEFAULT CURRENT_TIMESTAMP" : t === "mssql" ? "DEFAULT SYSUTCDATETIME()" : t === "mysql" || t === "mariadb" ? "DEFAULT CURRENT_TIMESTAMP(6)" : "DEFAULT now()" : typeof n == "boolean" ? t === "postgres" ? `DEFAULT ${n}` : `DEFAULT ${+!!n}` : typeof n == "number" ? `DEFAULT ${n}` : typeof n == "string" ? `DEFAULT '${n.replace(/'/g, "''")}'` : Array.isArray(n) ? pt(n, e, t) : typeof n == "object" && n ? P(n, t) : null;
+}, pt = (e, t, n) => {
+	if (n !== "postgres" || t.type !== "array" || t.arrayElement === void 0) return P(e, n);
+	let r = N({
 		...t,
 		type: t.arrayElement,
 		arrayElement: void 0
 	}, n);
 	return `DEFAULT '{${e.map((e) => typeof e == "number" || typeof e == "boolean" ? String(e) : `"${String(e).replace(/\\/g, "\\\\").replace(/"/g, "\\\"")}"`).join(",").replace(/'/g, "''")}}'::${r}[]`;
-}, N = (e, t) => {
+}, P = (e, t) => {
 	let n = JSON.stringify(e).replace(/'/g, "''");
 	return t === "postgres" ? `DEFAULT '${n}'::jsonb` : t === "mysql" || t === "mariadb" ? `DEFAULT (CONVERT('${n}' USING utf8mb4))` : `DEFAULT '${n}'`;
-}, P = (e, t) => {
+}, F = (e, t) => {
 	switch (t) {
 		case "postgres": return `"${e}" BIGSERIAL PRIMARY KEY`;
 		case "mysql":
@@ -358,7 +432,7 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		case "sqlite": return `"${e}" INTEGER PRIMARY KEY AUTOINCREMENT`;
 		case "turso": return `"${e}" INTEGER PRIMARY KEY`;
 	}
-}, F = (e, t) => {
+}, I = (e, t) => {
 	if (e === "restrict" && t === "mssql") return "NO ACTION";
 	switch (e) {
 		case "cascade": return "CASCADE";
@@ -366,42 +440,42 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		case "setNull": return "SET NULL";
 		case "noAction": return "NO ACTION";
 	}
-}, at = (e, t, n) => n === null ? o(e, t) : `${o(n, t)}.${o(e, t)}`, ot = 191, st = (e, t) => {
+}, mt = (e, t, n) => n === null ? o(e, t) : `${o(n, t)}.${o(e, t)}`, ht = 191, gt = (e, t) => {
 	if (!e || t !== "mysql" && t !== "mariadb") return !1;
-	let n = M(e, t).toUpperCase();
+	let n = N(e, t).toUpperCase();
 	return n.endsWith("TEXT") || n.endsWith("BLOB");
-}, ct = (e, t, n) => {
+}, _t = (e, t, n) => {
 	let r = o(e, n);
 	if (n !== "mysql" && n !== "mariadb") return r;
 	let i = t[e];
 	if (!i) return r;
-	let a = M(i, n).toUpperCase();
-	return a.endsWith("TEXT") || a.endsWith("BLOB") ? `${r}(${ot})` : r;
-}, lt = (e, t) => {
+	let a = N(i, n).toUpperCase();
+	return a.endsWith("TEXT") || a.endsWith("BLOB") ? `${r}(${ht})` : r;
+}, vt = (e, t) => {
 	if (!e.generatedAs) return null;
 	let { expr: n, stored: r } = e.generatedAs;
-	if (t === "postgres") return r || j("[voltro:migrate] generated column requested as VIRTUAL but postgres only supports STORED — promoting"), `GENERATED ALWAYS AS (${n}) STORED`;
+	if (t === "postgres") return r || M("[voltro:migrate] generated column requested as VIRTUAL but postgres only supports STORED — promoting"), `GENERATED ALWAYS AS (${n}) STORED`;
 	if (t === "mysql" || t === "mariadb") return `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
 	if (t === "mssql") return `AS (${n})${r ? " PERSISTED" : ""}`;
 	if (t === "turso") throw Error("@voltro/sql-turso: generated columns (.generatedAs(...)) are not supported — Turso's MVCC mode (journal_mode=experimental_mvcc) rejects them. Drop the generated column, or use the 'sqlite' / 'postgres' dialect for this table.");
 	return `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
-}, ut = (e, t, n, r, i = !1, a = !1) => {
-	if (t.type === "id" && t.idScheme?.kind === "numeric") return P(e, n);
-	let s = n === "mssql" ? tt(t, r?.has(e) ?? !1) : void 0, c = s === void 0 ? M(t, n) : `NVARCHAR(${s})`, l = [o(e, n), c];
+}, yt = (e, t, n, r, i = !1, a = !1) => {
+	if (t.type === "id" && t.idScheme?.kind === "numeric") return F(e, n);
+	let s = n === "mssql" ? ut(t, r?.has(e) ?? !1) : void 0, c = s === void 0 ? N(t, n) : `NVARCHAR(${s})`, l = [o(e, n), c];
 	t.type === "id" && !a && l.push("PRIMARY KEY");
-	let u = lt(t, n);
+	let u = vt(t, n);
 	if (u) l.push(u);
 	else {
-		t.nullable || l.push("NOT NULL"), t.unique && t.type !== "id" && !st(t, n) && l.push("UNIQUE");
-		let e = rt(t, n);
+		t.nullable || l.push("NOT NULL"), t.unique && t.type !== "id" && !gt(t, n) && l.push("UNIQUE");
+		let e = ft(t, n);
 		e && l.push(e);
 	}
 	if (t.type === "reference" && t.references && !i && !b(n)) {
 		let e = t.references();
 		l.push(`REFERENCES ${o(e.tableName, n)} (${o(t.referenceColumn ?? "id", n)})`);
-		let r = F(t.onDelete ?? "restrict", n);
+		let r = I(t.onDelete ?? "restrict", n);
 		l.push(`ON DELETE ${r}`);
-		let i = F(t.refOnUpdate ?? "noAction", n);
+		let i = I(t.refOnUpdate ?? "noAction", n);
 		i !== "NO ACTION" && l.push(`ON UPDATE ${i}`);
 	}
 	if (t.oneOf && t.oneOf.length > 0) {
@@ -414,30 +488,30 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		l.push(`CHECK (${o(e, n)} IN (${r}))`);
 	}
 	if (t.type === "json" || t.type === "array") {
-		let t = o(e, n);
-		m(n) ? l.push(`CHECK (${t} IS NULL OR json_valid(${t}))`) : n === "mssql" && l.push(`CHECK (${t} IS NULL OR ISJSON(${t}) = 1)`);
+		let r = o(e, n);
+		m(n) ? l.push(`CHECK (${r} IS NULL OR json_valid(${r}))`) : n === "mssql" && l.push(t.type === "json" ? `CHECK ${nt(r)}` : `CHECK (${r} IS NULL OR ISJSON(${r}) = 1)`);
 	}
 	return l.join(" ");
-}, dt = (e, t, n = null, r) => {
+}, bt = (e, t, n = null, r) => {
 	let i = /* @__PURE__ */ new Set();
 	for (let t of e.appliedIndexes ?? []) for (let e of t.fields) typeof e == "string" && i.add(e);
 	for (let t of e.appliedUniques ?? []) for (let e of t.fields) typeof e == "string" && i.add(e);
 	for (let [t, n] of Object.entries(e.fields)) n.unique && i.add(t);
 	let a = e.appliedPrimaryKey ?? [];
 	for (let e of a) i.add(e);
-	let s = a.length > 0, c = Object.entries(e.fields).map(([e, n]) => `  ${ut(e, n, t, i, r?.has(e) ?? !1, s)}`).join(",\n"), l = (e.appliedUniques ?? []).map((n) => {
-		let r = n.fields.map((n) => ct(n, e.fields, t)).join(", ");
+	let s = a.length > 0, c = Object.entries(e.fields).map(([e, n]) => `  ${yt(e, n, t, i, r?.has(e) ?? !1, s)}`).join(",\n"), l = (e.appliedUniques ?? []).map((n) => {
+		let r = n.fields.map((n) => _t(n, e.fields, t)).join(", ");
 		return `  CONSTRAINT ${o(n.name, t)} UNIQUE (${r})`;
-	}), u = (e.appliedChecks ?? []).map((e) => `  CONSTRAINT ${o(e.name, t)} CHECK (${e.expr})`), d = s ? [`  PRIMARY KEY (${a.map((n) => ct(n, e.fields, t)).join(", ")})`] : [], f = b(t) ? Object.entries(e.fields).flatMap(([i, a]) => {
+	}), u = (e.appliedChecks ?? []).map((e) => `  CONSTRAINT ${o(e.name, t)} CHECK (${e.expr})`), d = s ? [`  PRIMARY KEY (${a.map((n) => _t(n, e.fields, t)).join(", ")})`] : [], f = b(t) ? Object.entries(e.fields).flatMap(([i, a]) => {
 		if (a.type !== "reference" || !a.references || (r?.has(i) ?? !1)) return [];
-		let s = a.references(), c = F(a.onDelete ?? "restrict", t), l = F(a.refOnUpdate ?? "noAction", t);
-		return [`  CONSTRAINT ${o(`${e.tableName}_${i}_fkey`, t)} FOREIGN KEY (${o(i, t)}) REFERENCES ${at(s.tableName, t, n)} (${o(a.referenceColumn ?? "id", t)}) ON DELETE ${c}${l === "NO ACTION" ? "" : ` ON UPDATE ${l}`}`];
+		let s = a.references(), c = I(a.onDelete ?? "restrict", t), l = I(a.refOnUpdate ?? "noAction", t);
+		return [`  CONSTRAINT ${o(`${e.tableName}_${i}_fkey`, t)} FOREIGN KEY (${o(i, t)}) REFERENCES ${mt(s.tableName, t, n)} (${o(a.referenceColumn ?? "id", t)}) ON DELETE ${c}${l === "NO ACTION" ? "" : ` ON UPDATE ${l}`}`];
 	}) : [], p = [
 		...d,
 		...l,
 		...u,
 		...f
-	], m = p.length > 0 ? `${c},\n${p.join(",\n")}` : c, h = at(e.tableName, t, n);
+	], m = p.length > 0 ? `${c},\n${p.join(",\n")}` : c, h = mt(e.tableName, t, n);
 	if (t === "mssql") {
 		let t = n === null ? e.tableName : `${n}.${e.tableName}`, r = `CREATE TABLE ${h} (\n${m}\n)`;
 		return `IF OBJECT_ID('${t.replace(/'/g, "''")}', 'U') IS NULL EXEC(N'${r.replace(/'/g, "''")}');`;
@@ -447,56 +521,29 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		m,
 		");"
 	].join("\n");
-}, ft = (e, t, n) => {
+}, xt = (e, t, n) => {
 	let r = `${e}_${t.name}_fts`, i = (e) => o(e, n), a = t.columns.map(i).join(", "), s = t.columns.map((e) => `new.${i(e)}`).join(", "), c = [];
 	return c.push(`CREATE VIRTUAL TABLE IF NOT EXISTS ${i(r)} USING fts5(${a}, row_id UNINDEXED, tokenize='porter');`), c.push(`CREATE TRIGGER IF NOT EXISTS ${i(`${r}_ai`)} AFTER INSERT ON ${i(e)} BEGIN\n  INSERT INTO ${i(r)} (${a}, row_id) VALUES (${s}, new.${i("id")});\nEND;`), c.push(`CREATE TRIGGER IF NOT EXISTS ${i(`${r}_ad`)} AFTER DELETE ON ${i(e)} BEGIN\n  DELETE FROM ${i(r)} WHERE row_id = old.${i("id")};\nEND;`), c.push(`CREATE TRIGGER IF NOT EXISTS ${i(`${r}_au`)} AFTER UPDATE ON ${i(e)} BEGIN\n  DELETE FROM ${i(r)} WHERE row_id = old.${i("id")};\n  INSERT INTO ${i(r)} (${a}, row_id) VALUES (${s}, new.${i("id")});\nEND;`), c;
-}, pt = (e, t, n = null) => {
-	let r = [], i = /* @__PURE__ */ new Set(), a = (e) => e.join("\0"), s = (e, n, r, i) => {
-		let a = {
+}, St = (e, t, n = null) => {
+	let r = [], i = /* @__PURE__ */ new Set(), a = (e) => e.join("\0"), s = (e, n, r, i, a) => {
+		if (t === "postgres") return de(r, i, a);
+		let o = {
 			using: "",
 			withSuffix: "",
 			skip: !1
 		};
-		if (r === void 0 || r === "btree") return a;
-		if (r === "gist") return t === "postgres" ? {
-			using: " USING GIST",
-			withSuffix: "",
-			skip: !1
-		} : (j(`[voltro:migrate] index '${e}' on '${n}': ${t} doesn't support GiST — falling back to btree. Spatial queries on this column will fall back to sequential scan.`), a);
-		if (r === "gin") return t === "postgres" ? {
-			using: " USING GIN",
-			withSuffix: "",
-			skip: !1
-		} : t === "mysql" || t === "mariadb" ? (j(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — skipping (a btree on a JSON/array column can't serve containment/membership queries). Add a generated column for the specific path you query, then index that with .expressionIndex(...).`), {
+		return r === void 0 || r === "btree" ? o : r === "gist" ? (M(`[voltro:migrate] index '${e}' on '${n}': ${t} doesn't support GiST — falling back to btree. Spatial queries on this column will fall back to sequential scan.`), o) : r === "gin" ? t === "mysql" || t === "mariadb" ? (M(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — skipping (a btree on a JSON/array column can't serve containment/membership queries). Add a generated column for the specific path you query, then index that with .expressionIndex(...).`), {
 			using: "",
 			withSuffix: "",
 			skip: !0
-		}) : (j(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — falling back to btree. Containment/membership queries won't use this index efficiently.`), a);
-		if (r === "brin") return t === "postgres" ? {
-			using: " USING BRIN",
+		}) : (M(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — falling back to btree. Containment/membership queries won't use this index efficiently.`), o) : r === "brin" ? (M(`[voltro:migrate] brin index '${e}' on '${n}': ${t} has no BRIN access method — falling back to btree (larger on disk, but the range scan still works).`), o) : r === "hnsw" ? (M(`[voltro:migrate] hnsw index '${e}' on '${n}': ${t} has no pgvector / HNSW access method — skipping. Nearest-neighbour queries on this column fall back to a sequential scan.`), {
+			using: "",
 			withSuffix: "",
-			skip: !1
-		} : (j(`[voltro:migrate] brin index '${e}' on '${n}': ${t} has no BRIN access method — falling back to btree (larger on disk, but the range scan still works).`), a);
-		if (r === "hnsw") {
-			if (t === "postgres") {
-				let e = i?.hnsw?.m ?? 16, t = i?.hnsw?.efConstruction ?? 64, n = i?.hnsw?.opclass ?? h(i?.hnsw?.distance);
-				return {
-					using: " USING hnsw",
-					withSuffix: ` WITH (m = ${e}, ef_construction = ${t})`,
-					opclass: n,
-					skip: !1
-				};
-			}
-			return j(`[voltro:migrate] hnsw index '${e}' on '${n}': ${t} has no pgvector / HNSW access method — skipping. Nearest-neighbour queries on this column fall back to a sequential scan.`), {
-				using: "",
-				withSuffix: "",
-				skip: !0
-			};
-		}
-		return a;
+			skip: !0
+		}) : o;
 	}, c = (n, r) => {
 		let i = n.map((n) => {
-			if (typeof n == "string") return ct(n, e.fields, t);
+			if (typeof n == "string") return _t(n, e.fields, t);
 			if ("jsonPath" in n) {
 				let { column: e, path: r, numeric: i } = n.jsonPath;
 				return `(${C(e, r, t, { numeric: i })})`;
@@ -504,14 +551,14 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 			return `(${n.expr})`;
 		});
 		return r !== void 0 && i.length === 1 ? `${i[0]} ${r}` : i.join(", ");
-	}, l = (e, r, i, a, l, u = "", d = !1) => {
-		let f = s(e, r, a, l);
-		if (f.skip) return "";
-		let p = c(i, f.opclass), m = `${f.withSuffix}${u}`, h = at(r, t, n), g = d ? "UNIQUE " : "";
-		return t === "mssql" ? `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = '${e}') CREATE ${g}INDEX ${o(e, t)} ON ${h}${f.using} (${p})${m};` : t === "mysql" ? `CREATE ${g}INDEX ${o(e, t)} ON ${h}${f.using} (${p})${m};` : `CREATE ${g}INDEX IF NOT EXISTS ${o(e, t)} ON ${h}${f.using} (${p})${m};`;
+	}, l = (r, i, a, l, u, d = "", f = !1) => {
+		let p = a[0], m = typeof p == "string" ? e.fields[p]?.vectorPrecision : void 0, h = s(r, i, l, u, m);
+		if (h.skip) return "";
+		let g = c(a, h.opclass), _ = `${h.withSuffix}${d}`, v = mt(i, t, n), y = f ? "UNIQUE " : "";
+		return t === "mssql" ? `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = '${r}') CREATE ${y}INDEX ${o(r, t)} ON ${v}${h.using} (${g})${_};` : t === "mysql" ? `CREATE ${y}INDEX ${o(r, t)} ON ${v}${h.using} (${g})${_};` : `CREATE ${y}INDEX IF NOT EXISTS ${o(r, t)} ON ${v}${h.using} (${g})${_};`;
 	};
 	if (t === "mysql" || t === "mariadb") for (let [n, i] of Object.entries(e.fields)) {
-		if (!i.unique || i.type === "id" || !st(i, t)) continue;
+		if (!i.unique || i.type === "id" || !gt(i, t)) continue;
 		let a = l(`${e.tableName}_${n}_key`, e.tableName, [n], void 0, void 0, "", !0);
 		a && r.push(a);
 	}
@@ -525,15 +572,15 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		let i = n.columns.map((e) => o(e, t)).join(", ");
 		r.push(`CREATE FULLTEXT INDEX ${o(n.name, t)} ON ${o(e.tableName, t)} (${i});`);
 	} else if (t === "turso") throw Error(`@voltro/sql-turso: full-text index '${n.name}' on '${e.tableName}' is not supported — Turso's MVCC mode has no FTS5 virtual tables. Drop .fullTextIndex(), or use the 'sqlite' / 'postgres' dialect for this table.`);
-	else t === "sqlite" ? r.push(...ft(e.tableName, n, t)) : j(`[voltro:migrate] full-text index '${n.name}' on '${e.tableName}': ${t} uses a ranked LIKE search at query time (no native FTS catalog required).`);
+	else t === "sqlite" ? r.push(...xt(e.tableName, n, t)) : M(`[voltro:migrate] full-text index '${n.name}' on '${e.tableName}': ${t} uses a ranked LIKE search at query time (no native FTS catalog required).`);
 	for (let n of e.appliedIndexes) {
 		if ((t === "mariadb" || t === "mssql") && n.fields.some((e) => typeof e != "string" && "jsonPath" in e)) {
-			j(`[voltro:migrate] json-path index '${n.name}' on '${e.tableName}': ${t} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${t}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
+			M(`[voltro:migrate] json-path index '${n.name}' on '${e.tableName}': ${t} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${t}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
 			continue;
 		}
 		if (n.unique && n.where !== void 0 && n.where.length > 0 && (t === "mysql" || t === "mariadb")) throw Error(`@voltro/migrate: uniqueActive index '${n.name}' on '${e.tableName}' cannot be expressed on ${t} — 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 ${t}, or move this table to postgres/sqlite/mssql.`);
 		let o = "";
-		n.where !== void 0 && n.where.length > 0 && (t === "mysql" || t === "mariadb" ? j(`[voltro:migrate] partial index '${n.name}' on '${e.tableName}': ${t} does not support WHERE clauses on indexes — emitting a full index`) : o = ` WHERE ${n.where}`);
+		n.where !== void 0 && n.where.length > 0 && (t === "mysql" || t === "mariadb" ? M(`[voltro:migrate] partial index '${n.name}' on '${e.tableName}': ${t} does not support WHERE clauses on indexes — emitting a full index`) : o = ` WHERE ${n.where}`);
 		let s = l(n.name, e.tableName, n.fields, n.kind, n.kindOptions, o, n.unique === !0);
 		s !== "" && r.push(s), n.fields.every((e) => typeof e == "string") && i.add(a(n.fields));
 	}
@@ -543,17 +590,17 @@ var A = "framework_changes", Ze = "framework_changes_", Qe = (e, t) => t === "fr
 		r.push(l(o, e.tableName, [t])), i.add(a([t]));
 	}
 	return r.join("\n");
-}, mt = (e, t, n = A) => {
+}, Ct = (e, t, n = j) => {
 	if (t !== "postgres") return [];
 	let r = e.filter((e) => e.isReactive !== !1);
-	return r.length === 0 ? [] : [ht(n), ...r.map((e) => _t(e, n))];
-}, ht = (e) => `
-CREATE OR REPLACE FUNCTION ${$e(e)}() RETURNS trigger AS $$
+	return r.length === 0 ? [] : [wt(n), ...r.map((e) => Et(e, n))];
+}, wt = (e) => `
+CREATE OR REPLACE FUNCTION ${ct(e)}() RETURNS trigger AS $$
 DECLARE
   payload TEXT;
   pk JSONB;
 BEGIN
-  -- ${et}
+  -- ${lt}
   payload := json_build_object(
     'table',  TG_TABLE_NAME,
     -- The schema the write landed in. Under namespace isolation this is
@@ -607,22 +654,22 @@ BEGIN
   RETURN COALESCE(NEW, OLD);
 END;
 $$ LANGUAGE plpgsql;
-`.trim(), gt = (e, t) => {
-	let n = Qe(e.tableName, t);
+`.trim(), Tt = (e, t) => {
+	let n = st(e.tableName, t);
 	return [
 		`ALTER TABLE "${e.tableName}" REPLICA IDENTITY FULL`,
 		`DROP TRIGGER IF EXISTS ${n} ON "${e.tableName}"`,
-		`CREATE TRIGGER ${n}\nAFTER INSERT OR UPDATE OR DELETE ON "${e.tableName}"\nFOR EACH ROW EXECUTE FUNCTION ${$e(t)}()`
+		`CREATE TRIGGER ${n}\nAFTER INSERT OR UPDATE OR DELETE ON "${e.tableName}"\nFOR EACH ROW EXECUTE FUNCTION ${ct(t)}()`
 	];
-}, _t = (e, t) => gt(e, t).map((e) => `${e};`).join("\n"), vt = (e) => {
+}, Et = (e, t) => Tt(e, t).map((e) => `${e};`).join("\n"), Dt = (e) => {
 	if (e.dialect !== "postgres") return [];
 	let t = e.channel ?? "framework_changes", n = new Map(e.tables.map((e) => [e.tableName, e])), r = [], i = e.missing.filter((e) => n.has(e));
-	(i.length > 0 || e.functionOutdated === !0) && r.push(ht(t));
-	for (let e of i) r.push(...gt(n.get(e), t));
-	for (let n of e.stale) r.push(`DROP TRIGGER IF EXISTS ${Qe(n, t)} ON "${n}"`), r.push(`ALTER TABLE "${n}" REPLICA IDENTITY DEFAULT`);
+	(i.length > 0 || e.functionOutdated === !0) && r.push(wt(t));
+	for (let e of i) r.push(...Tt(n.get(e), t));
+	for (let n of e.stale) r.push(`DROP TRIGGER IF EXISTS ${st(n, t)} ON "${n}"`), r.push(`ALTER TABLE "${n}" REPLICA IDENTITY DEFAULT`);
 	return r;
-}, yt = (e) => e.some((e) => Object.values(e.fields).some((e) => e.type === "vector")), bt = (e) => e.some((e) => Object.values(e.fields).some((e) => e.spatial !== void 0)), xt = (e) => {
-	let t = new Map(e.map((e) => [e.tableName, e])), n = me(e.map((e) => e.tableName), (e) => {
+}, Ot = (e) => e.some((e) => Object.values(e.fields).some((e) => e.type === "vector")), kt = (e) => e.some((e) => Object.values(e.fields).some((e) => e.spatial !== void 0)), At = (e) => {
+	let t = new Map(e.map((e) => [e.tableName, e])), n = ye(e.map((e) => e.tableName), (e) => {
 		let n = t.get(e);
 		return n ? Object.entries(n.fields).flatMap(([e, n]) => {
 			if (n.type !== "reference" || !n.references) return [];
@@ -633,7 +680,7 @@ $$ LANGUAGE plpgsql;
 			}] : [];
 		}) : [];
 	}), r = [];
-	for (let t of e) for (let [e, i] of Object.entries(t.fields)) i.type === "reference" && i.references && n.has(D(t.tableName, e)) && r.push({
+	for (let t of e) for (let [e, i] of Object.entries(t.fields)) i.type === "reference" && i.references && n.has(O(t.tableName, e)) && r.push({
 		table: t.tableName,
 		column: e,
 		targetTable: i.references().tableName,
@@ -645,7 +692,7 @@ $$ LANGUAGE plpgsql;
 		if (!(i.has(e.tableName) || a.has(e.tableName))) {
 			a.add(e.tableName);
 			for (let [r, i] of Object.entries(e.fields)) {
-				if (i.type !== "reference" || !i.references || n.has(D(e.tableName, r))) continue;
+				if (i.type !== "reference" || !i.references || n.has(O(e.tableName, r))) continue;
 				let a = i.references();
 				if (a.tableName === e.tableName) continue;
 				let o = t.get(a.tableName);
@@ -659,8 +706,8 @@ $$ LANGUAGE plpgsql;
 		sorted: o,
 		cyclic: r
 	};
-}, St = (e, t, n = null) => {
-	let r = (e) => n ? `${o(n, t)}.${o(e, t)}` : o(e, t), i = `${e.table}_${e.column}_fkey`, a = F(e.onDelete, t), s = F(e.onUpdate, t), c = ` ON DELETE ${a}${s === "NO ACTION" ? "" : ` ON UPDATE ${s}`}`, l = (n) => `ADD CONSTRAINT ${o(i, t)} FOREIGN KEY ${n ? "IF NOT EXISTS " : ""}(${o(e.column, t)}) REFERENCES ${r(e.targetTable)} (${o(e.targetColumn, t)})${c}`;
+}, jt = (e, t, n = null) => {
+	let r = (e) => n ? `${o(n, t)}.${o(e, t)}` : o(e, t), i = `${e.table}_${e.column}_fkey`, a = I(e.onDelete, t), s = I(e.onUpdate, t), c = ` ON DELETE ${a}${s === "NO ACTION" ? "" : ` ON UPDATE ${s}`}`, l = (n) => `ADD CONSTRAINT ${o(i, t)} FOREIGN KEY ${n ? "IF NOT EXISTS " : ""}(${o(e.column, t)}) REFERENCES ${r(e.targetTable)} (${o(e.targetColumn, t)})${c}`;
 	switch (t) {
 		case "postgres": return [
 			"DO $$ BEGIN",
@@ -674,7 +721,7 @@ $$ LANGUAGE plpgsql;
 		case "mariadb": return `ALTER TABLE ${r(e.table)} ${l(!0)};`;
 		default: return `ALTER TABLE ${r(e.table)} ${l(!1)};`;
 	}
-}, Ct = (e, t) => {
+}, Mt = (e, t) => {
 	let n = /* @__PURE__ */ new Map();
 	if (m(t)) return n;
 	for (let t of e) {
@@ -682,7 +729,7 @@ $$ LANGUAGE plpgsql;
 		e.add(t.column), n.set(t.table, e);
 	}
 	return n;
-}, wt = (e, t) => {
+}, Nt = (e, t) => {
 	if (t !== "postgres") return "";
 	let n = /* @__PURE__ */ new Map();
 	for (let t of e) for (let e of Object.values(t.fields)) {
@@ -698,7 +745,7 @@ $$ LANGUAGE plpgsql;
 		r.push(`DO $$ BEGIN\n  IF NOT EXISTS (SELECT 1 FROM pg_type WHERE typname = '${e.replace(/'/g, "''")}') THEN\n    CREATE TYPE "${e}" AS ENUM (${n});\n  END IF;\nEND $$;`);
 	}
 	return r.join("\n\n");
-}, Tt = (e, t) => {
+}, Pt = (e, t) => {
 	if (t !== "postgres") return "";
 	let r = /* @__PURE__ */ new Set();
 	for (let t of e) for (let e of Object.values(t.fields)) e.type === "enum" && e.enumName && r.add(e.enumName);
@@ -712,30 +759,30 @@ BEGIN
   SELECT oid INTO type_oid FROM pg_type WHERE typname = '${n}';\n  IF type_oid IS NOT NULL\n     AND EXISTS (SELECT 1 FROM pg_enum WHERE enumtypid = type_oid AND enumlabel = '${a}')\n     AND NOT EXISTS (SELECT 1 FROM pg_enum WHERE enumtypid = type_oid AND enumlabel = '${o}') THEN\n    IF current_setting('server_version_num')::int >= 140000 THEN\n      EXECUTE format('ALTER TYPE %I RENAME VALUE %L TO %L', '${n}', '${a}', '${o}');\n    ELSE\n      UPDATE pg_enum SET enumlabel = '${o}' WHERE enumtypid = type_oid AND enumlabel = '${a}';\n    END IF;\n  END IF;\nEND $$;`);
 	}
 	return i.join("\n\n");
-}, Et = (e) => {
+}, Ft = (e) => {
 	let t = [], n = [];
 	for (let r of e) s(r) ? n.push(r) : t.push(r);
 	return {
 		tables: t,
 		views: n
 	};
-}, Dt = (t, n, r = A) => {
-	let { tables: i, views: a } = Et(t), { sorted: o, cyclic: s } = xt(i.map((e) => pe(e, n))), c = Ct(s, n), l = [];
-	n === "postgres" && yt(o) && l.push("CREATE EXTENSION IF NOT EXISTS vector;"), n === "postgres" && bt(o) && l.push("CREATE EXTENSION IF NOT EXISTS postgis;");
-	let u = Tt(o, n);
+}, It = (t, n, r = j) => {
+	let { tables: i, views: a } = Ft(t), { sorted: o, cyclic: s } = At(i.map((e) => ve(e, n))), c = Mt(s, n), l = [];
+	n === "postgres" && Ot(o) && l.push("CREATE EXTENSION IF NOT EXISTS vector;"), n === "postgres" && kt(o) && l.push("CREATE EXTENSION IF NOT EXISTS postgis;");
+	let u = Pt(o, n);
 	u && l.push(u);
-	let d = wt(o, n);
+	let d = Nt(o, n);
 	d && l.push(d);
-	for (let e of o) l.push(dt(e, n, null, c.get(e.tableName)));
-	if (!m(n)) for (let e of s) l.push(St(e, n));
+	for (let e of o) l.push(bt(e, n, null, c.get(e.tableName)));
+	if (!m(n)) for (let e of s) l.push(jt(e, n));
 	for (let e of o) {
-		let t = pt(e, n);
+		let t = St(e, n);
 		t && l.push(t);
 	}
-	l.push(...mt(o, n, r));
+	l.push(...Ct(o, n, r));
 	for (let t of a) l.push(e(t, n));
 	return l.join("\n\n") + "\n";
-}, Ot = (e, t, n) => {
+}, Lt = (e, t, n) => {
 	let r = o(e, t);
 	switch (t) {
 		case "postgres": return `CREATE SCHEMA IF NOT EXISTS ${r};`;
@@ -745,62 +792,62 @@ BEGIN
 		case "turso":
 		case "sqlite": return `ATTACH DATABASE '${(n ?? `${e}.db`).replace(/'/g, "''")}' AS ${r};`;
 	}
-}, kt = (e, t, n, r) => {
-	let i = Ot(n, t, r), a = o(n, t);
-	if (t === "postgres") return `${i}\n\nSET search_path TO ${a};\n\n${Dt(e, t)}`;
-	if (t === "mysql" || t === "mariadb") return `${i}\n\nUSE ${a};\n\n${Dt(e, t)}`;
-	let { sorted: s, cyclic: c } = xt(e), l = Ct(c, t), u = [i];
-	for (let e of s) u.push(dt(e, t, n, l.get(e.tableName)));
-	if (!m(t)) for (let e of c) u.push(St(e, t, n));
+}, Rt = (e, t, n, r) => {
+	let i = Lt(n, t, r), a = o(n, t);
+	if (t === "postgres") return `${i}\n\nSET search_path TO ${a};\n\n${It(e, t)}`;
+	if (t === "mysql" || t === "mariadb") return `${i}\n\nUSE ${a};\n\n${It(e, t)}`;
+	let { sorted: s, cyclic: c } = At(e), l = Mt(c, t), u = [i];
+	for (let e of s) u.push(bt(e, t, n, l.get(e.tableName)));
+	if (!m(t)) for (let e of c) u.push(jt(e, t, n));
 	for (let e of s) {
-		let r = pt(e, t, n);
+		let r = St(e, t, n);
 		r && u.push(r);
 	}
 	return u.join("\n\n") + "\n";
-}, At = (e, t, n = A) => {
-	let { sorted: r, cyclic: i } = xt(e), a = Ct(i, t), o = [], s = Tt(r, t);
+}, zt = (e, t, n = j) => {
+	let { sorted: r, cyclic: i } = At(e), a = Mt(i, t), o = [], s = Pt(r, t);
 	s && o.push(s);
-	let c = wt(r, t);
+	let c = Nt(r, t);
 	c && o.push(c);
-	for (let e of r) o.push(dt(e, t, null, a.get(e.tableName)));
-	for (let e of i) o.push(St(e, t));
-	return o.push(...mt(r, t, n)), o.join("\n\n") + "\n";
-}, jt = (e, t = "postgres", n = A, r = {}) => w.gen(function* () {
+	for (let e of r) o.push(bt(e, t, null, a.get(e.tableName)));
+	for (let e of i) o.push(jt(e, t));
+	return o.push(...Ct(r, t, n)), o.join("\n\n") + "\n";
+}, Bt = (e, t = "postgres", n = j, r = {}) => T.gen(function* () {
 	let i = yield* E.SqlClient;
-	yield* Ie(i, Rt(i, Dt(e, t, n), t, r.retryFilter), { schema: r.lockSchema }).pipe(w.orDie);
-}), Mt = (e, t) => {
+	yield* Ve(i, qt(i, It(e, t, n), t, r.retryFilter), { schema: r.lockSchema }).pipe(T.orDie);
+}), Vt = (e, t) => {
 	let n = t.cause ?? {};
 	return (n.errno === 1061 || n.code === "ER_DUP_KEYNAME") && /^\s*CREATE\s+(UNIQUE\s+|FULLTEXT\s+)?INDEX\b/i.test(e);
-}, Nt = (e, t) => {
+}, Ht = (e, t) => {
 	let n = e.trimStart();
 	return !!(/\bIF NOT EXISTS\b/i.test(n) || /^CREATE OR REPLACE\b/i.test(n) || /^DROP\s[\s\S]*?\bIF EXISTS\b/i.test(n) || /^SET search_path\b/i.test(n) || /^USE[\s`"[]/i.test(n) || /^IF\s/i.test(n) || (t === "mysql" || t === "mariadb") && /^CREATE\s+(UNIQUE\s+|FULLTEXT\s+)?INDEX\b/i.test(n));
-}, Pt = () => {
+}, Ut = () => {
 	let e = Number(process.env.VOLTRO_MIGRATION_DDL_RETRIES);
 	return Number.isInteger(e) && e >= 0 ? e : 4;
-}, Ft = (e) => ({
+}, Wt = (e) => ({
 	while: e,
-	times: Pt(),
-	schedule: ee.jittered(ee.exponential("50 millis"))
-}), It = class {
+	times: Ut(),
+	schedule: ne.jittered(ne.exponential("50 millis"))
+}), Gt = class {
 	statement;
 	error;
 	_tag = "DdlStatementFailed";
 	constructor(e, t) {
 		this.statement = e, this.error = t;
 	}
-}, Lt = (e, t, n) => w.gen(function* () {
-	let r = yield* E.SqlClient, i = n !== void 0 && ze(t) === "per-operation";
-	for (let a of zt(e)) {
-		process.env.VOLTRO_MIGRATE_DEBUG === "1" && nt.debug(`EXEC: ${a.replace(/\s+/g, " ").slice(0, 180)}`);
-		let e = r.unsafe(a).pipe(w.catchIf((e) => Mt(a, e), () => w.succeed([])), w.tapError((e) => w.sync(() => {
-			nt.error(se("migrate: statement failed", a, e, 200));
+}, Kt = (e, t, n) => T.gen(function* () {
+	let r = yield* E.SqlClient, i = n !== void 0 && We(t) === "per-operation";
+	for (let a of Jt(e)) {
+		process.env.VOLTRO_MIGRATE_DEBUG === "1" && dt.debug(`EXEC: ${a.replace(/\s+/g, " ").slice(0, 180)}`);
+		let e = r.unsafe(a).pipe(T.catchIf((e) => Vt(a, e), () => T.succeed([])), T.tapError((e) => T.sync(() => {
+			dt.error(fe("migrate: statement failed", a, e, 200));
 		})));
-		yield* (i && n !== void 0 && Nt(a, t) ? e.pipe(w.retry(Ft((e) => n(e) === "retry"))) : e).pipe(w.mapError((e) => new It(a, e)));
+		yield* (i && n !== void 0 && Ht(a, t) ? e.pipe(T.retry(Wt((e) => n(e) === "retry"))) : e).pipe(T.mapError((e) => new Gt(a, e)));
 	}
-}), Rt = (e, t, n, r) => {
-	let i = n === "turso" ? Lt(t, n, r) : e.withTransaction(Lt(t, n, r)), a = (e) => e instanceof It ? e.error : e;
-	return (r !== void 0 && ze(n) === "plan-transactional" ? i.pipe(w.retry(Ft((e) => r(a(e)) === "retry"))) : i).pipe(w.orDieWith((e) => e instanceof It ? Error(se("migrate: statement failed", e.statement, e.error, 400).trim()) : e));
-}, zt = (e) => {
+}), qt = (e, t, n, r) => {
+	let i = n === "turso" ? Kt(t, n, r) : e.withTransaction(Kt(t, n, r)), a = (e) => e instanceof Gt ? e.error : e;
+	return (r !== void 0 && We(n) === "plan-transactional" ? i.pipe(T.retry(Wt((e) => r(a(e)) === "retry"))) : i).pipe(T.orDieWith((e) => e instanceof Gt ? Error(fe("migrate: statement failed", e.statement, e.error, 400).trim()) : e));
+}, Jt = (e) => {
 	let t = [], n = "", r = !1;
 	for (let i = 0; i < e.length; i++) {
 		if (e.slice(i, i + 2) === "$$") {
@@ -815,50 +862,50 @@ BEGIN
 	}
 	let i = n.trim();
 	return i.length > 0 && t.push(i), t;
-}, Bt = async (e, t, n = "postgres", r = {}) => {
-	await w.runPromise(jt(e, n, void 0, r).pipe(w.provide(t)));
-}, Vt = (e, t, n = "postgres", r = {}) => w.gen(function* () {
-	let i = kt(e, n, t), a = yield* E.SqlClient;
-	yield* Ie(a, Rt(a, i, n, r.retryFilter), { schema: r.lockSchema }).pipe(w.orDie);
-}), Ht = async (e, t, n, r = "postgres", i = {}) => {
-	await w.runPromise(Vt(e, t, r, i).pipe(w.provide(n))), await f({
+}, Yt = async (e, t, n = "postgres", r = {}) => {
+	await T.runPromise(Bt(e, n, void 0, r).pipe(T.provide(t)));
+}, Xt = (e, t, n = "postgres", r = {}) => T.gen(function* () {
+	let i = Rt(e, n, t), a = yield* E.SqlClient;
+	yield* Ve(a, qt(a, i, n, r.retryFilter), { schema: r.lockSchema }).pipe(T.orDie);
+}), Zt = async (e, t, n, r = "postgres", i = {}) => {
+	await T.runPromise(Xt(e, t, r, i).pipe(T.provide(n))), await f({
 		namespace: t,
 		dialect: r
 	});
-}, Ut = async (e, t, n = "postgres", r = {}) => {
-	await w.runPromise(w.gen(function* () {
-		let t = At(e, n), i = yield* E.SqlClient;
-		yield* Ie(i, Rt(i, t, n, r.retryFilter), { schema: r.lockSchema }).pipe(w.orDie);
-	}).pipe(w.provide(t)));
-}, I = (e) => {
+}, Qt = async (e, t, n = "postgres", r = {}) => {
+	await T.runPromise(T.gen(function* () {
+		let t = zt(e, n), i = yield* E.SqlClient;
+		yield* Ve(i, qt(i, t, n, r.retryFilter), { schema: r.lockSchema }).pipe(T.orDie);
+	}).pipe(T.provide(t)));
+}, L = (e) => {
 	if (typeof e != "object" || !e) return JSON.stringify(e);
-	if (Array.isArray(e)) return `[${e.map(I).join(",")}]`;
+	if (Array.isArray(e)) return `[${e.map(L).join(",")}]`;
 	let t = e;
-	return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${I(t[e])}`).join(",")}}`;
-}, Wt = (e) => {
+	return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${L(t[e])}`).join(",")}}`;
+}, $t = (e) => {
 	if (!e.hasDefault || e.defaultValue === void 0 || e.defaultValue === null) return null;
 	let t = e.defaultValue;
 	if (typeof t == "boolean") return t ? "__BOOL_TRUE__" : "__BOOL_FALSE__";
 	if (typeof t == "number") return String(t);
-	if (typeof t != "string") return I(t);
+	if (typeof t != "string") return L(t);
 	let n = t.trim(), r = n.toLowerCase().replace(/\s+/g, "");
 	if (r === "now" || r === "now()" || /^current_timestamp(\(\d*\))?$/.test(r) || r === "sysutcdatetime()" || r === "sysdatetime()" || r === "getutcdate()" || r === "getdate()") return "__NOW__";
 	let i = n.replace(/::[a-zA-Z0-9_ "]+$/, "").trim(), a = /^'(.*)'$/.test(i) ? i.slice(1, -1).replace(/''/g, "'") : i, o = /^cast\(\s*(?:_\w+\s*)?\\?'(.*?)\\?'\s+as\s+json\s*\)$/i.exec(a);
 	if (o) try {
-		return I(JSON.parse(o[1]));
+		return L(JSON.parse(o[1]));
 	} catch {}
 	let s = /^convert\(\s*(?:_\w+\s*)?\\?'(.*?)\\?'\s+using\s+[\w]+\s*\)$/i.exec(a);
 	if (s) try {
-		return I(JSON.parse(s[1]));
+		return L(JSON.parse(s[1]));
 	} catch {}
 	if (a.startsWith("{") || a.startsWith("[")) try {
-		return I(JSON.parse(a));
+		return L(JSON.parse(a));
 	} catch {}
 	return /^-?\d+(\.\d+)?$/.test(a) ? String(Number(a)) : a;
-}, Gt = (e) => {
-	let t = Wt(e);
+}, en = (e) => {
+	let t = $t(e);
 	return t === "1" || t === "true" ? "__BOOL_TRUE__" : t === "0" || t === "false" ? "__BOOL_FALSE__" : t;
-}, Kt = (e) => typeof e.defaultValue == "string" && /^nextval\(.+::regclass\)$/i.test(e.defaultValue.trim()), qt = (e) => {
+}, tn = (e) => typeof e.defaultValue == "string" && /^nextval\(.+::regclass\)$/i.test(e.defaultValue.trim()), nn = (e) => {
 	if (!e) return null;
 	let t = (e) => e === "restrict" ? "noAction" : e;
 	return {
@@ -867,26 +914,26 @@ BEGIN
 		onDelete: t(e.onDelete),
 		onUpdate: t(e.onUpdate)
 	};
-}, Jt = (e, t, n) => {
+}, rn = (e, t, n) => {
 	if (t === "mssql") {
-		let t = tt(e, n);
+		let t = ut(e, n);
 		if (t !== void 0) return t;
 	}
 	try {
-		let n = /^N?VARCHAR\((\d+)\)$/i.exec(M(e, t).trim());
+		let n = /^N?VARCHAR\((\d+)\)$/i.exec(N(e, t).trim());
 		return n ? Number(n[1]) : void 0;
 	} catch {
 		return;
 	}
-}, Yt = /'(?:''|[^'])*'|"(?:""|[^"])*"|\[(?:\]\]|[^\]])*\]|`(?:``|[^`])*`|[A-Za-z_][A-Za-z_0-9$]*|\d+(?:\.\d+)?|::|<>|!=|<=|>=|\|\||[^\s]/g, Xt = (e) => {
+}, an = /'(?:''|[^'])*'|"(?:""|[^"])*"|\[(?:\]\]|[^\]])*\]|`(?:``|[^`])*`|[A-Za-z_][A-Za-z_0-9$]*|\d+(?:\.\d+)?|::|<>|!=|<=|>=|\|\||[^\s]/g, on = (e) => {
 	let t = 0;
-	for (let n of e.matchAll(Yt)) if (n[0] === "(" && t++, n[0] === ")" && t--, t === 0 && n[0].toLowerCase() === "where") return e.slice(n.index + n[0].length).trim().replace(/;$/, "").trim();
-}, Zt = (e) => {
+	for (let n of e.matchAll(an)) if (n[0] === "(" && t++, n[0] === ")" && t--, t === 0 && n[0].toLowerCase() === "where") return e.slice(n.index + n[0].length).trim().replace(/;$/, "").trim();
+}, sn = (e) => {
 	if (e === void 0) return;
-	let t = e.match(Yt) ?? [], n = "(?:'(?:''|[^'])*'(?:\\s*::\\s*text)?|[0-9]+)", r = RegExp(`^\\s*${n}(?:\\s*,\\s*${n})*\\s*$`, "i");
+	let t = e.match(an) ?? [], n = "(?:'(?:''|[^'])*'(?:\\s*::\\s*text)?|[0-9]+)", r = RegExp(`^\\s*${n}(?:\\s*,\\s*${n})*\\s*$`, "i");
 	for (let e = 0; e < t.length - 5; e++) {
 		let n = t[e + 4];
-		t[e] === "=" && t[e + 1]?.toLowerCase() === "any" && t[e + 2] === "(" && t[e + 3]?.toLowerCase() === "array" && n.startsWith("[") && n.endsWith("]") && t[e + 5] === ")" && r.test(n.slice(1, -1)) && t.splice(e, 6, "in", "(", ...n.slice(1, -1).match(Yt) ?? [], ")");
+		t[e] === "=" && t[e + 1]?.toLowerCase() === "any" && t[e + 2] === "(" && t[e + 3]?.toLowerCase() === "array" && n.startsWith("[") && n.endsWith("]") && t[e + 5] === ")" && r.test(n.slice(1, -1)) && t.splice(e, 6, "in", "(", ...n.slice(1, -1).match(an) ?? [], ")");
 	}
 	let i = t.filter((e, n) => !(e === "::" && t[n - 1]?.startsWith("'") && t[n + 1]?.toLowerCase() === "text" || e.toLowerCase() === "text" && t[n - 1] === "::" && t[n - 2]?.startsWith("'"))).map((e) => {
 		if (e.startsWith("'")) return e;
@@ -924,22 +971,22 @@ BEGIN
 		return r;
 	};
 	return JSON.stringify(a(i));
-}, Qt = (e) => {
+}, cn = (e) => {
 	if (e == null) return e;
-	if (Array.isArray(e)) return e.map(Qt);
+	if (Array.isArray(e)) return e.map(cn);
 	if (typeof e != "object") return e;
 	let t = {};
 	for (let n of Object.keys(e).sort()) {
 		let r = e[n];
-		r !== void 0 && (t[n] = Qt(r));
+		r !== void 0 && (t[n] = cn(r));
 	}
 	return t;
-}, $t = (e) => {
-	if (!e.idScheme && !e.sensitive && !e.safe && !e.generatedAs) return e;
-	let { idScheme: t, sensitive: n, safe: r, generatedAs: i, ...a } = e;
-	return a;
-}, en = (e) => {
-	let t = $t(e), { references: n, defaultValue: r, hasDefault: i, oneOf: a, ...o } = t, s = t.type === "id" && Kt(t) ? null : Gt(t), c = qt(t.references);
+}, ln = (e) => {
+	if (!e.idScheme && !e.sensitive && !e.safe && !e.generatedAs && !e.jsonChecks) return e;
+	let { idScheme: t, sensitive: n, safe: r, generatedAs: i, jsonChecks: a, ...o } = e;
+	return o;
+}, un = (e) => {
+	let t = ln(e), { references: n, defaultValue: r, hasDefault: i, oneOf: a, ...o } = t, s = t.type === "id" && tn(t) ? null : en(t), c = nn(t.references);
 	return {
 		...o,
 		hasDefault: s !== null,
@@ -947,17 +994,18 @@ BEGIN
 		...c === null ? {} : { references: c },
 		...t.oneOf !== void 0 && t.oneOf.length > 0 ? { oneOf: [...t.oneOf].sort() } : {}
 	};
-}, tn = (e) => e.filter((e) => !x(e.name)).map(en).sort((e, t) => e.name.localeCompare(t.name)), nn = (e) => [...e].map((e) => e.where === void 0 ? e : {
-	...e,
-	where: Zt(e.where)
-}).sort((e, t) => e.name.localeCompare(t.name)), rn = (e) => [...e].map((e) => ({
+}, dn = (e) => e.filter((e) => !x(e.name)).map(un).sort((e, t) => e.name.localeCompare(t.name)), fn = (e) => [...e].map(({ kind: e, kindOptions: t, ...n }) => ({
+	...n,
+	...D(e, t),
+	...n.where === void 0 ? {} : { where: sn(n.where) }
+})).sort((e, t) => e.name.localeCompare(t.name)), pn = (e) => [...e].map((e) => ({
 	name: e.name,
-	columns: tn(e.columns),
-	indexes: nn(e.indexes)
-})).sort((e, t) => e.name.localeCompare(t.name)), L = (e) => {
-	let t = { tables: rn(e.tables) }, n = JSON.stringify(Qt(t));
-	return ne("sha256").update(n).digest("hex");
-}, an = (e) => e.slice(0, 16), on = (e, t) => {
+	columns: dn(e.columns),
+	indexes: fn(e.indexes)
+})).sort((e, t) => e.name.localeCompare(t.name)), R = (e) => {
+	let t = { tables: pn(e.tables) }, n = JSON.stringify(cn(t));
+	return ie("sha256").update(n).digest("hex");
+}, mn = (e) => e.slice(0, 16), hn = (e, t) => {
 	let n = t.references ? {
 		table: t.references().tableName,
 		column: t.referenceColumn ?? "id",
@@ -997,105 +1045,111 @@ BEGIN
 		...t.enumValues === void 0 ? {} : { enumValues: t.enumValues },
 		...t.spatial === void 0 ? {} : { spatial: t.spatial }
 	};
-}, sn = (e) => {
-	let t = [], n = /* @__PURE__ */ new Set(), i = (e) => {
-		n.has(e.name) || (n.add(e.name), t.push(e));
-	}, a = e.appliedPrimaryKey ?? [];
-	a.length > 0 ? i({
+}, gn = (e, t) => {
+	let n = [], i = /* @__PURE__ */ new Set(), a = (e) => {
+		i.has(e.name) || (i.add(e.name), n.push(e));
+	}, o = e.appliedPrimaryKey ?? [];
+	o.length > 0 ? a({
 		name: `${e.tableName}_pkey`,
 		table: e.tableName,
-		columns: [...a],
+		columns: [...o],
 		unique: !0
-	}) : e.fields.id && i({
+	}) : e.fields.id && a({
 		name: `${e.tableName}_pkey`,
 		table: e.tableName,
 		columns: ["id"],
 		unique: !0
 	});
-	let o = e.appliedIndexes ?? [];
-	for (let t of o) {
-		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})`), r = t.fields.some((e) => typeof e != "string");
-		i({
-			name: t.name,
+	let s = e.appliedIndexes ?? [];
+	for (let n of s) {
+		let r = ue(n.kind, t);
+		if (r === null) continue;
+		let i = n.fields[0], o = typeof i == "string" ? e.fields[i]?.vectorPrecision : void 0, s = r === "hnsw" ? { hnsw: le(n.kindOptions, o) } : void 0, c = n.fields.map((e) => typeof e == "string" ? e : "jsonPath" in e ? `(json:${e.jsonPath.column}->${e.jsonPath.path.join(".")}${e.jsonPath.numeric ? "::num" : ""})` : `(${e.expr})`), l = n.fields.some((e) => typeof e != "string");
+		a({
+			name: n.name,
 			table: e.tableName,
-			columns: n,
-			unique: t.unique ?? !1,
-			...t.where === void 0 ? {} : { where: t.where },
-			...r ? { expression: !0 } : {}
+			columns: c,
+			unique: n.unique ?? !1,
+			...D(r, s),
+			...n.where === void 0 ? {} : { where: n.where },
+			...l ? { expression: !0 } : {}
 		});
 	}
-	let s = e.appliedUniques ?? [];
-	for (let t of s) t.fields.length < 2 || i({
+	let c = e.appliedUniques ?? [];
+	for (let t of c) t.fields.length < 2 || a({
 		name: t.name,
 		table: e.tableName,
 		columns: t.fields,
 		unique: !0
 	});
-	let c = /* @__PURE__ */ new Set();
-	for (let e of o) e.fields.every((e) => typeof e == "string") && c.add(e.fields.join("\0"));
+	let l = /* @__PURE__ */ new Set();
+	for (let e of s) e.fields.every((e) => typeof e == "string") && l.add(e.fields.join("\0"));
 	for (let [t, n] of Object.entries(e.fields)) {
-		let a = n;
-		if (a.dropped || !a.references || a.fkAutoIndex === !1 || c.has(t)) continue;
+		let i = n;
+		if (i.dropped || !i.references || i.fkAutoIndex === !1 || l.has(t)) continue;
 		let o = `${e.tableName}_${t}_idx`;
-		r(e.tableName, o, !0, [t]), i({
+		r(e.tableName, o, !0, [t]), a({
 			name: o,
 			table: e.tableName,
 			columns: [t],
 			unique: !1
 		});
 	}
-	return t;
-}, cn = (e) => {
-	let t = new Set((e.appliedUniques ?? []).filter((e) => e.fields.length === 1).map((e) => e.fields[0])), n = [];
-	for (let [r, i] of Object.entries(e.fields)) {
+	return n;
+}, _n = (e, t) => {
+	let n = new Set((e.appliedUniques ?? []).filter((e) => e.fields.length === 1).map((e) => e.fields[0])), r = [];
+	for (let [t, i] of Object.entries(e.fields)) {
 		if (i.dropped) continue;
-		let e = on(r, i);
-		n.push(t.has(r) ? {
+		let e = hn(t, i);
+		r.push(n.has(t) ? {
 			...e,
 			unique: !0
 		} : e);
 	}
-	let r = e.appliedPrimaryKey ?? [], i = e.previousTableName;
+	let i = e.appliedPrimaryKey ?? [], a = e.previousTableName;
 	return {
 		name: e.tableName,
-		columns: n,
-		indexes: sn(e),
-		...r.length > 0 ? { primaryKey: [...r] } : {},
-		...i === void 0 ? {} : { renamedFrom: i }
+		columns: r,
+		indexes: gn(e, t),
+		...i.length > 0 ? { primaryKey: [...i] } : {},
+		...a === void 0 ? {} : { renamedFrom: a }
 	};
-}, ln = (e) => {
+}, vn = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e) for (let e of n.indexes) {
 		let r = t.get(e.name);
 		if (r !== void 0 && r !== n.name) throw Error(`duplicate index name '${e.name}' across tables '${r}' and '${n.name}'. Index names must be unique per SCHEMA, not just per table — the DB creates only one, so the other never applies and 'db plan' re-emits it forever. Give each an explicit, table-prefixed name (e.g. '${n.name}_${e.name}').`);
 		t.set(e.name, n.name);
 	}
-}, R = (e, t) => {
-	let n = e.filter((e) => !c(e.tableName)).map((e) => cn(pe(e, t)));
+}, z = (e, t) => {
+	let n = e.filter((e) => !c(e.tableName)).map((e) => _n(ve(e, t), t));
 	if (t === "mysql" || t === "mariadb") {
 		for (let e of n) for (let n of e.indexes) if (n.where !== void 0) throw Error(`Partial index '${n.name}' on '${e.name}' is not supported by ${t}. Use uniqueActive for portable conditional uniqueness.`);
 	}
-	return ln(n), { tables: t === void 0 ? n : n.map((e) => un(e, t)) };
-}, un = (e, t) => {
+	return vn(n), { tables: t === void 0 ? n : n.map((e) => yn(e, t)) };
+}, yn = (e, t) => {
 	let n = new Set(e.indexes.flatMap((e) => e.columns));
 	return {
 		...e,
 		columns: e.columns.map((e) => {
-			if (e.maxLength !== void 0) return e;
-			let r = Jt(e, t, n.has(e.name) || e.unique);
+			if (t === "mssql" && !e.generatedAs && (e.type === "json" || e.type === "array") && (e = {
+				...e,
+				jsonValidation: e.type === "json" ? "value" : "container"
+			}), e.maxLength !== void 0) return e;
+			let r = rn(e, t, n.has(e.name) || e.unique);
 			return r === void 0 ? e : {
 				...e,
 				maxLength: r
 			};
 		})
 	};
-}, dn = (e, t, n = A) => w.gen(function* () {
+}, bn = (e, t, n = j) => T.gen(function* () {
 	let r = (yield* e`
       SELECT p.prosrc
       FROM pg_proc p
       JOIN pg_namespace n ON n.oid = p.pronamespace
       WHERE n.nspname = current_schema()
-        AND p.proname = ${$e(n)}
+        AND p.proname = ${ct(n)}
     `)[0]?.prosrc, i = r !== void 0 && !r.includes("voltro:notify:v2"), a = t.filter((e) => !e.tableName.startsWith("_voltro_"));
 	if (a.length === 0) return {
 		missing: [],
@@ -1109,10 +1163,10 @@ BEGIN
       JOIN pg_namespace n ON n.oid = c.relnamespace
       WHERE NOT t.tgisinternal
         AND n.nspname = current_schema()
-        AND t.tgname LIKE ${`${Ze}%`}
+        AND t.tgname LIKE ${`${ot}%`}
     `, s = new Set(o.map((e) => e.tgname)), c = [], l = [];
 	for (let e of a) {
-		let t = s.has(Qe(e.tableName, n)), r = e.isReactive !== !1;
+		let t = s.has(st(e.tableName, n)), r = e.isReactive !== !1;
 		r && !t && c.push(e.tableName), !r && t && l.push(e.tableName);
 	}
 	return {
@@ -1120,7 +1174,7 @@ BEGIN
 		stale: l.sort(),
 		functionOutdated: i
 	};
-}), fn = (e) => {
+}), xn = (e) => {
 	let t = [];
 	if (e.missing.length > 0) {
 		let n = e.missing.slice(0, 8).join(", "), r = e.missing.length > 8 ? `, … (+${e.missing.length - 8})` : "";
@@ -1131,19 +1185,19 @@ BEGIN
 		t.push(`${e.stale.length} .nonReactive() table(s) still carry a change trigger — ${n}. They keep paying REPLICA IDENTITY FULL and a NOTIFY on every write for a subscription nobody receives. \`voltro db apply\` removes them.`);
 	}
 	return e.functionOutdated && t.push("The change-notify function in this database is OLDER than the framework installed here. Its triggers fire, so nothing looks wrong — but a row too large for a NOTIFY payload (postgres caps it at 8000 bytes) is emitted without its primary key, and a change that carries no key cannot be re-read: it reaches subscriptions as a re-query and reaches every TAP — search index, analytics mirror, cdc-out, row history — as nothing at all. Run `voltro db apply` to replace it."), t.length > 0 ? t.join("\n") : void 0;
-}, pn = {
+}, Sn = {
 	postgres: !0,
 	mysql: !0,
 	mariadb: !0,
 	mssql: !0,
 	sqlite: !0
-}, mn = {
+}, Cn = {
 	postgres: !0,
 	mysql: !1,
 	mariadb: !1,
 	mssql: !0,
 	sqlite: !0
-}, hn = (e) => {
+}, wn = (e) => {
 	switch (e) {
 		case "add-column":
 		case "drop-column":
@@ -1153,33 +1207,33 @@ BEGIN
 		case "add-foreign-key":
 		case "add-unique":
 		case "add-unique-composite":
-		case "add-check": return mn;
-		default: return pn;
+		case "add-check": return Cn;
+		default: return Sn;
 	}
-}, gn = (e, t) => {
+}, Tn = (e, t) => {
 	let n = new Map(t.tables.map((e) => [e.name, e]));
 	return new Map(e.map((e) => [e.tableName, {
 		table: e,
 		snapshot: n.get(e.tableName),
 		columnDefs: e.fields
 	}]));
-}, _n = (e, t) => {
-	let n = Wt(e), r = Wt(t);
+}, En = (e, t) => {
+	let n = $t(e), r = $t(t);
 	if (n === r) return !0;
-	let i = Kt, a = (e) => e.type === "id" && e.idScheme?.kind === "numeric";
-	return e.type === "id" && t.type === "id" && (a(e) && n === null && i(t) || a(t) && r === null && i(e)) ? !0 : Gt(e) === Gt(t);
-}, vn = (e, t) => {
+	let i = tn, a = (e) => e.type === "id" && e.idScheme?.kind === "numeric";
+	return e.type === "id" && t.type === "id" && (a(e) && n === null && i(t) || a(t) && r === null && i(e)) ? !0 : en(e) === en(t);
+}, Dn = (e, t) => {
 	let n = e && e.length > 0 ? e : void 0, r = t && t.length > 0 ? t : void 0;
 	if (!n && !r) return !0;
 	if (!n || !r || n.length !== r.length) return !1;
 	let i = [...n].sort(), a = [...r].sort();
 	return i.every((e, t) => e === a[t]);
-}, yn = (e, t, n, r) => n === void 0 || m(n) ? !0 : e.type !== "text" || t.type !== "text" || Jt(e, n, r) === t.maxLength, bn = (e, t, n, r) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && _n(e, t) && yn(e, t, n, r) && (e.type !== "reference" || (e.referenceStorage ?? "text") === (t.referenceStorage ?? "text")) && JSON.stringify(qt(e.references)) === JSON.stringify(qt(t.references)) && vn(e.oneOf, t.oneOf), xn = (e, t) => t.oneOf && t.oneOf.length > 0 ? z({
+}, On = (e, t, n, r) => n === void 0 || m(n) ? !0 : e.type !== "text" || t.type !== "text" || rn(e, n, r) === t.maxLength, kn = (e, t, n, r) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && e.jsonValidation === t.jsonValidation && En(e, t) && On(e, t, n, r) && (e.type !== "reference" || (e.referenceStorage ?? "text") === (t.referenceStorage ?? "text")) && JSON.stringify(nn(e.references)) === JSON.stringify(nn(t.references)) && Dn(e.oneOf, t.oneOf), An = (e, t) => t.oneOf && t.oneOf.length > 0 ? B({
 	kind: "add-check",
 	table: e,
 	column: t.name,
 	values: t.oneOf
-}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0, Sn = (e, t) => e.unique === t.unique && e.valid !== !1 && t.valid !== !1 && Zt(e.where) === Zt(t.where) && (e.expression || t.expression ? !0 : e.columns.length === t.columns.length && e.columns.every((e, n) => e === t.columns[n])), Cn = (e, t, n) => {
+}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0, jn = (e, t) => e.unique === t.unique && e.valid !== !1 && t.valid !== !1 && sn(e.where) === sn(t.where) && JSON.stringify(D(e.kind, e.kindOptions)) === JSON.stringify(D(t.kind, t.kindOptions)) && (e.expression || t.expression ? !0 : e.columns.length === t.columns.length && e.columns.every((e, n) => e === t.columns[n])), Mn = (e, t, n) => {
 	let r = new Map(t.columns.map((e) => [e.name, e])), i = new Map(e.columns.map((e) => [e.name, e])), a = [], o = [], s = [], c = new Set(e.indexes.flatMap((e) => e.columns));
 	for (let t of e.columns) {
 		let e = r.get(t.name);
@@ -1187,7 +1241,7 @@ BEGIN
 			a.push(t);
 			continue;
 		}
-		bn(t, e, n, c.has(t.name) || t.unique) || s.push({
+		kn(t, e, n, c.has(t.name) || t.unique) || s.push({
 			declared: t,
 			live: e
 		});
@@ -1198,50 +1252,50 @@ BEGIN
 		removed: o,
 		changed: s
 	};
-}, wn = (e, t, n) => {
+}, Nn = (e, t, n) => {
 	let r = (e) => n === "turso" || n === "sqlite" ? e.toLowerCase() : e, i = new Map(t.indexes.map((e) => [r(e.name), e])), a = new Map(e.indexes.map((e) => [r(e.name), e])), o = [], s = [];
 	for (let t of e.indexes) {
 		let e = i.get(r(t.name));
-		(!e || !Sn(t, e)) && o.push(t);
+		(!e || !jn(t, e)) && o.push(t);
 	}
 	for (let e of t.indexes) {
 		let t = a.get(r(e.name));
-		(!t || (e.where !== void 0 || t.where !== void 0) && !Sn(t, e)) && s.push(e);
+		(!t || !jn(t, e)) && s.push(e);
 	}
 	return {
 		added: o,
 		removed: s
 	};
-}, z = (e, t, n, r) => ({
+}, B = (e, t, n, r) => ({
 	op: e,
 	classification: t,
-	atomicByDialect: hn(e.kind),
+	atomicByDialect: wn(e.kind),
 	...n ? { reason: n } : {},
 	...r ? { blocked: r } : {}
-}), Tn = (e, t, n) => {
+}), Pn = (e, t, n) => {
 	let r = {
 		kind: "add-column",
 		table: e,
 		column: t
 	};
-	return t.nullable ? z(r, "safe", "nullable column add — no backfill needed") : t.hasDefault && t.defaultValue !== void 0 ? z(r, "needs-default", "NOT NULL with literal default — DDL DEFAULT will populate existing rows") : n?.backfill ? z(r, "needs-backfill", `backfill declared (kind=${n.backfill.kind}) — applier will run 3-step add/update/set-not-null`) : z(r, "needs-backfill", "NOT NULL column on a table whose row count is unknown", { fix: `declare \`${t.name}: <type>().backfill(sql\`...\`)\` OR \`.default(value)\` so existing rows survive the migration` });
-}, En = (e, t, n) => {
+	return t.nullable ? B(r, "safe", "nullable column add — no backfill needed") : t.hasDefault && t.defaultValue !== void 0 ? B(r, "needs-default", "NOT NULL with literal default — DDL DEFAULT will populate existing rows") : n?.backfill ? B(r, "needs-backfill", `backfill declared (kind=${n.backfill.kind}) — applier will run 3-step add/update/set-not-null`) : B(r, "needs-backfill", "NOT NULL column on a table whose row count is unknown", { fix: `declare \`${t.name}: <type>().backfill(sql\`...\`)\` OR \`.default(value)\` so existing rows survive the migration` });
+}, Fn = (e, t, n) => {
 	let r = {
 		kind: "drop-column",
 		table: e,
 		column: t.name
 	};
-	return n?.dropped ? z(r, "lossy", `column dropped via \`${t.name}: dropped()\` marker — intentional`) : z(r, "lossy", "column missing from declared schema", { fix: `if intentional, add \`${t.name}: dropped()\` to the schema. If a typo, restore the field` });
-}, Dn = (e, t, n, r, i) => z({
+	return n?.dropped ? B(r, "lossy", `column dropped via \`${t.name}: dropped()\` marker — intentional`) : B(r, "lossy", "column missing from declared schema", { fix: `if intentional, add \`${t.name}: dropped()\` to the schema. If a typo, restore the field` });
+}, In = (e, t, n, r, i) => B({
 	kind: "create-table",
 	table: e,
 	columns: t,
 	indexes: n,
 	...r && r.length > 0 ? { primaryKey: r } : {}
-}, "safe", i ?? "new table — no data to preserve"), On = (e) => z({
+}, "safe", i ?? "new table — no data to preserve"), Ln = (e) => B({
 	kind: "drop-table",
 	table: e
-}, "lossy", "table missing from declared schema", { fix: "if intentional, set VOLTRO_DESTRUCTIVE_OK=1 OR add a file-based migration. If a typo, restore the table declaration" }), kn = 5e4, An = (e, t, n, r) => {
+}, "lossy", "table missing from declared schema", { fix: "if intentional, set VOLTRO_DESTRUCTIVE_OK=1 OR add a file-based migration. If a typo, restore the table declaration" }), Rn = 5e4, zn = (e, t, n, r) => {
 	let i = (n ?? 0) >= r, a;
 	return a = !t.unique || t.where !== void 0 ? {
 		kind: "add-index",
@@ -1256,28 +1310,28 @@ BEGIN
 		table: e,
 		name: t.name,
 		fields: t.columns
-	}, i ? z(a, "online-required", `online build on ${n} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : z(a, "safe", t.where === void 0 ? t.unique ? t.columns.length === 1 ? "add unique constraint" : "add composite UNIQUE constraint" : "add B-tree index" : `add ${t.unique ? "unique " : ""}partial index`);
-}, jn = (e, t) => t.unique && t.where === void 0 && t.columns.length > 1 ? z({
+	}, i ? B(a, "online-required", `online build on ${n} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : B(a, "safe", t.where === void 0 ? t.unique ? t.columns.length === 1 ? "add unique constraint" : "add composite UNIQUE constraint" : `add ${t.kind === void 0 || t.kind === "btree" ? "B-tree" : t.kind.toUpperCase()} index` : `add ${t.unique ? "unique " : ""}partial index`);
+}, Bn = (e, t) => t.unique && t.where === void 0 && t.columns.length > 1 ? B({
 	kind: "drop-unique-composite",
 	table: e,
 	name: t.name
-}, "safe", "drop composite UNIQUE constraint (no data loss — constraint is derived metadata)") : z({
+}, "safe", "drop composite UNIQUE constraint (no data loss — constraint is derived metadata)") : B({
 	kind: "drop-index",
 	table: e,
 	index: t.name
-}, "safe", "drop index (no data loss — index is derived data)"), Mn = (e, t) => {
+}, "safe", "drop index (no data loss — index is derived data)"), Vn = (e, t) => {
 	let n = e.type;
 	if (n === "reference") return e.referenceStorage === "numeric" ? "bigint" : "text";
 	switch (t) {
 		case "sqlite":
 		case "turso": return n === "timestamp" || n === "date" || n === "json" ? "text" : n === "boolean" ? "integer" : n === "decimal" ? "text" : n === "bigint" ? "integer" : n;
-		case "mssql": return n === "json" ? "text" : n;
+		case "mssql": return n === "json" || n === "array" ? "text" : n;
 		default: return n;
 	}
-}, Nn = (e, t, n) => {
+}, Hn = (e, t, n) => {
 	let r = `acknowledge it on the column: \`.narrowedFrom('${e}')\``;
 	return n === "postgres" ? `${r} — add \`{ using: '${t.name}::${t.type}' }\` when the cast is not implicit, or use a file-based migration` : `${r} — ${n === void 0 ? "this dialect" : n} converts in place (\`using\` is postgres-only and is ignored here), so verify the conversion is value-preserving for your data, or use a file-based migration`;
-}, Pn = (e, t, n, r, i, a) => {
+}, Un = (e, t, n, r, i, a) => {
 	let o = [];
 	if (t.nullable !== n.nullable) {
 		let n = {
@@ -1286,7 +1340,7 @@ BEGIN
 			column: t.name,
 			toNullable: t.nullable
 		};
-		o.push(t.nullable ? z(n, "safe", `loosen ${e}.${t.name} to nullable`) : z(n, "needs-backfill", `tighten ${e}.${t.name} to NOT NULL — existing rows must already be non-null`));
+		o.push(t.nullable ? B(n, "safe", `loosen ${e}.${t.name} to nullable`) : B(n, "needs-backfill", `tighten ${e}.${t.name} to NOT NULL — existing rows must already be non-null`));
 	}
 	if (t.unique !== n.unique) {
 		if (t.unique) {
@@ -1295,14 +1349,14 @@ BEGIN
 				table: e,
 				column: t.name
 			}, r = (i ?? 0) >= a;
-			o.push(r ? z(n, "online-required", `online unique build on ${i} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : z(n, "safe", `add unique constraint on ${e}.${t.name} — existing rows must already be distinct (else the DB rejects at migrate)`));
-		} else o.push(z({
+			o.push(r ? B(n, "online-required", `online unique build on ${i} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : B(n, "safe", `add unique constraint on ${e}.${t.name} — existing rows must already be distinct (else the DB rejects at migrate)`));
+		} else o.push(B({
 			kind: "drop-unique",
 			table: e,
 			column: t.name
 		}, "safe", `drop unique constraint on ${e}.${t.name} — constraint is derived metadata, no data loss`));
 	}
-	if (Mn(t, r) !== Mn(n, r)) {
+	if (Vn(t, r) !== Vn(n, r)) {
 		let i = t.narrowedFrom;
 		if (i && i.from === n.type) {
 			let r = {
@@ -1313,7 +1367,7 @@ BEGIN
 				to: t.type,
 				...i.using === void 0 ? {} : { using: i.using }
 			};
-			o.push(z(r, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${i.from}') declared` + (i.using ? ` with USING ${i.using}` : " (implicit cast)")));
+			o.push(B(r, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${i.from}') declared` + (i.using ? ` with USING ${i.using}` : " (implicit cast)")));
 		} else {
 			let i = {
 				kind: "alter-column-type",
@@ -1322,12 +1376,12 @@ BEGIN
 				from: n.type,
 				to: t.type
 			};
-			o.push(z(i, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: Nn(n.type, t, r) }));
+			o.push(B(i, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: Hn(n.type, t, r) }));
 		}
 	}
 	if (t.type === "text" && n.type === "text" && !m(r ?? "postgres") && t.maxLength !== n.maxLength) {
 		let r = t.maxLength === void 0 || n.maxLength !== void 0 && t.maxLength > n.maxLength, i = n.maxLength === void 0 ? "unbounded" : `varchar(${n.maxLength})`, a = t.maxLength === void 0 ? "unbounded" : `varchar(${t.maxLength})`;
-		o.push(z({
+		o.push(B({
 			kind: "alter-column-type",
 			table: e,
 			column: t.name,
@@ -1335,7 +1389,7 @@ BEGIN
 			to: "text"
 		}, r ? "safe" : "needs-backfill", r ? `text length ${i} → ${a} on ${e}.${t.name} — widening, no data can be lost` : `text length ${i} → ${a} on ${e}.${t.name} — NARROWING; the ALTER fails if any existing value is longer than ${String(t.maxLength)}. Check first: SELECT COUNT(*) FROM ${e} WHERE LENGTH(${t.name}) > ${String(t.maxLength)}`));
 	}
-	if (!_n(t, n)) {
+	if (!En(t, n)) {
 		let n = {
 			kind: "alter-column-default",
 			table: e,
@@ -1343,23 +1397,34 @@ BEGIN
 			hasDefault: t.hasDefault,
 			...t.defaultValue === void 0 ? {} : { defaultValue: t.defaultValue }
 		};
-		o.push(z(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
+		o.push(B(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
+	}
+	if (r === "mssql" && t.jsonValidation !== void 0 && t.jsonValidation !== "unverified" && t.jsonValidation !== n.jsonValidation) {
+		let r = t.jsonValidation === "value" && n.jsonValidation === "container";
+		o.push(B({
+			kind: "reconcile-json-check",
+			table: e,
+			column: t.name,
+			validation: t.jsonValidation,
+			previousValidation: n.jsonValidation ?? "absent",
+			dropConstraints: (n.jsonChecks ?? []).map((e) => e.name).sort()
+		}, r ? "safe" : "needs-backfill", r ? `allow every JSON value on ${e}.${t.name}; preserve existing rows` : `validate existing JSON on ${e}.${t.name}; invalid rows refuse the migration without being rewritten`));
 	}
-	if (!vn(t.oneOf, n.oneOf)) {
-		n.oneOf && n.oneOf.length > 0 && o.push(z({
+	if (!Dn(t.oneOf, n.oneOf)) {
+		n.oneOf && n.oneOf.length > 0 && o.push(B({
 			kind: "drop-check",
 			table: e,
 			column: t.name
 		}, "safe", `drop stale enum CHECK on ${e}.${t.name}`));
-		let r = xn(e, t);
+		let r = An(e, t);
 		r && o.push(r);
 	}
-	return JSON.stringify(qt(t.references)) !== JSON.stringify(qt(n.references)) && (n.references && o.push(z({
+	return JSON.stringify(nn(t.references)) !== JSON.stringify(nn(n.references)) && (n.references && o.push(B({
 		kind: "drop-foreign-key",
 		table: e,
 		column: t.name
-	}, "safe", `drop FK on ${e}.${t.name} (→ ${n.references.table})`)), o.push(...Fn(e, t))), o;
-}, Fn = (e, t) => {
+	}, "safe", `drop FK on ${e}.${t.name} (→ ${n.references.table})`)), o.push(...Wn(e, t))), o;
+}, Wn = (e, t) => {
 	let n = [];
 	if (!t.references) return n;
 	let r = t.references.table, i = t.references.orphanPolicy ?? "fail", a = {
@@ -1371,15 +1436,15 @@ BEGIN
 		...t.references.onDelete ? { onDelete: t.references.onDelete } : {},
 		...t.references.onUpdate ? { onUpdate: t.references.onUpdate } : {}
 	};
-	return i === "null" && !t.nullable ? n.push(z(a, "lossy", `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' needs a nullable column (the NULL-out would violate NOT NULL)`, { fix: `make ${t.name} \`.nullable()\`, OR use \`orphanPolicy: 'delete'\`, OR clean the orphans and drop the policy` })) : i === "null" || i === "delete" ? n.push(z({
+	return i === "null" && !t.nullable ? n.push(B(a, "lossy", `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' needs a nullable column (the NULL-out would violate NOT NULL)`, { fix: `make ${t.name} \`.nullable()\`, OR use \`orphanPolicy: 'delete'\`, OR clean the orphans and drop the policy` })) : i === "null" || i === "delete" ? n.push(B({
 		...a,
 		orphanPolicy: i
-	}, "lossy", i === "delete" ? `add FK ${e}.${t.name} → ${r}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${r}` : `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${r}`)) : n.push(z(a, "needs-backfill", `add FK ${e}.${t.name} → ${r} — existing rows must already reference a valid ${r} (else set orphanPolicy:'null'/'delete')`)), n;
-}, In = (e, t, n) => {
+	}, "lossy", i === "delete" ? `add FK ${e}.${t.name} → ${r}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${r}` : `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${r}`)) : n.push(B(a, "needs-backfill", `add FK ${e}.${t.name} → ${r} — existing rows must already reference a valid ${r} (else set orphanPolicy:'null'/'delete')`)), n;
+}, Gn = (e, t, n) => {
 	let r = [], i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = new Set(n.removed.map((e) => e.name)), s = new Set(n.added.map((e) => e.name));
 	for (let [n, c] of Object.entries(t)) {
 		let t = c.renamedFrom;
-		t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(z({
+		t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(B({
 			kind: "rename-column",
 			table: e.tableName,
 			from: t,
@@ -1391,30 +1456,30 @@ BEGIN
 		consumedAddedNames: i,
 		consumedRemovedNames: a
 	};
-}, Ln = /* @__PURE__ */ new Set([
+}, Kn = /* @__PURE__ */ new Set([
 	"postgres",
 	"mysql",
 	"mariadb",
 	"mssql"
-]), Rn = {
+]), qn = {
 	ops: [],
 	consumedAddedNames: /* @__PURE__ */ new Set(),
 	consumedRemovedNames: /* @__PURE__ */ new Set()
-}, zn = (e) => !e.unique && !e.expression && e.where === void 0, Bn = (e, t, n, r, i) => {
-	if (i === void 0 || !Ln.has(i)) return Rn;
-	let a = t.added.filter((e) => zn(e) && !r.has(e.name));
-	if (a.length === 0) return Rn;
+}, Jn = (e) => !e.unique && !e.expression && e.where === void 0 && (e.kind === void 0 || e.kind === "btree"), Yn = (e, t, n, r, i) => {
+	if (i === void 0 || !Kn.has(i)) return qn;
+	let a = t.added.filter((e) => Jn(e) && !r.has(e.name));
+	if (a.length === 0) return qn;
 	let o = (e) => e.columns.map((e) => n.get(e) ?? e).join("\0"), s = (e) => e.columns.join("\0"), c = [], l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Set();
 	for (let n of t.removed) {
-		if (!zn(n)) continue;
-		let t = o(n), r = a.filter((e) => !l.has(e.name) && s(e) === t);
-		if (r.length !== 1) continue;
-		let i = r[0];
-		i.name !== n.name && (l.add(i.name), u.add(n.name), c.push(z({
+		if (!Jn(n) || t.added.some((e) => e.name === n.name)) continue;
+		let r = o(n), i = a.filter((e) => !l.has(e.name) && s(e) === r);
+		if (i.length !== 1) continue;
+		let d = i[0];
+		d.name !== n.name && (l.add(d.name), u.add(n.name), c.push(B({
 			kind: "rename-index",
 			table: e,
 			from: n.name,
-			to: i.name
+			to: d.name
 		}, "safe", "rename index in place — catalog-only, no rebuild")));
 	}
 	return {
@@ -1422,7 +1487,7 @@ BEGIN
 		consumedAddedNames: l,
 		consumedRemovedNames: u
 	};
-}, Vn = (e, t, n) => {
+}, Xn = (e, t, n) => {
 	let r = [], i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
 	for (let t of e.tables) t.renamedFrom !== void 0 && (s.set(t.renamedFrom, (s.get(t.renamedFrom) ?? 0) + 1), c.add(t.renamedFrom));
 	for (let c of e.tables) {
@@ -1433,7 +1498,7 @@ BEGIN
 				continue;
 			}
 			if (t.has(c.name)) {
-				r.push(z({
+				r.push(B({
 					kind: "rename-table",
 					from: e,
 					to: c.name
@@ -1441,14 +1506,14 @@ BEGIN
 				continue;
 			}
 			if ((s.get(e) ?? 0) !== 1) {
-				r.push(z({
+				r.push(B({
 					kind: "rename-table",
 					from: e,
 					to: c.name
 				}, "needs-rename-annotation", `.renamedFrom('${e}') is claimed by ${s.get(e)} tables — nothing says which receives its rows`, { fix: `remove the \`.renamedFrom('${e}')\` marker from all but one of them.` }));
 				continue;
 			}
-			i.set(c.name, e), a.add(e), r.push(z({
+			i.set(c.name, e), a.add(e), r.push(B({
 				kind: "rename-table",
 				from: e,
 				to: c.name
@@ -1462,19 +1527,19 @@ BEGIN
 		claimedOldNames: c,
 		refusals: o
 	};
-}, Hn = (e, t, n, r) => {
+}, Zn = (e, t, n, r) => {
 	if (t === void 0) return {
 		live: e,
 		ops: []
 	};
-	let i = r !== void 0 && Ln.has(r), a = [], o = e.indexes.map((e) => {
+	let i = r !== void 0 && Kn.has(r), a = [], o = e.indexes.map((e) => {
 		if (!e.name.startsWith(t)) return e;
 		let r = `${n}${e.name.slice(t.length)}`;
 		return r === e.name ? e : e.name === `${t}_pkey` ? {
 			...e,
 			name: r,
 			table: n
-		} : i ? (a.push(z({
+		} : i ? (a.push(B({
 			kind: "rename-index",
 			table: n,
 			from: e.name,
@@ -1493,7 +1558,7 @@ BEGIN
 		},
 		ops: a
 	};
-}, Un = (e) => {
+}, Qn = (e) => {
 	let t = {
 		safe: 0,
 		needsDefault: 0,
@@ -1526,13 +1591,13 @@ BEGIN
 		case "multi-step": t.multiStep++;
 	}
 	return t;
-}, Wn = (e) => {
-	let t = R(e.declared, e.dialect), n = gn(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? kn, a = [], o = Vn(t, r, n);
+}, $n = (e) => {
+	let t = z(e.declared, e.dialect), n = Tn(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? Rn, a = [], o = Xn(t, r, n);
 	a.push(...o.ops);
 	for (let e of t.tables) if (!o.renamedInto.has(e.name) && !r.has(e.name)) {
-		a.push(Dn(e.name, e.columns, e.indexes, e.primaryKey, o.refusals.get(e.name)));
+		a.push(In(e.name, e.columns, e.indexes, e.primaryKey, o.refusals.get(e.name)));
 		for (let t of e.columns) {
-			let n = xn(e.name, t);
+			let n = An(e.name, t);
 			n && a.push(n);
 		}
 	}
@@ -1554,32 +1619,40 @@ BEGIN
 			c.push(t.name);
 			continue;
 		}
-		a.push(On(t.name));
+		a.push(Ln(t.name));
 	}
 	for (let s of t.tables) {
 		let t = o.renamedInto.get(s.name), c = r.get(s.name) ?? (t === void 0 ? void 0 : r.get(t));
 		if (!c) continue;
-		let l = Hn(c, t, s.name, e.dialect);
+		let l = Zn(c, t, s.name, e.dialect);
 		a.push(...l.ops);
-		let u = l.live, d = n.get(s.name), f = Cn(s, u, e.dialect), p = wn(s, u, e.dialect), m = In(d.table, d.columnDefs, f);
+		let u = l.live, d = n.get(s.name), f = Mn(s, u, e.dialect), p = Nn(s, u, e.dialect), m = Gn(d.table, d.columnDefs, f);
 		a.push(...m.ops);
+		for (let { op: t } of m.ops) {
+			if (t.kind !== "rename-column") continue;
+			let n = s.columns.find((e) => e.name === t.to), r = u.columns.find((e) => e.name === t.from);
+			n && r && a.push(...Un(s.name, n, {
+				...r,
+				name: t.to
+			}, e.dialect, u.rowCount, i));
+		}
 		for (let e of f.removed) {
 			if (m.consumedRemovedNames.has(e.name) || x(e.name)) continue;
 			let t = d.columnDefs[e.name];
-			a.push(En(s.name, e, t));
+			a.push(Fn(s.name, e, t));
 		}
 		for (let e of f.added) {
 			if (m.consumedAddedNames.has(e.name)) continue;
 			let t = d.columnDefs[e.name];
-			a.push(Tn(s.name, e, t));
-			let n = xn(s.name, e);
-			n && a.push(n), a.push(...Fn(s.name, e));
+			a.push(Pn(s.name, e, t));
+			let n = An(s.name, e);
+			n && a.push(n), a.push(...Wn(s.name, e));
 		}
-		let h = new Map(m.ops.flatMap((e) => e.op.kind === "rename-column" ? [[e.op.from, e.op.to]] : [])), g = Bn(s.name, p, h, new Set(u.indexes.map((e) => e.name)), e.dialect);
+		let h = new Map(m.ops.flatMap((e) => e.op.kind === "rename-column" ? [[e.op.from, e.op.to]] : [])), g = Yn(s.name, p, h, new Set(u.indexes.map((e) => e.name)), e.dialect);
 		a.push(...g.ops);
-		for (let e of p.added) g.consumedAddedNames.has(e.name) || a.push(An(s.name, e, u.rowCount, i));
-		for (let e of p.removed) g.consumedRemovedNames.has(e.name) || a.push(jn(s.name, e));
-		for (let { declared: t, live: n } of f.changed) a.push(...Pn(s.name, t, n, e.dialect, u.rowCount, i));
+		for (let e of p.added) g.consumedAddedNames.has(e.name) || a.push(zn(s.name, e, u.rowCount, i));
+		for (let e of p.removed) g.consumedRemovedNames.has(e.name) || a.push(Bn(s.name, e));
+		for (let { declared: t, live: n } of f.changed) a.push(...Un(s.name, t, n, e.dialect, u.rowCount, i));
 	}
 	let l = new Set(a.flatMap((e) => e.op.kind === "create-table" ? [e.op.table] : [])), u = new Map(t.tables.map((e) => [e.name, e])), d = (e) => {
 		let t = u.get(e);
@@ -1587,8 +1660,8 @@ BEGIN
 			column: e.name,
 			target: e.references.table
 		}] : []) : [];
-	}, f = me([...l], d), p = [];
-	for (let e of t.tables) if (l.has(e.name)) for (let t of e.columns) t.references && f.has(D(e.name, t.name)) && p.push(z({
+	}, f = ye([...l], d), p = [];
+	for (let e of t.tables) if (l.has(e.name)) for (let t of e.columns) t.references && f.has(O(e.name, t.name)) && p.push(B({
 		kind: "add-foreign-key",
 		table: e.name,
 		column: t.name,
@@ -1603,8 +1676,8 @@ BEGIN
 			let n = a[t];
 			if (n.op.kind !== "create-table") continue;
 			let r = n.op;
-			if (!r.columns.some((e) => f.has(D(r.table, e.name)))) continue;
-			let i = r.columns.map((t) => f.has(D(r.table, t.name)) ? e(t) : t);
+			if (!r.columns.some((e) => f.has(O(r.table, e.name)))) continue;
+			let i = r.columns.map((t) => f.has(O(r.table, t.name)) ? e(t) : t);
 			a[t] = {
 				...n,
 				op: {
@@ -1624,7 +1697,7 @@ BEGIN
 		let i = new Set(t).add(e), a = 0;
 		for (let t of r.columns) {
 			let n = t.references?.table;
-			n && n !== e && !f.has(D(e, t.name)) && (a = Math.max(a, g(n, i) + 1));
+			n && n !== e && !f.has(O(e, t.name)) && (a = Math.max(a, g(n, i) + 1));
 		}
 		return h.set(e, a), a;
 	}, v = (e) => e === "rename-table" ? -1 : e === "create-table" ? 0 : e === "drop-table" ? 2 : 1, y = (e) => {
@@ -1647,7 +1720,8 @@ BEGIN
 		"add-unique": 5,
 		"add-unique-composite": 5,
 		"add-foreign-key": 5,
-		"add-check": 5
+		"add-check": 5,
+		"reconcile-json-check": 5
 	}, S = (e) => b[e] ?? 9, C = [...a].sort((e, t) => {
 		let n = v(e.op.kind), r = v(t.op.kind);
 		if (n !== r) return n - r;
@@ -1663,19 +1737,34 @@ BEGIN
 	for (let e of t.tables) {
 		if (w.has(e.name) || o.renamedInto.has(e.name)) continue;
 		let t = r.get(e.name);
-		t !== void 0 && L({ tables: [t] }) !== L({ tables: [e] }) && T.push(e.name);
+		t !== void 0 && R({ tables: [t] }) !== R({ tables: [e] }) && T.push(e.name);
 	}
 	return {
 		operations: C,
-		fromFingerprint: L(e.live),
-		toFingerprint: L(t),
-		summary: Un(C),
+		fromFingerprint: R(e.live),
+		toFingerprint: R(t),
+		summary: Qn(C),
 		fingerprintDivergence: {
 			outsideDiff: c,
 			diffEquivalent: T
 		}
 	};
-}, Gn = (e) => {
+}, er = (e, t) => {
+	let n = (e.match(/'(?:''|[^'])*'|"(?:""|[^"])*"|::|[A-Za-z_][A-Za-z_0-9$]*|[^\s]/g) ?? []).filter((e) => e !== "(" && e !== ")"), r = 0, i = (e) => n[r]?.toLowerCase() === e && (r++, !0);
+	if (!i("check")) return null;
+	let a = n[r++];
+	if (a === void 0 || (a.startsWith("\"") ? a.slice(1, -1).replace(/""/g, "\"") : a.toLowerCase()) !== t) return null;
+	let o = () => !i("::") || i("text") || i("character") && i("varying");
+	if (!o() || !i("=")) return null;
+	let s = i("any");
+	if (s && (!i("array") || !i("["))) return null;
+	let c = [];
+	do {
+		let e = n[r++];
+		if (e === void 0 || !/^'(?:''|[^'])*'$/.test(e) || (c.push(e.slice(1, -1).replace(/''/g, "'")), !o())) return null;
+	} while (s && i(","));
+	return s && (!i("]") || i("::") && (!i("text") || !i("[") || !i("]"))) ? null : r === n.length ? c : null;
+}, tr = (e) => {
 	let t = /[`"[]?([A-Za-z_][A-Za-z0-9_]*)[`"\]]?\s*(?:in\b|=)/i.exec(e);
 	if (!t) return null;
 	let n = [...e.replace(/\\'/g, "'").matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'")).filter((e) => e.length > 0);
@@ -1683,8 +1772,8 @@ BEGIN
 		column: t[1],
 		values: n
 	};
-}, Kn = (e, t) => {
-	if (t === "vector") return "vector";
+}, nr = (e, t) => {
+	if (t === "vector" || t === "halfvec") return "vector";
 	switch (e) {
 		case "text":
 		case "character varying":
@@ -1710,10 +1799,10 @@ BEGIN
 		case "USER-DEFINED": return "text";
 		default: return "text";
 	}
-}, qn = (e, t) => e == null || e === "" ? void 0 : { generatedAs: {
+}, rr = (e, t) => e == null || e === "" ? void 0 : { generatedAs: {
 	expr: e,
 	stored: t
-} }, B = (e) => {
+} }, V = (e) => {
 	switch (e.toUpperCase()) {
 		case "CASCADE": return "cascade";
 		case "RESTRICT": return "restrict";
@@ -1721,25 +1810,25 @@ BEGIN
 		case "SET DEFAULT": return "noAction";
 		default: return "noAction";
 	}
-}, Jn = (e, t) => {
+}, ir = (e, t) => {
 	let n = e !== void 0 && e !== "" ? Number(e) : NaN;
 	return Number.isInteger(n) && n > 0 ? n : t;
-}, Yn = () => Jn(process.env.VOLTRO_INTROSPECT_BATCH, 20), Xn = 300, Zn = () => {
+}, ar = () => ir(process.env.VOLTRO_INTROSPECT_BATCH, 20), or = 300, sr = () => {
 	let e = process.env.VOLTRO_INTROSPECT_TIMEOUT_MS;
-	return e !== void 0 && e.trim() === "0" ? 0 : Jn(e, 3e4);
-}, Qn = (e, t) => {
+	return e !== void 0 && e.trim() === "0" ? 0 : ir(e, 3e4);
+}, cr = (e, t) => {
 	let n = Number.isFinite(t) && t >= 1 ? Math.floor(t) : 1, r = [];
 	for (let t = 0; t < e.length; t += n) r.push(e.slice(t, t + n));
 	return r;
-}, $n = (e) => {
-	let t = Zn(), n = w.gen(function* () {
+}, lr = (e) => {
+	let t = sr(), n = T.gen(function* () {
 		t > 0 && (yield* e.unsafe(`SET LOCAL statement_timeout = ${t}`));
-		let n = (t) => e.unsafe("(" + t.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ") + ")"), r = (t) => e.unsafe(String(Math.max(0, Math.trunc(t)))), i = Yn(), a = (e, t) => w.gen(function* () {
+		let n = (t) => e.unsafe("(" + t.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ") + ")"), r = (t) => e.unsafe(String(Math.max(0, Math.trunc(t)))), i = ar(), a = (e, t) => T.gen(function* () {
 			let r = [];
-			for (let a of Qn(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
+			for (let a of cr(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
 			return r;
 		}), o = [];
-		for (let t = 0;; t += Xn) {
+		for (let t = 0;; t += or) {
 			let n = yield* e`
         SELECT c.relname AS table_name,
                COALESCE(c.reltuples::bigint, 0) AS row_count
@@ -1747,16 +1836,21 @@ BEGIN
         JOIN pg_namespace n ON n.oid = c.relnamespace
         WHERE n.nspname = current_schema() AND c.relkind = 'r'
         ORDER BY c.relname
-        LIMIT ${r(Xn)} OFFSET ${r(t)}
+        LIMIT ${r(or)} OFFSET ${r(t)}
       `;
-			if (o.push(...n), n.length < Xn) break;
+			if (o.push(...n), n.length < or) break;
 		}
 		let s = /* @__PURE__ */ new Set(), c = [];
 		for (let e of o) s.has(e.table_name) || (s.add(e.table_name), c.push(e));
 		let l = c.map((e) => e.table_name), u = yield* a(l, (t) => e`
       SELECT table_name, column_name, data_type, udt_name, is_nullable, column_default,
-             character_maximum_length, is_generated, generation_expression
-      FROM information_schema.columns
+             character_maximum_length, is_generated, generation_expression,
+             (SELECT a.atttypmod FROM pg_attribute a
+              JOIN pg_class c ON c.oid = a.attrelid
+              JOIN pg_namespace n ON n.oid = c.relnamespace
+              WHERE n.nspname = col.table_schema AND c.relname = col.table_name
+                AND a.attname = col.column_name) AS type_modifier
+      FROM information_schema.columns col
       WHERE table_schema = current_schema() AND table_name IN ${t}
       ORDER BY table_name, ordinal_position
     `), d = yield* a(l, (t) => e`
@@ -1786,8 +1880,8 @@ BEGIN
         AND rel.relname IN ${t}
     `), m = /* @__PURE__ */ new Map();
 		for (let e of p) {
-			let t = [...e.def.matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'"));
-			t.length > 0 && m.set(`${e.table_name}.${e.column_name}`, t);
+			let t = er(e.def, e.column_name);
+			t !== null && m.set(`${e.table_name}.${e.column_name}`, t);
 		}
 		let h = yield* a(l, (t) => e`
       SELECT
@@ -1820,6 +1914,10 @@ BEGIN
           c.relname AS table_name,
           i.relname AS index_name,
           ix2.indisunique AS is_unique,
+          am.amname AS access_method,
+          CASE WHEN opn.nspname IN ('public', 'pg_catalog') THEN opc.opcname
+            ELSE opn.nspname || '.' || opc.opcname END AS operator_class,
+          i.reloptions AS reloptions,
           pg_get_expr(ix2.indpred, ix2.indrelid) AS predicate,
           ix2.indisvalid AS is_valid,
           (0 = ANY (ix2.indkey::int[])) AS has_expression,
@@ -1827,6 +1925,9 @@ BEGIN
           array_position(ix2.indkey::int[], a.attnum) + 1 AS position
         FROM pg_index ix2
         JOIN pg_class i ON i.oid = ix2.indexrelid
+        JOIN pg_am am ON am.oid = i.relam
+        LEFT JOIN pg_opclass opc ON opc.oid = ix2.indclass[0]
+        LEFT JOIN pg_namespace opn ON opn.oid = opc.opcnamespace
         JOIN pg_class c ON c.oid = ix2.indrelid
         JOIN pg_namespace n ON n.oid = c.relnamespace
         LEFT JOIN pg_attribute a ON a.attrelid = c.oid AND a.attnum = ANY (ix2.indkey)
@@ -1882,27 +1983,31 @@ BEGIN
 			let n = t.get(e.index_name);
 			n || (n = [], t.set(e.index_name, n)), n.push(e);
 		}
-		let T = [];
+		let w = [];
 		for (let e of c) {
 			let t = /* @__PURE__ */ new Set(), n = (_.get(e.table_name) ?? []).filter((e) => !t.has(e.column_name) && (t.add(e.column_name), !0)), r = v.get(e.table_name) ?? /* @__PURE__ */ new Set(), i = y.get(e.table_name) ?? /* @__PURE__ */ new Set(), a = x.get(e.table_name) ?? [], o = new Map(a.map((e) => [e.source_column, e])), s = new Set(n.filter((e) => e.udt_name === "tsvector").map((e) => e.column_name)), c = n.filter((e) => !s.has(e.column_name)).map((t) => {
-				let n = r.has(t.column_name) && r.size === 1, a = o.get(t.column_name), s = a ? "reference" : n && t.column_name === "id" ? "id" : Kn(t.data_type, t.udt_name), c = a ? {
+				let n = r.has(t.column_name) && r.size === 1, a = o.get(t.column_name), s = a ? "reference" : n && t.column_name === "id" ? "id" : nr(t.data_type, t.udt_name), c = a ? {
 					table: a.target_table,
 					column: a.target_column,
-					onDelete: B(a.delete_rule),
-					onUpdate: B(a.update_rule)
+					onDelete: V(a.delete_rule),
+					onUpdate: V(a.update_rule)
 				} : void 0, l = m.get(`${e.table_name}.${t.column_name}`);
 				return {
 					name: t.column_name,
 					type: s,
-					...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
+					...s === "vector" ? {
+						vectorPrecision: t.udt_name === "halfvec" ? "half" : "float32",
+						...t.type_modifier !== void 0 && t.type_modifier > 0 ? { vectorDim: t.type_modifier } : {}
+					} : {},
+					...U(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: U(t.data_type, t.character_maximum_length) },
 					nullable: t.is_nullable === "YES",
 					unique: i.has(t.column_name) || n && t.column_name === "id",
 					hasDefault: t.column_default !== null,
 					...t.column_default === null ? {} : { defaultValue: t.column_default },
 					...c ? { references: c } : {},
-					...a ? { referenceStorage: ["integer", "bigint"].includes(Kn(t.data_type, t.udt_name)) ? "numeric" : "text" } : {},
+					...a ? { referenceStorage: ["integer", "bigint"].includes(nr(t.data_type, t.udt_name)) ? "numeric" : "text" } : {},
 					...l ? { oneOf: l } : {},
-					...qn(t.is_generated === "ALWAYS" ? t.generation_expression ?? "generated" : null, !0) ?? {}
+					...rr(t.is_generated === "ALWAYS" ? t.generation_expression ?? "generated" : null, !0) ?? {}
 				};
 			}), l = [], u = S.get(e.table_name);
 			if (u) for (let [t, n] of u) {
@@ -1911,12 +2016,21 @@ BEGIN
 					return !r.has(t) && (r.add(t), !0);
 				});
 				if (i.some((e) => s.has(e.column_name))) continue;
-				let a = n.some((e) => e.has_expression);
+				let a = n.some((e) => e.has_expression), o = n[0], c = new Map((o?.reloptions ?? []).map((e) => {
+					let [t, n] = e.split("=");
+					return [t, Number(n)];
+				}));
+				if (o?.access_method === "hnsw" && !o.operator_class) throw Error(`Cannot read HNSW operator class for index ${t}`);
 				l.push({
 					name: t,
 					table: e.table_name,
 					columns: i.map((e) => e.column_name),
 					unique: n[0]?.is_unique ?? !1,
+					...D(o?.access_method, o?.access_method === "hnsw" ? { hnsw: {
+						opclass: o.operator_class,
+						m: c.get("m") ?? 16,
+						efConstruction: c.get("ef_construction") ?? 64
+					} } : void 0),
 					...n[0]?.predicate == null ? {} : { where: n[0].predicate },
 					...n[0]?.is_valid === !1 ? { valid: !1 } : {},
 					...a ? { expression: !0 } : {}
@@ -1930,20 +2044,20 @@ BEGIN
 				unique: !0
 			});
 			let d = Number(e.row_count ?? 0);
-			T.push({
+			w.push({
 				name: e.table_name,
 				columns: c,
 				indexes: l,
 				...d > 0 ? { rowCount: d } : {}
 			});
 		}
-		return { tables: T };
+		return { tables: w };
 	});
-	return (t > 0 ? e.withTransaction(n) : n).pipe(w.catchAll((e) => {
+	return (t > 0 ? e.withTransaction(n) : n).pipe(T.catchAll((e) => {
 		let n = `${String(e)} ${String(e.cause ?? "")}`.toLowerCase();
-		return n.includes("statement timeout") || n.includes("57014") ? w.die(/* @__PURE__ */ Error(`schema introspection exceeded VOLTRO_INTROSPECT_TIMEOUT_MS (${t}ms) — the schema is very large / FK-dense or the database is slow. Raise VOLTRO_INTROSPECT_TIMEOUT_MS, set it to 0 to disable the ceiling, or use DB_DIRECT_URL for a non-pooler connection.`)) : w.fail(e);
+		return n.includes("statement timeout") || n.includes("57014") ? T.die(/* @__PURE__ */ Error(`schema introspection exceeded VOLTRO_INTROSPECT_TIMEOUT_MS (${t}ms) — the schema is very large / FK-dense or the database is slow. Raise VOLTRO_INTROSPECT_TIMEOUT_MS, set it to 0 to disable the ceiling, or use DB_DIRECT_URL for a non-pooler connection.`)) : T.fail(e);
 	}));
-}, er = (e, t) => {
+}, ur = (e, t) => {
 	switch (e.toLowerCase()) {
 		case "varchar":
 		case "char":
@@ -1975,21 +2089,21 @@ BEGIN
 		case "json": return "json";
 		default: return "text";
 	}
-}, tr = (e) => e.map((e) => {
+}, dr = (e) => e.map((e) => {
 	let t = e, n = {};
 	for (let e of Object.keys(t)) n[e.toLowerCase()] = t[e];
 	return n;
-}), nr = (e) => w.gen(function* () {
-	let t = tr(yield* e`
+}), fr = (e) => T.gen(function* () {
+	let t = dr(yield* e`
       SELECT table_name, COALESCE(table_rows, 0) AS table_rows
       FROM information_schema.tables
       WHERE table_schema = DATABASE() AND table_type = 'BASE TABLE'
-      ORDER BY table_name`), n = tr(yield* e`
+      ORDER BY table_name`), n = dr(yield* e`
       SELECT table_name, column_name, data_type, column_type, is_nullable, column_default, column_key,
              character_maximum_length, generation_expression, extra
       FROM information_schema.columns
       WHERE table_schema = DATABASE()
-      ORDER BY table_name, ordinal_position`), r = tr(yield* e`
+      ORDER BY table_name, ordinal_position`), r = dr(yield* e`
       SELECT k.table_name              AS source_table,
              k.column_name             AS source_column,
              k.referenced_table_name   AS target_table,
@@ -1999,7 +2113,7 @@ BEGIN
       JOIN information_schema.referential_constraints r
         ON k.constraint_name = r.constraint_name
        AND k.table_schema    = r.constraint_schema
-      WHERE k.table_schema = DATABASE() AND k.referenced_table_name IS NOT NULL`), i = tr(yield* e`
+      WHERE k.table_schema = DATABASE() AND k.referenced_table_name IS NOT NULL`), i = dr(yield* e`
       SELECT table_name, index_name, non_unique, column_name, seq_in_index
       FROM information_schema.statistics
       WHERE table_schema = DATABASE() AND index_name <> 'PRIMARY'
@@ -2012,14 +2126,14 @@ BEGIN
       JOIN information_schema.table_constraints tc
         ON tc.constraint_schema = cc.constraint_schema
        AND tc.constraint_name   = cc.constraint_name
-      WHERE cc.constraint_schema = DATABASE()`.unprepared, s = tr(yield* a.pipe(w.orElse(() => o), w.orElseSucceed(() => []))), c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
+      WHERE cc.constraint_schema = DATABASE()`.unprepared, s = dr(yield* a.pipe(T.orElse(() => o), T.orElseSucceed(() => []))), c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
 	for (let e of s) {
 		let t = /json_valid\(`?([^`)]+)`?\)/i.exec(e.check_clause);
 		if (t) {
 			c.add(`${e.table_name}.${t[1]}`);
 			continue;
 		}
-		let n = Gn(e.check_clause);
+		let n = tr(e.check_clause);
 		n && l.set(`${e.table_name}.${n.column}`, n.values);
 	}
 	let u = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map();
@@ -2042,24 +2156,24 @@ BEGIN
 		let t = u.get(e.table_name) ?? [], n = d.get(e.table_name) ?? [], r = new Map(n.map((e) => [e.source_column, e])), i = t.filter((e) => e.column_key === "PRI").map((e) => e.column_name), a = /* @__PURE__ */ new Set(), o = f.get(e.table_name);
 		if (o) for (let e of o.values()) e.length === 1 && e[0].non_unique === 0 && a.add(e[0].column_name);
 		let s = t.map((t) => {
-			let n = i.includes(t.column_name) && i.length === 1, o = r.get(t.column_name), s = o ? "reference" : n && t.column_name === "id" ? "id" : c.has(`${e.table_name}.${t.column_name}`) ? "json" : er(t.data_type, t.column_type), u = o ? {
+			let n = i.includes(t.column_name) && i.length === 1, o = r.get(t.column_name), s = o ? "reference" : n && t.column_name === "id" ? "id" : c.has(`${e.table_name}.${t.column_name}`) ? "json" : ur(t.data_type, t.column_type), u = o ? {
 				table: o.target_table,
 				column: o.target_column,
-				onDelete: B(o.delete_rule),
-				onUpdate: B(o.update_rule)
+				onDelete: V(o.delete_rule),
+				onUpdate: V(o.update_rule)
 			} : void 0, d = a.has(t.column_name) || n && t.column_name === "id", f = t.column_default === "NULL" ? null : t.column_default, p = l.get(`${e.table_name}.${t.column_name}`);
 			return {
 				name: t.column_name,
 				type: s,
 				nullable: t.is_nullable === "YES",
-				...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
+				...U(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: U(t.data_type, t.character_maximum_length) },
 				unique: d,
 				hasDefault: f !== null,
 				...f === null ? {} : { defaultValue: f },
 				...u ? { references: u } : {},
-				...o ? { referenceStorage: ["integer", "bigint"].includes(er(t.data_type, t.column_type)) ? "numeric" : "text" } : {},
+				...o ? { referenceStorage: ["integer", "bigint"].includes(ur(t.data_type, t.column_type)) ? "numeric" : "text" } : {},
 				...p ? { oneOf: p } : {},
-				...qn(t.generation_expression, /STORED/i.test(t.extra ?? "")) ?? {}
+				...rr(t.generation_expression, /STORED/i.test(t.extra ?? "")) ?? {}
 			};
 		}), m = new Set(n.map((e) => e.source_column)), h = [];
 		if (o) for (let [t, n] of o) {
@@ -2086,10 +2200,10 @@ BEGIN
 		});
 	}
 	return { tables: p };
-}), rr = (e) => {
+}), pr = (e) => {
 	let t = e.toUpperCase();
 	return t.includes("INT") ? "integer" : t.includes("REAL") || t.includes("FLOA") || t.includes("DOUB") ? "real" : t.includes("BLOB") ? "bytes" : "text";
-}, ir = (e) => e === 1 || e === !0, ar = (e) => w.gen(function* () {
+}, mr = (e) => e === 1 || e === !0, hr = (e) => T.gen(function* () {
 	let t = yield* e`
       SELECT name, sql FROM sqlite_master
       WHERE type = 'table' AND name NOT LIKE 'sqlite_%'
@@ -2103,18 +2217,18 @@ BEGIN
 		let o = yield* e.unsafe(`PRAGMA table_xinfo(${n(i)})`), s = yield* e.unsafe(`PRAGMA foreign_key_list(${n(i)})`), c = yield* e.unsafe(`PRAGMA index_list(${n(i)})`), l = new Map(s.map((e) => [e.from, e])), u = o.filter((e) => e.pk > 0).sort((e, t) => e.pk - t.pk).map((e) => e.name), d = new Map(o.map((e) => [e.name.toLowerCase(), e.name])), f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Set();
 		for (let t of c) {
 			let r = (yield* e.unsafe(`PRAGMA index_info(${n(t.name)})`)).map((e) => e.name).filter((e) => e !== null).map((e) => d.get(e.toLowerCase()) ?? e);
-			if (f.set(t.name, r), t.partial !== void 0 && ir(t.partial)) {
-				let n = Xt((yield* e`SELECT sql FROM sqlite_master WHERE type = 'index' AND name = ${t.name}`)[0]?.sql ?? "");
+			if (f.set(t.name, r), t.partial !== void 0 && mr(t.partial)) {
+				let n = on((yield* e`SELECT sql FROM sqlite_master WHERE type = 'index' AND name = ${t.name}`)[0]?.sql ?? "");
 				n !== void 0 && p.set(t.name, n);
 			}
-			!p.has(t.name) && ir(t.unique) && r.length === 1 && m.add(r[0]);
+			!p.has(t.name) && mr(t.unique) && r.length === 1 && m.add(r[0]);
 		}
 		let h = o.map((e) => {
-			let n = u.length === 1 && u[0] === e.name, r = l.get(e.name), i = r ? "reference" : n && e.name === "id" ? "id" : rr(e.type), a = r ? {
+			let n = u.length === 1 && u[0] === e.name, r = l.get(e.name), i = r ? "reference" : n && e.name === "id" ? "id" : pr(e.type), a = r ? {
 				table: r.table,
 				column: r.to,
-				onDelete: B(r.on_delete),
-				onUpdate: B(r.on_update)
+				onDelete: V(r.on_delete),
+				onUpdate: V(r.on_update)
 			} : void 0, o = t.get(e.name);
 			return {
 				name: e.name,
@@ -2124,19 +2238,19 @@ BEGIN
 				hasDefault: e.dflt_value !== null,
 				...e.dflt_value === null ? {} : { defaultValue: e.dflt_value },
 				...a ? { references: a } : {},
-				...r ? { referenceStorage: ["integer", "bigint"].includes(rr(e.type)) ? "numeric" : "text" } : {},
+				...r ? { referenceStorage: ["integer", "bigint"].includes(pr(e.type)) ? "numeric" : "text" } : {},
 				...o ? { oneOf: o } : {},
-				...qn(e.hidden === 2 || e.hidden === 3 ? "generated" : null, e.hidden === 3) ?? {}
+				...rr(e.hidden === 2 || e.hidden === 3 ? "generated" : null, e.hidden === 3) ?? {}
 			};
 		}), g = new Set(s.map((e) => e.from)), _ = [];
 		for (let e of c) {
 			if (e.origin === "pk") continue;
 			let t = f.get(e.name) ?? [], n = p.get(e.name);
-			n === void 0 && t.length === 1 && ir(e.unique) || (n !== void 0 || t.length !== 1 || ir(e.unique) || !g.has(t[0]) || e.name === `${i}_${t[0]}_idx`) && _.push({
+			n === void 0 && t.length === 1 && mr(e.unique) || (n !== void 0 || t.length !== 1 || mr(e.unique) || !g.has(t[0]) || e.name === `${i}_${t[0]}_idx`) && _.push({
 				name: e.name,
 				table: i,
 				columns: t,
-				unique: ir(e.unique),
+				unique: mr(e.unique),
 				...n === void 0 ? {} : { where: n }
 			});
 		}
@@ -2152,7 +2266,7 @@ BEGIN
 		});
 	}
 	return { tables: r };
-}), or = (e) => {
+}), gr = (e) => {
 	switch (e.toLowerCase()) {
 		case "int":
 		case "smallint":
@@ -2174,14 +2288,14 @@ BEGIN
 		case "image": return "bytes";
 		default: return "text";
 	}
-}, V = (e) => e === !0 || e === 1, sr = (e) => w.gen(function* () {
+}, H = (e) => e === !0 || e === 1, _r = (e) => T.gen(function* () {
 	let t = yield* e`
       SELECT TABLE_NAME AS table_name FROM INFORMATION_SCHEMA.TABLES
       WHERE TABLE_TYPE = 'BASE TABLE' ORDER BY TABLE_NAME`, n = yield* e`
       SELECT TABLE_NAME AS table_name, COLUMN_NAME AS column_name, DATA_TYPE AS data_type,
              IS_NULLABLE AS is_nullable, COLUMN_DEFAULT AS column_default,
              CHARACTER_MAXIMUM_LENGTH AS character_maximum_length
-      FROM INFORMATION_SCHEMA.COLUMNS ORDER BY TABLE_NAME, ORDINAL_POSITION`, r = yield* w.orElseSucceed(e`
+      FROM INFORMATION_SCHEMA.COLUMNS ORDER BY TABLE_NAME, ORDINAL_POSITION`, r = yield* T.orElseSucceed(e`
         SELECT t.name AS table_name, c.name AS column_name, cc.definition AS definition,
                cc.is_persisted AS is_persisted
         FROM sys.computed_columns cc
@@ -2206,14 +2320,14 @@ BEGIN
       JOIN sys.columns c ON c.object_id = ic.object_id AND c.column_id = ic.column_id
       WHERE i.type > 0 AND ic.is_included_column = 0
       ORDER BY t.name, i.name, ic.key_ordinal`, s = yield* e`
-      SELECT t.name AS table_name, c.name AS column_name, cc.definition AS def
+      SELECT t.name AS table_name, c.name AS column_name, cc.definition AS def,
+             cc.name AS constraint_name, cc.is_disabled, cc.is_not_trusted
       FROM sys.check_constraints cc
       JOIN sys.tables t ON t.object_id = cc.parent_object_id
-      JOIN sys.columns c ON c.object_id = cc.parent_object_id AND c.column_id = cc.parent_column_id
-      WHERE cc.parent_column_id <> 0`, c = /* @__PURE__ */ new Map();
+      LEFT JOIN sys.columns c ON c.object_id = cc.parent_object_id AND c.column_id = cc.parent_column_id`, c = /* @__PURE__ */ new Map();
 	for (let e of s) {
-		let t = [...e.def.matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'"));
-		t.length > 0 && c.set(`${e.table_name}.${e.column_name}`, t);
+		let t = tr(e.def);
+		t?.column === e.column_name && c.set(`${e.table_name}.${e.column_name}`, t.values);
 	}
 	let l = /* @__PURE__ */ new Map();
 	for (let e of n) {
@@ -2234,141 +2348,173 @@ BEGIN
 	}
 	let f = [];
 	for (let { table_name: e } of t) {
-		let t = l.get(e) ?? [], n = u.get(e) ?? [], r = new Map(n.map((e) => [e.source_column, e])), a = new Set(n.map((e) => e.source_column)), o = d.get(e), s = [], p = /* @__PURE__ */ new Set();
+		let t = l.get(e) ?? [], n = u.get(e) ?? [], r = new Map(n.map((e) => [e.source_column, e])), a = new Set(n.map((e) => e.source_column)), o = d.get(e), p = [], m = /* @__PURE__ */ new Set();
 		if (o) for (let [, e] of o) {
 			let t = [...e].sort((e, t) => e.key_ordinal - t.key_ordinal);
-			if (V(t[0].is_primary)) for (let e of t) s.push(e.column_name);
-			else t[0].predicate == null && V(t[0].is_unique) && t.length === 1 && p.add(t[0].column_name);
+			if (H(t[0].is_primary)) for (let e of t) p.push(e.column_name);
+			else t[0].predicate == null && H(t[0].is_unique) && t.length === 1 && m.add(t[0].column_name);
 		}
-		let m = t.map((t) => {
-			let n = s.length === 1 && s[0] === t.column_name, a = r.get(t.column_name), o = a ? "reference" : n && t.column_name === "id" ? "id" : or(t.data_type), l = a ? {
+		let h = t.map((t) => {
+			let n = p.length === 1 && p[0] === t.column_name, a = r.get(t.column_name), o = a ? "reference" : n && t.column_name === "id" ? "id" : gr(t.data_type), l = a ? {
 				table: a.target_table,
 				column: a.target_column,
-				onDelete: cr(a.delete_rule),
-				onUpdate: cr(a.update_rule)
-			} : void 0, u = t.column_default === null ? null : lr(t.column_default), d = c.get(`${e}.${t.column_name}`);
+				onDelete: vr(a.delete_rule),
+				onUpdate: vr(a.update_rule)
+			} : void 0, u = t.column_default === null ? null : yr(t.column_default), d = c.get(`${e}.${t.column_name}`), f = s.flatMap((n) => {
+				if (n.table_name !== e || n.column_name !== null && n.column_name !== t.column_name) return [];
+				let r = it(t.column_name, n.def);
+				return r ? [{
+					name: n.constraint_name,
+					validation: r,
+					enabled: !H(n.is_disabled),
+					trusted: !H(n.is_not_trusted)
+				}] : [];
+			}).sort((e, t) => e.name.localeCompare(t.name)), h = at(f);
 			return {
 				name: t.column_name,
 				type: o,
 				nullable: t.is_nullable === "YES",
-				...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
-				unique: p.has(t.column_name) || n && t.column_name === "id",
+				...U(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: U(t.data_type, t.character_maximum_length) },
+				unique: m.has(t.column_name) || n && t.column_name === "id",
 				hasDefault: u !== null,
 				...u === null ? {} : { defaultValue: u },
 				...l ? { references: l } : {},
-				...a ? { referenceStorage: ["integer", "bigint"].includes(or(t.data_type)) ? "numeric" : "text" } : {},
+				...a ? { referenceStorage: ["integer", "bigint"].includes(gr(t.data_type)) ? "numeric" : "text" } : {},
 				...d ? { oneOf: d } : {},
-				...qn(i.get(`${e}.${t.column_name}`)?.definition ?? null, V(i.get(`${e}.${t.column_name}`)?.is_persisted ?? !1)) ?? {}
+				...f.length > 0 ? { jsonChecks: f } : {},
+				...h ? { jsonValidation: h } : {},
+				...rr(i.get(`${e}.${t.column_name}`)?.definition ?? null, H(i.get(`${e}.${t.column_name}`)?.is_persisted ?? !1)) ?? {}
 			};
-		}), h = [];
+		}), g = [];
 		if (o) for (let [t, n] of o) {
 			let r = [...n].sort((e, t) => e.key_ordinal - t.key_ordinal);
-			if (V(r[0].is_primary)) continue;
+			if (H(r[0].is_primary)) continue;
 			let i = r[0].predicate ?? void 0;
-			i === void 0 && r.length === 1 && V(r[0].is_unique) || (i !== void 0 || r.length !== 1 || V(r[0].is_unique) || !a.has(r[0].column_name) || t === `${e}_${r[0].column_name}_idx`) && h.push({
+			i === void 0 && r.length === 1 && H(r[0].is_unique) || (i !== void 0 || r.length !== 1 || H(r[0].is_unique) || !a.has(r[0].column_name) || t === `${e}_${r[0].column_name}_idx`) && g.push({
 				name: t,
 				table: e,
 				columns: r.map((e) => e.column_name),
-				unique: V(r[0].is_unique),
+				unique: H(r[0].is_unique),
 				...i === void 0 ? {} : { where: i }
 			});
 		}
-		s.length > 0 && h.push({
+		p.length > 0 && g.push({
 			name: `${e}_pkey`,
 			table: e,
-			columns: s,
+			columns: p,
 			unique: !0
 		}), f.push({
 			name: e,
-			columns: m,
-			indexes: h
+			columns: h,
+			indexes: g
 		});
 	}
 	return { tables: f };
-}), cr = (e) => {
+}), vr = (e) => {
 	switch (e.toUpperCase().replace(/_/g, " ")) {
 		case "CASCADE": return "cascade";
 		case "SET NULL": return "setNull";
 		case "SET DEFAULT": return "noAction";
 		default: return "noAction";
 	}
-}, lr = (e) => {
+}, yr = (e) => {
 	let t = e.trim();
 	for (; t.startsWith("(") && t.endsWith(")");) t = t.slice(1, -1).trim();
 	return t.startsWith("N'") && t.endsWith("'") ? t = t.slice(2, -1) : t.startsWith("'") && t.endsWith("'") && (t = t.slice(1, -1)), t;
-}, ur = /* @__PURE__ */ new Set([
+}, br = /* @__PURE__ */ new Set([
 	"character varying",
 	"varchar",
 	"nvarchar",
 	"char",
 	"character",
 	"nchar"
-]), H = (e, t) => {
-	if (!ur.has(e.toLowerCase())) return;
+]), U = (e, t) => {
+	if (!br.has(e.toLowerCase())) return;
 	let n = Number(t);
 	if (!(!Number.isFinite(n) || n <= 0)) return n;
-}, dr = /* @__PURE__ */ new Set([k]), fr = (e) => e.onDialectOrElse({
-	mysql: () => nr(e),
-	mssql: () => sr(e),
-	sqlite: () => ar(e),
-	orElse: () => $n(e)
-}).pipe(w.map((e) => ({
+}, xr = /* @__PURE__ */ new Set([A]), Sr = (e) => e.onDialectOrElse({
+	mysql: () => fr(e),
+	mssql: () => _r(e),
+	sqlite: () => hr(e),
+	orElse: () => lr(e)
+}).pipe(T.map((e) => ({
 	...e,
-	tables: e.tables.filter((e) => !dr.has(e.name))
-}))), pr = (e) => /mariadb/i.test(e) ? "mariadb" : "mysql", mr = /* @__PURE__ */ new WeakMap(), hr = (e) => w.suspend(() => {
-	let t = mr.get(e);
-	return t === void 0 ? gr(e).pipe(w.tap((t) => w.sync(() => mr.set(e, t)))) : w.succeed(t);
-}), gr = (e) => e.unsafe("SELECT VERSION() AS v").pipe(w.map((e) => {
+	tables: e.tables.filter((e) => !xr.has(e.name))
+}))), Cr = (e) => /mariadb/i.test(e) ? "mariadb" : "mysql", wr = /* @__PURE__ */ new WeakMap(), Tr = (e) => T.suspend(() => {
+	let t = wr.get(e);
+	return t === void 0 ? Er(e).pipe(T.tap((t) => T.sync(() => wr.set(e, t)))) : T.succeed(t);
+}), Er = (e) => e.unsafe("SELECT VERSION() AS v").pipe(T.map((e) => {
 	let t = e[0]?.v;
-	return typeof t == "string" ? pr(t) : "mysql";
-}), w.catchAll(() => w.succeed("mysql"))), _r = (e) => {
+	return typeof t == "string" ? Cr(t) : "mysql";
+}), T.catchAll(() => T.succeed("mysql"))), Dr = (e) => {
 	let t = e;
 	for (let e = 0; e < 6 && typeof t == "object" && t; e++) {
 		let e = t;
 		if (typeof e.errno == "number") return e.errno;
 		t = e.cause;
 	}
-}, vr = (e) => {
+}, Or = (e) => {
 	let t = [], n = e;
 	for (let e = 0; e < 6 && typeof n == "object" && n; e++) {
 		let e = n;
 		typeof e.message == "string" && t.push(e.message), n = e.cause;
 	}
 	return t.join(" | ");
-}, yr = (e, t) => {
+}, kr = (e, t) => {
 	if (t.length === 0) return !1;
-	let n = _r(e), r = vr(e);
+	let n = Dr(e), r = Or(e);
 	return t.some((e) => e.errno !== void 0 && n !== void 0 && e.errno.includes(n) || e.messageIncludes !== void 0 && e.messageIncludes.some((e) => r.includes(e)));
-}, br = {
+}, Ar = {
 	why: "mysql has no CREATE INDEX IF NOT EXISTS; 1061 is exactly that condition",
 	errno: [1061]
-}, xr = {
+}, jr = {
 	why: "mysql has no DROP COLUMN IF EXISTS; 1091 is exactly that condition",
 	errno: [1091]
-}, Sr = {
+}, Mr = {
 	why: "sqlite has no DROP COLUMN IF EXISTS, and reports the absent column only in the message",
 	messageIncludes: ["no such column"]
-}, Cr = {
+}, Nr = {
 	why: "mysql/mariadb DROP CONSTRAINT has no portable IF EXISTS; 1091 / 3940 are exactly \"already gone\"",
 	errno: [1091, 3940]
-}, U = (e, t) => e.onDialectOrElse({
-	mysql: () => w.succeed(t.replace("T", " ").replace("Z", "")),
-	orElse: () => w.succeed(t)
-}), wr = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, Tr = (e) => e.type === "text" && (e.hasDefault && e.defaultValue !== void 0 || e.oneOf !== void 0 && e.oneOf.length > 0), Er = (e, t) => {
-	if ((e.type !== "text" || e.maxLength === void 0) && !Tr(e) && !e.spatial && e.type !== "vector" && e.type !== "array" && e.type !== "enum") return;
+}, Pr = (e, t) => T.suspend(() => {
+	let n;
+	return e.withTransaction(t.pipe(T.tapErrorCause((e) => T.sync(() => {
+		n = e;
+	})))).pipe(T.catchAllCause((e) => T.failCause(n !== void 0 && !ee.equals(n, e) ? w.sequential(n, e) : e)));
+}), Fr = (e, t, n) => {
+	let r = e.match(/'(?:''|[^'])*'|\[(?:\]\]|[^\]])*\]|\s+|[^'\[\s]+/g) ?? [];
+	if (r.join("") !== e || r.some((e) => !e.startsWith("'") && !e.startsWith("[") && /"|\/\*|--/.test(e))) throw Error("Cannot safely rename CHECK: unsupported catalog SQL; use an explicit migration");
+	let i = r.map((e, t) => ({
+		value: e,
+		index: t
+	})).filter((e) => e.value.trim() !== ""), a = 0;
+	for (let e = 0; e < i.length; e++) {
+		let s = i[e];
+		if (s.value !== o(t, "mssql")) continue;
+		let c = i[e - 1]?.value ?? "", l = i[e + 1]?.value ?? "";
+		if (c.endsWith(".") || l.startsWith(".") || l.startsWith("(")) throw Error(`Cannot safely rename CHECK reference '${t}': qualified or callable identifier; use an explicit migration`);
+		r[s.index] = o(n, "mssql"), a++;
+	}
+	if (a === 0 || r.join("").length === 0) throw Error(`Cannot safely rename CHECK reference '${t}': no exact catalog column token; use an explicit migration`);
+	return r.join("");
+}, W = (e, t) => e.onDialectOrElse({
+	mysql: () => T.succeed(t.replace("T", " ").replace("Z", "")),
+	orElse: () => T.succeed(t)
+}), Ir = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, Lr = (e) => e.type === "text" && (e.hasDefault && e.defaultValue !== void 0 || e.oneOf !== void 0 && e.oneOf.length > 0), Rr = (e, t) => {
+	if ((e.type !== "text" || e.maxLength === void 0) && !Lr(e) && !e.spatial && e.type !== "vector" && e.type !== "array" && e.type !== "enum") return;
 	let n = e.type === "vector" && e.vectorDim === void 0 ? "vector dimension" : e.type === "array" && e.arrayElement === void 0 ? "array element type" : e.type === "enum" && e.enumName === void 0 && e.enumValues === void 0 ? "enum name/values" : void 0;
 	if (n !== void 0) throw Error(`migration applier: cannot render '${e.name}' (${e.type}) — the schema snapshot carries no ${n}. Rendering it as 'text' would emit DDL that applies successfully and changes nothing, so this fails instead. This is a framework bug: declaredSchema.ts must carry the parameter into the ColumnSnapshot.`);
-	return M(e, t);
-}, Dr = (e) => {
-	let t = Er(e, "postgres");
-	return t === void 0 ? Or(e) : t;
-}, Or = (e) => {
+	return N(e, t);
+}, zr = (e) => {
+	let t = Rr(e, "postgres");
+	return t === void 0 ? Br(e) : t;
+}, Br = (e) => {
 	switch (e.type) {
 		case "id": return "text";
 		case "text": return "text";
 		case "integer": return "integer";
 		case "real": return "double precision";
-		case "decimal": return wr(e, "NUMERIC");
+		case "decimal": return Ir(e, "NUMERIC");
 		case "bigint": return "bigint";
 		case "boolean": return "boolean";
 		case "timestamp": return "timestamptz";
@@ -2382,15 +2528,15 @@ BEGIN
 		case "interval": return "interval";
 		case "raw": return e.rawDdl ?? "text";
 	}
-}, kr = (e) => {
-	let t = Er(e, "mariadb");
+}, Vr = (e) => {
+	let t = Rr(e, "mariadb");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "id": return "VARCHAR(64)";
 		case "text": return "LONGTEXT";
 		case "integer": return "INT";
 		case "real": return "DOUBLE";
-		case "decimal": return wr(e, "DECIMAL");
+		case "decimal": return Ir(e, "DECIMAL");
 		case "bigint": return "BIGINT";
 		case "boolean": return "TINYINT(1)";
 		case "timestamp": return "DATETIME(6)";
@@ -2404,64 +2550,68 @@ BEGIN
 		case "interval": return "BIGINT";
 		case "raw": return e.rawDdl ?? "LONGTEXT";
 	}
-}, W = (e) => `"${e}"`, G = (e) => `\`${e.replace(/`/g, "``")}\``, Ar = (e) => e === "mariadb" ? "IF NOT EXISTS " : "", jr = (e, t, n = !0) => `ALTER TABLE ${t(e.table)} DROP COLUMN ${n ? "IF EXISTS " : ""}${t(e.column)};`, Mr = (e, t = "mariadb") => `ALTER TABLE ${G(e.table)} DROP COLUMN ${t === "mariadb" ? "IF EXISTS " : ""}${G(e.column)}, ALGORITHM=COPY;`, Nr = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, Pr = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${li(t)}`)};`, Fr = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${Lr(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, Ir = (e, t) => {
+}, G = (e) => `"${e}"`, K = (e) => `\`${e.replace(/`/g, "``")}\``, Hr = (e) => e === "mariadb" ? "IF NOT EXISTS " : "", Ur = (e, t, n = !0) => `ALTER TABLE ${t(e.table)} DROP COLUMN ${n ? "IF EXISTS " : ""}${t(e.column)};`, Wr = (e, t = "mariadb") => `ALTER TABLE ${K(e.table)} DROP COLUMN ${t === "mariadb" ? "IF EXISTS " : ""}${K(e.column)}, ALGORITHM=COPY;`, Gr = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, Kr = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${Si(t)}`)};`, qr = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${Yr(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, Jr = (e, t) => {
 	let { defaultFactory: n, ...r } = e;
-	return M(e, t) !== M({
+	return N(e, t) !== N({
 		...r,
 		hasDefault: !1
 	}, t);
-}, Lr = (e, t) => {
+}, Yr = (e, t) => {
 	let n = t(e.defaultValue);
 	if (n === null) throw Error(`migration applier: cannot render the declared default for '${e.table}.${e.column}' (${JSON.stringify(e.defaultValue)}). Emitting 'DEFAULT NULL' would apply cleanly and drop the default silently, so this fails instead. This is a framework bug — report the column type + default.`);
 	return n;
-}, K = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], Rr = (e, t, n) => {
-	let r = K(e, t, n);
-	return r ? on(n, r) : void 0;
-}, zr = (e, t, n) => {
-	let r = n ?? e.nullable, i = rt(e, "mariadb");
+}, q = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], Xr = (e, t, n) => {
+	let r = q(e, t, n);
+	return r ? hn(n, r) : void 0;
+}, Zr = (e, t, n) => {
+	let r = n ?? e.nullable, i = ft(e, "mariadb");
 	return [
-		G(t),
-		M(e, "mariadb"),
+		K(t),
+		N(e, "mariadb"),
 		r ? null : "NOT NULL",
 		i
 	].filter(Boolean).join(" ");
-}, Br = (e, t) => e == null ? null : Array.isArray(e) ? Vr(e, t, "mariadb") : e === "now" ? "DEFAULT CURRENT_TIMESTAMP(6)" : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? N(e, "mariadb") : null, Vr = (e, t, n) => it(e, t ?? { type: "json" }, n), Hr = (e, t) => e == null ? null : Array.isArray(e) ? Vr(e, t, "postgres") : e === "now" ? "DEFAULT now()" : typeof e == "boolean" || typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|::|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? N(e, "postgres") : null, Ur = (e, t) => {
+}, Qr = (e, t) => e == null ? null : Array.isArray(e) ? $r(e, t, "mariadb") : e === "now" ? "DEFAULT CURRENT_TIMESTAMP(6)" : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? P(e, "mariadb") : null, $r = (e, t, n) => pt(e, t ?? { type: "json" }, n), ei = (e, t) => e == null ? null : Array.isArray(e) ? $r(e, t, "postgres") : e === "now" ? "DEFAULT now()" : typeof e == "boolean" || typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|::|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? P(e, "postgres") : null, ti = (e, t) => {
 	if (!e.generatedAs) return null;
 	let { expr: n, stored: r } = e.generatedAs;
 	return t === "postgres" ? `GENERATED ALWAYS AS (${n}) STORED` : t === "mssql" ? `AS (${n})${r ? " PERSISTED" : ""}` : `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
-}, Wr = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return P(e.name, "postgres");
-	let t = Ur(e, "postgres");
-	if (t) return `${W(e.name)} ${Dr(e)} ${t}`;
-	let n = [W(e.name), Dr(e)];
-	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && n.push("UNIQUE"), e.hasDefault) {
-		let t = Hr(e.defaultValue, e);
-		t && n.push(t);
-	}
-	return e.references && (n.push(`REFERENCES ${W(e.references.table)} (${W(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
+}, ni = (e, t = !1) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return F(e.name, "postgres");
+	let n = ti(e, "postgres");
+	if (n) return `${G(e.name)} ${zr(e)} ${n}`;
+	let r = [G(e.name), zr(e)];
+	if (e.type === "id" && !t && r.push("PRIMARY KEY"), e.nullable || r.push("NOT NULL"), e.unique && e.type !== "id" && r.push("UNIQUE"), e.hasDefault) {
+		let t = ei(e.defaultValue, e);
+		t && r.push(t);
+	}
+	return e.references && (r.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && r.push(`ON DELETE ${{
 		cascade: "CASCADE",
 		restrict: "RESTRICT",
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
-	}[e.references.onDelete]}`)), n.join(" ");
-}, Gr = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n  PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", Kr = (e) => {
-	let t = e.columns.map((e) => `  ${Wr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${W(e.table)} (\n${t}${Gr(e, W)}\n)`];
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e.table)} (${t.columns.map(mi).join(", ")})${Y(t)}`);
+	}[e.references.onDelete]}`)), r.join(" ");
+}, ri = (e) => (e.primaryKey?.length ?? 0) > 0, ii = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n  PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", ai = (e) => {
+	let t = e.columns.map((t) => `  ${ni(t, ri(e))}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${ii(e, G)}\n)`];
+	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(ki({
+		kind: "add-index",
+		table: e.table,
+		index: t
+	}, !1));
 	return n;
-}, qr = 191, Jr = (e) => {
-	let t = kr(e).toUpperCase();
+}, oi = 191, si = (e) => {
+	let t = Vr(e).toUpperCase();
 	return t.endsWith("TEXT") || t.endsWith("BLOB");
-}, Yr = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return P(e.name, "mariadb");
-	let t = Ur(e, "mariadb");
-	if (t) return `${G(e.name)} ${kr(e)} ${t}`;
-	let n = [G(e.name), kr(e)];
-	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && !Jr(e) && n.push("UNIQUE"), e.hasDefault) {
-		let t = Br(e.defaultValue, e);
-		t && n.push(t);
-	}
-	return n.join(" ");
-}, Xr = (e) => e.columns.flatMap((t) => {
+}, ci = (e, t = !1) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return F(e.name, "mariadb");
+	let n = ti(e, "mariadb");
+	if (n) return `${K(e.name)} ${Vr(e)} ${n}`;
+	let r = [K(e.name), Vr(e)];
+	if (e.type === "id" && !t && r.push("PRIMARY KEY"), e.nullable || r.push("NOT NULL"), e.unique && e.type !== "id" && !si(e) && r.push("UNIQUE"), e.hasDefault) {
+		let t = Qr(e.defaultValue, e);
+		t && r.push(t);
+	}
+	return r.join(" ");
+}, li = (e) => e.columns.flatMap((t) => {
 	if (!t.references) return [];
 	let n = t.references.onDelete ? ` ON DELETE ${{
 		cascade: "CASCADE",
@@ -2469,28 +2619,28 @@ BEGIN
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
 	}[t.references.onDelete]}` : "";
-	return [`  CONSTRAINT ${G(`${e.table}_${t.name}_fkey`)} FOREIGN KEY (${G(t.name)}) REFERENCES ${G(t.references.table)} (${G(t.references.column)})${n}`];
-}), Zr = (e, t = "mariadb") => {
-	for (let n of e.indexes) _i(n, t);
+	return [`  CONSTRAINT ${K(`${e.table}_${t.name}_fkey`)} FOREIGN KEY (${K(t.name)}) REFERENCES ${K(t.references.table)} (${K(t.references.column)})${n}`];
+}), ui = (e, t = "mariadb") => {
+	for (let n of e.indexes) ji(n, t);
 	let n = new Map(e.columns.map((e) => [e.name, e])), r = (e) => {
-		let t = fi(n.get(e));
-		return t === void 0 ? G(e) : `${G(e)}(${t})`;
-	}, i = e.columns.map((e) => `  ${Yr(e)}`).join(",\n"), a = Xr(e), o = a.length > 0 ? `${i},\n${a.join(",\n")}` : i, s = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${o}${Gr(e, r)}\n)`];
-	for (let n of e.columns) n.unique && n.type !== "id" && Jr(n) && s.push(`CREATE UNIQUE INDEX ${Ar(t)}${G(`${e.table}_${n.name}_key`)} ON ${G(e.table)} (${r(n.name)})`);
-	for (let n of e.indexes) n.name !== `${e.table}_pkey` && s.push(`CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${Ar(t)}${G(n.name)} ON ${G(e.table)} (${n.columns.map(r).join(", ")})`);
+		let t = Ti(n.get(e));
+		return t === void 0 ? K(e) : `${K(e)}(${t})`;
+	}, i = e.columns.map((t) => `  ${ci(t, ri(e))}`).join(",\n"), a = li(e), o = a.length > 0 ? `${i},\n${a.join(",\n")}` : i, s = [`CREATE TABLE IF NOT EXISTS ${K(e.table)} (\n${o}${ii(e, r)}\n)`];
+	for (let n of e.columns) n.unique && n.type !== "id" && si(n) && s.push(`CREATE UNIQUE INDEX ${Hr(t)}${K(`${e.table}_${n.name}_key`)} ON ${K(e.table)} (${r(n.name)})`);
+	for (let n of e.indexes) n.name !== `${e.table}_pkey` && s.push(`CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${Hr(t)}${K(n.name)} ON ${K(e.table)} (${n.columns.map(r).join(", ")})`);
 	return s;
-}, Qr = {
+}, di = {
 	cascade: "CASCADE",
 	restrict: "RESTRICT",
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
-}, $r = {
+}, fi = {
 	cascade: "CASCADE",
 	restrict: "NO ACTION",
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
-}, ei = (e) => {
-	let t = Er(e, "sqlite");
+}, pi = (e) => {
+	let t = Rr(e, "sqlite");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "integer":
@@ -2502,60 +2652,60 @@ BEGIN
 		case "bytes": return "BLOB";
 		default: return "TEXT";
 	}
-}, ti = (e, t) => e == null ? null : e === "now" ? `DEFAULT ${t}` : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? N(e, "sqlite") : null, ni = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return P(e.name, "sqlite");
-	let t = Ur(e, "sqlite");
-	if (t) return `${W(e.name)} ${ei(e)} ${t}`;
-	let n = [W(e.name), ei(e)];
-	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && n.push("UNIQUE"), e.hasDefault) {
-		let t = ti(e.defaultValue, "CURRENT_TIMESTAMP");
-		t && n.push(t);
+}, mi = (e, t) => e == null ? null : e === "now" ? `DEFAULT ${t}` : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? P(e, "sqlite") : null, hi = (e, t = !1) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return F(e.name, "sqlite");
+	let n = ti(e, "sqlite");
+	if (n) return `${G(e.name)} ${pi(e)} ${n}`;
+	let r = [G(e.name), pi(e)];
+	if (e.type === "id" && !t && r.push("PRIMARY KEY"), e.nullable || r.push("NOT NULL"), e.unique && e.type !== "id" && r.push("UNIQUE"), e.hasDefault) {
+		let t = mi(e.defaultValue, "CURRENT_TIMESTAMP");
+		t && r.push(t);
 	}
-	if (e.references && (n.push(`REFERENCES ${W(e.references.table)} (${W(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${Qr[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
+	if (e.references && (r.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && r.push(`ON DELETE ${di[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
 		let t = e.oneOf.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
-		n.push(`CHECK (${W(e.name)} IN (${t}))`);
+		r.push(`CHECK (${G(e.name)} IN (${t}))`);
 	}
-	return n.join(" ");
-}, ri = (e) => {
-	let t = e.columns.map((e) => `  ${ni(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${W(e.table)} (\n${t}${Gr(e, W)}\n)`];
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e.table)} (${t.columns.map(W).join(", ")})${Y(t)}`);
+	return r.join(" ");
+}, gi = (e) => {
+	let t = e.columns.map((t) => `  ${hi(t, ri(e))}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${ii(e, G)}\n)`];
+	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e.table)} (${t.columns.map(G).join(", ")})${Oi(t)}`);
 	return n;
-}, q = (e, t) => {
+}, J = (e, t) => {
 	let n = t.find((t) => t.tableName === e);
 	if (!n) return [];
-	let r = R([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => W(e.name)).join(", "), o = [
-		...ri({
+	let r = z([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => G(e.name)).join(", "), o = [
+		...gi({
 			kind: "create-table",
 			table: i,
 			columns: r.columns,
 			indexes: [],
 			...r.primaryKey ? { primaryKey: r.primaryKey } : {}
 		}),
-		`INSERT INTO ${W(i)} (${a}) SELECT ${a} FROM ${W(e)}`,
-		`DROP TABLE ${W(e)}`,
-		`ALTER TABLE ${W(i)} RENAME TO ${W(e)}`
+		`INSERT INTO ${G(i)} (${a}) SELECT ${a} FROM ${G(e)}`,
+		`DROP TABLE ${G(e)}`,
+		`ALTER TABLE ${G(i)} RENAME TO ${G(e)}`
 	];
-	for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e)} (${t.columns.map(W).join(", ")})${Y(t)}`);
+	for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e)} (${t.columns.map(G).join(", ")})${Oi(t)}`);
 	return o;
-}, ii = (e, t, n, r) => {
+}, _i = (e, t, n, r) => {
 	let i = r ?? e.nullable;
-	return `ALTER TABLE ${J(n)} ALTER COLUMN ${J(t)} ${M(e, "mssql")} ${i ? "NULL" : "NOT NULL"};`;
-}, ai = (e, t) => {
-	let n = `DECLARE @dc sysname; SELECT @dc = dc.name FROM sys.default_constraints dc JOIN sys.columns col ON col.object_id = dc.parent_object_id AND col.column_id = dc.parent_column_id WHERE dc.parent_object_id = OBJECT_ID(N'${e.table.replace(/'/g, "''")}') AND col.name = N'${e.column.replace(/'/g, "''")}'; IF @dc IS NOT NULL EXEC(N'ALTER TABLE ${J(e.table)} DROP CONSTRAINT [' + @dc + ']');` + (t ? ` ${t}` : "");
+	return `ALTER TABLE ${Y(n)} ALTER COLUMN ${Y(t)} ${N(e, "mssql")} ${i ? "NULL" : "NOT NULL"};`;
+}, vi = (e, t) => {
+	let n = `DECLARE @dc sysname; SELECT @dc = dc.name FROM sys.default_constraints dc JOIN sys.columns col ON col.object_id = dc.parent_object_id AND col.column_id = dc.parent_column_id WHERE dc.parent_object_id = OBJECT_ID(N'${e.table.replace(/'/g, "''")}') AND col.name = N'${e.column.replace(/'/g, "''")}'; IF @dc IS NOT NULL EXEC(N'ALTER TABLE ${Y(e.table)} DROP CONSTRAINT [' + @dc + ']');` + (t ? ` ${t}` : "");
 	if (!e.hasDefault) return n;
-	let r = ti(e.defaultValue, "SYSUTCDATETIME()");
+	let r = mi(e.defaultValue, "SYSUTCDATETIME()");
 	if (!r) return n;
 	let i = r.replace(/^DEFAULT\s+/i, "");
-	return `${n} ALTER TABLE ${J(e.table)} ADD DEFAULT ${i} FOR ${J(e.column)};`;
-}, J = (e) => `[${e.replace(/]/g, "]]")}]`, oi = (e) => {
-	let t = Er(e, "mssql");
+	return `${n} ALTER TABLE ${Y(e.table)} ADD DEFAULT ${i} FOR ${Y(e.column)};`;
+}, Y = (e) => `[${e.replace(/]/g, "]]")}]`, yi = (e) => {
+	let t = Rr(e, "mssql");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "id": return "NVARCHAR(64)";
 		case "reference": return e.referenceStorage === "numeric" ? "BIGINT" : "NVARCHAR(64)";
 		case "integer": return "INT";
 		case "real": return "FLOAT";
-		case "decimal": return wr(e, "DECIMAL");
+		case "decimal": return Ir(e, "DECIMAL");
 		case "bigint": return "BIGINT";
 		case "boolean": return "BIT";
 		case "timestamp": return "DATETIME2(6)";
@@ -2563,61 +2713,68 @@ BEGIN
 		case "bytes": return "VARBINARY(MAX)";
 		default: return "NVARCHAR(MAX)";
 	}
-}, si = (e, t) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return P(e.name, "mssql");
-	let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : oi(e), r = Ur(e, "mssql");
-	if (r) return `${J(e.name)} ${r}`;
-	let i = [J(e.name), n];
-	if (e.type === "id" && i.push("PRIMARY KEY"), e.nullable || i.push("NOT NULL"), e.unique && e.type !== "id" && i.push("UNIQUE"), e.hasDefault) {
-		let t = ti(e.defaultValue, "SYSUTCDATETIME()");
-		t && i.push(t);
-	}
-	return e.references && (i.push(`REFERENCES ${J(e.references.table)} (${J(e.references.column)})`), e.references.onDelete && i.push(`ON DELETE ${$r[e.references.onDelete]}`)), i.join(" ");
-}, ci = (e) => {
-	let t = (e) => e.replace(/'/g, "''"), n = /* @__PURE__ */ new Set([...e.indexes.flatMap((e) => e.columns), ...e.columns.filter((e) => e.unique).map((e) => e.name)]), r = e.columns.map((e) => `  ${si(e, n)}`).join(",\n"), i = `CREATE TABLE ${J(e.table)} (\n${r}${Gr(e, J)}\n)`, a = [`IF OBJECT_ID(N'${t(e.table)}', N'U') IS NULL EXEC(N'${t(i)}')`];
+}, bi = (e, t, n = !1) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return F(e.name, "mssql");
+	let r = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : yi(e), i = ti(e, "mssql");
+	if (i) return `${Y(e.name)} ${i}`;
+	let a = [Y(e.name), r];
+	if (e.type === "json" && a.push(`CHECK ${nt(Y(e.name))}`), e.type === "array" && a.push(`CHECK (${Y(e.name)} IS NULL OR ISJSON(${Y(e.name)}) = 1)`), e.type === "id" && !n && a.push("PRIMARY KEY"), e.nullable || a.push("NOT NULL"), e.unique && e.type !== "id" && a.push("UNIQUE"), e.hasDefault) {
+		let t = mi(e.defaultValue, "SYSUTCDATETIME()");
+		t && a.push(t);
+	}
+	return e.references && (a.push(`REFERENCES ${Y(e.references.table)} (${Y(e.references.column)})`), e.references.onDelete && a.push(`ON DELETE ${fi[e.references.onDelete]}`)), a.join(" ");
+}, xi = (e) => {
+	let t = (e) => e.replace(/'/g, "''"), n = /* @__PURE__ */ new Set([...e.indexes.flatMap((e) => e.columns), ...e.columns.filter((e) => e.unique).map((e) => e.name)]), r = e.columns.map((t) => `  ${bi(t, n, ri(e))}`).join(",\n"), i = `CREATE TABLE ${Y(e.table)} (\n${r}${ii(e, Y)}\n)`, a = [`IF OBJECT_ID(N'${t(e.table)}', N'U') IS NULL EXEC(N'${t(i)}')`];
 	for (let n of e.indexes) {
 		if (n.name === `${e.table}_pkey`) continue;
-		let r = `CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${J(n.name)} ON ${J(e.table)} (${n.columns.map(J).join(", ")})${Y(n)}`;
+		let r = `CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${Y(n.name)} ON ${Y(e.table)} (${n.columns.map(Y).join(", ")})${Oi(n)}`;
 		a.push(`IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = N'${t(n.name)}' AND object_id = OBJECT_ID(N'${t(e.table)}')) EXEC(N'${t(r)}')`);
 	}
 	return a;
-}, li = (e) => `__dropped_${e.replace(/[-:T.Z]/g, "").slice(0, 14)}`, ui = (e, t) => `DROP TABLE IF EXISTS ${t(e.table)};`, di = (e, t, n) => {
-	let r = `${e.table}${li(t)}`;
+}, Si = (e) => `__dropped_${e.replace(/[-:T.Z]/g, "").slice(0, 14)}`, Ci = (e, t) => `DROP TABLE IF EXISTS ${t(e.table)};`, wi = (e, t, n) => {
+	let r = `${e.table}${Si(t)}`;
 	return `ALTER TABLE ${n(e.table)} RENAME TO ${n(r)};`;
-}, fi = (e) => {
-	if (e === void 0 || !Jr(e)) return;
+}, Ti = (e) => {
+	if (e === void 0 || !si(e)) return;
 	let t = typeof e.maxLength == "number" && e.maxLength > 0 ? e.maxLength : void 0;
-	return t === void 0 ? qr : Math.min(qr, t);
-}, pi = (e, t, n) => {
-	let r = fi(Rr(e, t, n));
-	return r === void 0 ? G(n) : `${G(n)}(${r})`;
-}, mi = (e) => e.startsWith("(") ? e : W(e), Y = (e) => e.where === void 0 ? "" : ` WHERE ${e.where}`, hi = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${t ? "CONCURRENTLY " : ""}IF NOT EXISTS ${W(e.index.name)} ON ${W(e.table)} (${e.index.columns.map(mi).join(", ")})${Y(e.index)};`, gi = (e, t, n = "mariadb") => (_i(e.index, n), `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${Ar(n)}${G(e.index.name)} ON ${G(e.table)} (${e.index.columns.map((n) => pi(t, e.table, n)).join(", ")});`), _i = (e, t) => {
+	return t === void 0 ? oi : Math.min(oi, t);
+}, Ei = (e, t, n) => {
+	let r = Ti(Xr(e, t, n));
+	return r === void 0 ? K(n) : `${K(n)}(${r})`;
+}, Di = (e) => e.startsWith("(") ? e : G(e), Oi = (e) => e.where === void 0 ? "" : ` WHERE ${e.where}`, ki = (e, t) => {
+	let n = de(e.index.kind, e.index.kindOptions), r = e.index.columns.map(Di);
+	if (n.opclass !== void 0) {
+		if (r.length !== 1) throw Error("HNSW index requires exactly one column");
+		r[0] = `${r[0]} ${n.opclass}`;
+	}
+	return `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${t ? "CONCURRENTLY " : ""}IF NOT EXISTS ${G(e.index.name)} ON ${G(e.table)}${n.using} (${r.join(", ")})${n.withSuffix}${Oi(e.index)};`;
+}, Ai = (e, t, n = "mariadb") => (ji(e.index, n), `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${Hr(n)}${K(e.index.name)} ON ${K(e.table)} (${e.index.columns.map((n) => Ei(t, e.table, n)).join(", ")});`), ji = (e, t) => {
 	if (e.where !== void 0) throw Error(`Partial index '${e.name}' is not supported by ${t}; uniqueActive must be lowered before applying the plan.`);
-}, vi = (e) => `DROP INDEX IF EXISTS ${W(e.index)};`, yi = (e) => `DROP INDEX ${G(e.index)} ON ${G(e.table)};`, bi = (e) => `DROP INDEX IF EXISTS ${J(e.index)} ON ${J(e.table)};`, xi = (e, t) => `ALTER TABLE ${t(e.from)} RENAME TO ${t(e.to)};`, Si = (e) => {
+}, Mi = (e) => `DROP INDEX IF EXISTS ${G(e.index)};`, Ni = (e) => `DROP INDEX ${K(e.index)} ON ${K(e.table)};`, Pi = (e) => `DROP INDEX IF EXISTS ${Y(e.index)} ON ${Y(e.table)};`, Fi = (e, t) => `ALTER TABLE ${t(e.from)} RENAME TO ${t(e.to)};`, Ii = (e) => {
 	let t = (e) => e.replace(/'/g, "''");
 	return `EXEC sp_rename N'${t(e.from)}', N'${t(e.to)}';`;
-}, Ci = (e) => `ALTER INDEX ${W(e.from)} RENAME TO ${W(e.to)};`, wi = (e) => `ALTER TABLE ${G(e.table)} RENAME INDEX ${G(e.from)} TO ${G(e.to)};`, Ti = (e) => {
+}, Li = (e) => `ALTER INDEX ${G(e.from)} RENAME TO ${G(e.to)};`, Ri = (e) => `ALTER TABLE ${K(e.table)} RENAME INDEX ${K(e.from)} TO ${K(e.to)};`, zi = (e) => {
 	let t = (e) => e.replace(/'/g, "''");
 	return `EXEC sp_rename N'${t(e.table)}.${t(e.from)}', N'${t(e.to)}', N'INDEX';`;
-}, Ei = (e) => {
-	let t = (e) => e.replace(/'/g, "''"), n = `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${J(e.index.name)} ON ${J(e.table)} (${e.index.columns.map(J).join(", ")})${Y(e.index)}`;
+}, Bi = (e) => {
+	let t = (e) => e.replace(/'/g, "''"), n = `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${Y(e.index.name)} ON ${Y(e.table)} (${e.index.columns.map(Y).join(", ")})${Oi(e.index)}`;
 	return `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = N'${t(e.index.name)}' AND object_id = OBJECT_ID(N'${t(e.table)}')) EXEC(N'${t(n)}');`;
-}, Di = (e, t, n) => {
+}, Vi = (e, t, n) => {
 	let r = n.find((t) => t.tableName === e);
 	if (!r) return [];
 	let i = [];
 	for (let n of t) {
 		let t = r.fields[n];
-		t && t.type === "text" && !t.generatedAs && i.push(`ALTER TABLE ${J(e)} ALTER COLUMN ${J(n)} NVARCHAR(450) ${t.nullable ? "NULL" : "NOT NULL"};`);
+		t && t.type === "text" && !t.generatedAs && i.push(`ALTER TABLE ${Y(e)} ALTER COLUMN ${Y(n)} NVARCHAR(450) ${t.nullable ? "NULL" : "NOT NULL"};`);
 	}
 	return i;
-}, Oi = (e) => `ALTER TABLE ${W(e.table)} ADD CONSTRAINT ${W(`${e.table}_${e.column}_key`)} UNIQUE (${W(e.column)});`, ki = (e, t) => `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(`${e.table}_${e.column}_key`)} UNIQUE (${pi(t, e.table, e.column)});`, Ai = (e) => {
-	let t = e.fields.map((e) => W(e)).join(", ");
-	return `ALTER TABLE ${W(e.table)} ADD CONSTRAINT ${W(e.name)} UNIQUE (${t});`;
-}, ji = (e, t) => {
-	let n = e.fields.map((n) => pi(t, e.table, n)).join(", ");
-	return `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(e.name)} UNIQUE (${n});`;
-}, Mi = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(e.name)};`, Ni = (e) => `ALTER TABLE ${G(e.table)} DROP INDEX ${G(e.name)};`, Pi = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(`${e.table}_${e.column}_key`)};`, Fi = (e) => `ALTER TABLE ${G(e.table)} DROP INDEX ${G(`${e.table}_${e.column}_key`)};`, Ii = (e, t) => {
+}, Hi = (e) => `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(`${e.table}_${e.column}_key`)} UNIQUE (${G(e.column)});`, Ui = (e, t) => `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(`${e.table}_${e.column}_key`)} UNIQUE (${Ei(t, e.table, e.column)});`, Wi = (e) => {
+	let t = e.fields.map((e) => G(e)).join(", ");
+	return `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(e.name)} UNIQUE (${t});`;
+}, Gi = (e, t) => {
+	let n = e.fields.map((n) => Ei(t, e.table, n)).join(", ");
+	return `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(e.name)} UNIQUE (${n});`;
+}, Ki = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(e.name)};`, qi = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(e.name)};`, Ji = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_key`)};`, Yi = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(`${e.table}_${e.column}_key`)};`, Xi = (e, t) => {
 	let n = [], r = t(e.table), i = t(e.column), a = t(e.targetTable), o = t(e.targetColumn);
 	if (e.orphanPolicy) {
 		let t = `${i} IS NOT NULL AND ${i} NOT IN (SELECT ${o} FROM ${a})`;
@@ -2635,36 +2792,36 @@ BEGIN
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
 	}[e.onDelete]}`), n.push(s.join(" ") + ";"), n;
-}, Li = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(`${e.table}_${e.column}_fkey`)};`, Ri = (e) => `ALTER TABLE ${G(e.table)} DROP FOREIGN KEY ${G(`${e.table}_${e.column}_fkey`)};`, zi = (e, t) => {
+}, Zi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_fkey`)};`, Qi = (e) => `ALTER TABLE ${K(e.table)} DROP FOREIGN KEY ${K(`${e.table}_${e.column}_fkey`)};`, $i = (e, t) => {
 	let n = e.values.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
 	return `ALTER TABLE ${t(e.table)} ADD CONSTRAINT ${t(`${e.table}_${e.column}_check`)} CHECK (${t(e.column)} IN (${n}));`;
-}, Bi = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(`${e.table}_${e.column}_check`)};`, Vi = (e, t) => w.gen(function* () {
+}, ea = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_check`)};`, ta = (e, t) => T.gen(function* () {
 	let n = yield* e`
       SELECT cc.constraint_name AS n, cc.check_clause AS c
       FROM information_schema.check_constraints cc
-      WHERE cc.constraint_schema = DATABASE() AND cc.table_name = ${t.table}`.pipe(w.orElse(() => e`
+      WHERE cc.constraint_schema = DATABASE() AND cc.table_name = ${t.table}`.pipe(T.orElse(() => e`
         SELECT cc.constraint_name AS n, cc.check_clause AS c
         FROM information_schema.check_constraints cc
         JOIN information_schema.table_constraints tc
           ON tc.constraint_schema = cc.constraint_schema
          AND tc.constraint_name   = cc.constraint_name
-        WHERE tc.table_schema = DATABASE() AND tc.table_name = ${t.table}`), w.orElseSucceed(() => []));
+        WHERE tc.table_schema = DATABASE() AND tc.table_name = ${t.table}`), T.orElseSucceed(() => []));
 	for (let e of n) {
 		let n = String(e.n ?? "");
-		if (n !== "" && Gn(String(e.c ?? ""))?.column === t.column) return n;
+		if (n !== "" && tr(String(e.c ?? ""))?.column === t.column) return n;
 	}
-}), Hi = (e, t, n) => w.gen(function* () {
-	let r = yield* Vi(e, t);
-	r !== void 0 && (yield* X(e, `ALTER TABLE ${G(t.table)} DROP CONSTRAINT ${G(r)};`, t.kind, [Cr]));
-	let i = yield* Vi(e, t);
+}), na = (e, t, n) => T.gen(function* () {
+	let r = yield* ta(e, t);
+	r !== void 0 && (yield* X(e, `ALTER TABLE ${K(t.table)} DROP CONSTRAINT ${K(r)};`, t.kind, [Nr]));
+	let i = yield* ta(e, t);
 	if (i === void 0) return;
-	let a = K(n, t.table, t.column);
-	if (!a) return yield* w.die(/* @__PURE__ */ Error(`applier: cannot drop the CHECK on '${t.table}.${t.column}' — it is column-level (catalog name '${i}'), which this family removes only by redefining the column, and the declared column is not available to redefine it from.`));
-	yield* X(e, `ALTER TABLE ${G(t.table)} MODIFY COLUMN ${zr(a, t.column)};`, t.kind);
-}), Ui = (e, t, n, r) => {
-	let i = e.column, a = r === "mariadb", o = a ? G : r === "mssql" ? J : W, s = a ? kr(i) : r === "mssql" ? oi(i) : r === "sqlite" ? ei(i) : Dr(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = (e) => a ? Br(e, i) : r === "mssql" ? ti(e, "SYSUTCDATETIME()") : r === "sqlite" ? ti(e, "CURRENT_TIMESTAMP") : Hr(e, i), u = Ur(i, r);
-	if (u) {
-		let t = r === "mssql" ? `${o(i.name)} ${u}` : `${o(i.name)} ${s} ${u}`;
+	let a = q(n, t.table, t.column);
+	if (!a) return yield* T.die(/* @__PURE__ */ Error(`applier: cannot drop the CHECK on '${t.table}.${t.column}' — it is column-level (catalog name '${i}'), which this family removes only by redefining the column, and the declared column is not available to redefine it from.`));
+	yield* X(e, `ALTER TABLE ${K(t.table)} MODIFY COLUMN ${Zr(a, t.column)};`, t.kind);
+}), ra = (e, t, n, r) => {
+	let i = e.column, a = r === "mariadb", o = a ? K : r === "mssql" ? Y : G, s = a ? Vr(i) : r === "mssql" ? yi(i) : r === "sqlite" ? pi(i) : zr(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = r === "mssql" ? i.type === "json" ? ` CHECK ${nt(o(i.name))}` : i.type === "array" ? ` CHECK (${o(i.name)} IS NULL OR ISJSON(${o(i.name)}) = 1)` : "" : "", u = (e) => a ? Qr(e, i) : r === "mssql" ? mi(e, "SYSUTCDATETIME()") : r === "sqlite" ? mi(e, "CURRENT_TIMESTAMP") : ei(e, i), d = ti(i, r);
+	if (d) {
+		let t = r === "mssql" ? `${o(i.name)} ${d}` : `${o(i.name)} ${s} ${d}`;
 		return {
 			pre: [`ALTER TABLE ${o(e.table)} ${c} ${t};`],
 			post: []
@@ -2673,24 +2830,24 @@ BEGIN
 	if (t.classification === "safe") {
 		let t = [`ALTER TABLE ${o(e.table)} ${c} ${o(i.name)} ${s}`];
 		return i.unique && t.push("UNIQUE"), {
-			pre: [`${t.join(" ")};`],
+			pre: [`${t.join(" ")}${l};`],
 			post: []
 		};
 	}
 	if (t.classification === "needs-default") {
-		let t = l(i.defaultValue);
+		let t = u(i.defaultValue);
 		if (t === null) throw Error(`migration applier: cannot render the declared default for '${e.table}.${i.name}' (${JSON.stringify(i.defaultValue)}) while adding it NOT NULL to a populated table. This is a framework bug — report the column type + default.`);
 		return {
-			pre: [`ALTER TABLE ${o(e.table)} ${c} ${o(i.name)} ${s} NOT NULL ${t};`],
+			pre: [`ALTER TABLE ${o(e.table)} ${c} ${o(i.name)} ${s} NOT NULL ${t}${l};`],
 			post: []
 		};
 	}
-	let d = n(e.table, i.name), f = a ? `ALTER TABLE ${o(e.table)} MODIFY COLUMN ${o(i.name)} ${s} NOT NULL;` : r === "mssql" ? `ALTER TABLE ${o(e.table)} ALTER COLUMN ${o(i.name)} ${s} NOT NULL;` : r === "sqlite" ? null : `ALTER TABLE ${o(e.table)} ALTER COLUMN ${o(i.name)} SET NOT NULL;`, p = {
-		pre: [`ALTER TABLE ${o(e.table)} ${c} ${o(i.name)} ${s};`],
-		post: f ? [f] : []
+	let f = n(e.table, i.name), p = a ? `ALTER TABLE ${o(e.table)} MODIFY COLUMN ${o(i.name)} ${s} NOT NULL;` : r === "mssql" ? `ALTER TABLE ${o(e.table)} ALTER COLUMN ${o(i.name)} ${s} NOT NULL;` : r === "sqlite" ? null : `ALTER TABLE ${o(e.table)} ALTER COLUMN ${o(i.name)} SET NOT NULL;`, m = {
+		pre: [`ALTER TABLE ${o(e.table)} ${c} ${o(i.name)} ${s}${l};`],
+		post: p ? [p] : []
 	};
-	return d?.sql && (p.backfillKind = "sql", p.backfillSql = d.sql), d?.js && (p.backfillKind = "js", p.backfillJs = d.js), d?.batchSize !== void 0 && (p.batchSize = d.batchSize), d?.sleepMs !== void 0 && (p.sleepMs = d.sleepMs), p;
-}, Wi = (e) => {
+	return f?.sql && (m.backfillKind = "sql", m.backfillSql = f.sql), f?.js && (m.backfillKind = "js", m.backfillJs = f.js), f?.batchSize !== void 0 && (m.batchSize = f.batchSize), f?.sleepMs !== void 0 && (m.sleepMs = f.sleepMs), m;
+}, ia = (e) => {
 	let t = new Map(e.map((e) => [e.tableName, e]));
 	return (e, n) => {
 		let r = t.get(e);
@@ -2710,47 +2867,47 @@ BEGIN
 			...o
 		};
 	};
-}, X = (e, t, n, r = []) => e.unsafe(t).pipe(w.catchIf((e) => yr(e, r), () => w.void), w.tapError((e) => w.sync(() => {
-	process.stderr.write(se(`applier: statement failed (op=${n})`, t, e, 400));
-})), w.mapError((e) => {
-	let r = se(`applier: statement failed (op=${n})`, t, e, 400).trim();
+}, X = (e, t, n, r = []) => e.unsafe(t).pipe(T.catchIf((e) => kr(e, r), () => T.void), T.tapError((e) => T.sync(() => {
+	process.stderr.write(fe(`applier: statement failed (op=${n})`, t, e, 400));
+})), T.mapError((e) => {
+	let r = fe(`applier: statement failed (op=${n})`, t, e, 400).trim();
 	return Object.assign(e, { message: r });
-}), w.map(() => void 0)), Z = (e, t, n) => w.forEach(t, (t) => X(e, t, n), { discard: !0 }), Q = (e, t) => e.literal(`LIMIT ${Math.max(1, Math.floor(Number.isFinite(t) ? t : 1))}`), $ = (e, t, n, r) => e.unsafe(`SELECT ${r === void 0 ? "*" : o(r, t)} FROM ${o(n, t)} WHERE 1=0`).pipe(w.as(!0), w.catchAll(() => w.succeed(!1))), Gi = (e, t) => w.gen(function* () {
-	let n = R([Be], t).tables[0];
-	if (!n) return yield* w.die(/* @__PURE__ */ Error("migration applier: the resume-ledger table descriptor produced no snapshot. This is a framework bug."));
+}), T.map(() => void 0)), Z = (e, t, n) => T.forEach(t, (t) => X(e, t, n), { discard: !0 }), Q = (e, t) => e.literal(`LIMIT ${Math.max(1, Math.floor(Number.isFinite(t) ? t : 1))}`), $ = (e, t, n, r) => e.unsafe(`SELECT ${r === void 0 ? "*" : o(r, t)} FROM ${o(n, t)} WHERE 1=0`).pipe(T.as(!0), T.catchAll(() => T.succeed(!1))), aa = (e, t) => T.gen(function* () {
+	let n = z([Ge], t).tables[0];
+	if (!n) return yield* T.die(/* @__PURE__ */ Error("migration applier: the resume-ledger table descriptor produced no snapshot. This is a framework bug."));
 	let r = {
 		kind: "create-table",
-		table: k,
+		table: A,
 		columns: n.columns,
 		indexes: []
 	}, i = yield* e.onDialectOrElse({
-		mysql: () => hr(e).pipe(w.map((e) => Zr(r, e))),
-		mssql: () => w.succeed(ci(r)),
-		sqlite: () => w.succeed(ri(r)),
-		orElse: () => w.succeed(Kr(r))
+		mysql: () => Tr(e).pipe(T.map((e) => ui(r, e))),
+		mssql: () => T.succeed(xi(r)),
+		sqlite: () => T.succeed(gi(r)),
+		orElse: () => T.succeed(ai(r))
 	});
-	yield* w.forEach(i, (t) => X(e, t, "resume-ledger-bootstrap"), { discard: !0 });
-}), Ki = (e) => e`
+	yield* T.forEach(i, (t) => X(e, t, "resume-ledger-bootstrap"), { discard: !0 });
+}), oa = (e) => e`
     SELECT ${e("runId")}, ${e("planFingerprint")}, ${e("opIndex")},
            ${e("status")}, ${e("payload")}
-    FROM ${e(k)}
-  `, qi = (e, t, n, r) => w.gen(function* () {
-	let i = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
-	yield* w.forEach(r, ({ index: r, planned: a }) => e`
-        INSERT INTO ${e(k)}
+    FROM ${e(A)}
+  `, sa = (e, t, n, r) => T.gen(function* () {
+	let i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
+	yield* T.forEach(r, ({ index: r, planned: a }) => e`
+        INSERT INTO ${e(A)}
           (${e("id")}, ${e("runId")}, ${e("planFingerprint")}, ${e("opIndex")},
            ${e("opKind")}, ${e("opTarget")}, ${e("status")}, ${e("payload")},
            ${e("createdAt")})
         VALUES
           (${`mop_${t}_${r}`}, ${t}, ${n}, ${r},
-           ${a.op.kind}, ${He(a.op)}, ${"pending"},
+           ${a.op.kind}, ${qe(a.op)}, ${"pending"},
            ${JSON.stringify(a)}, ${i})
       `, { discard: !0 });
-}), Ji = (e, t, n, r, i) => w.gen(function* () {
-	let a = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
+}), ca = (e, t, n, r, i) => T.gen(function* () {
+	let a = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
 	if (r === "applied") {
 		yield* e`
-        UPDATE ${e(k)}
+        UPDATE ${e(A)}
         SET ${e("status")} = ${r}, ${e("appliedAt")} = ${a},
             ${e("durationMs")} = ${i ?? null}
         WHERE ${e("runId")} = ${t} AND ${e("opIndex")} = ${n}
@@ -2758,295 +2915,322 @@ BEGIN
 		return;
 	}
 	yield* e`
-      UPDATE ${e(k)}
+      UPDATE ${e(A)}
       SET ${e("status")} = ${r}, ${e("startedAt")} = ${a}
       WHERE ${e("runId")} = ${t} AND ${e("opIndex")} = ${n}
     `;
-}), Yi = (e, t, n, r) => w.gen(function* () {
-	let i = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
+}), la = (e, t, n, r) => T.gen(function* () {
+	let i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
 	r.length > 0 && (yield* e`
-        UPDATE ${e(k)}
+        UPDATE ${e(A)}
         SET ${e("status")} = ${"applied"}, ${e("appliedAt")} = ${i}
         WHERE ${e("runId")} = ${t} AND ${e("opIndex")} IN ${e.in(r)}
       `), n.length > 0 && (yield* e`
-        UPDATE ${e(k)}
+        UPDATE ${e(A)}
         SET ${e("status")} = ${"pending"}
         WHERE ${e("runId")} = ${t} AND ${e("opIndex")} IN ${e.in(n)}
       `);
-}), Xi = (e, t) => t === void 0 ? e`DELETE FROM ${e(k)}`.pipe(w.asVoid) : e`DELETE FROM ${e(k)} WHERE ${e("runId")} = ${t}`.pipe(w.asVoid), Zi = (e, t, n) => w.gen(function* () {
-	if (Xe(n.op, n.classification, t) !== "artefact-repair") return "clean";
+}), ua = (e, t) => t === void 0 ? e`DELETE FROM ${e(A)}`.pipe(T.asVoid) : e`DELETE FROM ${e(A)} WHERE ${e("runId")} = ${t}`.pipe(T.asVoid), da = (e, t, n) => T.gen(function* () {
+	if (tt(n.op, n.classification, t) !== "artefact-repair") return "clean";
 	let r = n.op, i = (e) => o(e, t);
 	if (t === "sqlite" || t === "turso") {
 		if (!("table" in r)) return "clean";
-		let n = `${r.table}${Ge}`;
-		return (yield* $(e, t, n)) ? ((yield* $(e, t, r.table)) ? yield* X(e, `DROP TABLE ${i(n)}`, "resume-repair") : yield* X(e, `ALTER TABLE ${i(n)} RENAME TO ${i(r.table)}`, "resume-repair"), yield* w.logWarning(`migration resume: reconciled an interrupted sqlite table rebuild on '${r.table}' — replaying the operation`).pipe(w.annotateLogs({ scope: "voltro:migrate" })), "outstanding") : "clean";
+		let n = `${r.table}${Xe}`;
+		return (yield* $(e, t, n)) ? ((yield* $(e, t, r.table)) ? yield* X(e, `DROP TABLE ${i(n)}`, "resume-repair") : yield* X(e, `ALTER TABLE ${i(n)} RENAME TO ${i(r.table)}`, "resume-repair"), yield* T.logWarning(`migration resume: reconciled an interrupted sqlite table rebuild on '${r.table}' — replaying the operation`).pipe(T.annotateLogs({ scope: "voltro:migrate" })), "outstanding") : "clean";
 	}
 	if (r.kind !== "alter-column-type") return "clean";
-	let a = `${r.column}${Ke}`, s = `${r.column}${qe}`, c = yield* $(e, t, r.table, r.column), l = yield* $(e, t, r.table, a), u = yield* $(e, t, r.table, s), d = (e) => w.logWarning(`migration resume: ${e}`).pipe(w.annotateLogs({ scope: "voltro:migrate" }));
-	return !l && !u ? "clean" : c && l && !u ? (yield* X(e, `ALTER TABLE ${i(r.table)} DROP COLUMN ${i(a)}`, "resume-repair"), yield* d(`dropped a half-populated shadow column '${r.table}.${a}' — replaying the type change`), "outstanding") : !c && l && u ? (yield* X(e, `ALTER TABLE ${i(r.table)} RENAME COLUMN ${i(a)} TO ${i(r.column)}`, "resume-repair"), yield* X(e, `ALTER TABLE ${i(r.table)} DROP COLUMN ${i(s)}`, "resume-repair"), yield* d(`completed an interrupted shadow swap on '${r.table}.${r.column}'`), "applied") : c && !l && u ? (yield* X(e, `ALTER TABLE ${i(r.table)} DROP COLUMN ${i(s)}`, "resume-repair"), yield* d(`dropped the leftover pre-swap column '${r.table}.${s}'`), "applied") : yield* w.die(/* @__PURE__ */ Error(`applyPlan: an interrupted online type change on '${r.table}.${r.column}' left a shadow-swap state this resume cannot classify (column=${c}, ${a}=${l}, ${s}=${u}).\nNothing was changed. Inspect those three columns and reconcile them by hand — the data is in whichever of them is populated — then re-run the migration.`));
-}), Qi = (e, t, n, r = "fresh") => w.gen(function* () {
-	let i = process.hrtime.bigint(), a = Wi(n.declared), o = t.op;
-	switch (o.kind) {
+	let a = `${r.column}${Ze}`, s = `${r.column}${Qe}`, c = yield* $(e, t, r.table, r.column), l = yield* $(e, t, r.table, a), u = yield* $(e, t, r.table, s), d = (e) => T.logWarning(`migration resume: ${e}`).pipe(T.annotateLogs({ scope: "voltro:migrate" }));
+	return !l && !u ? "clean" : c && l && !u ? (yield* X(e, `ALTER TABLE ${i(r.table)} DROP COLUMN ${i(a)}`, "resume-repair"), yield* d(`dropped a half-populated shadow column '${r.table}.${a}' — replaying the type change`), "outstanding") : !c && l && u ? (yield* X(e, `ALTER TABLE ${i(r.table)} RENAME COLUMN ${i(a)} TO ${i(r.column)}`, "resume-repair"), yield* X(e, `ALTER TABLE ${i(r.table)} DROP COLUMN ${i(s)}`, "resume-repair"), yield* d(`completed an interrupted shadow swap on '${r.table}.${r.column}'`), "applied") : c && !l && u ? (yield* X(e, `ALTER TABLE ${i(r.table)} DROP COLUMN ${i(s)}`, "resume-repair"), yield* d(`dropped the leftover pre-swap column '${r.table}.${s}'`), "applied") : yield* T.die(/* @__PURE__ */ Error(`applyPlan: an interrupted online type change on '${r.table}.${r.column}' left a shadow-swap state this resume cannot classify (column=${c}, ${a}=${l}, ${s}=${u}).\nNothing was changed. Inspect those three columns and reconcile them by hand — the data is in whichever of them is populated — then re-run the migration.`));
+}), fa = (e, t, n, r = "fresh") => T.gen(function* () {
+	let i = process.hrtime.bigint(), a = ia(n.declared), s = t.op;
+	switch (s.kind) {
 		case "create-table": {
 			let t = yield* e.onDialectOrElse({
-				mysql: () => hr(e).pipe(w.map((e) => Zr(o, e))),
-				mssql: () => w.succeed(ci(o)),
-				sqlite: () => w.succeed(ri(o)),
-				orElse: () => w.succeed(Kr(o))
+				mysql: () => Tr(e).pipe(T.map((e) => ui(s, e))),
+				mssql: () => T.succeed(xi(s)),
+				sqlite: () => T.succeed(gi(s)),
+				orElse: () => T.succeed(ai(s))
 			}), n = yield* e.onDialectOrElse({
-				mysql: () => w.succeed([br]),
-				orElse: () => w.succeed([])
+				mysql: () => T.succeed([Ar]),
+				orElse: () => T.succeed([])
 			});
-			for (let r of t) yield* X(e, r, o.kind, n);
+			for (let r of t) yield* X(e, r, s.kind, n);
 			break;
 		}
 		case "drop-table": {
-			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString(), r = (e) => t ? di(o, n, e) : ui(o, e);
+			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString(), r = (e) => t ? wi(s, n, e) : Ci(s, e);
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, r(G), o.kind),
-				orElse: () => X(e, r(W), o.kind)
+				mysql: () => X(e, r(K), s.kind),
+				orElse: () => X(e, r(G), s.kind)
 			});
 			break;
 		}
 		case "drop-column": {
 			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString();
 			yield* e.onDialectOrElse({
-				mysql: () => hr(e).pipe(w.flatMap((r) => X(e, t ? Pr(o, n, G) : Mr(o, r), o.kind, t ? [] : [xr]))),
-				sqlite: () => X(e, t ? Pr(o, n, W) : jr(o, W, !1), o.kind, t ? [] : [Sr]),
-				orElse: () => X(e, t ? Pr(o, n, W) : jr(o, W), o.kind)
+				mysql: () => Tr(e).pipe(T.flatMap((r) => X(e, t ? Kr(s, n, K) : Wr(s, r), s.kind, t ? [] : [jr]))),
+				sqlite: () => X(e, t ? Kr(s, n, G) : Ur(s, G, !1), s.kind, t ? [] : [Mr]),
+				orElse: () => X(e, t ? Kr(s, n, G) : Ur(s, G), s.kind)
 			});
 			break;
 		}
 		case "rename-column":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, Nr(o, G), o.kind),
-				mssql: () => X(e, `EXEC sp_rename N'${o.table.replace(/'/g, "''")}.${o.from.replace(/'/g, "''")}', N'${o.to.replace(/'/g, "''")}', 'COLUMN';`, o.kind),
-				orElse: () => X(e, Nr(o, W), o.kind)
+				mysql: () => X(e, Gr(s, K), s.kind),
+				mssql: () => T.gen(function* () {
+					let t = (yield* e`
+              SELECT ck.name, ck.definition, ck.is_disabled AS disabled,
+                ck.is_not_trusted AS untrusted, ck.is_not_for_replication AS notForReplication
+              FROM sys.check_constraints ck
+              WHERE ck.parent_object_id = OBJECT_ID(${s.table}) AND EXISTS (
+                SELECT 1 FROM sys.sql_expression_dependencies dep
+                JOIN sys.columns col ON col.object_id = dep.referenced_id AND col.column_id = dep.referenced_minor_id
+                WHERE dep.referencing_id = ck.object_id AND col.object_id = ck.parent_object_id AND col.name = ${s.from}
+              ) ORDER BY ck.name
+            `).map((e) => ({
+						...e,
+						definition: Fr(e.definition, s.from, s.to)
+					})), n = (e) => o(e, "mssql"), r = (e) => e.replace(/'/g, "''");
+					return yield* Z(e, [
+						...t.map((e) => `ALTER TABLE ${n(s.table)} DROP CONSTRAINT ${n(e.name)}`),
+						`EXEC sp_rename N'${r(`${n(s.table)}.${n(s.from)}`)}', N'${r(s.to)}', 'COLUMN';`,
+						...t.flatMap((e) => [`ALTER TABLE ${n(s.table)} WITH ${e.untrusted ? "NOCHECK" : "CHECK"} ADD CONSTRAINT ${n(e.name)} CHECK ${e.notForReplication ? "NOT FOR REPLICATION " : ""}${e.definition}`, ...e.disabled ? [`ALTER TABLE ${n(s.table)} NOCHECK CONSTRAINT ${n(e.name)}`] : []])
+					], s.kind);
+				}),
+				orElse: () => X(e, Gr(s, G), s.kind)
 			});
 			break;
 		case "add-index":
 			yield* e.onDialectOrElse({
-				sqlite: () => X(e, hi(o, !1), o.kind),
-				mysql: () => hr(e).pipe(w.flatMap((t) => X(e, gi(o, n.declared, t), o.kind, [br]))),
-				mssql: () => Z(e, [...Di(o.table, o.index.columns, n.declared), Ei(o)], o.kind),
-				orElse: () => X(e, hi(o, t.classification === "online-required"), o.kind)
+				sqlite: () => X(e, ki(s, !1), s.kind),
+				mysql: () => Tr(e).pipe(T.flatMap((t) => X(e, Ai(s, n.declared, t), s.kind, [Ar]))),
+				mssql: () => Z(e, [...Vi(s.table, s.index.columns, n.declared), Bi(s)], s.kind),
+				orElse: () => X(e, ki(s, t.classification === "online-required"), s.kind)
 			});
 			break;
 		case "drop-index":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, yi(o), o.kind),
-				mssql: () => X(e, bi(o), o.kind),
-				orElse: () => X(e, vi(o), o.kind)
+				mysql: () => X(e, Ni(s), s.kind),
+				mssql: () => X(e, Pi(s), s.kind),
+				orElse: () => X(e, Mi(s), s.kind)
 			});
 			break;
 		case "rename-table":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, xi(o, G), o.kind),
-				mssql: () => X(e, Si(o), o.kind),
-				orElse: () => X(e, xi(o, W), o.kind)
+				mysql: () => X(e, Fi(s, K), s.kind),
+				mssql: () => X(e, Ii(s), s.kind),
+				orElse: () => X(e, Fi(s, G), s.kind)
 			});
 			break;
 		case "rename-index":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, wi(o), o.kind),
-				mssql: () => X(e, Ti(o), o.kind),
-				orElse: () => X(e, Ci(o), o.kind)
+				mysql: () => X(e, Ri(s), s.kind),
+				mssql: () => X(e, zi(s), s.kind),
+				orElse: () => X(e, Li(s), s.kind)
 			});
 			break;
 		case "add-unique":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, ki(o, n.declared), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				mssql: () => Z(e, [...Di(o.table, [o.column], n.declared), Oi(o)], o.kind),
-				orElse: () => X(e, Oi(o), o.kind)
+				mysql: () => X(e, Ui(s, n.declared), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				mssql: () => Z(e, [...Vi(s.table, [s.column], n.declared), Hi(s)], s.kind),
+				orElse: () => X(e, Hi(s), s.kind)
 			});
 			break;
 		case "drop-unique":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, Fi(o), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => X(e, Pi(o), o.kind)
+				mysql: () => X(e, Yi(s), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => X(e, Ji(s), s.kind)
 			});
 			break;
 		case "add-unique-composite":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, ji(o, n.declared), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				mssql: () => Z(e, [...Di(o.table, o.fields, n.declared), Ai(o)], o.kind),
-				orElse: () => X(e, Ai(o), o.kind)
+				mysql: () => X(e, Gi(s, n.declared), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				mssql: () => Z(e, [...Vi(s.table, s.fields, n.declared), Wi(s)], s.kind),
+				orElse: () => X(e, Wi(s), s.kind)
 			});
 			break;
 		case "drop-unique-composite":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, Ni(o), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => X(e, Mi(o), o.kind)
+				mysql: () => X(e, qi(s), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => X(e, Ki(s), s.kind)
 			});
 			break;
 		case "add-foreign-key":
 			yield* e.onDialectOrElse({
-				mysql: () => Z(e, Ii(o, G), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => Z(e, Ii(o, W), o.kind)
+				mysql: () => Z(e, Xi(s, K), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => Z(e, Xi(s, G), s.kind)
 			});
 			break;
 		case "add-column": {
-			let n = Ui(o, t, a, yield* e.onDialectOrElse({
-				mysql: () => w.succeed("mariadb"),
-				mssql: () => w.succeed("mssql"),
-				sqlite: () => w.succeed("sqlite"),
-				orElse: () => w.succeed("postgres")
+			let n = ra(s, t, a, yield* e.onDialectOrElse({
+				mysql: () => T.succeed("mariadb"),
+				mssql: () => T.succeed("mssql"),
+				sqlite: () => T.succeed("sqlite"),
+				orElse: () => T.succeed("postgres")
 			}));
-			if (!(r === "resume" && (yield* $(e, Le(e), o.table, o.column.name)))) for (let t of n.pre) yield* X(e, t, o.kind);
+			if (!(r === "resume" && (yield* $(e, He(e), s.table, s.column.name)))) for (let t of n.pre) yield* X(e, t, s.kind);
 			if (n.backfillKind === "sql" && n.backfillSql) {
-				if (t.classification !== "online-required" && n.batchSize === void 0) yield* e`UPDATE ${e(o.table)} SET ${e(o.column.name)} = ${n.backfillSql}`;
+				if (t.classification !== "online-required" && n.batchSize === void 0) yield* e`UPDATE ${e(s.table)} SET ${e(s.column.name)} = ${n.backfillSql}`;
 				else {
 					let t = n.batchSize ?? 5e3, r = n.sleepMs ?? 0, i, a = 0;
 					for (;;) {
-						let s = i === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(o.column.name)} IS NULL ORDER BY ${e("id")} ${Q(e, t)}` : yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(o.column.name)} IS NULL AND ${e("id")} > ${i} ORDER BY ${e("id")} ${Q(e, t)}`;
-						if (s.length === 0) break;
-						let c = s.map((e) => e.id);
-						yield* e`UPDATE ${e(o.table)} SET ${e(o.column.name)} = ${n.backfillSql} WHERE ${e("id")} IN ${e.in(c)}`, a += s.length, yield* w.logInfo(`backfill ${o.table}.${o.column.name}: ${a} rows`).pipe(w.annotateLogs({
+						let o = i === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(s.table)} WHERE ${e(s.column.name)} IS NULL ORDER BY ${e("id")} ${Q(e, t)}` : yield* e`SELECT ${e("id")} FROM ${e(s.table)} WHERE ${e(s.column.name)} IS NULL AND ${e("id")} > ${i} ORDER BY ${e("id")} ${Q(e, t)}`;
+						if (o.length === 0) break;
+						let c = o.map((e) => e.id);
+						yield* e`UPDATE ${e(s.table)} SET ${e(s.column.name)} = ${n.backfillSql} WHERE ${e("id")} IN ${e.in(c)}`, a += o.length, yield* T.logInfo(`backfill ${s.table}.${s.column.name}: ${a} rows`).pipe(T.annotateLogs({
 							scope: "voltro:migrate",
 							mode: "sql-batched"
-						})), i = s[s.length - 1].id, r > 0 && (yield* w.sleep(`${r} millis`));
+						})), i = o[o.length - 1].id, r > 0 && (yield* T.sleep(`${r} millis`));
 					}
 				}
 			} else if (n.backfillKind === "js" && n.backfillJs) {
 				let t = n.batchSize ?? 1e3, r = n.sleepMs ?? 0, i, a = 0;
 				for (;;) {
-					let s = i === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(o.column.name)} IS NULL ORDER BY ${e("id")} ${Q(e, t)}` : yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(o.column.name)} IS NULL AND ${e("id")} > ${i} ORDER BY ${e("id")} ${Q(e, t)}`;
-					if (s.length === 0) break;
-					for (let t of s) {
-						let r = yield* w.tryPromise({
+					let o = i === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(s.table)} WHERE ${e(s.column.name)} IS NULL ORDER BY ${e("id")} ${Q(e, t)}` : yield* e`SELECT ${e("id")} FROM ${e(s.table)} WHERE ${e(s.column.name)} IS NULL AND ${e("id")} > ${i} ORDER BY ${e("id")} ${Q(e, t)}`;
+					if (o.length === 0) break;
+					for (let t of o) {
+						let r = yield* T.tryPromise({
 							try: () => Promise.resolve(n.backfillJs({ id: t.id })),
 							catch: (e) => e
-						}).pipe(w.orDie);
-						yield* e`UPDATE ${e(o.table)} SET ${e(o.column.name)} = ${r} WHERE ${e("id")} = ${t.id}`;
+						}).pipe(T.orDie);
+						yield* e`UPDATE ${e(s.table)} SET ${e(s.column.name)} = ${r} WHERE ${e("id")} = ${t.id}`;
 					}
-					a += s.length, yield* w.logInfo(`backfill ${o.table}.${o.column.name}: ${a} rows processed`).pipe(w.annotateLogs({
+					a += o.length, yield* T.logInfo(`backfill ${s.table}.${s.column.name}: ${a} rows processed`).pipe(T.annotateLogs({
 						scope: "voltro:migrate",
-						table: o.table,
-						column: o.column.name
-					})), i = s[s.length - 1].id, r > 0 && (yield* w.sleep(`${r} millis`));
+						table: s.table,
+						column: s.column.name
+					})), i = o[o.length - 1].id, r > 0 && (yield* T.sleep(`${r} millis`));
 				}
 			}
-			for (let t of n.post) yield* X(e, t, o.kind);
+			for (let t of n.post) yield* X(e, t, s.kind);
 			break;
 		}
 		case "alter-column-nullability":
 			yield* e.onDialectOrElse({
 				mysql: () => {
-					let t = K(n.declared, o.table, o.column);
-					return t ? X(e, `ALTER TABLE ${G(o.table)} MODIFY COLUMN ${zr(t, o.column, o.toNullable)};`, o.kind) : w.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
+					let t = q(n.declared, s.table, s.column);
+					return t ? X(e, `ALTER TABLE ${K(s.table)} MODIFY COLUMN ${Zr(t, s.column, s.toNullable)};`, s.kind) : T.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${s.table}.${s.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
 				},
 				mssql: () => {
-					let t = K(n.declared, o.table, o.column);
-					return t ? X(e, ii(t, o.column, o.table, o.toNullable), o.kind) : w.die(/* @__PURE__ */ Error(`alter-column-nullability on mssql needs the declared column '${o.table}.${o.column}'.`));
+					let t = q(n.declared, s.table, s.column);
+					return t ? X(e, _i(t, s.column, s.table, s.toNullable), s.kind) : T.die(/* @__PURE__ */ Error(`alter-column-nullability on mssql needs the declared column '${s.table}.${s.column}'.`));
 				},
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => X(e, `ALTER TABLE ${W(o.table)} ALTER COLUMN ${W(o.column)} ${o.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, o.kind)
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => X(e, `ALTER TABLE ${G(s.table)} ALTER COLUMN ${G(s.column)} ${s.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, s.kind)
 			});
 			break;
 		case "alter-column-default": {
-			let t = Rr(n.declared, o.table, o.column), r = K(n.declared, o.table, o.column), i = (e) => o.hasDefault && r !== void 0 && Ir(r, e) ? r : void 0;
+			let t = Xr(n.declared, s.table, s.column), r = q(n.declared, s.table, s.column), i = (e) => s.hasDefault && r !== void 0 && Jr(r, e) ? r : void 0;
 			yield* e.onDialectOrElse({
 				mysql: () => {
 					let n = i("mariadb");
-					return X(e, n ? `ALTER TABLE ${G(o.table)} MODIFY COLUMN ${zr(n, o.column)};` : Fr(o, G, (e) => Br(e, t)), o.kind);
+					return X(e, n ? `ALTER TABLE ${K(s.table)} MODIFY COLUMN ${Zr(n, s.column)};` : qr(s, K, (e) => Qr(e, t)), s.kind);
 				},
 				mssql: () => {
 					let t = i("mssql");
-					return X(e, ai(o, t ? ii(t, o.column, o.table) : void 0), o.kind);
+					return X(e, vi(s, t ? _i(t, s.column, s.table) : void 0), s.kind);
 				},
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => X(e, Fr(o, W, (e) => Hr(e, t)), o.kind)
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => X(e, qr(s, G, (e) => ei(e, t)), s.kind)
 			});
 			break;
 		}
 		case "alter-column-type": {
-			let r = Dr(Rr(n.declared, o.table, o.column) ?? { type: o.to }), i = o.using ? ` USING ${o.using}` : "";
+			let r = zr(Xr(n.declared, s.table, s.column) ?? { type: s.to }), i = s.using ? ` USING ${s.using}` : "";
 			if (t.classification !== "online-required") {
 				yield* e.onDialectOrElse({
 					mysql: () => {
-						let t = K(n.declared, o.table, o.column);
-						return t ? X(e, `ALTER TABLE ${G(o.table)} MODIFY COLUMN ${zr(t, o.column)};`, o.kind) : w.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
+						let t = q(n.declared, s.table, s.column);
+						return t ? X(e, `ALTER TABLE ${K(s.table)} MODIFY COLUMN ${Zr(t, s.column)};`, s.kind) : T.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${s.table}.${s.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
 					},
 					mssql: () => {
-						let t = K(n.declared, o.table, o.column);
-						return t ? X(e, ii(t, o.column, o.table), o.kind) : w.die(/* @__PURE__ */ Error(`alter-column-type on mssql needs the declared column '${o.table}.${o.column}'.`));
+						let t = q(n.declared, s.table, s.column);
+						return t ? X(e, _i(t, s.column, s.table), s.kind) : T.die(/* @__PURE__ */ Error(`alter-column-type on mssql needs the declared column '${s.table}.${s.column}'.`));
 					},
-					sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-					orElse: () => X(e, `ALTER TABLE ${W(o.table)} ALTER COLUMN ${W(o.column)} TYPE ${r}${i};`, o.kind)
+					sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+					orElse: () => X(e, `ALTER TABLE ${G(s.table)} ALTER COLUMN ${G(s.column)} TYPE ${r}${i};`, s.kind)
 				});
 				break;
 			}
 			yield* e.onDialectOrElse({
-				mysql: () => w.die(/* @__PURE__ */ Error(`online-required alter-column-type on ${o.table}.${o.column} is not supported on mariadb (the shadow-swap path is postgres-only). Use a smaller-table window or an external online-DDL tool.`)),
-				orElse: () => w.void
+				mysql: () => T.die(/* @__PURE__ */ Error(`online-required alter-column-type on ${s.table}.${s.column} is not supported on mariadb (the shadow-swap path is postgres-only). Use a smaller-table window or an external online-DDL tool.`)),
+				orElse: () => T.void
 			});
-			let a = `${o.column}__shadow`, s = `${o.column}__old`;
-			yield* e.unsafe(`ALTER TABLE ${W(o.table)} ADD COLUMN ${W(a)} ${r}`);
-			let c = o.using ?? W(o.column), l;
+			let a = `${s.column}__shadow`, o = `${s.column}__old`;
+			yield* e.unsafe(`ALTER TABLE ${G(s.table)} ADD COLUMN ${G(a)} ${r}`);
+			let c = s.using ?? G(s.column), l;
 			for (;;) {
-				let t = l === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(a)} IS NULL ORDER BY ${e("id")} ${Q(e, 5e3)}` : yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(a)} IS NULL AND ${e("id")} > ${l} ORDER BY ${e("id")} ${Q(e, 5e3)}`;
+				let t = l === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(s.table)} WHERE ${e(a)} IS NULL ORDER BY ${e("id")} ${Q(e, 5e3)}` : yield* e`SELECT ${e("id")} FROM ${e(s.table)} WHERE ${e(a)} IS NULL AND ${e("id")} > ${l} ORDER BY ${e("id")} ${Q(e, 5e3)}`;
 				if (t.length === 0) break;
-				yield* e.unsafe(`UPDATE ${W(o.table)} SET ${W(a)} = ${c} WHERE ${W(o.column)} IS NOT NULL AND ${W(a)} IS NULL AND ${W("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
+				yield* e.unsafe(`UPDATE ${G(s.table)} SET ${G(a)} = ${c} WHERE ${G(s.column)} IS NOT NULL AND ${G(a)} IS NULL AND ${G("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
 			}
-			yield* w.logInfo(`alter-column-type shadow ${o.table}.${o.column}: shadow populated`).pipe(w.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${W(o.table)} RENAME COLUMN ${W(o.column)} TO ${W(s)}`), yield* e.unsafe(`ALTER TABLE ${W(o.table)} RENAME COLUMN ${W(a)} TO ${W(o.column)}`), yield* e.unsafe(`ALTER TABLE ${W(o.table)} DROP COLUMN ${W(s)}`);
+			yield* T.logInfo(`alter-column-type shadow ${s.table}.${s.column}: shadow populated`).pipe(T.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${G(s.table)} RENAME COLUMN ${G(s.column)} TO ${G(o)}`), yield* e.unsafe(`ALTER TABLE ${G(s.table)} RENAME COLUMN ${G(a)} TO ${G(s.column)}`), yield* e.unsafe(`ALTER TABLE ${G(s.table)} DROP COLUMN ${G(o)}`);
 			break;
 		}
 		case "drop-foreign-key":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, Ri(o), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => X(e, Li(o), o.kind)
+				mysql: () => X(e, Qi(s), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => X(e, Zi(s), s.kind)
 			});
 			break;
 		case "add-check":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, zi(o, G), o.kind),
-				sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-				orElse: () => X(e, zi(o, W), o.kind)
+				mysql: () => X(e, $i(s, K), s.kind),
+				sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+				orElse: () => X(e, $i(s, G), s.kind)
 			});
 			break;
+		case "reconcile-json-check": {
+			let t = Y(s.column), n = s.validation === "value" ? nt(t) : `(${t} IS NULL OR ISJSON(${t}) = 1)`;
+			yield* e.onDialectOrElse({
+				mssql: () => Z(e, [...s.dropConstraints.map((e) => `ALTER TABLE ${Y(s.table)} DROP CONSTRAINT ${Y(e)}`), `ALTER TABLE ${Y(s.table)} WITH CHECK ADD CHECK ${n}`], s.kind),
+				orElse: () => T.dieMessage("reconcile-json-check requires SQL Server")
+			});
+			break;
+		}
 		case "drop-check": yield* e.onDialectOrElse({
-			mysql: () => Hi(e, o, n.declared),
-			sqlite: () => Z(e, q(o.table, n.declared), o.kind),
-			orElse: () => X(e, Bi(o), o.kind)
+			mysql: () => na(e, s, n.declared),
+			sqlite: () => Z(e, J(s.table, n.declared), s.kind),
+			orElse: () => X(e, ea(s), s.kind)
 		});
 	}
 	return {
-		op: o,
+		op: s,
 		status: "applied",
 		durationMs: Number((process.hrtime.bigint() - i) / 1000000n)
 	};
-}), $i = (e, t, n, r) => w.gen(function* () {
+}), pa = (e, t, n, r) => T.gen(function* () {
 	let i = [...new Set(r.map((e) => e.runId))];
-	if (i.length > 1) return yield* w.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger holds ${i.length} unfinished runs (${i.join(", ")}). Only one migration may be in flight at a time — the advisory lock enforces it — so this means a run was interrupted and a LATER one wrote over it without clearing.\nNothing was changed. Inspect \`${k}\`, reconcile the schema by hand, and delete the rows of the run you have finished.`));
+	if (i.length > 1) return yield* T.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger holds ${i.length} unfinished runs (${i.join(", ")}). Only one migration may be in flight at a time — the advisory lock enforces it — so this means a run was interrupted and a LATER one wrote over it without clearing.\nNothing was changed. Inspect \`${A}\`, reconcile the schema by hand, and delete the rows of the run you have finished.`));
 	let a = i[0], o = [...r].map((e) => ({
 		index: Number(e.opIndex),
 		status: e.status,
 		planned: JSON.parse(e.payload)
 	})).sort((e, t) => e.index - t.index), s = o.find((e) => e.status === "started"), c = o.filter((e) => e.status === "started").length;
-	if (c > 1) return yield* w.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger records ${c} operations as in-flight for run ${a}. It is written strictly sequentially, so at most one can be — this ledger is corrupt and the schema state it describes cannot be trusted.\nNothing was changed. Reconcile \`${k}\` by hand before re-running.`));
-	if (yield* w.logWarning(`migration resume: found an interrupted run (${a}) — ${o.filter((e) => e.status === "applied").length} of ${o.length} operation(s) completed${s ? `, in flight: ${s.planned.op.kind} ${He(s.planned.op)}` : ""}`).pipe(w.annotateLogs({ scope: "voltro:migrate" })), o.every((e) => e.status === "pending")) return {
+	if (c > 1) return yield* T.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger records ${c} operations as in-flight for run ${a}. It is written strictly sequentially, so at most one can be — this ledger is corrupt and the schema state it describes cannot be trusted.\nNothing was changed. Reconcile \`${A}\` by hand before re-running.`));
+	if (yield* T.logWarning(`migration resume: found an interrupted run (${a}) — ${o.filter((e) => e.status === "applied").length} of ${o.length} operation(s) completed${s ? `, in flight: ${s.planned.op.kind} ${qe(s.planned.op)}` : ""}`).pipe(T.annotateLogs({ scope: "voltro:migrate" })), o.every((e) => e.status === "pending")) return {
 		kind: "discard",
 		runId: a,
 		why: "no operation had started — no DDL ran"
 	};
-	let l = s ? yield* Zi(e, t, s.planned) : "clean", u = r[0].planFingerprint;
+	let l = s ? yield* da(e, t, s.planned) : "clean", u = r[0].planFingerprint;
 	if (u !== n.toFingerprint) return {
 		kind: "discard",
 		runId: a,
 		why: `the declared schema changed since the interruption (recorded target ${u.slice(0, 12)}…, current ${n.toFingerprint.slice(0, 12)}…) — applying the freshly-diffed plan instead`
 	};
-	let d = (e) => e.status === "applied" ? !1 : s && e.index === s.index && l !== "clean" ? l === "outstanding" : We(n, e.planned.op), f = o.filter(d), p = o.filter((e) => e.status !== "applied" && !d(e));
+	let d = (e) => e.status === "applied" ? !1 : s && e.index === s.index && l !== "clean" ? l === "outstanding" : Ye(n, e.planned.op), f = o.filter(d), p = o.filter((e) => e.status !== "applied" && !d(e));
 	return f.length === 0 ? {
 		kind: "discard",
 		runId: a,
 		why: "every recorded operation had already taken effect"
-	} : (yield* Yi(e, a, f.map((e) => e.index), p.map((e) => e.index)), yield* w.logWarning(`migration resume: continuing run ${a} — replaying ${f.length} operation(s), ${o.length - f.length} already applied`).pipe(w.annotateLogs({ scope: "voltro:migrate" })), {
+	} : (yield* la(e, a, f.map((e) => e.index), p.map((e) => e.index)), yield* T.logWarning(`migration resume: continuing run ${a} — replaying ${f.length} operation(s), ${o.length - f.length} already applied`).pipe(T.annotateLogs({ scope: "voltro:migrate" })), {
 		kind: "resume",
 		runId: a,
 		ops: f.map((e) => ({
@@ -3054,7 +3238,7 @@ BEGIN
 			planned: e.planned
 		}))
 	});
-}), ea = (e, t, n) => w.gen(function* () {
+}), ma = (e, t, n) => T.gen(function* () {
 	for (let r of t.operations) {
 		let i = r.op;
 		if (i.kind !== "add-index" || !i.index.unique || i.index.where === void 0 || t.operations.some((e) => e.op.kind === "rename-table" ? e.op.to === i.table : e.op.table === i.table && [
@@ -3063,9 +3247,9 @@ BEGIN
 			"rename-column"
 		].includes(e.op.kind))) continue;
 		let a = i.index.columns.map((e) => e.startsWith("(") ? e : o(e, n)), s = n === "mssql" ? "" : a.map((e) => ` AND ${e} IS NOT NULL`).join(""), c = n === "mssql" ? "SELECT TOP (1) 1" : "SELECT 1", l = n === "mssql" ? "" : " LIMIT 1";
-		if ((yield* e.unsafe(`${c} FROM ${o(i.table, n)} WHERE (${i.index.where})${s} GROUP BY ${a.join(", ")} HAVING COUNT(*) > 1${l}`)).length > 0) return yield* w.die(/* @__PURE__ */ Error(`applyPlan: partial unique index '${i.index.name}' on '${i.table}' conflicts with existing qualifying rows. No schema or row changes were applied. Resolve the conflicting data explicitly before retrying.`));
+		if ((yield* e.unsafe(`${c} FROM ${o(i.table, n)} WHERE (${i.index.where})${s} GROUP BY ${a.join(", ")} HAVING COUNT(*) > 1${l}`)).length > 0) return yield* T.die(/* @__PURE__ */ Error(`applyPlan: partial unique index '${i.index.name}' on '${i.table}' conflicts with existing qualifying rows. No schema or row changes were applied. Resolve the conflicting data explicitly before retrying.`));
 	}
-}), ta = (e) => {
+}), ha = (e) => {
 	let t = e.op, n = (e) => typeof t[e] == "string" ? t[e] : "";
 	return [
 		t.kind,
@@ -3074,45 +3258,45 @@ BEGIN
 		n("name"),
 		n("to")
 	].join("\0");
-}, na = (e, t, n) => w.acquireUseRelease(Fe(e, { schema: n.lockSchema }), () => ra(e, t, n), (e) => e.release.pipe(w.orDie)), ra = (e, t, n) => w.gen(function* () {
+}, ga = (e, t, n) => T.acquireUseRelease(Be(e, { schema: n.lockSchema }), () => _a(e, t, n), (e) => e.release.pipe(T.orDie)), _a = (e, t, n) => T.gen(function* () {
 	let r = t.operations.filter((e) => e.blocked);
-	if (r.length > 0) return yield* w.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — ${r.length} blocked operations. Run \`voltro db plan\` to see the fixes.`));
-	let i = Date.now(), a = [], o = Le(e), s = yield* n.replan(e), c = new Set(t.operations.filter((e) => !e.blocked).map((e) => ta(e))), l = {
+	if (r.length > 0) return yield* T.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — ${r.length} blocked operations. Run \`voltro db plan\` to see the fixes.`));
+	let i = Date.now(), a = [], o = He(e), s = yield* n.replan(e), c = new Set(t.operations.filter((e) => !e.blocked).map((e) => ha(e))), l = {
 		...s,
 		operations: s.operations.map((e) => {
-			if (!e.blocked || !c.has(ta(e))) return e;
+			if (!e.blocked || !c.has(ha(e))) return e;
 			let { blocked: t, ...n } = e;
 			return n;
 		})
 	};
-	(l.operations.length !== t.operations.length || l.toFingerprint !== t.toFingerprint) && (yield* w.logInfo(`migration: re-planned under the lock — ${t.operations.length} operation(s) became ${l.operations.length}. Another writer changed the schema while this plan waited.`).pipe(w.annotateLogs({ scope: "voltro:migrate" })));
+	(l.operations.length !== t.operations.length || l.toFingerprint !== t.toFingerprint) && (yield* T.logInfo(`migration: re-planned under the lock — ${t.operations.length} operation(s) became ${l.operations.length}. Another writer changed the schema while this plan waited.`).pipe(T.annotateLogs({ scope: "voltro:migrate" })));
 	let u = l.operations.filter((e) => e.blocked);
-	if (u.length > 0) return yield* w.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — re-planning under the migration lock found ${u.length} blocked operation(s). Run \`voltro db plan\` to see the fixes.`));
-	let d = ze(o) === "plan-transactional", f = d ? l.operations.filter((e) => e.classification !== "online-required") : [], p = d ? l.operations.filter((e) => e.classification === "online-required") : l.operations, m = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, h = p.map((e, t) => ({
+	if (u.length > 0) return yield* T.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — re-planning under the migration lock found ${u.length} blocked operation(s). Run \`voltro db plan\` to see the fixes.`));
+	let d = We(o) === "plan-transactional", f = d ? l.operations.filter((e) => e.classification !== "online-required") : [], p = d ? l.operations.filter((e) => e.classification === "online-required") : l.operations, m = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, h = p.map((e, t) => ({
 		index: t,
 		planned: e
 	})), _ = "fresh";
-	yield* ea(e, l, o), yield* Gi(e, o);
-	let v = yield* Ki(e);
+	yield* ma(e, l, o), yield* aa(e, o);
+	let v = yield* oa(e);
 	if (v.length > 0) {
-		let t = yield* $i(e, o, l, v);
-		t.kind === "resume" ? (m = t.runId, h = t.ops, _ = "resume") : (yield* w.logWarning(`migration resume: discarding the ledger of run ${t.runId} — ${t.why}`).pipe(w.annotateLogs({ scope: "voltro:migrate" })), yield* Xi(e, t.runId));
+		let t = yield* pa(e, o, l, v);
+		t.kind === "resume" ? (m = t.runId, h = t.ops, _ = "resume") : (yield* T.logWarning(`migration resume: discarding the ledger of run ${t.runId} — ${t.why}`).pipe(T.annotateLogs({ scope: "voltro:migrate" })), yield* ua(e, t.runId));
 	}
-	_ === "fresh" && h.length > 0 && (yield* qi(e, m, l.toFingerprint, h)), f.length > 0 && (yield* e.withTransaction(w.gen(function* () {
+	_ === "fresh" && h.length > 0 && (yield* sa(e, m, l.toFingerprint, h)), f.length > 0 && (yield* Pr(e, T.gen(function* () {
 		let e = yield* E.SqlClient;
-		for (let t of f) a.push(yield* Qi(e, t, n));
+		for (let t of f) a.push(yield* fa(e, t, n));
 	})));
 	for (let { index: t, planned: r } of h) {
-		yield* Ji(e, m, t, "started");
-		let i = a.length, o = yield* Qi(e, r, n, _).pipe(w.mapError((e) => Object.assign(e, { message: `${String(e?.message ?? e)}\n\n  progress: ${i} of ${h.length + f.length} operation(s) applied before this one${f.length > 0 ? ` (${f.length} of them in a transaction)` : ""}.\n` + (d ? "  This dialect applies a plan atomically, so the run is rolled back.\n" : `  This dialect does NOT apply a plan atomically: those ${i} are COMMITTED and there is no rollback.\n  The next \`voltro db apply\` resumes from operation ${t} — the ledger records the sequence.\n`) })));
-		a.push(o), yield* Ji(e, m, t, "applied", o.durationMs);
+		yield* ca(e, m, t, "started");
+		let i = a.length, o = yield* fa(e, r, n, _).pipe(T.mapError((e) => Object.assign(e, { message: `${String(e?.message ?? e)}\n\n  progress: ${i} of ${h.length + f.length} operation(s) applied before this one${f.length > 0 ? ` (${f.length} of them in a transaction)` : ""}.\n` + (d ? "  This dialect applies a plan atomically, so the run is rolled back.\n" : `  This dialect does NOT apply a plan atomically: those ${i} are COMMITTED and there is no rollback.\n  The next \`voltro db apply\` resumes from operation ${t} — the ledger records the sequence.\n`) })));
+		a.push(o), yield* ca(e, m, t, "applied", o.durationMs);
 	}
 	let y = yield* n.replan(e);
 	if (y.operations.length > 0) {
 		let e = y.operations.slice(0, 10).map((e) => `  - ${e.op.kind} ${"table" in e.op ? e.op.table : ""}${"column" in e.op ? `.${String(e.op.column)}` : ""}`).join("\n");
-		return yield* w.die(/* @__PURE__ */ Error(`applyPlan: the migration did not converge. ${l.operations.length} operation(s) were executed without error, but re-planning against the live schema still finds ${y.operations.length}:\n${e}${y.operations.length > 10 ? `\n  … and ${y.operations.length - 10} more` : ""}\nNo fingerprint was recorded — recording one would make the next boot report "schema up to date" for a schema that was never applied. This is a framework bug; the schema is unchanged and safe.\nTwo causes look identical from here, so read the list before assuming either:\n  - the DDL for those operations is a no-op (it succeeded and changed nothing), or\n  - the planner cannot see what the DDL did, so it proposes the same work again — which is what an\n    operation naming an object a PREVIOUS operation created or renamed usually means.\nReport the operation kinds above with the column types involved.`));
+		return yield* T.die(/* @__PURE__ */ Error(`applyPlan: the migration did not converge. ${l.operations.length} operation(s) were executed without error, but re-planning against the live schema still finds ${y.operations.length}:\n${e}${y.operations.length > 10 ? `\n  … and ${y.operations.length - 10} more` : ""}\nNo fingerprint was recorded — recording one would make the next boot report "schema up to date" for a schema that was never applied. This is a framework bug; the schema is unchanged and safe.\nTwo causes look identical from here, so read the list before assuming either:\n  - the DDL for those operations is a no-op (it succeeded and changed nothing), or\n  - the planner cannot see what the DDL did, so it proposes the same work again — which is what an\n    operation naming an object a PREVIOUS operation created or renamed usually means.\nReport the operation kinds above with the column types involved.`));
 	}
-	let b = a.filter((e) => e.status === "applied").length, x = Date.now() - i, S = m, C = (/* @__PURE__ */ new Date()).toISOString(), T = yield* U(e, C), ee = [...f, ...h.map((e) => e.planned)];
+	let b = a.filter((e) => e.status === "applied").length, x = Date.now() - i, S = m, C = (/* @__PURE__ */ new Date()).toISOString(), w = yield* W(e, C), ee = [...f, ...h.map((e) => e.planned)];
 	yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
@@ -3121,10 +3305,10 @@ BEGIN
       VALUES
         (${S}, ${l.toFingerprint}, ${y.fromFingerprint}, ${JSON.stringify(ee)},
          ${n.appliedBy}, ${n.environment}, ${n.source},
-         ${x}, ${T}, ${n.notes ?? null})
-    `, yield* Xi(e, m);
+         ${x}, ${w}, ${n.notes ?? null})
+    `, yield* ua(e, m);
 	let te = [...new Set(ee.flatMap((e) => e.op.kind === "rename-table" ? [e.op.to] : [e.op.table]))];
-	return yield* w.promise(() => g({ changedTables: te }).catch(() => {})), {
+	return yield* T.promise(() => g({ changedTables: te }).catch(() => {})), {
 		id: S,
 		appliedAt: C,
 		fingerprint: l.toFingerprint,
@@ -3136,14 +3320,14 @@ BEGIN
 		source: n.source,
 		...n.notes ? { notes: n.notes } : {}
 	};
-}), ia = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind} ${"table" in e.op ? `[${e.op.table}]` : ""}: ${e.reason ?? "<no reason>"}\n    fix: ${e.blocked?.fix ?? "<no fix>"}`).join("\n"), aa = (e) => e`
+}), va = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind} ${"table" in e.op ? `[${e.op.table}]` : ""}: ${e.reason ?? "<no reason>"}\n    fix: ${e.blocked?.fix ?? "<no fix>"}`).join("\n"), ya = (e) => e`
     SELECT fingerprint
     FROM _voltro_migration_plans
     ORDER BY ${e("appliedAt")} DESC
     LIMIT 1
-  `.pipe(w.map((e) => e.length > 0 ? e[0].fingerprint : void 0), w.catchAll(() => w.succeed(void 0))), oa = (e, t, n) => w.gen(function* () {
-	if ((yield* aa(e)) === t.toFingerprint) return "already-current";
-	let r = `plan_${Date.now().toString(36)}`, i = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
+  `.pipe(T.map((e) => e.length > 0 ? e[0].fingerprint : void 0), T.catchAll(() => T.succeed(void 0))), ba = (e, t, n) => T.gen(function* () {
+	if ((yield* ya(e)) === t.toFingerprint) return "already-current";
+	let r = `plan_${Date.now().toString(36)}`, i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
 	return yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
@@ -3154,8 +3338,8 @@ BEGIN
          ${n.appliedBy}, ${n.environment}, ${n.source},
          ${0}, ${i}, ${"no DDL — the declared schema already matched the database"})
     `, "recorded";
-}).pipe(w.catchAll(() => w.succeed("already-current"))), sa = (e, t) => w.gen(function* () {
-	let n = L(R(t, Le(e))), r = yield* aa(e);
+}).pipe(T.catchAll(() => T.succeed("already-current"))), xa = (e, t) => T.gen(function* () {
+	let n = R(z(t, He(e))), r = yield* ya(e);
 	return r === n ? {
 		kind: "up-to-date",
 		fingerprint: n
@@ -3164,23 +3348,23 @@ BEGIN
 		expected: n,
 		...r === void 0 ? {} : { actual: r }
 	};
-}), ca = [
+}), Sa = [
 	"pgeagertest_",
 	"mig_e2e_",
 	"mig_test_",
 	"mysqleagertest_",
 	"mssqleagertest_",
 	"sqliteeagertest_"
-], la = (e) => ca.some((t) => e.startsWith(t)), ua = (e, t) => w.gen(function* () {
+], Ca = (e) => Sa.some((t) => e.startsWith(t)), wa = (e, t) => T.gen(function* () {
 	if (process.env.VOLTRO_TEST_FIXTURE_GC === "off") return [];
-	let n = t.filter((e) => la(e.name)).map((e) => e.name);
+	let n = t.filter((e) => Ca(e.name)).map((e) => e.name);
 	if (n.length === 0) return [];
-	for (let t of n) yield* e.unsafe(`DROP TABLE IF EXISTS "${t}" CASCADE`).pipe(w.catchAll(() => w.void));
+	for (let t of n) yield* e.unsafe(`DROP TABLE IF EXISTS "${t}" CASCADE`).pipe(T.catchAll(() => T.void));
 	return n;
-}), da = () => {
+}), Ta = () => {
 	let e = (process.env.VOLTRO_DB_IGNORE_TABLES ?? "").split(",").map((e) => e.trim()).filter((e) => e.length > 0);
 	return e.length > 0 ? { ignoreTables: e } : {};
-}, fa = (e) => {
+}, Ea = (e) => {
 	if (e === void 0) return;
 	let t = e.trim();
 	if (t === "") return;
@@ -3190,55 +3374,55 @@ BEGIN
 		kind: "tables",
 		tables: new Set(n)
 	} : void 0;
-}, pa = (e) => typeof e.table == "string" ? e.table : void 0, ma = (e, t = { kind: "all" }) => ({
+}, Da = (e) => typeof e.table == "string" ? e.table : void 0, Oa = (e, t = { kind: "all" }) => ({
 	...e,
 	operations: e.operations.map((e) => {
 		if (!e.blocked || e.classification !== "lossy") return e;
 		if (t?.kind === "tables") {
-			let n = pa(e.op);
+			let n = Da(e.op);
 			if (n === void 0 || !t.tables.has(n)) return e;
 		}
 		let { blocked: n, ...r } = e;
 		return r;
 	})
-}), ha = (e, t, n) => t === "postgres" ? dn(e, n).pipe(w.flatMap((e) => {
-	let t = fn(e);
-	return t === void 0 ? w.void : w.logWarning(`auto-migrate: ${t}`).pipe(w.annotateLogs({ scope: "voltro:migrate" }));
-}), w.catchAll(() => w.void)) : w.void, ga = (e, t, n) => w.gen(function* () {
-	let r = Le(e), a = t;
+}), ka = (e, t, n) => t === "postgres" ? bn(e, n).pipe(T.flatMap((e) => {
+	let t = xn(e);
+	return t === void 0 ? T.void : T.logWarning(`auto-migrate: ${t}`).pipe(T.annotateLogs({ scope: "voltro:migrate" }));
+}), T.catchAll(() => T.void)) : T.void, Aa = (e, t, n) => T.gen(function* () {
+	let r = He(e), a = t;
 	if (process.env.VOLTRO_MIGRATE_FORCE !== "1") {
-		let t = L(R(a, r));
-		if ((yield* aa(e)) === t) return yield* ha(e, r, a), {
+		let t = R(z(a, r));
+		if ((yield* ya(e)) === t) return yield* ka(e, r, a), {
 			kind: "up-to-date",
 			fingerprint: t
 		};
 	}
-	let o = yield* fr(e), s = yield* ua(e, o.tables);
-	s.length > 0 && (yield* w.logInfo(`auto-migrate: reaped ${s.length} test-fixture leftover(s)`).pipe(w.annotateLogs({
+	let o = yield* Sr(e), s = yield* wa(e, o.tables);
+	s.length > 0 && (yield* T.logInfo(`auto-migrate: reaped ${s.length} test-fixture leftover(s)`).pipe(T.annotateLogs({
 		scope: "voltro:migrate",
 		count: s.length
-	})), o = yield* fr(e));
+	})), o = yield* Sr(e));
 	{
 		let e = n.softDropRetentionDays ?? 7, t = p(o, { retentionDays: e });
-		t.length > 0 && (yield* w.logWarning(`auto-migrate: ${i(t, e)}`).pipe(w.annotateLogs({
+		t.length > 0 && (yield* T.logWarning(`auto-migrate: ${i(t, e)}`).pipe(T.annotateLogs({
 			scope: "voltro:migrate",
 			snapshots: t.map((e) => e.name)
 		})));
 	}
-	let c = new Set(t.map((e) => e.tableName)), l = (e) => e.filter((e) => !_(e.name) || c.has(e.name)), u = Wn({
+	let c = new Set(t.map((e) => e.tableName)), l = (e) => e.filter((e) => !_(e.name) || c.has(e.name)), u = $n({
 		declared: a,
 		live: { tables: l(o.tables) },
 		dialect: r,
-		...da()
+		...Ta()
 	});
 	if (u.summary.blocked > 0) {
-		let e = u.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = fa(process.env.VOLTRO_DESTRUCTIVE_OK);
-		if (t === void 0 || !e || (u = ma(u, t), u.operations.some((e) => e.blocked))) return {
+		let e = u.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = Ea(process.env.VOLTRO_DESTRUCTIVE_OK);
+		if (t === void 0 || !e || (u = Oa(u, t), u.operations.some((e) => e.blocked))) return {
 			kind: "refused-blocked",
 			plan: u
 		};
 	}
-	return u.operations.length === 0 ? (yield* oa(e, u, {
+	return u.operations.length === 0 ? (yield* ba(e, u, {
 		appliedBy: n.appliedBy,
 		environment: n.environment === "prod" ? "dev" : n.environment,
 		source: "auto-diff"
@@ -3247,37 +3431,37 @@ BEGIN
 		fingerprint: u.toFingerprint
 	}) : {
 		kind: "applied",
-		applied: yield* na(e, u, {
+		applied: yield* ga(e, u, {
 			declared: t,
 			appliedBy: n.appliedBy,
 			environment: n.environment === "prod" ? "dev" : n.environment,
 			source: "auto-diff",
-			replan: (e) => w.gen(function* () {
-				let t = yield* fr(e);
-				return Wn({
+			replan: (e) => T.gen(function* () {
+				let t = yield* Sr(e);
+				return $n({
 					declared: a,
 					live: { tables: l(t.tables) },
 					dialect: r,
-					...da()
+					...Ta()
 				});
 			})
 		}),
 		plan: u
 	};
-}), _a = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? w.succeed({
+}), ja = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? T.succeed({
 	kind: "skipped",
 	reason: "VOLTRO_AUTO_MIGRATE=0"
-}) : n.environment === "prod" ? sa(e, t) : ga(e, t, n), va = (e, t) => {
+}) : n.environment === "prod" ? xa(e, t) : Aa(e, t, n), Ma = (e, t) => {
 	switch (e.kind) {
 		case "skipped": return `auto-migrate: skipped (${e.reason})`;
-		case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${an(e.fingerprint)})`;
+		case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${mn(e.fingerprint)})`;
 		case "applied": {
 			let t = e.plan.summary;
-			return `auto-migrate: applied ${e.applied.appliedOps} op(s) in ${e.applied.durationMs}ms [safe=${t.safe} needs-default=${t.needsDefault} needs-backfill=${t.needsBackfill} rename=${t.needsRenameAnnotation} lossy=${t.lossy}] fingerprint=${an(e.applied.fingerprint)}`;
+			return `auto-migrate: applied ${e.applied.appliedOps} op(s) in ${e.applied.durationMs}ms [safe=${t.safe} needs-default=${t.needsDefault} needs-backfill=${t.needsBackfill} rename=${t.needsRenameAnnotation} lossy=${t.lossy}] fingerprint=${mn(e.applied.fingerprint)}`;
 		}
-		case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${an(e.expected)}` + (e.actual ? ` live=${an(e.actual)}` : " live=<no _voltro_migration_plans row>") + ". Run `voltro db apply --plan plan.json` from the deploy pipeline before serving.";
+		case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${mn(e.expected)}` + (e.actual ? ` live=${mn(e.actual)}` : " live=<no _voltro_migration_plans row>") + ". Run `voltro db apply --plan plan.json` from the deploy pipeline before serving.";
 		case "refused-blocked": {
-			let t = e.plan.operations.filter((e) => e.blocked), n = t.filter((e) => e.op.kind === "drop-table").length, r = t.filter((e) => e.op.kind === "drop-table").map((e) => "table" in e.op ? e.op.table : "").filter(Boolean), i = t.filter((e) => e.op.kind === "add-column").length, a = t.filter((e) => e.op.kind === "drop-column").length, o = t.filter((e) => e.classification === "needs-rename-annotation").length, s = `auto-migrate: REFUSED — ${e.plan.summary.blocked} blocked operation(s):\n` + ia(e.plan), c = [""];
+			let t = e.plan.operations.filter((e) => e.blocked), n = t.filter((e) => e.op.kind === "drop-table").length, r = t.filter((e) => e.op.kind === "drop-table").map((e) => "table" in e.op ? e.op.table : "").filter(Boolean), i = t.filter((e) => e.op.kind === "add-column").length, a = t.filter((e) => e.op.kind === "drop-column").length, o = t.filter((e) => e.classification === "needs-rename-annotation").length, s = `auto-migrate: REFUSED — ${e.plan.summary.blocked} blocked operation(s):\n` + va(e.plan), c = [""];
 			if (n > 0 && c.push(`${n} table(s) exist in the live DB but aren't in your declared schema.`, "This is usually one of three things:", "  (a) You're iterating on the schema — the table file got renamed, moved, or temporarily commented out.", "      → Restore the declaration. Your data stays intact.", "  (b) You want to KEEP the table but NOT manage it with Voltro (a leftover from another tool —", "      a Strapi/Rails/legacy migration artifact, or an externally-owned table).", `      → Set \`VOLTRO_DB_IGNORE_TABLES=${r.join(",")}\` (comma-separated).`, "        The planner excludes those tables from the diff entirely — it never drops them, and they", "        stop blocking your OTHER (additive) changes. This is the fix when a leftover freezes your schema.", "  (c) You actually want to drop the table.", `      → Set \`VOLTRO_DESTRUCTIVE_OK=${r.join(",")}\` for ONE run — it acknowledges`, "        the data loss for THOSE tables only; every other lossy op in this plan stays blocked.", "        (`VOLTRO_DESTRUCTIVE_OK=1` acknowledges all of them, which is rarely what you mean.)", "      There is deliberately no `dropped()` marker for a TABLE, unlike for a column: a", "      dropped column leaves a slot worth documenting in the declaration, a dropped table", "      leaves nothing — the marker would be a dead entry you must remember to delete.", "  Soft-drop: set `VOLTRO_SOFT_DROP=1` alongside DESTRUCTIVE_OK to RENAME instead of DROP", "  (data survives as `<name>__dropped_<ts>` for ~7d; restorable via `voltro db restore-snapshot`)."), i > 0 && c.push(`${i} required column(s) need a backfill strategy before adding to a populated table.`, "  → Annotate the column: `.backfill(sql`<expr>`)` or `.backfill(row => <fn>)` or `.default(<value>)`.", "  Existing rows get the backfill value; the column then lands as NOT NULL."), a > 0) {
 				let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
 				for (let r of e.plan.operations) {
@@ -3294,7 +3478,7 @@ BEGIN
 			return o > 0 && c.push(`${o} column(s) look like renames (one column gone + a new one of same shape appeared).`, "  → On the NEW column add `.renamedFrom('<oldName>')` so the planner emits RENAME instead of DROP+ADD."), c.push("", "See `voltro db plan` for the full machine-readable diff."), s + "\n" + c.join("\n");
 		}
 	}
-}, ya = re({ scope: "voltro:migrate" }), ba = /* @__PURE__ */ new Set([
+}, Na = ae({ scope: "voltro:migrate" }), Pa = /* @__PURE__ */ new Set([
 	"node_modules",
 	"dist",
 	"build",
@@ -3303,12 +3487,12 @@ BEGIN
 	".next",
 	".git",
 	".framework"
-]), xa = async (e) => {
+]), Fa = async (e) => {
 	let t = [], n = async (e) => {
-		let r = await ie.readdir(e, { withFileTypes: !0 }).catch(() => []);
+		let r = await oe.readdir(e, { withFileTypes: !0 }).catch(() => []);
 		for (let i of r) {
-			if (ba.has(i.name)) continue;
-			let r = ae(e, i.name);
+			if (Pa.has(i.name)) continue;
+			let r = se(e, i.name);
 			i.isDirectory() ? await n(r) : i.isFile() && S.test(i.name) && t.push(r);
 		}
 	};
@@ -3316,12 +3500,12 @@ BEGIN
 		let n = e.split("/").pop() ?? e, r = t.split("/").pop() ?? t;
 		return n.localeCompare(r);
 	});
-}, Sa = async (e) => {
+}, Ia = async (e) => {
 	let t = [];
 	for (let n of e) {
-		let e = (await import(oe(n).href)).default;
+		let e = (await import(ce(n).href)).default;
 		if (!u(e)) {
-			ya.warn("migration file has no default-exported `migration(...)` — skipped", { file: n });
+			Na.warn("migration file has no default-exported `migration(...)` — skipped", { file: n });
 			continue;
 		}
 		t.push({
@@ -3330,11 +3514,11 @@ BEGIN
 		});
 	}
 	return t;
-}, Ca = (e) => e`
+}, La = (e) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("source")} = 'file'
-  `.pipe(w.map((e) => e.map((e) => e.id)), w.catchAll(() => w.succeed([]))), wa = class extends Error {
+  `.pipe(T.map((e) => e.map((e) => e.id)), T.catchAll(() => T.succeed([]))), Ra = class extends Error {
 	migrationId;
 	file;
 	cause;
@@ -3342,28 +3526,28 @@ BEGIN
 	constructor(e, t, n) {
 		super(`migration ${e}: up() SUCCEEDED but the ledger row could not be written.\n  The change IS in the database. It is NOT recorded, so the next run would apply it AGAIN.\n  Do not re-run ${t} until this is resolved.\n  Cause: ${n instanceof Error ? n.message : String(n)}`), this.migrationId = e, this.file = t, this.cause = n, this.name = "FileMigrationLedgerError";
 	}
-}, Ta = (e, t, n, r) => w.gen(function* () {
+}, za = (e, t, n, r) => T.gen(function* () {
 	let i = Date.now(), a = (/* @__PURE__ */ new Date()).toISOString(), o = {
 		sql: e,
 		log: {
-			info: (e, n) => w.logInfo(e).pipe(w.annotateLogs({
+			info: (e, n) => T.logInfo(e).pipe(T.annotateLogs({
 				scope: `migrations:file:${t.migration.id}`,
 				...n ?? {}
 			})),
-			warn: (e, n) => w.logWarning(e).pipe(w.annotateLogs({
+			warn: (e, n) => T.logWarning(e).pipe(T.annotateLogs({
 				scope: `migrations:file:${t.migration.id}`,
 				...n ?? {}
 			}))
 		},
 		appliedAt: a
 	}, s = t.migration.up(o);
-	w.isEffect(s) ? yield* s : yield* w.tryPromise({
+	T.isEffect(s) ? yield* s : yield* T.tryPromise({
 		try: () => s,
 		catch: (e) => e
 	});
 	let c = Date.now() - i;
-	!w.isEffect(s) && c < 2 && (yield* w.logWarning(`migration ${t.migration.id}: up() resolved in ${c}ms — did the body \`await\` an \`@effect/sql\` Effect by accident? \`sql.unsafe(...)\` returns an Effect, not a Promise; \`await\` on it is a silent no-op. Switch the body to \`Effect.gen(function* () { yield* sql.unsafe(...) })\` form.`).pipe(w.annotateLogs({ scope: `migrations:file:${t.migration.id}` })));
-	let l = yield* U(e, a);
+	!T.isEffect(s) && c < 2 && (yield* T.logWarning(`migration ${t.migration.id}: up() resolved in ${c}ms — did the body \`await\` an \`@effect/sql\` Effect by accident? \`sql.unsafe(...)\` returns an Effect, not a Promise; \`await\` on it is a silent no-op. Switch the body to \`Effect.gen(function* () { yield* sql.unsafe(...) })\` form.`).pipe(T.annotateLogs({ scope: `migrations:file:${t.migration.id}` })));
+	let l = yield* W(e, a);
 	return yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("operations")},
@@ -3376,87 +3560,87 @@ BEGIN
 	}])},
          ${r}, ${n}, ${"file"},
          ${c}, ${l}, ${t.migration.description})
-    `.pipe(w.mapError((e) => new wa(t.migration.id, t.file, e))), { durationMs: c };
-}), Ea = (e, t) => w.gen(function* () {
-	let n = yield* w.tryPromise({
-		try: () => xa(ae(t, "migrations")),
+    `.pipe(T.mapError((e) => new Ra(t.migration.id, t.file, e))), { durationMs: c };
+}), Ba = (e, t) => T.gen(function* () {
+	let n = yield* T.tryPromise({
+		try: () => Fa(se(t, "migrations")),
 		catch: (e) => e
 	});
 	if (n.length === 0) return {
 		pending: [],
 		skipped: []
 	};
-	let r = yield* w.tryPromise({
-		try: () => Sa(n),
+	let r = yield* T.tryPromise({
+		try: () => Ia(n),
 		catch: (e) => e
 	});
 	if (r.length === 0) return {
 		pending: [],
 		skipped: []
 	};
-	let i = new Set(yield* Ca(e));
+	let i = new Set(yield* La(e));
 	return {
 		pending: r.filter((e) => !i.has(e.migration.id)),
 		skipped: r.filter((e) => i.has(e.migration.id)).map((e) => e.migration.id)
 	};
-}), Da = (e, t) => Ea(e, t).pipe(w.map((e) => e.pending.map((e) => e.migration.id))), Oa = (e, t) => w.gen(function* () {
-	let { pending: n, skipped: r } = yield* Ea(e, t.projectRoot);
+}), Va = (e, t) => Ba(e, t).pipe(T.map((e) => e.pending.map((e) => e.migration.id))), Ha = (e, t) => T.gen(function* () {
+	let { pending: n, skipped: r } = yield* Ba(e, t.projectRoot);
 	return n.length === 0 ? {
 		applied: [],
 		skipped: r
 	} : {
-		applied: yield* w.acquireUseRelease(Fe(e, { schema: t.lockSchema }), () => w.gen(function* () {
+		applied: yield* T.acquireUseRelease(Be(e, { schema: t.lockSchema }), () => T.gen(function* () {
 			let r = [];
 			for (let i of n) {
-				yield* w.logInfo("file-based migration applying").pipe(w.annotateLogs({
+				yield* T.logInfo("file-based migration applying").pipe(T.annotateLogs({
 					scope: "voltro:migrate",
 					id: i.migration.id,
 					file: i.file
 				}));
-				let { durationMs: n } = yield* Ta(e, i, t.env, t.appliedBy);
+				let { durationMs: n } = yield* za(e, i, t.env, t.appliedBy);
 				r.push({
 					id: i.migration.id,
 					durationMs: n
-				}), yield* w.logInfo("file-based migration applied").pipe(w.annotateLogs({
+				}), yield* T.logInfo("file-based migration applied").pipe(T.annotateLogs({
 					scope: "voltro:migrate",
 					id: i.migration.id,
 					durationMs: n
 				}));
 			}
 			return r;
-		}), (e) => e.release.pipe(w.orDie)),
+		}), (e) => e.release.pipe(T.orDie)),
 		skipped: r
 	};
-}), ka = (e, t) => e`
+}), Ua = (e, t) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("id")} = ${t} AND ${e("source")} = 'file'
     LIMIT 1
-  `, Aa = (e, t) => w.gen(function* () {
-	if (!(yield* ka(e, t.id))[0]) return yield* w.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
-	let n = yield* w.tryPromise({
-		try: () => xa(ae(t.projectRoot, "migrations")),
+  `, Wa = (e, t) => T.gen(function* () {
+	if (!(yield* Ua(e, t.id))[0]) return yield* T.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
+	let n = yield* T.tryPromise({
+		try: () => Fa(se(t.projectRoot, "migrations")),
 		catch: (e) => e
-	}), r = (yield* w.tryPromise({
-		try: () => Sa(n),
+	}), r = (yield* T.tryPromise({
+		try: () => Ia(n),
 		catch: (e) => e
 	})).find((e) => e.migration.id === t.id);
-	return r ? yield* w.acquireUseRelease(Fe(e, { schema: t.lockSchema }), () => w.gen(function* () {
+	return r ? yield* T.acquireUseRelease(Be(e, { schema: t.lockSchema }), () => T.gen(function* () {
 		let n = Date.now(), i = {
 			sql: e,
 			log: {
-				info: (e, n) => w.logInfo(e).pipe(w.annotateLogs({
+				info: (e, n) => T.logInfo(e).pipe(T.annotateLogs({
 					scope: `migrations:file:${t.id}`,
 					...n ?? {}
 				})),
-				warn: (e, n) => w.logWarning(e).pipe(w.annotateLogs({
+				warn: (e, n) => T.logWarning(e).pipe(T.annotateLogs({
 					scope: `migrations:file:${t.id}`,
 					...n ?? {}
 				}))
 			},
 			appliedAt: (/* @__PURE__ */ new Date()).toISOString()
 		}, a = r.migration.down(i);
-		w.isEffect(a) ? yield* a : yield* w.tryPromise({
+		T.isEffect(a) ? yield* a : yield* T.tryPromise({
 			try: () => a,
 			catch: (e) => e
 		});
@@ -3465,8 +3649,8 @@ BEGIN
 			id: t.id,
 			durationMs: o
 		};
-	}), (e) => e.release.pipe(w.orDie)) : yield* w.fail(/* @__PURE__ */ Error(`rollback: file for migration ${t.id} not found on disk under ${t.projectRoot}/migrations/`));
-}), ja = (e) => w.gen(function* () {
+	}), (e) => e.release.pipe(T.orDie)) : yield* T.fail(/* @__PURE__ */ Error(`rollback: file for migration ${t.id} not found on disk under ${t.projectRoot}/migrations/`));
+}), Ga = (e) => T.gen(function* () {
 	let t = yield* E.SqlClient, n = yield* t`
       SELECT id, fingerprint, appliedAt FROM _voltro_migration_plans
       WHERE source = 'auto-diff'
@@ -3474,9 +3658,9 @@ BEGIN
         AND appliedAt <  ${e.before}
       ORDER BY appliedAt DESC
     `;
-	if (n.length === 0) return yield* w.fail(/* @__PURE__ */ Error(`squash: no rows applied before ${e.before}`));
+	if (n.length === 0) return yield* T.fail(/* @__PURE__ */ Error(`squash: no rows applied before ${e.before}`));
 	let r = n[0];
-	if (r.fingerprint !== e.fingerprint) return yield* w.fail(/* @__PURE__ */ Error(`squash: latest pre-squash fingerprint (${r.fingerprint.slice(0, 12)}…) differs from current declared-schema fingerprint (${e.fingerprint.slice(0, 12)}…). This means the working tree carries un-applied changes — squashing now would lock the drift in.\n\nFix: run \`voltro db apply\` first to align the live schema with the working tree, then re-squash.`));
+	if (r.fingerprint !== e.fingerprint) return yield* T.fail(/* @__PURE__ */ Error(`squash: latest pre-squash fingerprint (${r.fingerprint.slice(0, 12)}…) differs from current declared-schema fingerprint (${e.fingerprint.slice(0, 12)}…). This means the working tree carries un-applied changes — squashing now would lock the drift in.\n\nFix: run \`voltro db apply\` first to align the live schema with the working tree, then re-squash.`));
 	yield* t`
       UPDATE _voltro_migration_plans
       SET squashedAt = CURRENT_TIMESTAMP
@@ -3511,7 +3695,7 @@ BEGIN
 		snapshotFingerprint: e.fingerprint,
 		snapshotId: i
 	};
-}), Ma = { safe: !0 }, Na = (e) => {
+}), Ka = { safe: !0 }, qa = (e) => {
 	switch (e.kind) {
 		case "drop-column": return {
 			safe: !1,
@@ -3538,7 +3722,7 @@ BEGIN
 			reason: `old instances read/write "${e.table}"."${e.column}" as ${e.from}; the new ${e.to} type can reject their writes or fail to decode their reads`,
 			remedy: "add a new column of the target type + backfill + dual-write, cut code over, then drop the old column in a LATER deploy"
 		};
-		case "alter-column-nullability": return e.toNullable ? Ma : {
+		case "alter-column-nullability": return e.toNullable ? Ka : {
 			safe: !1,
 			reason: `old instances may INSERT "${e.table}" without (or with NULL in) "${e.column}", which the new NOT NULL rejects`,
 			remedy: `make code always write "${e.column}" and deploy that first; add NOT NULL in a LATER deploy (with a default to cover the gap)`
@@ -3549,6 +3733,11 @@ BEGIN
 			reason: `old instances still write "${e.table}" without honouring the new uniqueness; a colliding insert now fails mid-rollout`,
 			remedy: "make code enforce uniqueness first and deploy that; add the constraint in a LATER deploy once no old writer remains"
 		};
+		case "reconcile-json-check": return e.previousValidation === "container" && e.validation === "value" ? Ka : {
+			safe: !1,
+			reason: `writes to "${e.table}"."${e.column}" must satisfy the new JSON validation`,
+			remedy: "ensure all writers supply valid JSON in the required domain before enabling this check"
+		};
 		case "add-check": return {
 			safe: !1,
 			reason: `old instances may write values to "${e.table}" the new CHECK rejects`,
@@ -3568,12 +3757,12 @@ BEGIN
 		case "drop-unique":
 		case "drop-unique-composite":
 		case "drop-foreign-key":
-		case "drop-check": return Ma;
+		case "drop-check": return Ka;
 	}
-}, Pa = (e) => {
+}, Ja = (e) => {
 	let t = [];
 	for (let n of e) {
-		let e = Na(n.op);
+		let e = qa(n.op);
 		e.safe || t.push({
 			op: n,
 			reason: e.reason,
@@ -3581,7 +3770,7 @@ BEGIN
 		});
 	}
 	return t;
-}, Fa = (e) => {
+}, Ya = (e) => {
 	if (!e.enabled || e.unsafeCount === 0) return {
 		refuse: !1,
 		warnForced: !1,
@@ -3597,18 +3786,18 @@ BEGIN
 		warnForced: !1,
 		message: `${t}. Old instances would break against the new schema mid-rollout. Split into expand → deploy → contract (see the ⚠ list above), deploy with no overlap (maintenance window / scale-to-zero), or pass --force to override.`
 	};
-}, Ia = (e) => {
+}, Xa = (e) => {
 	let t = e.table;
 	if (typeof t == "string") return t;
 	let n = e.from;
 	return typeof n == "string" ? n : void 0;
-}, La = (e) => ({
+}, Za = (e) => ({
 	kind: e.op.kind,
-	table: Ia(e.op),
+	table: Xa(e.op),
 	classification: e.classification,
 	reason: e.reason,
 	blockedFix: e.blocked?.fix
-}), Ra = (e) => e.operations.map(La), za = async (e) => {
+}), Qa = (e) => e.operations.map(Za), $a = async (e) => {
 	let t = e.log ?? (() => {}), n = {
 		branchId: e.branchId,
 		mechanism: e.mechanism,
@@ -3627,10 +3816,10 @@ BEGIN
 			applied: !1,
 			converged: !1,
 			residual: r,
-			infidelity: Ra(o)
+			infidelity: Qa(o)
 		};
 		else {
-			let i = await e.plan(), o = Ra(i), s = o.filter((e) => e.classification === "lossy"), c = ma(i), l = c.operations.filter((e) => e.blocked !== void 0).map(La);
+			let i = await e.plan(), o = Qa(i), s = o.filter((e) => e.classification === "lossy"), c = Oa(i), l = c.operations.filter((e) => e.blocked !== void 0).map(Za);
 			if (l.length > 0) a = {
 				...n,
 				outcome: "blocked",
@@ -3655,7 +3844,7 @@ BEGIN
 			};
 			else {
 				await e.apply(c), t(`branch ${e.branchId}: applied ${o.length} operation(s)`);
-				let i = Ra(await e.replan());
+				let i = Qa(await e.replan());
 				a = {
 					...n,
 					outcome: i.length > 0 ? "diverged" : s.length > 0 ? "lossy" : "clean",
@@ -3693,7 +3882,7 @@ BEGIN
 		...a,
 		tornDown: o
 	};
-}, Ba = (e) => {
+}, eo = (e) => {
 	switch (e.outcome) {
 		case "clean": return 0;
 		case "lossy": return 2;
@@ -3702,22 +3891,22 @@ BEGIN
 		case "infidelity": return 1;
 		case "failed": return 1;
 	}
-}, Va = (e) => `    ${e.classification === "lossy" ? "✗" : "•"} ${e.kind}${e.table ? ` ${e.table}` : ""} [${e.classification}]${e.reason ? ` — ${e.reason}` : ""}${e.blockedFix ? `\n        ! ${e.blockedFix}` : ""}`, Ha = (e) => {
+}, to = (e) => `    ${e.classification === "lossy" ? "✗" : "•"} ${e.kind}${e.table ? ` ${e.table}` : ""} [${e.classification}]${e.reason ? ` — ${e.reason}` : ""}${e.blockedFix ? `\n        ! ${e.blockedFix}` : ""}`, no = (e) => {
 	let t = [];
 	if (t.push(`branch rehearsal · ${e.branchId} · mechanism ${e.mechanism}`), t.push(`  branched ${e.branchedTables} table(s), replayed ${e.replayedForeignKeys} foreign key(s)`), e.outcome === "failed") t.push(`  FAILED: ${e.error ?? "unknown error"}`);
 	else if (e.outcome === "infidelity") {
 		t.push("  BRANCH IS NOT A FAITHFUL COPY of the parent — the rehearsal proves nothing about your migration."), t.push("  The parent's own schema still differs from the branch by:");
-		for (let n of e.infidelity) t.push(Va(n));
+		for (let n of e.infidelity) t.push(to(n));
 	} else {
 		t.push(`  plan: ${e.operations.length} operation(s), ${e.lossy.length} lossy, ${e.blocked.length} refused`);
-		for (let n of e.operations) t.push(Va(n));
-		if (e.lossy.length > 0 && (t.push(""), t.push(`  ⚠ ${e.lossy.length} operation(s) DESTROY DATA. They were executed on the branch (it is`), t.push("    disposable) so they are rehearsed, but production refuses them until you set"), t.push("    VOLTRO_DESTRUCTIVE_OK — naming the tables, not `1`.")), e.blocked.length > 0 && (t.push(""), t.push(`  ${e.blocked.length} operation(s) the planner will not auto-apply anywhere — the plan was NOT executed.`)), e.applied && (t.push(""), t.push(e.converged ? "  ✓ applied on the branch, and the re-plan is EMPTY (the migration converges)." : `  ✗ applied, but the re-plan STILL proposes ${e.residual.length} operation(s) — this migration does not converge:`), !e.converged)) for (let n of e.residual) t.push(Va(n));
+		for (let n of e.operations) t.push(to(n));
+		if (e.lossy.length > 0 && (t.push(""), t.push(`  ⚠ ${e.lossy.length} operation(s) DESTROY DATA. They were executed on the branch (it is`), t.push("    disposable) so they are rehearsed, but production refuses them until you set"), t.push("    VOLTRO_DESTRUCTIVE_OK — naming the tables, not `1`.")), e.blocked.length > 0 && (t.push(""), t.push(`  ${e.blocked.length} operation(s) the planner will not auto-apply anywhere — the plan was NOT executed.`)), e.applied && (t.push(""), t.push(e.converged ? "  ✓ applied on the branch, and the re-plan is EMPTY (the migration converges)." : `  ✗ applied, but the re-plan STILL proposes ${e.residual.length} operation(s) — this migration does not converge:`), !e.converged)) for (let n of e.residual) t.push(to(n));
 	}
 	return t.push(e.tornDown ? `  branch ${e.branchId} torn down.` : `  branch ${e.branchId} KEPT — drop it when you are done.`), t.join("\n");
-}, Ua = (e, ...t) => ({
+}, ro = (e, ...t) => ({
 	_tag: "RawSqlFragment",
 	strings: [...e],
 	values: [...t]
-}), Wa = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
+}), io = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
 //#endregion
-export { A as DEFAULT_CDC_CHANNEL, S as FILE_MIGRATION_PATTERN, wa as FileMigrationLedgerError, Ze as REACTIVE_TRIGGER_PREFIX, he as VOLTRO_MIGRATION_LOCK_KEY, Fe as acquireMigrationLock, U as appliedAtValue, Vt as applyNamespacedSchema, na as applyPlan, jt as applySchema, Fa as assessRollingDeployGate, Ba as branchRehearsalExitCode, Qn as chunkTables, Na as classifyRollingDeploySafety, R as declaredSnapshot, it as defaultArrayClause, rt as defaultClause, N as defaultJsonClause, va as describeOutcome, fa as destructiveScope, dn as detectReactiveTriggerDrift, gi as emitAddIndexMysql, Zr as emitCreateTableMysql, jr as emitDropColumnDdl, Mr as emitDropColumnDdlMysql, At as emitFrameworkBootstrapSql, Ot as emitNamespaceProvisionDdl, kt as emitNamespacedSchemaSql, Dt as emitSchemaSql, pr as engineFromVersion, L as fingerprintSchema, xe as fnv1a64, Ha as formatBranchRehearsal, fn as formatReactiveTriggerDrift, da as ignoreTablesFromEnv, fr as introspectSchema, yr as isAlreadySatisfied, u as isFileMigration, Wa as isRawSqlFragment, Nt as isReRunSafeDdl, Kn as mapPgType, d as migration, Se as migrationLockKeyForSchema, Ce as migrationLockNameForSchema, fi as mysqlIndexPrefixFor, $e as notifyFunctionName, P as numericIdSql, Gn as parseEnumCheck, Da as pendingFileMigrationIds, Wn as planMigrations, Ht as provisionTenantNamespace, Qe as reactiveTriggerName, vt as reactiveTriggerRepairSql, oa as recordUpToDate, za as rehearseMigrationOnBranch, La as rehearsedOperation, Yr as renderColumnMysql, Wr as renderColumnPg, _e as resolveMigrationLockSchema, hr as resolveMysqlEngine, Aa as rollbackFileBasedMigration, Pa as rollingDeployUnsafeOps, Oa as runFileBasedMigrations, Ut as runFrameworkBootstrap, Bt as runMigrate, _a as runPlannedMigrations, an as shortFingerprint, on as snapshotColumn, Ua as sql, M as sqlType, ja as squashMigrationPlans, ma as unblockLossy, Ie as withMigrationLock };
+export { j as DEFAULT_CDC_CHANNEL, S as FILE_MIGRATION_PATTERN, Ra as FileMigrationLedgerError, ot as REACTIVE_TRIGGER_PREFIX, be as VOLTRO_MIGRATION_LOCK_KEY, Be as acquireMigrationLock, W as appliedAtValue, Xt as applyNamespacedSchema, ga as applyPlan, Bt as applySchema, Ya as assessRollingDeployGate, eo as branchRehearsalExitCode, cr as chunkTables, qa as classifyRollingDeploySafety, z as declaredSnapshot, pt as defaultArrayClause, ft as defaultClause, P as defaultJsonClause, Ma as describeOutcome, Ea as destructiveScope, bn as detectReactiveTriggerDrift, Ai as emitAddIndexMysql, xi as emitCreateTableMssql, ui as emitCreateTableMysql, ai as emitCreateTablePg, gi as emitCreateTableSqlite, Ur as emitDropColumnDdl, Wr as emitDropColumnDdlMysql, zt as emitFrameworkBootstrapSql, Lt as emitNamespaceProvisionDdl, Rt as emitNamespacedSchemaSql, It as emitSchemaSql, Cr as engineFromVersion, R as fingerprintSchema, Ee as fnv1a64, no as formatBranchRehearsal, xn as formatReactiveTriggerDrift, Ta as ignoreTablesFromEnv, Sr as introspectSchema, kr as isAlreadySatisfied, u as isFileMigration, io as isRawSqlFragment, Ht as isReRunSafeDdl, nr as mapPgType, d as migration, De as migrationLockKeyForSchema, Oe as migrationLockNameForSchema, Ti as mysqlIndexPrefixFor, ct as notifyFunctionName, F as numericIdSql, tr as parseEnumCheck, Va as pendingFileMigrationIds, $n as planMigrations, Zt as provisionTenantNamespace, st as reactiveTriggerName, Dt as reactiveTriggerRepairSql, ba as recordUpToDate, $a as rehearseMigrationOnBranch, Za as rehearsedOperation, ci as renderColumnMysql, ni as renderColumnPg, Se as resolveMigrationLockSchema, Tr as resolveMysqlEngine, Wa as rollbackFileBasedMigration, Ja as rollingDeployUnsafeOps, Ha as runFileBasedMigrations, Qt as runFrameworkBootstrap, Yt as runMigrate, ja as runPlannedMigrations, mn as shortFingerprint, hn as snapshotColumn, ro as sql, N as sqlType, Ga as squashMigrationPlans, Oa as unblockLossy, Ve as withMigrationLock };