@vgai/engine 0.5.18 → 0.5.19

package/dist/pixi/authoring.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"authoring.d.ts","sourceRoot":"","sources":["../../src/pixi/authoring.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEzC;;;;;;GAMG;AAEH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,GAAG,gBAAgB,GAAG,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC;IAClE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC;IACzD,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,kEAAkE;AAClE,MAAM,WAAW,UAAU;IACzB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AACD,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAuQnD;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,cAAc;IAC7B;;6BAEyB;IACzB,SAAS,CAAC,IAAI,IAAI,CAAC;IACnB,iEAAiE;IACjE,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAAC;CAC3D;AAED,sEAAsE;AACtE,eAAO,MAAM,0BAA0B,EAAE,cAExC,CAAC;AAaF,qBAAa,kBAAkB;IAqC3B,OAAO,CAAC,QAAQ,CAAC,IAAI;IApCvB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgC;IACrD,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiB;IAC1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAsC;gBAGzC,IAAI,EAAE,SAAS,EAChC,IAAI,GAAE;QAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAC,QAAQ,CAAC,EAAE,cAAc,CAAA;KAAO;IAO/D;;;;;;;;OAQG;IACH,OAAO,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAqB7C,+EAA+E;IAC/E,OAAO,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAM7C,KAAK,IAAI,YAAY,EAAE;IAIvB,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IAKrC,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;IAI3C;gEAC4D;IAC5D,OAAO,CAAC,MAAM;IA8Bd,OAAO,CAAC,MAAM;IAad,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAcjD,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAe5D,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;IAkBpC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAYnD,OAAO,CAAC,aAAa;IAYrB;;;;;;;;OAQG;IACH,YAAY,CAAC,OAAO,EAAE,SAAS,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IAevE,OAAO,IAAI,OAAO;IAGlB,gBAAgB,IAAI,SAAS;IAG7B,gFAAgF;IAChF,cAAc,CAAC,OAAO,EAAE,SAAS,GAAG,IAAI;IAKxC,wFAAwF;IACxF,SAAS,IAAI,IAAI;CAGlB"}
+{"version":3,"file":"authoring.d.ts","sourceRoot":"","sources":["../../src/pixi/authoring.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEzC;;;;;;GAMG;AAEH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,GAAG,gBAAgB,GAAG,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC;IAClE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,MAAM,GAAG,OAAO,CAAC;IACzD,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,kEAAkE;AAClE,MAAM,WAAW,UAAU;IACzB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AACD,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAqXnD;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,cAAc;IAC7B;;6BAEyB;IACzB,SAAS,CAAC,IAAI,IAAI,CAAC;IACnB,iEAAiE;IACjE,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAAC;CAC3D;AAED,sEAAsE;AACtE,eAAO,MAAM,0BAA0B,EAAE,cAExC,CAAC;AAaF,qBAAa,kBAAkB;IAqC3B,OAAO,CAAC,QAAQ,CAAC,IAAI;IApCvB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgC;IACrD,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiB;IAC1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAsC;gBAGzC,IAAI,EAAE,SAAS,EAChC,IAAI,GAAE;QAAE,OAAO,CAAC,EAAE,SAAS,CAAC;QAAC,QAAQ,CAAC,EAAE,cAAc,CAAA;KAAO;IAO/D;;;;;;;;OAQG;IACH,OAAO,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAqB7C,+EAA+E;IAC/E,OAAO,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAM7C,KAAK,IAAI,YAAY,EAAE;IAIvB,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IAKrC,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;IAI3C;gEAC4D;IAC5D,OAAO,CAAC,MAAM;IA8Bd,OAAO,CAAC,MAAM;IAad,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAcjD,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAe5D,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;IAkBpC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAYnD,OAAO,CAAC,aAAa;IAYrB;;;;;;;;OAQG;IACH,YAAY,CAAC,OAAO,EAAE,SAAS,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IAevE,OAAO,IAAI,OAAO;IAGlB,gBAAgB,IAAI,SAAS;IAG7B,gFAAgF;IAChF,cAAc,CAAC,OAAO,EAAE,SAAS,GAAG,IAAI;IAKxC,wFAAwF;IACxF,SAAS,IAAI,IAAI;CAGlB"}

package/dist/pixi/authoring.js

@@ -120,62 +120,141 @@ function isPixiDisplay(value) {
  * never reached `_cannon` inside the budget.
  */
 function viewOwnerLabel(view) {
-    const seen = new WeakSet();
+    const search = { seen: new WeakSet(), budget: OWNER_SEARCH_BUDGET };
     let host = view.parent;
     for (let hops = 0; hops < 8 && host && typeof host === 'object'; hops++) {
-        const found = labelFromHolder(host, view, seen) ?? findHeldOwner(host, view, 2, seen);
+        if (search.budget <= 0)
+            return undefined;
+        const found = labelFromHolder(host, view, search) ?? findHeldOwner(host, view, 2, search);
         if (found)
             return found;
         host = host.parent;
     }
     return undefined;
 }
+/**
+ * THE CEILING ON ONE NODE'S OWNER HUNT — what keeps a hierarchy read LINEAR in
+ * the size of the tree instead of quadratic in it.
+ *
+ * The hunt below is a search of the GAME's object graph, and a game's object
+ * graph is small: `this._cannon`, `allSystems.get('hud')`, `_decor[3]` are all
+ * found within a few dozen examinations. What is not small is anything the
+ * search can leak into — Pixi's own live render graph is the measured one, and
+ * naming a key blacklist is a fix for the leak you already found, not for the
+ * class. So every examination is charged against this budget and the search
+ * simply gives up when it runs out: the node then falls through to its texture
+ * alias / constructor / kind name, which is the same honest answer it gets
+ * today whenever the hunt finds nothing.
+ *
+ * MEASURED (2026-08-20, `packages/editor/scripts/scale-harness`): entering play
+ * on a 20 000-node `@pixi/react` world blocked the main thread for 199.5
+ * SECONDS in one synchronous run, 69% of all profiler samples inside this
+ * search, because `parentRenderGroup` reaches an array of every node in the
+ * tree and the search walked it once per unlabeled node. `vgai play`,
+ * `screenshot` and `stop` all timed out against a tab that was heartbeating
+ * normally the whole time.
+ */
+const OWNER_SEARCH_BUDGET = 2_000;
+/** Charge one examination. `false` means the hunt is over. */
+function spend(search) {
+    if (search.budget <= 0)
+        return false;
+    search.budget -= 1;
+    return true;
+}
 function isGameFieldKey(key) {
     // Skip display-list indices (`0`, `1`) and Pixi internals (`children`).
-    return /^_?[A-Za-z][A-Za-zA-Z0-9]*$/.test(key) && !PIXI_INTERNAL_KEY.has(key);
+    // The membership test is on the UNDERSCORED-STRIPPED key because that is how
+    // Pixi v8 spells most of them (`_position`, `_bounds`, `_texture`), and a
+    // set listing the bare names was silently matching none of those.
+    if (!/^_?[A-Za-z][A-Za-zA-Z0-9]*$/.test(key))
+        return false;
+    return !PIXI_INTERNAL_KEY.has(key.replace(/^_+/, ''));
 }
+/**
+ * Field names that belong to Pixi (or to its EventEmitter base), never to the
+ * game. Read off a live `pixi.js` v8 `Container`/`Sprite`'s own keys, so this
+ * is a transcription rather than a guess — but it is the OPTIMIZATION, not the
+ * correctness boundary: {@link OWNER_SEARCH_BUDGET} is what bounds the search
+ * on a Pixi version whose internals this list has never heard of. Spending the
+ * budget on plausible game fields instead of on the render graph is what keeps
+ * the heuristic's hit rate while it is bounded.
+ *
+ * `view` is deliberately absent: `.view` is the very field the hunt is looking
+ * for.
+ */
 const PIXI_INTERNAL_KEY = new Set([
     'parent',
     'children',
     'transform',
     'position',
+    'origin',
     'scale',
     'pivot',
     'skew',
+    'anchor',
     'worldTransform',
     'localTransform',
+    'groupTransform',
+    'relativeGroupTransform',
+    // The render graph — the measured leak. `parentRenderGroup` is on every
+    // container once a world has rendered and reaches every node in the tree.
+    'renderGroup',
+    'parentRenderGroup',
+    'parentRenderGroupIndex',
+    'parentRenderLayer',
+    'relativeRenderGroupDepth',
+    'renderPipeId',
+    'instructionSet',
+    'childrenToUpdate',
+    'childrenRenderablesToUpdate',
+    'effects',
+    'filters',
+    'mask',
+    'bounds',
+    'boundsArea',
+    'visualBounds',
+    'gpuData',
+    'texture',
+    'events',
+    'eventsCount',
+    'updateFlags',
 ]);
-function labelFromHolder(host, view, seen) {
-    if (seen.has(host))
+function labelFromHolder(host, view, search) {
+    if (search.seen.has(host))
         return undefined;
-    seen.add(host);
-    const asBag = nameInBag(host, view, undefined, seen);
+    search.seen.add(host);
+    const asBag = nameInBag(host, view, undefined, search);
     if (asBag)
         return asBag;
     for (const [key, value] of Object.entries(host)) {
+        if (!spend(search))
+            return undefined;
         if (!isGameFieldKey(key))
             continue;
         const named = nameIfHoldsView(host, key, value, view);
         if (named)
             return named;
-        const nested = nameInBag(value, view, key, seen);
+        const nested = nameInBag(value, view, key, search);
         if (nested)
             return nested;
     }
     return undefined;
 }
-function nameInBag(value, view, fieldKey, seen) {
+function nameInBag(value, view, fieldKey, search) {
     const entries = bagEntries(value);
     if (!entries)
         return undefined;
     for (const [itemKey, item] of entries) {
-        const named = nameBagItem(value, item, usableBagKey(itemKey) ?? fieldKey, view, seen);
+        if (!spend(search))
+            return undefined;
+        const named = nameBagItem(value, item, usableBagKey(itemKey) ?? fieldKey, view, search);
         if (named)
             return named;
     }
     return undefined;
 }
-function nameBagItem(bag, item, key, view, seen) {
+function nameBagItem(bag, item, key, view, search) {
     if (key) {
         const named = nameIfHoldsView(item && typeof item === 'object' ? item : bag, key, item, view);
         if (named)
@@ -187,7 +266,7 @@ function nameBagItem(bag, item, key, view, seen) {
             return named;
     }
     if (item && typeof item === 'object' && !isPixiDisplay(item)) {
-        return labelFromHolder(item, view, seen);
+        return labelFromHolder(item, view, search);
     }
     return undefined;
 }
@@ -196,6 +275,29 @@ function usableBagKey(key) {
         return undefined;
     return isGameFieldKey(key) || key.includes('-') ? (fieldLabel(key) ?? key) : undefined;
 }
+function* indexedBagEntries(value) {
+    for (let index = 0; index < value.length; index++)
+        yield [String(index), value[index]];
+}
+function* mapBagEntries(value) {
+    for (const [key, item] of value.entries())
+        yield [String(key), item];
+}
+function* setBagEntries(value) {
+    let index = 0;
+    for (const item of value) {
+        yield [String(index), item];
+        index += 1;
+    }
+}
+/**
+ * A bag's entries, LAZILY.
+ *
+ * Lazy because the caller is budgeted ({@link OWNER_SEARCH_BUDGET}) and must be
+ * able to stop: materializing the pairs first made a 20 000-element array cost
+ * 20 000 allocations before the first one was even looked at, which is a cost
+ * no budget above it can decline.
+ */
 function bagEntries(value) {
     if (!value || typeof value !== 'object')
         return undefined;
@@ -203,18 +305,13 @@ function bagEntries(value) {
     // their overridable `map`: one shipped Pixi game returns its elements rather
     // than `[key, value]` pairs there, which made hierarchy labeling throw while
     // destructuring the result. The authoring seam treats game objects as
-    // untrusted observations, so normalize with indexed reads into our own array.
-    if (Array.isArray(value)) {
-        const entries = [];
-        for (let index = 0; index < value.length; index++) {
-            entries.push([String(index), value[index]]);
-        }
-        return entries;
-    }
+    // untrusted observations, so normalize with indexed reads of our own.
+    if (Array.isArray(value))
+        return indexedBagEntries(value);
     if (value instanceof Map)
-        return [...value.entries()].map(([key, item]) => [String(key), item]);
+        return mapBagEntries(value);
     if (value instanceof Set)
-        return [...value].map((item, index) => [String(index), item]);
+        return setBagEntries(value);
     if (Object.getPrototypeOf(value) !== Object.prototype)
         return undefined;
     return Object.entries(value);
@@ -232,16 +329,27 @@ function nameIfHoldsView(host, key, value, view) {
     }
     return undefined;
 }
-function findHeldOwner(held, view, depth, seen) {
-    const direct = labelFromHolder(held, view, seen);
+function findHeldOwner(held, view, depth, search) {
+    const direct = labelFromHolder(held, view, search);
     if (direct)
         return direct;
     if (depth <= 0)
         return undefined;
-    for (const value of Object.values(held)) {
+    // BY KEY, exactly like `labelFromHolder`'s own scan. Iterating `Object.values`
+    // here was the leak that made a hierarchy read quadratic: `parentRenderGroup`
+    // sits on EVERY container once a world has rendered, and descending into it
+    // reaches `childrenToUpdate[depth].list` — an array of every node in the
+    // tree — so the search for one node's owner walked the whole tree, for every
+    // unlabeled node. `isGameFieldKey` already knows which keys belong to Pixi
+    // rather than to the game; this scan simply has to ask it too.
+    for (const [key, value] of Object.entries(held)) {
+        if (!spend(search))
+            return undefined;
+        if (!isGameFieldKey(key))
+            continue;
         if (!value || typeof value !== 'object' || isPixiDisplay(value))
             continue;
-        const found = findHeldOwner(value, view, depth - 1, seen);
+        const found = findHeldOwner(value, view, depth - 1, search);
         if (found)
             return found;
     }

package/package.json

@@ -2,7 +2,7 @@
   "name": "@vgai/engine",
   "author": "Volter AI, Inc.",
   "license": "Apache-2.0",
-  "version": "0.5.18",
+  "version": "0.5.19",
   "description": "Readable TypeScript game engine and universal host for Three.js, PixiJS, and React games.",
   "keywords": [
     "game-engine",

package/src/pixi/authoring.ts

@@ -159,43 +159,125 @@ function isPixiDisplay(value: object): boolean {
  * never reached `_cannon` inside the budget.
  */
 function viewOwnerLabel(view: Container): string | undefined {
-  const seen = new WeakSet<object>();
+  const search: OwnerSearch = { seen: new WeakSet<object>(), budget: OWNER_SEARCH_BUDGET };
   let host: unknown = view.parent;
   for (let hops = 0; hops < 8 && host && typeof host === 'object'; hops++) {
-    const found = labelFromHolder(host, view, seen) ?? findHeldOwner(host, view, 2, seen);
+    if (search.budget <= 0) return undefined;
+    const found = labelFromHolder(host, view, search) ?? findHeldOwner(host, view, 2, search);
     if (found) return found;
     host = (host as { parent?: unknown }).parent;
   }
   return undefined;
 }
 
+/**
+ * THE CEILING ON ONE NODE'S OWNER HUNT — what keeps a hierarchy read LINEAR in
+ * the size of the tree instead of quadratic in it.
+ *
+ * The hunt below is a search of the GAME's object graph, and a game's object
+ * graph is small: `this._cannon`, `allSystems.get('hud')`, `_decor[3]` are all
+ * found within a few dozen examinations. What is not small is anything the
+ * search can leak into — Pixi's own live render graph is the measured one, and
+ * naming a key blacklist is a fix for the leak you already found, not for the
+ * class. So every examination is charged against this budget and the search
+ * simply gives up when it runs out: the node then falls through to its texture
+ * alias / constructor / kind name, which is the same honest answer it gets
+ * today whenever the hunt finds nothing.
+ *
+ * MEASURED (2026-08-20, `packages/editor/scripts/scale-harness`): entering play
+ * on a 20 000-node `@pixi/react` world blocked the main thread for 199.5
+ * SECONDS in one synchronous run, 69% of all profiler samples inside this
+ * search, because `parentRenderGroup` reaches an array of every node in the
+ * tree and the search walked it once per unlabeled node. `vgai play`,
+ * `screenshot` and `stop` all timed out against a tab that was heartbeating
+ * normally the whole time.
+ */
+const OWNER_SEARCH_BUDGET = 2_000;
+
+/** One node's owner hunt: what it has already looked at, and what it has left. */
+interface OwnerSearch {
+  readonly seen: WeakSet<object>;
+  /** Counts DOWN. Zero ends the hunt for this node, wherever it has reached. */
+  budget: number;
+}
+
+/** Charge one examination. `false` means the hunt is over. */
+function spend(search: OwnerSearch): boolean {
+  if (search.budget <= 0) return false;
+  search.budget -= 1;
+  return true;
+}
+
 function isGameFieldKey(key: string): boolean {
   // Skip display-list indices (`0`, `1`) and Pixi internals (`children`).
-  return /^_?[A-Za-z][A-Za-zA-Z0-9]*$/.test(key) && !PIXI_INTERNAL_KEY.has(key);
+  // The membership test is on the UNDERSCORED-STRIPPED key because that is how
+  // Pixi v8 spells most of them (`_position`, `_bounds`, `_texture`), and a
+  // set listing the bare names was silently matching none of those.
+  if (!/^_?[A-Za-z][A-Za-zA-Z0-9]*$/.test(key)) return false;
+  return !PIXI_INTERNAL_KEY.has(key.replace(/^_+/, ''));
 }
 
+/**
+ * Field names that belong to Pixi (or to its EventEmitter base), never to the
+ * game. Read off a live `pixi.js` v8 `Container`/`Sprite`'s own keys, so this
+ * is a transcription rather than a guess — but it is the OPTIMIZATION, not the
+ * correctness boundary: {@link OWNER_SEARCH_BUDGET} is what bounds the search
+ * on a Pixi version whose internals this list has never heard of. Spending the
+ * budget on plausible game fields instead of on the render graph is what keeps
+ * the heuristic's hit rate while it is bounded.
+ *
+ * `view` is deliberately absent: `.view` is the very field the hunt is looking
+ * for.
+ */
 const PIXI_INTERNAL_KEY = new Set([
   'parent',
   'children',
   'transform',
   'position',
+  'origin',
   'scale',
   'pivot',
   'skew',
+  'anchor',
   'worldTransform',
   'localTransform',
+  'groupTransform',
+  'relativeGroupTransform',
+  // The render graph — the measured leak. `parentRenderGroup` is on every
+  // container once a world has rendered and reaches every node in the tree.
+  'renderGroup',
+  'parentRenderGroup',
+  'parentRenderGroupIndex',
+  'parentRenderLayer',
+  'relativeRenderGroupDepth',
+  'renderPipeId',
+  'instructionSet',
+  'childrenToUpdate',
+  'childrenRenderablesToUpdate',
+  'effects',
+  'filters',
+  'mask',
+  'bounds',
+  'boundsArea',
+  'visualBounds',
+  'gpuData',
+  'texture',
+  'events',
+  'eventsCount',
+  'updateFlags',
 ]);
 
-function labelFromHolder(host: object, view: Container, seen: WeakSet<object>): string | undefined {
-  if (seen.has(host)) return undefined;
-  seen.add(host);
-  const asBag = nameInBag(host, view, undefined, seen);
+function labelFromHolder(host: object, view: Container, search: OwnerSearch): string | undefined {
+  if (search.seen.has(host)) return undefined;
+  search.seen.add(host);
+  const asBag = nameInBag(host, view, undefined, search);
   if (asBag) return asBag;
   for (const [key, value] of Object.entries(host as Record<string, unknown>)) {
+    if (!spend(search)) return undefined;
     if (!isGameFieldKey(key)) continue;
     const named = nameIfHoldsView(host, key, value, view);
     if (named) return named;
-    const nested = nameInBag(value, view, key, seen);
+    const nested = nameInBag(value, view, key, search);
     if (nested) return nested;
   }
   return undefined;
@@ -205,12 +287,13 @@ function nameInBag(
   value: unknown,
   view: Container,
   fieldKey: string | undefined,
-  seen: WeakSet<object>,
+  search: OwnerSearch,
 ): string | undefined {
   const entries = bagEntries(value);
   if (!entries) return undefined;
   for (const [itemKey, item] of entries) {
-    const named = nameBagItem(value, item, usableBagKey(itemKey) ?? fieldKey, view, seen);
+    if (!spend(search)) return undefined;
+    const named = nameBagItem(value, item, usableBagKey(itemKey) ?? fieldKey, view, search);
     if (named) return named;
   }
   return undefined;
@@ -221,7 +304,7 @@ function nameBagItem(
   item: unknown,
   key: string | undefined,
   view: Container,
-  seen: WeakSet<object>,
+  search: OwnerSearch,
 ): string | undefined {
   if (key) {
     const named = nameIfHoldsView(
@@ -236,7 +319,7 @@ function nameBagItem(
     if (named) return named;
   }
   if (item && typeof item === 'object' && !isPixiDisplay(item)) {
-    return labelFromHolder(item, view, seen);
+    return labelFromHolder(item, view, search);
   }
   return undefined;
 }
@@ -246,22 +329,40 @@ function usableBagKey(key: string): string | undefined {
   return isGameFieldKey(key) || key.includes('-') ? (fieldLabel(key) ?? key) : undefined;
 }
 
-function bagEntries(value: unknown): readonly [string, unknown][] | undefined {
+function* indexedBagEntries(value: ArrayLike<unknown>): Generator<[string, unknown]> {
+  for (let index = 0; index < value.length; index++) yield [String(index), value[index]];
+}
+
+function* mapBagEntries(value: Map<unknown, unknown>): Generator<[string, unknown]> {
+  for (const [key, item] of value.entries()) yield [String(key), item];
+}
+
+function* setBagEntries(value: Set<unknown>): Generator<[string, unknown]> {
+  let index = 0;
+  for (const item of value) {
+    yield [String(index), item];
+    index += 1;
+  }
+}
+
+/**
+ * A bag's entries, LAZILY.
+ *
+ * Lazy because the caller is budgeted ({@link OWNER_SEARCH_BUDGET}) and must be
+ * able to stop: materializing the pairs first made a 20 000-element array cost
+ * 20 000 allocations before the first one was even looked at, which is a cost
+ * no budget above it can decline.
+ */
+function bagEntries(value: unknown): Iterable<readonly [string, unknown]> | undefined {
   if (!value || typeof value !== 'object') return undefined;
   // Game arrays are allowed to be exotic subclasses. Do not dispatch through
   // their overridable `map`: one shipped Pixi game returns its elements rather
   // than `[key, value]` pairs there, which made hierarchy labeling throw while
   // destructuring the result. The authoring seam treats game objects as
-  // untrusted observations, so normalize with indexed reads into our own array.
-  if (Array.isArray(value)) {
-    const entries: [string, unknown][] = [];
-    for (let index = 0; index < value.length; index++) {
-      entries.push([String(index), value[index]]);
-    }
-    return entries;
-  }
-  if (value instanceof Map) return [...value.entries()].map(([key, item]) => [String(key), item]);
-  if (value instanceof Set) return [...value].map((item, index) => [String(index), item]);
+  // untrusted observations, so normalize with indexed reads of our own.
+  if (Array.isArray(value)) return indexedBagEntries(value as ArrayLike<unknown>);
+  if (value instanceof Map) return mapBagEntries(value);
+  if (value instanceof Set) return setBagEntries(value);
   if (Object.getPrototypeOf(value) !== Object.prototype) return undefined;
   return Object.entries(value as Record<string, unknown>);
 }
@@ -289,14 +390,23 @@ function findHeldOwner(
   held: object,
   view: Container,
   depth: number,
-  seen: WeakSet<object>,
+  search: OwnerSearch,
 ): string | undefined {
-  const direct = labelFromHolder(held, view, seen);
+  const direct = labelFromHolder(held, view, search);
   if (direct) return direct;
   if (depth <= 0) return undefined;
-  for (const value of Object.values(held as Record<string, unknown>)) {
+  // BY KEY, exactly like `labelFromHolder`'s own scan. Iterating `Object.values`
+  // here was the leak that made a hierarchy read quadratic: `parentRenderGroup`
+  // sits on EVERY container once a world has rendered, and descending into it
+  // reaches `childrenToUpdate[depth].list` — an array of every node in the
+  // tree — so the search for one node's owner walked the whole tree, for every
+  // unlabeled node. `isGameFieldKey` already knows which keys belong to Pixi
+  // rather than to the game; this scan simply has to ask it too.
+  for (const [key, value] of Object.entries(held as Record<string, unknown>)) {
+    if (!spend(search)) return undefined;
+    if (!isGameFieldKey(key)) continue;
     if (!value || typeof value !== 'object' || isPixiDisplay(value)) continue;
-    const found = findHeldOwner(value, view, depth - 1, seen);
+    const found = findHeldOwner(value, view, depth - 1, search);
     if (found) return found;
   }
   return undefined;