@loomwork/plugin-content 0.0.0-stage → 0.1.1

package/LICENSE

@@ -0,0 +1,202 @@
+                                 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 [yyyy] [name of copyright owner]
+
+   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,8 @@
+Loom
+Copyright 2026 Sushil Chhetri
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this project except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0

package/README.md

@@ -1,3 +1,93 @@
-# Temporary Holding Version
+# @loomwork/plugin-content
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The content-addressed blob seam. A large value leaves the log by reference: the log keeps a thin, ordered
+authority and the bytes live in a `ContentStore`, addressed by the hash of the bytes (`sha256:<hex>`).
+Use it when payloads are too big or too sensitive to keep inline, when forks should share blobs, or when
+you need to reclaim stored bytes safely. The durable store here is `SqliteContentStore` (`@loomwork/plugin-sqlite`);
+`@loomwork/plugin-crypto` has an `EncryptingContentStore`, and you can implement the SPI for another backend.
+
+```ts
+import { defineConfig } from "@loomwork/app";
+import { InMemoryAsyncEventStore } from "@loomwork/event-runtime";
+import {
+  ContentResolvingEventStore,
+  InMemoryContentStore,
+  sweepUnpinnedContent,
+} from "@loomwork/plugin-content";
+
+const content = new InMemoryContentStore();
+const inner = new InMemoryAsyncEventStore();
+
+// Move one payload field per event kind out of the log; reads resolve it back.
+const events = new ContentResolvingEventStore(inner, content, {
+  externalize: { STEP_COMPLETED: ["output.document"] },
+});
+export const app = defineConfig({ storage: { kind: "custom", eventStore: events } });
+
+// Mark-and-sweep reclamation. The API erases unless `dryRun: true`, so look first.
+export async function sweep(now: number) {
+  return sweepUnpinnedContent({
+    eventStores: [inner], // every live store and every archive; scan the raw store
+    contentStore: content,
+    pinnedEventTypes: ["FINDING_RECORDED"],
+    olderThanMs: 30 * 24 * 3600_000,
+    now, // LOG time, compared against event timestamps
+    dryRun: true,
+  });
+}
+```
+
+## Surface
+
+- **Store seam.** `ContentStore` (`put`, `get`, `delete`, with optional `getMany`, `touch`, `listPage`,
+  `deleteIfUntouchedSince`, `touchClock`), `InMemoryContentStore`, `CachingContentStore`.
+- **Log integration.** `ContentResolvingEventStore` (externalize on write, resolve on read),
+  `ContentTouchingSnapshotStore`, `externalizePathsFromSteps` (derives paths from steps that mark an
+  output `externalized()`), `ContentRef`, `collectContentRefs`.
+- **Reclamation.** `sweepUnpinnedContent`, `pinByEventKinds`, and the errors it refuses with
+  (`ReclaimOrphansAckError`, `ArchiveStoresRequiredError`, `SealedArchiveScanError`, and others).
+
+## Behaviour that surprises people
+
+- **Which refs can be reclaimed.** A bare ref in a payload is load-bearing: the resolving store throws
+  `ContentMissingError` when its blob is gone, so a sweep keeps it while any scanned event cites it. The
+  same goes for a ref cited by a `pinnedEventTypes` event, a `roots` address, an archive segment or a
+  snapshot. Only an ADR 0054 claim-check envelope's `ref` is TTL-reclaimable, and not even that when the
+  envelope has `retain: true` at the top-level `output` of a `STEP_COMPLETED` (ADR 0140). A nested
+  `retain: true` lookalike does not count.
+- **Reclaimable refs age from the end of the run.** A cited ref's age runs from the citing execution's
+  end if that is later than the citation (ADR 0146), so a blob cannot be erased while the log citing it
+  is retained under the same policy. A running or re-opened execution keeps the citation clock. The
+  change only ever deletes less; a dry run lists what it kept in `heldByEndClock`.
+- **Two clocks.** `now` is LOG time, compared with event timestamps. The race guard uses the store's
+  own touch clock (`touchedBefore`, default `touchClock() - olderThanMs`). Without
+  `deleteIfUntouchedSince` the sweep falls back to a plain delete and reports `raceSafe: false`.
+- **The API erases by default.** Only `dryRun: true` is a dry run (the `loom sweep content` CLI defaults
+  to one). Give exactly one of `olderThanMs` or `policy`.
+- **Erasing orphans is gated.** `reclaimOrphans` needs `{ completeScan: true }` (a bare `true` throws),
+  a store with `touch`, `listPage` and `deleteIfUntouchedSince`, and a margin of at least 60 s. It also
+  needs `snapshotsTouchContent: true` when you pass `snapshotStores`. Passing it asserts that
+  `eventStores`, `snapshotStores` and `roots` cover every place that cites content; the sweep cannot
+  detect a store you left out.
+- **Compaction needs archives.** An erasing pass refuses a compacted log its `archiveStores` do not
+  cover (`ArchiveStoresRequiredError`) unless `acknowledgeUnarchivedLogs: true`.
+- **Deleting a log does not delete blobs.** `deleteExecution` and `truncatePrefix` leave them, because
+  forks share content. Reclamation is the sweep, or `contentStore.delete(ref)`.
+- **A sealing store cannot back `ContentResolvingEventStore`.** The constructor throws `TypeError` for
+  `sealsContent: true`, since that path does not carry the owning execution. Compose it inside an
+  audit chain, not outside, or the chain hashes only the ref.
+
+## See also
+
+- API reference: section "`@loomwork/plugin-content` — the content-addressed blob seam" in
+  [docs/api-reference.org](../../docs/api-reference.org).
+- Guides: [operations](../../docs/operations.md), [plugins](../../docs/plugins.md).
+- ADRs: [0046 content store seam](../../docs/adr/0046-content-store-seam-thin-authoritative-log.md),
+  [0055 pin seam and content GC](../../docs/adr/0055-k10-6-pin-seam-content-gc.md),
+  [0140 agent claim-check](../../docs/adr/0140-agent-claim-check-opt-in.md),
+  [0145 retention policy](../../docs/adr/0145-app-owned-retention-policy.md),
+  [0146 content age from execution end](../../docs/adr/0146-content-age-from-execution-end.md).
+
+## Install
+
+Unpublished for now: inside this repo use `workspace:*`; from a sibling checkout use a `link:` override (see [AGENTS.md](../../AGENTS.md)).

package/dist/CachingContentStore.d.ts

@@ -0,0 +1,54 @@
+import type { ContentAccess, ContentStore } from "./ContentStore";
+import { type ContentRef } from "./content";
+export interface CachingContentStoreOptions {
+    /**
+     * Total cache budget in BYTES (not entries — blob sizes vary by orders of
+     * magnitude). A single blob larger than the budget is never admitted.
+     */
+    maxBytes: number;
+}
+/**
+ * ADR 0062 — a caching decorator for any {@link ContentStore}. Content
+ * addressing makes this trivially correct: a blob's address is a pure function
+ * of its bytes, so cached entries are immutable and valid forever — with
+ * exactly one edge: **`delete` evicts BEFORE forwarding**, so an erased /
+ * crypto-shredded blob (K10, T3) is never resurrected from a warm cache.
+ *
+ * Byte-budgeted LRU on Map insertion order (touch = delete+set, evict = first
+ * key) — O(1) per operation. `getMany` serves hits from cache and fetches only
+ * the misses (one inner `getMany` when supported). A decorator is still a
+ * conformant store and runs the full conformance kit.
+ */
+export declare class CachingContentStore implements ContentStore {
+    private readonly inner;
+    private readonly options;
+    private readonly cache;
+    private cachedBytes;
+    readonly putStream?: NonNullable<ContentStore["putStream"]>;
+    readonly getMany: NonNullable<ContentStore["getMany"]>;
+    readonly deleteIfUntouchedSince?: NonNullable<ContentStore["deleteIfUntouchedSince"]>;
+    readonly listPage?: NonNullable<ContentStore["listPage"]>;
+    readonly touchClock?: NonNullable<ContentStore["touchClock"]>;
+    readonly touch?: NonNullable<ContentStore["touch"]>;
+    constructor(inner: ContentStore, options: CachingContentStoreOptions);
+    put(bytes: Uint8Array, access?: ContentAccess): Promise<ContentRef>;
+    get(ref: ContentRef, access?: ContentAccess): Promise<Uint8Array | null>;
+    delete(ref: ContentRef): Promise<void>;
+    private evict;
+    /** Cache hit with LRU touch (delete+set moves the key to the Map's tail). */
+    private lruTouch;
+    /**
+     * Audit SEC-2 — FETCHED bytes are verified against their content address
+     * before they are served OR cached: a buggy/compromised inner store returning
+     * wrong bytes for an address must neither poison the cache nor reach the
+     * caller (the sandbox pins scripts by hash through this store — a mispairing
+     * would defeat that provenance). Throws loudly on mismatch. Applies only to
+     * sha256-addressed refs (the ADR 0046 scheme) and only to the fetch path —
+     * `put` bytes came from the caller and the inner store derived the address.
+     */
+    private verifyFetched;
+    private admit;
+    /** Observability for tests: current cached byte total. */
+    get cacheBytes(): number;
+}
+//# sourceMappingURL=CachingContentStore.d.ts.map

package/dist/CachingContentStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CachingContentStore.d.ts","sourceRoot":"","sources":["../src/CachingContentStore.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAClE,OAAO,EAAE,KAAK,UAAU,EAAkB,MAAM,WAAW,CAAC;AAE5D,MAAM,WAAW,0BAA0B;IACzC;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,mBAAoB,YAAW,YAAY;IAWpD,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAX1B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiC;IACvD,OAAO,CAAC,WAAW,CAAK;IACxB,QAAQ,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,sBAAsB,CAAC,EAAE,WAAW,CAAC,YAAY,CAAC,wBAAwB,CAAC,CAAC,CAAC;IACtF,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;gBAGjC,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,0BAA0B;IAoEhD,GAAG,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,UAAU,CAAC;IAMnE,GAAG,CAAC,GAAG,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAWxE,MAAM,CAAC,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAM5C,OAAO,CAAC,KAAK;IAQb,6EAA6E;IAC7E,OAAO,CAAC,QAAQ;IAShB;;;;;;;;OAQG;IACH,OAAO,CAAC,aAAa;IAQrB,OAAO,CAAC,KAAK;IAkBb,0DAA0D;IAC1D,IAAI,UAAU,IAAI,MAAM,CAEvB;CACF"}

package/dist/CachingContentStore.js

@@ -0,0 +1,171 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CachingContentStore = void 0;
+const content_1 = require("./content");
+/**
+ * ADR 0062 — a caching decorator for any {@link ContentStore}. Content
+ * addressing makes this trivially correct: a blob's address is a pure function
+ * of its bytes, so cached entries are immutable and valid forever — with
+ * exactly one edge: **`delete` evicts BEFORE forwarding**, so an erased /
+ * crypto-shredded blob (K10, T3) is never resurrected from a warm cache.
+ *
+ * Byte-budgeted LRU on Map insertion order (touch = delete+set, evict = first
+ * key) — O(1) per operation. `getMany` serves hits from cache and fetches only
+ * the misses (one inner `getMany` when supported). A decorator is still a
+ * conformant store and runs the full conformance kit.
+ */
+class CachingContentStore {
+    inner;
+    options;
+    cache = new Map();
+    cachedBytes = 0;
+    putStream;
+    getMany;
+    deleteIfUntouchedSince;
+    listPage;
+    touchClock;
+    touch;
+    constructor(inner, options) {
+        this.inner = inner;
+        this.options = options;
+        // ADR 0143: this cache holds PLAINTEXT keyed by address, so over a sealing store a warm hit would hand a
+        // blob to a caller who never proved the subject (and whose fetch-hash check could not pass anyway: the
+        // sealing store returns plaintext for a ciphertext address). Cache the CIPHERTEXT instead: wrap the plain
+        // store, then seal on top (`new EncryptingContentStore(new CachingContentStore(plain, ..), ..)`).
+        if (inner.sealsContent === true) {
+            throw new TypeError("CachingContentStore: refusing to cache a store that seals content (sealsContent: true): a warm hit would serve plaintext without the subject check. Put the cache BELOW the sealing store.");
+        }
+        // Forwarded uncached: the stream's bytes are consumed by the inner upload.
+        if (inner.putStream !== undefined) {
+            this.putStream = (stream, access) => inner.putStream(stream, access);
+        }
+        // SPI 1.3.0 (ADR 0055 D5/D6): forwarded iff the inner store has them — a decorator that
+        // dropped them would silently make the sweep racy and `reclaimOrphans` refuse. Touch
+        // times are the inner store's; `put` already forwards, so a re-citation still bumps.
+        if (inner.deleteIfUntouchedSince !== undefined) {
+            this.deleteIfUntouchedSince = async (ref, cutoffMs) => {
+                this.evict(ref.__loomContent); // before: erasure is never served from a warm cache
+                const deleted = await inner.deleteIfUntouchedSince(ref, cutoffMs);
+                // after: a concurrent miss may have re-admitted the bytes while the delete ran
+                if (deleted)
+                    this.evict(ref.__loomContent);
+                return deleted;
+            };
+        }
+        if (inner.listPage !== undefined) {
+            this.listPage = (opts) => inner.listPage(opts);
+        }
+        if (inner.touchClock !== undefined) {
+            this.touchClock = () => inner.touchClock();
+        }
+        // SPI 1.4.0: the touch time is the inner store's; the byte cache is untouched by it.
+        if (inner.touch !== undefined) {
+            this.touch = (addresses) => inner.touch(addresses);
+        }
+        this.getMany = async (refs, access) => {
+            const results = new Array(refs.length);
+            const missIndexes = [];
+            const missRefs = [];
+            refs.forEach((ref, i) => {
+                const hit = this.lruTouch(ref.__loomContent);
+                if (hit !== undefined) {
+                    results[i] = hit;
+                }
+                else {
+                    missIndexes.push(i);
+                    missRefs.push(ref);
+                }
+            });
+            if (missRefs.length > 0) {
+                const fetched = inner.getMany !== undefined
+                    ? await inner.getMany(missRefs, access)
+                    : await Promise.all(missRefs.map((r) => inner.get(r, access)));
+                fetched.forEach((bytes, j) => {
+                    const at = missIndexes[j];
+                    if (bytes != null) {
+                        this.verifyFetched(missRefs[j].__loomContent, bytes);
+                        this.admit(missRefs[j].__loomContent, bytes);
+                    }
+                    results[at] = bytes ?? null;
+                });
+            }
+            return results;
+        };
+    }
+    async put(bytes, access) {
+        const ref = await this.inner.put(bytes, access);
+        this.admit(ref.__loomContent, bytes);
+        return ref;
+    }
+    async get(ref, access) {
+        const hit = this.lruTouch(ref.__loomContent);
+        if (hit !== undefined)
+            return hit;
+        const bytes = await this.inner.get(ref, access);
+        if (bytes !== null) {
+            this.verifyFetched(ref.__loomContent, bytes);
+            this.admit(ref.__loomContent, bytes);
+        }
+        return bytes;
+    }
+    async delete(ref) {
+        // Evict FIRST — erasure must never be resurrected from cache.
+        this.evict(ref.__loomContent);
+        return this.inner.delete(ref);
+    }
+    evict(address) {
+        const cached = this.cache.get(address);
+        if (cached !== undefined) {
+            this.cache.delete(address);
+            this.cachedBytes -= cached.byteLength;
+        }
+    }
+    /** Cache hit with LRU touch (delete+set moves the key to the Map's tail). */
+    lruTouch(address) {
+        const hit = this.cache.get(address);
+        if (hit !== undefined) {
+            this.cache.delete(address);
+            this.cache.set(address, hit);
+        }
+        return hit;
+    }
+    /**
+     * Audit SEC-2 — FETCHED bytes are verified against their content address
+     * before they are served OR cached: a buggy/compromised inner store returning
+     * wrong bytes for an address must neither poison the cache nor reach the
+     * caller (the sandbox pins scripts by hash through this store — a mispairing
+     * would defeat that provenance). Throws loudly on mismatch. Applies only to
+     * sha256-addressed refs (the ADR 0046 scheme) and only to the fetch path —
+     * `put` bytes came from the caller and the inner store derived the address.
+     */
+    verifyFetched(address, bytes) {
+        if (address.startsWith("sha256:") && (0, content_1.contentAddress)(bytes) !== address) {
+            throw new Error(`CachingContentStore: inner store returned bytes whose hash does not match "${address}" — refusing to cache or serve (possible corruption or poisoning)`);
+        }
+    }
+    admit(address, bytes) {
+        if (bytes.byteLength > this.options.maxBytes)
+            return; // never admit an over-budget blob
+        const existing = this.cache.get(address);
+        if (existing !== undefined) {
+            this.cache.delete(address);
+            this.cachedBytes -= existing.byteLength;
+        }
+        this.cache.set(address, bytes);
+        this.cachedBytes += bytes.byteLength;
+        while (this.cachedBytes > this.options.maxBytes) {
+            const oldest = this.cache.keys().next();
+            if (oldest.done === true)
+                break;
+            const evicted = this.cache.get(oldest.value);
+            this.cache.delete(oldest.value);
+            this.cachedBytes -= evicted.byteLength;
+        }
+    }
+    /** Observability for tests: current cached byte total. */
+    get cacheBytes() {
+        return this.cachedBytes;
+    }
+}
+exports.CachingContentStore = CachingContentStore;
+//# sourceMappingURL=CachingContentStore.js.map

package/dist/CachingContentStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CachingContentStore.js","sourceRoot":"","sources":["../src/CachingContentStore.ts"],"names":[],"mappings":";;;AACA,uCAA4D;AAU5D;;;;;;;;;;;GAWG;AACH,MAAa,mBAAmB;IAWX;IACA;IAXF,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,WAAW,GAAG,CAAC,CAAC;IACf,SAAS,CAA0C;IACnD,OAAO,CAAuC;IAC9C,sBAAsB,CAAuD;IAC7E,QAAQ,CAAyC;IACjD,UAAU,CAA2C;IACrD,KAAK,CAAsC;IAEpD,YACmB,KAAmB,EACnB,OAAmC;QADnC,UAAK,GAAL,KAAK,CAAc;QACnB,YAAO,GAAP,OAAO,CAA4B;QAEpD,yGAAyG;QACzG,uGAAuG;QACvG,0GAA0G;QAC1G,kGAAkG;QAClG,IAAI,KAAK,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC;YAChC,MAAM,IAAI,SAAS,CACjB,4LAA4L,CAC7L,CAAC;QACJ,CAAC;QACD,2EAA2E;QAC3E,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,SAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACxE,CAAC;QACD,wFAAwF;QACxF,qFAAqF;QACrF,qFAAqF;QACrF,IAAI,KAAK,CAAC,sBAAsB,KAAK,SAAS,EAAE,CAAC;YAC/C,IAAI,CAAC,sBAAsB,GAAG,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,EAAE;gBACpD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,oDAAoD;gBACnF,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,sBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBACnE,+EAA+E;gBAC/E,IAAI,OAAO;oBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAC3C,OAAO,OAAO,CAAC;YACjB,CAAC,CAAC;QACJ,CAAC;QACD,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,QAAS,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,UAAW,EAAE,CAAC;QAC9C,CAAC;QACD,qFAAqF;QACrF,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,KAAM,CAAC,SAAS,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;YACpC,MAAM,OAAO,GAAG,IAAI,KAAK,CAAoB,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,WAAW,GAAa,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAiB,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;gBACtB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAC7C,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;oBACtB,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACpB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC,CAAC,CAAC;YACH,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GACX,KAAK,CAAC,OAAO,KAAK,SAAS;oBACzB,CAAC,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC;oBACvC,CAAC,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnE,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;oBAC3B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAW,CAAC;oBACpC,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;wBAClB,IAAI,CAAC,aAAa,CAAE,QAAQ,CAAC,CAAC,CAAgB,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;wBACrE,IAAI,CAAC,KAAK,CAAE,QAAQ,CAAC,CAAC,CAAgB,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;oBAC/D,CAAC;oBACD,OAAO,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC;gBAC9B,CAAC,CAAC,CAAC;YACL,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,KAAiB,EAAE,MAAsB;QACjD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,MAAsB;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC7C,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,GAAe;QAC1B,8DAA8D;QAC9D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAEO,KAAK,CAAC,OAAe;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC3B,IAAI,CAAC,WAAW,IAAI,MAAM,CAAC,UAAU,CAAC;QACxC,CAAC;IACH,CAAC;IAED,6EAA6E;IACrE,QAAQ,CAAC,OAAe;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;OAQG;IACK,aAAa,CAAC,OAAe,EAAE,KAAiB;QACtD,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,IAAA,wBAAc,EAAC,KAAK,CAAC,KAAK,OAAO,EAAE,CAAC;YACvE,MAAM,IAAI,KAAK,CACb,8EAA8E,OAAO,mEAAmE,CACzJ,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,OAAe,EAAE,KAAiB;QAC9C,IAAI,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ;YAAE,OAAO,CAAC,kCAAkC;QACxF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC3B,IAAI,CAAC,WAAW,IAAI,QAAQ,CAAC,UAAU,CAAC;QAC1C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,UAAU,CAAC;QACrC,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI;gBAAE,MAAM;YAChC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAe,CAAC;YAC3D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,CAAC,WAAW,IAAI,OAAO,CAAC,UAAU,CAAC;QACzC,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;CACF;AAhKD,kDAgKC"}

package/dist/ContentResolvingEventStore.d.ts

@@ -0,0 +1,70 @@
+import type { EventEnvelope } from "@loomwork/core";
+import { type EventStore } from "@loomwork/event-runtime";
+import type { ContentStore } from "./ContentStore";
+import { type TouchErrorHook } from "./touchAround";
+export interface ContentResolvingEventStoreOptions {
+    /**
+     * Payload dot-paths to externalize per event type, e.g. `{ STEP_COMPLETED: ["output.doc"] }`.
+     * On append those fields are moved to the content store and replaced by a {@link ContentRef};
+     * on read they are resolved back. Unmarked events are stored verbatim (zero overhead, G2).
+     */
+    externalize: Record<string, readonly string[]>;
+    /**
+     * Observer for the SPI 1.4.0 `touch` this store makes around ref-carrying writes (ADR 0055 D6
+     * amendment 2): called when the touch AFTER a durable write threw (swallowed otherwise, since the
+     * write already landed), and when either touch reports a cited bare ref MISSING (the write cites
+     * a blob that is already gone). A failure of the touch BEFORE the write still rejects the write.
+     * Wire it to your logger or metrics. See {@link TouchErrorHook}.
+     */
+    onTouchError?: TouchErrorHook;
+}
+export declare class ContentResolvingEventStore implements EventStore {
+    private readonly inner;
+    private readonly content;
+    private readonly externalize;
+    private readonly onTouchError;
+    readonly appendBatch?: NonNullable<EventStore["appendBatch"]>;
+    readonly head?: NonNullable<EventStore["head"]>;
+    readonly readRange?: NonNullable<EventStore["readRange"]>;
+    readonly acquireFence?: NonNullable<EventStore["acquireFence"]>;
+    readonly acquireFenceIf?: NonNullable<EventStore["acquireFenceIf"]>;
+    readonly appendIfUnchanged?: NonNullable<EventStore["appendIfUnchanged"]>;
+    readonly storeNow?: NonNullable<EventStore["storeNow"]>;
+    readonly sealingCapability?: NonNullable<EventStore["sealingCapability"]>;
+    readonly readAtRest?: NonNullable<EventStore["readAtRest"]>;
+    readonly copyPrefix?: NonNullable<EventStore["copyPrefix"]>;
+    readonly deleteExecution?: NonNullable<EventStore["deleteExecution"]>;
+    readonly deleteThrough?: NonNullable<EventStore["deleteThrough"]>;
+    readonly truncatePrefix?: NonNullable<EventStore["truncatePrefix"]>;
+    readonly truncatePrefixKeeping?: NonNullable<EventStore["truncatePrefixKeeping"]>;
+    readonly listExecutions?: NonNullable<EventStore["listExecutions"]>;
+    readonly listExecutionsPage?: NonNullable<EventStore["listExecutionsPage"]>;
+    constructor(inner: EventStore, content: ContentStore, options: ContentResolvingEventStoreOptions);
+    private externalizeEnvelope;
+    append(envelope: EventEnvelope): Promise<void>;
+    /**
+     * SPI 1.4.0 (ADR 0055 D6 amendment 2) — a ref that reaches a log WITHOUT a `put` (one an
+     * incoming payload already carries: a recalled memory value, a `scriptRef`, a ref handed
+     * between steps) is a citation the orphan sweep's conditional delete cannot see. So, when the
+     * content store can `touch`, the payloads' cited addresses are touched BEFORE the write (a
+     * failure aborts it, nothing landed) and again AFTER it (best-effort and reported through
+     * `onTouchError`: the write is durable, so its outcome must not be turned into a failure).
+     * The guarantee is D5's: the BEFORE touch protects a write whose touch-to-commit window is
+     * shorter than the sweep's margin (`touchClock() - cutoff`, which an erasing orphan pass
+     * requires to be at least 60 s); the AFTER touch only extends that for a slower write. See
+     * {@link touchAround}. Refs externalized by THIS write are not in the INPUT payloads (their
+     * `put` is the touch). Cost: with no `touch` on the store, nothing (the closure is the
+     * write); otherwise one iterative cycle-safe walk of the input payload (no recursion; the same
+     * walker the sweep's mark phase uses), and a round trip only when a ref was found.
+     */
+    private touching;
+    private externalizeValue;
+    read(executionId: string): Promise<EventEnvelope[]>;
+    readFrom(executionId: string, fromSequence: number): Promise<EventEnvelope[]>;
+    private resolveAll;
+    /** Fetch all distinct refs; loudness contract unchanged (missing ⇒ ContentMissingError, G1). */
+    private fetchBytes;
+    subscribe(executionId: string, handler: (event: EventEnvelope) => void): Promise<() => void>;
+    close(): Promise<void>;
+}
+//# sourceMappingURL=ContentResolvingEventStore.d.ts.map

package/dist/ContentResolvingEventStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContentResolvingEventStore.d.ts","sourceRoot":"","sources":["../src/ContentResolvingEventStore.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAEL,KAAK,UAAU,EAIhB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAUnD,OAAO,EAAE,KAAK,cAAc,EAAe,MAAM,eAAe,CAAC;AAEjE,MAAM,WAAW,iCAAiC;IAChD;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;IAC/C;;;;;;OAMG;IACH,YAAY,CAAC,EAAE,cAAc,CAAC;CAC/B;AAyCD,qBAAa,0BAA2B,YAAW,UAAU;IAqBzD,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,OAAO;IArB1B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAoC;IAChE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA6B;IAC1D,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,QAAQ,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,QAAQ,CAAC,YAAY,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,cAAc,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;IACxD,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;IAC5D,QAAQ,CAAC,eAAe,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACtE,QAAQ,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC;IAClE,QAAQ,CAAC,cAAc,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,QAAQ,CAAC,qBAAqB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,uBAAuB,CAAC,CAAC,CAAC;IAClF,QAAQ,CAAC,cAAc,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACpE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC,CAAC;gBAGzD,KAAK,EAAE,UAAU,EACjB,OAAO,EAAE,YAAY,EACtC,OAAO,EAAE,iCAAiC;YAqG9B,mBAAmB;IAO3B,MAAM,CAAC,QAAQ,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAQpD;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,QAAQ;YAQF,gBAAgB;IAKxB,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAInD,QAAQ,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;YAWrE,UAAU;IAUxB,gGAAgG;YAClF,UAAU;IA4BlB,SAAS,CACb,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,CAAC,KAAK,EAAE,aAAa,KAAK,IAAI,GACtC,OAAO,CAAC,MAAM,IAAI,CAAC;IAqBhB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B"}