@oasys/oecs 0.5.2 → 0.5.4

package/dist/{host_commands-BI8pEmjH.js → host_commands-BlR3oZ3x.js}

@@ -1,5 +1,5 @@
 import { S as et, t as tt } from "./topological_sort-DK6EjpWa.js";
-import { D as nt, h as K, w as we, g as st } from "./shared-BU1Cd40h.js";
+import { D as nt, h as K, w as Se, g as st } from "./shared-B4v0L1cw.js";
 class Be extends Error {
   constructor(t, n, r) {
     super(t), this.isOperational = n, this.context = r, this.name = this.constructor.name, Error.captureStackTrace(this, this.constructor);
@@ -23,24 +23,24 @@ function ot(e, t) {
     `Unhandled ${t}: ${String(e)}`
   );
 }
-var w = /* @__PURE__ */ ((e) => (e.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", e.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", e.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", e.COMPONENT_LIMIT_EXCEEDED = "COMPONENT_LIMIT_EXCEEDED", e.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", e.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", e.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", e.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", e.RESOURCE_NOT_REGISTERED = "RESOURCE_NOT_REGISTERED", e.RESOURCE_ALREADY_REGISTERED = "RESOURCE_ALREADY_REGISTERED", e.EVENT_ALREADY_REGISTERED = "EVENT_ALREADY_REGISTERED", e.EVENT_NOT_REGISTERED = "EVENT_NOT_REGISTERED", e.FIELD_NOT_REGISTERED = "FIELD_NOT_REGISTERED", e.RELATION_NOT_REGISTERED = "RELATION_NOT_REGISTERED", e.RELATION_MODE_INVALID = "RELATION_MODE_INVALID", e.RELATION_MODE_MISMATCH = "RELATION_MODE_MISMATCH", e.RELATION_CYCLE = "RELATION_CYCLE", e.SPARSE_CACHE_KEY_OVERFLOW = "SPARSE_CACHE_KEY_OVERFLOW", e.SPARSE_QUERY_DENSE_PATH = "SPARSE_QUERY_DENSE_PATH", e.HIERARCHY_ALREADY_SET = "HIERARCHY_ALREADY_SET", e.HIERARCHY_INVALID_MAX_DEPTH = "HIERARCHY_INVALID_MAX_DEPTH", e.OBSERVER_NON_CONVERGENT = "OBSERVER_NON_CONVERGENT", e.OBSERVER_INVALID_CONFIG = "OBSERVER_INVALID_CONFIG", e.OBSERVER_ONSET_EMIT = "OBSERVER_ONSET_EMIT", e.INVALID_FIXED_TIMESTEP = "INVALID_FIXED_TIMESTEP", e.INVALID_MAX_FIXED_STEPS = "INVALID_MAX_FIXED_STEPS", e.INVALID_RECORDER_SCHEDULE = "INVALID_RECORDER_SCHEDULE", e.EMPTY_ARCHETYPE_MATERIALIZE = "EMPTY_ARCHETYPE_MATERIALIZE", e.COMPONENT_INDEX_INVARIANT = "COMPONENT_INDEX_INVARIANT", e.OPTIONAL_TERM_NOT_DECLARED = "OPTIONAL_TERM_NOT_DECLARED", e.QUERY_ACCESS_UNDECLARED = "QUERY_ACCESS_UNDECLARED", e.ACCESS_UNDECLARED = "ACCESS_UNDECLARED", e.QUERY_NOT_SINGLETON = "QUERY_NOT_SINGLETON", e.INVALID_RUN_CONDITION = "INVALID_RUN_CONDITION", e.SYSTEM_FN_ARITY = "SYSTEM_FN_ARITY", e.PARTITION_APPEND_NEEDS_ENTITY_ROW = "PARTITION_APPEND_NEEDS_ENTITY_ROW", e.PARTITION_BULK_INTO_DISABLED = "PARTITION_BULK_INTO_DISABLED", e.ENTITY_NOT_DISABLED = "ENTITY_NOT_DISABLED", e.STRUCTURAL_DURING_ITERATION = "STRUCTURAL_DURING_ITERATION", e.BACKEND_ALREADY_ATTACHED = "BACKEND_ALREADY_ATTACHED", e.DETERMINISM_DISABLED = "DETERMINISM_DISABLED", e.NON_DETERMINISTIC_COLUMN_TYPE = "NON_DETERMINISTIC_COLUMN_TYPE", e.INVALID_MEMORY_OPTIONS = "INVALID_MEMORY_OPTIONS", e.STORE_CAP_EXCEEDED = "STORE_CAP_EXCEEDED", e.REGION_NOT_DECLARED = "REGION_NOT_DECLARED", e.COMMAND_LOG_TAG_COLLISION = "COMMAND_LOG_TAG_COLLISION", e.INVALID_FRAME_STEP = "INVALID_FRAME_STEP", e))(w || {});
-class S extends Be {
+var S = /* @__PURE__ */ ((e) => (e.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", e.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", e.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", e.COMPONENT_LIMIT_EXCEEDED = "COMPONENT_LIMIT_EXCEEDED", e.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", e.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", e.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", e.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", e.RESOURCE_NOT_REGISTERED = "RESOURCE_NOT_REGISTERED", e.RESOURCE_ALREADY_REGISTERED = "RESOURCE_ALREADY_REGISTERED", e.EVENT_ALREADY_REGISTERED = "EVENT_ALREADY_REGISTERED", e.EVENT_NOT_REGISTERED = "EVENT_NOT_REGISTERED", e.FIELD_NOT_REGISTERED = "FIELD_NOT_REGISTERED", e.RELATION_NOT_REGISTERED = "RELATION_NOT_REGISTERED", e.RELATION_MODE_INVALID = "RELATION_MODE_INVALID", e.RELATION_MODE_MISMATCH = "RELATION_MODE_MISMATCH", e.RELATION_CYCLE = "RELATION_CYCLE", e.SPARSE_CACHE_KEY_OVERFLOW = "SPARSE_CACHE_KEY_OVERFLOW", e.SPARSE_QUERY_DENSE_PATH = "SPARSE_QUERY_DENSE_PATH", e.HIERARCHY_ALREADY_SET = "HIERARCHY_ALREADY_SET", e.HIERARCHY_INVALID_MAX_DEPTH = "HIERARCHY_INVALID_MAX_DEPTH", e.OBSERVER_NON_CONVERGENT = "OBSERVER_NON_CONVERGENT", e.OBSERVER_INVALID_CONFIG = "OBSERVER_INVALID_CONFIG", e.OBSERVER_ONSET_EMIT = "OBSERVER_ONSET_EMIT", e.INVALID_FIXED_TIMESTEP = "INVALID_FIXED_TIMESTEP", e.INVALID_MAX_FIXED_STEPS = "INVALID_MAX_FIXED_STEPS", e.INVALID_RECORDER_SCHEDULE = "INVALID_RECORDER_SCHEDULE", e.EMPTY_ARCHETYPE_MATERIALIZE = "EMPTY_ARCHETYPE_MATERIALIZE", e.COMPONENT_INDEX_INVARIANT = "COMPONENT_INDEX_INVARIANT", e.ARCHETYPE_ROW_INVARIANT = "ARCHETYPE_ROW_INVARIANT", e.OPTIONAL_TERM_NOT_DECLARED = "OPTIONAL_TERM_NOT_DECLARED", e.QUERY_ACCESS_UNDECLARED = "QUERY_ACCESS_UNDECLARED", e.ACCESS_UNDECLARED = "ACCESS_UNDECLARED", e.QUERY_NOT_SINGLETON = "QUERY_NOT_SINGLETON", e.INVALID_RUN_CONDITION = "INVALID_RUN_CONDITION", e.SYSTEM_FN_ARITY = "SYSTEM_FN_ARITY", e.PARTITION_APPEND_NEEDS_ENTITY_ROW = "PARTITION_APPEND_NEEDS_ENTITY_ROW", e.PARTITION_BULK_INTO_DISABLED = "PARTITION_BULK_INTO_DISABLED", e.ENTITY_NOT_DISABLED = "ENTITY_NOT_DISABLED", e.STRUCTURAL_DURING_ITERATION = "STRUCTURAL_DURING_ITERATION", e.BACKEND_ALREADY_ATTACHED = "BACKEND_ALREADY_ATTACHED", e.DETERMINISM_DISABLED = "DETERMINISM_DISABLED", e.NON_DETERMINISTIC_COLUMN_TYPE = "NON_DETERMINISTIC_COLUMN_TYPE", e.INVALID_MEMORY_OPTIONS = "INVALID_MEMORY_OPTIONS", e.STORE_CAP_EXCEEDED = "STORE_CAP_EXCEEDED", e.REGION_NOT_DECLARED = "REGION_NOT_DECLARED", e.COMMAND_LOG_TAG_COLLISION = "COMMAND_LOG_TAG_COLLISION", e.INVALID_FRAME_STEP = "INVALID_FRAME_STEP", e))(S || {});
+class w extends Be {
   constructor(t, n, r) {
     super(n ?? t, !0, r), this.category = t;
   }
 }
 function An(e) {
-  return e instanceof S;
+  return e instanceof w;
 }
-const In = -1, wn = -1, Sn = Object.freeze(/* @__PURE__ */ Object.create(null)), Nn = 2654435769, Dn = 1367130551, B = 1024, Rn = 0, it = 31, On = 1 / 60, bn = 4, at = 0, z = 20, Ye = (1 << z) - 1, P = Ye, ct = it - z, _e = (1 << ct) - 1, Cn = _e, Un = _e - 1, Se = _e << z | P, vn = (e, t) => t << z | e, k = (e) => e & Ye, Ln = (e) => e >> z, he = /* @__PURE__ */ new WeakMap();
+const In = -1, Sn = -1, wn = Object.freeze(/* @__PURE__ */ Object.create(null)), Nn = 2654435769, Dn = 1367130551, B = 1024, Rn = 0, it = 31, On = 1 / 60, bn = 4, at = 0, z = 20, Ye = (1 << z) - 1, $ = Ye, ct = it - z, he = (1 << ct) - 1, Cn = he, Un = he - 1, we = he << z | $, vn = (e, t) => t << z | e, k = (e) => e & Ye, Ln = (e) => e >> z, _e = /* @__PURE__ */ new WeakMap();
 function Mn(e, t) {
-  he.set(e, t);
+  _e.set(e, t);
 }
-function $n(e) {
-  return he.get(e);
+function Pn(e) {
+  return _e.get(e);
 }
 function dt(e) {
-  const t = he.get(e);
+  const t = _e.get(e);
   return t !== void 0 ? `'${t}' (component ${e.id})` : `component ${e.id}`;
 }
 const lt = 827148627, ut = 0, J = 4, ft = 52, m = {
@@ -75,10 +75,10 @@ const lt = 827148627, ut = 0, J = 4, ft = 52, m = {
   column_count: 28,
   enabled_count: 32
 };
-function _t(e, t) {
+function ht(e, t) {
   e.setUint32(m.magic, t.magic, !0), e.setUint32(m.sim_abi_version, t.simAbiVersion, !0), e.setUint32(m.view_stamp, t.viewStamp, !0), e.setUint32(m.capacity, t.capacity, !0), e.setUint32(m.archetype_count, t.archetypeCount, !0), e.setUint32(m.layout_descriptor_off, t.layoutDescriptorOff, !0), e.setUint32(m.command_ring_off, t.commandRingOff, !0), e.setUint32(m.action_ring_off, t.actionRingOff, !0), e.setUint32(m.entity_index_off, t.entityIndexOff, !0), e.setUint32(m.event_ring_off, t.eventRingOff, !0), e.setUint32(m.region_table_off, t.regionTableOff, !0), e.setUint32(m.region_table_count, t.regionTableCount, !0), e.setUint32(m.bindings_off, t.bindingsOff, !0);
 }
-function Pn(e) {
+function $n(e) {
   return {
     magic: e.getUint32(m.magic, !0),
     simAbiVersion: e.getUint32(m.sim_abi_version, !0),
@@ -123,7 +123,7 @@ const E = {
   f32: E.f32,
   f64: E.f64
 };
-function ht(e, t, n) {
+function _t(e, t, n) {
   e.setUint16(t + O.component_id, n.componentId, !0), e.setUint16(t + O.field_id, n.fieldId, !0), e.setUint8(t + O.type_tag, n.typeTag), e.setUint32(t + O.byte_off, n.byteOff, !0), e.setUint16(t + O.stride, n.stride, !0);
 }
 function mt(e, t) {
@@ -150,7 +150,7 @@ function gt(e, t, n) {
   e.setUint32(t + N.row_count, n.rowCount, !0), e.setUint32(t + N.row_capacity, n.rowCapacity, !0), e.setUint32(t + N.column_count, n.columns.length, !0), e.setUint32(t + N.enabled_count, n.enabledCount, !0);
   let r = t + ge;
   for (let s = 0; s < n.columns.length; s++)
-    ht(e, r, n.columns[s]), r += me;
+    _t(e, r, n.columns[s]), r += me;
   return r;
 }
 function Et(e, t) {
@@ -221,21 +221,21 @@ function At(e, t, n) {
 function It(e, t) {
   return e.getUint32(t + b.write_head, !0);
 }
-function wt(e, t) {
+function St(e, t) {
   return e.getUint32(t + b.read_head, !0);
 }
-function St(e, t) {
+function wt(e, t) {
   return e.getUint32(t + b.capacity_slots, !0);
 }
 function Nt(e, t, n) {
   if (n.byteLength !== M - 1)
     throw new U(
-      `out_payload must be ${M - 1} bytes (got ${n.byteLength})`
+      `outPayload must be ${M - 1} bytes (got ${n.byteLength})`
     );
-  const r = It(e, t), s = wt(e, t);
+  const r = It(e, t), s = St(e, t);
   if (r === s) return Ee;
-  const o = St(e, t), i = s & o - 1, c = t + Ve + i * M, a = e.getUint8(c), l = new Uint8Array(e.buffer, c + 1, M - 1);
-  return n.set(l), e.setUint32(t + b.read_head, s + 1 >>> 0, !0), a;
+  const o = wt(e, t), i = s & o - 1, a = t + Ve + i * M, c = e.getUint8(a), l = new Uint8Array(e.buffer, a + 1, M - 1);
+  return n.set(l), e.setUint32(t + b.read_head, s + 1 >>> 0, !0), c;
 }
 function Dt(e, t, n) {
   let r = 0;
@@ -253,8 +253,8 @@ const re = 16, D = 12, ee = {
 }, v = 1 << 20;
 function Re(e) {
   if (e < 0 || !Number.isInteger(e))
-    throw new Ge(
-      `entity_index capacity must be a non-negative integer (got ${e})`
+    throw new He(
+      `entity index capacity must be a non-negative integer (got ${e})`
     );
   return re + e * D;
 }
@@ -267,15 +267,15 @@ function Ot(e, t) {
 function bt(e, t) {
   return e + re + t * 8;
 }
-class Ge extends Error {
+class He extends Error {
   constructor(t) {
     super(t), this.name = "EntityIndexError";
   }
 }
 function Ct(e, t, n) {
   if (n < 0 || !Number.isInteger(n))
-    throw new Ge(
-      `entity_index capacity must be a non-negative integer (got ${n})`
+    throw new He(
+      `entity index capacity must be a non-negative integer (got ${n})`
     );
   e.setUint32(t + ee.length, 0, !0), e.setUint32(t + ee.capacity, n, !0);
 }
@@ -303,14 +303,14 @@ class Mt extends Error {
     super(t), this.name = "EventRingError";
   }
 }
-function $t(e, t, n) {
+function Pt(e, t, n) {
   if (!Lt(n))
     throw new Mt(
       `event ring capacity_slots must be a positive power of two (got ${n})`
     );
   e.setUint32(t + Y.write_head, 0, !0), e.setUint32(t + Y.read_head, 0, !0), e.setUint32(t + Y.capacity_slots, n, !0), e.setUint32(t + Y.overflow_flag, 0, !0);
 }
-const Pt = 16, xt = 16, Gn = 256, V = {
+const $t = 16, xt = 16, Hn = 256, V = {
   write_head: 0,
   read_head: 4,
   capacity_slots: 8,
@@ -320,9 +320,9 @@ function Vt(e, t) {
   return new Int32Array(e.buffer, e.byteOffset + t, 4);
 }
 function be(e) {
-  return Pt + e * xt;
+  return $t + e * xt;
 }
-function Gt(e) {
+function Ht(e) {
   return e > 0 && (e & e - 1) === 0;
 }
 class Ce extends Error {
@@ -330,14 +330,14 @@ class Ce extends Error {
     super(t), this.name = "ActionRingError";
   }
 }
-function Ht(e, t, n) {
-  if (!Gt(n))
+function Gt(e, t, n) {
+  if (!Ht(n))
     throw new Ce(
       `action ring capacity_slots must be a positive power of two (got ${n})`
     );
   if ((e.byteOffset + t) % 4 !== 0)
     throw new Ce(
-      `action ring header must be 4-byte aligned for Atomics (view.byteOffset ${e.byteOffset} + ring_off ${t} is not a multiple of 4)`
+      `action ring header must be 4-byte aligned for Atomics (view.byteOffset ${e.byteOffset} + ringOff ${t} is not a multiple of 4)`
     );
   const r = Vt(e, t);
   Atomics.store(r, Bt, 0), Atomics.store(r, Ft, 0), Atomics.store(r, Yt, n), Atomics.store(r, kt, 0);
@@ -370,7 +370,7 @@ const j = [
     name: "event_ring",
     headerOff: "event_ring_off",
     sizeFromOptions: (e) => e.eventRingCapacitySlots !== void 0 ? Oe(e.eventRingCapacitySlots) : 0,
-    init: (e, t, n) => $t(e, t, n.eventRingCapacitySlots),
+    init: (e, t, n) => Pt(e, t, n.eventRingCapacitySlots),
     regionBytes: (e, t) => Oe(e.getUint32(t + Y.capacity_slots, !0)),
     readOptions: (e, t, n) => {
       n.eventRingCapacitySlots = e.getUint32(
@@ -383,7 +383,7 @@ const j = [
     name: "action_ring",
     headerOff: "action_ring_off",
     sizeFromOptions: (e) => e.actionRingCapacitySlots !== void 0 ? be(e.actionRingCapacitySlots) : 0,
-    init: (e, t, n) => Ht(e, t, n.actionRingCapacitySlots),
+    init: (e, t, n) => Gt(e, t, n.actionRingCapacitySlots),
     regionBytes: (e, t) => be(e.getUint32(t + V.capacity_slots, !0)),
     readOptions: (e, t, n) => {
       n.actionRingCapacitySlots = e.getUint32(
@@ -398,12 +398,12 @@ class Z extends Error {
     super(t), this.name = "RegionRegistryError";
   }
 }
-function He(e) {
+function Ge(e) {
   return e * q;
 }
 function pe(e, t) {
   const n = e.getUint32(m.region_table_count, !0);
-  if (t + He(n) > e.byteLength)
+  if (t + Ge(n) > e.byteLength)
     throw new Z(
       `region table of ${n} entries at byte ${t} overruns the buffer (${e.byteLength} bytes)`
     );
@@ -447,7 +447,7 @@ function qt(e, t, n) {
     r[s] = Xe(e, t + s * q);
   return r;
 }
-function Hn(e) {
+function Gn(e) {
   const t = e.getUint32(m.region_table_off, !0);
   if (t === 0) return [];
   const n = pe(e, t);
@@ -481,7 +481,7 @@ const ye = 2 ** 31;
 class We extends Error {
   constructor(t) {
     super(
-      `SAB column layout offset ${t} reaches or exceeds the 2³¹ (${ye}-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 ${t} reaches or exceeds the 2³¹ (${ye}-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";
   }
 }
@@ -512,41 +512,41 @@ function jt(e, t, n, r) {
 }
 function Qt(e, t, n = 0) {
   const s = yt(
-    e.map((c) => ({
-      archetypeId: c.archetypeId,
-      componentMask: c.componentMask,
+    e.map((a) => ({
+      archetypeId: a.archetypeId,
+      componentMask: a.componentMask,
       rowCount: 0,
       enabledCount: 0,
-      rowCapacity: c.rowCapacity,
-      columns: c.columns.map((a) => ({
-        componentId: a.componentId,
-        fieldId: a.fieldId,
-        typeTag: a.typeTag,
+      rowCapacity: a.rowCapacity,
+      columns: a.columns.map((c) => ({
+        componentId: c.componentId,
+        fieldId: c.fieldId,
+        typeTag: c.typeTag,
         byteOff: 0,
-        stride: Ne[a.typeTag]
+        stride: Ne[c.typeTag]
       }))
     }))
   ) + n;
   let o = t + s;
   const i = new Array(e.length);
-  for (let c = 0; c < e.length; c++) {
-    const a = e[c], l = new Array(a.columns.length);
-    for (let d = 0; d < a.columns.length; d++) {
-      const f = a.columns[d], _ = Ne[f.typeTag];
-      o = ze(o, _), l[d] = {
+  for (let a = 0; a < e.length; a++) {
+    const c = e[a], l = new Array(c.columns.length);
+    for (let d = 0; d < c.columns.length; d++) {
+      const f = c.columns[d], h = Ne[f.typeTag];
+      o = ze(o, h), l[d] = {
         componentId: f.componentId,
         fieldId: f.fieldId,
         typeTag: f.typeTag,
         byteOff: o,
-        stride: _
-      }, o += _ * a.rowCapacity;
+        stride: h
+      }, o += h * c.rowCapacity;
     }
-    i[c] = {
-      archetypeId: a.archetypeId,
-      componentMask: a.componentMask,
+    i[a] = {
+      archetypeId: c.archetypeId,
+      componentMask: c.componentMask,
       rowCount: 0,
       enabledCount: 0,
-      rowCapacity: a.rowCapacity,
+      rowCapacity: c.rowCapacity,
       columns: l
     };
   }
@@ -562,25 +562,25 @@ function qn(e, t = nt, n = {}) {
   const r = {};
   let s = ft;
   for (let A = 0; A < j.length; A++) {
-    const C = j[A], H = C.sizeFromOptions(n);
-    r[C.headerOff] = H === 0 ? 0 : s, s += H;
+    const C = j[A], G = C.sizeFromOptions(n);
+    r[C.headerOff] = G === 0 ? 0 : s, s += G;
   }
   const o = n.regions ?? [];
   Xt(o);
-  const i = o.length, c = i > 0 ? s : 0;
-  s += He(i);
-  const a = new Array(i);
+  const i = o.length, a = i > 0 ? s : 0;
+  s += Ge(i);
+  const c = new Array(i);
   for (let A = 0; A < o.length; A++) {
     const C = o[A];
-    a[A] = { regionId: C.id, byteOffset: s, byteLength: C.bytes }, s += C.bytes;
+    c[A] = { regionId: C.id, byteOffset: s, byteLength: C.bytes }, s += C.bytes;
   }
   const l = n.bindingsRegionBytes ?? 0, d = l === 0 ? 0 : s;
   s += l;
-  const f = s, { descriptors: _, totalBytes: g, regionBytes: y } = Qt(
+  const f = s, { descriptors: h, totalBytes: g, regionBytes: p } = Qt(
     e,
     f,
     n.reservedDescriptorBytes ?? 0
-  ), u = t(g), h = new DataView(u), T = {
+  ), u = t(g), _ = new DataView(u), T = {
     magic: lt,
     simAbiVersion: ut,
     viewStamp: 0,
@@ -588,7 +588,7 @@ function qn(e, t = nt, n = {}) {
     archetypeCount: e.length,
     layoutDescriptorOff: f,
     bindingsOff: d,
-    regionTableOff: c,
+    regionTableOff: a,
     regionTableCount: i,
     // `regionOffsets` stays keyed by the snake ABI field names (it also indexes
     // `STORE_HEADER_OFFSETS`); map its 4 entries onto the camelCase header fields.
@@ -597,25 +597,25 @@ function qn(e, t = nt, n = {}) {
     eventRingOff: r.event_ring_off,
     actionRingOff: r.action_ring_off
   };
-  _t(h, T), l > 0 && new Uint8Array(u, d, l).fill(0);
+  ht(_, T), l > 0 && new Uint8Array(u, d, l).fill(0);
   for (let A = 0; A < j.length; A++) {
-    const C = j[A], H = r[C.headerOff];
-    H !== 0 && C.init(h, H, n);
+    const C = j[A], G = r[C.headerOff];
+    G !== 0 && C.init(_, G, n);
   }
-  c !== 0 && zt(h, c, a);
+  a !== 0 && zt(_, a, c);
   for (let A = 0; A < o.length; A++)
-    o[A].init(h, a[A].byteOffset);
-  pt(h, f, _);
-  const x = Zt(u, _);
+    o[A].init(_, c[A].byteOffset);
+  pt(_, f, h);
+  const x = Zt(u, h);
   return {
     buffer: u,
-    view: h,
+    view: _,
     header: T,
     archetypes: x,
-    _regionBytes: y,
+    _regionBytes: p,
     _allocator: t,
     // 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
   };
 }
@@ -623,16 +623,16 @@ function Zt(e, t) {
   const n = /* @__PURE__ */ new Map();
   for (let r = 0; r < t.length; r++) {
     const s = t[r], o = new Array(s.columns.length), i = /* @__PURE__ */ new Map();
-    for (let c = 0; c < s.columns.length; c++) {
-      const a = s.columns[c], l = {
-        componentId: a.componentId,
-        fieldId: a.fieldId,
-        typeTag: a.typeTag,
-        byteOff: a.byteOff,
-        stride: a.stride,
-        view: jt(e, a.typeTag, a.byteOff, s.rowCapacity)
+    for (let a = 0; a < s.columns.length; a++) {
+      const c = s.columns[a], l = {
+        componentId: c.componentId,
+        fieldId: c.fieldId,
+        typeTag: c.typeTag,
+        byteOff: c.byteOff,
+        stride: c.stride,
+        view: jt(e, c.typeTag, c.byteOff, s.rowCapacity)
       };
-      o[c] = l, i.set(Kt(a.componentId, a.fieldId), l);
+      o[a] = l, i.set(Kt(c.componentId, c.fieldId), l);
     }
     n.set(s.archetypeId, {
       archetypeId: s.archetypeId,
@@ -669,13 +669,13 @@ class jn {
   }
   /** 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;
@@ -729,12 +729,12 @@ class jn {
     return s === void 0 ? !1 : (s[n] = r, !0);
   }
 }
-class p extends Error {
+class y extends Error {
   constructor(t) {
     super(t), this.name = "SparseRestoreError";
   }
 }
-const Te = 12, Ae = 4, G = 8;
+const Te = 12, Ae = 4, H = 8;
 function Ie(e, t) {
   let n = Jt;
   const r = (s) => {
@@ -747,21 +747,21 @@ function Ie(e, t) {
 function Qn(e) {
   let t = 4;
   for (let o = 0; o < e.length; o++) {
-    const i = e[o], c = i.fieldNames.length;
-    t += Te + i.size * (Ae + c * G);
+    const i = e[o], a = i.fieldNames.length;
+    t += Te + i.size * (Ae + a * H);
   }
   const n = new Uint8Array(t), r = new DataView(n.buffer);
   let s = 0;
   r.setUint32(s, e.length, !0), s += 4;
   for (let o = 0; o < e.length; o++) {
-    const i = e[o], c = i.fieldNames.length, a = i.canonicalIndices();
-    r.setUint32(s, c, !0), s += 4, r.setUint32(s, Ie(i.fieldNames, i.fieldTypes), !0), s += 4, r.setUint32(s, a.length, !0), s += 4;
-    for (let l = 0; l < a.length; l++) {
-      const d = a[l];
+    const i = e[o], a = i.fieldNames.length, c = i.canonicalIndices();
+    r.setUint32(s, a, !0), s += 4, r.setUint32(s, Ie(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 _ = 0; _ < c; _++)
-        r.setFloat64(s, f[_], !0), s += G;
+      for (let h = 0; h < a; h++)
+        r.setFloat64(s, f[h], !0), s += H;
     }
   }
   return n;
@@ -769,98 +769,98 @@ function Qn(e) {
 function Zn(e, t) {
   const n = new DataView(t.buffer, t.byteOffset, t.byteLength), r = t.byteLength;
   let s = 0;
-  const o = (c) => {
-    if (s + c > r)
-      throw new p(
-        `sparse snapshot truncated: need ${c} more bytes at offset ${s}, have ${r - s}`
+  const o = (a) => {
+    if (s + a > r)
+      throw new y(
+        `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 !== e.length)
-    throw new p(
+    throw new y(
       `sparse store count mismatch: snapshot=${i}, registered=${e.length}`
     );
-  for (let c = 0; c < e.length; c++) {
-    const a = e[c];
+  for (let a = 0; a < e.length; a++) {
+    const c = e[a];
     o(Te);
     const l = n.getUint32(s, !0);
     s += 4;
     const d = n.getUint32(s, !0);
     s += 4;
     const f = n.getUint32(s, !0);
-    if (s += 4, l !== a.fieldNames.length)
-      throw new p(
-        `sparse store ${c} field-count mismatch: snapshot=${l}, registered=${a.fieldNames.length}`
+    if (s += 4, l !== c.fieldNames.length)
+      throw new y(
+        `sparse store ${a} field-count mismatch: snapshot=${l}, registered=${c.fieldNames.length}`
       );
-    const _ = Ie(a.fieldNames, a.fieldTypes);
-    if (d !== _)
-      throw new p(
-        `sparse store ${c} schema identity mismatch: snapshot hash=${d}, registered=${_} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
+    const h = Ie(c.fieldNames, c.fieldTypes);
+    if (d !== h)
+      throw new y(
+        `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)`
       );
-    a.clear();
+    c.clear();
     for (let g = 0; g < f; g++) {
-      o(Ae + l * G);
-      const y = n.getUint32(s, !0);
-      if (s += 4, y > P)
-        throw new p(
-          `sparse store ${c} member ${g} entity index ${y} exceeds MAX_INDEX (${P})`
+      o(Ae + l * H);
+      const p = n.getUint32(s, !0);
+      if (s += 4, p > $)
+        throw new y(
+          `sparse store ${a} member ${g} entity index ${p} exceeds MAX_INDEX (${$})`
         );
       const u = new Array(l);
-      for (let h = 0; h < l; h++)
-        u[h] = n.getFloat64(s, !0), s += G;
-      a.setRawRow(y, u);
+      for (let _ = 0; _ < l; _++)
+        u[_] = n.getFloat64(s, !0), s += H;
+      c.setRawRow(p, u);
     }
   }
   if (s !== r)
-    throw new p(
+    throw new y(
       `sparse snapshot has ${r - s} trailing bytes after the last store (not a canonical encoding)`
     );
 }
 function Jn(e, t) {
   const n = new DataView(t.buffer, t.byteOffset, t.byteLength), r = t.byteLength;
   let s = 0;
-  const o = (c) => {
-    if (s + c > r)
-      throw new p(
-        `sparse snapshot truncated: need ${c} more bytes at offset ${s}, have ${r - s}`
+  const o = (a) => {
+    if (s + a > r)
+      throw new y(
+        `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 !== e.length)
-    throw new p(
+    throw new y(
       `sparse store count mismatch: snapshot=${i}, registered=${e.length}`
     );
-  for (let c = 0; c < e.length; c++) {
-    const a = e[c];
+  for (let a = 0; a < e.length; a++) {
+    const c = e[a];
     o(Te);
     const l = n.getUint32(s, !0);
     s += 4;
     const d = n.getUint32(s, !0);
     s += 4;
     const f = n.getUint32(s, !0);
-    if (s += 4, l !== a.fieldNames.length)
-      throw new p(
-        `sparse store ${c} field-count mismatch: snapshot=${l}, registered=${a.fieldNames.length}`
+    if (s += 4, l !== c.fieldNames.length)
+      throw new y(
+        `sparse store ${a} field-count mismatch: snapshot=${l}, registered=${c.fieldNames.length}`
       );
-    const _ = Ie(a.fieldNames, a.fieldTypes);
-    if (d !== _)
-      throw new p(
-        `sparse store ${c} schema identity mismatch: snapshot hash=${d}, registered=${_} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
+    const h = Ie(c.fieldNames, c.fieldTypes);
+    if (d !== h)
+      throw new y(
+        `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)`
       );
     for (let g = 0; g < f; g++) {
-      o(Ae + l * G);
-      const y = n.getUint32(s, !0);
-      if (s += 4, y > P)
-        throw new p(
-          `sparse store ${c} member ${g} entity index ${y} exceeds MAX_INDEX (${P})`
+      o(Ae + l * H);
+      const p = n.getUint32(s, !0);
+      if (s += 4, p > $)
+        throw new y(
+          `sparse store ${a} member ${g} entity index ${p} exceeds MAX_INDEX (${$})`
         );
-      s += l * G;
+      s += l * H;
     }
   }
   if (s !== r)
-    throw new p(
+    throw new y(
       `sparse snapshot has ${r - s} trailing bytes after the last store (not a canonical encoding)`
     );
 }
@@ -875,12 +875,12 @@ class Ke {
    * 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.
@@ -903,7 +903,7 @@ class Ke {
     r !== void 0 && (r.delete(n), r.size === 0 && this._reverse.delete(t));
   }
   /** 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
@@ -999,7 +999,7 @@ class nn extends Ke {
     }
   }
   restoreAddTarget() {
-    throw new p(
+    throw new y(
       "exclusive relation has no multi forward sources to restore (snapshot header should have guarded this)"
     );
   }
@@ -1077,26 +1077,26 @@ function ns(e) {
   let n = 4;
   for (let i = 0; i < e.length; i++) {
     n += je;
-    const c = e[i];
-    if (c.exclusive) {
+    const a = e[i];
+    if (a.exclusive) {
       t[i] = null;
       continue;
     }
-    const a = [];
-    c.forEachCanonicalTargetSet((l, d) => a.push([l, d])), t[i] = a, n += Qe;
-    for (let l = 0; l < a.length; l++)
-      n += Ze + a[l][1].length * te;
+    const c = [];
+    a.forEachCanonicalTargetSet((l, d) => c.push([l, d])), t[i] = c, n += Qe;
+    for (let l = 0; l < c.length; l++)
+      n += Ze + c[l][1].length * te;
   }
   const r = new Uint8Array(n), s = new DataView(r.buffer);
   let o = 0;
   s.setUint32(o, e.length, !0), o += 4;
   for (let i = 0; i < e.length; i++) {
     s.setUint32(o, e[i].exclusive ? 0 : 1, !0), o += 4;
-    const c = t[i];
-    if (c !== null) {
-      s.setUint32(o, c.length, !0), o += 4;
-      for (let a = 0; a < c.length; a++) {
-        const l = c[a][0], d = c[a][1];
+    const a = t[i];
+    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 += te;
@@ -1108,109 +1108,109 @@ function ns(e) {
 function ss(e, t, n) {
   const r = new DataView(t.buffer, t.byteOffset, t.byteLength), s = t.byteLength;
   let o = 0;
-  const i = (a) => {
-    if (o + a > s)
-      throw new p(
-        `relation snapshot truncated: need ${a} more bytes at offset ${o}, have ${s - o}`
+  const i = (c) => {
+    if (o + c > s)
+      throw new y(
+        `relation snapshot truncated: need ${c} more bytes at offset ${o}, have ${s - o}`
       );
   };
-  for (let a = 0; a < e.length; a++) e[a].resetIndices();
+  for (let c = 0; c < e.length; c++) e[c].resetIndices();
   i(4);
-  const c = r.getUint32(o, !0);
-  if (o += 4, c !== e.length)
-    throw new p(
-      `relation count mismatch: snapshot=${c}, registered=${e.length}`
+  const a = r.getUint32(o, !0);
+  if (o += 4, a !== e.length)
+    throw new y(
+      `relation count mismatch: snapshot=${a}, registered=${e.length}`
     );
-  for (let a = 0; a < e.length; a++) {
-    const l = e[a];
+  for (let c = 0; c < e.length; c++) {
+    const l = e[c];
     i(je);
     const d = r.getUint32(o, !0);
     if (o += 4, d === 1 === l.exclusive)
-      throw new p(
-        `relation ${a} cardinality mismatch: snapshot ${d ? "multi" : "exclusive"}, registered ${l.exclusive ? "exclusive" : "multi"}`
+      throw new y(
+        `relation ${c} cardinality mismatch: snapshot ${d ? "multi" : "exclusive"}, registered ${l.exclusive ? "exclusive" : "multi"}`
       );
     if (l.exclusive) continue;
     i(Qe);
     const f = r.getUint32(o, !0);
     o += 4;
-    for (let _ = 0; _ < f; _++) {
+    for (let h = 0; h < f; h++) {
       i(Ze);
       const g = r.getUint32(o, !0);
       o += 4;
-      const y = r.getUint32(o, !0);
-      if (o += 4, g > P)
-        throw new p(
-          `relation ${a} source index ${g} exceeds MAX_INDEX (${P})`
+      const p = r.getUint32(o, !0);
+      if (o += 4, g > $)
+        throw new y(
+          `relation ${c} source index ${g} exceeds MAX_INDEX (${$})`
         );
-      i(y * te);
+      i(p * te);
       const u = n(g);
-      for (let h = 0; h < y; h++) {
+      for (let _ = 0; _ < p; _++) {
         const T = r.getFloat64(o, !0);
         o += te;
         const x = T;
-        if (!Number.isInteger(x) || x < 0 || x > Se)
-          throw new p(
-            `relation ${a} target ${x} is not a well-formed packed EntityID (expected an integer in [0, ${Se}])`
+        if (!Number.isInteger(x) || x < 0 || x > we)
+          throw new y(
+            `relation ${c} target ${x} is not a well-formed packed EntityID (expected an integer in [0, ${we}])`
           );
         l.restoreAddTarget(g, T, u);
       }
     }
   }
   if (o !== s)
-    throw new p(
+    throw new y(
       `relation snapshot has ${s - o} trailing bytes after the last relation (not a canonical encoding)`
     );
 }
 const ve = /* @__PURE__ */ new WeakMap();
 function rn(e) {
-  const t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set();
+  const t = /* @__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();
   for (let u = 0; u < e.writes.length; u++) {
-    const h = e.writes[u].id;
-    n.add(h), t.add(h), r.add(h);
+    const _ = e.writes[u].id;
+    n.add(_), t.add(_), r.add(_);
   }
   for (let u = 0; u < e.reads.length; u++)
     t.add(e.reads[u].id);
   for (let u = 0; u < e.spawns.length; u++) {
-    const h = e.spawns[u];
-    for (let T = 0; T < h.length; T++)
-      r.add(h[T].id);
+    const _ = e.spawns[u];
+    for (let T = 0; T < _.length; T++)
+      r.add(_[T].id);
   }
   for (let u = 0; u < e.transitions.length; u++) {
-    const h = e.transitions[u];
-    if (h.add)
-      for (let T = 0; T < h.add.length; T++)
-        r.add(h.add[T].id);
-    if (h.remove)
-      for (let T = 0; T < h.remove.length; T++)
-        s.add(h.remove[T].id);
+    const _ = e.transitions[u];
+    if (_.add)
+      for (let T = 0; T < _.add.length; T++)
+        r.add(_.add[T].id);
+    if (_.remove)
+      for (let T = 0; T < _.remove.length; T++)
+        s.add(_.remove[T].id);
   }
   for (let u = 0; u < e.despawns.length; u++)
     s.add(e.despawns[u].id);
   for (let u = 0; u < e.resourceReads.length; u++)
     o.add(e.resourceReads[u]);
   for (let u = 0; u < e.resourceWrites.length; u++) {
-    const h = e.resourceWrites[u];
-    i.add(h), o.add(h);
+    const _ = e.resourceWrites[u];
+    i.add(_), o.add(_);
   }
   const f = e.sparseWrites;
   if (f !== void 0)
     for (let u = 0; u < f.length; u++) {
-      const h = f[u];
-      a.add(h), c.add(h);
+      const _ = f[u];
+      c.add(_), a.add(_);
     }
-  const _ = e.sparseReads;
-  if (_ !== void 0)
-    for (let u = 0; u < _.length; u++) c.add(_[u]);
+  const h = e.sparseReads;
+  if (h !== void 0)
+    for (let u = 0; u < h.length; u++) a.add(h[u]);
   const g = e.relationWrites;
   if (g !== void 0)
     for (let u = 0; u < g.length; u++) {
-      const h = g[u];
-      d.add(h), l.add(h);
+      const _ = g[u];
+      d.add(_), l.add(_);
     }
-  const y = e.relationReads;
-  if (y !== void 0)
-    for (let u = 0; u < y.length; u++)
-      l.add(y[u]);
+  const p = e.relationReads;
+  if (p !== void 0)
+    for (let u = 0; u < p.length; u++)
+      l.add(p[u]);
   return {
     reads: t,
     writes: n,
@@ -1219,8 +1219,8 @@ function rn(e) {
     hasDespawns: e.despawns.length > 0,
     resourceReads: o,
     resourceWrites: i,
-    sparseReads: c,
-    sparseWrites: a,
+    sparseReads: a,
+    sparseWrites: c,
     relationReads: l,
     relationWrites: d
   };
@@ -1263,17 +1263,17 @@ class dn {
   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(t) {
     this.active = t, this.activeName = t.name ?? `system_${t.id}`, this.exclusive = t.exclusive === !0, this.sets = this.exclusive ? null : on(t);
   }
-  /** 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()`. */
@@ -1305,8 +1305,8 @@ class dn {
   checkDestroy() {
     if (this.sets === null || this.sets.hasDespawns) return;
     const t = this.activeName;
-    throw new S(
-      w.ACCESS_UNDECLARED,
+    throw new w(
+      S.ACCESS_UNDECLARED,
       `system '${t}' called despawn but didn't declare any despawns — declare the components this system removes via despawn in its 'despawns'`,
       { system: t, op: "despawn" }
     );
@@ -1321,7 +1321,7 @@ class dn {
     const n = t;
     this.sets.resourceWrites.has(n) || this.failResource("write", t, "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 /
@@ -1346,7 +1346,7 @@ class dn {
     const n = t;
     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
@@ -1358,7 +1358,7 @@ class dn {
       "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
@@ -1372,7 +1372,7 @@ class dn {
   // `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
@@ -1391,46 +1391,46 @@ class dn {
     const r = this.optionalScopes[n - 1], s = t.id;
     for (let o = 0; o < r.length; o++)
       if (r[o] === s) return;
-    throw new S(
-      w.OPTIONAL_TERM_NOT_DECLARED,
+    throw new w(
+      S.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(t, n, r) {
     const s = this.activeName, o = dt(n);
-    throw new S(
-      w.ACCESS_UNDECLARED,
+    throw new w(
+      S.ACCESS_UNDECLARED,
       `system '${s}' performed ${t} on ${o} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
       { system: s, op: t, component: n.id }
     );
   }
   failSparse(t, n, r) {
     const s = this.activeName;
-    throw new S(
-      w.ACCESS_UNDECLARED,
+    throw new w(
+      S.ACCESS_UNDECLARED,
       `system '${s}' performed ${t} on sparse component ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
       { system: s, op: t, sparse: n }
     );
   }
   failRelation(t, n, r) {
     const s = this.activeName;
-    throw new S(
-      w.ACCESS_UNDECLARED,
+    throw new w(
+      S.ACCESS_UNDECLARED,
       `system '${s}' performed ${t} on relation ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
       { system: s, op: t, relation: n }
     );
   }
   failResource(t, n, r) {
     const s = this.activeName, o = n.description ?? "<unnamed>";
-    throw new S(
-      w.ACCESS_UNDECLARED,
+    throw new w(
+      S.ACCESS_UNDECLARED,
       `system '${s}' performed resource ${t} on '${o}' but didn't declare it — add the resource key to '${r}' (see docs/api/systems.md)`,
       { system: s, op: t, resource: o }
     );
   }
 }
 const rs = new dn();
-var $ = /* @__PURE__ */ ((e) => (e.PRE_STARTUP = "PRE_STARTUP", e.STARTUP = "STARTUP", e.POST_STARTUP = "POST_STARTUP", e.FIXED_UPDATE = "FIXED_UPDATE", e.PRE_UPDATE = "PRE_UPDATE", e.UPDATE = "UPDATE", e.POST_UPDATE = "POST_UPDATE", e))($ || {});
+var P = /* @__PURE__ */ ((e) => (e.PRE_STARTUP = "PRE_STARTUP", e.STARTUP = "STARTUP", e.POST_STARTUP = "POST_STARTUP", e.FIXED_UPDATE = "FIXED_UPDATE", e.PRE_UPDATE = "PRE_UPDATE", e.UPDATE = "UPDATE", e.POST_UPDATE = "POST_UPDATE", e))(P || {});
 const ce = [
   "PRE_STARTUP",
   "STARTUP",
@@ -1454,50 +1454,86 @@ function le(e) {
 }
 class is {
   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(t) {
     this.onWarn = t ?? ((n) => console.warn(n));
     for (let n = 0; n < ce.length; n++)
       this.labelSystems.set(ce[n], []);
-    this.labelSystems.set("FIXED_UPDATE", []);
+    this.labelSystems.set("FIXED_UPDATE", this._fixedNodes);
     for (let n = 0; n < de.length; n++)
       this.labelSystems.set(de[n], []);
   }
   addSystems(t, ...n) {
     for (const r of n) {
-      const s = "system" in r, o = s ? r.system : r, i = s ? r.ordering : void 0, c = s ? le(r.runIf) : W, a = s ? le(r.set) : W, l = {
+      const s = "system" in r, o = s ? r.system : r, i = s ? r.ordering : void 0, a = s ? le(r.runIf) : W, c = s ? le(r.set) : W, l = {
         descriptor: o,
         insertionOrder: this.nextInsertionOrder++,
         before: new Set(i?.before ?? []),
         after: new Set(i?.after ?? []),
-        conditions: c,
-        sets: a
+        conditions: a,
+        sets: c
       };
-      this.labelSystems.get(t).push(l), this.systemIndex.set(o, t), this.systemLastRun.set(o, 0), (c.length > 0 || a.length > 0) && this.gatedSystems.set(o, l), this.sortedCache.delete(t);
+      this.labelSystems.get(t).push(l), this.systemIndex.set(o, t), this._assignLastRunSlot(o), (a.length > 0 || c.length > 0) && this.gatedSystems.set(o, l), this.sortedCache.delete(t);
     }
   }
   /**
-   * 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.
@@ -1519,37 +1555,64 @@ class is {
   removeSystem(t) {
     const n = this.systemIndex.get(t);
     if (n === void 0) return;
-    const r = this.labelSystems.get(n), s = r.findIndex((o) => o.descriptor === t);
+    const r = this.labelSystems.get(n), s = r.findIndex((i) => i.descriptor === t);
     if (s !== -1) {
-      const o = r.length - 1;
-      s !== o && (r[s] = r[o]), r.pop();
-      for (const i of r)
-        i.before.delete(t), i.after.delete(t);
+      const i = r.length - 1;
+      s !== i && (r[s] = r[i]), r.pop();
+      for (const a of r)
+        a.before.delete(t), a.after.delete(t);
     }
-    this.systemIndex.delete(t), this.systemLastRun.delete(t), this.gatedSystems.delete(t), this.sortedCache.delete(n);
+    this.systemIndex.delete(t);
+    const o = this.lastRunSlots.get(t);
+    o !== void 0 && (this.systemLastRun[o] = 0, this.lastRunSlots.delete(t), this.freeLastRunSlots.push(o)), this.gatedSystems.delete(t), 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(t) {
     this._backend = t;
   }
+  // 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(t, n) {
-    for (const r of ce)
-      this.runLabel(r, t, at, n);
+    this._driveDepth++;
+    try {
+      for (const r of ce)
+        this.runLabel(r, t, at, n);
+    } finally {
+      this._driveDepth--;
+    }
   }
   runUpdate(t, n, r) {
-    for (const s of de)
-      this.runLabel(s, t, n, r);
+    this._driveDepth++;
+    try {
+      for (const s of de)
+        this.runLabel(s, t, n, r);
+    } finally {
+      this._driveDepth--;
+    }
   }
   runFixedUpdate(t, n, r) {
-    this.runLabel("FIXED_UPDATE", t, n, r);
+    this._driveDepth++;
+    try {
+      this.runLabel("FIXED_UPDATE", t, n, r);
+    } finally {
+      this._driveDepth--;
+    }
   }
   hasFixedSystems() {
-    return this.labelSystems.get(
-      "FIXED_UPDATE"
-      /* FIXED_UPDATE */
-    ).length > 0;
+    return this._fixedNodes.length > 0;
   }
   getAllSystems() {
     const t = [];
@@ -1561,26 +1624,41 @@ class is {
   hasSystem(t) {
     return this.systemIndex.has(t);
   }
+  /** 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(t) {
+    let n = this.lastRunSlots.get(t);
+    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(t, n);
+    }
+    return n;
+  }
   clear() {
     for (const t of this.labelSystems.values())
       t.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(t, n, r, s) {
-    const o = this.getSorted(t), i = this.gatedSystems.size > 0, c = this._backend, a = i ? /* @__PURE__ */ new Map() : void 0;
-    for (let l = 0; l < o.length; l++) {
-      const d = o[l];
-      if (i) {
-        const _ = this.gatedSystems.get(d);
-        if (_ !== void 0 && !this.shouldRun(_, n, a)) continue;
+    const o = this.getSorted(t), i = o.sorted, a = o.slots, c = this.gatedSystems.size > 0, l = this._backend, d = 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, d)) continue;
       }
-      n.lastRunTick = this.systemLastRun.get(d) ?? 0;
-      const f = c !== null ? d.backendHandle : void 0;
+      n.lastRunTick = this.systemLastRun[a[f]];
+      const g = l !== null ? h.backendHandle : void 0;
       try {
-        f !== void 0 ? c.run(f) : d.fn?.(n, r);
+        g !== void 0 ? l.run(g) : h.fn?.(n, r);
       } finally {
       }
-      this.systemLastRun.set(d, s);
+      this.systemLastRun[a[f]] = s;
     }
     n.flush();
   }
@@ -1592,7 +1670,7 @@ class is {
    * 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
@@ -1605,8 +1683,8 @@ class is {
       const o = t.sets[s];
       let i = r.get(o);
       if (i === void 0) {
-        const c = this.setConditions.get(o);
-        i = c === void 0 || c.length === 0 ? !0 : this.evalConditions(c, n), r.set(o, i);
+        const a = this.setConditions.get(o);
+        i = a === void 0 || a.length === 0 ? !0 : this.evalConditions(a, n), r.set(o, i);
       }
       if (!i) return !1;
     }
@@ -1630,8 +1708,10 @@ class is {
   getSorted(t) {
     const n = this.sortedCache.get(t);
     if (n !== void 0) return n;
-    const r = this.labelSystems.get(t), s = this.sortSystems(r, t);
-    return this.sortedCache.set(t, s), s;
+    const r = this.labelSystems.get(t), s = this.sortSystems(r, t), 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(t, i), i;
   }
   /**
    * Delegates to the shared topologicalSort utility.
@@ -1644,14 +1724,14 @@ class is {
     for (const d of t) {
       r.push(d.descriptor), s.set(d.descriptor, d.insertionOrder), o.add(d.descriptor);
       for (let f = 0; f < d.sets.length; f++) {
-        const _ = d.sets[f];
-        let g = i.get(_);
-        g === void 0 && (g = [], i.set(_, g)), g.push(d.descriptor);
+        const h = d.sets[f];
+        let g = i.get(h);
+        g === void 0 && (g = [], i.set(h, g)), g.push(d.descriptor);
       }
     }
-    const c = /* @__PURE__ */ new Map();
+    const a = /* @__PURE__ */ new Map();
     for (const d of t)
-      c.set(d.descriptor, []);
+      a.set(d.descriptor, []);
     for (const d of t) {
       this.resolveEdges(
         d.descriptor,
@@ -1659,42 +1739,42 @@ class is {
         "before",
         o,
         i,
-        c,
+        a,
         n
-      ), this.resolveEdges(d.descriptor, d.after, "after", o, i, c, n);
+      ), this.resolveEdges(d.descriptor, d.after, "after", o, i, a, n);
       for (let f = 0; f < d.sets.length; f++) {
-        const _ = this.setOrdering.get(d.sets[f]);
-        _ !== void 0 && (this.resolveEdges(
+        const h = this.setOrdering.get(d.sets[f]);
+        h !== void 0 && (this.resolveEdges(
           d.descriptor,
-          _.before,
+          h.before,
           "before",
           o,
           i,
-          c,
+          a,
           n
         ), this.resolveEdges(
           d.descriptor,
-          _.after,
+          h.after,
           "after",
           o,
           i,
-          c,
+          a,
           n
         ));
       }
     }
-    const a = (d, f) => s.get(d) - s.get(f), l = (d) => d.name ?? `system_${d.id}`;
+    const c = (d, f) => s.get(d) - s.get(f), l = (d) => d.name ?? `system_${d.id}`;
     try {
-      return tt(r, c, a, l);
+      return tt(r, a, c, l);
     } catch (d) {
-      throw d instanceof TypeError ? new S(
-        w.CIRCULAR_SYSTEM_DEPENDENCY,
+      throw d instanceof TypeError ? new w(
+        S.CIRCULAR_SYSTEM_DEPENDENCY,
         `Circular system dependency detected in ${n}: ${d.message}`
       ) : d;
     }
   }
   /**
-   * 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
@@ -1702,10 +1782,10 @@ class is {
    * dropped — with a dev warning only for a concrete system, since a set
    * legitimately expands to nothing when its members live in another phase.
    */
-  resolveEdges(t, n, r, s, o, i, c) {
-    for (const a of n) {
-      if (ln(a)) {
-        const l = o.get(a);
+  resolveEdges(t, n, r, s, o, i, a) {
+    for (const c of n) {
+      if (ln(c)) {
+        const l = o.get(c);
         if (l === void 0) continue;
         for (let d = 0; d < l.length; d++) {
           const f = l[d];
@@ -1713,7 +1793,7 @@ class is {
         }
         continue;
       }
-      s.has(a) && this.addDirectedEdge(t, a, r, i);
+      s.has(c) && this.addDirectedEdge(t, c, r, i);
     }
   }
   /** Push one directed edge into the adjacency map. Both endpoints are known to
@@ -1740,11 +1820,11 @@ class is {
     );
   }
 }
-const ne = 1024, se = 1024 * ne, Me = 64 * ne, X = 256 * se, $e = 3, un = 64, fn = 8, Pe = 4 * se, xe = (e) => 2 ** Math.ceil(Math.log2(Math.max(1, e))), Q = (e) => 2 ** Math.floor(Math.log2(Math.max(1, e))), F = (e, t, n) => Math.min(n, Math.max(t, e)), I = (e) => e >= se ? `${(e / se).toFixed(1)} MiB` : e >= ne ? `${(e / ne).toFixed(0)} KiB` : `${e} B`;
+const ne = 1024, se = 1024 * ne, Me = 64 * ne, X = 256 * se, Pe = 3, un = 64, fn = 8, $e = 4 * se, xe = (e) => 2 ** Math.ceil(Math.log2(Math.max(1, e))), Q = (e) => 2 ** Math.floor(Math.log2(Math.max(1, e))), F = (e, t, n) => Math.min(n, Math.max(t, e)), I = (e) => e >= se ? `${(e / se).toFixed(1)} MiB` : e >= ne ? `${(e / ne).toFixed(0)} KiB` : `${e} B`;
 function R(e, t) {
   if (!Number.isInteger(t) || t <= 0)
-    throw new S(
-      w.INVALID_MEMORY_OPTIONS,
+    throw new w(
+      S.INVALID_MEMORY_OPTIONS,
       `memory.${e} must be a positive integer (got ${t})`
     );
 }
@@ -1753,35 +1833,35 @@ function as(e) {
     (s) => e !== void 0 && e[s] !== void 0
   );
   if (t.length > 1)
-    throw new S(
-      w.INVALID_MEMORY_OPTIONS,
+    throw new w(
+      S.INVALID_MEMORY_OPTIONS,
       `memory takes at most one of budget | maxBytes | wasm | allocator | heap | shared (got: ${t.join(", ")})`
     );
   const n = e?.columnCapacity;
-  if (n !== void 0 && R("column_capacity", n), e?.budget !== void 0) {
+  if (n !== void 0 && R("columnCapacity", n), e?.budget !== void 0) {
     const { entities: s } = e.budget, o = e.budget.archetypes ?? fn, i = e.budget.bytesPerEntity ?? un;
-    if (R("budget.entities", s), R("budget.archetypes", o), R("budget.bytes_per_entity", i), s > 1 << 20)
-      throw new S(
-        w.INVALID_MEMORY_OPTIONS,
+    if (R("budget.entities", s), R("budget.archetypes", o), R("budget.bytesPerEntity", i), s > 1 << 20)
+      throw new w(
+        S.INVALID_MEMORY_OPTIONS,
         `memory.budget.entities=${s} exceeds the EntityID index space (1<<20 = ${1 << 20})`
       );
-    const c = n ?? F(xe(Math.ceil(s / o)), 64, 1 << 20), a = F(xe(s * 2), 4096, 1 << 20), l = a * D, d = s * i * $e, f = ze(
-      Math.max(l + d, Pe),
+    const a = n ?? F(xe(Math.ceil(s / o)), 64, 1 << 20), c = F(xe(s * 2), 4096, 1 << 20), l = c * D, d = s * i * Pe, f = ze(
+      Math.max(l + d, $e),
       Me
     );
     return {
       source: "budget",
       allocator: K(f),
-      columnCapacity: c,
-      entityIndexCapacity: a,
+      columnCapacity: a,
+      entityIndexCapacity: c,
       capBytes: f,
       intentLabel: `budget of ${s} entities`,
       budgetEntities: s,
       derivation: [
-        `column_capacity = ${n !== void 0 ? `${c} (pinned)` : `pow2(${s}/${o} per archetype) = ${c}`}`,
-        `entity_index = pow2(2 × ${s}) = ${a} slots × ${D} B = ${I(l)}`,
-        `columns = ${s} × ${i} B × ${$e} (double+holes headroom) = ${I(d)}`,
-        `cap = align64K(max(index + columns, ${I(Pe)} floor)) = ${I(f)}`
+        `columnCapacity = ${n !== void 0 ? `${a} (pinned)` : `pow2(${s}/${o} per archetype) = ${a}`}`,
+        `entityIndex = pow2(2 × ${s}) = ${c} slots × ${D} B = ${I(l)}`,
+        `columns = ${s} × ${i} B × ${Pe} (double+holes headroom) = ${I(d)}`,
+        `cap = align64K(max(index + columns, ${I($e)} floor)) = ${I(f)}`
       ],
       wasmMemory: null
     };
@@ -1794,7 +1874,7 @@ function as(e) {
       v
     );
     return {
-      source: "max_bytes",
+      source: "maxBytes",
       allocator: K(e.maxBytes),
       columnCapacity: s,
       entityIndexCapacity: o,
@@ -1803,8 +1883,8 @@ function as(e) {
       budgetEntities: null,
       derivation: [
         `cap = ${I(e.maxBytes)} (caller-declared)`,
-        `column_capacity = ${s} (${n !== void 0 ? "pinned" : "default"})`,
-        `entity_index = floor_pow2(cap/4 ÷ ${D} B) = ${o} slots`
+        `columnCapacity = ${s} (${n !== void 0 ? "pinned" : "default"})`,
+        `entityIndex = floor_pow2(cap/4 ÷ ${D} B) = ${o} slots`
       ],
       wasmMemory: null
     };
@@ -1813,13 +1893,13 @@ function as(e) {
     const s = e.wasm, o = n ?? B;
     if (s.memory !== void 0) {
       if (!(s.memory.buffer instanceof SharedArrayBuffer))
-        throw new S(
-          w.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 w(
+          S.INVALID_MEMORY_OPTIONS,
+          "memory.wasm.memory must be constructed with `shared: true` — the SAB substrate requires a SharedArrayBuffer-backed WebAssembly.Memory"
         );
       return {
         source: "wasm",
-        allocator: we(s.memory),
+        allocator: Se(s.memory),
         columnCapacity: o,
         entityIndexCapacity: v,
         // The JS API hides a Memory's `maximum`; the caller declared it.
@@ -1829,52 +1909,52 @@ function as(e) {
         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
       };
     }
-    R("wasm.maximum_pages", s.maximumPages);
+    R("wasm.maximumPages", s.maximumPages);
     const i = s.initialPages ?? Math.min(32, s.maximumPages);
-    if (R("wasm.initial_pages", i), i > s.maximumPages)
-      throw new S(
-        w.INVALID_MEMORY_OPTIONS,
-        `memory.wasm.initial_pages (${i}) exceeds maximum_pages (${s.maximumPages})`
+    if (R("wasm.initialPages", i), i > s.maximumPages)
+      throw new w(
+        S.INVALID_MEMORY_OPTIONS,
+        `memory.wasm.initialPages (${i}) exceeds maximumPages (${s.maximumPages})`
       );
-    const c = new WebAssembly.Memory({
+    const a = new WebAssembly.Memory({
       initial: i,
       maximum: s.maximumPages,
       shared: !0
-    }), a = s.maximumPages * Me, l = F(
-      Q(a / 4 / D),
+    }), c = s.maximumPages * Me, l = F(
+      Q(c / 4 / D),
       4096,
       v
     );
     return {
       source: "wasm",
-      allocator: we(c),
+      allocator: Se(a),
       columnCapacity: o,
       entityIndexCapacity: l,
-      capBytes: a,
+      capBytes: c,
       intentLabel: `engine-constructed WebAssembly.Memory (max ${s.maximumPages} pages)`,
       budgetEntities: null,
       derivation: [
-        `cap = ${s.maximumPages} pages × 64 KiB = ${I(a)} (Memory maximum)`,
+        `cap = ${s.maximumPages} pages × 64 KiB = ${I(c)} (Memory maximum)`,
         `initial = ${i} pages (${s.initialPages !== void 0 ? "declared" : "default"})`,
-        `entity_index = floor_pow2(cap/4 ÷ ${D} B) = ${l} slots`,
-        `column_capacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
+        `entityIndex = floor_pow2(cap/4 ÷ ${D} B) = ${l} slots`,
+        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
       ],
-      wasmMemory: c
+      wasmMemory: a
     };
   }
   if (e?.allocator !== void 0) {
     if (e.allocator.isInPlace !== !0)
-      throw new S(
-        w.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 w(
+        S.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 ?? B, o = e.capBytesHint;
-    return o !== void 0 && R("cap_bytes_hint", o), {
+    return o !== void 0 && R("capBytesHint", o), {
       source: "allocator",
       allocator: e.allocator,
       columnCapacity: s,
@@ -1885,7 +1965,7 @@ function as(e) {
       derivation: [
         "backing = caller allocator (is_in_place ✓ checked at construction)",
         o !== void 0 ? `cap = ${I(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
     };
@@ -1906,10 +1986,10 @@ function as(e) {
       intentLabel: `pure-TS heap backing (${I(s)} growable cap, no SharedArrayBuffer)`,
       budgetEntities: null,
       derivation: [
-        `backing = heap_arraybuffer_allocator(${I(s)}) — resizable ArrayBuffer, no SAB / no COOP+COEP (is_in_place ✓)`,
+        `backing = heap_arraybuffer_allocator(${I(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 ÷ ${D} B) = ${i} slots`
+        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
+        `entityIndex = floor_pow2(cap/4 ÷ ${D} B) = ${i} slots`
       ],
       wasmMemory: null
     };
@@ -1932,8 +2012,8 @@ function as(e) {
       derivation: [
         `backing = growable_sab_allocator(${I(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 ÷ ${D} B) = ${i} slots`
+        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
+        `entityIndex = floor_pow2(cap/4 ÷ ${D} B) = ${i} slots`
       ],
       wasmMemory: null
     };
@@ -1949,8 +2029,8 @@ function as(e) {
     budgetEntities: null,
     derivation: [
       `cap = ${I(X)} (heap_arraybuffer_allocator default)`,
-      `column_capacity = ${r} (${n !== void 0 ? "pinned" : "DEFAULT_COLUMN_CAPACITY"})`,
-      `entity_index = ${v} slots (full EntityID space, ~12 MiB virtual)`
+      `columnCapacity = ${r} (${n !== void 0 ? "pinned" : "DEFAULT_COLUMN_CAPACITY"})`,
+      `entityIndex = ${v} slots (full EntityID space, ~12 MiB virtual)`
     ],
     wasmMemory: null
   };
@@ -1988,7 +2068,7 @@ function ue(e, t) {
       return ot(t, "HostCommand kind");
   }
 }
-class _n {
+class hn {
   queued = [];
   spawn(t, n) {
     return this.queued.push({ kind: "spawn", components: t, onSpawned: n }), this;
@@ -2035,7 +2115,7 @@ class _n {
   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() {
@@ -2050,7 +2130,7 @@ class _n {
    * `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(t, n) {
     const r = this.queued.length;
@@ -2066,13 +2146,13 @@ class _n {
   }
 }
 const Je = M - 1;
-function hn(e) {
+function _n(e) {
   if (e === Ee)
     throw new U(
-      "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 (e < 0 || e > 255 || !Number.isInteger(e))
-    throw new U(`command op_code must be a u8 in [1, 255] (got ${e})`);
+    throw new U(`command opCode must be a u8 in [1, 255] (got ${e})`);
 }
 function oe(e) {
   const t = new Uint8Array(Je);
@@ -2110,7 +2190,7 @@ function ls() {
     encode(e) {
       if (e.kind !== "despawn")
         throw new U(
-          `ring_despawn_codec encodes a "despawn" command (got "${e.kind}")`
+          `ringDespawnCodec encodes a "despawn" command (got "${e.kind}")`
         );
       return oe(e.eid);
     },
@@ -2122,7 +2202,7 @@ function us() {
     encode(e) {
       if (e.kind !== "disable")
         throw new U(
-          `ring_disable_codec encodes a "disable" command (got "${e.kind}")`
+          `ringDisableCodec encodes a "disable" command (got "${e.kind}")`
         );
       return oe(e.eid);
     },
@@ -2134,14 +2214,14 @@ function fs() {
     encode(e) {
       if (e.kind !== "enable")
         throw new U(
-          `ring_enable_codec encodes an "enable" command (got "${e.kind}")`
+          `ringEnableCodec encodes an "enable" command (got "${e.kind}")`
         );
       return oe(e.eid);
     },
     decode: (e) => ({ kind: "enable", eid: ie(e) })
   };
 }
-function _s(e) {
+function hs(e) {
   return {
     encode(t) {
       if (t.kind !== "remove_component")
@@ -2153,20 +2233,20 @@ function _s(e) {
     decode: (t) => ({ kind: "remove_component", eid: ie(t), def: e })
   };
 }
-class hs {
+class _s {
   appliers = /* @__PURE__ */ new Map();
   /** Bind a raw ctx-aware applier to `opCode`. Re-binding replaces. */
   on(t, n) {
-    return hn(t), this.appliers.set(t, n), this;
+    return _n(t), this.appliers.set(t, 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(t) {
     return this.appliers.delete(t);
   }
   /** 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(t, n) {
     return this.on(t, (r, s, o) => {
@@ -2177,19 +2257,19 @@ class hs {
   /** 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(t, n, r, s) {
     return Dt(n, r, (o, i) => {
-      const c = this.appliers.get(o);
-      c !== void 0 && c(t, i, s);
+      const a = this.appliers.get(o);
+      a !== void 0 && a(t, i, s);
     });
   }
 }
 const mn = /* @__PURE__ */ new Set([
-  $.PRE_STARTUP,
-  $.STARTUP,
-  $.POST_STARTUP
+  P.PRE_STARTUP,
+  P.STARTUP,
+  P.POST_STARTUP
 ]), fe = /* @__PURE__ */ new WeakMap();
 function ms(e, t) {
   const n = fe.get(t);
@@ -2198,15 +2278,15 @@ function ms(e, t) {
   return fe.delete(t), t.clear(), !0;
 }
 function gs(e, t) {
-  const n = new _n(), r = [];
+  const n = new hn(), r = [];
   fe.set(n, r);
-  const s = t?.name ?? "host_command_apply", o = t?.ring, i = t?.recorder, c = i?.record, a = t?.schedules ?? [$.PRE_STARTUP, $.PRE_UPDATE];
-  if (i !== void 0 && a.includes($.FIXED_UPDATE))
-    throw new S(
-      w.INVALID_RECORDER_SCHEDULE,
+  const s = t?.name ?? "host_command_apply", o = t?.ring, i = t?.recorder, a = i?.record, c = t?.schedules ?? [P.PRE_STARTUP, P.PRE_UPDATE];
+  if (i !== void 0 && c.includes(P.FIXED_UPDATE))
+    throw new w(
+      S.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 a) {
+  for (const l of c) {
     const d = !mn.has(l), f = e.registerSystem({
       name: `${s}:${l}`,
       // `reads`/`writes` are required by `SystemConfig` but empty here: the
@@ -2217,10 +2297,10 @@ function gs(e, t) {
       reads: [],
       writes: [],
       exclusive: !0,
-      fn: (_, g) => {
-        if (i !== void 0 && d && i.openTick(_.ecsTick, g), n.drain(_, c), o !== void 0) {
-          const y = e.columnStore, u = y.header.commandRingOff;
-          u !== 0 && o.drain(_, y.view, u, c);
+      fn: (h, g) => {
+        if (i !== void 0 && d && i.openTick(h.ecsTick, g), n.drain(h, a), o !== void 0) {
+          const p = e.columnStore, u = p.header.commandRingOff;
+          u !== 0 && o.drain(h, p.view, u, a);
         }
       }
     });
@@ -2231,25 +2311,25 @@ function gs(e, t) {
 export {
   ee as $,
   Kt as A,
-  $e as B,
-  $n as C,
+  Pe as B,
+  Pn as C,
   X as D,
-  S as E,
+  w as E,
   es as F,
   en as G,
-  hs as H,
+  _s as H,
   ts as I,
   Rn as J,
   qn as K,
   ze as L,
-  P as M,
-  wn as N,
+  $ as M,
+  Sn as N,
   ye as O,
   We as P,
   j as Q,
   Cn as R,
   m as S,
-  Hn as T,
+  Gn as T,
   In as U,
   zn as V,
   Xn as W,
@@ -2260,7 +2340,7 @@ export {
   un as a,
   Qn as a0,
   ns as a1,
-  p as a2,
+  y as a2,
   Zn as a3,
   ss as a4,
   Jn as a5,
@@ -2268,7 +2348,7 @@ export {
   J as a7,
   v as a8,
   kn as a9,
-  _n as aA,
+  hn as aA,
   cs as aB,
   Ue as aC,
   An as aD,
@@ -2279,13 +2359,13 @@ export {
   Kn as ae,
   Jt as af,
   qe as ag,
-  Sn as ah,
+  wn as ah,
   Ye as ai,
   Bn as aj,
   Mn as ak,
   jn as al,
   z as am,
-  Gn as an,
+  Hn as an,
   Yn as ao,
   Vn as ap,
   is as aq,
@@ -2293,7 +2373,7 @@ export {
   bn as as,
   Nn as at,
   Dn as au,
-  $ as av,
+  P as av,
   os as aw,
   gs as ax,
   ms as ay,
@@ -2304,23 +2384,23 @@ export {
   ls as e,
   us as f,
   fs as g,
-  _s as h,
+  hs as h,
   Je as i,
   vn as j,
   Ln as k,
-  _e as l,
+  he as l,
   Un as m,
-  Se as n,
+  we as n,
   ft as o,
   lt as p,
   ut as q,
   as as r,
-  Pn as s,
+  $n as s,
   Fn as t,
   Zt as u,
   yn as v,
   Tn as w,
-  w as x,
+  S as x,
   B as y,
   k as z
 };