@keelcodes/policy 0.1.0

package/LICENSE

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

@@ -0,0 +1,137 @@
+# @keelcodes/policy
+
+Account-agnostic authorization policy for agent accounts.
+
+A policy declares **what an agent may do** with an account: which target
+contracts it may call, which methods on them, and the value / frequency
+ceilings. The model contains no account-specific encoding, so the same `Policy`
+works across Kernel, Nexus and Safe7579.
+
+This package is the **off-chain core**: the DSL, a canonical commitment hash, a
+pre-check / simulation layer, and multi-session lifecycle management. The
+on-chain carrier for enforcement is a **Keel ERC-7579 hook module**
+(account-agnostic: a hook sees the execution of any 7579 account without parsing
+account-specific call data). The hook recomputes the same commitment, so the two
+layers cannot disagree about what a policy means.
+
+## Policy DSL
+
+```ts
+import { normalizePolicy, policyCommitment } from '@keelcodes/policy';
+
+const policy = normalizePolicy({
+  validAfter: 0n,          // unix seconds; 0 = immediately
+  validUntil: 1_800_000_000n, // 0 = never
+  rules: [{
+    target: USDC, selectors: ['0xa9059cbb'],
+    maxPerTx: 10n ** 6n, maxDaily: 10n ** 7n, maxCalls: 50,   // native value / count
+    tokenLimits: [{ token: USDC, maxPerTx: 10n ** 6n, maxDaily: 10n ** 7n }], // ERC-20 amount
+  }],
+});
+
+policyCommitment(policy); // keccak256(abi.encode(version, validAfter, validUntil, rules))
+```
+
+Each rule scopes to one `target` with optional `selectors` (empty = any method)
+and ceilings: `maxPerTx` (native value per call), `maxDaily` (native value per
+day), `maxCalls` (call count). `0` / omitted means unlimited.
+
+`normalizePolicy` fills every optional with its zero default and lower-cases
+addresses, so `{ maxPerTx: 0n }` and `{}` produce the **same** commitment. A
+malformed policy throws `PolicyError` at definition time.
+
+## ERC-20 token limits
+
+`tokenLimits` adds per-token amount ceilings (`maxPerTx` / `maxDaily`) on top
+of the native-value caps. The token must equal the rule's `target` — a cap can
+only be enforced on calls made **directly** to the token, so a limit for any
+other address is rejected as dead config.
+
+Amounts are read from the standard `transfer` / `approve` / `transferFrom` call
+data (the amount is the final `uint256` word). While a limit is configured:
+
+- `transfer` / `approve` are capped by the token ceilings;
+- `transferFrom` is **refused** (`token-transfer-from-blocked`) — bounding a
+  pull from an arbitrary address is ambiguous, so the conservative choice is to
+  reject it;
+- a malformed standard call is refused (`token-amount-unparsable`);
+- any other selector is left to the rule's `selectors` whitelist.
+
+Token caps apply to the immediate call target only; a token moved *inside* a
+router call is not covered by this rule (use a rule on the token itself).
+
+## Pre-check & simulation
+
+`evaluateCall` applies validity, rule matching (first match in declared order)
+and the ceilings. `simulateCalls` dry-runs a batch, accumulating usage so a
+batch that only breaches a cap together is caught, and returns the first denial
+with a machine-readable reason — before a bundler round-trip that would end in
+a validation failure.
+
+```ts
+import { evaluateCall, simulateCalls, toCall } from '@keelcodes/policy';
+
+const call = toCall({ target: USDC, value: 0n, data: transferCalldata });
+evaluateCall(policy, { now: 1_700_000_000n, usage: [] }, call);
+// → { allowed: true, ruleIndex: 0 }
+```
+
+`PolicyState.usage` is aligned to `policy.rules` by index; callers reset
+`dailySpent` / `tokenSpent` when the day window rolls over.
+
+## Hook install payload
+
+The on-chain hook installs one session at a time. `encodeInstallData(sessionId,
+policy)` builds the exact payload it decodes — `abi.encode(bytes32 sessionId,
+bytes policyData)` with `policyData = encodePolicy(policy)`. The session's
+on-chain commitment is therefore `keccak256(policyData) === policyCommitment(policy)`,
+so an installed session can be verified against what was signed.
+
+```ts
+import { encodeInstallData } from '@keelcodes/policy';
+
+encodeInstallData(session.id, session.policy); // → onInstall bytes
+```
+
+## Multi-session lifecycle
+
+An account may hold **many concurrent sessions** — one policy grant each — which
+fixes the old "one account, one session" limitation. A session is an immutable
+record carrying the policy, its commitment and lifecycle metadata, and it holds
+**no key material**: it references a policy, not a private key, so key custody
+stays with the caller (KMS or the client).
+
+```ts
+import { InMemorySessionStore, issueSession, revokeSession, rotateSession } from '@keelcodes/policy';
+
+const store = new InMemorySessionStore();
+const session = await issueSession(store, { account, policy, now });
+await revokeSession(store, session.id, now);
+const { previous, next } = await rotateSession(store, session.id, { policy, now });
+```
+
+`sessionStatus(session, now)` derives `pending` / `active` / `expired` /
+`revoked` from the record, and `listSessions(store, account, now)` returns an
+account's sessions with their status. Revocation is append-only (the record is
+kept with `revokedAt`, so it stays auditable), and a rotation cross-links the
+predecessor and successor (`rotatedFrom` / `rotatedTo`) — the off-chain half of
+the migration "uninstall old module + install new" (docs/KEEL_PLAN.md §7.5).
+Persistence goes through the async `SessionStore` port, so a database-backed
+store drops in; `InMemorySessionStore` is the minimal reference (no tenancy —
+one Keel stack per product, see §6.3).
+
+## Scope
+
+- ✅ Declarative DSL + normalisation + validation
+- ✅ Canonical commitment hash (ABI encoding shared with the on-chain carrier)
+- ✅ Off-chain pre-check + batch simulation
+- ✅ ERC-20 token limits (`maxPerTx` / `maxDaily` per token)
+- ✅ ERC-7579 hook module (`KeelPolicyHook`, Solidity) enforcing the same rules on-chain, many sessions per account (see `contracts/`)
+- ✅ Multi-session lifecycle (issue / revoke / rotate) + pluggable `SessionStore`
+
+Pre-alpha. The public API is not stable yet.
+
+## Out of scope
+
+- Account implementations (see `@keelcodes/adapters`)
+- Billing and multi-tenancy

package/dist/bounded.d.ts

@@ -0,0 +1,192 @@
+import type { Address, Hex } from './types.js';
+/** Schema version mixed into `capabilityRoot`, so a future profile change can never collide with an older one. */
+export declare const CAPABILITY_VERSION = 1;
+/**
+ * Lifecycle status of an envelope, matching the standard's `Status` enum
+ * (including `None`, the "unknown id" result of `getStatus`).
+ */
+export declare enum EnvelopeStatus {
+    None = 0,
+    Active = 1,
+    Completed = 2,
+    Contested = 3,
+    Revoked = 4,
+    Expired = 5
+}
+/**
+ * A committed label a consumer can require a minimum of (e.g. a target
+ * contract that only accepts envelopes of tier >= 2). The standard treats
+ * `capabilityRoot` as opaque; Keel fixes four ordered tiers so the label is
+ * meaningful across the policy layer, the substrate and the manifest layer.
+ */
+export type TrustTier = 0 | 1 | 2 | 3;
+/** An M-of-N approval set; `threshold` of `approvers` must sign before a release gate opens. */
+export interface ApprovalInput {
+    /** Number of approvals required; `0` means no approval gate. */
+    threshold?: number;
+    /** Distinct approver addresses. */
+    approvers?: readonly Address[];
+}
+/** The bounded authority an envelope commits to, as authored. */
+export interface CapabilityInput {
+    /** Asset the budget is denominated in; the zero address means native value. */
+    asset: Address;
+    /** Budget ceiling for the whole envelope; `0` means no spend authority. */
+    cap?: bigint;
+    /** Ordered trust label consumers may require a minimum of; defaults to 0. */
+    trustTier?: TrustTier;
+    /** Unix seconds before which no draw may be released; `0` means immediately. */
+    notBefore?: bigint;
+    /** M-of-N gate that must be satisfied before any draw is released. */
+    approvals?: ApprovalInput;
+    /** Whether the envelope may delegate an attenuated child. */
+    delegate?: boolean;
+}
+/** A fully-populated, hash-stable capability. */
+export interface Capability {
+    readonly version: number;
+    readonly asset: Address;
+    readonly cap: bigint;
+    readonly trustTier: TrustTier;
+    readonly notBefore: bigint;
+    readonly approvals: {
+        readonly threshold: number;
+        readonly approvers: readonly Address[];
+    };
+    readonly delegate: boolean;
+}
+/** Running aggregate state committed by `cursorRoot`. */
+export interface Cursor {
+    /** Total amount drawn against the capability so far. */
+    readonly spent: bigint;
+    /** Number of draws, used for idempotency and telemetry. */
+    readonly draws: number;
+    /** Unix seconds of the most recent advance; `0` until the first draw. */
+    readonly lastAdvance: bigint;
+}
+/** An on-chain envelope, as read from a registry. */
+export interface Envelope {
+    readonly id: Hex;
+    readonly principal: Address;
+    readonly capabilityRoot: Hex;
+    readonly cursorRoot: Hex;
+    readonly createdAt: bigint;
+    readonly expiresAt: bigint;
+    readonly status: EnvelopeStatus;
+}
+/** Cross-chain/same-chain reference to an envelope; the pair (registry, id) suffices on one chain. */
+export interface EnvelopeRef {
+    readonly chainId: bigint;
+    readonly registry: Address;
+    readonly id: Hex;
+}
+/** Why a draw was refused. */
+export type DrawDenyReason = 'envelope-not-active' | 'not-yet-released' | 'cap-exceeded' | 'approval-required' | 'trust-tier-too-low';
+/** The context a draw is evaluated in. */
+export interface DrawContext {
+    /** Current unix time in seconds. */
+    readonly now: bigint;
+    /** Effective status of the envelope at `now`. */
+    readonly status: EnvelopeStatus;
+    /** Collected approvals (distinct approver addresses). */
+    readonly approvals?: readonly Address[];
+    /** Minimum trust tier the caller requires; defaults to 0. */
+    readonly minTier?: TrustTier;
+}
+/** Result of a draw evaluation; `reason` is set only when `allowed` is false. */
+export interface DrawDecision {
+    readonly allowed: boolean;
+    readonly reason?: DrawDenyReason;
+}
+declare const ZERO_ADDRESS: Address;
+/**
+ * Validates an authored capability and returns its normalised form. Addresses
+ * are lower-cased and every optional field is filled with its default, so
+ * semantically identical capabilities always commit to the same root.
+ */
+export declare function normalizeCapability(input: CapabilityInput): Capability;
+/** Canonical ABI encoding of a normalised capability. */
+export declare function encodeCapability(capability: Capability): Hex;
+/** `capabilityRoot = keccak256(encodeCapability(capability))`. */
+export declare function capabilityCommitment(capability: Capability): Hex;
+/** Canonical ABI encoding of a cursor. */
+export declare function encodeCursor(cursor: Cursor): Hex;
+/** `cursorRoot = keccak256(encodeCursor(cursor))`. */
+export declare function cursorCommitment(cursor: Cursor): Hex;
+/** The cursor of an envelope that has never been drawn against. */
+export declare const ZERO_CURSOR: Cursor;
+/**
+ * Deterministic envelope id, per the standard's recommended derivation
+ * `keccak256(abi.encode(registry, principal, capabilityRoot, salt))`. A
+ * registry may precompute it before registering so a reference can be embedded
+ * upstream.
+ */
+export declare function envelopeId(params: {
+    registry: Address;
+    principal: Address;
+    capabilityRoot: Hex;
+    salt: Hex;
+}): Hex;
+/** Remaining headroom under a capability's cap. Never negative. */
+export declare function remaining(capability: Capability, cursor: Cursor): bigint;
+/**
+ * The budget invariant, `spent + amount <= cap`. Exposed separately so a
+ * caller can check a prospective draw without constructing a full context.
+ */
+export declare function withinCap(capability: Capability, cursor: Cursor, amount: bigint): boolean;
+/** Whether the collected approvals satisfy the capability's M-of-N gate. */
+export declare function approvalsSatisfied(capability: Capability, approvals: readonly Address[]): boolean;
+/**
+ * Evaluates a prospective draw. Mirrors the on-chain substrate's gates in the
+ * same order — status, release time, trust tier, approvals, then the budget
+ * invariant — so an off-chain denial is never more permissive than the chain.
+ */
+export declare function canDraw(capability: Capability, cursor: Cursor, amount: bigint, context: DrawContext): DrawDecision;
+/**
+ * Advances the cursor by one accepted draw. The caller must have obtained an
+ * allowed {@link canDraw} first; this function does not re-check the cap.
+ */
+export declare function advanceCursor(cursor: Cursor, amount: bigint, now: bigint): Cursor;
+/** Derived status: an envelope past its expiry reads as `Expired` while it is not terminal. */
+export declare function effectiveStatus(envelope: Envelope, now: bigint): EnvelopeStatus;
+/** Throws unless `allocations` sum to at most `rootCap` (conservation). */
+export declare function assertConservation(rootCap: bigint, allocations: readonly bigint[]): void;
+/**
+ * Derives an attenuated child capability from a parent.
+ *
+ * Narrowing only: the child's cap and trust tier may not exceed the parent's,
+ * its release time may not be earlier, its approval gate may not be weaker
+ * (threshold no lower, approvers a subset of the parent's) and its asset must
+ * match. A parent that is not allowed to delegate (or is itself attenuated) may
+ * not spawn a child at all. The child is always barred from delegating further,
+ * which is what makes attenuation non-transitive widening impossible.
+ */
+export declare function attenuate(parent: Capability, child: CapabilityInput, options?: {
+    parentAttenuated?: boolean;
+}): Capability;
+/** Whether `to` is a legal successor of `from`. */
+export declare function canSetStatus(from: EnvelopeStatus, to: EnvelopeStatus): boolean;
+/** Applies a status transition, throwing {@link EnvelopeError} when it is illegal. */
+export declare function applyStatus(envelope: Envelope, to: EnvelopeStatus): Envelope;
+/** Whether a status is terminal (no successor). */
+export declare function isTerminal(status: EnvelopeStatus): boolean;
+/**
+ * The contest window a challenge opens. Any party the substrate permits may
+ * contest an Active envelope; once contested, resolution must land within the
+ * window or any caller may resolve to the documented default (`Active`), which
+ * stops an accused party from running out the clock to foreclose a verdict.
+ */
+export interface ContestWindow {
+    /** Unix seconds the contest was opened. */
+    readonly contestedAt: bigint;
+    /** Unix seconds after which a default resolution is permitted. */
+    readonly resolutionDeadline: bigint;
+}
+/** Opens a contest window of `windowSeconds` from `now`. */
+export declare function openContest(now: bigint, windowSeconds: bigint): ContestWindow;
+/** Whether the window has elapsed at `now`, letting any caller resolve to the default. */
+export declare function contestExpired(window: ContestWindow, now: bigint): boolean;
+/** The documented default resolution: a still-open contest lapses back to Active. */
+export declare function defaultResolution(): EnvelopeStatus;
+export { ZERO_ADDRESS as ZERO_ASSET };
+//# sourceMappingURL=bounded.d.ts.map

package/dist/bounded.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded.d.ts","sourceRoot":"","sources":["../src/bounded.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AA4B/C,kHAAkH;AAClH,eAAO,MAAM,kBAAkB,IAAI,CAAC;AAEpC;;;GAGG;AACH,oBAAY,cAAc;IACxB,IAAI,IAAI;IACR,MAAM,IAAI;IACV,SAAS,IAAI;IACb,SAAS,IAAI;IACb,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;GAKG;AACH,MAAM,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAEtC,gGAAgG;AAChG,MAAM,WAAW,aAAa;IAC5B,gEAAgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,mCAAmC;IACnC,SAAS,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC;CAChC;AAED,iEAAiE;AACjE,MAAM,WAAW,eAAe;IAC9B,+EAA+E;IAC/E,KAAK,EAAE,OAAO,CAAC;IACf,2EAA2E;IAC3E,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,6EAA6E;IAC7E,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,gFAAgF;IAChF,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,SAAS,CAAC,EAAE,aAAa,CAAC;IAC1B,6DAA6D;IAC7D,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,iDAAiD;AACjD,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE;QAAE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,OAAO,EAAE,CAAA;KAAE,CAAC;IAC3F,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED,yDAAyD;AACzD,MAAM,WAAW,MAAM;IACrB,wDAAwD;IACxD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,2DAA2D;IAC3D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,yEAAyE;IACzE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED,qDAAqD;AACrD,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC;IACjB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC;CACjC;AAED,sGAAsG;AACtG,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC;CAClB;AAED,8BAA8B;AAC9B,MAAM,MAAM,cAAc,GACtB,qBAAqB,GACrB,kBAAkB,GAClB,cAAc,GACd,mBAAmB,GACnB,oBAAoB,CAAC;AAEzB,0CAA0C;AAC1C,MAAM,WAAW,WAAW;IAC1B,oCAAoC;IACpC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,iDAAiD;IACjD,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC;IAChC,yDAAyD;IACzD,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC;IACxC,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC;CAC9B;AAED,iFAAiF;AACjF,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC;CAClC;AAED,QAAA,MAAM,YAAY,EAAmD,OAAO,CAAC;AAoB7E;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,eAAe,GAAG,UAAU,CAmCtE;AAqBD,yDAAyD;AACzD,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,UAAU,GAAG,GAAG,CAW5D;AAED,kEAAkE;AAClE,wBAAgB,oBAAoB,CAAC,UAAU,EAAE,UAAU,GAAG,GAAG,CAEhE;AAED,0CAA0C;AAC1C,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAMhD;AAED,sDAAsD;AACtD,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAEpD;AAED,mEAAmE;AACnE,eAAO,MAAM,WAAW,EAAE,MAAgE,CAAC;AAE3F;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE;IACjC,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,cAAc,EAAE,GAAG,CAAC;IACpB,IAAI,EAAE,GAAG,CAAC;CACX,GAAG,GAAG,CAiBN;AAED,mEAAmE;AACnE,wBAAgB,SAAS,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAExE;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAGzF;AAED,4EAA4E;AAC5E,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,OAAO,EAAE,GAAG,OAAO,CAOjG;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CACrB,UAAU,EAAE,UAAU,EACtB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,WAAW,GACnB,YAAY,CAad;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAOjF;AAED,+FAA+F;AAC/F,wBAAgB,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,cAAc,CAK/E;AAaD,2EAA2E;AAC3E,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CASxF;AAED;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,UAAU,EAClB,KAAK,EAAE,eAAe,EACtB,OAAO,GAAE;IAAE,gBAAgB,CAAC,EAAE,OAAO,CAAA;CAAO,GAC3C,UAAU,CA4BZ;AAwBD,mDAAmD;AACnD,wBAAgB,YAAY,CAAC,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,GAAG,OAAO,CAE9E;AAED,sFAAsF;AACtF,wBAAgB,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,EAAE,cAAc,GAAG,QAAQ,CAK5E;AAED,mDAAmD;AACnD,wBAAgB,UAAU,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO,CAE1D;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,2CAA2C;IAC3C,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,kEAAkE;IAClE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;CACrC;AAED,4DAA4D;AAC5D,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,aAAa,CAG7E;AAED,0FAA0F;AAC1F,wBAAgB,cAAc,CAAC,MAAM,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAE1E;AAED,qFAAqF;AACrF,wBAAgB,iBAAiB,IAAI,cAAc,CAElD;AAED,OAAO,EAAE,YAAY,IAAI,UAAU,EAAE,CAAC"}