eval-quality 0.2.0 → 0.5.0

package/dist/core/declared-inputs.js

@@ -1,18 +1,115 @@
-import { TRANSPORT_CHANNELS } from './schemas/pointer.js';
+import { COMMAND_CHANNELS, INPUT_CHANNELS, TRANSPORT_CHANNELS, } from './schemas/pointer.js';
+/**
+ * Which output channel the operation's one response descriptor describes.
+ *
+ * AD-19 gives every operation exactly one descriptor, and the channel that
+ * descriptor describes is what makes its keys addressable. For an interface
+ * that speaks HTTP that channel is the response body; a command operation
+ * declares its own. One rule, three roots: every consumer that used to hard-code
+ * `response-body` asks this instead.
+ */
+export const descriptorChannelOf = (operation) => {
+    if (!isCommandOperation(operation))
+        return 'response-body';
+    const { descriptorChannel } = operation;
+    return descriptorChannel.kind === 'stream'
+        ? descriptorChannel.channel
+        : 'artifact';
+};
+/**
+ * Which artifact the descriptor describes, or `null` when it describes a
+ * stream. An artifact pointer descends through the descriptor only when it
+ * names this one; every other declared artifact is known to exist and declares
+ * no structure.
+ */
+export const descriptorArtifactOf = (operation) => {
+    if (!isCommandOperation(operation))
+        return null;
+    const { descriptorChannel } = operation;
+    return descriptorChannel.kind === 'artifact'
+        ? descriptorChannel.artifactId
+        : null;
+};
+/**
+ * Whether an evidence target addresses the channel this operation's response
+ * descriptor describes.
+ *
+ * The channel name alone is not the answer on the artifact channel: an
+ * operation may declare several files while its one descriptor describes one of
+ * them, so a pointer at a different file names a channel with no declared
+ * structure. Every consumer asks this rather than comparing the channel itself,
+ * because comparing only the channel was a defect at three separate sites and a
+ * fourth site would have made the same mistake for the same reason.
+ */
+export const targetsDescribedChannel = (operation, target) => {
+    if (target.channel !== descriptorChannelOf(operation))
+        return false;
+    if (target.channel !== 'artifact')
+        return true;
+    return target.artifactId === descriptorArtifactOf(operation);
+};
+/** Every artifact identifier the operation declares it writes. */
+export const declaredArtifactsOf = (operation) => isCommandOperation(operation) ? operation.artifacts : [];
+/**
+ * Which operation shape this is. Reads `invocation` rather than a kind field,
+ * because an operation does not carry its interface's kind; the two shapes are
+ * distinguished by a required field only one of them declares.
+ */
+export const isCommandOperation = (operation) => 'invocation' in operation;
+/** The same question the other way round, for the callers that filter. */
+export const isApiOperation = (operation) => !isCommandOperation(operation);
+/**
+ * The operation's input channels paired with the shapes they declare.
+ *
+ * Callers take the pairs rather than a channel list they then index the
+ * request shape with. Indexing is what breaks under the operation union:
+ * TypeScript cannot prove that a channel name drawn from one kind's tuple is a
+ * key of the other kind's shape, and both ways around that are casts. Pairing
+ * dereferences the union once, here.
+ */
+export function requestChannelsOf(operation) {
+    if (isCommandOperation(operation)) {
+        return COMMAND_CHANNELS.map((channel) => ({
+            channel,
+            shape: operation.requestShape[channel],
+        }));
+    }
+    return TRANSPORT_CHANNELS.map((channel) => ({
+        channel,
+        shape: operation.requestShape[channel],
+    }));
+}
+/** The shape one named channel declares, or `undefined` off this kind. */
+export function requestShapeOf(operation, channel) {
+    return requestChannelsOf(operation).find((entry) => entry.channel === channel)
+        ?.shape;
+}
+/** The channel names an operation of this kind may declare inputs on. */
+export const inputChannelsOf = (operation) => isCommandOperation(operation) ? COMMAND_CHANNELS : TRANSPORT_CHANNELS;
+/**
+ * A step's bound channels paired with what each binds, for the same reason
+ * `requestChannelsOf` pairs: `InputBinding` is a union and a channel name
+ * drawn from one branch is not a key of the other.
+ *
+ * Ordered by `INPUT_CHANNELS` rather than by the parsed object's own key
+ * order, so which binding a check reports never depends on how the document
+ * happened to be written.
+ */
+export function boundChannelsOf(binding) {
+    const present = binding;
+    return INPUT_CHANNELS.filter((channel) => channel in binding).map((channel) => ({ channel, bound: present[channel] ?? null }));
+}
 /**
  * AD-10's exemption predicate. Any of a channel's three lists naming a key
  * counts: a permitted-only or types-only channel is still a surface a witness
  * can vary.
  */
 export function declaresNoRequestKeys(operation) {
-    return TRANSPORT_CHANNELS.every((channel) => {
-        const shape = operation.requestShape[channel];
-        return (shape.requiredKeys.length === 0 &&
-            shape.permittedKeys.length === 0 &&
-            Object.keys(shape.types).length === 0);
-    });
+    return requestChannelsOf(operation).every(({ shape }) => shape.requiredKeys.length === 0 &&
+        shape.permittedKeys.length === 0 &&
+        Object.keys(shape.types).length === 0);
 }
 /** Whether no channel declares a required key. */
 export function declaresNoRequiredKeys(operation) {
-    return TRANSPORT_CHANNELS.every((channel) => operation.requestShape[channel].requiredKeys.length === 0);
+    return requestChannelsOf(operation).every(({ shape }) => shape.requiredKeys.length === 0);
 }

package/dist/core/evaluate/evidence-resolution.d.ts

@@ -9,7 +9,7 @@ import type { EvalContract } from '../schemas/eval-contract.ts';
 import type { JsonValue } from '../schemas/primitives.ts';
 import type { Observation } from '../schemas/sealed-run-record.ts';
 import { type EvidenceTarget, type PlanIndex } from '../seal/plan-index.ts';
-import type { PointerDenotesCollection, ResolveOperand } from './resolution.ts';
+import type { PointerDenotesCollection, ReferenceSetKeys, ResolveOperand } from './resolution.ts';
 import { type ResolvedValue } from './resolved-value.ts';
 /**
  * A canonical RFC 6901 array-index token: no leading zero except "0" itself,
@@ -26,7 +26,7 @@ export declare const ARRAY_INDEX_PATTERN: RegExp;
  * falls through to `Object.prototype`. Any miss, type mismatch, or tail
  * running past a scalar collapses to `ABSENT` uniformly (AD-26).
  */
-export declare function walkTail(root: JsonValue, tail: readonly string[]): ResolvedValue;
+export declare function walkTail(root: ResolvedValue, tail: readonly string[]): ResolvedValue;
 /**
  * Decodes `BoundElementPointer`'s tail. "@/" is the shortest legal pointer
  * form and denotes the element itself. `decodeTail` special-cases only a
@@ -34,16 +34,7 @@ export declare function walkTail(root: JsonValue, tail: readonly string[]): Reso
  * calling it.
  */
 export declare function decodeBoundElementTail(pointer: string): readonly string[];
-/**
- * Selects the channel `target` names off one `Observation`. `stdout`/`stderr`
- * can carry a tail even though they're bare strings; `walkTail` already
- * resolves any non-empty tail against a string to `ABSENT`, so no special
- * case is needed here.
- *
- * Exported so `core/score/bindings.ts` reads a captured pointer's channel off
- * an observation through this one spelling, keeping the switch in one place.
- */
-export declare function channelRoot(observation: Observation, target: EvidenceTarget): JsonValue;
+export declare function channelRoot(observation: Observation, target: EvidenceTarget): ResolvedValue;
 /**
  * The `ResolveOperand`. `stepObservations` holds one already-selected
  * `Observation` per interaction step; `referenceSets` mirrors the contract's
@@ -52,6 +43,12 @@ export declare function channelRoot(observation: Observation, target: EvidenceTa
  * prototype-chain gotcha `walkTail` guards against.
  */
 export declare function makeResolveOperand(stepObservations: Readonly<Record<string, Observation>>, referenceSets: Readonly<Record<string, JsonValue[]>>): ResolveOperand;
+/**
+ * The `keys` a contract's reference sets declare. Built from the same
+ * `contract.referenceSets` the members map handed to `makeResolveOperand` is
+ * built from, so a set that resolves to members always has its keys here.
+ */
+export declare function referenceSetKeysOf(contract: EvalContract): ReferenceSetKeys;
 /**
  * Only `response-body` can ever answer `true` (AD-19: `collectionLocations`
  * is the only declared-collection surface, scoped to the body alone). The

package/dist/core/evaluate/evidence-resolution.js

@@ -5,7 +5,8 @@
  * bound-element `@/` form, and walk it into an already-selected
  * `Observation`.
  */
-import { buildPlanIndex, decodeTail, parseEvidenceTarget, } from '../seal/plan-index.js';
+import { targetsDescribedChannel } from '../declared-inputs.js';
+import { anyOperationOf, buildPlanIndex, decodeTail, parseEvidenceTarget, } from '../seal/plan-index.js';
 import { ABSENT } from './resolved-value.js';
 /**
  * A canonical RFC 6901 array-index token: no leading zero except "0" itself,
@@ -23,6 +24,12 @@ export const ARRAY_INDEX_PATTERN = /^(?:0|[1-9][0-9]*)$/;
  * running past a scalar collapses to `ABSENT` uniformly (AD-26).
  */
 export function walkTail(root, tail) {
+    // A root that did not resolve stays unresolved however short the tail is.
+    // The bare-pointer case is the one that matters: without this, an absent
+    // channel with no tail returned its own root and a caller could not tell it
+    // from a resolved value.
+    if (root === ABSENT)
+        return ABSENT;
     let current = root;
     for (const token of tail) {
         if (current === null || typeof current !== 'object')
@@ -53,14 +60,29 @@ export function decodeBoundElementTail(pointer) {
     return tailSource === '/' ? [] : decodeTail(tailSource);
 }
 /**
- * Selects the channel `target` names off one `Observation`. `stdout`/`stderr`
- * can carry a tail even though they're bare strings; `walkTail` already
- * resolves any non-empty tail against a string to `ABSENT`, so no special
- * case is needed here.
+ * Selects the channel `target` names off one `Observation`.
+ *
+ * `stdout`, `stderr`, and each written artifact are tagged, so a channel a
+ * harness captured as JSON resolves to the value and a tail walks into it,
+ * while one captured as text resolves to the string and a tail over it
+ * resolves `ABSENT`. That is what makes a command operation's nominated output
+ * channel resolvable at score time on the same terms as a response body.
  *
  * Exported so `core/score/bindings.ts` reads a captured pointer's channel off
  * an observation through this one spelling, keeping the switch in one place.
  */
+/**
+ * The value a tagged observed channel resolves to.
+ *
+ * A JSON body resolves to the value itself, so a tail walks into it; text
+ * resolves to the string, so a tail over it resolves `ABSENT` through
+ * `walkTail`, which is the truthful answer for output nothing parsed. An absent
+ * channel resolves to `ABSENT` and never to `null`: the tag exists precisely to
+ * tell "nothing was observed here" from "a value that was JSON null", and
+ * collapsing the two would make `existence` answer true for a file the run
+ * never wrote, since AD-26 counts `null` as present.
+ */
+const observedValue = (body) => body.kind === 'absent' ? ABSENT : body.value;
 export function channelRoot(observation, target) {
     switch (target.channel) {
         case 'response-body':
@@ -70,9 +92,9 @@ export function channelRoot(observation, target) {
         case 'response-status':
             return observation.responseStatus;
         case 'stdout':
-            return observation.stdout;
+            return observedValue(observation.stdout);
         case 'stderr':
-            return observation.stderr;
+            return observedValue(observation.stderr);
         case 'exit-code':
             return observation.exitCode;
         case 'call-inputs': {
@@ -84,6 +106,27 @@ export function channelRoot(observation, target) {
             }
             return observation.callInputs[transportChannel];
         }
+        case 'artifact': {
+            const { artifactId } = target;
+            if (artifactId === null) {
+                // parseEvidenceTarget sets artifactId exactly when the channel
+                // is 'artifact', so this throw should never fire.
+                throw new TypeError('artifact evidence target names no artifact');
+            }
+            // `Object.hasOwn` for the reason this module's header gives for
+            // `stepObservations` and `referenceSets`: `Identifier` admits
+            // `constructor`, `toString` and `valueOf`, so a bare index on an
+            // unwritten file of one of those names resolves to an inherited
+            // function rather than to nothing.
+            //
+            // A file the run did not write is absent evidence, not a `null`
+            // value. `null` would read as present under AD-26 and invert every
+            // oracle asserting the file exists or does not.
+            if (!Object.hasOwn(observation.artifacts, artifactId))
+                return ABSENT;
+            const written = observation.artifacts[artifactId];
+            return written === undefined ? ABSENT : observedValue(written);
+        }
     }
 }
 /**
@@ -118,6 +161,17 @@ export function makeResolveOperand(stepObservations, referenceSets) {
         return walkTail(channelRoot(observation, target), target.tail);
     };
 }
+/**
+ * The `keys` a contract's reference sets declare. Built from the same
+ * `contract.referenceSets` the members map handed to `makeResolveOperand` is
+ * built from, so a set that resolves to members always has its keys here.
+ */
+export function referenceSetKeysOf(contract) {
+    return Object.fromEntries(Object.entries(contract.referenceSets ?? {}).map(([id, set]) => [
+        id,
+        set.keys,
+    ]));
+}
 function tokensEqual(a, b) {
     return a.length === b.length && a.every((token, index) => token === b[index]);
 }
@@ -140,14 +194,20 @@ export function makePointerDenotesCollection(contract, providedIndex) {
         if (pointer.startsWith('@'))
             return false;
         const target = parseEvidenceTarget(pointer);
-        if (target.channel !== 'response-body')
-            return false;
         const step = getIndex().stepOf(target.stepId);
         if (step === undefined)
             return false;
-        const operation = getIndex().operationOf(step.operationId);
+        const operation = anyOperationOf(getIndex(), step.operationId);
         if (operation === undefined)
             return false;
+        // The channel is tested against the operation's own descriptor rather
+        // than against `response-body`. AD-4's empty-collection resolution
+        // applies to whichever channel an operation says carries its declared
+        // collections, and hard-coding the body left it inapplicable to every
+        // command contract: a quantifier over an empty declared collection
+        // resolved `false` instead of `insufficient-evidence`.
+        if (!targetsDescribedChannel(operation, target))
+            return false;
         const { collectionLocations } = operation.responseDescriptor;
         if (collectionLocations === null)
             return false;

package/dist/core/evaluate/operators.d.ts

@@ -31,6 +31,18 @@ export declare function setMembership(value: ResolvedValue, set: JsonValue[], ar
  * single element to search for: this function receives resolved values only,
  * so it cannot tell a `{ literal }` array from a resolved `{ referenceSet }`.
  * Known, accepted limitation.
+ *
+ * A separate property, and a separate limitation: a `{ referenceSet }`
+ * candidate matches **whole declared members** by structural equality. A
+ * container element carrying any field the reference set does not declare
+ * therefore never matches, which is the ordinary case for rows read off a
+ * response body. `set-membership`'s set position projects a reference set to
+ * its single declared key and this position does not, because projecting only
+ * where a container happens to hold objects would make the operand's meaning
+ * depend on the evidence's runtime shape. An author reconciling rows against a
+ * declared set wants `covers-by-key`, which compares on named keys on both
+ * sides, or `for-all(rows, set-membership(@/key, { referenceSet }))`, which
+ * reads the declared key.
  */
 export declare function containment(container: ResolvedValue, candidate: ResolvedValue | JsonValue[], artifactPath: string): boolean;
 /**
@@ -62,6 +74,16 @@ export declare function countTolerance(collection: ResolvedValue, expected: numb
  * that is required and not permitted reaches here and fails every value.
  */
 export declare function shape(value: ResolvedValue, descriptor: KeyedShapeDescriptor, _artifactPath: string): boolean;
+/**
+ * Own-property lookup only, so a key like `__proto__` reads as missing
+ * rather than inherited. Returns `ABSENT`, never throws (AD-4: a missing key
+ * resolves `false`, not an error).
+ *
+ * Exported so `resolution.ts`'s `set-membership` set-operand projection reads
+ * a declared member's key through this one spelling, keeping the own-property
+ * guard in one place.
+ */
+export declare function keyValueOf(element: JsonValue, key: string): JsonValue | typeof ABSENT;
 /**
  * AD-4's bijection: equal cardinality and a distinct `actual` match per
  * `expected` element on the named keys. `ABSENT` on either side resolves

package/dist/core/evaluate/operators.js

@@ -90,6 +90,18 @@ export function setMembership(value, set, artifactPath) {
  * single element to search for: this function receives resolved values only,
  * so it cannot tell a `{ literal }` array from a resolved `{ referenceSet }`.
  * Known, accepted limitation.
+ *
+ * A separate property, and a separate limitation: a `{ referenceSet }`
+ * candidate matches **whole declared members** by structural equality. A
+ * container element carrying any field the reference set does not declare
+ * therefore never matches, which is the ordinary case for rows read off a
+ * response body. `set-membership`'s set position projects a reference set to
+ * its single declared key and this position does not, because projecting only
+ * where a container happens to hold objects would make the operand's meaning
+ * depend on the evidence's runtime shape. An author reconciling rows against a
+ * declared set wants `covers-by-key`, which compares on named keys on both
+ * sides, or `for-all(rows, set-membership(@/key, { referenceSet }))`, which
+ * reads the declared key.
  */
 export function containment(container, candidate, artifactPath) {
     if (container === ABSENT)
@@ -287,8 +299,12 @@ export function shape(value, descriptor, _artifactPath) {
  * Own-property lookup only, so a key like `__proto__` reads as missing
  * rather than inherited. Returns `ABSENT`, never throws (AD-4: a missing key
  * resolves `false`, not an error).
+ *
+ * Exported so `resolution.ts`'s `set-membership` set-operand projection reads
+ * a declared member's key through this one spelling, keeping the own-property
+ * guard in one place.
  */
-function keyValueOf(element, key) {
+export function keyValueOf(element, key) {
     if (!isPlainObject(element) || !Object.hasOwn(element, key))
         return ABSENT;
     // `Object.hasOwn` above already proves the key is present; `noUncheckedIndexedAccess`

package/dist/core/evaluate/resolution.d.ts

@@ -3,8 +3,9 @@
  * that turns an `Expression` into one `CheckResolutionValue`. Leaf operators,
  * `covers-by-key` included, live in `operators.ts`. Operand resolution, every
  * pointer form including the bound-element `@/` form, is injected;
- * `evidence-resolution.ts` supplies it, and `ResolveOperand` and
- * `PointerDenotesCollection` are the consumer-side contract it satisfies.
+ * `evidence-resolution.ts` supplies it, and `ResolveOperand`,
+ * `PointerDenotesCollection`, and `ReferenceSetKeys` are the consumer-side
+ * contract it satisfies.
  */
 import type { CheckResolutionValue } from '../schemas/evidence-artifact.ts';
 import type { Expression, Operand } from '../schemas/expression.ts';
@@ -31,10 +32,20 @@ export type ResolveOperand = (operand: Operand, boundElement: ResolvedValue, art
  * soft-delete agreement pair (AD-4's own worked example).
  */
 export type PointerDenotesCollection = (pointer: string) => boolean;
+/**
+ * The `keys` each declared reference set names, by identifier.
+ * `set-membership`'s set position reads the single declared key off each
+ * member (`reference-set.ts`), and the members map the injected
+ * `ResolveOperand` closes over has already discarded the keys, so they travel
+ * separately. Plain data, because `PreflightPlan` carries this through to
+ * its reducer and is compared by value, which a closure fails.
+ * `evidence-resolution.ts` builds it from a contract.
+ */
+export type ReferenceSetKeys = Readonly<Record<string, readonly string[]>>;
 /**
  * The public entry point. Walks `expression` and produces one
  * `CheckResolutionValue`, exactly what `Outcome.checkResolution` needs,
  * unmodified. `boundElement` starts `ABSENT` at the root, where no quantifier
  * has bound anything yet.
  */
-export declare function resolveCheck(expression: Expression, resolveOperand: ResolveOperand, pointerDenotesCollection: PointerDenotesCollection, regexMatchStepBudget: number, artifactPath: string): CheckResolutionValue;
+export declare function resolveCheck(expression: Expression, resolveOperand: ResolveOperand, pointerDenotesCollection: PointerDenotesCollection, referenceSetKeys: ReferenceSetKeys, regexMatchStepBudget: number, artifactPath: string): CheckResolutionValue;

package/dist/core/evaluate/resolution.js

@@ -1,4 +1,4 @@
-import { absence, containment, countTolerance, coversByKey, deepEquality, equality, existence, ordering, regexMatch, setMembership, shape, } from './operators.js';
+import { absence, containment, countTolerance, coversByKey, deepEquality, equality, existence, keyValueOf, ordering, regexMatch, setMembership, shape, } from './operators.js';
 import { ABSENT } from './resolved-value.js';
 /**
  * AD-4's one closed introduction condition, checked per operand and applied
@@ -242,10 +242,69 @@ function resolveRegexNode(expression, boundElement, ctx) {
     const { pattern } = expression;
     return resolveSingleOperand(operand, boundElement, ctx, (resolved) => regexMatch(resolved, pattern, ctx.regexMatchStepBudget, ctx.artifactPath));
 }
+/**
+ * Reads the single declared key off each member of a `{ referenceSet }` set
+ * operand. `reference-set.ts` declares members as objects so one declaration
+ * serves both operators, and states that "a `set-membership` operand against
+ * the same set reads the single named key". This is where that reading
+ * happens, and without it AD-20 rule 6's injection form can never answer
+ * `true`: the value operand resolves to a scalar, and `setMembership` compares
+ * whole members by digest, so a scalar against an object is always `false`.
+ *
+ * Scoped to this one operator position on purpose. `covers-by-key` projects
+ * both sides itself on `expectedKey` and `actualKey`, and `containment`
+ * matches whole members, so both want the members unprojected. The injected
+ * `ResolveOperand` is handed one operand at a time and cannot see which
+ * operator position it is filling, which is why the projection lives at the
+ * resolution site.
+ *
+ * The option turned down: an explicit `memberKey` field on `set-membership`
+ * mirroring `covers-by-key`'s `expectedKey`. It is symmetric with its sibling
+ * and it carries a multi-key set, at the price of a grammar change to a
+ * published artifact, an eval-contract `schemaVersion` bump, and
+ * published-schema drift, for a case no shipped contract has. Revisit it the
+ * first time a real contract wants a multi-key set in this position.
+ *
+ * Both throws are unreachable for a compiled contract:
+ * `checkOperandLegality` rejects a multi-key reference set in this position,
+ * and a member missing the declared key, under
+ * `malformed-operator-expression`. They throw, because a set this function
+ * cannot project carries no membership answer to give.
+ */
+function projectSetOperand(resolvedSet, setOperand, ctx) {
+    if (!('referenceSet' in setOperand))
+        return resolvedSet;
+    const { referenceSet } = setOperand;
+    // `Object.hasOwn`, the same prototype-chain guard `makeResolveOperand`
+    // applies to its own maps: `Identifier`'s charset admits `constructor`.
+    const keys = Object.hasOwn(ctx.referenceSetKeys, referenceSet)
+        ? ctx.referenceSetKeys[referenceSet]
+        : undefined;
+    // No declared keys means the contract declares no such reference set,
+    // which compilation rejects under `unresolved-reference-set`; a non-array
+    // is the array guard below reporting whatever the resolver returned. Both
+    // pass through so exactly one guard speaks for each.
+    if (keys === undefined || !Array.isArray(resolvedSet))
+        return resolvedSet;
+    if (keys.length !== 1) {
+        throw new Error(`set-membership's set-operand projection: referenceSet "${referenceSet}" declares ${keys.length} keys, and this position reads exactly one. A multi-key set here is malformed-operator-expression, which compilation rejects.`);
+    }
+    const key = keys[0];
+    return resolvedSet.map((member) => {
+        const keyValue = keyValueOf(member, key);
+        if (keyValue === ABSENT) {
+            throw new Error(`set-membership's set-operand projection: a member of referenceSet "${referenceSet}" carries no own property "${key}", the key it declares. That is malformed-operator-expression, which compilation rejects.`);
+        }
+        return keyValue;
+    });
+}
 function resolveSetMembershipNode(expression, boundElement, ctx) {
     const [valueOperand, setOperand] = expression.operands;
     const value = ctx.resolveOperand(valueOperand, boundElement, ctx.artifactPath);
-    const resolvedSet = ctx.resolveOperand(setOperand, boundElement, ctx.artifactPath);
+    // Projected before the empty-collection interception and the array guard
+    // below, so both read the one value the operator will see. Projection
+    // preserves length and array-ness, so neither answer moves.
+    const resolvedSet = projectSetOperand(ctx.resolveOperand(setOperand, boundElement, ctx.artifactPath), setOperand, ctx);
     if (anyOperandEmpty([
         { operand: valueOperand, resolved: value },
         { operand: setOperand, resolved: resolvedSet },
@@ -326,10 +385,11 @@ function resolveNode(expression, boundElement, ctx) {
  * unmodified. `boundElement` starts `ABSENT` at the root, where no quantifier
  * has bound anything yet.
  */
-export function resolveCheck(expression, resolveOperand, pointerDenotesCollection, regexMatchStepBudget, artifactPath) {
+export function resolveCheck(expression, resolveOperand, pointerDenotesCollection, referenceSetKeys, regexMatchStepBudget, artifactPath) {
     return resolveNode(expression, ABSENT, {
         resolveOperand,
         pointerDenotesCollection,
+        referenceSetKeys,
         regexMatchStepBudget,
         artifactPath,
     });

package/dist/core/excluded-content.d.ts

@@ -0,0 +1,65 @@
+/**
+ * AD-18's excluded categories, as patterns that read a value rather than a name.
+ *
+ * AD-18 excludes "credentials, tokens, real names, email addresses, account
+ * identifiers, and transaction content" from every artifact this package
+ * produces or publishes, and binds "published examples and test fixtures as
+ * strictly as real runs". Until this module the whole prohibition was carried by
+ * one test that scans `corpus/dev`, so a contract carrying a live-shaped token
+ * compiled clean and the token travelled into the sealed brief.
+ *
+ * Only the value-shaped half of that scan ships here, and the split is the point
+ * rather than an economy. AD-18's own reading of the rule for the header channel
+ * is that a declaration "names the header and its type and never carries a
+ * credential value", so a name is what an author is supposed to write: an
+ * operation declaring a `password` body key or an `Authorization` header is a
+ * contract for an authentication API, and a gate matching `\bpassword\b` would
+ * reject exactly the systems this package exists to evaluate. The patterns below
+ * therefore match only strings whose shape is decidable without knowing what
+ * field they sit in: a PEM header, a token with an issuer prefix, an address, a
+ * checkable account number, a card-shaped digit run. The name-shaped patterns
+ * stay in `tests/architecture/dev-corpus.test.ts`, where review rather than a
+ * compiler decides.
+ *
+ * Each pattern carries a string it must fire on, and a test asserts every one
+ * still does. A pattern that has rotted into a regex matching nothing is worse
+ * than no pattern: it reports clean forever.
+ */
+/** AD-18's six categories, in the rule's own order. */
+export declare const EXCLUDED_CATEGORIES: readonly ['credentials', 'tokens', 'real names', 'email addresses', 'account identifiers', 'transaction content'];
+export type ExcludedCategory = (typeof EXCLUDED_CATEGORIES)[number];
+export type ExcludedContentPattern = {
+    readonly category: ExcludedCategory;
+    readonly regex: RegExp;
+    /** a string the pattern must match, so a rotted pattern fails its own test. */
+    readonly fires: string;
+};
+/**
+ * `real names` has no member here and never will: a personal name has no surface
+ * form, so every pattern that reaches one reads the field that carries it, which
+ * is a name-shaped test. The category stays in the tuple above because AD-18
+ * names six and dropping one from the vocabulary would make the gate look total.
+ */
+export declare const EXCLUDED_VALUE_PATTERNS: readonly ExcludedContentPattern[];
+export type ExcludedContentHit = {
+    readonly category: ExcludedCategory;
+    /** the artifact-rooted path of the string that matched. */
+    readonly path: string;
+    /** the matched run, which is short by construction and is what a caller redacts. */
+    readonly match: string;
+};
+/**
+ * Every string anywhere inside one value, against every value-shaped pattern.
+ *
+ * Object keys are walked as paths and never scanned as content: a key is a name
+ * by construction, which is the same line the pattern set is drawn on. The walk
+ * is total over JSON and stops at nothing, so a token nested under a body
+ * example twelve levels down is found; the first matching category per string
+ * wins, since one string reported six times says nothing more than once.
+ *
+ * Order is the walk's order, which for an object is its own key order. A caller
+ * that needs a stable report over two spellings of the same object sorts what
+ * comes back; the compile gate below reads only the first hit and never the
+ * order.
+ */
+export declare function scanExcludedContent(value: unknown, path: string): readonly ExcludedContentHit[];