@cat-factory/server 0.256.0 → 0.258.0

package/dist/modules/publicApi/openapiDocument.generated.js.map

@@ -1 +1 @@
-{"version":3,"file":"openapiDocument.generated.js","sourceRoot":"","sources":["../../../src/modules/publicApi/openapiDocument.generated.ts"],"names":[],"mappings":"AAAA,qFAAqF;AACrF,EAAE;AACF,0FAA0F;AAC1F,8FAA8F;AAC9F,8FAA8F;AAC9F,8EAA8E;AAE9E,MAAM,CAAC,MAAM,YAAY,GAAG,6xrgBAA6xrgB,CAAA"}
+{"version":3,"file":"openapiDocument.generated.js","sourceRoot":"","sources":["../../../src/modules/publicApi/openapiDocument.generated.ts"],"names":[],"mappings":"AAAA,qFAAqF;AACrF,EAAE;AACF,0FAA0F;AAC1F,8FAA8F;AAC9F,8FAA8F;AAC9F,8EAA8E;AAE9E,MAAM,CAAC,MAAM,YAAY,GAAG,uomjBAAuomjB,CAAA"}

package/dist/modules/publicApi/specProjection.d.ts

@@ -0,0 +1,11 @@
+import { type PublicServiceSpec, type PublicSpecAnchor, type PublicSpecProvenance, type ServiceSpecView } from '@cat-factory/contracts';
+/**
+ * Project a read view onto the wire, under `anchor`.
+ *
+ * The anchor is passed IN rather than re-derived: the caller is where the four outcomes are
+ * separated (an unreadable repository never reaches here at all), and a projection that recomputed
+ * it from `view.present` would be a second opinion on the one judgement this endpoint exists to
+ * make.
+ */
+export declare function toPublicServiceSpec(serviceId: string, anchor: PublicSpecAnchor, view: ServiceSpecView, provenance: PublicSpecProvenance): PublicServiceSpec;
+//# sourceMappingURL=specProjection.d.ts.map

package/dist/modules/publicApi/specProjection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"specProjection.d.ts","sourceRoot":"","sources":["../../../src/modules/publicApi/specProjection.ts"],"names":[],"mappings":"AAAA,OAAO,EAQL,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EAErB,KAAK,oBAAoB,EAIzB,KAAK,eAAe,EAGrB,MAAM,wBAAwB,CAAA;AAsL/B;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,gBAAgB,EACxB,IAAI,EAAE,eAAe,EACrB,UAAU,EAAE,oBAAoB,GAC/B,iBAAiB,CAgBnB"}

package/dist/modules/publicApi/specProjection.js

@@ -0,0 +1,189 @@
+import { PUBLIC_SPEC_MAX_ACCEPTANCE, PUBLIC_SPEC_MAX_FEATURE_CHARS, PUBLIC_SPEC_MAX_FEATURE_FILES, PUBLIC_SPEC_MAX_FEATURE_TOTAL_CHARS, PUBLIC_SPEC_MAX_ISSUES, PUBLIC_SPEC_MAX_REQUIREMENTS, PUBLIC_SPEC_MAX_RULES, } from '@cat-factory/contracts';
+// Project the reader's {@link ServiceSpecView} onto the public wire shape, BOUNDED.
+//
+// A pure reduction, kept out of the controller because it is the half worth testing on its own:
+// what a cap does to a tree is a property of this function, and every rule it applies exists to
+// keep a bounded response from reading as a smaller spec.
+//
+// Four rules, and each is the same rule:
+//
+//  1. **A cap counts against the WHOLE tree, and reports the whole tree's total.** `shown`/`total`
+//     are computed before anything is dropped, so a reader of a capped response still learns how
+//     many requirements the service declares. A count taken off the rows would be exactly the lie
+//     the truncation record exists to prevent.
+//  2. **A cap cuts in TRAVERSAL ORDER and nothing is re-ranked.** The platform does not judge which
+//     requirement matters more, so it drops the tail rather than inventing a severity. The wire
+//     contract says so; a reader that needs a particular requirement has its id and the spec is a
+//     repository away.
+//  3. **An emptied group/module is kept, not pruned.** A group whose requirements all fell past the
+//     cap still names itself, because a vanished group reads as a service that never had one. Same
+//     for a requirement whose criteria the acceptance budget could not fit: its id is the join key
+//     this endpoint exists for, so the criteria are what a cap cuts, never the row that names them.
+//  4. **EVERY axis is bounded, including the ones that do not grow with the spec.** The Gherkin is
+//     capped across all files as well as within each one, and the issue list is capped too: it grows
+//     with FAILURE, so a rate-limit window part-way through a large walk would otherwise make the
+//     report of a degraded read the largest thing in a response whose every other axis is bounded.
+/**
+ * Clamp one feature file's Gherkin to `limit`, reporting what was kept and what exists.
+ *
+ * Counted and cut in code POINTS rather than UTF-16 units, the unit the debug surface's own
+ * `chars`/`totalChars` are measured in: a `slice` on the raw string can land between the halves of
+ * a surrogate pair and emit a lone one, which is a replacement character in the response and a
+ * character count nobody can reproduce.
+ *
+ * `limit` is the smaller of the per-file cap and what is left of the response-wide one, so both
+ * bounds report through the same `chars < totalChars` a reader already has to honour.
+ */
+function clampFeature(file, limit) {
+    const points = [...file.content];
+    const totalChars = points.length;
+    const chars = Math.min(totalChars, Math.max(limit, 0));
+    return {
+        module: file.module,
+        group: file.group,
+        path: file.path,
+        content: chars === totalChars ? file.content : points.slice(0, chars).join(''),
+        chars,
+        totalChars,
+        truncated: chars < totalChars,
+    };
+}
+/**
+ * The feature files this response carries: at most {@link PUBLIC_SPEC_MAX_FEATURE_FILES} of them,
+ * holding at most {@link PUBLIC_SPEC_MAX_FEATURE_TOTAL_CHARS} of Gherkin between them.
+ *
+ * The file count alone bounded the wrong thing: 500 files at the 20,000-character per-file cap is
+ * a ten-megabyte body. A file the total budget cannot fit whole is carried CLAMPED rather than
+ * dropped (its own `truncated` says so) and the walk stops at the first file the budget cannot
+ * start, so `shown` counts what a caller actually received.
+ */
+function capFeatures(files) {
+    const features = [];
+    let charBudget = PUBLIC_SPEC_MAX_FEATURE_TOTAL_CHARS;
+    for (const file of files.slice(0, PUBLIC_SPEC_MAX_FEATURE_FILES)) {
+        if (charBudget <= 0)
+            break;
+        const clamped = clampFeature(file, Math.min(PUBLIC_SPEC_MAX_FEATURE_CHARS, charBudget));
+        charBudget -= clamped.chars;
+        features.push(clamped);
+    }
+    return {
+        features,
+        truncations: features.length < files.length
+            ? [{ section: 'features', shown: features.length, total: files.length }]
+            : [],
+    };
+}
+/** Every group in the tree, in traversal order, so all three item caps cut the same way. */
+function groupsOf(spec) {
+    return (spec.modules ?? []).flatMap((module) => module.groups ?? []);
+}
+/** What the whole tree declares, counted BEFORE anything is cut. */
+function treeTotals(groups) {
+    let requirements = 0;
+    let rules = 0;
+    let acceptance = 0;
+    for (const group of groups) {
+        rules += (group.rules ?? []).length;
+        for (const requirement of group.requirements ?? []) {
+            requirements += 1;
+            acceptance += (requirement.acceptance ?? []).length;
+        }
+    }
+    return { requirements, rules, acceptance };
+}
+/**
+ * Rebuild the tree with at most {@link PUBLIC_SPEC_MAX_REQUIREMENTS} requirements,
+ * {@link PUBLIC_SPEC_MAX_RULES} rules and {@link PUBLIC_SPEC_MAX_ACCEPTANCE} acceptance criteria
+ * across it, reporting each cap that bit.
+ *
+ * The budgets are independent: a spec heavy in rules and light in requirements loses none of the
+ * latter. They are spent in traversal order, so a group is either whole, partial, or empty, and
+ * never a sample. A requirement whose criteria the acceptance budget could not fit is still
+ * CARRIED (a requirement is the join key the whole endpoint exists for), with the criteria the
+ * budget covered; the truncation row is what says the rest exist.
+ */
+function capTree(spec) {
+    const totals = treeTotals(groupsOf(spec));
+    const truncations = [];
+    if (totals.requirements > PUBLIC_SPEC_MAX_REQUIREMENTS) {
+        truncations.push({
+            section: 'requirements',
+            shown: PUBLIC_SPEC_MAX_REQUIREMENTS,
+            total: totals.requirements,
+        });
+    }
+    if (totals.rules > PUBLIC_SPEC_MAX_RULES) {
+        truncations.push({ section: 'rules', shown: PUBLIC_SPEC_MAX_RULES, total: totals.rules });
+    }
+    if (totals.acceptance > PUBLIC_SPEC_MAX_ACCEPTANCE) {
+        truncations.push({
+            section: 'acceptance',
+            shown: PUBLIC_SPEC_MAX_ACCEPTANCE,
+            total: totals.acceptance,
+        });
+    }
+    if (truncations.length === 0)
+        return { spec, truncations };
+    let requirementBudget = PUBLIC_SPEC_MAX_REQUIREMENTS;
+    let ruleBudget = PUBLIC_SPEC_MAX_RULES;
+    let acceptanceBudget = PUBLIC_SPEC_MAX_ACCEPTANCE;
+    const modules = (spec.modules ?? []).map((module) => ({
+        ...module,
+        groups: (module.groups ?? []).map((group) => {
+            const requirements = (group.requirements ?? [])
+                .slice(0, Math.max(requirementBudget, 0))
+                .map((requirement) => {
+                const acceptance = (requirement.acceptance ?? []).slice(0, Math.max(acceptanceBudget, 0));
+                acceptanceBudget -= acceptance.length;
+                return { ...requirement, acceptance };
+            });
+            const rules = (group.rules ?? []).slice(0, Math.max(ruleBudget, 0));
+            requirementBudget -= requirements.length;
+            ruleBudget -= rules.length;
+            return { ...group, requirements, rules };
+        }),
+    }));
+    return { spec: { ...spec, modules }, truncations };
+}
+/**
+ * The read issues this response carries, capped, with a row saying so when the cap bit.
+ *
+ * The one axis that grows with FAILURE rather than with the spec: a rate-limit window part-way
+ * through a few-thousand-shard walk logs a row per shard, so an uncapped list makes the report of
+ * a degraded read the largest thing in a response whose every other axis is bounded.
+ */
+function capIssues(issues) {
+    if (issues.length <= PUBLIC_SPEC_MAX_ISSUES)
+        return { issues, truncations: [] };
+    return {
+        issues: issues.slice(0, PUBLIC_SPEC_MAX_ISSUES),
+        truncations: [{ section: 'issues', shown: PUBLIC_SPEC_MAX_ISSUES, total: issues.length }],
+    };
+}
+/**
+ * Project a read view onto the wire, under `anchor`.
+ *
+ * The anchor is passed IN rather than re-derived: the caller is where the four outcomes are
+ * separated (an unreadable repository never reaches here at all), and a projection that recomputed
+ * it from `view.present` would be a second opinion on the one judgement this endpoint exists to
+ * make.
+ */
+export function toPublicServiceSpec(serviceId, anchor, view, provenance) {
+    const capped = view.spec ? capTree(view.spec) : { spec: null, truncations: [] };
+    const features = capFeatures(view.features);
+    // An absent `diagnostics` means the producer diagnosed nothing, which on this path cannot
+    // happen (the reader always sets it) but is answered as "no issues found" rather than left to
+    // throw on a view assembled by hand.
+    const issues = capIssues(view.diagnostics?.issues ?? []);
+    return {
+        serviceId,
+        anchor,
+        spec: capped.spec,
+        features: features.features,
+        provenance,
+        issues: issues.issues,
+        truncations: [...capped.truncations, ...features.truncations, ...issues.truncations],
+    };
+}
+//# sourceMappingURL=specProjection.js.map

package/dist/modules/publicApi/specProjection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"specProjection.js","sourceRoot":"","sources":["../../../src/modules/publicApi/specProjection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,0BAA0B,EAC1B,6BAA6B,EAC7B,6BAA6B,EAC7B,mCAAmC,EACnC,sBAAsB,EACtB,4BAA4B,EAC5B,qBAAqB,GAWtB,MAAM,wBAAwB,CAAA;AAE/B,oFAAoF;AACpF,EAAE;AACF,gGAAgG;AAChG,gGAAgG;AAChG,0DAA0D;AAC1D,EAAE;AACF,yCAAyC;AACzC,EAAE;AACF,mGAAmG;AACnG,iGAAiG;AACjG,kGAAkG;AAClG,+CAA+C;AAC/C,oGAAoG;AACpG,gGAAgG;AAChG,kGAAkG;AAClG,uBAAuB;AACvB,oGAAoG;AACpG,mGAAmG;AACnG,mGAAmG;AACnG,oGAAoG;AACpG,mGAAmG;AACnG,qGAAqG;AACrG,kGAAkG;AAClG,mGAAmG;AAEnG;;;;;;;;;;GAUG;AACH,SAAS,YAAY,CAAC,IAAqB,EAAE,KAAa;IACxD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAA;IAChC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAA;IAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;IACtD,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,OAAO,EAAE,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9E,KAAK;QACL,UAAU;QACV,SAAS,EAAE,KAAK,GAAG,UAAU;KAC9B,CAAA;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,KAAwB;IAI3C,MAAM,QAAQ,GAA4B,EAAE,CAAA;IAC5C,IAAI,UAAU,GAAG,mCAAmC,CAAA;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,6BAA6B,CAAC,EAAE,CAAC;QACjE,IAAI,UAAU,IAAI,CAAC;YAAE,MAAK;QAC1B,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,6BAA6B,EAAE,UAAU,CAAC,CAAC,CAAA;QACvF,UAAU,IAAI,OAAO,CAAC,KAAK,CAAA;QAC3B,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACxB,CAAC;IACD,OAAO;QACL,QAAQ;QACR,WAAW,EACT,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;YAC5B,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;YACxE,CAAC,CAAC,EAAE;KACT,CAAA;AACH,CAAC;AAED,4FAA4F;AAC5F,SAAS,QAAQ,CAAC,IAAiB;IACjC,OAAO,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAA;AACtE,CAAC;AAED,oEAAoE;AACpE,SAAS,UAAU,CAAC,MAA0B;IAK5C,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,UAAU,GAAG,CAAC,CAAA;IAClB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;QACnC,KAAK,MAAM,WAAW,IAAI,KAAK,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;YACnD,YAAY,IAAI,CAAC,CAAA;YACjB,UAAU,IAAI,CAAC,WAAW,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;QACrD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,YAAY,EAAE,KAAK,EAAE,UAAU,EAAE,CAAA;AAC5C,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,OAAO,CAAC,IAAiB;IAIhC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;IACzC,MAAM,WAAW,GAA2B,EAAE,CAAA;IAC9C,IAAI,MAAM,CAAC,YAAY,GAAG,4BAA4B,EAAE,CAAC;QACvD,WAAW,CAAC,IAAI,CAAC;YACf,OAAO,EAAE,cAAc;YACvB,KAAK,EAAE,4BAA4B;YACnC,KAAK,EAAE,MAAM,CAAC,YAAY;SAC3B,CAAC,CAAA;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,KAAK,GAAG,qBAAqB,EAAE,CAAC;QACzC,WAAW,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,qBAAqB,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAA;IAC3F,CAAC;IACD,IAAI,MAAM,CAAC,UAAU,GAAG,0BAA0B,EAAE,CAAC;QACnD,WAAW,CAAC,IAAI,CAAC;YACf,OAAO,EAAE,YAAY;YACrB,KAAK,EAAE,0BAA0B;YACjC,KAAK,EAAE,MAAM,CAAC,UAAU;SACzB,CAAC,CAAA;IACJ,CAAC;IACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAA;IAC1D,IAAI,iBAAiB,GAAG,4BAA4B,CAAA;IACpD,IAAI,UAAU,GAAG,qBAAqB,CAAA;IACtC,IAAI,gBAAgB,GAAG,0BAA0B,CAAA;IACjD,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACpD,GAAG,MAAM;QACT,MAAM,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1C,MAAM,YAAY,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC;iBAC5C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;iBACxC,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE;gBACnB,MAAM,UAAU,GAAG,CAAC,WAAW,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC,CAAA;gBACzF,gBAAgB,IAAI,UAAU,CAAC,MAAM,CAAA;gBACrC,OAAO,EAAE,GAAG,WAAW,EAAE,UAAU,EAAE,CAAA;YACvC,CAAC,CAAC,CAAA;YACJ,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAA;YACnE,iBAAiB,IAAI,YAAY,CAAC,MAAM,CAAA;YACxC,UAAU,IAAI,KAAK,CAAC,MAAM,CAAA;YAC1B,OAAO,EAAE,GAAG,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,CAAA;QAC1C,CAAC,CAAC;KACH,CAAC,CAAC,CAAA;IACH,OAAO,EAAE,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,CAAA;AACpD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,MAAuB;IAIxC,IAAI,MAAM,CAAC,MAAM,IAAI,sBAAsB;QAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,CAAA;IAC/E,OAAO;QACL,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC;QAC/C,WAAW,EAAE,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;KAC1F,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,SAAiB,EACjB,MAAwB,EACxB,IAAqB,EACrB,UAAgC;IAEhC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,CAAA;IAC/E,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IAC3C,0FAA0F;IAC1F,8FAA8F;IAC9F,qCAAqC;IACrC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,IAAI,EAAE,CAAC,CAAA;IACxD,OAAO;QACL,SAAS;QACT,MAAM;QACN,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,UAAU;QACV,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,WAAW,EAAE,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,GAAG,QAAQ,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC;KACrF,CAAA;AACH,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@cat-factory/server",
-  "version": "0.256.0",
+  "version": "0.258.0",
   "description": "Runtime-neutral HTTP layer for the Agent Architecture Board: the Hono controllers, middleware (auth/authz/CORS/error), request helpers and the gateway seams shared by every deployment facade (Cloudflare Worker, Node service).",
   "repository": {
     "type": "git",
@@ -31,13 +31,13 @@
     "jose": "^6.2.8",
     "pino": "^10.3.1",
     "valibot": "^1.4.2",
-    "@cat-factory/agents": "0.119.2",
-    "@cat-factory/contracts": "0.278.0",
-    "@cat-factory/integrations": "0.152.3",
-    "@cat-factory/kernel": "0.275.2",
-    "@cat-factory/mcp-server": "0.24.0",
-    "@cat-factory/orchestration": "0.244.0",
-    "@cat-factory/spend": "0.15.45"
+    "@cat-factory/agents": "0.120.0",
+    "@cat-factory/contracts": "0.280.0",
+    "@cat-factory/kernel": "0.275.4",
+    "@cat-factory/integrations": "0.152.5",
+    "@cat-factory/mcp-server": "0.26.0",
+    "@cat-factory/orchestration": "0.246.0",
+    "@cat-factory/spend": "0.15.47"
   },
   "devDependencies": {
     "@types/node": "^26.1.2",