@intentius/chant 0.73.0 → 0.74.1

package/dist/build.d.ts

@@ -56,6 +56,22 @@ export interface StackGraph {
  * referencing an attribute of a resource in lexicon B ⇒ A depends on B). Returns
  * the edge set plus a topological order, parallel-safe waves, and any cycles.
  */
+/**
+ * Is this entity a member of a lexicon stack?
+ *
+ * Four kinds are not, and every one of them is serializer-neutral: a
+ * `LexiconOutput` is collected separately, a secret provenance declaration
+ * (#1828) and a plan scenario (#1292) are data lint and the CLI read off the
+ * entity map, and an Op (#2118) builds to its own `op.json` rather than
+ * through a lexicon serializer.
+ *
+ * {@link partitionByLexicon} has skipped all four since each landed, and
+ * {@link computeStackGraph}'s walk did not — so an entity with no `lexicon`
+ * (a `LexiconOutput`) entered `edges`, `order` and `waves` as `undefined`
+ * while `nodes`, built from the partition, could never contain it (#2480).
+ * One predicate for both sites, so they cannot drift apart again.
+ */
+export declare function isStackMember(entity: Declarable): boolean;
 export declare function computeStackGraph(entities: Map<string, Declarable>, lexiconNames: string[]): StackGraph;
 /**
  * Result of the build process

package/dist/build.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../src/build.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACjE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAsB,MAAM,UAAU,CAAC;AAC/D,OAAO,KAAK,EAAE,YAAY,EAAyB,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAC3F,OAAO,EAAiB,KAAK,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACxE,OAAO,EAA4B,KAAK,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAClF,OAAO,EAAE,cAAc,EAAiC,MAAM,UAAU,CAAC;AACzE,OAAO,EAAE,aAAa,EAAmB,MAAM,kBAAkB,CAAC;AAQlE,OAAO,EAAkC,KAAK,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtF,OAAO,EAAmB,KAAK,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAKvF;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,EAAE,MAAM,CACb,MAAM,EACN;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CACtD,CAAC;IACF,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,wEAAwE;IACxE,UAAU,EAAE,UAAU,CAAC;CACxB;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,gDAAgD;IAChD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;OAGG;IACH,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3C,wEAAwE;IACxE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;OAGG;IACH,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAClB,yEAAyE;IACzE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EACjC,YAAY,EAAE,MAAM,EAAE,GACrB,UAAU,CAgFZ;AAED;;GAEG;AACH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,SAAS,CAAC,EAAE,eAAe,CAAC;IAE5B;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAEjC;;;;;OAKG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;IAEf;;;;;OAKG;IACH,UAAU,CAAC,EAAE,YAAY,EAAE,CAAC;IAE5B;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAE7B;;;;;OAKG;IACH,eAAe,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAEnD;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,EAAE,oBAAoB,EAAE,CAAC;IAErC;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,EAAE,oBAAoB,EAAE,CAAC;CACrC;AAED,MAAM,WAAW,WAAW;IAC1B,6EAA6E;IAC7E,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;IAChD,8CAA8C;IAC9C,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAClC,qDAAqD;IACrD,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACvC,qDAAqD;IACrD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,6DAA6D;IAC7D,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,UAAU,CAAC,CAAC;IAC3C,wDAAwD;IACxD,QAAQ,EAAE,aAAa,CAAC;IACxB,uCAAuC;IACvC,eAAe,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,aAAa,EAAE,YAAY,EAAE,CAAC;IAE9B;;;;;;;;;;;;OAYG;IACH,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAExC;;;;;;OAMG;IACH,WAAW,EAAE,oBAAoB,EAAE,CAAC;IAEpC;;;;;;;;;;;;;OAaG;IACH,cAAc,EAAE,cAAc,CAAC;CAChC;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAChC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CA6BtC;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAChC,aAAa,EAAE,CAuEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAChC,aAAa,EAAE,CA+FjB;AA6ED;8DAC8D;AAC9D,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAsB,sBAAsB,CAC1C,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EACjC,YAAY,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAChD,OAAO,CAAC,oBAAoB,CAAC,CAwB/B;AAED;;;;;;;GAOG;AACH,wBAAsB,KAAK,CACzB,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,UAAU,EAAE,EACzB,gBAAgB,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC9B,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,WAAW,CAAC,CAYtB;AA6MD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAsB,qBAAqB,CACzC,IAAI,EAAE,sBAAsB,EAC5B,WAAW,EAAE,UAAU,EAAE,EACzB,KAAK,SAAsB,EAC3B,gBAAgB,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC9B,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,WAAW,CAAC,CAgBtB"}
+{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../src/build.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACjE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAsB,MAAM,UAAU,CAAC;AAC/D,OAAO,KAAK,EAAE,YAAY,EAAyB,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAC3F,OAAO,EAAiB,KAAK,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACxE,OAAO,EAA4B,KAAK,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAClF,OAAO,EAAE,cAAc,EAAiC,MAAM,UAAU,CAAC;AACzE,OAAO,EAAE,aAAa,EAAmB,MAAM,kBAAkB,CAAC;AAQlE,OAAO,EAAkC,KAAK,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtF,OAAO,EAAmB,KAAK,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAKvF;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,EAAE,MAAM,CACb,MAAM,EACN;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CACtD,CAAC;IACF,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,wEAAwE;IACxE,UAAU,EAAE,UAAU,CAAC;CACxB;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,gDAAgD;IAChD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;OAGG;IACH,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3C,wEAAwE;IACxE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;;OAGG;IACH,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAClB,yEAAyE;IACzE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CACpB;AAED;;;;;GAKG;AACH;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO,CAOzD;AAED,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EACjC,YAAY,EAAE,MAAM,EAAE,GACrB,UAAU,CAuFZ;AAED;;GAEG;AACH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,SAAS,CAAC,EAAE,eAAe,CAAC;IAE5B;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAEjC;;;;;OAKG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;IAEf;;;;;OAKG;IACH,UAAU,CAAC,EAAE,YAAY,EAAE,CAAC;IAE5B;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAE7B;;;;;OAKG;IACH,eAAe,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAEnD;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,EAAE,oBAAoB,EAAE,CAAC;IAErC;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,EAAE,oBAAoB,EAAE,CAAC;CACrC;AAED,MAAM,WAAW,WAAW;IAC1B,6EAA6E;IAC7E,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;IAChD,8CAA8C;IAC9C,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAClC,qDAAqD;IACrD,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACvC,qDAAqD;IACrD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,6DAA6D;IAC7D,MAAM,EAAE,KAAK,CAAC,cAAc,GAAG,UAAU,CAAC,CAAC;IAC3C,wDAAwD;IACxD,QAAQ,EAAE,aAAa,CAAC;IACxB,uCAAuC;IACvC,eAAe,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,aAAa,EAAE,YAAY,EAAE,CAAC;IAE9B;;;;;;;;;;;;OAYG;IACH,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAExC;;;;;;OAMG;IACH,WAAW,EAAE,oBAAoB,EAAE,CAAC;IAEpC;;;;;;;;;;;;;OAaG;IACH,cAAc,EAAE,cAAc,CAAC;CAChC;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAChC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAmBtC;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAChC,aAAa,EAAE,CAuEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAChC,aAAa,EAAE,CA+FjB;AA6ED;8DAC8D;AAC9D,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAsB,sBAAsB,CAC1C,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EACjC,YAAY,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAChD,OAAO,CAAC,oBAAoB,CAAC,CAwB/B;AAED;;;;;;;GAOG;AACH,wBAAsB,KAAK,CACzB,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,UAAU,EAAE,EACzB,gBAAgB,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC9B,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,WAAW,CAAC,CAYtB;AA6MD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAsB,qBAAqB,CACzC,IAAI,EAAE,sBAAsB,EAC5B,WAAW,EAAE,UAAU,EAAE,EACzB,KAAK,SAAsB,EAC3B,gBAAgB,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC9B,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,WAAW,CAAC,CAgBtB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@intentius/chant",
-  "version": "0.73.0",
+  "version": "0.74.1",
   "description": "Declarative infrastructure-as-code toolkit — TypeScript on Node.js",
   "license": "Apache-2.0",
   "homepage": "https://intentius.io/chant",

package/src/build.test.ts

@@ -2,7 +2,7 @@ import { describe, test, expect, beforeEach, afterEach, vi } from "vitest";
 import { build, partitionByLexicon, detectCrossLexiconRefs, collectLexiconOutputs, computeStackGraph } from "./build";
 import { output } from "./lexicon-output";
 import { AttrRef } from "./attrref";
-import { INTRINSIC_MARKER } from "./intrinsic";
+import { INTRINSIC_MARKER, type Intrinsic } from "./intrinsic";
 import type { Serializer } from "./serializer";
 import type { Declarable } from "./declarable";
 import { DECLARABLE_MARKER } from "./declarable";
@@ -793,6 +793,59 @@ describe("computeStackGraph (#200 — cross-stack apply ordering)", () => {
   const ent = (lexicon: string, props: Record<string, unknown> = {}): Declarable =>
     ({ lexicon, entityType: `${lexicon}::X`, [DECLARABLE_MARKER]: true, props }) as unknown as Declarable;
 
+  // #2480: the walk took `entity.lexicon` as the consumer for every entity,
+  // and four kinds have no place in a stack graph. A LexiconOutput carries no
+  // `lexicon` at all, so it produced an edge with `from: undefined`, and that
+  // `undefined` then reached `order` and `waves` — while `nodes`, built from
+  // the partition, could never contain it. Reproduced on chant's own
+  // fan-out-estate and bedrock-agentcore-agent examples, both of which declare
+  // outputs built from intrinsics.
+  //
+  // The invariant these assert is the one a consumer can actually rely on:
+  // `nodes` is the roster, and nothing may appear anywhere else that is not
+  // named in it.
+  const rosterHolds = (g: ReturnType<typeof computeStackGraph>): void => {
+    const roster = new Set(g.nodes);
+    expect(g.nodes.every((n) => typeof n === "string")).toBe(true);
+    for (const e of g.edges) {
+      expect(roster.has(e.from)).toBe(true);
+      expect(roster.has(e.to)).toBe(true);
+    }
+    for (const n of g.order) expect(roster.has(n)).toBe(true);
+    for (const wave of g.waves) for (const n of wave) expect(roster.has(n)).toBe(true);
+    for (const cycle of g.cycles) for (const n of cycle) expect(roster.has(n)).toBe(true);
+  };
+
+  test("a LexiconOutput is not a stack member, so it cannot reach edges, order or waves (#2480)", () => {
+    const vpc = ent("aws");
+    // An output built from an intrinsic holds real AttrRefs inside it, which
+    // is what carried the walk into `addEdge(undefined, "aws")`.
+    // Built from an INTRINSIC holding an AttrRef, which is the shape the two
+    // reproducing examples have (`Fn::Sub`/`Ref` over a resource attribute).
+    // An output built from a bare AttrRef stores only a WeakRef and carries
+    // the walk nowhere, so it does not reproduce this.
+    const intrinsic: Intrinsic = {
+      [INTRINSIC_MARKER]: true as const,
+      ref: new AttrRef(vpc, "id"),
+      toJSON: () => ({ "Fn::Sub": "x" }),
+    } as Intrinsic;
+    const out = output(intrinsic, "vpcId");
+
+    const g = computeStackGraph(new Map([["vpc", vpc], ["vpcId", out as unknown as Declarable]]), ["aws"]);
+
+    expect(g.nodes).toEqual(["aws"]);
+    expect(g.edges).toEqual([]);
+    expect(g.order).toEqual(["aws"]);
+    expect(g.waves).toEqual([["aws"]]);
+    rosterHolds(g);
+  });
+
+  test("the roster invariant holds for an ordinary cross-lexicon graph too", () => {
+    const vpc = ent("aws");
+    const svc = ent("k8s", { vpcId: new AttrRef(vpc, "id") });
+    rosterHolds(computeStackGraph(new Map([["vpc", vpc], ["svc", svc]]), ["aws", "k8s"]));
+  });
+
   test("infers a consumer→producer edge from a cross-lexicon AttrRef", () => {
     const vpc = ent("aws");
     const svc = ent("k8s", { vpcId: new AttrRef(vpc, "id") });

package/src/build.ts

@@ -65,6 +65,30 @@ export interface StackGraph {
  * referencing an attribute of a resource in lexicon B ⇒ A depends on B). Returns
  * the edge set plus a topological order, parallel-safe waves, and any cycles.
  */
+/**
+ * Is this entity a member of a lexicon stack?
+ *
+ * Four kinds are not, and every one of them is serializer-neutral: a
+ * `LexiconOutput` is collected separately, a secret provenance declaration
+ * (#1828) and a plan scenario (#1292) are data lint and the CLI read off the
+ * entity map, and an Op (#2118) builds to its own `op.json` rather than
+ * through a lexicon serializer.
+ *
+ * {@link partitionByLexicon} has skipped all four since each landed, and
+ * {@link computeStackGraph}'s walk did not — so an entity with no `lexicon`
+ * (a `LexiconOutput`) entered `edges`, `order` and `waves` as `undefined`
+ * while `nodes`, built from the partition, could never contain it (#2480).
+ * One predicate for both sites, so they cannot drift apart again.
+ */
+export function isStackMember(entity: Declarable): boolean {
+  return (
+    !isLexiconOutput(entity) &&
+    !isSecretDeclaration(entity) &&
+    !isScenario(entity) &&
+    !isOpEntity(entity)
+  );
+}
+
 export function computeStackGraph(
   entities: Map<string, Declarable>,
   lexiconNames: string[],
@@ -72,6 +96,10 @@ export function computeStackGraph(
   const edges: Array<{ from: string; to: string }> = [];
   const edgeSet = new Set<string>();
   const addEdge = (from: string, to: string): void => {
+    // A structural guard, not a defensive one: `nodes` comes from the
+    // partition, so an endpoint the partition would have dropped can never be
+    // a legitimate member of this graph (#2480).
+    if (typeof from !== "string" || typeof to !== "string") return;
     if (from === to) return;
     const key = `${from}\0${to}`;
     if (edgeSet.has(key)) return;
@@ -104,6 +132,9 @@ export function computeStackGraph(
   };
 
   for (const [, entity] of entities) {
+    // #2480: the same four kinds `partitionByLexicon` drops. Walking one as a
+    // consumer takes its absent `lexicon` as the edge's `from`.
+    if (!isStackMember(entity)) continue;
     const consumer = entity.lexicon;
     const visited = new Set<unknown>();
     for (const val of Object.values(entity as unknown as Record<string, unknown>)) {
@@ -117,10 +148,10 @@ export function computeStackGraph(
   // Dependency map: node → producers it depends on.
   const nodes = lexiconNames.length
     ? [...lexiconNames]
-    : // Secret provenance declarations (#1828) and plan scenarios (#1292) never
-      // form a stack — their pseudo-lexicon has no serializer and must not
-      // appear in the manifest.
-      [...new Set([...entities.values()].filter((e) => !isSecretDeclaration(e) && !isScenario(e)).map((e) => e.lexicon))];
+    : // The same predicate, rather than the partial copy of it this branch
+      // carried: it filtered secrets and scenarios but not outputs or Ops, so
+      // it could mint a node the partition would have dropped (#2480).
+      [...new Set([...entities.values()].filter(isStackMember).map((e) => e.lexicon))];
   const deps = new Map<string, Set<string>>();
   for (const n of nodes) deps.set(n, new Set());
   for (const { from, to } of edges) {
@@ -325,23 +356,13 @@ export function partitionByLexicon(
   const partitions = new Map<string, Map<string, Declarable>>();
 
   for (const [name, entity] of entities) {
-    // LexiconOutput instances are collected separately; skip them here
-    if (isLexiconOutput(entity)) continue;
-    // Secret provenance declarations (#1828) are serializer-neutral: data
-    // that lint and lexicons read from the entity map, never output. Keeping
-    // them out of every partition means no serializer sees them and no
-    // "No serializer found" warning fires for their pseudo-lexicon.
-    if (isSecretDeclaration(entity)) continue;
-    // Plan scenarios (#1292) are serializer-neutral the same way: a checkable
-    // expectation the CLI reads off the entity map, never output.
-    if (isScenario(entity)) continue;
-    // Op declarations (#2118) too. An Op's build output is its `op.json` IR,
-    // and core writes that itself from the entity map (`./cli/commands/build.ts`)
-    // rather than routing it through a lexicon serializer — the Op model, the
-    // executor and the IR are all core's, and no lexicon renders an Op entity
-    // into its own manifest. Keeping them out of every partition means no
-    // "No serializer found" warning fires for core's own `chant` lexicon.
-    if (isOpEntity(entity)) continue;
+    // The four serializer-neutral kinds, each explained on {@link isStackMember}:
+    // a LexiconOutput is collected separately, and a secret declaration
+    // (#1828), a plan scenario (#1292) and an Op (#2118) are read off the
+    // entity map rather than routed through a lexicon serializer. Keeping them
+    // out of every partition is what stops a "No serializer found" warning
+    // firing for a pseudo-lexicon.
+    if (!isStackMember(entity)) continue;
     const lexicon = entity.lexicon;
     if (!partitions.has(lexicon)) {
       partitions.set(lexicon, new Map());