@settlemint/sdk-cli 2.3.2-maine196276e → 2.3.2-maineefa9743

package/dist/cli.js

@@ -4158,7 +4158,7 @@ var require_webcrypto = __commonJS((exports) => {
   exports.gcm = /* @__PURE__ */ (() => generate(mode.GCM))();
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/cryptoNode.js
+// ../../node_modules/@noble/hashes/cryptoNode.js
 var require_cryptoNode2 = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.crypto = undefined;
@@ -4166,7 +4166,7 @@ var require_cryptoNode2 = __commonJS((exports) => {
   exports.crypto = nc && typeof nc === "object" && "webcrypto" in nc ? nc.webcrypto : nc && typeof nc === "object" && ("randomBytes" in nc) ? nc : undefined;
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/utils.js
+// ../../node_modules/@noble/hashes/utils.js
 var require_utils4 = __commonJS((exports) => {
   /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   Object.defineProperty(exports, "__esModule", { value: true });
@@ -4403,7 +4403,7 @@ var require_utils4 = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/_md.js
+// ../../node_modules/@noble/hashes/_md.js
 var require__md = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.SHA512_IV = exports.SHA384_IV = exports.SHA224_IV = exports.SHA256_IV = exports.HashMD = undefined;
@@ -4579,7 +4579,7 @@ var require__md = __commonJS((exports) => {
   ]);
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/_u64.js
+// ../../node_modules/@noble/hashes/_u64.js
 var require__u64 = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.toBig = exports.shrSL = exports.shrSH = exports.rotrSL = exports.rotrSH = exports.rotrBL = exports.rotrBH = exports.rotr32L = exports.rotr32H = exports.rotlSL = exports.rotlSH = exports.rotlBL = exports.rotlBH = exports.add5L = exports.add5H = exports.add4L = exports.add4H = exports.add3L = exports.add3H = undefined;
@@ -4672,7 +4672,7 @@ var require__u64 = __commonJS((exports) => {
   exports.default = u64;
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/sha2.js
+// ../../node_modules/@noble/hashes/sha2.js
 var require_sha2 = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.sha512_224 = exports.sha512_256 = exports.sha384 = exports.sha512 = exports.sha224 = exports.sha256 = exports.SHA512_256 = exports.SHA512_224 = exports.SHA384 = exports.SHA512 = exports.SHA224 = exports.SHA256 = undefined;
@@ -5142,7 +5142,7 @@ var require_sha2 = __commonJS((exports) => {
   exports.sha512_224 = (0, utils_ts_1.createHasher)(() => new SHA512_224);
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/utils.js
+// ../../node_modules/@noble/curves/abstract/utils.js
 var require_utils5 = __commonJS((exports) => {
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   Object.defineProperty(exports, "__esModule", { value: true });
@@ -5416,7 +5416,7 @@ var require_utils5 = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/modular.js
+// ../../node_modules/@noble/curves/abstract/modular.js
 var require_modular = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.isNegativeLE = undefined;
@@ -5746,7 +5746,7 @@ var require_modular = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/curve.js
+// ../../node_modules/@noble/curves/abstract/curve.js
 var require_curve = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.wNAF = wNAF;
@@ -5995,7 +5995,7 @@ var require_curve = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/edwards.js
+// ../../node_modules/@noble/curves/abstract/edwards.js
 var require_edwards = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.twistedEdwards = twistedEdwards;
@@ -6354,7 +6354,7 @@ var require_edwards = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/hash-to-curve.js
+// ../../node_modules/@noble/curves/abstract/hash-to-curve.js
 var require_hash_to_curve = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.expand_message_xmd = expand_message_xmd;
@@ -6507,7 +6507,7 @@ var require_hash_to_curve = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/montgomery.js
+// ../../node_modules/@noble/curves/abstract/montgomery.js
 var require_montgomery = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.montgomery = montgomery;
@@ -6614,7 +6614,7 @@ var require_montgomery = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/ed25519.js
+// ../../node_modules/@noble/curves/ed25519.js
 var require_ed25519 = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.hash_to_ristretto255 = exports.hashToRistretto255 = exports.RistrettoPoint = exports.encodeToCurve = exports.hashToCurve = exports.ed25519_hasher = exports.edwardsToMontgomery = exports.x25519 = exports.ed25519ph = exports.ed25519ctx = exports.ed25519 = exports.ED25519_TORSION_SUBGROUP = undefined;
@@ -6978,7 +6978,7 @@ var require_ed25519 = __commonJS((exports) => {
   exports.hash_to_ristretto255 = exports.hashToRistretto255;
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/hmac.js
+// ../../node_modules/@noble/hashes/hmac.js
 var require_hmac = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.hmac = exports.HMAC = undefined;
@@ -7054,7 +7054,7 @@ var require_hmac = __commonJS((exports) => {
   exports.hmac.create = (hash, key) => new HMAC(hash, key);
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/abstract/weierstrass.js
+// ../../node_modules/@noble/curves/abstract/weierstrass.js
 var require_weierstrass = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.DER = exports.DERErr = undefined;
@@ -7973,7 +7973,7 @@ var require_weierstrass = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/_shortw_utils.js
+// ../../node_modules/@noble/curves/_shortw_utils.js
 var require__shortw_utils = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.getHash = getHash;
@@ -7995,7 +7995,7 @@ var require__shortw_utils = __commonJS((exports) => {
   }
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/curves/secp256k1.js
+// ../../node_modules/@noble/curves/secp256k1.js
 var require_secp256k1 = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.encodeToCurve = exports.hashToCurve = exports.secp256k1_hasher = exports.schnorr = exports.secp256k1 = undefined;
@@ -8321,7 +8321,7 @@ var require_elliptic = __commonJS((exports) => {
   };
 });
 
-// ../../node_modules/eciesjs/node_modules/@noble/hashes/hkdf.js
+// ../../node_modules/@noble/hashes/hkdf.js
 var require_hkdf = __commonJS((exports) => {
   Object.defineProperty(exports, "__esModule", { value: true });
   exports.hkdf = undefined;
@@ -231606,7 +231606,7 @@ function size(value4) {
 var init_size = () => {};
 
 // ../../node_modules/viem/_esm/errors/version.js
-var version3 = "2.30.0";
+var version3 = "2.30.1";
 
 // ../../node_modules/viem/_esm/errors/base.js
 function walk(err, fn) {
@@ -232319,14 +232319,43 @@ var init_toBytes = __esm(() => {
   };
 });
 
-// ../../node_modules/@noble/hashes/esm/_assert.js
-function anumber(n6) {
-  if (!Number.isSafeInteger(n6) || n6 < 0)
-    throw new Error("positive integer expected, got " + n6);
+// ../../node_modules/@noble/hashes/esm/_u64.js
+function fromBig(n6, le4 = false) {
+  if (le4)
+    return { h: Number(n6 & U32_MASK64), l: Number(n6 >> _32n & U32_MASK64) };
+  return { h: Number(n6 >> _32n & U32_MASK64) | 0, l: Number(n6 & U32_MASK64) | 0 };
 }
+function split3(lst, le4 = false) {
+  const len = lst.length;
+  let Ah = new Uint32Array(len);
+  let Al = new Uint32Array(len);
+  for (let i6 = 0;i6 < len; i6++) {
+    const { h: h8, l: l3 } = fromBig(lst[i6], le4);
+    [Ah[i6], Al[i6]] = [h8, l3];
+  }
+  return [Ah, Al];
+}
+var U32_MASK64, _32n, rotlSH = (h8, l3, s7) => h8 << s7 | l3 >>> 32 - s7, rotlSL = (h8, l3, s7) => l3 << s7 | h8 >>> 32 - s7, rotlBH = (h8, l3, s7) => l3 << s7 - 32 | h8 >>> 64 - s7, rotlBL = (h8, l3, s7) => h8 << s7 - 32 | l3 >>> 64 - s7;
+var init__u64 = __esm(() => {
+  U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+  _32n = /* @__PURE__ */ BigInt(32);
+});
+
+// ../../node_modules/@noble/hashes/esm/cryptoNode.js
+import * as nc from "node:crypto";
+var crypto2;
+var init_cryptoNode = __esm(() => {
+  crypto2 = nc && typeof nc === "object" && "webcrypto" in nc ? nc.webcrypto : nc && typeof nc === "object" && ("randomBytes" in nc) ? nc : undefined;
+});
+
+// ../../node_modules/@noble/hashes/esm/utils.js
 function isBytes(a7) {
   return a7 instanceof Uint8Array || ArrayBuffer.isView(a7) && a7.constructor.name === "Uint8Array";
 }
+function anumber(n6) {
+  if (!Number.isSafeInteger(n6) || n6 < 0)
+    throw new Error("positive integer expected, got " + n6);
+}
 function abytes(b4, ...lengths) {
   if (!isBytes(b4))
     throw new Error("Uint8Array expected");
@@ -232335,7 +232364,7 @@ function abytes(b4, ...lengths) {
 }
 function ahash(h8) {
   if (typeof h8 !== "function" || typeof h8.create !== "function")
-    throw new Error("Hash should be wrapped by utils.wrapConstructor");
+    throw new Error("Hash should be wrapped by utils.createHasher");
   anumber(h8.outputLen);
   anumber(h8.blockLen);
 }
@@ -232352,40 +232381,14 @@ function aoutput(out, instance) {
     throw new Error("digestInto() expects output buffer of length at least " + min);
   }
 }
-var init__assert = () => {};
-
-// ../../node_modules/@noble/hashes/esm/_u64.js
-function fromBig(n6, le4 = false) {
-  if (le4)
-    return { h: Number(n6 & U32_MASK64), l: Number(n6 >> _32n & U32_MASK64) };
-  return { h: Number(n6 >> _32n & U32_MASK64) | 0, l: Number(n6 & U32_MASK64) | 0 };
-}
-function split3(lst, le4 = false) {
-  let Ah = new Uint32Array(lst.length);
-  let Al = new Uint32Array(lst.length);
-  for (let i6 = 0;i6 < lst.length; i6++) {
-    const { h: h8, l: l3 } = fromBig(lst[i6], le4);
-    [Ah[i6], Al[i6]] = [h8, l3];
-  }
-  return [Ah, Al];
-}
-var U32_MASK64, _32n, rotlSH = (h8, l3, s7) => h8 << s7 | l3 >>> 32 - s7, rotlSL = (h8, l3, s7) => l3 << s7 | h8 >>> 32 - s7, rotlBH = (h8, l3, s7) => l3 << s7 - 32 | h8 >>> 64 - s7, rotlBL = (h8, l3, s7) => h8 << s7 - 32 | l3 >>> 64 - s7;
-var init__u64 = __esm(() => {
-  U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-  _32n = /* @__PURE__ */ BigInt(32);
-});
-
-// ../../node_modules/@noble/hashes/esm/cryptoNode.js
-import * as nc from "node:crypto";
-var crypto2;
-var init_cryptoNode = __esm(() => {
-  crypto2 = nc && typeof nc === "object" && "webcrypto" in nc ? nc.webcrypto : nc && typeof nc === "object" && ("randomBytes" in nc) ? nc : undefined;
-});
-
-// ../../node_modules/@noble/hashes/esm/utils.js
 function u32(arr) {
   return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
 }
+function clean(...arrays) {
+  for (let i6 = 0;i6 < arrays.length; i6++) {
+    arrays[i6].fill(0);
+  }
+}
 function createView(arr) {
   return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
 }
@@ -232399,10 +232402,11 @@ function byteSwap32(arr) {
   for (let i6 = 0;i6 < arr.length; i6++) {
     arr[i6] = byteSwap(arr[i6]);
   }
+  return arr;
 }
 function utf8ToBytes(str) {
   if (typeof str !== "string")
-    throw new Error("utf8ToBytes expected string, got " + typeof str);
+    throw new Error("string expected");
   return new Uint8Array(new TextEncoder().encode(str));
 }
 function toBytes2(data) {
@@ -232428,11 +232432,8 @@ function concatBytes(...arrays) {
 }
 
 class Hash {
-  clone() {
-    return this._cloneInto();
-  }
 }
-function wrapConstructor(hashCons) {
+function createHasher(hashCons) {
   const hashC = (msg) => hashCons().update(toBytes2(msg)).digest();
   const tmp = hashCons();
   hashC.outputLen = tmp.outputLen;
@@ -232440,14 +232441,6 @@ function wrapConstructor(hashCons) {
   hashC.create = () => hashCons();
   return hashC;
 }
-function wrapXOFConstructorWithOpts(hashCons) {
-  const hashC = (msg, opts) => hashCons(opts).update(toBytes2(msg)).digest();
-  const tmp = hashCons({});
-  hashC.outputLen = tmp.outputLen;
-  hashC.blockLen = tmp.blockLen;
-  hashC.create = (opts) => hashCons(opts);
-  return hashC;
-}
 function randomBytes(bytesLength = 32) {
   if (crypto2 && typeof crypto2.getRandomValues === "function") {
     return crypto2.getRandomValues(new Uint8Array(bytesLength));
@@ -232457,13 +232450,12 @@ function randomBytes(bytesLength = 32) {
   }
   throw new Error("crypto.getRandomValues must be defined");
 }
-var isLE, hasHexBuiltin;
+var isLE, swap32IfBE;
 var init_utils2 = __esm(() => {
   init_cryptoNode();
-  init__assert();
   /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68)();
-  hasHexBuiltin = typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function";
+  swap32IfBE = isLE ? (u6) => u6 : byteSwap32;
 });
 
 // ../../node_modules/@noble/hashes/esm/sha3.js
@@ -232505,22 +232497,21 @@ function keccakP(s7, rounds = 24) {
     s7[0] ^= SHA3_IOTA_H[round];
     s7[1] ^= SHA3_IOTA_L[round];
   }
-  B4.fill(0);
+  clean(B4);
 }
-var SHA3_PI, SHA3_ROTL, _SHA3_IOTA, _0n, _1n, _2n, _7n, _256n, _0x71n, SHA3_IOTA_H, SHA3_IOTA_L, rotlH = (h8, l3, s7) => s7 > 32 ? rotlBH(h8, l3, s7) : rotlSH(h8, l3, s7), rotlL = (h8, l3, s7) => s7 > 32 ? rotlBL(h8, l3, s7) : rotlSL(h8, l3, s7), Keccak, gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen)), sha3_224, sha3_256, sha3_384, sha3_512, keccak_224, keccak_256, keccak_384, keccak_512, genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true)), shake128, shake256;
+var _0n, _1n, _2n, _7n, _256n, _0x71n, SHA3_PI, SHA3_ROTL, _SHA3_IOTA, IOTAS, SHA3_IOTA_H, SHA3_IOTA_L, rotlH = (h8, l3, s7) => s7 > 32 ? rotlBH(h8, l3, s7) : rotlSH(h8, l3, s7), rotlL = (h8, l3, s7) => s7 > 32 ? rotlBL(h8, l3, s7) : rotlSL(h8, l3, s7), Keccak, gen = (suffix, blockLen, outputLen) => createHasher(() => new Keccak(blockLen, suffix, outputLen)), keccak_256;
 var init_sha3 = __esm(() => {
-  init__assert();
   init__u64();
   init_utils2();
+  _0n = BigInt(0);
+  _1n = BigInt(1);
+  _2n = BigInt(2);
+  _7n = BigInt(7);
+  _256n = BigInt(256);
+  _0x71n = BigInt(113);
   SHA3_PI = [];
   SHA3_ROTL = [];
   _SHA3_IOTA = [];
-  _0n = /* @__PURE__ */ BigInt(0);
-  _1n = /* @__PURE__ */ BigInt(1);
-  _2n = /* @__PURE__ */ BigInt(2);
-  _7n = /* @__PURE__ */ BigInt(7);
-  _256n = /* @__PURE__ */ BigInt(256);
-  _0x71n = /* @__PURE__ */ BigInt(113);
   for (let round = 0, R7 = _1n, x6 = 1, y4 = 0;round < 24; round++) {
     [x6, y4] = [y4, (2 * x6 + 3 * y4) % 5];
     SHA3_PI.push(2 * (5 * y4 + x6));
@@ -232533,7 +232524,9 @@ var init_sha3 = __esm(() => {
     }
     _SHA3_IOTA.push(t8);
   }
-  [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split3(_SHA3_IOTA, true);
+  IOTAS = split3(_SHA3_IOTA, true);
+  SHA3_IOTA_H = IOTAS[0];
+  SHA3_IOTA_L = IOTAS[1];
   Keccak = class Keccak extends Hash {
     constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {
       super();
@@ -232548,24 +232541,26 @@ var init_sha3 = __esm(() => {
       this.enableXOF = enableXOF;
       this.rounds = rounds;
       anumber(outputLen);
-      if (0 >= this.blockLen || this.blockLen >= 200)
-        throw new Error("Sha3 supports only keccak-f1600 function");
+      if (!(0 < blockLen && blockLen < 200))
+        throw new Error("only keccak-f1600 function is supported");
       this.state = new Uint8Array(200);
       this.state32 = u32(this.state);
     }
+    clone() {
+      return this._cloneInto();
+    }
     keccak() {
-      if (!isLE)
-        byteSwap32(this.state32);
+      swap32IfBE(this.state32);
       keccakP(this.state32, this.rounds);
-      if (!isLE)
-        byteSwap32(this.state32);
+      swap32IfBE(this.state32);
       this.posOut = 0;
       this.pos = 0;
     }
     update(data) {
       aexists(this);
-      const { blockLen, state } = this;
       data = toBytes2(data);
+      abytes(data);
+      const { blockLen, state } = this;
       const len = data.length;
       for (let pos = 0;pos < len; ) {
         const take2 = Math.min(blockLen - this.pos, len - pos);
@@ -232625,7 +232620,7 @@ var init_sha3 = __esm(() => {
     }
     destroy() {
       this.destroyed = true;
-      this.state.fill(0);
+      clean(this.state);
     }
     _cloneInto(to) {
       const { blockLen, suffix, outputLen, rounds, enableXOF } = this;
@@ -232642,16 +232637,7 @@ var init_sha3 = __esm(() => {
       return to;
     }
   };
-  sha3_224 = /* @__PURE__ */ gen(6, 144, 224 / 8);
-  sha3_256 = /* @__PURE__ */ gen(6, 136, 256 / 8);
-  sha3_384 = /* @__PURE__ */ gen(6, 104, 384 / 8);
-  sha3_512 = /* @__PURE__ */ gen(6, 72, 512 / 8);
-  keccak_224 = /* @__PURE__ */ gen(1, 144, 224 / 8);
-  keccak_256 = /* @__PURE__ */ gen(1, 136, 256 / 8);
-  keccak_384 = /* @__PURE__ */ gen(1, 104, 384 / 8);
-  keccak_512 = /* @__PURE__ */ gen(1, 72, 512 / 8);
-  shake128 = /* @__PURE__ */ genShake(31, 168, 128 / 8);
-  shake256 = /* @__PURE__ */ genShake(31, 136, 256 / 8);
+  keccak_256 = /* @__PURE__ */ (() => gen(1, 136, 256 / 8))();
 });
 
 // ../../node_modules/viem/_esm/utils/hash/keccak256.js
@@ -234815,9 +234801,8 @@ function Chi(a7, b4, c3) {
 function Maj(a7, b4, c3) {
   return a7 & b4 ^ a7 & c3 ^ b4 & c3;
 }
-var HashMD;
+var HashMD, SHA256_IV;
 var init__md = __esm(() => {
-  init__assert();
   init_utils2();
   HashMD = class HashMD extends Hash {
     constructor(blockLen, outputLen, padOffset, isLE2) {
@@ -234835,8 +234820,9 @@ var init__md = __esm(() => {
     }
     update(data) {
       aexists(this);
-      const { view, buffer, blockLen } = this;
       data = toBytes2(data);
+      abytes(data);
+      const { view, buffer, blockLen } = this;
       const len = data.length;
       for (let pos = 0;pos < len; ) {
         const take2 = Math.min(blockLen - this.pos, len - pos);
@@ -234865,7 +234851,7 @@ var init__md = __esm(() => {
       const { buffer, view, blockLen, isLE: isLE2 } = this;
       let { pos } = this;
       buffer[pos++] = 128;
-      this.buffer.subarray(pos).fill(0);
+      clean(this.buffer.subarray(pos));
       if (this.padOffset > blockLen - pos) {
         this.process(view, 0);
         pos = 0;
@@ -234896,23 +234882,36 @@ var init__md = __esm(() => {
       to || (to = new this.constructor);
       to.set(...this.get());
       const { blockLen, buffer, length, finished, destroyed, pos } = this;
+      to.destroyed = destroyed;
+      to.finished = finished;
       to.length = length;
       to.pos = pos;
-      to.finished = finished;
-      to.destroyed = destroyed;
       if (length % blockLen)
         to.buffer.set(buffer);
       return to;
     }
+    clone() {
+      return this._cloneInto();
+    }
   };
+  SHA256_IV = /* @__PURE__ */ Uint32Array.from([
+    1779033703,
+    3144134277,
+    1013904242,
+    2773480762,
+    1359893119,
+    2600822924,
+    528734635,
+    1541459225
+  ]);
 });
 
-// ../../node_modules/@noble/hashes/esm/sha256.js
-var SHA256_K, SHA256_IV, SHA256_W, SHA256, sha256;
-var init_sha256 = __esm(() => {
+// ../../node_modules/@noble/hashes/esm/sha2.js
+var SHA256_K, SHA256_W, SHA256, sha256;
+var init_sha2 = __esm(() => {
   init__md();
   init_utils2();
-  SHA256_K = /* @__PURE__ */ new Uint32Array([
+  SHA256_K = /* @__PURE__ */ Uint32Array.from([
     1116352408,
     1899447441,
     3049323471,
@@ -234978,16 +234977,6 @@ var init_sha256 = __esm(() => {
     3204031479,
     3329325298
   ]);
-  SHA256_IV = /* @__PURE__ */ new Uint32Array([
-    1779033703,
-    3144134277,
-    1013904242,
-    2773480762,
-    1359893119,
-    2600822924,
-    528734635,
-    1541459225
-  ]);
   SHA256_W = /* @__PURE__ */ new Uint32Array(64);
   SHA256 = class SHA256 extends HashMD {
     constructor(outputLen = 32) {
@@ -235051,25 +235040,19 @@ var init_sha256 = __esm(() => {
       this.set(A5, B4, C4, D3, E6, F3, G4, H4);
     }
     roundClean() {
-      SHA256_W.fill(0);
+      clean(SHA256_W);
     }
     destroy() {
       this.set(0, 0, 0, 0, 0, 0, 0, 0);
-      this.buffer.fill(0);
+      clean(this.buffer);
     }
   };
-  sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256);
-});
-
-// ../../node_modules/@noble/hashes/esm/sha2.js
-var init_sha2 = __esm(() => {
-  init_sha256();
+  sha256 = /* @__PURE__ */ createHasher(() => new SHA256);
 });
 
 // ../../node_modules/@noble/hashes/esm/hmac.js
 var HMAC, hmac = (hash2, key2, message) => new HMAC(hash2, key2).update(message).digest();
 var init_hmac = __esm(() => {
-  init__assert();
   init_utils2();
   HMAC = class HMAC extends Hash {
     constructor(hash2, _key) {
@@ -235093,7 +235076,7 @@ var init_hmac = __esm(() => {
       for (let i6 = 0;i6 < pad2.length; i6++)
         pad2[i6] ^= 54 ^ 92;
       this.oHash.update(pad2);
-      pad2.fill(0);
+      clean(pad2);
     }
     update(buf) {
       aexists(this);
@@ -235126,6 +235109,9 @@ var init_hmac = __esm(() => {
       to.iHash = iHash._cloneInto(to.iHash);
       return to;
     }
+    clone() {
+      return this._cloneInto();
+    }
     destroy() {
       this.destroyed = true;
       this.oHash.destroy();
@@ -235158,7 +235144,7 @@ function hexToNumber2(hex) {
 }
 function bytesToHex2(bytes) {
   abytes2(bytes);
-  if (hasHexBuiltin2)
+  if (hasHexBuiltin)
     return bytes.toHex();
   let hex = "";
   for (let i6 = 0;i6 < bytes.length; i6++) {
@@ -235178,7 +235164,7 @@ function asciiToBase16(ch) {
 function hexToBytes2(hex) {
   if (typeof hex !== "string")
     throw new Error("hex string expected, got " + typeof hex);
-  if (hasHexBuiltin2)
+  if (hasHexBuiltin)
     return Uint8Array.fromHex(hex);
   const hl = hex.length;
   const al = hl / 2;
@@ -235337,12 +235323,12 @@ function memoized(fn) {
     return computed;
   };
 }
-var _0n2, _1n2, hasHexBuiltin2, hexes2, asciis, isPosBig = (n6) => typeof n6 === "bigint" && _0n2 <= n6, bitMask = (n6) => (_1n2 << BigInt(n6)) - _1n2, u8n = (len) => new Uint8Array(len), u8fr = (arr) => Uint8Array.from(arr), validatorFns;
+var _0n2, _1n2, hasHexBuiltin, hexes2, asciis, isPosBig = (n6) => typeof n6 === "bigint" && _0n2 <= n6, bitMask = (n6) => (_1n2 << BigInt(n6)) - _1n2, u8n = (len) => new Uint8Array(len), u8fr = (arr) => Uint8Array.from(arr), validatorFns;
 var init_utils3 = __esm(() => {
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   _0n2 = /* @__PURE__ */ BigInt(0);
   _1n2 = /* @__PURE__ */ BigInt(1);
-  hasHexBuiltin2 = typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function";
+  hasHexBuiltin = typeof Uint8Array.from([]).toHex === "function" && typeof Uint8Array.fromHex === "function";
   hexes2 = /* @__PURE__ */ Array.from({ length: 256 }, (_5, i6) => i6.toString(16).padStart(2, "0"));
   asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
   validatorFns = {
@@ -235363,22 +235349,6 @@ function mod(a7, b4) {
   const result = a7 % b4;
   return result >= _0n3 ? result : b4 + result;
 }
-function pow(num, power, modulo) {
-  if (power < _0n3)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (modulo <= _0n3)
-    throw new Error("invalid modulus");
-  if (modulo === _1n3)
-    return _0n3;
-  let res = _1n3;
-  while (power > _0n3) {
-    if (power & _1n3)
-      res = res * num % modulo;
-    num = num * num % modulo;
-    power >>= _1n3;
-  }
-  return res;
-}
 function pow2(x6, power, modulo) {
   let res = x6;
   while (power-- > _0n3) {
@@ -235407,74 +235377,78 @@ function invert(number4, modulo) {
     throw new Error("invert: does not exist");
   return mod(x6, modulo);
 }
+function sqrt3mod4(Fp, n6) {
+  const p1div4 = (Fp.ORDER + _1n3) / _4n;
+  const root = Fp.pow(n6, p1div4);
+  if (!Fp.eql(Fp.sqr(root), n6))
+    throw new Error("Cannot find square root");
+  return root;
+}
+function sqrt5mod8(Fp, n6) {
+  const p5div8 = (Fp.ORDER - _5n) / _8n;
+  const n22 = Fp.mul(n6, _2n2);
+  const v6 = Fp.pow(n22, p5div8);
+  const nv = Fp.mul(n6, v6);
+  const i6 = Fp.mul(Fp.mul(nv, _2n2), v6);
+  const root = Fp.mul(nv, Fp.sub(i6, Fp.ONE));
+  if (!Fp.eql(Fp.sqr(root), n6))
+    throw new Error("Cannot find square root");
+  return root;
+}
 function tonelliShanks(P5) {
-  const legendreC = (P5 - _1n3) / _2n2;
-  let Q4, S4, Z4;
-  for (Q4 = P5 - _1n3, S4 = 0;Q4 % _2n2 === _0n3; Q4 /= _2n2, S4++)
-    ;
-  for (Z4 = _2n2;Z4 < P5 && pow(Z4, legendreC, P5) !== P5 - _1n3; Z4++) {
-    if (Z4 > 1000)
-      throw new Error("Cannot find square root: likely non-prime P");
-  }
-  if (S4 === 1) {
-    const p1div4 = (P5 + _1n3) / _4n;
-    return function tonelliFast(Fp, n6) {
-      const root = Fp.pow(n6, p1div4);
-      if (!Fp.eql(Fp.sqr(root), n6))
-        throw new Error("Cannot find square root");
-      return root;
-    };
-  }
+  if (P5 < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let Q4 = P5 - _1n3;
+  let S4 = 0;
+  while (Q4 % _2n2 === _0n3) {
+    Q4 /= _2n2;
+    S4++;
+  }
+  let Z4 = _2n2;
+  const _Fp = Field(P5);
+  while (FpLegendre(_Fp, Z4) === 1) {
+    if (Z4++ > 1000)
+      throw new Error("Cannot find square root: probably non-prime P");
+  }
+  if (S4 === 1)
+    return sqrt3mod4;
+  let cc = _Fp.pow(Z4, Q4);
   const Q1div2 = (Q4 + _1n3) / _2n2;
   return function tonelliSlow(Fp, n6) {
-    if (Fp.pow(n6, legendreC) === Fp.neg(Fp.ONE))
+    if (Fp.is0(n6))
+      return n6;
+    if (FpLegendre(Fp, n6) !== 1)
       throw new Error("Cannot find square root");
-    let r6 = S4;
-    let g5 = Fp.pow(Fp.mul(Fp.ONE, Z4), Q4);
-    let x6 = Fp.pow(n6, Q1div2);
-    let b4 = Fp.pow(n6, Q4);
-    while (!Fp.eql(b4, Fp.ONE)) {
-      if (Fp.eql(b4, Fp.ZERO))
+    let M5 = S4;
+    let c3 = Fp.mul(Fp.ONE, cc);
+    let t8 = Fp.pow(n6, Q4);
+    let R7 = Fp.pow(n6, Q1div2);
+    while (!Fp.eql(t8, Fp.ONE)) {
+      if (Fp.is0(t8))
         return Fp.ZERO;
-      let m7 = 1;
-      for (let t22 = Fp.sqr(b4);m7 < r6; m7++) {
-        if (Fp.eql(t22, Fp.ONE))
-          break;
-        t22 = Fp.sqr(t22);
+      let i6 = 1;
+      let t_tmp = Fp.sqr(t8);
+      while (!Fp.eql(t_tmp, Fp.ONE)) {
+        i6++;
+        t_tmp = Fp.sqr(t_tmp);
+        if (i6 === M5)
+          throw new Error("Cannot find square root");
       }
-      const ge4 = Fp.pow(g5, _1n3 << BigInt(r6 - m7 - 1));
-      g5 = Fp.sqr(ge4);
-      x6 = Fp.mul(x6, ge4);
-      b4 = Fp.mul(b4, g5);
-      r6 = m7;
+      const exponent = _1n3 << BigInt(M5 - i6 - 1);
+      const b4 = Fp.pow(c3, exponent);
+      M5 = i6;
+      c3 = Fp.sqr(b4);
+      t8 = Fp.mul(t8, c3);
+      R7 = Fp.mul(R7, b4);
     }
-    return x6;
+    return R7;
   };
 }
 function FpSqrt(P5) {
-  if (P5 % _4n === _3n) {
-    const p1div4 = (P5 + _1n3) / _4n;
-    return function sqrt3mod4(Fp, n6) {
-      const root = Fp.pow(n6, p1div4);
-      if (!Fp.eql(Fp.sqr(root), n6))
-        throw new Error("Cannot find square root");
-      return root;
-    };
-  }
-  if (P5 % _8n === _5n) {
-    const c1 = (P5 - _5n) / _8n;
-    return function sqrt5mod8(Fp, n6) {
-      const n22 = Fp.mul(n6, _2n2);
-      const v6 = Fp.pow(n22, c1);
-      const nv = Fp.mul(n6, v6);
-      const i6 = Fp.mul(Fp.mul(nv, _2n2), v6);
-      const root = Fp.mul(nv, Fp.sub(i6, Fp.ONE));
-      if (!Fp.eql(Fp.sqr(root), n6))
-        throw new Error("Cannot find square root");
-      return root;
-    };
-  }
-  if (P5 % _16n === _9n) {}
+  if (P5 % _4n === _3n)
+    return sqrt3mod4;
+  if (P5 % _8n === _5n)
+    return sqrt5mod8;
   return tonelliShanks(P5);
 }
 function validateField(field2) {
@@ -235490,41 +235464,53 @@ function validateField(field2) {
   }, initial);
   return validateObject(field2, opts);
 }
-function FpPow(f5, num, power) {
+function FpPow(Fp, num, power) {
   if (power < _0n3)
     throw new Error("invalid exponent, negatives unsupported");
   if (power === _0n3)
-    return f5.ONE;
+    return Fp.ONE;
   if (power === _1n3)
     return num;
-  let p5 = f5.ONE;
+  let p5 = Fp.ONE;
   let d6 = num;
   while (power > _0n3) {
     if (power & _1n3)
-      p5 = f5.mul(p5, d6);
-    d6 = f5.sqr(d6);
+      p5 = Fp.mul(p5, d6);
+    d6 = Fp.sqr(d6);
     power >>= _1n3;
   }
   return p5;
 }
-function FpInvertBatch(f5, nums) {
-  const tmp = new Array(nums.length);
-  const lastMultiplied = nums.reduce((acc, num, i6) => {
-    if (f5.is0(num))
+function FpInvertBatch(Fp, nums, passZero = false) {
+  const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : undefined);
+  const multipliedAcc = nums.reduce((acc, num, i6) => {
+    if (Fp.is0(num))
       return acc;
-    tmp[i6] = acc;
-    return f5.mul(acc, num);
-  }, f5.ONE);
-  const inverted = f5.inv(lastMultiplied);
+    inverted[i6] = acc;
+    return Fp.mul(acc, num);
+  }, Fp.ONE);
+  const invertedAcc = Fp.inv(multipliedAcc);
   nums.reduceRight((acc, num, i6) => {
-    if (f5.is0(num))
+    if (Fp.is0(num))
       return acc;
-    tmp[i6] = f5.mul(acc, tmp[i6]);
-    return f5.mul(acc, num);
-  }, inverted);
-  return tmp;
+    inverted[i6] = Fp.mul(acc, inverted[i6]);
+    return Fp.mul(acc, num);
+  }, invertedAcc);
+  return inverted;
+}
+function FpLegendre(Fp, n6) {
+  const p1mod2 = (Fp.ORDER - _1n3) / _2n2;
+  const powered = Fp.pow(n6, p1mod2);
+  const yes = Fp.eql(powered, Fp.ONE);
+  const zero = Fp.eql(powered, Fp.ZERO);
+  const no = Fp.eql(powered, Fp.neg(Fp.ONE));
+  if (!yes && !zero && !no)
+    throw new Error("invalid Legendre symbol result");
+  return yes ? 1 : zero ? 0 : -1;
 }
 function nLength(n6, nBitLength) {
+  if (nBitLength !== undefined)
+    anumber(nBitLength);
   const _nBitLength = nBitLength !== undefined ? nBitLength : n6.toString(2).length;
   const nByteLength = Math.ceil(_nBitLength / 8);
   return { nBitLength: _nBitLength, nByteLength };
@@ -235570,14 +235556,14 @@ function Field(ORDER, bitLen2, isLE2 = false, redef = {}) {
         sqrtP = FpSqrt(ORDER);
       return sqrtP(f5, n6);
     }),
-    invertBatch: (lst) => FpInvertBatch(f5, lst),
-    cmov: (a7, b4, c3) => c3 ? b4 : a7,
     toBytes: (num) => isLE2 ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES),
     fromBytes: (bytes) => {
       if (bytes.length !== BYTES)
         throw new Error("Field.fromBytes: expected " + BYTES + " bytes, got " + bytes.length);
       return isLE2 ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);
-    }
+    },
+    invertBatch: (lst) => FpInvertBatch(f5, lst),
+    cmov: (a7, b4, c3) => c3 ? b4 : a7
   });
   return Object.freeze(f5);
 }
@@ -235601,8 +235587,9 @@ function mapHashToField(key2, fieldOrder, isLE2 = false) {
   const reduced = mod(num, fieldOrder - _1n3) + _1n3;
   return isLE2 ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);
 }
-var _0n3, _1n3, _2n2, _3n, _4n, _5n, _8n, _9n, _16n, FIELD_FIELDS;
+var _0n3, _1n3, _2n2, _3n, _4n, _5n, _8n, FIELD_FIELDS;
 var init_modular = __esm(() => {
+  init_utils2();
   init_utils3();
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   _0n3 = BigInt(0);
@@ -235612,8 +235599,6 @@ var init_modular = __esm(() => {
   _4n = /* @__PURE__ */ BigInt(4);
   _5n = /* @__PURE__ */ BigInt(5);
   _8n = /* @__PURE__ */ BigInt(8);
-  _9n = /* @__PURE__ */ BigInt(9);
-  _16n = /* @__PURE__ */ BigInt(16);
   FIELD_FIELDS = [
     "create",
     "isValid",
@@ -235780,18 +235765,26 @@ function wNAF(c3, bits) {
 function pippenger(c3, fieldN, points, scalars) {
   validateMSMPoints(points, c3);
   validateMSMScalars(scalars, fieldN);
-  if (points.length !== scalars.length)
+  const plength = points.length;
+  const slength = scalars.length;
+  if (plength !== slength)
     throw new Error("arrays of points and scalars must have equal length");
   const zero = c3.ZERO;
-  const wbits = bitLen(BigInt(points.length));
-  const windowSize = wbits > 12 ? wbits - 3 : wbits > 4 ? wbits - 2 : wbits ? 2 : 1;
+  const wbits = bitLen(BigInt(plength));
+  let windowSize = 1;
+  if (wbits > 12)
+    windowSize = wbits - 3;
+  else if (wbits > 4)
+    windowSize = wbits - 2;
+  else if (wbits > 0)
+    windowSize = 2;
   const MASK = bitMask(windowSize);
   const buckets = new Array(Number(MASK) + 1).fill(zero);
   const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;
   let sum = zero;
   for (let i6 = lastBits;i6 >= 0; i6 -= windowSize) {
     buckets.fill(zero);
-    for (let j3 = 0;j3 < scalars.length; j3++) {
+    for (let j3 = 0;j3 < slength; j3++) {
       const scalar = scalars[j3];
       const wbits2 = Number(scalar >> BigInt(i6) & MASK);
       buckets[wbits2] = buckets[wbits2].add(points[j3]);
@@ -235849,25 +235842,28 @@ function validatePointOpts(curve) {
     a: "field",
     b: "field"
   }, {
+    allowInfinityPoint: "boolean",
     allowedPrivateKeyLengths: "array",
-    wrapPrivateKey: "boolean",
-    isTorsionFree: "function",
     clearCofactor: "function",
-    allowInfinityPoint: "boolean",
     fromBytes: "function",
-    toBytes: "function"
+    isTorsionFree: "function",
+    toBytes: "function",
+    wrapPrivateKey: "boolean"
   });
   const { endo, Fp, a: a7 } = opts;
   if (endo) {
     if (!Fp.eql(a7, Fp.ZERO)) {
-      throw new Error("invalid endomorphism, can only be defined for Koblitz curves that have a=0");
+      throw new Error("invalid endo: CURVE.a must be 0");
     }
     if (typeof endo !== "object" || typeof endo.beta !== "bigint" || typeof endo.splitScalar !== "function") {
-      throw new Error("invalid endomorphism, expected beta: bigint and splitScalar: function");
+      throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function');
     }
   }
   return Object.freeze({ ...opts });
 }
+function numToSizedHex(num, size2) {
+  return bytesToHex2(numberToBytesBE(num, size2));
+}
 function weierstrassPoints(opts) {
   const CURVE = validatePointOpts(opts);
   const { Fp } = CURVE;
@@ -235888,8 +235884,17 @@ function weierstrassPoints(opts) {
     const x32 = Fp.mul(x22, x6);
     return Fp.add(Fp.add(x32, Fp.mul(x6, a7)), b4);
   }
-  if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))
-    throw new Error("bad generator point: equation left != right");
+  function isValidXY(x6, y4) {
+    const left = Fp.sqr(y4);
+    const right = weierstrassEquation(x6);
+    return Fp.eql(left, right);
+  }
+  if (!isValidXY(CURVE.Gx, CURVE.Gy))
+    throw new Error("bad curve params: generator point");
+  const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n2), _4n2);
+  const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));
+  if (Fp.is0(Fp.add(_4a3, _27b2)))
+    throw new Error("bad curve params: a or b");
   function isWithinCurveOrder(num) {
     return inRange(num, _1n5, CURVE.n);
   }
@@ -235942,9 +235947,7 @@ function weierstrassPoints(opts) {
     const { x: x6, y: y4 } = p5.toAffine();
     if (!Fp.isValid(x6) || !Fp.isValid(y4))
       throw new Error("bad point: x or y not FE");
-    const left = Fp.sqr(y4);
-    const right = weierstrassEquation(x6);
-    if (!Fp.eql(left, right))
+    if (!isValidXY(x6, y4))
       throw new Error("bad point: equation left != right");
     if (!p5.isTorsionFree())
       throw new Error("bad point: not in prime-order subgroup");
@@ -235955,7 +235958,7 @@ function weierstrassPoints(opts) {
     constructor(px, py, pz) {
       if (px == null || !Fp.isValid(px))
         throw new Error("x required");
-      if (py == null || !Fp.isValid(py))
+      if (py == null || !Fp.isValid(py) || Fp.is0(py))
         throw new Error("y required");
       if (pz == null || !Fp.isValid(pz))
         throw new Error("z required");
@@ -235982,7 +235985,7 @@ function weierstrassPoints(opts) {
       return this.toAffine().y;
     }
     static normalizeZ(points) {
-      const toInv = Fp.invertBatch(points.map((p5) => p5.pz));
+      const toInv = FpInvertBatch(Fp, points.map((p5) => p5.pz));
       return points.map((p5, i6) => p5.toAffine(toInv[i6])).map(Point.fromAffine);
     }
     static fromHex(hex) {
@@ -236116,16 +236119,16 @@ function weierstrassPoints(opts) {
       return wnaf.wNAFCached(this, n6, Point.normalizeZ);
     }
     multiplyUnsafe(sc) {
-      const { endo, n: N6 } = CURVE;
+      const { endo: endo2, n: N6 } = CURVE;
       aInRange("scalar", sc, _0n5, N6);
       const I6 = Point.ZERO;
       if (sc === _0n5)
         return I6;
       if (this.is0() || sc === _1n5)
         return this;
-      if (!endo || wnaf.hasPrecomputes(this))
+      if (!endo2 || wnaf.hasPrecomputes(this))
         return wnaf.wNAFCachedUnsafe(this, sc, Point.normalizeZ);
-      let { k1neg, k1, k2neg, k2: k22 } = endo.splitScalar(sc);
+      let { k1neg, k1, k2neg, k2: k22 } = endo2.splitScalar(sc);
       let k1p = I6;
       let k2p = I6;
       let d6 = this;
@@ -236142,20 +236145,20 @@ function weierstrassPoints(opts) {
         k1p = k1p.negate();
       if (k2neg)
         k2p = k2p.negate();
-      k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);
+      k2p = new Point(Fp.mul(k2p.px, endo2.beta), k2p.py, k2p.pz);
       return k1p.add(k2p);
     }
     multiply(scalar) {
-      const { endo, n: N6 } = CURVE;
+      const { endo: endo2, n: N6 } = CURVE;
       aInRange("scalar", scalar, _1n5, N6);
       let point, fake;
-      if (endo) {
-        const { k1neg, k1, k2neg, k2: k22 } = endo.splitScalar(scalar);
+      if (endo2) {
+        const { k1neg, k1, k2neg, k2: k22 } = endo2.splitScalar(scalar);
         let { p: k1p, f: f1p } = this.wNAF(k1);
         let { p: k2p, f: f2p } = this.wNAF(k22);
         k1p = wnaf.constTimeNegate(k1neg, k1p);
         k2p = wnaf.constTimeNegate(k2neg, k2p);
-        k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);
+        k2p = new Point(Fp.mul(k2p.px, endo2.beta), k2p.py, k2p.pz);
         point = k1p.add(k2p);
         fake = f1p.add(f2p);
       } else {
@@ -236202,8 +236205,8 @@ function weierstrassPoints(opts) {
   }
   Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);
   Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);
-  const _bits = CURVE.nBitLength;
-  const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);
+  const { endo, nBitLength } = CURVE;
+  const wnaf = wNAF(Point, endo ? Math.ceil(nBitLength / 2) : nBitLength);
   return {
     CURVE,
     ProjectivePoint: Point,
@@ -236227,7 +236230,7 @@ function validateOpts(curve) {
 }
 function weierstrass(curveDef) {
   const CURVE = validateOpts(curveDef);
-  const { Fp, n: CURVE_ORDER } = CURVE;
+  const { Fp, n: CURVE_ORDER, nByteLength, nBitLength } = CURVE;
   const compressedLen = Fp.BYTES + 1;
   const uncompressedLen = 2 * Fp.BYTES + 1;
   function modN(a7) {
@@ -236281,7 +236284,6 @@ function weierstrass(curveDef) {
       }
     }
   });
-  const numToNByteHex = (num) => bytesToHex2(numberToBytesBE(num, CURVE.nByteLength));
   function isBiggerThanHalfOrder(number4) {
     const HALF = CURVE_ORDER >> _1n5;
     return number4 > HALF;
@@ -236302,7 +236304,7 @@ function weierstrass(curveDef) {
       Object.freeze(this);
     }
     static fromCompact(hex) {
-      const l3 = CURVE.nByteLength;
+      const l3 = nByteLength;
       hex = ensureBytes("compactSignature", hex, l3 * 2);
       return new Signature(slcNum(hex, 0, l3), slcNum(hex, l3, 2 * l3));
     }
@@ -236323,7 +236325,7 @@ function weierstrass(curveDef) {
       if (radj >= Fp.ORDER)
         throw new Error("recovery id 2 or 3 invalid");
       const prefix = (rec & 1) === 0 ? "02" : "03";
-      const R7 = Point.fromHex(prefix + numToNByteHex(radj));
+      const R7 = Point.fromHex(prefix + numToSizedHex(radj, Fp.BYTES));
       const ir2 = invN(radj);
       const u1 = modN(-h8 * ir2);
       const u22 = modN(s7 * ir2);
@@ -236343,13 +236345,14 @@ function weierstrass(curveDef) {
       return hexToBytes2(this.toDERHex());
     }
     toDERHex() {
-      return DER.hexFromSig({ r: this.r, s: this.s });
+      return DER.hexFromSig(this);
     }
     toCompactRawBytes() {
       return hexToBytes2(this.toCompactHex());
     }
     toCompactHex() {
-      return numToNByteHex(this.r) + numToNByteHex(this.s);
+      const l3 = nByteLength;
+      return numToSizedHex(this.r, l3) + numToSizedHex(this.s, l3);
     }
   }
   const utils = {
@@ -236376,21 +236379,25 @@ function weierstrass(curveDef) {
     return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);
   }
   function isProbPub(item) {
-    const arr = isBytes2(item);
-    const str = typeof item === "string";
-    const len = (arr || str) && item.length;
-    if (arr)
-      return len === compressedLen || len === uncompressedLen;
-    if (str)
-      return len === 2 * compressedLen || len === 2 * uncompressedLen;
+    if (typeof item === "bigint")
+      return false;
     if (item instanceof Point)
       return true;
-    return false;
+    const arr = ensureBytes("key", item);
+    const len = arr.length;
+    const fpl = Fp.BYTES;
+    const compLen = fpl + 1;
+    const uncompLen = 2 * fpl + 1;
+    if (CURVE.allowedPrivateKeyLengths || nByteLength === compLen) {
+      return;
+    } else {
+      return len === compLen || len === uncompLen;
+    }
   }
   function getSharedSecret(privateA, publicB, isCompressed = true) {
-    if (isProbPub(privateA))
+    if (isProbPub(privateA) === true)
       throw new Error("first arg must be private key");
-    if (!isProbPub(publicB))
+    if (isProbPub(publicB) === false)
       throw new Error("second arg must be public key");
     const b4 = Point.fromHex(publicB);
     return b4.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);
@@ -236399,16 +236406,16 @@ function weierstrass(curveDef) {
     if (bytes.length > 8192)
       throw new Error("input is too large");
     const num = bytesToNumberBE(bytes);
-    const delta = bytes.length * 8 - CURVE.nBitLength;
+    const delta = bytes.length * 8 - nBitLength;
     return delta > 0 ? num >> BigInt(delta) : num;
   };
   const bits2int_modN = CURVE.bits2int_modN || function(bytes) {
     return modN(bits2int(bytes));
   };
-  const ORDER_MASK = bitMask(CURVE.nBitLength);
+  const ORDER_MASK = bitMask(nBitLength);
   function int2octets(num) {
-    aInRange("num < 2^" + CURVE.nBitLength, num, _0n5, ORDER_MASK);
-    return numberToBytesBE(num, CURVE.nByteLength);
+    aInRange("num < 2^" + nBitLength, num, _0n5, ORDER_MASK);
+    return numberToBytesBE(num, nByteLength);
   }
   function prepSig(msgHash, privateKey, opts = defaultSigOpts) {
     if (["recovered", "canonical"].some((k5) => (k5 in opts)))
@@ -236618,7 +236625,8 @@ function mapToCurveSimpleSWU(Fp, opts) {
     y4 = Fp.cmov(y4, value4, isValid);
     const e1 = Fp.isOdd(u6) === Fp.isOdd(y4);
     y4 = Fp.cmov(Fp.neg(y4), y4, e1);
-    x6 = Fp.div(x6, tv4);
+    const tv4_inv = FpInvertBatch(Fp, [tv4], true)[0];
+    x6 = Fp.mul(x6, tv4_inv);
     return { x: x6, y: y4 };
   };
 }
@@ -236849,43 +236857,47 @@ function hash_to_field(msg, count, options) {
   return u6;
 }
 function isogenyMap(field2, map4) {
-  const COEFF = map4.map((i6) => Array.from(i6).reverse());
+  const coeff = map4.map((i6) => Array.from(i6).reverse());
   return (x6, y4) => {
-    const [xNum, xDen, yNum, yDen] = COEFF.map((val) => val.reduce((acc, i6) => field2.add(field2.mul(acc, x6), i6)));
-    if (field2.is0(xDen) || field2.is0(yDen))
-      throw new Error("bad point: ZERO");
-    x6 = field2.div(xNum, xDen);
-    y4 = field2.mul(y4, field2.div(yNum, yDen));
+    const [xn, xd, yn, yd] = coeff.map((val) => val.reduce((acc, i6) => field2.add(field2.mul(acc, x6), i6)));
+    const [xd_inv, yd_inv] = FpInvertBatch(field2, [xd, yd], true);
+    x6 = field2.mul(xn, xd_inv);
+    y4 = field2.mul(y4, field2.mul(yn, yd_inv));
     return { x: x6, y: y4 };
   };
 }
-function createHasher(Point, mapToCurve, def) {
+function createHasher2(Point, mapToCurve, defaults2) {
   if (typeof mapToCurve !== "function")
     throw new Error("mapToCurve() must be defined");
+  function map4(num) {
+    return Point.fromAffine(mapToCurve(num));
+  }
+  function clear(initial) {
+    const P5 = initial.clearCofactor();
+    if (P5.equals(Point.ZERO))
+      return Point.ZERO;
+    P5.assertValidity();
+    return P5;
+  }
   return {
+    defaults: defaults2,
     hashToCurve(msg, options) {
-      const u6 = hash_to_field(msg, 2, { ...def, DST: def.DST, ...options });
-      const u0 = Point.fromAffine(mapToCurve(u6[0]));
-      const u1 = Point.fromAffine(mapToCurve(u6[1]));
-      const P5 = u0.add(u1).clearCofactor();
-      P5.assertValidity();
-      return P5;
+      const u6 = hash_to_field(msg, 2, { ...defaults2, DST: defaults2.DST, ...options });
+      const u0 = map4(u6[0]);
+      const u1 = map4(u6[1]);
+      return clear(u0.add(u1));
     },
     encodeToCurve(msg, options) {
-      const u6 = hash_to_field(msg, 1, { ...def, DST: def.encodeDST, ...options });
-      const P5 = Point.fromAffine(mapToCurve(u6[0])).clearCofactor();
-      P5.assertValidity();
-      return P5;
+      const u6 = hash_to_field(msg, 1, { ...defaults2, DST: defaults2.encodeDST, ...options });
+      return clear(map4(u6[0]));
     },
     mapToCurve(scalars) {
       if (!Array.isArray(scalars))
-        throw new Error("mapToCurve: expected array of bigints");
+        throw new Error("expected array of bigints");
       for (const i6 of scalars)
         if (typeof i6 !== "bigint")
-          throw new Error("mapToCurve: expected array of bigints");
-      const P5 = Point.fromAffine(mapToCurve(scalars)).clearCofactor();
-      P5.assertValidity();
-      return P5;
+          throw new Error("expected array of bigints");
+      return clear(map4(scalars));
     }
   };
 }
@@ -236899,6 +236911,7 @@ var init_hash_to_curve = __esm(() => {
 // ../../node_modules/@noble/curves/esm/secp256k1.js
 var exports_secp256k1 = {};
 __export(exports_secp256k1, {
+  secp256k1_hasher: () => secp256k1_hasher,
   secp256k1: () => secp256k1,
   schnorr: () => schnorr,
   hashToCurve: () => hashToCurve,
@@ -236997,7 +237010,7 @@ function schnorrVerify(signature, message, publicKey) {
     return false;
   }
 }
-var secp256k1P, secp256k1N, _1n6, _2n4, divNearest = (a7, b4) => (a7 + b4 / _2n4) / b4, Fpk1, secp256k1, _0n6, TAGGED_HASH_PREFIXES, pointToBytes = (point) => point.toRawBytes(true).slice(1), numTo32b = (n6) => numberToBytesBE(n6, 32), modP = (x6) => mod(x6, secp256k1P), modN = (x6) => mod(x6, secp256k1N), Point, GmulAdd = (Q4, a7, b4) => Point.BASE.multiplyAndAddUnsafe(Q4, a7, b4), num, schnorr, isoMap, mapSWU, htf, hashToCurve, encodeToCurve;
+var secp256k1P, secp256k1N, _0n6, _1n6, _2n4, divNearest = (a7, b4) => (a7 + b4 / _2n4) / b4, Fpk1, secp256k1, TAGGED_HASH_PREFIXES, pointToBytes = (point) => point.toRawBytes(true).slice(1), numTo32b = (n6) => numberToBytesBE(n6, 32), modP = (x6) => mod(x6, secp256k1P), modN = (x6) => mod(x6, secp256k1N), Point, GmulAdd = (Q4, a7, b4) => Point.BASE.multiplyAndAddUnsafe(Q4, a7, b4), num, schnorr, isoMap, mapSWU, secp256k1_hasher, hashToCurve, encodeToCurve;
 var init_secp256k1 = __esm(() => {
   init_sha2();
   init_utils2();
@@ -237009,11 +237022,12 @@ var init_secp256k1 = __esm(() => {
   /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   secp256k1P = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f");
   secp256k1N = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141");
+  _0n6 = BigInt(0);
   _1n6 = BigInt(1);
   _2n4 = BigInt(2);
   Fpk1 = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });
   secp256k1 = createCurve({
-    a: BigInt(0),
+    a: _0n6,
     b: BigInt(7),
     Fp: Fpk1,
     n: secp256k1N,
@@ -237047,9 +237061,8 @@ var init_secp256k1 = __esm(() => {
       }
     }
   }, sha256);
-  _0n6 = BigInt(0);
   TAGGED_HASH_PREFIXES = {};
-  Point = secp256k1.ProjectivePoint;
+  Point = /* @__PURE__ */ (() => secp256k1.ProjectivePoint)();
   num = bytesToNumberBE;
   schnorr = /* @__PURE__ */ (() => ({
     getPublicKey: schnorrGetPublicKey,
@@ -237095,7 +237108,7 @@ var init_secp256k1 = __esm(() => {
     B: BigInt("1771"),
     Z: Fpk1.create(BigInt("-11"))
   }))();
-  htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {
+  secp256k1_hasher = /* @__PURE__ */ (() => createHasher2(secp256k1.ProjectivePoint, (scalars) => {
     const { x: x6, y: y4 } = mapSWU(Fpk1.create(scalars[0]));
     return isoMap(x6, y4);
   }, {
@@ -237107,8 +237120,8 @@ var init_secp256k1 = __esm(() => {
     expand: "xmd",
     hash: sha256
   }))();
-  hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();
-  encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();
+  hashToCurve = /* @__PURE__ */ (() => secp256k1_hasher.hashToCurve)();
+  encodeToCurve = /* @__PURE__ */ (() => secp256k1_hasher.encodeToCurve)();
 });
 
 // ../../node_modules/viem/_esm/errors/node.js
@@ -237686,6 +237699,8 @@ var init_Errors = __esm(() => {
           if (options.cause.shortMessage)
             return options.cause.shortMessage;
         }
+        if (options.cause && "details" in options.cause && typeof options.cause.details === "string")
+          return options.cause.details;
         if (options.cause?.message)
           return options.cause.message;
         return options.details;
@@ -262458,7 +262473,7 @@ function pruneCurrentEnv(currentEnv, env2) {
 var package_default = {
   name: "@settlemint/sdk-cli",
   description: "Command-line interface for SettleMint SDK, providing development tools and project management capabilities",
-  version: "2.3.2-maine196276e",
+  version: "2.3.2-maineefa9743",
   type: "module",
   private: false,
   license: "FSL-1.1-MIT",
@@ -262503,12 +262518,12 @@ var package_default = {
   devDependencies: {
     "@commander-js/extra-typings": "14.0.0",
     commander: "14.0.0",
-    "@inquirer/confirm": "5.1.10",
-    "@inquirer/input": "4.1.10",
-    "@inquirer/password": "4.0.13",
-    "@inquirer/select": "4.2.1",
-    "@settlemint/sdk-js": "2.3.2-maine196276e",
-    "@settlemint/sdk-utils": "2.3.2-maine196276e",
+    "@inquirer/confirm": "5.1.11",
+    "@inquirer/input": "4.1.11",
+    "@inquirer/password": "4.0.14",
+    "@inquirer/select": "4.2.2",
+    "@settlemint/sdk-js": "2.3.2-maineefa9743",
+    "@settlemint/sdk-utils": "2.3.2-maineefa9743",
     "@types/node": "22.15.21",
     "@types/semver": "7.7.0",
     "@types/which": "3.0.4",
@@ -262517,7 +262532,7 @@ var package_default = {
     "is-in-ci": "1.0.0",
     semver: "7.7.2",
     slugify: "1.6.6",
-    viem: "2.30.0",
+    viem: "2.30.1",
     which: "5.0.0",
     yaml: "2.8.0",
     yoctocolors: "2.1.1"
@@ -262630,6 +262645,9 @@ class ValidationError extends Error {
   name = "ValidationError";
 }
 // ../../node_modules/@inquirer/core/dist/esm/lib/use-prefix.js
+import { AsyncResource as AsyncResource3 } from "node:async_hooks";
+
+// ../../node_modules/@inquirer/core/dist/esm/lib/use-state.js
 import { AsyncResource as AsyncResource2 } from "node:async_hooks";
 
 // ../../node_modules/@inquirer/core/dist/esm/lib/hook-engine.js
@@ -262740,18 +262758,18 @@ var effectScheduler = {
 // ../../node_modules/@inquirer/core/dist/esm/lib/use-state.js
 function useState(defaultValue) {
   return withPointer((pointer) => {
-    const setFn = (newValue) => {
+    const setState = AsyncResource2.bind(function setState(newValue) {
       if (pointer.get() !== newValue) {
         pointer.set(newValue);
         handleChange();
       }
-    };
+    });
     if (pointer.initialized) {
-      return [pointer.get(), setFn];
+      return [pointer.get(), setState];
     }
     const value = typeof defaultValue === "function" ? defaultValue() : defaultValue;
     pointer.set(value);
-    return [value, setFn];
+    return [value, setState];
   });
 }
 
@@ -263114,9 +263132,9 @@ function usePrefix({ status = "idle", theme }) {
     if (status === "loading") {
       let tickInterval;
       let inc = -1;
-      const delayTimeout = setTimeout(AsyncResource2.bind(() => {
+      const delayTimeout = setTimeout(AsyncResource3.bind(() => {
         setShowLoader(true);
-        tickInterval = setInterval(AsyncResource2.bind(() => {
+        tickInterval = setInterval(AsyncResource3.bind(() => {
           inc = inc + 1;
           setTick(inc % spinner.frames.length);
         }), spinner.interval);
@@ -263274,7 +263292,7 @@ function usePagination({ items, active, renderItem, pageSize, loop = true }) {
 // ../../node_modules/@inquirer/core/dist/esm/lib/create-prompt.js
 var import_mute_stream = __toESM(require_lib(), 1);
 import * as readline2 from "node:readline";
-import { AsyncResource as AsyncResource3 } from "node:async_hooks";
+import { AsyncResource as AsyncResource4 } from "node:async_hooks";
 
 // ../../node_modules/signal-exit/dist/mjs/signals.js
 var signals = [];
@@ -263618,7 +263636,7 @@ function createPrompt(view) {
     rl.input.on("keypress", checkCursorPos);
     cleanups.add(() => rl.input.removeListener("keypress", checkCursorPos));
     return withHooks(rl, (cycle) => {
-      const hooksCleanup = AsyncResource3.bind(() => effectScheduler.clearAll());
+      const hooksCleanup = AsyncResource4.bind(() => effectScheduler.clearAll());
       rl.on("close", hooksCleanup);
       cleanups.add(() => rl.removeListener("close", hooksCleanup));
       cycle(() => {
@@ -270047,13 +270065,16 @@ function blobsToProofs(parameters) {
 // ../../node_modules/viem/_esm/utils/blob/commitmentToVersionedHash.js
 init_toHex();
 
+// ../../node_modules/@noble/hashes/esm/sha256.js
+init_sha2();
+var sha2562 = sha256;
+
 // ../../node_modules/viem/_esm/utils/hash/sha256.js
-init_sha256();
 init_toBytes();
 init_toHex();
-function sha2562(value4, to_) {
+function sha2563(value4, to_) {
   const to = to_ || "hex";
-  const bytes = sha256(isHex(value4, { strict: false }) ? toBytes(value4) : value4);
+  const bytes = sha2562(isHex(value4, { strict: false }) ? toBytes(value4) : value4);
   if (to === "bytes")
     return bytes;
   return toHex(bytes);
@@ -270063,7 +270084,7 @@ function sha2562(value4, to_) {
 function commitmentToVersionedHash(parameters) {
   const { commitment, version: version4 = 1 } = parameters;
   const to = parameters.to ?? (typeof commitment === "string" ? "hex" : "bytes");
-  const versionedHash = sha2562(commitment, "bytes");
+  const versionedHash = sha2563(commitment, "bytes");
   versionedHash.set([version4], 0);
   return to === "bytes" ? versionedHash : bytesToHex(versionedHash);
 }
@@ -274305,10 +274326,16 @@ async function waitForTransactionReceipt(client, {
   let replacedTransaction;
   let receipt;
   let retrying = false;
+  let _unobserve;
+  let _unwatch;
   const { promise: promise2, resolve: resolve6, reject } = withResolvers();
-  const timer = timeout ? setTimeout(() => reject(new WaitForTransactionReceiptTimeoutError({ hash: hash2 })), timeout) : undefined;
-  const _unobserve = observe(observerId, { onReplaced, resolve: resolve6, reject }, (emit) => {
-    const _unwatch = getAction(client, watchBlockNumber, "watchBlockNumber")({
+  const timer = timeout ? setTimeout(() => {
+    _unwatch();
+    _unobserve();
+    reject(new WaitForTransactionReceiptTimeoutError({ hash: hash2 }));
+  }, timeout) : undefined;
+  _unobserve = observe(observerId, { onReplaced, resolve: resolve6, reject }, (emit) => {
+    _unwatch = getAction(client, watchBlockNumber, "watchBlockNumber")({
       emitMissed: true,
       emitOnBegin: true,
       poll: true,
@@ -284458,4 +284485,4 @@ async function sdkCliCommand(argv = process.argv) {
 // src/cli.ts
 sdkCliCommand();
 
-//# debugId=81C26843B980220864756E2164756E21
+//# debugId=5A1CC22649BE687C64756E2164756E21