@keelcodes/cli 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,141 @@
+# @keelcodes/cli
+
+The `keel` command line — the operator-facing side of Keel, built so the checks
+you would run by hand are scriptable.
+
+```bash
+pnpm --filter @keelcodes/cli build
+node cli/dist/bin.js help
+```
+
+Installed as a dependency it publishes two equivalent binaries, `keel` and `kc`
+(the short alias avoids a collision with the unrelated `teamkeel` CLI):
+
+```bash
+keel version
+kc version
+```
+
+## Commands
+
+### `keel version`
+
+Print the CLI's own name and version, read from `package.json` so it cannot
+drift. `--json` for machine-readable output.
+
+### `keel policy check`
+
+Normalise an authored policy, print its canonical commitment hash, and — when a
+target is given — dry-run a call against it with the **same** `evaluateCall` the
+MCP server and the on-chain hook use.
+
+```bash
+keel policy check --policy policy.json
+# policy 0x9f…  (rules…)
+
+keel policy check --policy policy.json --target 0xToken… --value 500
+# commitment 0x9f…
+# call target=0xtoken… value=500 selector=0x
+# allow rule=0
+```
+
+Exit codes compose with a shell: **0** when the policy normalises (and the call,
+if any, is allowed), **1** when a call is denied or the policy is malformed, **2**
+on a usage error.
+
+The policy file is the authored `PolicyInput` shape, with wei amounts as decimal
+strings because JSON has no bigint:
+
+```json
+{
+  "validAfter": "0",
+  "validUntil": "0",
+  "rules": [
+    {
+      "target": "0x0000000000000000000000000000000000000001",
+      "selectors": ["0xa9059cbb"],
+      "maxPerTx": "1000000000000000000",
+      "maxDaily": "5000000000000000000",
+      "maxCalls": 20,
+      "tokenLimits": [{ "token": "0x…", "maxPerTx": "0", "maxDaily": "0" }]
+    }
+  ]
+}
+```
+
+Use `-` as the path to read the policy from stdin.
+
+### `keel migrate route`
+
+Route a session record to its module generation, using the same
+`createModuleRegistry` / `routeSession` the relay uses.
+
+```bash
+keel migrate route --registry registry.json --id s-1
+# session s-1 (no moduleVersion)
+#   → v2 encoding=onchain multiSession=true enforcedLimits=true
+
+keel migrate route --registry registry.json --id s-2 --module-version v1 --json
+```
+
+The registry file is either an array of module descriptors or an object with a
+`defaultVersion` and a `modules` array:
+
+```json
+{
+  "defaultVersion": "v2",
+  "modules": [
+    { "version": "v1", "encoding": "payload", "multiSession": false, "enforcedLimits": false },
+    { "version": "v2", "encoding": "onchain", "multiSession": true, "enforcedLimits": true }
+  ]
+}
+```
+
+A session with no `module-version` routes to the default generation — the lazy
+half of lazy migration. An unregistered version exits **1** with
+`unknown-module-version`.
+
+### `keel conformance list` / `keel conformance run`
+
+`list` prints the bundled suites; `run` executes one against a live chain and
+prints a per-assertion report. Exit code **1** when any check fails.
+
+```bash
+keel conformance list
+# ERC-7579 · ERC-7579 (Modular Smart Accounts) · 6 checks
+# ERC-7710 · ERC-7710 (Smart Contract Delegation) · 7 checks
+# ERC-7715 · ERC-7715 (Request Permissions from Wallets) · 4 checks
+# ERC-8004 · ERC-8004 (Trustless Agents) · 6 checks
+
+keel conformance run --rpc http://localhost:8545 --account 0x… --module 0x… --type 4
+keel conformance run --suite erc7710 --rpc http://localhost:8545 --manager 0x…
+keel conformance run --suite erc8004 --rpc http://localhost:8545 --identity-registry 0x… --agent-id 1
+```
+
+- **erc7579** (default): `--account`, `--module`, `--type` (module type id, default
+  `1`).
+- **erc7710**: `--manager`.
+- **erc8004**: `--identity-registry`, `--agent-id`, optional `--reputation-registry`.
+- **erc7715** needs a wallet (EIP-1193) provider, which a CLI cannot construct —
+  run it through the SDK.
+
+`--rpc` falls back to `KEEL_RPC_URL`. Add `--json` to emit the raw report.
+
+## Global options
+
+Options may be written `--name value`, `--name=value` or `-n value`; `--` ends
+option parsing. `--json` is supported by every command; `--help` (or `keel help`)
+prints usage.
+
+## Develop
+
+```bash
+pnpm --filter @keelcodes/cli build
+pnpm --filter @keelcodes/cli typecheck
+pnpm --filter @keelcodes/cli test
+```
+
+Commands are written against a small `CliIo` port (`out`, `err`, `readText`,
+`readStdin`, `env`), so the whole surface is tested in memory — see
+[`src/cli.test.ts`](src/cli.test.ts). The design intent is in
+[`docs/KEEL_PLAN.md`](../../docs/KEEL_PLAN.md) §4.4 ⑥.

package/dist/args.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Parsed command-line arguments: positionals plus named options.
+ *
+ * Options are collected in order, so a repeated option keeps every value and
+ * `get` returns the last one. The surface is deliberately tiny — the CLI has a
+ * handful of flags and no need for a parser dependency.
+ */
+export interface ParsedArgs {
+    readonly positionals: readonly string[];
+    /** The last value given for `name`, or `undefined`. */
+    get(name: string): string | undefined;
+    /** Every value given for `name`, in order. */
+    all(name: string): readonly string[];
+    /** Whether `name` was given at all. */
+    has(name: string): boolean;
+    /** Whether the boolean `name` was given. */
+    bool(name: string): boolean;
+    /** Like `get`, but throws a {@link UsageError} when absent. */
+    require(name: string): string;
+    /** Parses `name` as an integer, or `undefined` when absent. */
+    int(name: string): bigint | undefined;
+}
+/**
+ * Parses argv in `--name value`, `--name=value` and `-n value` forms. Names in
+ * `booleanFlags` take no value; `--` ends option parsing and everything after it
+ * is positional.
+ */
+export declare function parseArgs(argv: readonly string[], booleanFlags?: readonly string[]): ParsedArgs;
+//# sourceMappingURL=args.d.ts.map

package/dist/args.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"args.d.ts","sourceRoot":"","sources":["../src/args.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,uDAAuD;IACvD,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IACtC,8CAA8C;IAC9C,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC;IACrC,uCAAuC;IACvC,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAC3B,4CAA4C;IAC5C,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAC5B,+DAA+D;IAC/D,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,+DAA+D;IAC/D,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;CACvC;AA6CD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,YAAY,GAAE,SAAS,MAAM,EAAO,GAAG,UAAU,CAgDnG"}

package/dist/args.js

@@ -0,0 +1,86 @@
+import { UsageError } from './errors.js';
+class Args {
+    positionals;
+    values;
+    constructor(values, positionals) {
+        this.values = values;
+        this.positionals = positionals;
+    }
+    get(name) {
+        const list = this.values.get(name);
+        return list === undefined ? undefined : list[list.length - 1];
+    }
+    all(name) {
+        return this.values.get(name) ?? [];
+    }
+    has(name) {
+        return this.values.has(name);
+    }
+    bool(name) {
+        return this.get(name) === 'true';
+    }
+    require(name) {
+        const value = this.get(name);
+        if (value === undefined)
+            throw new UsageError(`missing required option --${name}`);
+        return value;
+    }
+    int(name) {
+        const value = this.get(name);
+        if (value === undefined)
+            return undefined;
+        try {
+            return BigInt(value);
+        }
+        catch {
+            throw new UsageError(`--${name} must be an integer, got "${value}"`);
+        }
+    }
+}
+/**
+ * Parses argv in `--name value`, `--name=value` and `-n value` forms. Names in
+ * `booleanFlags` take no value; `--` ends option parsing and everything after it
+ * is positional.
+ */
+export function parseArgs(argv, booleanFlags = []) {
+    const flags = new Set(booleanFlags);
+    const values = new Map();
+    const positionals = [];
+    const add = (name, value) => {
+        const list = values.get(name) ?? [];
+        list.push(value);
+        values.set(name, list);
+    };
+    for (let index = 0; index < argv.length; index += 1) {
+        const token = argv[index];
+        if (token === '--') {
+            positionals.push(...argv.slice(index + 1));
+            break;
+        }
+        const long = token.startsWith('--') ? token.slice(2) : undefined;
+        const short = long === undefined && token.startsWith('-') && token.length > 1 ? token.slice(1) : undefined;
+        if (long === undefined && short === undefined) {
+            positionals.push(token);
+            continue;
+        }
+        const name = long ?? short;
+        const equals = name.indexOf('=');
+        if (equals !== -1) {
+            add(name.slice(0, equals), name.slice(equals + 1));
+            continue;
+        }
+        if (flags.has(name)) {
+            add(name, 'true');
+            continue;
+        }
+        const next = argv[index + 1];
+        // A leading dash is an option, not a value — except for `-` (stdin) and negative numbers.
+        if (next === undefined || (next.startsWith('-') && next !== '-' && !/^-?\d/.test(next))) {
+            throw new UsageError(`option ${long === undefined ? `-${name}` : `--${name}`} needs a value`);
+        }
+        add(name, next);
+        index += 1;
+    }
+    return new Args(values, positionals);
+}
+//# sourceMappingURL=args.js.map

package/dist/args.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"args.js","sourceRoot":"","sources":["../src/args.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAyBzC,MAAM,IAAI;IACC,WAAW,CAAoB;IACvB,MAAM,CAAwB;IAE/C,YAAY,MAA6B,EAAE,WAA8B;QACvE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,GAAG,CAAC,IAAY;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACrC,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,CAAC,IAAY;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,IAAY;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM,IAAI,UAAU,CAAC,6BAA6B,IAAI,EAAE,CAAC,CAAC;QACnF,OAAO,KAAK,CAAC;IACf,CAAC;IAED,GAAG,CAAC,IAAY;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,IAAI,CAAC;YACH,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,UAAU,CAAC,KAAK,IAAI,6BAA6B,KAAK,GAAG,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAuB,EAAE,eAAkC,EAAE;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,KAAa,EAAQ,EAAE;QAChD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC,CAAC;IAEF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAE,CAAC;QAE3B,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM;QACR,CAAC;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjE,MAAM,KAAK,GAAG,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAE3G,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC9C,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,IAAI,KAAM,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;YAClB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACnD,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC7B,0FAA0F;QAC1F,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACxF,MAAM,IAAI,UAAU,CAAC,UAAU,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,gBAAgB,CAAC,CAAC;QAChG,CAAC;QACD,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IAED,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AACvC,CAAC"}

package/dist/bin.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=bin.d.ts.map

package/dist/bin.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.d.ts","sourceRoot":"","sources":["../src/bin.ts"],"names":[],"mappings":""}

package/dist/bin.js

@@ -0,0 +1,5 @@
+#!/usr/bin/env node
+import { createNodeIo } from './io.js';
+import { runCli } from './run.js';
+process.exitCode = await runCli(process.argv.slice(2), createNodeIo());
+//# sourceMappingURL=bin.js.map

package/dist/bin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.js","sourceRoot":"","sources":["../src/bin.ts"],"names":[],"mappings":";AACA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC,OAAO,CAAC,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC"}

package/dist/commands.d.ts

@@ -0,0 +1,30 @@
+import { type PolicyInput } from '@keelcodes/policy';
+import type { ParsedArgs } from './args.js';
+import { type CliIo } from './io.js';
+/** `keel version` — print the CLI's own name and version. */
+export declare function versionCommand(args: ParsedArgs, io: CliIo): number;
+/**
+ * `keel policy check` — normalise a policy and print its commitment. When a
+ * target is given, also dry-run a call against it. Exit code 1 when the call is
+ * denied, so it composes with `&&` in a script.
+ */
+export declare function policyCheck(args: ParsedArgs, io: CliIo): Promise<number>;
+/**
+ * `keel migrate route` — route a session record to its module generation using a
+ * registry read from a JSON file.
+ */
+export declare function migrateRoute(args: ParsedArgs, io: CliIo): Promise<number>;
+/** `keel conformance list` — print the available suites and their check counts. */
+export declare function conformanceList(args: ParsedArgs, io: CliIo): number;
+/**
+ * `keel conformance run` — run one suite against a live chain. Exit code 1 when
+ * the suite fails (any check, or a critical one).
+ */
+export declare function conformanceRun(args: ParsedArgs, io: CliIo): Promise<number>;
+/**
+ * Parses a policy as authored: the {@link PolicyInput} shape, with wei amounts
+ * written as decimal strings because JSON has no bigint. Throws a plain `Error`
+ * on a malformed shape — `normalizePolicy` then validates the meaning.
+ */
+export declare function parsePolicyInput(value: unknown): PolicyInput;
+//# sourceMappingURL=commands.d.ts.map

package/dist/commands.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"commands.d.ts","sourceRoot":"","sources":["../src/commands.ts"],"names":[],"mappings":"AAcA,OAAO,EAQL,KAAK,WAAW,EAGjB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,EAAa,KAAK,KAAK,EAAE,MAAM,SAAS,CAAC;AAWhD,6DAA6D;AAC7D,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,GAAG,MAAM,CAKlE;AAED;;;;GAIG;AACH,wBAAsB,WAAW,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CA0C9E;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CA6B/E;AAED,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,GAAG,MAAM,CAenE;AAED;;;GAGG;AACH,wBAAsB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAajF;AAqHD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,WAAW,CAY5D"}