@1delta/margin-fetcher 0.0.48 → 0.0.51

package/dist/ccip-EHIFPB3Q.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"ccip-EHIFPB3Q.js"}

package/dist/{chunk-3CGLGAGR.js → chunk-BYTNVMX7.js}

@@ -1,5 +1,6 @@
+import * as nc from 'crypto';
+
 // ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/cryptoNode.js
-import * as nc from "crypto";
 var crypto = nc && typeof nc === "object" && "webcrypto" in nc ? nc.webcrypto : nc && typeof nc === "object" && "randomBytes" in nc ? nc : void 0;
 
 // ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/utils.js
@@ -354,49 +355,6 @@ var rotlSH = (h, l, s) => h << s | l >>> 32 - s;
 var rotlSL = (h, l, s) => l << s | h >>> 32 - s;
 var rotlBH = (h, l, s) => l << s - 32 | h >>> 64 - s;
 var rotlBL = (h, l, s) => h << s - 32 | l >>> 64 - s;
-
-export {
-  split,
-  rotlSH,
-  rotlSL,
-  rotlBH,
-  rotlBL,
-  anumber,
-  abytes,
-  ahash,
-  aexists,
-  aoutput,
-  u32,
-  clean,
-  createView,
-  rotr,
-  swap32IfBE,
-  toBytes,
-  concatBytes,
-  Hash,
-  createHasher,
-  randomBytes,
-  isBytes2 as isBytes,
-  abytes2,
-  abool,
-  numberToHexUnpadded,
-  bytesToHex,
-  hexToBytes,
-  bytesToNumberBE,
-  bytesToNumberLE,
-  numberToBytesBE,
-  numberToBytesLE,
-  ensureBytes,
-  concatBytes2,
-  utf8ToBytes2 as utf8ToBytes,
-  inRange,
-  aInRange,
-  bitLen,
-  bitMask,
-  createHmacDrbg,
-  validateObject,
-  memoized
-};
 /*! Bundled license information:
 
 @noble/hashes/esm/utils.js:
@@ -405,3 +363,7 @@ export {
 @noble/curves/esm/abstract/utils.js:
   (*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) *)
 */
+
+export { Hash, aInRange, abool, abytes, abytes2, aexists, ahash, anumber, aoutput, bitLen, bitMask, bytesToHex, bytesToNumberBE, bytesToNumberLE, clean, concatBytes, concatBytes2, createHasher, createHmacDrbg, createView, ensureBytes, hexToBytes, inRange, isBytes2 as isBytes, memoized, numberToBytesBE, numberToBytesLE, numberToHexUnpadded, randomBytes, rotlBH, rotlBL, rotlSH, rotlSL, rotr, split, swap32IfBE, toBytes, u32, utf8ToBytes2 as utf8ToBytes, validateObject };
+//# sourceMappingURL=chunk-BYTNVMX7.js.map
+//# sourceMappingURL=chunk-BYTNVMX7.js.map

package/dist/chunk-BYTNVMX7.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/cryptoNode.ts","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/utils.ts","../../../node_modules/.pnpm/@noble+curves@1.9.1/node_modules/@noble/curves/src/abstract/utils.ts","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/_u64.ts"],"names":["isBytes","abytes","concatBytes","utf8ToBytes"],"mappings":";;;AASO,IAAM,MAAA,GACX,EAAA,IAAM,OAAO,EAAA,KAAO,YAAY,WAAA,IAAe,EAAA,GACvC,EAAA,CAAA,SAAA,GACJ,EAAA,IAAM,OAAO,EAAA,KAAO,QAAA,IAAY,aAAA,IAAiB,KAC/C,EAAA,GACA,MAAA;;;ACCF,SAAU,QAAQ,CAAA,EAAU;AAChC,EAAA,OAAO,CAAA,YAAa,cAAe,WAAA,CAAY,MAAA,CAAO,CAAC,CAAA,IAAK,CAAA,CAAE,YAAY,IAAA,KAAS,YAAA;AACrF;AAGM,SAAU,QAAQ,CAAA,EAAS;AAC/B,EAAA,IAAI,CAAC,MAAA,CAAO,aAAA,CAAc,CAAC,KAAK,CAAA,GAAI,CAAA;AAAG,IAAA,MAAM,IAAI,KAAA,CAAM,iCAAA,GAAoC,CAAC,CAAA;AAC9F;AAGM,SAAU,MAAA,CAAO,MAA8B,OAAA,EAAiB;AACpE,EAAA,IAAI,CAAC,QAAQ,CAAC,CAAA;AAAG,IAAA,MAAM,IAAI,MAAM,qBAAqB,CAAA;AACtD,EAAA,IAAI,QAAQ,MAAA,GAAS,CAAA,IAAK,CAAC,OAAA,CAAQ,QAAA,CAAS,EAAE,MAAM,CAAA;AAClD,IAAA,MAAM,IAAI,KAAA,CAAM,gCAAA,GAAmC,OAAA,GAAU,eAAA,GAAkB,EAAE,MAAM,CAAA;AAC3F;AAGM,SAAU,MAAM,CAAA,EAAQ;AAC5B,EAAA,IAAI,OAAO,CAAA,KAAM,UAAA,IAAc,OAAO,EAAE,MAAA,KAAW,UAAA;AACjD,IAAA,MAAM,IAAI,MAAM,8CAA8C,CAAA;AAChE,EAAA,OAAA,CAAQ,EAAE,SAAS,CAAA;AACnB,EAAA,OAAA,CAAQ,EAAE,QAAQ,CAAA;AACpB;AAGM,SAAU,OAAA,CAAQ,QAAA,EAAe,aAAA,GAAgB,IAAA,EAAI;AACzD,EAAA,IAAI,QAAA,CAAS,SAAA;AAAW,IAAA,MAAM,IAAI,MAAM,kCAAkC,CAAA;AAC1E,EAAA,IAAI,iBAAiB,QAAA,CAAS,QAAA;AAAU,IAAA,MAAM,IAAI,MAAM,uCAAuC,CAAA;AACjG;AAGM,SAAU,OAAA,CAAQ,KAAU,QAAA,EAAa;AAC7C,EAAA,MAAA,CAAO,GAAG,CAAA;AACV,EAAA,MAAM,MAAM,QAAA,CAAS,SAAA;AACrB,EAAA,IAAI,GAAA,CAAI,SAAS,GAAA,EAAK;AACpB,IAAA,MAAM,IAAI,KAAA,CAAM,wDAAA,GAA2D,GAAG,CAAA;AAChF,EAAA;AACF;AAaM,SAAU,IAAI,GAAA,EAAe;AACjC,EAAA,OAAO,IAAI,WAAA,CAAY,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,UAAA,GAAa,CAAC,CAAC,CAAA;AACnF;AAGM,SAAU,SAAS,MAAA,EAAoB;AAC3C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,IAAA,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA;AAClB,EAAA;AACF;AAGM,SAAU,WAAW,GAAA,EAAe;AACxC,EAAA,OAAO,IAAI,QAAA,CAAS,GAAA,CAAI,QAAQ,GAAA,CAAI,UAAA,EAAY,IAAI,UAAU,CAAA;AAChE;AAGM,SAAU,IAAA,CAAK,MAAc,KAAA,EAAa;AAC9C,EAAA,OAAQ,IAAA,IAAS,EAAA,GAAK,KAAA,GAAW,IAAA,KAAS,KAAA;AAC5C;AAQO,IAAM,IAAA,mBAAiC,CAAA,MAC5C,IAAI,UAAA,CAAW,IAAI,WAAA,CAAY,CAAC,SAAU,CAAC,CAAA,CAAE,MAAM,CAAA,CAAE,CAAC,MAAM,EAAA,GAAK;AAG7D,SAAU,SAAS,IAAA,EAAY;AACnC,EAAA,OACI,IAAA,IAAQ,EAAA,GAAM,UAAA,GACd,IAAA,IAAQ,CAAA,GAAK,WACb,IAAA,KAAS,CAAA,GAAK,KAAA,GACd,IAAA,KAAS,EAAA,GAAM,GAAA;AAErB;AASM,SAAU,WAAW,GAAA,EAAgB;AACzC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAA,GAAA,CAAI,CAAC,CAAA,GAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAC,CAAA;AAC1B,EAAA;AACA,EAAA,OAAO,GAAA;AACT;AAEO,IAAM,UAAA,GAA8C,IAAA,GACvD,CAAC,CAAA,KAAmB,CAAA,GACpB;AA6FE,SAAU,YAAY,GAAA,EAAW;AACrC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA;AAAU,IAAA,MAAM,IAAI,MAAM,iBAAiB,CAAA;AAC9D,EAAA,OAAO,IAAI,UAAA,CAAW,IAAI,aAAW,CAAG,MAAA,CAAO,GAAG,CAAC,CAAA;AACrD;AAiBM,SAAU,QAAQ,IAAA,EAAW;AACjC,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA;AAAU,IAAA,IAAA,GAAO,YAAY,IAAI,CAAA;AACrD,EAAA,MAAA,CAAO,IAAI,CAAA;AACX,EAAA,OAAO,IAAA;AACT;AAeM,SAAU,eAAe,MAAA,EAAoB;AACjD,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAA,MAAA,CAAO,CAAC,CAAA;AACR,IAAA,GAAA,IAAO,CAAA,CAAE,MAAA;AACX,EAAA;AACA,EAAA,MAAM,GAAA,GAAM,IAAI,UAAA,CAAW,GAAG,CAAA;AAC9B,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,GAAA,GAAM,GAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC/C,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAA,GAAA,CAAI,GAAA,CAAI,GAAG,GAAG,CAAA;AACd,IAAA,GAAA,IAAO,CAAA,CAAE,MAAA;AACX,EAAA;AACA,EAAA,OAAO,GAAA;AACT;AAsBM,IAAgB,OAAhB,MAAoB;;AA4CpB,SAAU,aACd,QAAA,EAAuB;AAOvB,EAAA,MAAM,KAAA,GAAQ,CAAC,GAAA,KAA2B,QAAA,EAAQ,CAAG,OAAO,OAAA,CAAQ,GAAG,CAAC,CAAA,CAAE,MAAA,EAAM;AAChF,EAAA,MAAM,MAAM,QAAA,EAAQ;AACpB,EAAA,KAAA,CAAM,YAAY,GAAA,CAAI,SAAA;AACtB,EAAA,KAAA,CAAM,WAAW,GAAA,CAAI,QAAA;AACrB,EAAA,KAAA,CAAM,MAAA,GAAS,MAAM,QAAA,EAAQ;AAC7B,EAAA,OAAO,KAAA;AACT;AAsCM,SAAU,WAAA,CAAY,cAAc,EAAA,EAAE;AAC1C,EAAA,IAAI,MAAA,IAAU,OAAO,MAAA,CAAO,eAAA,KAAoB,UAAA,EAAY;AAC1D,IAAA,OAAO,MAAA,CAAO,eAAA,CAAgB,IAAI,UAAA,CAAW,WAAW,CAAC,CAAA;AAC3D,EAAA;AAEA,EAAA,IAAI,MAAA,IAAU,OAAO,MAAA,CAAO,WAAA,KAAgB,UAAA,EAAY;AACtD,IAAA,OAAO,UAAA,CAAW,IAAA,CAAK,MAAA,CAAO,WAAA,CAAY,WAAW,CAAC,CAAA;AACxD,EAAA;AACA,EAAA,MAAM,IAAI,MAAM,wCAAwC,CAAA;AAC1D;;;AChYA,IAAM,GAAA,0BAA6B,CAAC,CAAA;AACpC,IAAM,GAAA,0BAA6B,CAAC,CAAA;AAW9B,SAAUA,SAAQ,CAAA,EAAU;AAChC,EAAA,OAAO,CAAA,YAAa,cAAe,WAAA,CAAY,MAAA,CAAO,CAAC,CAAA,IAAK,CAAA,CAAE,YAAY,IAAA,KAAS,YAAA;AACrF;AAEM,SAAUC,QAAO,IAAA,EAAa;AAClC,EAAA,IAAI,CAACD,SAAQ,IAAI,CAAA;AAAG,IAAA,MAAM,IAAI,MAAM,qBAAqB,CAAA;AAC3D;AAEM,SAAU,KAAA,CAAM,OAAe,KAAA,EAAc;AACjD,EAAA,IAAI,OAAO,KAAA,KAAU,SAAA;AAAW,IAAA,MAAM,IAAI,KAAA,CAAM,KAAA,GAAQ,yBAAA,GAA4B,KAAK,CAAA;AAC3F;AAGM,SAAU,oBAAoB,GAAA,EAAoB;AACtD,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,QAAA,CAAS,EAAE,CAAA;AAC3B,EAAA,OAAO,GAAA,CAAI,MAAA,GAAS,CAAA,GAAI,GAAA,GAAM,GAAA,GAAM,GAAA;AACtC;AAEM,SAAU,YAAY,GAAA,EAAW;AACrC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA;AAAU,IAAA,MAAM,IAAI,KAAA,CAAM,2BAAA,GAA8B,OAAO,GAAG,CAAA;AACrF,EAAA,OAAO,GAAA,KAAQ,EAAA,GAAK,GAAA,GAAM,MAAA,CAAO,OAAO,GAAG,CAAA;AAC7C;AAGA,IAAM,aAAA;;EAEJ,OAAO,UAAA,CAAW,KAAK,EAAE,EAAE,KAAA,KAAU,UAAA,IAAc,OAAO,UAAA,CAAW,OAAA,KAAY;;AAGnF,IAAM,wBAAwB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,KAAG,EAAI,CAAC,CAAA,EAAG,CAAA,KAC5D,EAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA;AAO3B,SAAU,WAAW,KAAA,EAAiB;AAC1C,EAAAC,QAAO,KAAK,CAAA;AAEZ,EAAA,IAAI,aAAA;AAAe,IAAA,OAAO,MAAM,KAAA,EAAK;AAErC,EAAA,IAAI,GAAA,GAAM,EAAA;AACV,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,GAAA,IAAO,KAAA,CAAM,KAAA,CAAM,CAAC,CAAC,CAAA;AACvB,EAAA;AACA,EAAA,OAAO,GAAA;AACT;AAGA,IAAM,MAAA,GAAS,EAAE,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,GAAG,GAAA,EAAG;AAC5D,SAAS,cAAc,EAAA,EAAU;AAC/B,EAAA,IAAI,EAAA,IAAM,MAAA,CAAO,EAAA,IAAM,EAAA,IAAM,MAAA,CAAO,EAAA;AAAI,IAAA,OAAO,KAAK,MAAA,CAAO,EAAA;AAC3D,EAAA,IAAI,EAAA,IAAM,MAAA,CAAO,CAAA,IAAK,EAAA,IAAM,MAAA,CAAO,CAAA;AAAG,IAAA,OAAO,EAAA,IAAM,OAAO,CAAA,GAAI,EAAA,CAAA;AAC9D,EAAA,IAAI,EAAA,IAAM,MAAA,CAAO,CAAA,IAAK,EAAA,IAAM,MAAA,CAAO,CAAA;AAAG,IAAA,OAAO,EAAA,IAAM,OAAO,CAAA,GAAI,EAAA,CAAA;AAC9D,EAAA;AACF;AAMM,SAAU,WAAW,GAAA,EAAW;AACpC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA;AAAU,IAAA,MAAM,IAAI,KAAA,CAAM,2BAAA,GAA8B,OAAO,GAAG,CAAA;AAErF,EAAA,IAAI,aAAA;AAAe,IAAA,OAAO,UAAA,CAAW,QAAQ,GAAG,CAAA;AAChD,EAAA,MAAM,KAAK,GAAA,CAAI,MAAA;AACf,EAAA,MAAM,KAAK,EAAA,GAAK,CAAA;AAChB,EAAA,IAAI,EAAA,GAAK,CAAA;AAAG,IAAA,MAAM,IAAI,KAAA,CAAM,kDAAA,GAAqD,EAAE,CAAA;AACnF,EAAA,MAAM,KAAA,GAAQ,IAAI,UAAA,CAAW,EAAE,CAAA;AAC/B,EAAA,KAAA,IAAS,EAAA,GAAK,GAAG,EAAA,GAAK,CAAA,EAAG,KAAK,EAAA,EAAI,EAAA,EAAA,EAAM,MAAM,CAAA,EAAG;AAC/C,IAAA,MAAM,EAAA,GAAK,aAAA,CAAc,GAAA,CAAI,UAAA,CAAW,EAAE,CAAC,CAAA;AAC3C,IAAA,MAAM,KAAK,aAAA,CAAc,GAAA,CAAI,UAAA,CAAW,EAAA,GAAK,CAAC,CAAC,CAAA;AAC/C,IAAA,IAAI,EAAA,KAAO,MAAA,IAAa,EAAA,KAAO,MAAA,EAAW;AACxC,MAAA,MAAM,OAAO,GAAA,CAAI,EAAE,CAAA,GAAI,GAAA,CAAI,KAAK,CAAC,CAAA;AACjC,MAAA,MAAM,IAAI,KAAA,CAAM,8CAAA,GAAiD,IAAA,GAAO,gBAAgB,EAAE,CAAA;AAC5F,IAAA;AACA,IAAA,KAAA,CAAM,EAAE,CAAA,GAAI,EAAA,GAAK,EAAA,GAAK,EAAA;AACxB,EAAA;AACA,EAAA,OAAO,KAAA;AACT;AAGM,SAAU,gBAAgB,KAAA,EAAiB;AAC/C,EAAA,OAAO,WAAA,CAAY,UAAA,CAAW,KAAK,CAAC,CAAA;AACtC;AACM,SAAU,gBAAgB,KAAA,EAAiB;AAC/C,EAAAA,QAAO,KAAK,CAAA;AACZ,EAAA,OAAO,WAAA,CAAY,WAAW,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,CAAE,OAAA,EAAS,CAAC,CAAA;AACjE;AAEM,SAAU,eAAA,CAAgB,GAAoB,GAAA,EAAW;AAC7D,EAAA,OAAO,UAAA,CAAW,EAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,GAAA,GAAM,CAAA,EAAG,GAAG,CAAC,CAAA;AACzD;AACM,SAAU,eAAA,CAAgB,GAAoB,GAAA,EAAW;AAC7D,EAAA,OAAO,eAAA,CAAgB,CAAA,EAAG,GAAG,CAAA,CAAE,OAAA,EAAO;AACxC;AAeM,SAAU,WAAA,CAAY,KAAA,EAAe,GAAA,EAAU,cAAA,EAAuB;AAC1E,EAAA,IAAI,GAAA;AACJ,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,IAAI;AACF,MAAA,GAAA,GAAM,WAAW,GAAG,CAAA;AACtB,IAAA,CAAA,CAAA,OAAS,CAAA,EAAG;AACV,MAAA,MAAM,IAAI,KAAA,CAAM,KAAA,GAAQ,4CAAA,GAA+C,CAAC,CAAA;AAC1E,IAAA;EACF,CAAA,MAAA,IAAWD,QAAAA,CAAQ,GAAG,CAAA,EAAG;AAGvB,IAAA,GAAA,GAAM,UAAA,CAAW,KAAK,GAAG,CAAA;EAC3B,CAAA,MAAO;AACL,IAAA,MAAM,IAAI,KAAA,CAAM,KAAA,GAAQ,mCAAmC,CAAA;AAC7D,EAAA;AACA,EAAA,MAAM,MAAM,GAAA,CAAI,MAAA;AAChB,EAAA,IAAI,OAAO,cAAA,KAAmB,QAAA,IAAY,GAAA,KAAQ,cAAA;AAChD,IAAA,MAAM,IAAI,KAAA,CAAM,KAAA,GAAQ,aAAA,GAAgB,cAAA,GAAiB,oBAAoB,GAAG,CAAA;AAClF,EAAA,OAAO,GAAA;AACT;AAKM,SAAUE,gBAAe,MAAA,EAAoB;AACjD,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAAD,QAAO,CAAC,CAAA;AACR,IAAA,GAAA,IAAO,CAAA,CAAE,MAAA;AACX,EAAA;AACA,EAAA,MAAM,GAAA,GAAM,IAAI,UAAA,CAAW,GAAG,CAAA;AAC9B,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,GAAA,GAAM,GAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC/C,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAA,GAAA,CAAI,GAAA,CAAI,GAAG,GAAG,CAAA;AACd,IAAA,GAAA,IAAO,CAAA,CAAE,MAAA;AACX,EAAA;AACA,EAAA,OAAO,GAAA;AACT;AAiBM,SAAUE,aAAY,GAAA,EAAW;AACrC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA;AAAU,IAAA,MAAM,IAAI,MAAM,iBAAiB,CAAA;AAC9D,EAAA,OAAO,IAAI,UAAA,CAAW,IAAI,aAAW,CAAG,MAAA,CAAO,GAAG,CAAC,CAAA;AACrD;AAGA,IAAM,WAAW,CAAC,CAAA,KAAc,OAAO,CAAA,KAAM,YAAY,GAAA,IAAO,CAAA;AAE1D,SAAU,OAAA,CAAQ,CAAA,EAAW,GAAA,EAAa,GAAA,EAAW;AACzD,EAAA,OAAO,QAAA,CAAS,CAAC,CAAA,IAAK,QAAA,CAAS,GAAG,CAAA,IAAK,QAAA,CAAS,GAAG,CAAA,IAAK,GAAA,IAAO,CAAA,IAAK,CAAA,GAAI,GAAA;AAC1E;AAOM,SAAU,QAAA,CAAS,KAAA,EAAe,CAAA,EAAW,GAAA,EAAa,GAAA,EAAW;AAMzE,EAAA,IAAI,CAAC,OAAA,CAAQ,CAAA,EAAG,GAAA,EAAK,GAAG,CAAA;AACtB,IAAA,MAAM,IAAI,MAAM,iBAAA,GAAoB,KAAA,GAAQ,OAAO,GAAA,GAAM,UAAA,GAAa,GAAA,GAAM,QAAA,GAAW,CAAC,CAAA;AAC5F;AASM,SAAU,OAAO,CAAA,EAAS;AAC9B,EAAA,IAAI,GAAA;AACJ,EAAA,KAAK,MAAM,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,KAAM,KAAK,GAAA,IAAO,CAAA;AAAE,IAAA;AAC3C,EAAA,OAAO,GAAA;AACT;AAsBO,IAAM,UAAU,CAAC,CAAA,KAAA,CAAuB,GAAA,IAAO,MAAA,CAAO,CAAC,CAAA,IAAK;AAInE,IAAM,GAAA,GAAM,CAAC,GAAA,KAAgB,IAAI,WAAW,GAAG,CAAA;AAC/C,IAAM,IAAA,GAAO,CAAC,GAAA,KAA2B,UAAA,CAAW,KAAK,GAAG,CAAA;AAStD,SAAU,cAAA,CACd,OAAA,EACA,QAAA,EACA,MAAA,EAAkE;AAElE,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,OAAA,GAAU,CAAA;AAAG,IAAA,MAAM,IAAI,MAAM,0BAA0B,CAAA;AAC1F,EAAA,IAAI,OAAO,QAAA,KAAa,QAAA,IAAY,QAAA,GAAW,CAAA;AAAG,IAAA,MAAM,IAAI,MAAM,2BAA2B,CAAA;AAC7F,EAAA,IAAI,OAAO,MAAA,KAAW,UAAA;AAAY,IAAA,MAAM,IAAI,MAAM,2BAA2B,CAAA;AAE7E,EAAA,IAAI,CAAA,GAAI,IAAI,OAAO,CAAA;AACnB,EAAA,IAAI,CAAA,GAAI,IAAI,OAAO,CAAA;AACnB,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,MAAM,QAAQ,MAAK;AACjB,IAAA,CAAA,CAAE,KAAK,CAAC,CAAA;AACR,IAAA,CAAA,CAAE,KAAK,CAAC,CAAA;AACR,IAAA,CAAA,GAAI,CAAA;AACN,EAAA,CAAA;AACA,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA,KAAoB,OAAO,CAAA,EAAG,CAAA,EAAG,GAAG,CAAC,CAAA;AACnD,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,GAAO,GAAA,CAAI,CAAC,CAAA,KAAK;AAE/B,IAAA,CAAA,GAAI,EAAE,IAAA,CAAK,CAAC,CAAI,CAAC,GAAG,IAAI,CAAA;AACxB,IAAA,CAAA,GAAI,CAAA,EAAC;AACL,IAAA,IAAI,KAAK,MAAA,KAAW,CAAA;AAAG,MAAA;AACvB,IAAA,CAAA,GAAI,EAAE,IAAA,CAAK,CAAC,CAAI,CAAC,GAAG,IAAI,CAAA;AACxB,IAAA,CAAA,GAAI,CAAA,EAAC;AACP,EAAA,CAAA;AACA,EAAA,MAAM,MAAM,MAAK;AAEf,IAAA,IAAI,CAAA,EAAA,IAAO,GAAA;AAAM,MAAA,MAAM,IAAI,MAAM,yBAAyB,CAAA;AAC1D,IAAA,IAAI,GAAA,GAAM,CAAA;AACV,IAAA,MAAM,MAAoB,EAAA;AAC1B,IAAA,OAAO,MAAM,QAAA,EAAU;AACrB,MAAA,CAAA,GAAI,CAAA,EAAC;AACL,MAAA,MAAM,EAAA,GAAK,EAAE,KAAA,EAAK;AAClB,MAAA,GAAA,CAAI,KAAK,EAAE,CAAA;AACX,MAAA,GAAA,IAAO,CAAA,CAAE,MAAA;AACX,IAAA;AACA,IAAA,OAAOD,YAAAA,CAAY,GAAG,GAAG,CAAA;AAC3B,EAAA,CAAA;AACA,EAAA,MAAM,QAAA,GAAW,CAAC,IAAA,EAAkB,IAAA,KAAoB;AACtD,IAAA,KAAA,EAAK;AACL,IAAA,MAAA,CAAO,IAAI,CAAA;AACX,IAAA,IAAI,GAAA,GAAqB,MAAA;AACzB,IAAA,OAAO,EAAE,GAAA,GAAM,IAAA,CAAK,GAAA,EAAK,CAAA,CAAA;AAAI,MAAA,MAAA,EAAM;AACnC,IAAA,KAAA,EAAK;AACL,IAAA,OAAO,GAAA;AACT,EAAA,CAAA;AACA,EAAA,OAAO,QAAA;AACT;AAIA,IAAM,YAAA,GAAe;EACnB,MAAA,EAAQ,CAAC,GAAA,KAAsB,OAAO,GAAA,KAAQ,QAAA;EAC9C,QAAA,EAAU,CAAC,GAAA,KAAsB,OAAO,GAAA,KAAQ,UAAA;EAChD,OAAA,EAAS,CAAC,GAAA,KAAsB,OAAO,GAAA,KAAQ,SAAA;EAC/C,MAAA,EAAQ,CAAC,GAAA,KAAsB,OAAO,GAAA,KAAQ,QAAA;AAC9C,EAAA,kBAAA,EAAoB,CAAC,GAAA,KAAsB,OAAO,GAAA,KAAQ,QAAA,IAAYF,SAAQ,GAAG,CAAA;AACjF,EAAA,aAAA,EAAe,CAAC,GAAA,KAAsB,MAAA,CAAO,aAAA,CAAc,GAAG,CAAA;AAC9D,EAAA,KAAA,EAAO,CAAC,GAAA,KAAsB,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA;AAC/C,EAAA,KAAA,EAAO,CAAC,GAAA,EAAU,MAAA,KAAsB,MAAA,CAAe,EAAA,CAAG,QAAQ,GAAG,CAAA;EACrE,IAAA,EAAM,CAAC,QAAsB,OAAO,GAAA,KAAQ,cAAc,MAAA,CAAO,aAAA,CAAc,IAAI,SAAS;;AAMxF,SAAU,cAAA,CACd,MAAA,EACA,UAAA,EACA,aAAA,GAA2B,EAAA,EAAE;AAE7B,EAAA,MAAM,UAAA,GAAa,CAAC,SAAA,EAAoB,IAAA,EAAiB,UAAA,KAAuB;AAC9E,IAAA,MAAM,QAAA,GAAW,aAAa,IAAI,CAAA;AAClC,IAAA,IAAI,OAAO,QAAA,KAAa,UAAA;AAAY,MAAA,MAAM,IAAI,MAAM,4BAA4B,CAAA;AAEhF,IAAA,MAAM,GAAA,GAAM,OAAO,SAAgC,CAAA;AACnD,IAAA,IAAI,cAAc,GAAA,KAAQ,MAAA;AAAW,MAAA;AACrC,IAAA,IAAI,CAAC,QAAA,CAAS,GAAA,EAAK,MAAM,CAAA,EAAG;AAC1B,MAAA,MAAM,IAAI,MACR,QAAA,GAAW,MAAA,CAAO,SAAS,CAAA,GAAI,wBAAA,GAA2B,IAAA,GAAO,QAAA,GAAW,GAAG,CAAA;AAEnF,IAAA;AACF,EAAA,CAAA;AACA,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,IAAI,CAAA,IAAK,MAAA,CAAO,QAAQ,UAAU,CAAA;AAAG,IAAA,UAAA,CAAW,SAAA,EAAW,MAAO,KAAK,CAAA;AAC9F,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,IAAI,CAAA,IAAK,MAAA,CAAO,QAAQ,aAAa,CAAA;AAAG,IAAA,UAAA,CAAW,SAAA,EAAW,MAAO,IAAI,CAAA;AAChG,EAAA,OAAO,MAAA;AACT;AAqBM,SAAU,SACd,EAAA,EAA6B;AAE7B,EAAA,MAAM,GAAA,uBAAU,OAAA,EAAO;AACvB,EAAA,OAAO,CAAC,QAAW,IAAA,KAAc;AAC/B,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA;AACvB,IAAA,IAAI,GAAA,KAAQ,MAAA;AAAW,MAAA,OAAO,GAAA;AAC9B,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,GAAA,EAAK,GAAG,IAAI,CAAA;AAChC,IAAA,GAAA,CAAI,GAAA,CAAI,KAAK,QAAQ,CAAA;AACrB,IAAA,OAAO,QAAA;AACT,EAAA,CAAA;AACF;;;ACxXA,IAAM,UAAA,mBAA6B,MAAA,CAAO,CAAA,IAAK,EAAA,GAAK,CAAC,CAAA;AACrD,IAAM,IAAA,0BAA8B,EAAE,CAAA;AAEtC,SAAS,OAAA,CACP,CAAA,EACA,EAAA,GAAK,KAAA,EAAK;AAKV,EAAA,IAAI,EAAA;AAAI,IAAA,OAAO,EAAE,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,UAAU,CAAA,EAAG,CAAA,EAAG,MAAA,CAAQ,CAAA,IAAK,IAAA,GAAQ,UAAU,CAAA,EAAC;AAC/E,EAAA,OAAO,EAAE,CAAA,EAAG,MAAA,CAAQ,CAAA,IAAK,IAAA,GAAQ,UAAU,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,MAAA,CAAO,CAAA,GAAI,UAAU,IAAI,CAAA,EAAC;AACjF;AAEA,SAAS,KAAA,CAAM,GAAA,EAAe,EAAA,GAAK,KAAA,EAAK;AACtC,EAAA,MAAM,MAAM,GAAA,CAAI,MAAA;AAChB,EAAA,IAAI,EAAA,GAAK,IAAI,WAAA,CAAY,GAAG,CAAA;AAC5B,EAAA,IAAI,EAAA,GAAK,IAAI,WAAA,CAAY,GAAG,CAAA;AAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,EAAA,EAAK;AAC5B,IAAA,MAAM,EAAE,GAAG,CAAA,EAAC,GAAK,QAAQ,GAAA,CAAI,CAAC,GAAG,EAAE,CAAA;AACnC,IAAA,CAAC,EAAA,CAAG,CAAC,CAAA,EAAG,EAAA,CAAG,CAAC,CAAC,CAAA,GAAI,CAAC,CAAA,EAAG,CAAC,CAAA;AACxB,EAAA;AACA,EAAA,OAAO,CAAC,IAAI,EAAE,CAAA;AAChB;AAgBA,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAK,CAAA,GAAM,MAAO,EAAA,GAAK;AACpF,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAK,CAAA,GAAM,MAAO,EAAA,GAAK;AAEpF,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAM,CAAA,GAAI,EAAA,GAAQ,CAAA,KAAO,EAAA,GAAK;AAC3F,IAAM,MAAA,GAAS,CAAC,CAAA,EAAW,CAAA,EAAW,MAAuB,CAAA,IAAM,CAAA,GAAI,EAAA,GAAQ,CAAA,KAAO,EAAA,GAAK","file":"chunk-BYTNVMX7.js","sourcesContent":["/**\n * Internal webcrypto alias.\n * We prefer WebCrypto aka globalThis.crypto, which exists in node.js 16+.\n * Falls back to Node.js built-in crypto for Node.js <=v14.\n * See utils.ts for details.\n * @module\n */\n// @ts-ignore\nimport * as nc from 'node:crypto';\nexport const crypto: any =\n  nc && typeof nc === 'object' && 'webcrypto' in nc\n    ? (nc.webcrypto as any)\n    : nc && typeof nc === 'object' && 'randomBytes' in nc\n      ? nc\n      : undefined;\n","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n  return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number): void {\n  if (!Number.isSafeInteger(n) || n < 0) throw new Error('positive integer expected, got ' + n);\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(b: Uint8Array | undefined, ...lengths: number[]): void {\n  if (!isBytes(b)) throw new Error('Uint8Array expected');\n  if (lengths.length > 0 && !lengths.includes(b.length))\n    throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);\n}\n\n/** Asserts something is hash */\nexport function ahash(h: IHash): void {\n  if (typeof h !== 'function' || typeof h.create !== 'function')\n    throw new Error('Hash should be wrapped by utils.createHasher');\n  anumber(h.outputLen);\n  anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n  abytes(out);\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new Error('digestInto() expects output buffer of length at least ' + min);\n  }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n  return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n  return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n  for (let i = 0; i < arrays.length; i++) {\n    arrays[i].fill(0);\n  }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n  return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n  return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n  new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n  return (\n    ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff)\n  );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n  ? (n: number) => n\n  : (n: number) => byteSwap(n);\n\n/** @deprecated */\nexport const byteSwapIfBE: typeof swap8IfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n  for (let i = 0; i < arr.length; i++) {\n    arr[i] = byteSwap(arr[i]);\n  }\n  return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n  ? (u: Uint32Array) => u\n  : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n  // @ts-ignore\n  typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  abytes(bytes);\n  // @ts-ignore\n  if (hasHexBuiltin) return bytes.toHex();\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n  if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n  if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n  if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n  return;\n}\n\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  // @ts-ignore\n  if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n  const array = new Uint8Array(al);\n  for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n    const n1 = asciiToBase16(hex.charCodeAt(hi));\n    const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n    if (n1 === undefined || n2 === undefined) {\n      const char = hex[hi] + hex[hi + 1];\n      throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n    }\n    array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n  }\n  return array;\n}\n\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n  iters: number,\n  tick: number,\n  cb: (i: number) => void\n): Promise<void> {\n  let ts = Date.now();\n  for (let i = 0; i < iters; i++) {\n    cb(i);\n    // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n    const diff = Date.now() - ts;\n    if (diff >= 0 && diff < tick) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error('string expected');\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes: Uint8Array): string {\n  return new TextDecoder().decode(bytes);\n}\n\n/** Accepted input of hash functions. Strings are converted to byte arrays. */\nexport type Input = string | Uint8Array;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  abytes(data);\n  return data;\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data: KDFInput): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  abytes(data);\n  return data;\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  let sum = 0;\n  for (let i = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    abytes(a);\n    sum += a.length;\n  }\n  const res = new Uint8Array(sum);\n  for (let i = 0, pad = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    res.set(a, pad);\n    pad += a.length;\n  }\n  return res;\n}\n\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts?: T2\n): T1 & T2 {\n  if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n    throw new Error('options should be object or undefined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\n/** Hash interface. */\nexport type IHash = {\n  (data: Uint8Array): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create: any;\n};\n\n/** For runtime check if class implements interface */\nexport abstract class Hash<T extends Hash<T>> {\n  abstract blockLen: number; // Bytes per block\n  abstract outputLen: number; // Bytes in output\n  abstract update(buf: Input): this;\n  // Writes digest into buf\n  abstract digestInto(buf: Uint8Array): void;\n  abstract digest(): Uint8Array;\n  /**\n   * Resets internal state. Makes Hash instance unusable.\n   * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n   * by user, they will need to manually call `destroy()` when zeroing is necessary.\n   */\n  abstract destroy(): void;\n  /**\n   * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n   * when no options are passed.\n   * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n   * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n   * There are no guarantees for clean-up because it's impossible in JS.\n   */\n  abstract _cloneInto(to?: T): T;\n  // Safe version that clones internal state\n  abstract clone(): T;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n  xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n  xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash function */\nexport type CHash = ReturnType<typeof createHasher>;\n/** Hash function with output */\nexport type CHashO = ReturnType<typeof createOptHasher>;\n/** XOF with output */\nexport type CHashXO = ReturnType<typeof createXOFer>;\n\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher<T extends Hash<T>>(\n  hashCons: () => Hash<T>\n): {\n  (msg: Input): Uint8Array;\n  outputLen: number;\n  blockLen: number;\n  create(): Hash<T>;\n} {\n  const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n  const tmp = hashCons();\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = () => hashCons();\n  return hashC;\n}\n\nexport function createOptHasher<H extends Hash<H>, T extends Object>(\n  hashCons: (opts?: T) => Hash<H>\n): {\n  (msg: Input, opts?: T): Uint8Array;\n  outputLen: number;\n  blockLen: number;\n  create(opts?: T): Hash<H>;\n} {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts?: T) => hashCons(opts);\n  return hashC;\n}\n\nexport function createXOFer<H extends HashXOF<H>, T extends Object>(\n  hashCons: (opts?: T) => HashXOF<H>\n): {\n  (msg: Input, opts?: T): Uint8Array;\n  outputLen: number;\n  blockLen: number;\n  create(opts?: T): HashXOF<H>;\n} {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts?: T) => hashCons(opts);\n  return hashC;\n}\nexport const wrapConstructor: typeof createHasher = createHasher;\nexport const wrapConstructorWithOpts: typeof createOptHasher = createOptHasher;\nexport const wrapXOFConstructorWithOpts: typeof createXOFer = createXOFer;\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n  if (crypto && typeof crypto.getRandomValues === 'function') {\n    return crypto.getRandomValues(new Uint8Array(bytesLength));\n  }\n  // Legacy Node.js compatibility\n  if (crypto && typeof crypto.randomBytes === 'function') {\n    return Uint8Array.from(crypto.randomBytes(bytesLength));\n  }\n  throw new Error('crypto.getRandomValues must be defined');\n}\n","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nexport type Hex = Uint8Array | string; // hex strings are accepted for simplicity\nexport type PrivKey = Hex | bigint; // bigints are accepted to ease learning curve\nexport type CHash = {\n  (message: Uint8Array | string): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array | string) => Uint8Array;\n\nexport function isBytes(a: unknown): a is Uint8Array {\n  return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\nexport function abytes(item: unknown): void {\n  if (!isBytes(item)) throw new Error('Uint8Array expected');\n}\n\nexport function abool(title: string, value: boolean): void {\n  if (typeof value !== 'boolean') throw new Error(title + ' boolean expected, got ' + value);\n}\n\n// Used in weierstrass, der\nexport function numberToHexUnpadded(num: number | bigint): string {\n  const hex = num.toString(16);\n  return hex.length & 1 ? '0' + hex : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean =\n  // @ts-ignore\n  typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function';\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  abytes(bytes);\n  // @ts-ignore\n  if (hasHexBuiltin) return bytes.toHex();\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n  if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n  if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n  if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n  return;\n}\n\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  // @ts-ignore\n  if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n  const array = new Uint8Array(al);\n  for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n    const n1 = asciiToBase16(hex.charCodeAt(hi));\n    const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n    if (n1 === undefined || n2 === undefined) {\n      const char = hex[hi] + hex[hi + 1];\n      throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n    }\n    array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n  }\n  return array;\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n  return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n  abytes(bytes);\n  return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n  return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n  return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n  return hexToBytes(numberToHexUnpadded(n));\n}\n\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title: string, hex: Hex, expectedLength?: number): Uint8Array {\n  let res: Uint8Array;\n  if (typeof hex === 'string') {\n    try {\n      res = hexToBytes(hex);\n    } catch (e) {\n      throw new Error(title + ' must be hex string or Uint8Array, cause: ' + e);\n    }\n  } else if (isBytes(hex)) {\n    // Uint8Array.from() instead of hash.slice() because node.js Buffer\n    // is instance of Uint8Array, and its slice() creates **mutable** copy\n    res = Uint8Array.from(hex);\n  } else {\n    throw new Error(title + ' must be hex string or Uint8Array');\n  }\n  const len = res.length;\n  if (typeof expectedLength === 'number' && len !== expectedLength)\n    throw new Error(title + ' of length ' + expectedLength + ' expected, got ' + len);\n  return res;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  let sum = 0;\n  for (let i = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    abytes(a);\n    sum += a.length;\n  }\n  const res = new Uint8Array(sum);\n  for (let i = 0, pad = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    res.set(a, pad);\n    pad += a.length;\n  }\n  return res;\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n  if (a.length !== b.length) return false;\n  let diff = 0;\n  for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n  return diff === 0;\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error('string expected');\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n// Is positive bigint\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\nexport function inRange(n: bigint, min: bigint, max: bigint): boolean {\n  return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title: string, n: bigint, min: bigint, max: bigint): void {\n  // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n  // consider P=256n, min=0n, max=P\n  // - a for min=0 would require -1:          `inRange('x', x, -1n, P)`\n  // - b would commonly require subtraction:  `inRange('x', x, 0n, P - 1n)`\n  // - our way is the cleanest:               `inRange('x', x, 0n, P)\n  if (!inRange(n, min, max))\n    throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n\n// Bit operations\n\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n */\nexport function bitLen(n: bigint): number {\n  let len;\n  for (len = 0; n > _0n; n >>= _1n, len += 1);\n  return len;\n}\n\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n: bigint, pos: number): bigint {\n  return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n  return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\nconst u8n = (len: number) => new Uint8Array(len); // creates Uint8Array\nconst u8fr = (arr: ArrayLike<number>) => Uint8Array.from(arr); // another shortcut\ntype Pred<T> = (v: Uint8Array) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg<T>(\n  hashLen: number,\n  qByteLen: number,\n  hmacFn: (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n  if (typeof hashLen !== 'number' || hashLen < 2) throw new Error('hashLen must be a number');\n  if (typeof qByteLen !== 'number' || qByteLen < 2) throw new Error('qByteLen must be a number');\n  if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n  // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n  let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n  let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n  let i = 0; // Iterations counter, will throw when over 1000\n  const reset = () => {\n    v.fill(1);\n    k.fill(0);\n    i = 0;\n  };\n  const h = (...b: Uint8Array[]) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n  const reseed = (seed = u8n(0)) => {\n    // HMAC-DRBG reseed() function. Steps D-G\n    k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n    v = h(); // v = hmac(k || v)\n    if (seed.length === 0) return;\n    k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n    v = h(); // v = hmac(k || v)\n  };\n  const gen = () => {\n    // HMAC-DRBG generate() function\n    if (i++ >= 1000) throw new Error('drbg: tried 1000 values');\n    let len = 0;\n    const out: Uint8Array[] = [];\n    while (len < qByteLen) {\n      v = h();\n      const sl = v.slice();\n      out.push(sl);\n      len += v.length;\n    }\n    return concatBytes(...out);\n  };\n  const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {\n    reset();\n    reseed(seed); // Steps D-G\n    let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n    while (!(res = pred(gen()))) reseed();\n    reset();\n    return res;\n  };\n  return genUntil;\n}\n\n// Validating curves and fields\n\nconst validatorFns = {\n  bigint: (val: any): boolean => typeof val === 'bigint',\n  function: (val: any): boolean => typeof val === 'function',\n  boolean: (val: any): boolean => typeof val === 'boolean',\n  string: (val: any): boolean => typeof val === 'string',\n  stringOrUint8Array: (val: any): boolean => typeof val === 'string' || isBytes(val),\n  isSafeInteger: (val: any): boolean => Number.isSafeInteger(val),\n  array: (val: any): boolean => Array.isArray(val),\n  field: (val: any, object: any): any => (object as any).Fp.isValid(val),\n  hash: (val: any): boolean => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n} as const;\ntype Validator = keyof typeof validatorFns;\ntype ValMap<T extends Record<string, any>> = { [K in keyof T]?: Validator };\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\n\nexport function validateObject<T extends Record<string, any>>(\n  object: T,\n  validators: ValMap<T>,\n  optValidators: ValMap<T> = {}\n): T {\n  const checkField = (fieldName: keyof T, type: Validator, isOptional: boolean) => {\n    const checkVal = validatorFns[type];\n    if (typeof checkVal !== 'function') throw new Error('invalid validator function');\n\n    const val = object[fieldName as keyof typeof object];\n    if (isOptional && val === undefined) return;\n    if (!checkVal(val, object)) {\n      throw new Error(\n        'param ' + String(fieldName) + ' is invalid. Expected ' + type + ', got ' + val\n      );\n    }\n  };\n  for (const [fieldName, type] of Object.entries(validators)) checkField(fieldName, type!, false);\n  for (const [fieldName, type] of Object.entries(optValidators)) checkField(fieldName, type!, true);\n  return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n\n/**\n * throws not implemented error\n */\nexport const notImplemented = (): never => {\n  throw new Error('not implemented');\n};\n\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized<T extends object, R, O extends any[]>(\n  fn: (arg: T, ...args: O) => R\n): (arg: T, ...args: O) => R {\n  const map = new WeakMap<T, R>();\n  return (arg: T, ...args: O): R => {\n    const val = map.get(arg);\n    if (val !== undefined) return val;\n    const computed = fn(arg, ...args);\n    map.set(arg, computed);\n    return computed;\n  };\n}\n","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n\nfunction fromBig(\n  n: bigint,\n  le = false\n): {\n  h: number;\n  l: number;\n} {\n  if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n  return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\n  const len = lst.length;\n  let Ah = new Uint32Array(len);\n  let Al = new Uint32Array(len);\n  for (let i = 0; i < len; i++) {\n    const { h, l } = fromBig(lst[i], le);\n    [Ah[i], Al[i]] = [h, l];\n  }\n  return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(\n  Ah: number,\n  Al: number,\n  Bh: number,\n  Bl: number\n): {\n  h: number;\n  l: number;\n} {\n  const l = (Al >>> 0) + (Bl >>> 0);\n  return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n  (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n  (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n  (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n  (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n  (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n  add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\n  fromBig, split, toBig,\n  shrSH, shrSL,\n  rotrSH, rotrSL, rotrBH, rotrBL,\n  rotr32H, rotr32L,\n  rotlSH, rotlSL, rotlBH, rotlBL,\n  add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n"]}

package/dist/{chunk-TQZVAE5Q.js → chunk-GVXFZPTM.js}

@@ -1,20 +1,4 @@
-import {
-  Hash,
-  abytes,
-  aexists,
-  anumber,
-  aoutput,
-  clean,
-  createHasher,
-  rotlBH,
-  rotlBL,
-  rotlSH,
-  rotlSL,
-  split,
-  swap32IfBE,
-  toBytes,
-  u32
-} from "./chunk-3CGLGAGR.js";
+import { split, createHasher, Hash, anumber, u32, swap32IfBE, aexists, toBytes, abytes, aoutput, clean, rotlSH, rotlSL, rotlBH, rotlBL } from './chunk-BYTNVMX7.js';
 
 // ../../node_modules/.pnpm/abitype@1.1.0_typescript@5.9.2_zod@3.25.76/node_modules/abitype/dist/esm/version.js
 var version = "1.1.0";
@@ -1055,146 +1039,6 @@ var batchGatewayAbi = [
     ]
   }
 ];
-var universalResolverErrors = [
-  {
-    inputs: [
-      {
-        name: "dns",
-        type: "bytes"
-      }
-    ],
-    name: "DNSDecodingFailed",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        name: "ens",
-        type: "string"
-      }
-    ],
-    name: "DNSEncodingFailed",
-    type: "error"
-  },
-  {
-    inputs: [],
-    name: "EmptyAddress",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        name: "status",
-        type: "uint16"
-      },
-      {
-        name: "message",
-        type: "string"
-      }
-    ],
-    name: "HttpError",
-    type: "error"
-  },
-  {
-    inputs: [],
-    name: "InvalidBatchGatewayResponse",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        name: "errorData",
-        type: "bytes"
-      }
-    ],
-    name: "ResolverError",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        name: "name",
-        type: "bytes"
-      },
-      {
-        name: "resolver",
-        type: "address"
-      }
-    ],
-    name: "ResolverNotContract",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        name: "name",
-        type: "bytes"
-      }
-    ],
-    name: "ResolverNotFound",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        name: "primary",
-        type: "string"
-      },
-      {
-        name: "primaryAddress",
-        type: "bytes"
-      }
-    ],
-    name: "ReverseAddressMismatch",
-    type: "error"
-  },
-  {
-    inputs: [
-      {
-        internalType: "bytes4",
-        name: "selector",
-        type: "bytes4"
-      }
-    ],
-    name: "UnsupportedResolverProfile",
-    type: "error"
-  }
-];
-var universalResolverResolveAbi = [
-  ...universalResolverErrors,
-  {
-    name: "resolveWithGateways",
-    type: "function",
-    stateMutability: "view",
-    inputs: [
-      { name: "name", type: "bytes" },
-      { name: "data", type: "bytes" },
-      { name: "gateways", type: "string[]" }
-    ],
-    outputs: [
-      { name: "", type: "bytes" },
-      { name: "address", type: "address" }
-    ]
-  }
-];
-var universalResolverReverseAbi = [
-  ...universalResolverErrors,
-  {
-    name: "reverseWithGateways",
-    type: "function",
-    stateMutability: "view",
-    inputs: [
-      { type: "bytes", name: "reverseName" },
-      { type: "uint256", name: "coinType" },
-      { type: "string[]", name: "gateways" }
-    ],
-    outputs: [
-      { type: "string", name: "resolvedName" },
-      { type: "address", name: "resolver" },
-      { type: "address", name: "reverseResolver" }
-    ]
-  }
-];
 
 // ../../node_modules/.pnpm/viem@2.37.8_typescript@5.9.2_zod@3.25.76/node_modules/viem/_esm/constants/contract.js
 var aggregate3Signature = "0x82ad56cb";
@@ -2201,9 +2045,9 @@ var checksumAddressCache = /* @__PURE__ */ new LruMap(8192);
 function checksumAddress(address_, chainId) {
   if (checksumAddressCache.has(`${address_}.${chainId}`))
     return checksumAddressCache.get(`${address_}.${chainId}`);
-  const hexAddress = chainId ? `${chainId}${address_.toLowerCase()}` : address_.substring(2).toLowerCase();
+  const hexAddress = address_.substring(2).toLowerCase();
   const hash2 = keccak256(stringToBytes(hexAddress), "bytes");
-  const address = (chainId ? hexAddress.substring(`${chainId}0x`.length) : hexAddress).split("");
+  const address = (hexAddress).split("");
   for (let i = 0; i < 40; i += 2) {
     if (hash2[i >> 1] >> 4 >= 8 && address[i]) {
       address[i] = address[i].toUpperCase();
@@ -2328,7 +2172,7 @@ var staticCursor = {
   pushUint24(value) {
     this.assertPosition(this.position + 2);
     this.dataView.setUint16(this.position, value >> 8);
-    this.dataView.setUint8(this.position + 2, value & ~4294967040);
+    this.dataView.setUint8(this.position + 2, value & 255);
     this.position += 3;
   },
   pushUint32(value) {
@@ -2886,7 +2730,7 @@ function decodeErrorResult(parameters) {
 // ../../node_modules/.pnpm/viem@2.37.8_typescript@5.9.2_zod@3.25.76/node_modules/viem/_esm/utils/stringify.js
 var stringify = (value, replacer, space) => JSON.stringify(value, (key, value_) => {
   const value2 = typeof value_ === "bigint" ? value_.toString() : value_;
-  return typeof replacer === "function" ? replacer(key, value2) : value2;
+  return value2;
 }, space);
 
 // ../../node_modules/.pnpm/viem@2.37.8_typescript@5.9.2_zod@3.25.76/node_modules/viem/_esm/utils/hash/toEventSelector.js
@@ -3745,103 +3589,6 @@ function serializeStateOverride(parameters) {
   }
   return rpcStateOverride;
 }
-
-// ../../node_modules/.pnpm/viem@2.37.8_typescript@5.9.2_zod@3.25.76/node_modules/viem/_esm/constants/number.js
-var maxInt8 = 2n ** (8n - 1n) - 1n;
-var maxInt16 = 2n ** (16n - 1n) - 1n;
-var maxInt24 = 2n ** (24n - 1n) - 1n;
-var maxInt32 = 2n ** (32n - 1n) - 1n;
-var maxInt40 = 2n ** (40n - 1n) - 1n;
-var maxInt48 = 2n ** (48n - 1n) - 1n;
-var maxInt56 = 2n ** (56n - 1n) - 1n;
-var maxInt64 = 2n ** (64n - 1n) - 1n;
-var maxInt72 = 2n ** (72n - 1n) - 1n;
-var maxInt80 = 2n ** (80n - 1n) - 1n;
-var maxInt88 = 2n ** (88n - 1n) - 1n;
-var maxInt96 = 2n ** (96n - 1n) - 1n;
-var maxInt104 = 2n ** (104n - 1n) - 1n;
-var maxInt112 = 2n ** (112n - 1n) - 1n;
-var maxInt120 = 2n ** (120n - 1n) - 1n;
-var maxInt128 = 2n ** (128n - 1n) - 1n;
-var maxInt136 = 2n ** (136n - 1n) - 1n;
-var maxInt144 = 2n ** (144n - 1n) - 1n;
-var maxInt152 = 2n ** (152n - 1n) - 1n;
-var maxInt160 = 2n ** (160n - 1n) - 1n;
-var maxInt168 = 2n ** (168n - 1n) - 1n;
-var maxInt176 = 2n ** (176n - 1n) - 1n;
-var maxInt184 = 2n ** (184n - 1n) - 1n;
-var maxInt192 = 2n ** (192n - 1n) - 1n;
-var maxInt200 = 2n ** (200n - 1n) - 1n;
-var maxInt208 = 2n ** (208n - 1n) - 1n;
-var maxInt216 = 2n ** (216n - 1n) - 1n;
-var maxInt224 = 2n ** (224n - 1n) - 1n;
-var maxInt232 = 2n ** (232n - 1n) - 1n;
-var maxInt240 = 2n ** (240n - 1n) - 1n;
-var maxInt248 = 2n ** (248n - 1n) - 1n;
-var maxInt256 = 2n ** (256n - 1n) - 1n;
-var minInt8 = -(2n ** (8n - 1n));
-var minInt16 = -(2n ** (16n - 1n));
-var minInt24 = -(2n ** (24n - 1n));
-var minInt32 = -(2n ** (32n - 1n));
-var minInt40 = -(2n ** (40n - 1n));
-var minInt48 = -(2n ** (48n - 1n));
-var minInt56 = -(2n ** (56n - 1n));
-var minInt64 = -(2n ** (64n - 1n));
-var minInt72 = -(2n ** (72n - 1n));
-var minInt80 = -(2n ** (80n - 1n));
-var minInt88 = -(2n ** (88n - 1n));
-var minInt96 = -(2n ** (96n - 1n));
-var minInt104 = -(2n ** (104n - 1n));
-var minInt112 = -(2n ** (112n - 1n));
-var minInt120 = -(2n ** (120n - 1n));
-var minInt128 = -(2n ** (128n - 1n));
-var minInt136 = -(2n ** (136n - 1n));
-var minInt144 = -(2n ** (144n - 1n));
-var minInt152 = -(2n ** (152n - 1n));
-var minInt160 = -(2n ** (160n - 1n));
-var minInt168 = -(2n ** (168n - 1n));
-var minInt176 = -(2n ** (176n - 1n));
-var minInt184 = -(2n ** (184n - 1n));
-var minInt192 = -(2n ** (192n - 1n));
-var minInt200 = -(2n ** (200n - 1n));
-var minInt208 = -(2n ** (208n - 1n));
-var minInt216 = -(2n ** (216n - 1n));
-var minInt224 = -(2n ** (224n - 1n));
-var minInt232 = -(2n ** (232n - 1n));
-var minInt240 = -(2n ** (240n - 1n));
-var minInt248 = -(2n ** (248n - 1n));
-var minInt256 = -(2n ** (256n - 1n));
-var maxUint8 = 2n ** 8n - 1n;
-var maxUint16 = 2n ** 16n - 1n;
-var maxUint24 = 2n ** 24n - 1n;
-var maxUint32 = 2n ** 32n - 1n;
-var maxUint40 = 2n ** 40n - 1n;
-var maxUint48 = 2n ** 48n - 1n;
-var maxUint56 = 2n ** 56n - 1n;
-var maxUint64 = 2n ** 64n - 1n;
-var maxUint72 = 2n ** 72n - 1n;
-var maxUint80 = 2n ** 80n - 1n;
-var maxUint88 = 2n ** 88n - 1n;
-var maxUint96 = 2n ** 96n - 1n;
-var maxUint104 = 2n ** 104n - 1n;
-var maxUint112 = 2n ** 112n - 1n;
-var maxUint120 = 2n ** 120n - 1n;
-var maxUint128 = 2n ** 128n - 1n;
-var maxUint136 = 2n ** 136n - 1n;
-var maxUint144 = 2n ** 144n - 1n;
-var maxUint152 = 2n ** 152n - 1n;
-var maxUint160 = 2n ** 160n - 1n;
-var maxUint168 = 2n ** 168n - 1n;
-var maxUint176 = 2n ** 176n - 1n;
-var maxUint184 = 2n ** 184n - 1n;
-var maxUint192 = 2n ** 192n - 1n;
-var maxUint200 = 2n ** 200n - 1n;
-var maxUint208 = 2n ** 208n - 1n;
-var maxUint216 = 2n ** 216n - 1n;
-var maxUint224 = 2n ** 224n - 1n;
-var maxUint232 = 2n ** 232n - 1n;
-var maxUint240 = 2n ** 240n - 1n;
-var maxUint248 = 2n ** 248n - 1n;
 var maxUint256 = 2n ** 256n - 1n;
 
 // ../../node_modules/.pnpm/viem@2.37.8_typescript@5.9.2_zod@3.25.76/node_modules/viem/_esm/utils/transaction/assertRequest.js
@@ -3945,7 +3692,7 @@ async function call(client, args) {
     return { data: response };
   } catch (err) {
     const data2 = getRevertErrorData(err);
-    const { offchainLookup: offchainLookup2, offchainLookupSignature: offchainLookupSignature2 } = await import("./ccip-QOODCD4F.js");
+    const { offchainLookup: offchainLookup2, offchainLookupSignature: offchainLookupSignature2 } = await import('./ccip-EHIFPB3Q.js');
     if (client.ccipRead !== false && data2?.slice(0, 10) === offchainLookupSignature2 && to)
       return { data: await offchainLookup2(client, { data: data2, to }) };
     if (deploylessCall && data2?.slice(0, 10) === "0x101bb98d")
@@ -4326,12 +4073,6 @@ async function ccipRequest({ data, sender, urls }) {
   throw error;
 }
 
-export {
-  BaseError3 as BaseError,
-  formatUnits,
-  formatEther,
-  offchainLookupSignature,
-  offchainLookupAbiItem,
-  offchainLookup,
-  ccipRequest
-};
+export { BaseError3 as BaseError, ccipRequest, formatEther, formatUnits, offchainLookup, offchainLookupAbiItem, offchainLookupSignature };
+//# sourceMappingURL=chunk-GVXFZPTM.js.map
+//# sourceMappingURL=chunk-GVXFZPTM.js.map