@oasys/oecs 0.5.2 → 0.5.4

package/dist/{internal-BMDgWZbt.js → internal-BoxWl4dG.js}

@@ -1,4 +1,4 @@
-import { D as st, h as j, w as Ne, g as rt } from "./shared-BU1Cd40h.js";
+import { D as st, h as j, w as Ne, g as rt } from "./shared-B4v0L1cw.js";
 import { S as ot, t as it } from "./topological_sort-DK6EjpWa.js";
 class Ye extends Error {
   constructor(e, n, r) {
@@ -29,25 +29,25 @@ function at(t, e) {
     `Unhandled ${e}: ${String(t)}`
   );
 }
-var p = /* @__PURE__ */ ((t) => (t.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", t.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", t.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", t.COMPONENT_LIMIT_EXCEEDED = "COMPONENT_LIMIT_EXCEEDED", t.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", t.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", t.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", t.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", t.RESOURCE_NOT_REGISTERED = "RESOURCE_NOT_REGISTERED", t.RESOURCE_ALREADY_REGISTERED = "RESOURCE_ALREADY_REGISTERED", t.EVENT_ALREADY_REGISTERED = "EVENT_ALREADY_REGISTERED", t.EVENT_NOT_REGISTERED = "EVENT_NOT_REGISTERED", t.FIELD_NOT_REGISTERED = "FIELD_NOT_REGISTERED", t.RELATION_NOT_REGISTERED = "RELATION_NOT_REGISTERED", t.RELATION_MODE_INVALID = "RELATION_MODE_INVALID", t.RELATION_MODE_MISMATCH = "RELATION_MODE_MISMATCH", t.RELATION_CYCLE = "RELATION_CYCLE", t.SPARSE_CACHE_KEY_OVERFLOW = "SPARSE_CACHE_KEY_OVERFLOW", t.SPARSE_QUERY_DENSE_PATH = "SPARSE_QUERY_DENSE_PATH", t.HIERARCHY_ALREADY_SET = "HIERARCHY_ALREADY_SET", t.HIERARCHY_INVALID_MAX_DEPTH = "HIERARCHY_INVALID_MAX_DEPTH", t.OBSERVER_NON_CONVERGENT = "OBSERVER_NON_CONVERGENT", t.OBSERVER_INVALID_CONFIG = "OBSERVER_INVALID_CONFIG", t.OBSERVER_ONSET_EMIT = "OBSERVER_ONSET_EMIT", t.INVALID_FIXED_TIMESTEP = "INVALID_FIXED_TIMESTEP", t.INVALID_MAX_FIXED_STEPS = "INVALID_MAX_FIXED_STEPS", t.INVALID_RECORDER_SCHEDULE = "INVALID_RECORDER_SCHEDULE", t.EMPTY_ARCHETYPE_MATERIALIZE = "EMPTY_ARCHETYPE_MATERIALIZE", t.COMPONENT_INDEX_INVARIANT = "COMPONENT_INDEX_INVARIANT", t.OPTIONAL_TERM_NOT_DECLARED = "OPTIONAL_TERM_NOT_DECLARED", t.QUERY_ACCESS_UNDECLARED = "QUERY_ACCESS_UNDECLARED", t.ACCESS_UNDECLARED = "ACCESS_UNDECLARED", t.QUERY_NOT_SINGLETON = "QUERY_NOT_SINGLETON", t.INVALID_RUN_CONDITION = "INVALID_RUN_CONDITION", t.SYSTEM_FN_ARITY = "SYSTEM_FN_ARITY", t.PARTITION_APPEND_NEEDS_ENTITY_ROW = "PARTITION_APPEND_NEEDS_ENTITY_ROW", t.PARTITION_BULK_INTO_DISABLED = "PARTITION_BULK_INTO_DISABLED", t.ENTITY_NOT_DISABLED = "ENTITY_NOT_DISABLED", t.STRUCTURAL_DURING_ITERATION = "STRUCTURAL_DURING_ITERATION", t.BACKEND_ALREADY_ATTACHED = "BACKEND_ALREADY_ATTACHED", t.DETERMINISM_DISABLED = "DETERMINISM_DISABLED", t.NON_DETERMINISTIC_COLUMN_TYPE = "NON_DETERMINISTIC_COLUMN_TYPE", t.INVALID_MEMORY_OPTIONS = "INVALID_MEMORY_OPTIONS", t.STORE_CAP_EXCEEDED = "STORE_CAP_EXCEEDED", t.REGION_NOT_DECLARED = "REGION_NOT_DECLARED", t.COMMAND_LOG_TAG_COLLISION = "COMMAND_LOG_TAG_COLLISION", t.INVALID_FRAME_STEP = "INVALID_FRAME_STEP", t))(p || {});
-class y extends Ye {
+var y = /* @__PURE__ */ ((t) => (t.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", t.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", t.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", t.COMPONENT_LIMIT_EXCEEDED = "COMPONENT_LIMIT_EXCEEDED", t.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", t.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", t.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", t.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", t.RESOURCE_NOT_REGISTERED = "RESOURCE_NOT_REGISTERED", t.RESOURCE_ALREADY_REGISTERED = "RESOURCE_ALREADY_REGISTERED", t.EVENT_ALREADY_REGISTERED = "EVENT_ALREADY_REGISTERED", t.EVENT_NOT_REGISTERED = "EVENT_NOT_REGISTERED", t.FIELD_NOT_REGISTERED = "FIELD_NOT_REGISTERED", t.RELATION_NOT_REGISTERED = "RELATION_NOT_REGISTERED", t.RELATION_MODE_INVALID = "RELATION_MODE_INVALID", t.RELATION_MODE_MISMATCH = "RELATION_MODE_MISMATCH", t.RELATION_CYCLE = "RELATION_CYCLE", t.SPARSE_CACHE_KEY_OVERFLOW = "SPARSE_CACHE_KEY_OVERFLOW", t.SPARSE_QUERY_DENSE_PATH = "SPARSE_QUERY_DENSE_PATH", t.HIERARCHY_ALREADY_SET = "HIERARCHY_ALREADY_SET", t.HIERARCHY_INVALID_MAX_DEPTH = "HIERARCHY_INVALID_MAX_DEPTH", t.OBSERVER_NON_CONVERGENT = "OBSERVER_NON_CONVERGENT", t.OBSERVER_INVALID_CONFIG = "OBSERVER_INVALID_CONFIG", t.OBSERVER_ONSET_EMIT = "OBSERVER_ONSET_EMIT", t.INVALID_FIXED_TIMESTEP = "INVALID_FIXED_TIMESTEP", t.INVALID_MAX_FIXED_STEPS = "INVALID_MAX_FIXED_STEPS", t.INVALID_RECORDER_SCHEDULE = "INVALID_RECORDER_SCHEDULE", t.EMPTY_ARCHETYPE_MATERIALIZE = "EMPTY_ARCHETYPE_MATERIALIZE", t.COMPONENT_INDEX_INVARIANT = "COMPONENT_INDEX_INVARIANT", t.ARCHETYPE_ROW_INVARIANT = "ARCHETYPE_ROW_INVARIANT", t.OPTIONAL_TERM_NOT_DECLARED = "OPTIONAL_TERM_NOT_DECLARED", t.QUERY_ACCESS_UNDECLARED = "QUERY_ACCESS_UNDECLARED", t.ACCESS_UNDECLARED = "ACCESS_UNDECLARED", t.QUERY_NOT_SINGLETON = "QUERY_NOT_SINGLETON", t.INVALID_RUN_CONDITION = "INVALID_RUN_CONDITION", t.SYSTEM_FN_ARITY = "SYSTEM_FN_ARITY", t.PARTITION_APPEND_NEEDS_ENTITY_ROW = "PARTITION_APPEND_NEEDS_ENTITY_ROW", t.PARTITION_BULK_INTO_DISABLED = "PARTITION_BULK_INTO_DISABLED", t.ENTITY_NOT_DISABLED = "ENTITY_NOT_DISABLED", t.STRUCTURAL_DURING_ITERATION = "STRUCTURAL_DURING_ITERATION", t.BACKEND_ALREADY_ATTACHED = "BACKEND_ALREADY_ATTACHED", t.DETERMINISM_DISABLED = "DETERMINISM_DISABLED", t.NON_DETERMINISTIC_COLUMN_TYPE = "NON_DETERMINISTIC_COLUMN_TYPE", t.INVALID_MEMORY_OPTIONS = "INVALID_MEMORY_OPTIONS", t.STORE_CAP_EXCEEDED = "STORE_CAP_EXCEEDED", t.REGION_NOT_DECLARED = "REGION_NOT_DECLARED", t.COMMAND_LOG_TAG_COLLISION = "COMMAND_LOG_TAG_COLLISION", t.INVALID_FRAME_STEP = "INVALID_FRAME_STEP", t))(y || {});
+class T extends Ye {
   constructor(e, n, r) {
     super(n ?? e, !0, r), this.category = e;
   }
 }
-function bn(t) {
-  return t instanceof y;
+function Cn(t) {
+  return t instanceof T;
 }
-const Cn = -1, vn = -1, Un = Object.freeze(/* @__PURE__ */ Object.create(null)), Ln = 2654435769, Mn = 1367130551, F = 1024, $n = 0, ct = 31, Pn = 1 / 60, xn = 4, dt = 0, z = 20, Ge = (1 << z) - 1, $ = Ge, lt = ct - z, oe = (1 << lt) - 1, Bn = oe, Fn = oe - 1, Re = oe << z | $, kn = (t, e) => {
+const bn = -1, vn = -1, Un = Object.freeze(/* @__PURE__ */ Object.create(null)), Ln = 2654435769, Mn = 1367130551, F = 1024, $n = 0, ct = 31, Pn = 1 / 60, xn = 4, dt = 0, z = 20, He = (1 << z) - 1, $ = He, lt = ct - z, oe = (1 << lt) - 1, Bn = oe, Fn = oe - 1, Re = oe << z | $, kn = (t, e) => {
   {
     if (t < 0 || t > $)
-      throw new y(p.EID_MAX_INDEX_OVERFLOW);
+      throw new T(y.EID_MAX_INDEX_OVERFLOW);
     if (e < 0 || e > oe)
-      throw new y(p.EID_MAX_GEN_OVERFLOW);
+      throw new T(y.EID_MAX_GEN_OVERFLOW);
   }
   return e << z | t;
-}, L = (t) => t & Ge, De = (t) => t >> z, Yn = (t, e, n) => new y(
-  p.ENTITY_NOT_ALIVE,
+}, L = (t) => t & He, De = (t) => t >> z, Yn = (t, e, n) => new T(
+  y.ENTITY_NOT_ALIVE,
   `${t}: entity ${e} (index ${L(e)}, generation ${De(
     e
   )}) is not alive${n ? ` — ${n}` : ""} (destroyed, never created, or a stale handle; guard with isAlive() first)`,
@@ -56,7 +56,7 @@ const Cn = -1, vn = -1, Un = Object.freeze(/* @__PURE__ */ Object.create(null)),
 function Vn(t, e) {
   ge.set(t, e);
 }
-function Gn(t) {
+function Hn(t) {
   return ge.get(t);
 }
 function ut(t) {
@@ -98,7 +98,7 @@ const ft = 827148627, ht = 0, ee = 4, _t = 52, m = {
 function mt(t, e) {
   t.setUint32(m.magic, e.magic, !0), t.setUint32(m.sim_abi_version, e.simAbiVersion, !0), t.setUint32(m.view_stamp, e.viewStamp, !0), t.setUint32(m.capacity, e.capacity, !0), t.setUint32(m.archetype_count, e.archetypeCount, !0), t.setUint32(m.layout_descriptor_off, e.layoutDescriptorOff, !0), t.setUint32(m.command_ring_off, e.commandRingOff, !0), t.setUint32(m.action_ring_off, e.actionRingOff, !0), t.setUint32(m.entity_index_off, e.entityIndexOff, !0), t.setUint32(m.event_ring_off, e.eventRingOff, !0), t.setUint32(m.region_table_off, e.regionTableOff, !0), t.setUint32(m.region_table_count, e.regionTableCount, !0), t.setUint32(m.bindings_off, e.bindingsOff, !0);
 }
-function Hn(t) {
+function Gn(t) {
   return {
     magic: t.getUint32(m.magic, !0),
     simAbiVersion: t.getUint32(m.sim_abi_version, !0),
@@ -133,7 +133,7 @@ const E = {
   [E.i32]: 4,
   [E.f32]: 4,
   [E.f64]: 8
-}), Xn = {
+}), Wn = {
   u8: E.u8,
   i8: E.i8,
   u16: E.u16,
@@ -155,8 +155,8 @@ function Et(t, e) {
     stride: t.getUint16(e + O.stride, !0)
   };
 }
-const Wn = ee * 32;
-function He(t) {
+const Xn = ee * 32;
+function Ge(t) {
   return pe + t * Ee;
 }
 function pt(t, e, n) {
@@ -204,24 +204,24 @@ function zn(t, e, n) {
   let s = e;
   for (let o = 0; o < n; o++) {
     const i = yt(t, s);
-    r[o] = i, s += He(i.columns.length);
+    r[o] = i, s += Ge(i.columns.length);
   }
   return r;
 }
 function At(t) {
   let e = 0;
   for (let n = 0; n < t.length; n++)
-    e += He(t[n].columns.length);
+    e += Ge(t[n].columns.length);
   return e;
 }
-const Xe = 16, P = 16, qn = 256, b = {
+const We = 16, P = 16, qn = 256, C = {
   write_head: 0,
   read_head: 4,
   capacity_slots: 8,
   overflow_flag: 12
 }, ye = 0;
-function be(t) {
-  return Xe + t * P;
+function Ce(t) {
+  return We + t * P;
 }
 function It(t) {
   return t > 0 && (t & t - 1) === 0;
@@ -236,26 +236,26 @@ function wt(t, e, n) {
     throw new v(
       `command ring capacity_slots must be a positive power of two (got ${n})`
     );
-  t.setUint32(e + b.write_head, 0, !0), t.setUint32(e + b.read_head, 0, !0), t.setUint32(e + b.capacity_slots, n, !0), t.setUint32(e + b.overflow_flag, 0, !0);
+  t.setUint32(e + C.write_head, 0, !0), t.setUint32(e + C.read_head, 0, !0), t.setUint32(e + C.capacity_slots, n, !0), t.setUint32(e + C.overflow_flag, 0, !0);
 }
 function St(t, e) {
-  return t.getUint32(e + b.write_head, !0);
+  return t.getUint32(e + C.write_head, !0);
 }
 function Nt(t, e) {
-  return t.getUint32(e + b.read_head, !0);
+  return t.getUint32(e + C.read_head, !0);
 }
 function Rt(t, e) {
-  return t.getUint32(e + b.capacity_slots, !0);
+  return t.getUint32(e + C.capacity_slots, !0);
 }
 function Dt(t, e, n) {
   if (n.byteLength !== P - 1)
     throw new v(
-      `out_payload must be ${P - 1} bytes (got ${n.byteLength})`
+      `outPayload must be ${P - 1} bytes (got ${n.byteLength})`
     );
   const r = St(t, e), s = Nt(t, e);
   if (r === s) return ye;
-  const o = Rt(t, e), i = s & o - 1, a = e + Xe + i * P, c = t.getUint8(a), l = new Uint8Array(t.buffer, a + 1, P - 1);
-  return n.set(l), t.setUint32(e + b.read_head, s + 1 >>> 0, !0), c;
+  const o = Rt(t, e), i = s & o - 1, a = e + We + i * P, c = t.getUint8(a), d = new Uint8Array(t.buffer, a + 1, P - 1);
+  return n.set(d), t.setUint32(e + C.read_head, s + 1 >>> 0, !0), c;
 }
 function Ot(t, e, n) {
   let r = 0;
@@ -271,38 +271,38 @@ const ie = 16, R = 12, te = {
   capacity: 4
   // 8..16: pad to 16-byte alignment so the i32 arrays start aligned.
 }, U = 1 << 20;
-function Ce(t) {
+function be(t) {
   if (t < 0 || !Number.isInteger(t))
-    throw new We(
-      `entity_index capacity must be a non-negative integer (got ${t})`
+    throw new Xe(
+      `entity index capacity must be a non-negative integer (got ${t})`
     );
   return ie + t * R;
 }
-function bt(t) {
+function Ct(t) {
   return t + ie;
 }
-function Ct(t, e) {
+function bt(t, e) {
   return t + ie + e * 4;
 }
 function vt(t, e) {
   return t + ie + e * 8;
 }
-class We extends Error {
+class Xe extends Error {
   constructor(e) {
     super(e), this.name = "EntityIndexError";
   }
 }
 function Ut(t, e, n) {
   if (n < 0 || !Number.isInteger(n))
-    throw new We(
-      `entity_index capacity must be a non-negative integer (got ${n})`
+    throw new Xe(
+      `entity index capacity must be a non-negative integer (got ${n})`
     );
   t.setUint32(e + te.length, 0, !0), t.setUint32(e + te.capacity, n, !0);
 }
 function jn(t, e, n) {
   return {
-    generations: new Int32Array(t, bt(e), n),
-    archetypes: new Int32Array(t, Ct(e, n), n),
+    generations: new Int32Array(t, Ct(e), n),
+    archetypes: new Int32Array(t, bt(e, n), n),
     rows: new Int32Array(t, vt(e, n), n)
   };
 }
@@ -335,14 +335,14 @@ const Bt = 16, Ft = 16, Qn = 256, V = {
   read_head: 4,
   capacity_slots: 8,
   overflow_flag: 12
-}, kt = V.write_head / 4, Yt = V.read_head / 4, Vt = V.capacity_slots / 4, Gt = V.overflow_flag / 4;
-function Ht(t, e) {
+}, kt = V.write_head / 4, Yt = V.read_head / 4, Vt = V.capacity_slots / 4, Ht = V.overflow_flag / 4;
+function Gt(t, e) {
   return new Int32Array(t.buffer, t.byteOffset + e, 4);
 }
 function Ue(t) {
   return Bt + t * Ft;
 }
-function Xt(t) {
+function Wt(t) {
   return t > 0 && (t & t - 1) === 0;
 }
 class Le extends Error {
@@ -350,28 +350,28 @@ class Le extends Error {
     super(e), this.name = "ActionRingError";
   }
 }
-function Wt(t, e, n) {
-  if (!Xt(n))
+function Xt(t, e, n) {
+  if (!Wt(n))
     throw new Le(
       `action ring capacity_slots must be a positive power of two (got ${n})`
     );
   if ((t.byteOffset + e) % 4 !== 0)
     throw new Le(
-      `action ring header must be 4-byte aligned for Atomics (view.byteOffset ${t.byteOffset} + ring_off ${e} is not a multiple of 4)`
+      `action ring header must be 4-byte aligned for Atomics (view.byteOffset ${t.byteOffset} + ringOff ${e} is not a multiple of 4)`
     );
-  const r = Ht(t, e);
-  Atomics.store(r, kt, 0), Atomics.store(r, Yt, 0), Atomics.store(r, Vt, n), Atomics.store(r, Gt, 0);
+  const r = Gt(t, e);
+  Atomics.store(r, kt, 0), Atomics.store(r, Yt, 0), Atomics.store(r, Vt, n), Atomics.store(r, Ht, 0);
 }
 const K = [
   {
     name: "command_ring",
     headerOff: "command_ring_off",
-    sizeFromOptions: (t) => t.commandRingCapacitySlots !== void 0 ? be(t.commandRingCapacitySlots) : 0,
+    sizeFromOptions: (t) => t.commandRingCapacitySlots !== void 0 ? Ce(t.commandRingCapacitySlots) : 0,
     init: (t, e, n) => wt(t, e, n.commandRingCapacitySlots),
-    regionBytes: (t, e) => be(t.getUint32(e + b.capacity_slots, !0)),
+    regionBytes: (t, e) => Ce(t.getUint32(e + C.capacity_slots, !0)),
     readOptions: (t, e, n) => {
       n.commandRingCapacitySlots = t.getUint32(
-        e + b.capacity_slots,
+        e + C.capacity_slots,
         !0
       );
     }
@@ -379,9 +379,9 @@ const K = [
   {
     name: "entity_index",
     headerOff: "entity_index_off",
-    sizeFromOptions: (t) => t.entityIndexCapacity !== void 0 ? Ce(t.entityIndexCapacity) : 0,
+    sizeFromOptions: (t) => t.entityIndexCapacity !== void 0 ? be(t.entityIndexCapacity) : 0,
     init: (t, e, n) => Ut(t, e, n.entityIndexCapacity),
-    regionBytes: (t, e) => Ce(t.getUint32(e + te.capacity, !0)),
+    regionBytes: (t, e) => be(t.getUint32(e + te.capacity, !0)),
     readOptions: (t, e, n) => {
       n.entityIndexCapacity = t.getUint32(e + te.capacity, !0);
     }
@@ -403,7 +403,7 @@ const K = [
     name: "action_ring",
     headerOff: "action_ring_off",
     sizeFromOptions: (t) => t.actionRingCapacitySlots !== void 0 ? Ue(t.actionRingCapacitySlots) : 0,
-    init: (t, e, n) => Wt(t, e, n.actionRingCapacitySlots),
+    init: (t, e, n) => Xt(t, e, n.actionRingCapacitySlots),
     regionBytes: (t, e) => Ue(t.getUint32(e + V.capacity_slots, !0)),
     readOptions: (t, e, n) => {
       n.actionRingCapacitySlots = t.getUint32(
@@ -501,7 +501,7 @@ const Ae = 2 ** 31;
 class je extends Error {
   constructor(e) {
     super(
-      `SAB column layout offset ${e} reaches or exceeds the 2³¹ (${Ae}-byte) ceiling. Past 2 GiB the signed-32-bit bitwise alignment math wraps to negative/misaligned offsets. This is a structural limit independent of the (default 256 MiB) allocator cap — a single SAB cannot back more than ~2 GiB of column data (#382).`
+      `SAB column layout offset ${e} reaches or exceeds the 2³¹ (${Ae}-byte) ceiling. Past 2 GiB the signed-32-bit bitwise alignment math wraps to negative/misaligned offsets. This is a structural limit independent of the (default 256 MiB) allocator cap — a single SAB cannot back more than ~2 GiB of column data.`
     ), this.name = "StoreLayoutOverflowError";
   }
 }
@@ -550,10 +550,10 @@ function Jt(t, e, n = 0) {
   let o = e + s;
   const i = new Array(t.length);
   for (let a = 0; a < t.length; a++) {
-    const c = t[a], l = new Array(c.columns.length);
-    for (let d = 0; d < c.columns.length; d++) {
-      const f = c.columns[d], h = Oe[f.typeTag];
-      o = Ke(o, h), l[d] = {
+    const c = t[a], d = new Array(c.columns.length);
+    for (let l = 0; l < c.columns.length; l++) {
+      const f = c.columns[l], h = Oe[f.typeTag];
+      o = Ke(o, h), d[l] = {
         componentId: f.componentId,
         fieldId: f.fieldId,
         typeTag: f.typeTag,
@@ -567,7 +567,7 @@ function Jt(t, e, n = 0) {
       rowCount: 0,
       enabledCount: 0,
       rowCapacity: c.rowCapacity,
-      columns: l
+      columns: d
     };
   }
   if (o > Ae)
@@ -582,8 +582,8 @@ function ns(t, e = st, n = {}) {
   const r = {};
   let s = _t;
   for (let w = 0; w < K.length; w++) {
-    const C = K[w], H = C.sizeFromOptions(n);
-    r[C.headerOff] = H === 0 ? 0 : s, s += H;
+    const b = K[w], G = b.sizeFromOptions(n);
+    r[b.headerOff] = G === 0 ? 0 : s, s += G;
   }
   const o = n.regions ?? [];
   zt(o);
@@ -591,12 +591,12 @@ function ns(t, e = st, n = {}) {
   s += ze(i);
   const c = new Array(i);
   for (let w = 0; w < o.length; w++) {
-    const C = o[w];
-    c[w] = { regionId: C.id, byteOffset: s, byteLength: C.bytes }, s += C.bytes;
+    const b = o[w];
+    c[w] = { regionId: b.id, byteOffset: s, byteLength: b.bytes }, s += b.bytes;
   }
-  const l = n.bindingsRegionBytes ?? 0, d = l === 0 ? 0 : s;
-  s += l;
-  const f = s, { descriptors: h, totalBytes: g, regionBytes: A } = Jt(
+  const d = n.bindingsRegionBytes ?? 0, l = d === 0 ? 0 : s;
+  s += d;
+  const f = s, { descriptors: h, totalBytes: g, regionBytes: p } = Jt(
     t,
     f,
     n.reservedDescriptorBytes ?? 0
@@ -607,7 +607,7 @@ function ns(t, e = st, n = {}) {
     capacity: g,
     archetypeCount: t.length,
     layoutDescriptorOff: f,
-    bindingsOff: d,
+    bindingsOff: l,
     regionTableOff: a,
     regionTableCount: i,
     // `regionOffsets` stays keyed by the snake ABI field names (it also indexes
@@ -617,10 +617,10 @@ function ns(t, e = st, n = {}) {
     eventRingOff: r.event_ring_off,
     actionRingOff: r.action_ring_off
   };
-  mt(_, I), l > 0 && new Uint8Array(u, d, l).fill(0);
+  mt(_, I), d > 0 && new Uint8Array(u, l, d).fill(0);
   for (let w = 0; w < K.length; w++) {
-    const C = K[w], H = r[C.headerOff];
-    H !== 0 && C.init(_, H, n);
+    const b = K[w], G = r[b.headerOff];
+    G !== 0 && b.init(_, G, n);
   }
   a !== 0 && jt(_, a, c);
   for (let w = 0; w < o.length; w++)
@@ -632,10 +632,10 @@ function ns(t, e = st, n = {}) {
     view: _,
     header: I,
     archetypes: B,
-    _regionBytes: A,
+    _regionBytes: p,
     _allocator: e,
     // Carry the headroom policy with the store so the realloc slow path
-    // (`optionsFromOld`) can re-reserve the same margin (#541).
+    // (`optionsFromOld`) can re-reserve the same margin.
     _reservedDescriptorBytes: n.reservedDescriptorBytes ?? 0
   };
 }
@@ -644,7 +644,7 @@ function en(t, e) {
   for (let r = 0; r < e.length; r++) {
     const s = e[r], o = new Array(s.columns.length), i = /* @__PURE__ */ new Map();
     for (let a = 0; a < s.columns.length; a++) {
-      const c = s.columns[a], l = {
+      const c = s.columns[a], d = {
         componentId: c.componentId,
         fieldId: c.fieldId,
         typeTag: c.typeTag,
@@ -652,7 +652,7 @@ function en(t, e) {
         stride: c.stride,
         view: Zt(t, c.typeTag, c.byteOff, s.rowCapacity)
       };
-      o[a] = l, i.set(Qt(c.componentId, c.fieldId), l);
+      o[a] = d, i.set(Qt(c.componentId, c.fieldId), d);
     }
     n.set(s.archetypeId, {
       archetypeId: s.archetypeId,
@@ -689,13 +689,13 @@ class rs {
   }
   /** Live entity indices that hold this component (dense, iteration order is
    * SparseMap insertion/swap order — NOT canonical). Used by the hot query
-   * integration path (#469); for the determinism surface use
+   * integration path; for the determinism surface use
    * `canonicalIndices` instead. */
   get indices() {
     return this._data.keys;
   }
   /** Live entity indices in **canonical** (ascending) order — the determinism
-   * ordering for `stateHash` + snapshot/restore (ADR-0011, #470). The native
+   * ordering for `stateHash` + snapshot/restore. The native
    * `indices` getter is insertion/swap order and would make two worlds with
    * identical contents reached by different add/remove histories diverge, so
    * the cold determinism paths sort here. Allocates a sorted copy each call;
@@ -749,12 +749,12 @@ class rs {
     return s === void 0 ? !1 : (s[n] = r, !0);
   }
 }
-class T extends Error {
+class A extends Error {
   constructor(e) {
     super(e), this.name = "SparseRestoreError";
   }
 }
-const Ie = 12, we = 4, G = 8;
+const Ie = 12, we = 4, H = 8;
 function Se(t, e) {
   let n = tn;
   const r = (s) => {
@@ -768,7 +768,7 @@ function os(t) {
   let e = 4;
   for (let o = 0; o < t.length; o++) {
     const i = t[o], a = i.fieldNames.length;
-    e += Ie + i.size * (we + a * G);
+    e += Ie + i.size * (we + a * H);
   }
   const n = new Uint8Array(e), r = new DataView(n.buffer);
   let s = 0;
@@ -776,12 +776,12 @@ function os(t) {
   for (let o = 0; o < t.length; o++) {
     const i = t[o], a = i.fieldNames.length, c = i.canonicalIndices();
     r.setUint32(s, a, !0), s += 4, r.setUint32(s, Se(i.fieldNames, i.fieldTypes), !0), s += 4, r.setUint32(s, c.length, !0), s += 4;
-    for (let l = 0; l < c.length; l++) {
-      const d = c[l];
-      r.setUint32(s, d, !0), s += 4;
-      const f = i.getRow(d);
+    for (let d = 0; d < c.length; d++) {
+      const l = c[d];
+      r.setUint32(s, l, !0), s += 4;
+      const f = i.getRow(l);
       for (let h = 0; h < a; h++)
-        r.setFloat64(s, f[h], !0), s += G;
+        r.setFloat64(s, f[h], !0), s += H;
     }
   }
   return n;
@@ -791,49 +791,49 @@ function is(t, e) {
   let s = 0;
   const o = (a) => {
     if (s + a > r)
-      throw new T(
+      throw new A(
         `sparse snapshot truncated: need ${a} more bytes at offset ${s}, have ${r - s}`
       );
   };
   o(4);
   const i = n.getUint32(s, !0);
   if (s += 4, i !== t.length)
-    throw new T(
+    throw new A(
       `sparse store count mismatch: snapshot=${i}, registered=${t.length}`
     );
   for (let a = 0; a < t.length; a++) {
     const c = t[a];
     o(Ie);
-    const l = n.getUint32(s, !0);
-    s += 4;
     const d = n.getUint32(s, !0);
     s += 4;
+    const l = n.getUint32(s, !0);
+    s += 4;
     const f = n.getUint32(s, !0);
-    if (s += 4, l !== c.fieldNames.length)
-      throw new T(
-        `sparse store ${a} field-count mismatch: snapshot=${l}, registered=${c.fieldNames.length}`
+    if (s += 4, d !== c.fieldNames.length)
+      throw new A(
+        `sparse store ${a} field-count mismatch: snapshot=${d}, registered=${c.fieldNames.length}`
       );
     const h = Se(c.fieldNames, c.fieldTypes);
-    if (d !== h)
-      throw new T(
-        `sparse store ${a} schema identity mismatch: snapshot hash=${d}, registered=${h} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
+    if (l !== h)
+      throw new A(
+        `sparse store ${a} schema identity mismatch: snapshot hash=${l}, registered=${h} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
       );
     c.clear();
     for (let g = 0; g < f; g++) {
-      o(we + l * G);
-      const A = n.getUint32(s, !0);
-      if (s += 4, A > $)
-        throw new T(
-          `sparse store ${a} member ${g} entity index ${A} exceeds MAX_INDEX (${$})`
+      o(we + d * H);
+      const p = n.getUint32(s, !0);
+      if (s += 4, p > $)
+        throw new A(
+          `sparse store ${a} member ${g} entity index ${p} exceeds MAX_INDEX (${$})`
         );
-      const u = new Array(l);
-      for (let _ = 0; _ < l; _++)
-        u[_] = n.getFloat64(s, !0), s += G;
-      c.setRawRow(A, u);
+      const u = new Array(d);
+      for (let _ = 0; _ < d; _++)
+        u[_] = n.getFloat64(s, !0), s += H;
+      c.setRawRow(p, u);
     }
   }
   if (s !== r)
-    throw new T(
+    throw new A(
       `sparse snapshot has ${r - s} trailing bytes after the last store (not a canonical encoding)`
     );
 }
@@ -842,45 +842,45 @@ function as(t, e) {
   let s = 0;
   const o = (a) => {
     if (s + a > r)
-      throw new T(
+      throw new A(
         `sparse snapshot truncated: need ${a} more bytes at offset ${s}, have ${r - s}`
       );
   };
   o(4);
   const i = n.getUint32(s, !0);
   if (s += 4, i !== t.length)
-    throw new T(
+    throw new A(
       `sparse store count mismatch: snapshot=${i}, registered=${t.length}`
     );
   for (let a = 0; a < t.length; a++) {
     const c = t[a];
     o(Ie);
-    const l = n.getUint32(s, !0);
-    s += 4;
     const d = n.getUint32(s, !0);
     s += 4;
+    const l = n.getUint32(s, !0);
+    s += 4;
     const f = n.getUint32(s, !0);
-    if (s += 4, l !== c.fieldNames.length)
-      throw new T(
-        `sparse store ${a} field-count mismatch: snapshot=${l}, registered=${c.fieldNames.length}`
+    if (s += 4, d !== c.fieldNames.length)
+      throw new A(
+        `sparse store ${a} field-count mismatch: snapshot=${d}, registered=${c.fieldNames.length}`
       );
     const h = Se(c.fieldNames, c.fieldTypes);
-    if (d !== h)
-      throw new T(
-        `sparse store ${a} schema identity mismatch: snapshot hash=${d}, registered=${h} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
+    if (l !== h)
+      throw new A(
+        `sparse store ${a} schema identity mismatch: snapshot hash=${l}, registered=${h} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
       );
     for (let g = 0; g < f; g++) {
-      o(we + l * G);
-      const A = n.getUint32(s, !0);
-      if (s += 4, A > $)
-        throw new T(
-          `sparse store ${a} member ${g} entity index ${A} exceeds MAX_INDEX (${$})`
+      o(we + d * H);
+      const p = n.getUint32(s, !0);
+      if (s += 4, p > $)
+        throw new A(
+          `sparse store ${a} member ${g} entity index ${p} exceeds MAX_INDEX (${$})`
         );
-      s += l * G;
+      s += d * H;
     }
   }
   if (s !== r)
-    throw new T(
+    throw new A(
       `sparse snapshot has ${r - s} trailing bytes after the last store (not a canonical encoding)`
     );
 }
@@ -895,12 +895,12 @@ class Ze {
    * multi. Carries membership (and the target, when exclusive). */
   sparse;
   /** Cleanup policy applied to this relation's sources when a target is
-   * destroyed (#473). `orphan` (the default) is a no-op — the link dangles
+   * destroyed. `orphan` (the default) is a no-op — the link dangles
    * safely. `Store` reads this at destroy-flush off `sourcesOf`. */
   onDeleteTarget;
   /** The backing sparse store instance. Owned for registration/liveness by
    * `Store`, but the relation drives the forward/membership rows on it directly
-   * — that is the cardinality interaction this class now encapsulates (#498). */
+   * — that is the cardinality interaction this class now encapsulates. */
   _store;
   /** target `EntityID` → set of source `EntityID`s. Keyed by the full id, not
    * the index, so a recycled target slot can't alias a dead target's sources.
@@ -923,7 +923,7 @@ class Ze {
     r !== void 0 && (r.delete(n), r.size === 0 && this._reverse.delete(e));
   }
   /** Drop every reverse-index entry whose **target** is no longer alive,
-   * returning the count dropped (#491). The `orphan` policy intentionally
+   * returning the count dropped. The `orphan` policy intentionally
    * leaves a destroyed target's reverse entry intact (the link dangles
    * safely), so a long-lived source that orphan-points at a stream of
    * short-lived targets and never re-targets/dies accumulates dead-target keys
@@ -1019,7 +1019,7 @@ class rn extends Ze {
     }
   }
   restoreAddTarget() {
-    throw new T(
+    throw new A(
       "exclusive relation has no multi forward sources to restore (snapshot header should have guarded this)"
     );
   }
@@ -1103,9 +1103,9 @@ function ls(t) {
       continue;
     }
     const c = [];
-    a.forEachCanonicalTargetSet((l, d) => c.push([l, d])), e[i] = c, n += et;
-    for (let l = 0; l < c.length; l++)
-      n += tt + c[l][1].length * ne;
+    a.forEachCanonicalTargetSet((d, l) => c.push([d, l])), e[i] = c, n += et;
+    for (let d = 0; d < c.length; d++)
+      n += tt + c[d][1].length * ne;
   }
   const r = new Uint8Array(n), s = new DataView(r.buffer);
   let o = 0;
@@ -1116,10 +1116,10 @@ function ls(t) {
     if (a !== null) {
       s.setUint32(o, a.length, !0), o += 4;
       for (let c = 0; c < a.length; c++) {
-        const l = a[c][0], d = a[c][1];
-        s.setUint32(o, l, !0), o += 4, s.setUint32(o, d.length, !0), o += 4;
-        for (let f = 0; f < d.length; f++)
-          s.setFloat64(o, d[f], !0), o += ne;
+        const d = a[c][0], l = a[c][1];
+        s.setUint32(o, d, !0), o += 4, s.setUint32(o, l.length, !0), o += 4;
+        for (let f = 0; f < l.length; f++)
+          s.setFloat64(o, l[f], !0), o += ne;
       }
     }
   }
@@ -1130,7 +1130,7 @@ function us(t, e, n) {
   let o = 0;
   const i = (c) => {
     if (o + c > s)
-      throw new T(
+      throw new A(
         `relation snapshot truncated: need ${c} more bytes at offset ${o}, have ${s - o}`
       );
   };
@@ -1138,18 +1138,18 @@ function us(t, e, n) {
   i(4);
   const a = r.getUint32(o, !0);
   if (o += 4, a !== t.length)
-    throw new T(
+    throw new A(
       `relation count mismatch: snapshot=${a}, registered=${t.length}`
     );
   for (let c = 0; c < t.length; c++) {
-    const l = t[c];
+    const d = t[c];
     i(Je);
-    const d = r.getUint32(o, !0);
-    if (o += 4, d === 1 === l.exclusive)
-      throw new T(
-        `relation ${c} cardinality mismatch: snapshot ${d ? "multi" : "exclusive"}, registered ${l.exclusive ? "exclusive" : "multi"}`
+    const l = r.getUint32(o, !0);
+    if (o += 4, l === 1 === d.exclusive)
+      throw new A(
+        `relation ${c} cardinality mismatch: snapshot ${l ? "multi" : "exclusive"}, registered ${d.exclusive ? "exclusive" : "multi"}`
       );
-    if (l.exclusive) continue;
+    if (d.exclusive) continue;
     i(et);
     const f = r.getUint32(o, !0);
     o += 4;
@@ -1157,33 +1157,33 @@ function us(t, e, n) {
       i(tt);
       const g = r.getUint32(o, !0);
       o += 4;
-      const A = r.getUint32(o, !0);
+      const p = r.getUint32(o, !0);
       if (o += 4, g > $)
-        throw new T(
+        throw new A(
           `relation ${c} source index ${g} exceeds MAX_INDEX (${$})`
         );
-      i(A * ne);
+      i(p * ne);
       const u = n(g);
-      for (let _ = 0; _ < A; _++) {
+      for (let _ = 0; _ < p; _++) {
         const I = r.getFloat64(o, !0);
         o += ne;
         const B = I;
         if (!Number.isInteger(B) || B < 0 || B > Re)
-          throw new T(
+          throw new A(
             `relation ${c} target ${B} is not a well-formed packed EntityID (expected an integer in [0, ${Re}])`
           );
-        l.restoreAddTarget(g, I, u);
+        d.restoreAddTarget(g, I, u);
       }
     }
   }
   if (o !== s)
-    throw new T(
+    throw new A(
       `relation snapshot has ${s - o} trailing bytes after the last relation (not a canonical encoding)`
     );
 }
 const $e = /* @__PURE__ */ new WeakMap();
 function an(t) {
-  const e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set();
+  const e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set();
   for (let u = 0; u < t.writes.length; u++) {
     const _ = t.writes[u].id;
     n.add(_), e.add(_), r.add(_);
@@ -1225,12 +1225,12 @@ function an(t) {
   if (g !== void 0)
     for (let u = 0; u < g.length; u++) {
       const _ = g[u];
-      d.add(_), l.add(_);
+      l.add(_), d.add(_);
     }
-  const A = t.relationReads;
-  if (A !== void 0)
-    for (let u = 0; u < A.length; u++)
-      l.add(A[u]);
+  const p = t.relationReads;
+  if (p !== void 0)
+    for (let u = 0; u < p.length; u++)
+      d.add(p[u]);
   return {
     reads: e,
     writes: n,
@@ -1241,8 +1241,8 @@ function an(t) {
     resourceWrites: i,
     sparseReads: a,
     sparseWrites: c,
-    relationReads: l,
-    relationWrites: d
+    relationReads: d,
+    relationWrites: l
   };
 }
 function cn(t) {
@@ -1283,17 +1283,17 @@ class un {
   active = null;
   sets = null;
   // The label used in violation messages. Tracks `active` for a system span,
-  // but a run-condition span (#576) has no descriptor — only this name — so the
+  // but a run-condition span has no descriptor — only this name — so the
   // failure helpers read the label here rather than off `active`.
   activeName = null;
-  // An `exclusive` system (#681) has full world access: every check_* below
+  // An `exclusive` system has full world access: every check_* below
   // passes for the whole span. Kept as an explicit flag (rather than leaving
   // `sets` null) so `isActive()` stays truthful inside the span.
   exclusive = !1;
   enter(e) {
     this.active = e, this.activeName = e.name ?? `system_${e.id}`, this.exclusive = e.exclusive === !0, this.sets = this.exclusive ? null : cn(e);
   }
-  /** Open a reads-only span for a run condition (#576). No descriptor — a
+  /** Open a reads-only span for a run condition. No descriptor — a
    * condition can gate a whole SystemSet, so it isn't attributable to one
    * system — just its declared reads/resource_reads and a name for diagnostics.
    * Paired with `leave()`. */
@@ -1325,8 +1325,8 @@ class un {
   checkDestroy() {
     if (this.sets === null || this.sets.hasDespawns) return;
     const e = this.activeName;
-    throw new y(
-      p.ACCESS_UNDECLARED,
+    throw new T(
+      y.ACCESS_UNDECLARED,
       `system '${e}' called despawn but didn't declare any despawns — declare the components this system removes via despawn in its 'despawns'`,
       { system: e, op: "despawn" }
     );
@@ -1341,7 +1341,7 @@ class un {
     const n = e;
     this.sets.resourceWrites.has(n) || this.failResource("write", e, "resourceWrites");
   }
-  // --- Sparse component / relation checks (#496) ---
+  // --- Sparse component / relation checks ---
   // Keyed against the dedicated sparse/relation sets, NOT the dense
   // `reads`/`writes` sets — the id spaces are disjoint by construction (see
   // file header). `def as unknown as number` recovers the SparseComponentID /
@@ -1366,7 +1366,7 @@ class un {
     const n = e;
     this.sets.relationWrites.has(n) || this.failRelation("write", n, "relationWrites");
   }
-  /** A `(*, T)` wildcard (`Query.forEachRelatedTo`, #579) reads every
+  /** A `(*, T)` wildcard (`Query.forEachRelatedTo`) reads every
    * relation's reverse index, so it can't name a specific relation — it is
    * authorised by the `ANY_RELATION` sentinel in `relationReads`. Honoured here
    * exactly like a per-relation read, just keyed on the reserved sentinel id
@@ -1378,7 +1378,7 @@ class un {
       "relationReads (as ANY_RELATION)"
     ));
   }
-  // --- Optional query-term scope (#592) ---
+  // --- Optional query-term scope ---
   // `Query.forEach` and `ChangedQuery.forEach` push the iterating query's
   // `_optional` term list for the span of the callback;
   // `Archetype.getOptionalColumnRead` then verifies the fetched component was
@@ -1392,7 +1392,7 @@ class un {
   // `query.archetypes` walk can't be attributed to an optional declaration, so it
   // isn't checked — mirroring the unchecked outside-of-system calls in the header.
   //
-  // CAVEAT (#594 Task 3): the gate always attributes to the INNERMOST active
+  // CAVEAT: the gate always attributes to the INNERMOST active
   // `forEach`. If you nest `forEach` and call `getOptionalColumnRead` on an
   // OUTER query's archetype inside the inner loop, it is checked against the inner
   // query's terms (a false throw or false pass). Per-query attribution isn't worth
@@ -1411,39 +1411,39 @@ class un {
     const r = this.optionalScopes[n - 1], s = e.id;
     for (let o = 0; o < r.length; o++)
       if (r[o] === s) return;
-    throw new y(
-      p.OPTIONAL_TERM_NOT_DECLARED,
+    throw new T(
+      y.OPTIONAL_TERM_NOT_DECLARED,
       `getOptionalColumnRead fetched optional component ${s} but the iterating query didn't declare it — add .optional(component) to the query before fetching it`
     );
   }
   failComponent(e, n, r) {
     const s = this.activeName, o = ut(n);
-    throw new y(
-      p.ACCESS_UNDECLARED,
+    throw new T(
+      y.ACCESS_UNDECLARED,
       `system '${s}' performed ${e} on ${o} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
       { system: s, op: e, component: n.id }
     );
   }
   failSparse(e, n, r) {
     const s = this.activeName;
-    throw new y(
-      p.ACCESS_UNDECLARED,
+    throw new T(
+      y.ACCESS_UNDECLARED,
       `system '${s}' performed ${e} on sparse component ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
       { system: s, op: e, sparse: n }
     );
   }
   failRelation(e, n, r) {
     const s = this.activeName;
-    throw new y(
-      p.ACCESS_UNDECLARED,
+    throw new T(
+      y.ACCESS_UNDECLARED,
       `system '${s}' performed ${e} on relation ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
       { system: s, op: e, relation: n }
     );
   }
   failResource(e, n, r) {
     const s = this.activeName, o = n.description ?? "<unnamed>";
-    throw new y(
-      p.ACCESS_UNDECLARED,
+    throw new T(
+      y.ACCESS_UNDECLARED,
       `system '${s}' performed resource ${e} on '${o}' but didn't declare it — add the resource key to '${r}' (see docs/api/systems.md)`,
       { system: s, op: e, resource: o }
     );
@@ -1511,8 +1511,8 @@ class hn {
     for (const [n, r] of this.buf.entries()) {
       const [s, o, i, a] = n.split("	");
       if (!s || !o || a === void 0) continue;
-      const l = { key: s === "actions" ? Number(i) : i, file: a, count: r }, f = e[s][o];
-      f && f.push(l);
+      const d = { key: s === "actions" ? Number(i) : i, file: a, count: r }, f = e[s][o];
+      f && f.push(d);
     }
     for (const n of Object.values(e))
       for (const r of Object.values(n))
@@ -1584,50 +1584,86 @@ function hs(t) {
 function En(t) {
   return !("fn" in t);
 }
-const W = Object.freeze([]);
+const X = Object.freeze([]);
 function fe(t) {
-  return t === void 0 ? W : Array.isArray(t) ? t : [t];
+  return t === void 0 ? X : Array.isArray(t) ? t : [t];
 }
 class _s {
   labelSystems = /* @__PURE__ */ new Map();
+  // Sorted descriptors for a phase, paired with the `systemLastRun` slot of each
+  // — cached together so `runLabel` resolves both with the one `Map.get` it
+  // already paid, and the per-system lookup inside the loop is array indexing.
   sortedCache = /* @__PURE__ */ new Map();
   systemIndex = /* @__PURE__ */ new Map();
-  systemLastRun = /* @__PURE__ */ new Map();
-  // Only systems carrying a run condition or set membership (#576). The hot
+  // Previous-run tick per scheduled system — a packed array, NOT a `Map` keyed
+  // on the descriptor. `runLabel` reads it and writes it back once per system
+  // per phase. A profile of a dispatch-bound schedule shows that those two `Map`
+  // operations, and not the system bodies, are where most of the phase loop goes
+  // — they hash an object identity twice for each system in each frame.
+  //
+  // Indexed by a SCHEDULE-LOCAL slot, not by `SystemDescriptor.id`. Ids come
+  // from a per-world counter, so two descriptors registered with two different
+  // worlds both get id 0 — scheduling them into a third world would alias them
+  // onto one slot and let the system that runs more often overwrite the other's
+  // last-run tick (silently widening its `changed()` window). Slots are handed
+  // out per Schedule, so identity comes from this schedule's own numbering.
+  systemLastRun = [];
+  // Descriptor → its `systemLastRun` slot. Consulted only by `addSystems` /
+  // `removeSystem`; the run loop never touches it (the slot travels in the
+  // phase plan).
+  //
+  // `removeSystem` MUST delete from this map. It is the only strong reference
+  // the Schedule keeps to a descriptor once its node is gone, and a descriptor
+  // closes over whatever its `fn` captured — leaving the entry behind pins that
+  // for the world's lifetime. (The `Map` this replaced was deleted on remove;
+  // forgetting to do the same here leaked every descriptor ever scheduled.)
+  lastRunSlots = /* @__PURE__ */ new Map();
+  // Slots freed by `removeSystem`, handed back out by `_assignLastRunSlot`.
+  // Without reuse the array would grow by one per `addSystems` call — unbounded
+  // under a workload that toggles systems on and off each frame.
+  freeLastRunSlots = [];
+  // Nesting depth of a drive (`runStartup` / `runUpdate` / `runFixedUpdate`).
+  // Non-zero means a phase plan is live and `runLabel`'s loop may still write
+  // `systemLastRun` through the `slots` array it captured, which is what makes
+  // recycling a freed slot unsafe right now — see `_assignLastRunSlot`.
+  _driveDepth = 0;
+  // Only systems carrying a run condition or set membership. The hot
   // loop skips the per-system gate probe entirely when this is empty, so a
-  // schedule that uses no conditions runs byte-for-byte the pre-#576 path.
+  // schedule that uses no conditions runs byte-for-byte the original path.
   gatedSystems = /* @__PURE__ */ new Map();
   // Live set configuration, read at sort time (ordering) and run time
   // (conditions) so `configureSet` is order-independent w.r.t. `addSystems`.
   setConditions = /* @__PURE__ */ new Map();
   setOrdering = /* @__PURE__ */ new Map();
   nextInsertionOrder = 0;
-  // The opt-in compute backend (#622), or null (the default — pure-TS). When
+  // The opt-in compute backend, or null (the default — pure-TS). When
   // set, a scheduled system carrying a `backendHandle` runs `backend.run(...)`
-  // instead of its `fn`. `null` is the byte-for-byte pre-#622 path: `runLabel`
+  // instead of its `fn`. `null` is the byte-for-byte no-backend path: `runLabel`
   // hoists this to a local and only reads `desc.backendHandle` when non-null,
   // so a no-backend ECS never touches the routing field.
   _backend = null;
   /** Dev-diagnostic sink (`ECSOptions.onWarn`); defaults to `console.warn`.
    * The only schedule diagnostic today is `warnDroppedEdge`. */
   onWarn;
+  /** The `FIXED_UPDATE` node list, held directly for `hasFixedSystems`. */
+  _fixedNodes = [];
   constructor(e) {
     this.onWarn = e ?? ((n) => console.warn(n));
     for (let n = 0; n < le.length; n++)
       this.labelSystems.set(le[n], []);
-    this.labelSystems.set("FIXED_UPDATE", []);
+    this.labelSystems.set("FIXED_UPDATE", this._fixedNodes);
     for (let n = 0; n < ue.length; n++)
       this.labelSystems.set(ue[n], []);
   }
   addSystems(e, ...n) {
     for (const r of n) {
-      const s = "system" in r, o = s ? r.system : r, i = s ? r.ordering : void 0, a = s ? fe(r.runIf) : W, c = s ? fe(r.set) : W;
+      const s = "system" in r, o = s ? r.system : r, i = s ? r.ordering : void 0, a = s ? fe(r.runIf) : X, c = s ? fe(r.set) : X;
       if (this.systemIndex.has(o))
-        throw new y(
-          p.DUPLICATE_SYSTEM,
+        throw new T(
+          y.DUPLICATE_SYSTEM,
           `System ${o.name ?? o.id} is already scheduled`
         );
-      const l = {
+      const d = {
         descriptor: o,
         insertionOrder: this.nextInsertionOrder++,
         before: new Set(i?.before ?? []),
@@ -1635,11 +1671,11 @@ class _s {
         conditions: a,
         sets: c
       };
-      this.labelSystems.get(e).push(l), this.systemIndex.set(o, e), this.systemLastRun.set(o, 0), (a.length > 0 || c.length > 0) && this.gatedSystems.set(o, l), this.sortedCache.delete(e);
+      this.labelSystems.get(e).push(d), this.systemIndex.set(o, e), this._assignLastRunSlot(o), (a.length > 0 || c.length > 0) && this.gatedSystems.set(o, d), this.sortedCache.delete(e);
     }
   }
   /**
-   * Configure a `SystemSet` (#576) — its shared run condition(s) and/or
+   * Configure a `SystemSet` — its shared run condition(s) and/or
    * ordering, inherited by every member. Additive and order-independent w.r.t.
    * `addSystems`: conditions accumulate (ANDed), ordering targets union, and
    * a member added before or after this call picks the configuration up.
@@ -1653,45 +1689,72 @@ class _s {
     if (n.before !== void 0 || n.after !== void 0) {
       let s = this.setOrdering.get(e);
       s === void 0 && (s = { before: /* @__PURE__ */ new Set(), after: /* @__PURE__ */ new Set() }, this.setOrdering.set(e, s));
-      for (const o of n.before ?? W) s.before.add(o);
-      for (const o of n.after ?? W) s.after.add(o);
+      for (const o of n.before ?? X) s.before.add(o);
+      for (const o of n.after ?? X) s.after.add(o);
       this.sortedCache.clear();
     }
   }
   removeSystem(e) {
     const n = this.systemIndex.get(e);
     if (n === void 0) return;
-    const r = this.labelSystems.get(n), s = r.findIndex((o) => o.descriptor === e);
+    const r = this.labelSystems.get(n), s = r.findIndex((i) => i.descriptor === e);
     if (s !== -1) {
-      const o = r.length - 1;
-      s !== o && (r[s] = r[o]), r.pop();
-      for (const i of r)
-        i.before.delete(e), i.after.delete(e);
+      const i = r.length - 1;
+      s !== i && (r[s] = r[i]), r.pop();
+      for (const a of r)
+        a.before.delete(e), a.after.delete(e);
     }
-    this.systemIndex.delete(e), this.systemLastRun.delete(e), this.gatedSystems.delete(e), this.sortedCache.delete(n);
+    this.systemIndex.delete(e);
+    const o = this.lastRunSlots.get(e);
+    o !== void 0 && (this.systemLastRun[o] = 0, this.lastRunSlots.delete(e), this.freeLastRunSlots.push(o)), this.gatedSystems.delete(e), this.sortedCache.clear();
   }
-  /** Attach (or, with `null`, detach) the opt-in compute backend (#622). Driven
+  /** Attach (or, with `null`, detach) the opt-in compute backend. Driven
    * by `ECS.attachBackend`; routes any scheduled system carrying a
    * `backendHandle` to `backend.run(handle)` in place of its `fn`. */
   setBackend(e) {
     this._backend = e;
   }
+  // The three drive entry points each bracket their phases with `_driveDepth`,
+  // so `_assignLastRunSlot` will not recycle a `systemLastRun` slot that a phase
+  // plan captured by `runLabel`'s loop may still write to — see the guard there
+  // for the hazard it closes.
+  //
+  // Held across the WHOLE drive, not per phase: one `try`/`finally` per frame
+  // instead of one per phase (three, for an update). The difference is
+  // measurable on a dispatch-bound schedule, where the system bodies do almost
+  // no work. The wider window is also the more
+  // conservative one, and slots still recycle freely between frames — the only
+  // property `freeLastRunSlots` needs to stay bounded. Written out at each of
+  // the three sites rather than wrapped in a helper taking a callback, which
+  // would put a closure allocation and an indirect call on the per-frame path.
   runStartup(e, n) {
-    for (const r of le)
-      this.runLabel(r, e, dt, n);
+    this._driveDepth++;
+    try {
+      for (const r of le)
+        this.runLabel(r, e, dt, n);
+    } finally {
+      this._driveDepth--;
+    }
   }
   runUpdate(e, n, r) {
-    for (const s of ue)
-      this.runLabel(s, e, n, r);
+    this._driveDepth++;
+    try {
+      for (const s of ue)
+        this.runLabel(s, e, n, r);
+    } finally {
+      this._driveDepth--;
+    }
   }
   runFixedUpdate(e, n, r) {
-    this.runLabel("FIXED_UPDATE", e, n, r);
+    this._driveDepth++;
+    try {
+      this.runLabel("FIXED_UPDATE", e, n, r);
+    } finally {
+      this._driveDepth--;
+    }
   }
   hasFixedSystems() {
-    return this.labelSystems.get(
-      "FIXED_UPDATE"
-      /* FIXED_UPDATE */
-    ).length > 0;
+    return this._fixedNodes.length > 0;
   }
   getAllSystems() {
     const e = [];
@@ -1703,28 +1766,43 @@ class _s {
   hasSystem(e) {
     return this.systemIndex.has(e);
   }
+  /** Hand `descriptor` its `systemLastRun` slot, keeping the array packed (no
+   * holes ⇒ no undefined-check on the read in `runLabel`, which is the whole
+   * point of it not being a `Map`). Idempotent for a descriptor already in this
+   * schedule — `getSorted` re-asks for every system it sorts. A descriptor that
+   * was removed and re-added gets a *fresh* slot starting at tick 0, which is
+   * what the previous `Map`-based bookkeeping did (`delete` on remove, `set(…, 0)`
+   * on re-add). */
+  _assignLastRunSlot(e) {
+    let n = this.lastRunSlots.get(e);
+    if (n === void 0) {
+      const r = this._driveDepth === 0 ? this.freeLastRunSlots.pop() : void 0;
+      r !== void 0 ? (n = r, this.systemLastRun[n] = 0) : (n = this.systemLastRun.length, this.systemLastRun.push(0)), this.lastRunSlots.set(e, n);
+    }
+    return n;
+  }
   clear() {
     for (const e of this.labelSystems.values())
       e.length = 0;
-    this.sortedCache.clear(), this.systemIndex.clear(), this.systemLastRun.clear(), this.gatedSystems.clear(), this.setConditions.clear(), this.setOrdering.clear();
+    this.sortedCache.clear(), this.systemIndex.clear(), this._driveDepth === 0 ? this.systemLastRun.length = 0 : this.systemLastRun.fill(0), this.lastRunSlots.clear(), this.freeLastRunSlots.length = 0, this.gatedSystems.clear(), this.setConditions.clear(), this.setOrdering.clear();
   }
   runLabel(e, n, r, s) {
-    const o = this.getSorted(e), i = this.gatedSystems.size > 0, a = this._backend, c = i ? /* @__PURE__ */ new Map() : void 0;
-    for (let l = 0; l < o.length; l++) {
-      const d = o[l];
-      if (i) {
-        const h = this.gatedSystems.get(d);
-        if (h !== void 0 && !this.shouldRun(h, n, c)) continue;
+    const o = this.getSorted(e), i = o.sorted, a = o.slots, c = this.gatedSystems.size > 0, d = this._backend, l = c ? /* @__PURE__ */ new Map() : void 0;
+    for (let f = 0; f < i.length; f++) {
+      const h = i[f];
+      if (c) {
+        const p = this.gatedSystems.get(h);
+        if (p !== void 0 && !this.shouldRun(p, n, l)) continue;
       }
-      n.lastRunTick = this.systemLastRun.get(d) ?? 0;
-      const f = a !== null ? d.backendHandle : void 0;
-      Q.enter(d), n._trace?.systemStart(d, e);
+      n.lastRunTick = this.systemLastRun[a[f]];
+      const g = d !== null ? h.backendHandle : void 0;
+      Q.enter(h), n._trace?.systemStart(h, e);
       try {
-        f !== void 0 ? a.run(f) : d.fn?.(n, r);
+        g !== void 0 ? d.run(g) : h.fn?.(n, r);
       } finally {
-        n._trace?.systemEnd(d), Q.leave();
+        n._trace?.systemEnd(h), Q.leave();
       }
-      this.systemLastRun.set(d, s);
+      this.systemLastRun[a[f]] = s;
     }
     n._trace?.flushBegin(e), n.flush(), n._trace?.flushEnd(e), n._trace?.phaseBoundary(e);
   }
@@ -1736,7 +1814,7 @@ class _s {
    * memo lives only for a single `runLabel` pass. Short-circuits on the first
    * `false`. The system's own conditions evaluate per system, in canonical order.
    *
-   * #731 SEMANTIC NOTE: this evaluates a set's conditions once-per-set-per-phase
+   * SEMANTIC NOTE: this evaluates a set's conditions once-per-set-per-phase
    * rather than once-per-member. Equivalent for pure RunConditions; observably
    * different only if a set condition reads state mutated earlier in the SAME
    * phase (resources write immediately). That is intentional — the set gates as a
@@ -1776,8 +1854,10 @@ class _s {
   getSorted(e) {
     const n = this.sortedCache.get(e);
     if (n !== void 0) return n;
-    const r = this.labelSystems.get(e), s = this.sortSystems(r, e);
-    return this.sortedCache.set(e, s), s;
+    const r = this.labelSystems.get(e), s = this.sortSystems(r, e), o = new Int32Array(s.length);
+    for (let a = 0; a < s.length; a++) o[a] = this._assignLastRunSlot(s[a]);
+    const i = { sorted: s, slots: o };
+    return this.sortedCache.set(e, i), i;
   }
   /**
    * Delegates to the shared topologicalSort utility.
@@ -1787,31 +1867,31 @@ class _s {
   sortSystems(e, n) {
     if (e.length === 0) return [];
     const r = [], s = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map();
-    for (const d of e) {
-      r.push(d.descriptor), s.set(d.descriptor, d.insertionOrder), o.add(d.descriptor);
-      for (let f = 0; f < d.sets.length; f++) {
-        const h = d.sets[f];
+    for (const l of e) {
+      r.push(l.descriptor), s.set(l.descriptor, l.insertionOrder), o.add(l.descriptor);
+      for (let f = 0; f < l.sets.length; f++) {
+        const h = l.sets[f];
         let g = i.get(h);
-        g === void 0 && (g = [], i.set(h, g)), g.push(d.descriptor);
+        g === void 0 && (g = [], i.set(h, g)), g.push(l.descriptor);
       }
     }
     const a = /* @__PURE__ */ new Map();
-    for (const d of e)
-      a.set(d.descriptor, []);
-    for (const d of e) {
+    for (const l of e)
+      a.set(l.descriptor, []);
+    for (const l of e) {
       this.resolveEdges(
-        d.descriptor,
-        d.before,
+        l.descriptor,
+        l.before,
         "before",
         o,
         i,
         a,
         n
-      ), this.resolveEdges(d.descriptor, d.after, "after", o, i, a, n);
-      for (let f = 0; f < d.sets.length; f++) {
-        const h = this.setOrdering.get(d.sets[f]);
+      ), this.resolveEdges(l.descriptor, l.after, "after", o, i, a, n);
+      for (let f = 0; f < l.sets.length; f++) {
+        const h = this.setOrdering.get(l.sets[f]);
         h !== void 0 && (this.resolveEdges(
-          d.descriptor,
+          l.descriptor,
           h.before,
           "before",
           o,
@@ -1819,7 +1899,7 @@ class _s {
           a,
           n
         ), this.resolveEdges(
-          d.descriptor,
+          l.descriptor,
           h.after,
           "after",
           o,
@@ -1829,18 +1909,18 @@ class _s {
         ));
       }
     }
-    const c = (d, f) => s.get(d) - s.get(f), l = (d) => d.name ?? `system_${d.id}`;
+    const c = (l, f) => s.get(l) - s.get(f), d = (l) => l.name ?? `system_${l.id}`;
     try {
-      return it(r, a, c, l);
-    } catch (d) {
-      throw d instanceof TypeError ? new y(
-        p.CIRCULAR_SYSTEM_DEPENDENCY,
-        `Circular system dependency detected in ${n}: ${d.message}`
-      ) : d;
+      return it(r, a, c, d);
+    } catch (l) {
+      throw l instanceof TypeError ? new T(
+        y.CIRCULAR_SYSTEM_DEPENDENCY,
+        `Circular system dependency detected in ${n}: ${l.message}`
+      ) : l;
     }
   }
   /**
-   * Add the topo edges for one ordering list (#576). For `"before"` the source
+   * Add the topo edges for one ordering list. For `"before"` the source
    * runs before each target (edge source→target); for `"after"` it runs after
    * each target (edge target→source). A `SystemSet` target expands to every
    * member within this phase (self-edges skipped, so a member ordered against
@@ -1851,10 +1931,10 @@ class _s {
   resolveEdges(e, n, r, s, o, i, a) {
     for (const c of n) {
       if (En(c)) {
-        const l = o.get(c);
-        if (l === void 0) continue;
-        for (let d = 0; d < l.length; d++) {
-          const f = l[d];
+        const d = o.get(c);
+        if (d === void 0) continue;
+        for (let l = 0; l < d.length; l++) {
+          const f = d[l];
           f !== e && this.addDirectedEdge(e, f, r, i);
         }
         continue;
@@ -1890,11 +1970,11 @@ class _s {
     );
   }
 }
-const se = 1024, re = 1024 * se, xe = 64 * se, X = 256 * re, Be = 3, pn = 64, yn = 8, Fe = 4 * re, ke = (t) => 2 ** Math.ceil(Math.log2(Math.max(1, t))), Z = (t) => 2 ** Math.floor(Math.log2(Math.max(1, t))), k = (t, e, n) => Math.min(n, Math.max(e, t)), S = (t) => t >= re ? `${(t / re).toFixed(1)} MiB` : t >= se ? `${(t / se).toFixed(0)} KiB` : `${t} B`;
+const se = 1024, re = 1024 * se, xe = 64 * se, W = 256 * re, Be = 3, pn = 64, yn = 8, Fe = 4 * re, ke = (t) => 2 ** Math.ceil(Math.log2(Math.max(1, t))), Z = (t) => 2 ** Math.floor(Math.log2(Math.max(1, t))), k = (t, e, n) => Math.min(n, Math.max(e, t)), S = (t) => t >= re ? `${(t / re).toFixed(1)} MiB` : t >= se ? `${(t / se).toFixed(0)} KiB` : `${t} B`;
 function D(t, e) {
   if (!Number.isInteger(e) || e <= 0)
-    throw new y(
-      p.INVALID_MEMORY_OPTIONS,
+    throw new T(
+      y.INVALID_MEMORY_OPTIONS,
       `memory.${t} must be a positive integer (got ${e})`
     );
 }
@@ -1903,20 +1983,20 @@ function ms(t) {
     (s) => t !== void 0 && t[s] !== void 0
   );
   if (e.length > 1)
-    throw new y(
-      p.INVALID_MEMORY_OPTIONS,
+    throw new T(
+      y.INVALID_MEMORY_OPTIONS,
       `memory takes at most one of budget | maxBytes | wasm | allocator | heap | shared (got: ${e.join(", ")})`
     );
   const n = t?.columnCapacity;
-  if (n !== void 0 && D("column_capacity", n), t?.budget !== void 0) {
+  if (n !== void 0 && D("columnCapacity", n), t?.budget !== void 0) {
     const { entities: s } = t.budget, o = t.budget.archetypes ?? yn, i = t.budget.bytesPerEntity ?? pn;
-    if (D("budget.entities", s), D("budget.archetypes", o), D("budget.bytes_per_entity", i), s > 1 << 20)
-      throw new y(
-        p.INVALID_MEMORY_OPTIONS,
+    if (D("budget.entities", s), D("budget.archetypes", o), D("budget.bytesPerEntity", i), s > 1 << 20)
+      throw new T(
+        y.INVALID_MEMORY_OPTIONS,
         `memory.budget.entities=${s} exceeds the EntityID index space (1<<20 = ${1 << 20})`
       );
-    const a = n ?? k(ke(Math.ceil(s / o)), 64, 1 << 20), c = k(ke(s * 2), 4096, 1 << 20), l = c * R, d = s * i * Be, f = Ke(
-      Math.max(l + d, Fe),
+    const a = n ?? k(ke(Math.ceil(s / o)), 64, 1 << 20), c = k(ke(s * 2), 4096, 1 << 20), d = c * R, l = s * i * Be, f = Ke(
+      Math.max(d + l, Fe),
       xe
     );
     return {
@@ -1928,9 +2008,9 @@ function ms(t) {
       intentLabel: `budget of ${s} entities`,
       budgetEntities: s,
       derivation: [
-        `column_capacity = ${n !== void 0 ? `${a} (pinned)` : `pow2(${s}/${o} per archetype) = ${a}`}`,
-        `entity_index = pow2(2 × ${s}) = ${c} slots × ${R} B = ${S(l)}`,
-        `columns = ${s} × ${i} B × ${Be} (double+holes headroom) = ${S(d)}`,
+        `columnCapacity = ${n !== void 0 ? `${a} (pinned)` : `pow2(${s}/${o} per archetype) = ${a}`}`,
+        `entityIndex = pow2(2 × ${s}) = ${c} slots × ${R} B = ${S(d)}`,
+        `columns = ${s} × ${i} B × ${Be} (double+holes headroom) = ${S(l)}`,
         `cap = align64K(max(index + columns, ${S(Fe)} floor)) = ${S(f)}`
       ],
       wasmMemory: null
@@ -1944,7 +2024,7 @@ function ms(t) {
       U
     );
     return {
-      source: "max_bytes",
+      source: "maxBytes",
       allocator: j(t.maxBytes),
       columnCapacity: s,
       entityIndexCapacity: o,
@@ -1953,8 +2033,8 @@ function ms(t) {
       budgetEntities: null,
       derivation: [
         `cap = ${S(t.maxBytes)} (caller-declared)`,
-        `column_capacity = ${s} (${n !== void 0 ? "pinned" : "default"})`,
-        `entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${o} slots`
+        `columnCapacity = ${s} (${n !== void 0 ? "pinned" : "default"})`,
+        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${o} slots`
       ],
       wasmMemory: null
     };
@@ -1963,9 +2043,9 @@ function ms(t) {
     const s = t.wasm, o = n ?? F;
     if (s.memory !== void 0) {
       if (!(s.memory.buffer instanceof SharedArrayBuffer))
-        throw new y(
-          p.INVALID_MEMORY_OPTIONS,
-          "memory.wasm.memory must be constructed with `shared: true` — the SAB substrate requires a SharedArrayBuffer-backed WebAssembly.Memory (ADR-0004 / ADR-0018)"
+        throw new T(
+          y.INVALID_MEMORY_OPTIONS,
+          "memory.wasm.memory must be constructed with `shared: true` — the SAB substrate requires a SharedArrayBuffer-backed WebAssembly.Memory"
         );
       return {
         source: "wasm",
@@ -1979,23 +2059,23 @@ function ms(t) {
         derivation: [
           "backing = wasm_memory_allocator(memory) — zero-copy with the sim (is_in_place ✓)",
           "cap = the Memory's own `maximum` (declared by the caller; not readable from JS)",
-          `column_capacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
+          `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
         ],
         wasmMemory: s.memory
       };
     }
-    D("wasm.maximum_pages", s.maximumPages);
+    D("wasm.maximumPages", s.maximumPages);
     const i = s.initialPages ?? Math.min(32, s.maximumPages);
-    if (D("wasm.initial_pages", i), i > s.maximumPages)
-      throw new y(
-        p.INVALID_MEMORY_OPTIONS,
-        `memory.wasm.initial_pages (${i}) exceeds maximum_pages (${s.maximumPages})`
+    if (D("wasm.initialPages", i), i > s.maximumPages)
+      throw new T(
+        y.INVALID_MEMORY_OPTIONS,
+        `memory.wasm.initialPages (${i}) exceeds maximumPages (${s.maximumPages})`
       );
     const a = new WebAssembly.Memory({
       initial: i,
       maximum: s.maximumPages,
       shared: !0
-    }), c = s.maximumPages * xe, l = k(
+    }), c = s.maximumPages * xe, d = k(
       Z(c / 4 / R),
       4096,
       U
@@ -2004,27 +2084,27 @@ function ms(t) {
       source: "wasm",
       allocator: Ne(a),
       columnCapacity: o,
-      entityIndexCapacity: l,
+      entityIndexCapacity: d,
       capBytes: c,
       intentLabel: `engine-constructed WebAssembly.Memory (max ${s.maximumPages} pages)`,
       budgetEntities: null,
       derivation: [
         `cap = ${s.maximumPages} pages × 64 KiB = ${S(c)} (Memory maximum)`,
         `initial = ${i} pages (${s.initialPages !== void 0 ? "declared" : "default"})`,
-        `entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${l} slots`,
-        `column_capacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
+        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${d} slots`,
+        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
       ],
       wasmMemory: a
     };
   }
   if (t?.allocator !== void 0) {
     if (t.allocator.isInPlace !== !0)
-      throw new y(
-        p.INVALID_MEMORY_OPTIONS,
-        "memory.allocator must declare `is_in_place: true` (ADR-0008): a live Store's flush loops hoist entity-index views across grows, so a non-in-place allocator (e.g. DEFAULT_SAB_ALLOCATOR) corrupts the entity→row mapping. Use growable_sab_allocator / wasm_memory_allocator; non-in-place allocators are snapshot/test sizing only."
+      throw new T(
+        y.INVALID_MEMORY_OPTIONS,
+        "memory.allocator must declare `isInPlace: true`: a live Store's flush loops hoist entity-index views across grows, so a non-in-place allocator (e.g. DEFAULT_SAB_ALLOCATOR) corrupts the entity→row mapping. Use growableSabAllocator / wasmMemoryAllocator; non-in-place allocators are snapshot/test sizing only."
       );
     const s = n ?? F, o = t.capBytesHint;
-    return o !== void 0 && D("cap_bytes_hint", o), {
+    return o !== void 0 && D("capBytesHint", o), {
       source: "allocator",
       allocator: t.allocator,
       columnCapacity: s,
@@ -2035,14 +2115,14 @@ function ms(t) {
       derivation: [
         "backing = caller allocator (is_in_place ✓ checked at construction)",
         o !== void 0 ? `cap = ${S(o)} (caller hint — diagnostics only; the allocator owns the real cap)` : "cap = allocator-owned (no hint)",
-        `column_capacity = ${s} (${n !== void 0 ? "pinned" : "default"})`
+        `columnCapacity = ${s} (${n !== void 0 ? "pinned" : "default"})`
       ],
       wasmMemory: null
     };
   }
   if (t?.heap !== void 0) {
     t.heap.maxBytes !== void 0 && D("heap.maxBytes", t.heap.maxBytes);
-    const s = t.heap.maxBytes ?? X, o = n ?? F, i = k(
+    const s = t.heap.maxBytes ?? W, o = n ?? F, i = k(
       Z(s / 4 / R),
       4096,
       U
@@ -2056,17 +2136,17 @@ function ms(t) {
       intentLabel: `pure-TS heap backing (${S(s)} growable cap, no SharedArrayBuffer)`,
       budgetEntities: null,
       derivation: [
-        `backing = heap_arraybuffer_allocator(${S(s)}) — resizable ArrayBuffer, no SAB / no COOP+COEP (is_in_place ✓)`,
+        `backing = heap_arraybuffer_allocator(${S(s)}) — fixed ArrayBuffer reserved at the cap, no SAB / no COOP+COEP (is_in_place ✓)`,
         "trade-off: no worker offload / no WASM backend (both need a transferable SharedArrayBuffer)",
-        `column_capacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
-        `entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`
+        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
+        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`
       ],
       wasmMemory: null
     };
   }
   if (t?.shared !== void 0) {
     t.shared.maxBytes !== void 0 && D("shared.maxBytes", t.shared.maxBytes);
-    const s = t.shared.maxBytes ?? X, o = n ?? F, i = k(
+    const s = t.shared.maxBytes ?? W, o = n ?? F, i = k(
       Z(s / 4 / R),
       4096,
       U
@@ -2082,8 +2162,8 @@ function ms(t) {
       derivation: [
         `backing = growable_sab_allocator(${S(s)}) — growable SharedArrayBuffer (is_in_place ✓); needs cross-origin isolation`,
         "enables worker offload + a WASM compute backend (transferable SharedArrayBuffer)",
-        `column_capacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
-        `entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`
+        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
+        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`
       ],
       wasmMemory: null
     };
@@ -2094,13 +2174,13 @@ function ms(t) {
     allocator: j(),
     columnCapacity: r,
     entityIndexCapacity: U,
-    capBytes: X,
-    intentLabel: `default sizing (${S(X)} growable cap)`,
+    capBytes: W,
+    intentLabel: `default sizing (${S(W)} growable cap)`,
     budgetEntities: null,
     derivation: [
-      `cap = ${S(X)} (heap_arraybuffer_allocator default)`,
-      `column_capacity = ${r} (${n !== void 0 ? "pinned" : "DEFAULT_COLUMN_CAPACITY"})`,
-      `entity_index = ${U} slots (full EntityID space, ~12 MiB virtual)`
+      `cap = ${S(W)} (heap_arraybuffer_allocator default)`,
+      `columnCapacity = ${r} (${n !== void 0 ? "pinned" : "DEFAULT_COLUMN_CAPACITY"})`,
+      `entityIndex = ${U} slots (full EntityID space, ~12 MiB virtual)`
     ],
     wasmMemory: null
   };
@@ -2127,9 +2207,9 @@ function he(t, e) {
       return;
     case "set_field":
       if (!t.hasComponent(e.eid, e.def))
-        throw new y(
-          p.COMPONENT_NOT_REGISTERED,
-          `host set_field on entity ${e.eid} targets a component it does not have. If you added that component via a host command this same frame, the add is deferred to the phase flush while set_field is immediate — carry the value in add_component/spawn_entry instead of a separate set_field, or set it next frame. (#681 host write seam)`
+        throw new T(
+          y.COMPONENT_NOT_REGISTERED,
+          `host set_field on entity ${e.eid} targets a component it does not have. If you added that component via a host command this same frame, the add is deferred to the phase flush while set_field is immediate — carry the value in add_component/spawnEntry instead of a separate set_field, or set it next frame. (host write seam)`
         );
       t.setField(e.eid, e.def, e.field, e.value);
       return;
@@ -2190,7 +2270,7 @@ class Tn {
   get pending() {
     return this.queued.length;
   }
-  /** Drop every buffered command without applying it (M15) — e.g. abandoning
+  /** Drop every buffered command without applying it — e.g. abandoning
    * queued edits on a scene unload. Returns how many were dropped. Does not
    * touch commands already drained into the world. */
   clear() {
@@ -2205,7 +2285,7 @@ class Tn {
    * `tap`, when present, is invoked with each command in apply order just before
    * it is applied — the record/replay hook ({@link HostCommandRecorder}). It is
    * an OPT-IN observer: the tap-free path keeps the original tight loop, so an
-   * un-recorded drain pays nothing (#702).
+   * un-recorded drain pays nothing.
    */
   drain(e, n) {
     const r = this.queued.length;
@@ -2224,10 +2304,10 @@ const nt = P - 1;
 function An(t) {
   if (t === ye)
     throw new v(
-      "cannot bind op_code 0 (reserved as the command-ring empty-slot marker)"
+      "cannot bind opCode 0 (reserved as the command-ring empty-slot marker)"
     );
   if (t < 0 || t > 255 || !Number.isInteger(t))
-    throw new v(`command op_code must be a u8 in [1, 255] (got ${t})`);
+    throw new v(`command opCode must be a u8 in [1, 255] (got ${t})`);
 }
 function ae(t) {
   const e = new Uint8Array(nt);
@@ -2265,7 +2345,7 @@ function ps() {
     encode(t) {
       if (t.kind !== "despawn")
         throw new v(
-          `ring_despawn_codec encodes a "despawn" command (got "${t.kind}")`
+          `ringDespawnCodec encodes a "despawn" command (got "${t.kind}")`
         );
       return ae(t.eid);
     },
@@ -2277,7 +2357,7 @@ function ys() {
     encode(t) {
       if (t.kind !== "disable")
         throw new v(
-          `ring_disable_codec encodes a "disable" command (got "${t.kind}")`
+          `ringDisableCodec encodes a "disable" command (got "${t.kind}")`
         );
       return ae(t.eid);
     },
@@ -2289,7 +2369,7 @@ function Ts() {
     encode(t) {
       if (t.kind !== "enable")
         throw new v(
-          `ring_enable_codec encodes an "enable" command (got "${t.kind}")`
+          `ringEnableCodec encodes an "enable" command (got "${t.kind}")`
         );
       return ae(t.eid);
     },
@@ -2314,14 +2394,14 @@ class Is {
   on(e, n) {
     return An(e), this.appliers.set(e, n), this;
   }
-  /** Unbind `opCode` (M15). Returns whether a binding was removed; subsequent
+  /** Unbind `opCode`. Returns whether a binding was removed; subsequent
    * slots carrying it hit the unknown-opcode path. */
   off(e) {
     return this.appliers.delete(e);
   }
   /** Bind a `HostCommand` codec to `opCode`: each matching slot is decoded and
    * run through `applyHostCommand` — the SAME dispatch the typed queue uses.
-   * A drain-time `tap` (record/replay, #702) sees the decoded command before it
+   * A drain-time `tap` (record/replay) sees the decoded command before it
    * applies, so ring-sourced commands share one log with the typed transport. */
   onCommand(e, n) {
     return this.on(e, (r, s, o) => {
@@ -2332,7 +2412,7 @@ class Is {
   /** Drain every pending slot, dispatching each to its bound applier. Unbound
    * opcodes are skipped (the read head still advances — matching
    * `drainCommandRing` / `CommandDispatcher`). Returns slots drained. `tap`,
-   * when present, is forwarded to each applier as the record/replay hook (#702);
+   * when present, is forwarded to each applier as the record/replay hook;
    * only `onCommand`-bound (generic `HostCommand`) opcodes surface to it. */
   drain(e, n, r, s) {
     return Ot(n, r, (o, i) => {
@@ -2357,13 +2437,13 @@ function Ss(t, e) {
   _e.set(n, r);
   const s = e?.name ?? "host_command_apply", o = e?.ring, i = e?.recorder, a = i?.record, c = e?.schedules ?? [x.PRE_STARTUP, x.PRE_UPDATE];
   if (i !== void 0 && c.includes(x.FIXED_UPDATE))
-    throw new y(
-      p.INVALID_RECORDER_SCHEDULE,
+    throw new T(
+      y.INVALID_RECORDER_SCHEDULE,
       "install_host_command_seam: a recorder cannot drain on SCHEDULE.FIXED_UPDATE — it would log the fixed-step dt instead of the host update(dt) and diverge on replay. Use a variable-update phase (PRE_UPDATE/UPDATE/POST_UPDATE)."
     );
-  for (const l of c) {
-    const d = !In.has(l), f = t.registerSystem({
-      name: `${s}:${l}`,
+  for (const d of c) {
+    const l = !In.has(d), f = t.registerSystem({
+      name: `${s}:${d}`,
       // `reads`/`writes` are required by `SystemConfig` but empty here: the
       // apply system declares nothing because it mutates components not known
       // at registration. Full world access: the host may queue mutations to
@@ -2373,13 +2453,13 @@ function Ss(t, e) {
       writes: [],
       exclusive: !0,
       fn: (h, g) => {
-        if (i !== void 0 && d && i.openTick(h.ecsTick, g), n.drain(h, a), o !== void 0) {
-          const A = t.columnStore, u = A.header.commandRingOff;
-          u !== 0 && o.drain(h, A.view, u, a);
+        if (i !== void 0 && l && i.openTick(h.ecsTick, g), n.drain(h, a), o !== void 0) {
+          const p = t.columnStore, u = p.header.commandRingOff;
+          u !== 0 && o.drain(h, p.view, u, a);
         }
       }
     });
-    t.addSystems(l, f), r.push(f);
+    t.addSystems(d, f), r.push(f);
   }
   return n;
 }
@@ -2389,23 +2469,23 @@ export {
   N as B,
   pt as C,
   F as D,
-  y as E,
-  He as F,
+  T as E,
+  Ge as F,
   ie as G,
   te as H,
   $n as I,
   os as J,
   ls as K,
-  T as L,
+  A as L,
   is as M,
   vn as N,
   us as O,
   as as P,
-  Xn as Q,
+  Wn as Q,
   nn as R,
   m as S,
   Oe as T,
-  Cn as U,
+  bn as U,
   ee as V,
   U as W,
   jn as X,
@@ -2418,8 +2498,8 @@ export {
   Un as a2,
   De as a3,
   Re as a4,
-  Ge as a5,
-  Wn as a6,
+  He as a5,
+  Xn as a6,
   Vn as a7,
   rs as a8,
   z as a9,
@@ -2450,8 +2530,8 @@ export {
   Tn as aq,
   gs as ar,
   Me as as,
-  bn as at,
-  X as au,
+  Cn as at,
+  W as au,
   Be as av,
   pn as aw,
   yn as ax,
@@ -2461,19 +2541,19 @@ export {
   ht as c,
   zn as d,
   en as e,
-  p as f,
+  y as f,
   L as g,
   Q as h,
   Rn as i,
   Qt as j,
-  Gn as k,
+  Hn as k,
   cs as l,
   ds as m,
   Yn as n,
   kn as o,
   Bn as p,
   ns as q,
-  Hn as r,
+  Gn as r,
   Ke as s,
   Ae as t,
   On as u,