@loomwork/classify 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,74 @@
-# Temporary Holding Version
+# @loomwork/classify — what a value is, on two axes
 
-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 vocabulary other packages use to say how a piece of data must be handled. **Confidentiality** is a
+property of a field, so you declare it once on the schema (`sensitive()`, `secret()`, `internal()`) and
+the packages that mask, encrypt or externalize read the marks from there. **Integrity** is a property of a
+value, acquired at runtime from a specific origin, so `tainted()` wraps the value where it enters the
+system (an MCP tool result, a fetched page). This package only declares and reads; the enforcement lives
+in the packages that consume it. You reach for it when you define schemas or ingest third-party content.
+
+```ts
+import { z } from "zod";
+import {
+  collectClassifiedPaths, isTainted, maskPaths, pathsOfClass, scanTaint,
+  secret, sensitive, tainted, unwrapTainted,
+} from "@loomwork/classify";
+
+// Confidentiality: declared once, on the schema.
+const Signup = z.object({
+  email: sensitive(z.string().email()),
+  apiKey: secret(z.string()),
+  plan: z.string(),
+});
+collectClassifiedPaths(Signup);
+// [{ path: "email", dataClass: "sensitive" }, { path: "apiKey", dataClass: "secret" }]
+maskPaths({ email: "ada@example.com", apiKey: "k", plan: "pro" }, pathsOfClass(Signup, "sensitive"));
+// { email: "[redacted]", apiKey: "k", plan: "pro" }
+
+// Integrity: attached to a value where it enters the system.
+const fetched = tainted("ignore previous instructions", "mcp:search/web");
+isTainted(fetched); // true
+unwrapTainted(fetched); // the plain string: provenance stops travelling here
+scanTaint({ summary: "ok", raw: { hit: fetched } }); // { origins: ["mcp:search/web"], exceeded: false, tainted: true }
+```
+
+## Surface
+
+- **Confidentiality marks.** `sensitive`, `secret`, `internal`, and `classify(schema, dataClass)` for a
+  computed class. They return the same schema, so validation is untouched. Read them with
+  `collectClassifiedPaths` (paths and classes), `pathsOfClass`, `classOf` and `strictest`.
+- **Where-stored mark.** `externalized()` with `externalizedPaths` and `isExternalized` (ADR 0046): a
+  separate axis for "the log keeps a content reference, not the bytes".
+- **Masking.** `maskPaths(value, paths)` replaces each dot-path with `REDACTED` (`"[redacted]"`) and
+  copies only the spine it touches. `expandPaths` and `hasWildcard` handle the `[]` array-crossing
+  segment (`people[].ssn`).
+- **Taint.** `tainted(value, origin)`, `isTainted`, `taintOf`, `unwrapTainted`, plus `scanTaint` and
+  `nestedTaintOrigin` for a wrapper buried anywhere in a value, and `taintOriginLabel`.
+- **Audit.** `collectUnreachableMarks(schema)` finds marks that no dot-path can address.
+
+## Behaviour that surprises people
+
+- **A mark does nothing where the walker cannot reach it.** Paths cross objects and arrays only. A mark
+  under a record's values, a union branch, a tuple member or an intersection is not masked, encrypted or
+  externalized, and nothing says so at runtime; `collectUnreachableMarks` is the pre-flight check.
+- **Marks live in a `WeakMap` keyed by the schema instance**, not on the schema. The walker looks through
+  optional, nullable, default and effects wrappers, but a different schema object than the one you marked
+  carries no mark.
+- **`isTainted` looks at the top of a value only.** A producer that taints part of a result leaves a plain
+  object with a wrapper inside; use `scanTaint` for that. The scan is iterative and cycle-safe, and fails
+  closed: past depth 64 or 100,000 nodes it reports `exceeded: true` and `tainted: true`.
+- **Re-tainting keeps the original origin.** Provenance records where content entered.
+- **Taint is not retrofitted.** A log written before a producer applied `tainted()` replays without it.
+- **The origin is display text.** It often contains a third-party-controlled fragment and is escaped where
+  it is rendered.
+
+## Install
+
+Unpublished for now: inside this repo use `workspace:*`; from a sibling checkout use a `link:` override (see [AGENTS.md](../../AGENTS.md)).
+
+## See also
+
+- API reference: section "`@loomwork/classify` — what a value IS, on two axes" in [docs/api-reference.org](../../docs/api-reference.org). It lists `classify(schema)` as returning paths; in the source that is `collectClassifiedPaths`.
+- Guides: [data classification](../../docs/data-classification.md), [data protection patterns](../../docs/data-protection-patterns.md), [isolation and untrusted content](../../docs/user-guide/isolation-and-untrusted-content.md).
+- ADRs: [0085 untrusted-content integrity axis](../../docs/adr/0085-untrusted-content-integrity-axis.md), [0046 content store seam](../../docs/adr/0046-content-store-seam-thin-authoritative-log.md).
+- Source: `packages/classify/src`.

package/dist/classify.d.ts

@@ -0,0 +1,47 @@
+import type { z } from "zod";
+/** The three data-protection handling classes, ordered most-restrictive first. */
+export type DataClass = "secret" | "sensitive" | "internal";
+/**
+ * Tag a schema with a {@link DataClass}. Returns the SAME schema (validation unchanged) so
+ * it drops into a `z.object({ … })` shape transparently. Prefer the {@link secret} /
+ * {@link sensitive} / {@link internal} sugar; use this directly only for a computed class.
+ */
+export declare function classify<T extends z.ZodTypeAny>(schema: T, dataClass: DataClass): T;
+/** Mark a field `"secret"` — never persisted; substituted before it reaches the log. */
+export declare const secret: <T extends z.ZodTypeAny>(schema: T) => T;
+/** Mark a field `"sensitive"` — encrypted-at-rest, crypto-shreddable, scrubbed from egress. */
+export declare const sensitive: <T extends z.ZodTypeAny>(schema: T) => T;
+/** Mark a field `"internal"` — persisted in the clear but never egressed externally. */
+export declare const internal: <T extends z.ZodTypeAny>(schema: T) => T;
+/** The class a schema was tagged with, or `undefined` if unclassified. */
+export declare function classOf(schema: unknown): DataClass | undefined;
+/**
+ * Generic marked-path walker — the shared engine behind {@link collectClassifiedPaths} and the
+ * {@link externalized} marker. Walks an object schema, and for every node whose `markOf`
+ * returns a value emits `{ path, mark }`, recursing through nested objects and transparent
+ * wrappers. A marked *object* is reported at its own path and NOT descended into (the coarser
+ * mark wins — a marked address object is treated as a unit). Recurses THROUGH arrays with a
+ * `[]` crossing segment (`people[].ssn`), which the sinks expand against the concrete value
+ * (#260) — a mark inside an array element used to collect no path and silently do nothing.
+ * Deterministic: schema-declaration order (P2).
+ */
+export declare function collectMarkedPaths<T>(schema: z.ZodTypeAny, markOf: (node: z.ZodTypeAny) => T | undefined, prefix?: string): {
+    path: string;
+    mark: T;
+}[];
+/** A classified leaf/subtree and its dot-path from the walked root. */
+export interface ClassifiedPath {
+    /** Dot-path from the schema root, e.g. `"user.ssn"`. Empty for the root itself. */
+    path: string;
+    dataClass: DataClass;
+}
+/**
+ * Walk an object schema and collect every classified field as a `{ path, dataClass }` (over the
+ * `secret`/`sensitive`/`internal` taxonomy). Thin wrapper over {@link collectMarkedPaths}.
+ */
+export declare function collectClassifiedPaths(schema: z.ZodTypeAny, prefix?: string): ClassifiedPath[];
+/** The subset of {@link collectClassifiedPaths} matching one class (e.g. only `"sensitive"`). */
+export declare function pathsOfClass(schema: z.ZodTypeAny, dataClass: DataClass): string[];
+/** Strictest of two classes (secret > sensitive > internal); `undefined` is weakest. */
+export declare function strictest(a: DataClass | undefined, b: DataClass | undefined): DataClass | undefined;
+//# sourceMappingURL=classify.d.ts.map

package/dist/classify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.d.ts","sourceRoot":"","sources":["../src/classify.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAoB7B,kFAAkF;AAClF,MAAM,MAAM,SAAS,GAAG,QAAQ,GAAG,WAAW,GAAG,UAAU,CAAC;AAW5D;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,CAGnF;AAED,wFAAwF;AACxF,eAAO,MAAM,MAAM,GAAI,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAG,CAA+B,CAAC;AAC3F,+FAA+F;AAC/F,eAAO,MAAM,SAAS,GAAI,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAG,CAAkC,CAAC;AACjG,wFAAwF;AACxF,eAAO,MAAM,QAAQ,GAAI,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAG,CAAiC,CAAC;AAE/F,0EAA0E;AAC1E,wBAAgB,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,GAAG,SAAS,CAE9D;AA4CD;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,MAAM,EAAE,CAAC,CAAC,UAAU,EACpB,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,UAAU,KAAK,CAAC,GAAG,SAAS,EAC7C,MAAM,SAAK,GACV;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,CAAC,CAAA;CAAE,EAAE,CAsB7B;AASD,uEAAuE;AACvE,MAAM,WAAW,cAAc;IAC7B,mFAAmF;IACnF,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,SAAS,CAAC;CACtB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,CAAC,CAAC,UAAU,EAAE,MAAM,SAAK,GAAG,cAAc,EAAE,CAK1F;AAED,iGAAiG;AACjG,wBAAgB,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,GAAG,MAAM,EAAE,CAIjF;AAED,wFAAwF;AACxF,wBAAgB,SAAS,CACvB,CAAC,EAAE,SAAS,GAAG,SAAS,EACxB,CAAC,EAAE,SAAS,GAAG,SAAS,GACvB,SAAS,GAAG,SAAS,CAIvB"}

package/dist/classify.js

@@ -0,0 +1,147 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.internal = exports.sensitive = exports.secret = void 0;
+exports.classify = classify;
+exports.classOf = classOf;
+exports.collectMarkedPaths = collectMarkedPaths;
+exports.collectClassifiedPaths = collectClassifiedPaths;
+exports.pathsOfClass = pathsOfClass;
+exports.strictest = strictest;
+/** Rank for "the strictest class wins" merges (secret > sensitive > internal). */
+const RANK = { secret: 3, sensitive: 2, internal: 1 };
+// A schema instance → its class. A WeakMap (not a mutated property) keeps the marker
+// non-invasive: the Zod schema is returned byte-identical, its validation untouched, and
+// a schema that is GC'd drops its entry. Keyed by the exact instance the author passed,
+// which is the same instance a walker meets in `.shape`, so lookups line up.
+const registry = new WeakMap();
+/**
+ * Tag a schema with a {@link DataClass}. Returns the SAME schema (validation unchanged) so
+ * it drops into a `z.object({ … })` shape transparently. Prefer the {@link secret} /
+ * {@link sensitive} / {@link internal} sugar; use this directly only for a computed class.
+ */
+function classify(schema, dataClass) {
+    registry.set(schema, dataClass);
+    return schema;
+}
+/** Mark a field `"secret"` — never persisted; substituted before it reaches the log. */
+const secret = (schema) => classify(schema, "secret");
+exports.secret = secret;
+/** Mark a field `"sensitive"` — encrypted-at-rest, crypto-shreddable, scrubbed from egress. */
+const sensitive = (schema) => classify(schema, "sensitive");
+exports.sensitive = sensitive;
+/** Mark a field `"internal"` — persisted in the clear but never egressed externally. */
+const internal = (schema) => classify(schema, "internal");
+exports.internal = internal;
+/** The class a schema was tagged with, or `undefined` if unclassified. */
+function classOf(schema) {
+    return typeof schema === "object" && schema !== null ? registry.get(schema) : undefined;
+}
+// Unwrap the transparent wrappers Zod adds (.optional()/.nullable()/.default()/.refine())
+// so a marker survives being wrapped AFTER classification, and so an object nested under a
+// wrapper is still walked. Returns the wrapper chain (outermost→innermost) for class lookup
+// plus the innermost node for shape inspection.
+function chain(schema) {
+    const nodes = [];
+    let cur = schema;
+    // Guard against a pathological self-referential def; real schemas terminate quickly.
+    for (let i = 0; i < 100; i++) {
+        nodes.push(cur);
+        const def = cur._def;
+        const typeName = def?.typeName;
+        let next;
+        if (typeName === "ZodOptional" || typeName === "ZodNullable" || typeName === "ZodDefault") {
+            next = def?.innerType;
+        }
+        else if (typeName === "ZodEffects") {
+            next = def?.schema;
+        }
+        else {
+            break;
+        }
+        if (next === undefined)
+            break;
+        cur = next;
+    }
+    return { nodes, inner: cur };
+}
+/** The object `.shape` of a node, or `undefined` when it is not a `ZodObject`. */
+function objectShape(node) {
+    const def = node._def;
+    if (def?.typeName !== "ZodObject" || typeof def.shape !== "function")
+        return undefined;
+    return def.shape();
+}
+/** The mark on a schema, looking through any transparent wrappers around it (first wins). */
+function effectiveMark(schema, markOf) {
+    for (const node of chain(schema).nodes) {
+        const mark = markOf(node);
+        if (mark !== undefined)
+            return mark;
+    }
+    return undefined;
+}
+/**
+ * Generic marked-path walker — the shared engine behind {@link collectClassifiedPaths} and the
+ * {@link externalized} marker. Walks an object schema, and for every node whose `markOf`
+ * returns a value emits `{ path, mark }`, recursing through nested objects and transparent
+ * wrappers. A marked *object* is reported at its own path and NOT descended into (the coarser
+ * mark wins — a marked address object is treated as a unit). Recurses THROUGH arrays with a
+ * `[]` crossing segment (`people[].ssn`), which the sinks expand against the concrete value
+ * (#260) — a mark inside an array element used to collect no path and silently do nothing.
+ * Deterministic: schema-declaration order (P2).
+ */
+function collectMarkedPaths(schema, markOf, prefix = "") {
+    const out = [];
+    const mark = effectiveMark(schema, markOf);
+    if (mark !== undefined && prefix !== "") {
+        out.push({ path: prefix, mark });
+        return out;
+    }
+    const inner = chain(schema).inner;
+    const element = arrayElement(inner);
+    if (element !== undefined) {
+        // Cross the array. The prefix gains `[]`, so `people` + element mark `ssn` yields
+        // `people[].ssn`; a mark on the ELEMENT type itself yields `people[]`.
+        return collectMarkedPaths(element, markOf, `${prefix}[]`);
+    }
+    const shape = objectShape(inner);
+    if (shape !== undefined) {
+        for (const [key, child] of Object.entries(shape)) {
+            const childPath = prefix === "" ? key : `${prefix}.${key}`;
+            out.push(...collectMarkedPaths(child, markOf, childPath));
+        }
+    }
+    return out;
+}
+/** The element type, if this node is an array. */
+function arrayElement(node) {
+    const def = node._def;
+    if (def?.typeName !== "ZodArray")
+        return undefined;
+    return def.type;
+}
+/**
+ * Walk an object schema and collect every classified field as a `{ path, dataClass }` (over the
+ * `secret`/`sensitive`/`internal` taxonomy). Thin wrapper over {@link collectMarkedPaths}.
+ */
+function collectClassifiedPaths(schema, prefix = "") {
+    return collectMarkedPaths(schema, (node) => classOf(node), prefix).map((m) => ({
+        path: m.path,
+        dataClass: m.mark,
+    }));
+}
+/** The subset of {@link collectClassifiedPaths} matching one class (e.g. only `"sensitive"`). */
+function pathsOfClass(schema, dataClass) {
+    return collectClassifiedPaths(schema)
+        .filter((c) => c.dataClass === dataClass)
+        .map((c) => c.path);
+}
+/** Strictest of two classes (secret > sensitive > internal); `undefined` is weakest. */
+function strictest(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    return RANK[a] >= RANK[b] ? a : b;
+}
+//# sourceMappingURL=classify.js.map

package/dist/classify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.js","sourceRoot":"","sources":["../src/classify.ts"],"names":[],"mappings":";;;AAqCA,4BAGC;AAUD,0BAEC;AAsDD,gDA0BC;AAoBD,wDAKC;AAGD,oCAIC;AAGD,8BAOC;AAvJD,kFAAkF;AAClF,MAAM,IAAI,GAA8B,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AAEjF,qFAAqF;AACrF,yFAAyF;AACzF,wFAAwF;AACxF,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAqB,CAAC;AAElD;;;;GAIG;AACH,SAAgB,QAAQ,CAAyB,MAAS,EAAE,SAAoB;IAC9E,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wFAAwF;AACjF,MAAM,MAAM,GAAG,CAAyB,MAAS,EAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAA9E,QAAA,MAAM,UAAwE;AAC3F,+FAA+F;AACxF,MAAM,SAAS,GAAG,CAAyB,MAAS,EAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAApF,QAAA,SAAS,aAA2E;AACjG,wFAAwF;AACjF,MAAM,QAAQ,GAAG,CAAyB,MAAS,EAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAAlF,QAAA,QAAQ,YAA0E;AAE/F,0EAA0E;AAC1E,SAAgB,OAAO,CAAC,MAAe;IACrC,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAgB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACpG,CAAC;AAED,0FAA0F;AAC1F,2FAA2F;AAC3F,4FAA4F;AAC5F,gDAAgD;AAChD,SAAS,KAAK,CAAC,MAAoB;IACjC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,GAAG,GAAiB,MAAM,CAAC;IAC/B,qFAAqF;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,GAAG,GAAI,GAA0C,CAAC,IAAI,CAAC;QAC7D,MAAM,QAAQ,GAAG,GAAG,EAAE,QAA8B,CAAC;QACrD,IAAI,IAAa,CAAC;QAClB,IAAI,QAAQ,KAAK,aAAa,IAAI,QAAQ,KAAK,aAAa,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC1F,IAAI,GAAG,GAAG,EAAE,SAAS,CAAC;QACxB,CAAC;aAAM,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YACrC,IAAI,GAAG,GAAG,EAAE,MAAM,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,MAAM;QACR,CAAC;QACD,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM;QAC9B,GAAG,GAAG,IAAoB,CAAC;IAC7B,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC/B,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAAC,IAAkB;IACrC,MAAM,GAAG,GAAI,IAAgE,CAAC,IAAI,CAAC;IACnF,IAAI,GAAG,EAAE,QAAQ,KAAK,WAAW,IAAI,OAAO,GAAG,CAAC,KAAK,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACvF,OAAO,GAAG,CAAC,KAAK,EAAkC,CAAC;AACrD,CAAC;AAED,6FAA6F;AAC7F,SAAS,aAAa,CAAI,MAAoB,EAAE,MAA6C;IAC3F,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;IACtC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,kBAAkB,CAChC,MAAoB,EACpB,MAA6C,EAC7C,MAAM,GAAG,EAAE;IAEX,MAAM,GAAG,GAAgC,EAAE,CAAC;IAC5C,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QACjC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC;IAClC,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,kFAAkF;QAClF,uEAAuE;QACvE,OAAO,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACjD,MAAM,SAAS,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,GAAG,EAAE,CAAC;YAC3D,GAAG,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kDAAkD;AAClD,SAAS,YAAY,CAAC,IAAkB;IACtC,MAAM,GAAG,GAAI,IAAyD,CAAC,IAAI,CAAC;IAC5E,IAAI,GAAG,EAAE,QAAQ,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACnD,OAAO,GAAG,CAAC,IAAgC,CAAC;AAC9C,CAAC;AASD;;;GAGG;AACH,SAAgB,sBAAsB,CAAC,MAAoB,EAAE,MAAM,GAAG,EAAE;IACtE,OAAO,kBAAkB,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7E,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,SAAS,EAAE,CAAC,CAAC,IAAI;KAClB,CAAC,CAAC,CAAC;AACN,CAAC;AAED,iGAAiG;AACjG,SAAgB,YAAY,CAAC,MAAoB,EAAE,SAAoB;IACrE,OAAO,sBAAsB,CAAC,MAAM,CAAC;SAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC;SACxC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED,wFAAwF;AACxF,SAAgB,SAAS,CACvB,CAAwB,EACxB,CAAwB;IAExB,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC"}

package/dist/esm/classify.js

@@ -0,0 +1,135 @@
+/** Rank for "the strictest class wins" merges (secret > sensitive > internal). */
+const RANK = { secret: 3, sensitive: 2, internal: 1 };
+// A schema instance → its class. A WeakMap (not a mutated property) keeps the marker
+// non-invasive: the Zod schema is returned byte-identical, its validation untouched, and
+// a schema that is GC'd drops its entry. Keyed by the exact instance the author passed,
+// which is the same instance a walker meets in `.shape`, so lookups line up.
+const registry = new WeakMap();
+/**
+ * Tag a schema with a {@link DataClass}. Returns the SAME schema (validation unchanged) so
+ * it drops into a `z.object({ … })` shape transparently. Prefer the {@link secret} /
+ * {@link sensitive} / {@link internal} sugar; use this directly only for a computed class.
+ */
+export function classify(schema, dataClass) {
+    registry.set(schema, dataClass);
+    return schema;
+}
+/** Mark a field `"secret"` — never persisted; substituted before it reaches the log. */
+export const secret = (schema) => classify(schema, "secret");
+/** Mark a field `"sensitive"` — encrypted-at-rest, crypto-shreddable, scrubbed from egress. */
+export const sensitive = (schema) => classify(schema, "sensitive");
+/** Mark a field `"internal"` — persisted in the clear but never egressed externally. */
+export const internal = (schema) => classify(schema, "internal");
+/** The class a schema was tagged with, or `undefined` if unclassified. */
+export function classOf(schema) {
+    return typeof schema === "object" && schema !== null ? registry.get(schema) : undefined;
+}
+// Unwrap the transparent wrappers Zod adds (.optional()/.nullable()/.default()/.refine())
+// so a marker survives being wrapped AFTER classification, and so an object nested under a
+// wrapper is still walked. Returns the wrapper chain (outermost→innermost) for class lookup
+// plus the innermost node for shape inspection.
+function chain(schema) {
+    const nodes = [];
+    let cur = schema;
+    // Guard against a pathological self-referential def; real schemas terminate quickly.
+    for (let i = 0; i < 100; i++) {
+        nodes.push(cur);
+        const def = cur._def;
+        const typeName = def?.typeName;
+        let next;
+        if (typeName === "ZodOptional" || typeName === "ZodNullable" || typeName === "ZodDefault") {
+            next = def?.innerType;
+        }
+        else if (typeName === "ZodEffects") {
+            next = def?.schema;
+        }
+        else {
+            break;
+        }
+        if (next === undefined)
+            break;
+        cur = next;
+    }
+    return { nodes, inner: cur };
+}
+/** The object `.shape` of a node, or `undefined` when it is not a `ZodObject`. */
+function objectShape(node) {
+    const def = node._def;
+    if (def?.typeName !== "ZodObject" || typeof def.shape !== "function")
+        return undefined;
+    return def.shape();
+}
+/** The mark on a schema, looking through any transparent wrappers around it (first wins). */
+function effectiveMark(schema, markOf) {
+    for (const node of chain(schema).nodes) {
+        const mark = markOf(node);
+        if (mark !== undefined)
+            return mark;
+    }
+    return undefined;
+}
+/**
+ * Generic marked-path walker — the shared engine behind {@link collectClassifiedPaths} and the
+ * {@link externalized} marker. Walks an object schema, and for every node whose `markOf`
+ * returns a value emits `{ path, mark }`, recursing through nested objects and transparent
+ * wrappers. A marked *object* is reported at its own path and NOT descended into (the coarser
+ * mark wins — a marked address object is treated as a unit). Recurses THROUGH arrays with a
+ * `[]` crossing segment (`people[].ssn`), which the sinks expand against the concrete value
+ * (#260) — a mark inside an array element used to collect no path and silently do nothing.
+ * Deterministic: schema-declaration order (P2).
+ */
+export function collectMarkedPaths(schema, markOf, prefix = "") {
+    const out = [];
+    const mark = effectiveMark(schema, markOf);
+    if (mark !== undefined && prefix !== "") {
+        out.push({ path: prefix, mark });
+        return out;
+    }
+    const inner = chain(schema).inner;
+    const element = arrayElement(inner);
+    if (element !== undefined) {
+        // Cross the array. The prefix gains `[]`, so `people` + element mark `ssn` yields
+        // `people[].ssn`; a mark on the ELEMENT type itself yields `people[]`.
+        return collectMarkedPaths(element, markOf, `${prefix}[]`);
+    }
+    const shape = objectShape(inner);
+    if (shape !== undefined) {
+        for (const [key, child] of Object.entries(shape)) {
+            const childPath = prefix === "" ? key : `${prefix}.${key}`;
+            out.push(...collectMarkedPaths(child, markOf, childPath));
+        }
+    }
+    return out;
+}
+/** The element type, if this node is an array. */
+function arrayElement(node) {
+    const def = node._def;
+    if (def?.typeName !== "ZodArray")
+        return undefined;
+    return def.type;
+}
+/**
+ * Walk an object schema and collect every classified field as a `{ path, dataClass }` (over the
+ * `secret`/`sensitive`/`internal` taxonomy). Thin wrapper over {@link collectMarkedPaths}.
+ */
+export function collectClassifiedPaths(schema, prefix = "") {
+    return collectMarkedPaths(schema, (node) => classOf(node), prefix).map((m) => ({
+        path: m.path,
+        dataClass: m.mark,
+    }));
+}
+/** The subset of {@link collectClassifiedPaths} matching one class (e.g. only `"sensitive"`). */
+export function pathsOfClass(schema, dataClass) {
+    return collectClassifiedPaths(schema)
+        .filter((c) => c.dataClass === dataClass)
+        .map((c) => c.path);
+}
+/** Strictest of two classes (secret > sensitive > internal); `undefined` is weakest. */
+export function strictest(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    return RANK[a] >= RANK[b] ? a : b;
+}
+//# sourceMappingURL=classify.js.map

package/dist/esm/classify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.js","sourceRoot":"","sources":["../../src/classify.ts"],"names":[],"mappings":"AAuBA,kFAAkF;AAClF,MAAM,IAAI,GAA8B,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AAEjF,qFAAqF;AACrF,yFAAyF;AACzF,wFAAwF;AACxF,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAqB,CAAC;AAElD;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAyB,MAAS,EAAE,SAAoB;IAC9E,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wFAAwF;AACxF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAyB,MAAS,EAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAC3F,+FAA+F;AAC/F,MAAM,CAAC,MAAM,SAAS,GAAG,CAAyB,MAAS,EAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AACjG,wFAAwF;AACxF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAyB,MAAS,EAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AAE/F,0EAA0E;AAC1E,MAAM,UAAU,OAAO,CAAC,MAAe;IACrC,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAgB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACpG,CAAC;AAED,0FAA0F;AAC1F,2FAA2F;AAC3F,4FAA4F;AAC5F,gDAAgD;AAChD,SAAS,KAAK,CAAC,MAAoB;IACjC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,GAAG,GAAiB,MAAM,CAAC;IAC/B,qFAAqF;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,GAAG,GAAI,GAA0C,CAAC,IAAI,CAAC;QAC7D,MAAM,QAAQ,GAAG,GAAG,EAAE,QAA8B,CAAC;QACrD,IAAI,IAAa,CAAC;QAClB,IAAI,QAAQ,KAAK,aAAa,IAAI,QAAQ,KAAK,aAAa,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC1F,IAAI,GAAG,GAAG,EAAE,SAAS,CAAC;QACxB,CAAC;aAAM,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YACrC,IAAI,GAAG,GAAG,EAAE,MAAM,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,MAAM;QACR,CAAC;QACD,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM;QAC9B,GAAG,GAAG,IAAoB,CAAC;IAC7B,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC/B,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAAC,IAAkB;IACrC,MAAM,GAAG,GAAI,IAAgE,CAAC,IAAI,CAAC;IACnF,IAAI,GAAG,EAAE,QAAQ,KAAK,WAAW,IAAI,OAAO,GAAG,CAAC,KAAK,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACvF,OAAO,GAAG,CAAC,KAAK,EAAkC,CAAC;AACrD,CAAC;AAED,6FAA6F;AAC7F,SAAS,aAAa,CAAI,MAAoB,EAAE,MAA6C;IAC3F,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;IACtC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAoB,EACpB,MAA6C,EAC7C,MAAM,GAAG,EAAE;IAEX,MAAM,GAAG,GAAgC,EAAE,CAAC;IAC5C,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QACjC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC;IAClC,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,kFAAkF;QAClF,uEAAuE;QACvE,OAAO,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACjD,MAAM,SAAS,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,GAAG,EAAE,CAAC;YAC3D,GAAG,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kDAAkD;AAClD,SAAS,YAAY,CAAC,IAAkB;IACtC,MAAM,GAAG,GAAI,IAAyD,CAAC,IAAI,CAAC;IAC5E,IAAI,GAAG,EAAE,QAAQ,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACnD,OAAO,GAAG,CAAC,IAAgC,CAAC;AAC9C,CAAC;AASD;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAAoB,EAAE,MAAM,GAAG,EAAE;IACtE,OAAO,kBAAkB,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7E,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,SAAS,EAAE,CAAC,CAAC,IAAI;KAClB,CAAC,CAAC,CAAC;AACN,CAAC;AAED,iGAAiG;AACjG,MAAM,UAAU,YAAY,CAAC,MAAoB,EAAE,SAAoB;IACrE,OAAO,sBAAsB,CAAC,MAAM,CAAC;SAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC;SACxC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,SAAS,CACvB,CAAwB,EACxB,CAAwB;IAExB,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC"}