@worker-protocol/conformance 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Rowing Tech, S.A.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,9 @@
+worker-protocol
+Copyright 2026 Rowing Tech, S.A.
+
+This product includes software developed at Rowing Tech, S.A. (https://rowing.tech).
+
+Licensed under the Apache License, Version 2.0. See LICENSE for the full text.
+
+"worker-protocol" and any conformance claim made in its name are not licensed under Apache-2.0;
+see section 6 of the License.

package/dist/attribution.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Which rule a failure at a place in a document belongs to.
+ *
+ * The map is generated from `schemas/` by `src/generate-rules.ts`, which reads the leading rule id
+ * off each node's `description`. Nothing is decided here: this file only walks a path against what
+ * the normative artifact already says, so that a report names the obligation that was broken
+ * rather than announcing that a document is invalid.
+ *
+ * A segment the schema has nothing to say about — a key under `additionalProperties`, which is the
+ * Worker's own — matches `*`.
+ */
+export type Attribution = Record<string, Record<string, string>>;
+export declare function ruleFor(attribution: Attribution, schema: string, path: PropertyKey[]): string | null;

package/dist/attribution.js

@@ -0,0 +1,27 @@
+export function ruleFor(attribution, schema, path) {
+    const map = attribution[schema];
+    if (map === undefined)
+        return null;
+    // The deepest node on the path that cites a rule. Walking rather than looking up the whole path
+    // is what lets a failure deep inside a member the schema says nothing finer about still land on
+    // the rule that governs the member — a report that is coarse where the schema is coarse, and
+    // never more precise than the document it derives from.
+    let found = map[""] ?? null;
+    let prefix = "";
+    for (const segment of path) {
+        const literal = prefix === "" ? String(segment) : `${prefix}/${String(segment)}`;
+        const wildcard = prefix === "" ? "*" : `${prefix}/*`;
+        if (map[literal] !== undefined) {
+            prefix = literal;
+            found = map[literal];
+        }
+        else if (map[wildcard] !== undefined) {
+            prefix = wildcard;
+            found = map[wildcard];
+        }
+        else {
+            break;
+        }
+    }
+    return found;
+}

package/dist/checks/actions.d.ts

@@ -0,0 +1,24 @@
+import { type Attribution } from "../attribution.ts";
+import type { Arrangement } from "../index.ts";
+import { type Result, type Rule } from "../report.ts";
+import type { Transcript } from "../transcript.ts";
+/**
+ * The `actions` Capability.
+ *
+ * **This is the first check in the verifier that sends a POST, and it asks permission first.**
+ * Every other surface here is read: a GET establishes what it establishes and leaves the Worker as
+ * it found it. An Action is an operation somebody's operators chose to expose, and a tool that
+ * posted to one uninvited would be performing work on a system it was pointed at to inspect —
+ * which is not a thing a conformance report is worth. So every probe that posts is behind
+ * `mayPerform`, and without it those rules report `notExercised` with the reason.
+ *
+ * The refusals below perform nothing even when they are allowed — an Action name no entry
+ * declares, a request naming none, an input no schema could accept — but the request is still a
+ * POST to somebody's Worker, and whether that is acceptable is theirs to say rather than this
+ * tool's to assume.
+ */
+export declare const CLAIMS: readonly ["ACT-16", "ACT-2", "ACT-3", "ACT-4", "ACT-6", "ACT-7", "ACT-8", "ACT-12", "ACT-15", "DESC-11", "ENDP-3", "ENDP-15", "ENDP-18", "REG-31", "ACT-5", "ACT-9", "ACT-10", "ACT-11", "ENDP-12", "ENDP-16", "ENDP-17"];
+export declare function checkActions(entry: Record<string, unknown> | undefined, url: string | null, descriptorUrl: string, rules: Map<string, Rule>, attribution: Attribution, transcript: Transcript, mayPerform: boolean, arrangement: Arrangement): Promise<{
+    results: Result[];
+    addresses: string[];
+}>;

package/dist/checks/actions.js

@@ -0,0 +1,345 @@
+import { actionsEntry } from "@worker-protocol/schemas";
+import { ruleFor } from "../attribution.js";
+import { verdicts } from "../report.js";
+/**
+ * The `actions` Capability.
+ *
+ * **This is the first check in the verifier that sends a POST, and it asks permission first.**
+ * Every other surface here is read: a GET establishes what it establishes and leaves the Worker as
+ * it found it. An Action is an operation somebody's operators chose to expose, and a tool that
+ * posted to one uninvited would be performing work on a system it was pointed at to inspect —
+ * which is not a thing a conformance report is worth. So every probe that posts is behind
+ * `mayPerform`, and without it those rules report `notExercised` with the reason.
+ *
+ * The refusals below perform nothing even when they are allowed — an Action name no entry
+ * declares, a request naming none, an input no schema could accept — but the request is still a
+ * POST to somebody's Worker, and whether that is acceptable is theirs to say rather than this
+ * tool's to assume.
+ */
+export const CLAIMS = [
+    "ACT-16",
+    "ACT-2",
+    "ACT-3",
+    "ACT-4",
+    "ACT-6",
+    "ACT-7",
+    "ACT-8",
+    "ACT-12",
+    "ACT-15",
+    "DESC-11",
+    "ENDP-3",
+    "ENDP-15",
+    "ENDP-18",
+    "REG-31",
+    // Only observable against a Worker whose operators arranged one, and said so.
+    "ACT-5",
+    "ACT-9",
+    "ACT-10",
+    "ACT-11",
+    "ENDP-12",
+    "ENDP-16",
+    "ENDP-17",
+];
+export async function checkActions(entry, url, descriptorUrl, rules, attribution, transcript, mayPerform, arrangement) {
+    const { results, say, allExcept } = verdicts(rules, CLAIMS);
+    const addresses = [];
+    if (entry === undefined) {
+        allExcept("notExercised", "the Worker declares no `actions`");
+        return { results, addresses };
+    }
+    // ACT-16 to ACT-4, ACT-12 and ENDP-15 are read off the Descriptor, and a verifier fails the
+    // Worker on them without sending anything at all.
+    const declared = actionsEntry.safeParse(entry);
+    if (!declared.success) {
+        const blamed = new Set();
+        for (const issue of declared.error.issues) {
+            const id = ruleFor(attribution, "actions-entry", issue.path) ?? "ACT-16";
+            if (blamed.has(id))
+                continue;
+            blamed.add(id);
+            say(id, "fails", `${issue.path.join(".") || "(root)"}: ${issue.message}`);
+        }
+        allExcept("notExercised", "the `actions` entry did not validate", [...blamed]);
+        return { results, addresses };
+    }
+    const { accepts: actions } = declared.data;
+    for (const id of ["ACT-16", "ACT-2", "ACT-3", "ACT-4"])
+        say(id, "passes");
+    // ACT-12 and ENDP-15 are the same declaration seen from two files: ENDP-15 requires it and
+    // ACT-12 says where it lives and what it carries. Where no Action takes a key there is nothing
+    // to judge, and saying so is not the same as passing.
+    const withKeys = Object.entries(actions).filter(([, a]) => a.idempotency !== undefined);
+    if (withKeys.length === 0) {
+        say("ACT-12", "notExercised", "no Action declares an idempotency key");
+        say("ENDP-15", "notExercised", "no Action declares an idempotency key");
+        say("DESC-11", "notExercised", "no Capability declares a behaviour conditional on a call");
+    }
+    else {
+        // The schema made the half-set state unspellable — `from: "input"` with no member named is a
+        // document nobody can write — so validating it IS the check.
+        say("ACT-12", "passes");
+        say("ENDP-15", "passes");
+        // DESC-11: where a Capability's behaviour on a call is conditional, the condition is declared
+        // in its entry. An idempotency declaration is that rule's first case.
+        say("DESC-11", "passes");
+    }
+    // ACT-15: a Worker that declares `configure` declares a reading address for it, and a GET of
+    // that address answers a document its own `configure` would accept. Without it a console renders
+    // an empty form and an operator replaces everything they did not remember.
+    const configure = actions.configure;
+    if (configure === undefined) {
+        say("ACT-15", "notExercised", "the Worker declares no `configure`");
+    }
+    else if (typeof configure.readAddress !== "string" || configure.readAddress.length === 0) {
+        say("ACT-15", "fails", "`configure` is declared with no reading address");
+    }
+    else if (url === null) {
+        say("ACT-15", "notExercised", "the `actions` address did not resolve");
+    }
+    else {
+        // DESC-12 resolves a relative reference against the URL THE DESCRIPTOR WAS READ FROM, not
+        // against the Capability's own address. The two coincide for a Worker at the origin root and
+        // diverge the moment one is mounted under a path, which is the case that catches it.
+        const target = new URL(configure.readAddress, descriptorUrl).toString();
+        // ENDP-1: every address a caller uses is one the Descriptor declared, and this one is — inside
+        // the Action that declared it rather than beside the Capability. Each Capability knows where
+        // its own addresses live, which is why it hands them back rather than being guessed at.
+        addresses.push(target);
+        const answer = await transcript.send(target, "the `configure` reading address");
+        if (answer.status !== 200) {
+            say("ACT-15", "fails", `${target} answered ${answer.status}`);
+        }
+        else if (answer.json === null || typeof answer.json !== "object") {
+            say("ACT-15", "fails", "the reading address did not answer a document");
+        }
+        else {
+            say("ACT-15", "passes");
+        }
+    }
+    if (url === null) {
+        allExcept("notExercised", "the `actions` address did not resolve", [
+            "ACT-16",
+            "ACT-2",
+            "ACT-3",
+            "ACT-4",
+            "ACT-12",
+            "ACT-15",
+            "DESC-11",
+            "ENDP-15",
+        ]);
+        return { results, addresses };
+    }
+    if (!mayPerform) {
+        for (const id of [
+            "ACT-6",
+            "ACT-7",
+            "ACT-8",
+            "ENDP-3",
+            "ENDP-18",
+            "REG-31",
+            "ACT-5",
+            "ACT-9",
+            "ACT-10",
+            "ACT-11",
+            "ENDP-12",
+            "ENDP-16",
+            "ENDP-17",
+        ]) {
+            say(id, "notExercised", "the verifier was not permitted to POST to this Worker");
+        }
+        return { results, addresses };
+    }
+    const post = (parameters, body, intent, extra = {}) => transcript.send(`${url}${parameters}`, intent, { method: "POST", body, ...extra });
+    const code = (answer) => answer.json?.code;
+    // ACT-7: a request naming no Action has not said what it wants, which is a parameter fault.
+    const unnamed = await post("", "{}", "a POST naming no Action", { permanent: true });
+    if (unnamed.status === 400 && code(unnamed) === "invalid_parameter")
+        say("ACT-7", "passes");
+    else
+        say("ACT-7", "fails", `answered ${unnamed.status} with \`${code(unnamed) ?? "no code"}\``);
+    // ENDP-3: everything that changes state is POST, on an address declared for the purpose. The
+    // witness is the converse — the address answers a POST, and does not serve the same operation
+    // to a GET, which ENDP-2 reserves for reads that change nothing.
+    const asRead = await transcript.send(`${url}?action=${encodeURIComponent(Object.keys(actions)[0] ?? "x")}`, "the Actions address as a GET");
+    if (unnamed.status !== 404 && asRead.status === 404)
+        say("ENDP-3", "passes");
+    else if (asRead.status !== 404)
+        say("ENDP-3", "fails", `a GET of the Actions address answered ${asRead.status}`);
+    else
+        say("ENDP-3", "fails", "the Actions address does not answer a POST");
+    // REG-31 recommends a credential on every address that changes state. A write accepted from the
+    // world is an operation performed by anyone who asks — and this protocol has published the
+    // address and the schema of every one of them in the Descriptor, which is the hard half of the
+    // attacker's work already done. It recommends rather than binds because it is advice about a
+    // deployment's exposure: every call to a Worker that ignores it still succeeds.
+    const uncredentialed = await transcript.send(`${url}?action=${encodeURIComponent(Object.keys(actions)[0] ?? "x")}`, "a POST with no credential at all", {
+        method: "POST",
+        body: "[]",
+        headers: { authorization: "" },
+        permanent: true,
+    });
+    if (uncredentialed.status === 401 || uncredentialed.status === 403)
+        say("REG-31", "passes");
+    else
+        say("REG-31", "fails", `a POST with no credential answered ${uncredentialed.status}`);
+    // ACT-6: an Action the entry does not declare is a resource that does not exist, and nothing is
+    // performed on the way to finding that out.
+    const absent = await post("?action=no-such-action-b7d2", "{}", "an Action the entry does not declare", { permanent: true });
+    if (absent.status === 404 && code(absent) === "not_found")
+        say("ACT-6", "passes");
+    else
+        say("ACT-6", "fails", `answered ${absent.status} with \`${code(absent) ?? "no code"}\``);
+    const [name, declaration] = Object.entries(actions)[0] ?? [];
+    if (name === undefined || declaration === undefined) {
+        say("ACT-8", "notExercised", "the entry declares no Action to post to");
+        say("ENDP-18", "notExercised", "the entry declares no Action to post to");
+        return { results, addresses };
+    }
+    // ACT-8: an input that does not match the declared schema. The body is an empty ARRAY on
+    // purpose: it is the smallest document that no Action's input schema could describe, so a Worker
+    // that acted on it would have acted on no input at all. A conformance tool has to pick something
+    // to be refused, and this is the one thing that cannot be mistaken for a request to do work.
+    //
+    // A key travels with it where the Action declares one. Two faults are present otherwise — a body
+    // that does not match AND a required key that is absent — and no rule fixes which a Worker names
+    // first, so a probe that provoked both would be asking a question the specification does not
+    // answer and failing whichever Worker answered it the other way. ENDP-18 has its own probe below.
+    const mismatched = await post(`?action=${encodeURIComponent(name)}`, "[]", "an input no schema could accept", {
+        permanent: true,
+        ...(declaration.idempotency === undefined
+            ? {}
+            : { headers: { "idempotency-key": `conformance-mismatch-${Date.now()}` } }),
+    });
+    if (mismatched.status === 400 && code(mismatched) === "schema_mismatch")
+        say("ACT-8", "passes");
+    else
+        say("ACT-8", "fails", `answered ${mismatched.status} with \`${code(mismatched) ?? "no code"}\``);
+    // ENDP-18: a required key that is absent is `400`. A Worker that performs the Action anyway has
+    // performed exactly the operation the key existed to protect.
+    const needsKey = Object.entries(actions).find(([, a]) => a.idempotency?.required === true);
+    if (needsKey === undefined) {
+        say("ENDP-18", "notExercised", "no Action requires an idempotency key");
+    }
+    else {
+        const [keyed] = needsKey;
+        const without = await post(`?action=${encodeURIComponent(keyed)}`, "[]", "an Action that requires a key, with none", { permanent: true });
+        if (without.status === 400 && code(without) === "idempotency_key_required") {
+            say("ENDP-18", "passes");
+        }
+        else {
+            say("ENDP-18", "fails", `answered ${without.status} with \`${code(without) ?? "no code"}\``);
+        }
+    }
+    await checkArranged(actions, arrangement, mismatched.status, post, say);
+    return { results, addresses };
+}
+/**
+ * The rules that need a Worker arranged for them, and told to the verifier.
+ *
+ * Every probe above is refused by design and performs nothing. These are the opposite: they ask a
+ * Worker to actually do something, so they need TWO consents — `mayPerform`, and an operator
+ * naming which Action is safe. Without both, each reports what was missing.
+ */
+async function checkArranged(actions, arrangement, mismatchedStatus, post, say) {
+    const code = (answer) => answer.json?.code;
+    const query = (name) => `?action=${encodeURIComponent(name)}`;
+    // ACT-5 and ACT-10: a performance that succeeds, answering `200` with the declared result or
+    // `204` where the Action declares none.
+    const safe = arrangement.safeAction;
+    if (safe === undefined) {
+        for (const id of ["ACT-5", "ACT-10", "ENDP-16", "ENDP-17"]) {
+            say(id, "notExercised", "no Action was named as safe to perform");
+        }
+    }
+    else {
+        const declaration = actions[safe.name];
+        const key = declaration?.idempotency !== undefined ? `conformance-${Date.now()}` : undefined;
+        const headers = key === undefined ? undefined : { "idempotency-key": key };
+        const body = JSON.stringify(safe.input);
+        const done = await post(query(safe.name), body, `the Action \`${safe.name}\``, { headers });
+        const wantsResult = declaration?.result !== undefined;
+        if (done.status === 200 || done.status === 204) {
+            say("ACT-5", "passes");
+            if (wantsResult && done.status === 200)
+                say("ACT-10", "passes");
+            else if (!wantsResult && done.status === 204)
+                say("ACT-10", "passes");
+            else {
+                const expected = wantsResult ? "200 with its result" : "204";
+                say("ACT-10", "fails", `it declares ${wantsResult ? "a result" : "none"} and answered ${done.status}, not ${expected}`);
+            }
+        }
+        else {
+            say("ACT-5", "fails", `answered ${done.status} with \`${code(done) ?? "no code"}\``);
+            say("ACT-10", "notExercised", "the performance did not succeed");
+        }
+        if (key === undefined) {
+            for (const id of ["ENDP-16", "ENDP-17"]) {
+                say(id, "notExercised", `\`${safe.name}\` declares no idempotency key`);
+            }
+        }
+        else {
+            // ENDP-16: within the window, a repeat under the same key is not a second performance — the
+            // Worker answers the outcome it recorded.
+            const again = await post(query(safe.name), body, "the same Action under the same key", {
+                headers,
+            });
+            if (again.status === done.status && again.body === done.body)
+                say("ENDP-16", "passes");
+            else
+                say("ENDP-16", "fails", `the repeat answered ${again.status}, not the recorded outcome`);
+            // ENDP-17: a key reused with a different body is `409`. Only the caller can tell a retry
+            // from a genuine repeat, and this is the Worker refusing to guess.
+            const other = JSON.stringify({ ...safe.input, "conformance-probe": true });
+            const reused = await post(query(safe.name), other, "the same key with another body", {
+                headers,
+                permanent: true,
+            });
+            if (reused.status === 409)
+                say("ENDP-17", "passes");
+            else
+                say("ENDP-17", "fails", `answered ${reused.status}, not 409`);
+        }
+    }
+    // ACT-9 and ENDP-12: an input that matches the schema and that the Worker will not accept on its
+    // own rules. ENDP-12 needs BOTH halves — a 400 for a body it could not read and a 422 for one it
+    // read and refused — and the 400 came from the schema-mismatch probe above.
+    const refused = arrangement.refusedInput;
+    if (refused === undefined) {
+        say("ACT-9", "notExercised", "no input was named that this Worker refuses on its own rules");
+        say("ENDP-12", "notExercised", "nothing provoked a 422 to compare against the 400");
+    }
+    else {
+        const answer = await post(query(refused.name), JSON.stringify(refused.input), `\`${refused.name}\` with an input it refuses`, { permanent: true });
+        if (answer.status === 422 && code(answer) === "unprocessable_content") {
+            say("ACT-9", "passes");
+            if (mismatchedStatus === 400)
+                say("ENDP-12", "passes");
+            else
+                say("ENDP-12", "fails", `an unreadable body answered ${mismatchedStatus}, not 400`);
+        }
+        else {
+            say("ACT-9", "fails", `answered ${answer.status} with \`${code(answer) ?? "no code"}\``);
+            say("ENDP-12", "notExercised", "no 422 was provoked");
+        }
+    }
+    // ACT-11: an Action that declares it does not complete within the call answers `202` and no
+    // body. The declaration is read from the Descriptor, so a Worker that named the wrong Action
+    // here fails on what it itself declared.
+    const async = arrangement.asyncAction;
+    if (async === undefined) {
+        say("ACT-11", "notExercised", "no Action was named that does not complete within the call");
+    }
+    else if (actions[async.name]?.completesWithinCall !== false) {
+        say("ACT-11", "fails", `\`${async.name}\` declares that it DOES complete within the call`);
+    }
+    else {
+        const answer = await post(query(async.name), JSON.stringify(async.input), `\`${async.name}\`, which does not complete within the call`);
+        if (answer.status === 202 && answer.body.length === 0)
+            say("ACT-11", "passes");
+        else if (answer.status !== 202)
+            say("ACT-11", "fails", `answered ${answer.status}, not 202`);
+        else
+            say("ACT-11", "fails", "answered 202 with a body");
+    }
+}

package/dist/checks/activity.d.ts

@@ -0,0 +1,18 @@
+import { type Attribution } from "../attribution.ts";
+import { type Result, type Rule } from "../report.ts";
+import type { Transcript } from "../transcript.ts";
+/**
+ * The `activity` Capability.
+ *
+ * Alerts with the words changed, which is what `spec/activity.md` says it is: one address, one
+ * page, items that carry a closed-vocabulary state and a summary addressed to a person. What these
+ * checks can reach is exactly what a program can act on — that the page has the shape and that
+ * every state is one of the three.
+ *
+ * ACTV-5 is absent because nothing can reach it. An activity that disappears may have finished,
+ * failed, or been dropped, and no tool outside the Worker can tell which — the same shape as ALRT-5
+ * and TASK-15. ACTV-6 is `H` and lives in `arranged.ts` with ALRT-6, because two credentials have
+ * to exist before two lists can be compared.
+ */
+export declare const CLAIMS: readonly ["ACTV-1", "ACTV-2", "ACTV-3", "ACTV-4"];
+export declare function checkActivity(entry: Record<string, unknown> | undefined, url: string | null, rules: Map<string, Rule>, attribution: Attribution, transcript: Transcript): Promise<Result[]>;