@gardenfi/utils 3.1.1-beta.15 → 3.1.1-beta.17

package/dist/index221.js

@@ -1,4 +1,217 @@
-const o = "1.2.3";
+import { anumber as C } from "./index222.js";
+import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index223.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
+function w(t, n) {
+  const o = t % n;
+  return o >= d ? o : n + o;
+}
+function $(t, n, o) {
+  let r = t;
+  for (; n-- > d; )
+    r *= r, r %= o;
+  return r;
+}
+function B(t, n) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (n <= d)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let o = w(t, n), r = n, s = d, l = f;
+  for (; o !== d; ) {
+    const c = r / o, e = r % o, i = s - l * c;
+    r = o, o = e, s = l, l = i;
+  }
+  if (r !== f)
+    throw new Error("invert: does not exist");
+  return w(s, n);
+}
+function M(t, n) {
+  const o = (t.ORDER + f) / L, r = t.pow(n, o);
+  if (!t.eql(t.sqr(r), n))
+    throw new Error("Cannot find square root");
+  return r;
+}
+function H(t, n) {
+  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
+  if (!t.eql(t.sqr(c), n))
+    throw new Error("Cannot find square root");
+  return c;
+}
+function K(t) {
+  if (t < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let n = t - f, o = 0;
+  for (; n % g === d; )
+    n /= g, o++;
+  let r = g;
+  const s = J(t);
+  for (; N(s, r) === 1; )
+    if (r++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (o === 1)
+    return M;
+  let l = s.pow(r, n);
+  const u = (n + f) / g;
+  return function(e, i) {
+    if (e.is0(i))
+      return i;
+    if (N(e, i) !== 1)
+      throw new Error("Cannot find square root");
+    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
+    for (; !e.eql(a, e.ONE); ) {
+      if (e.is0(a))
+        return e.ZERO;
+      let q = 1, v = e.sqr(a);
+      for (; !e.eql(v, e.ONE); )
+        if (q++, v = e.sqr(v), q === h)
+          throw new Error("Cannot find square root");
+      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
+      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
+    }
+    return m;
+  };
+}
+function Q(t) {
+  return t % L === j ? M : t % T === _ ? H : K(t);
+}
+const V = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function P(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
+  return z(t, o);
+}
+function Y(t, n, o) {
+  if (o < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (o === d)
+    return t.ONE;
+  if (o === f)
+    return n;
+  let r = t.ONE, s = n;
+  for (; o > d; )
+    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
+  return r;
+}
+function k(t, n, o = !1) {
+  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
+  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
+}
+function N(t, n) {
+  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
+  if (!s && !l && !u)
+    throw new Error("invalid Legendre symbol result");
+  return s ? 1 : l ? 0 : -1;
+}
+function G(t, n) {
+  n !== void 0 && C(n);
+  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
+  return { nBitLength: o, nByteLength: r };
+}
+function J(t, n, o = !1, r = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: l } = G(t, n);
+  if (l > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let u;
+  const c = Object.freeze({
+    ORDER: t,
+    isLE: o,
+    BITS: s,
+    BYTES: l,
+    MASK: Z(s),
+    ZERO: d,
+    ONE: f,
+    create: (e) => w(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof e);
+      return d <= e && e < t;
+    },
+    is0: (e) => e === d,
+    isOdd: (e) => (e & f) === f,
+    neg: (e) => w(-e, t),
+    eql: (e, i) => e === i,
+    sqr: (e) => w(e * e, t),
+    add: (e, i) => w(e + i, t),
+    sub: (e, i) => w(e - i, t),
+    mul: (e, i) => w(e * i, t),
+    pow: (e, i) => Y(c, e, i),
+    div: (e, i) => w(e * B(i, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, i) => e + i,
+    subN: (e, i) => e - i,
+    mulN: (e, i) => e * i,
+    inv: (e) => B(e, t),
+    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
+    toBytes: (e) => o ? I(e, l) : y(e, l),
+    fromBytes: (e) => {
+      if (e.length !== l)
+        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
+      return o ? S(e) : x(e);
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => k(c, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, i, h) => h ? i : e
+  });
+  return Object.freeze(c);
+}
+function O(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function U(t) {
+  const n = O(t);
+  return n + Math.ceil(n / 2);
+}
+function D(t, n, o = !1) {
+  const r = t.length, s = O(n), l = U(n);
+  if (r < 16 || r < l || r > 1024)
+    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
+  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
+  return o ? I(c, s) : y(c, s);
+}
 export {
-  o as version
+  J as Field,
+  k as FpInvertBatch,
+  N as FpLegendre,
+  Y as FpPow,
+  Q as FpSqrt,
+  O as getFieldBytesLength,
+  U as getMinHashLength,
+  B as invert,
+  D as mapHashToField,
+  w as mod,
+  G as nLength,
+  $ as pow2,
+  K as tonelliShanks,
+  P as validateField
 };

package/dist/index222.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index223.cjs");function a(t){var e;return t.type==="function"?`function ${t.name}(${r.formatAbiParameters(t.inputs)})${t.stateMutability&&t.stateMutability!=="nonpayable"?` ${t.stateMutability}`:""}${(e=t.outputs)!=null&&e.length?` returns (${r.formatAbiParameters(t.outputs)})`:""}`:t.type==="event"?`event ${t.name}(${r.formatAbiParameters(t.inputs)})`:t.type==="error"?`error ${t.name}(${r.formatAbiParameters(t.inputs)})`:t.type==="constructor"?`constructor(${r.formatAbiParameters(t.inputs)})${t.stateMutability==="payable"?" payable":""}`:t.type==="fallback"?`fallback() external${t.stateMutability==="payable"?" payable":""}`:"receive() external payable"}exports.formatAbiItem=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index226.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function s(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function u(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function f(t,...e){if(!s(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function h(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");u(t.outputLen),u(t.blockLen)}function g(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function b(t,e){f(t);const r=e.outputLen;if(t.length<r)throw new Error("digestInto() expects output buffer of length at least "+r)}function d(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function m(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function B(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function x(t,e){return t<<32-e|t>>>e}const a=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function y(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function p(t){for(let e=0;e<t.length;e++)t[e]=y(t[e]);return t}const E=a?t=>t:p;function l(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function w(t){return typeof t=="string"&&(t=l(t)),f(t),t}function A(...t){let e=0;for(let n=0;n<t.length;n++){const i=t[n];f(i),e+=i.length}const r=new Uint8Array(e);for(let n=0,i=0;n<t.length;n++){const c=t[n];r.set(c,i),i+=c.length}return r}class U{}function L(t){const e=n=>t().update(w(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function H(t=32){if(o.crypto&&typeof o.crypto.getRandomValues=="function")return o.crypto.getRandomValues(new Uint8Array(t));if(o.crypto&&typeof o.crypto.randomBytes=="function")return Uint8Array.from(o.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=U;exports.abytes=f;exports.aexists=g;exports.ahash=h;exports.anumber=u;exports.aoutput=b;exports.byteSwap=y;exports.byteSwap32=p;exports.clean=m;exports.concatBytes=A;exports.createHasher=L;exports.createView=B;exports.isBytes=s;exports.isLE=a;exports.randomBytes=H;exports.rotr=x;exports.swap32IfBE=E;exports.toBytes=w;exports.u32=d;exports.utf8ToBytes=l;

package/dist/index222.js

@@ -1,8 +1,111 @@
-import { formatAbiParameters as r } from "./index223.js";
-function u(t) {
-  var n;
-  return t.type === "function" ? `function ${t.name}(${r(t.inputs)})${t.stateMutability && t.stateMutability !== "nonpayable" ? ` ${t.stateMutability}` : ""}${(n = t.outputs) != null && n.length ? ` returns (${r(t.outputs)})` : ""}` : t.type === "event" ? `event ${t.name}(${r(t.inputs)})` : t.type === "error" ? `error ${t.name}(${r(t.inputs)})` : t.type === "constructor" ? `constructor(${r(t.inputs)})${t.stateMutability === "payable" ? " payable" : ""}` : t.type === "fallback" ? `fallback() external${t.stateMutability === "payable" ? " payable" : ""}` : "receive() external payable";
+import { crypto as o } from "./index226.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function s(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function c(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error("positive integer expected, got " + e);
+}
+function i(e, ...t) {
+  if (!s(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+}
+function g(e) {
+  if (typeof e != "function" || typeof e.create != "function")
+    throw new Error("Hash should be wrapped by utils.createHasher");
+  c(e.outputLen), c(e.blockLen);
+}
+function d(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function b(e, t) {
+  i(e);
+  const r = t.outputLen;
+  if (e.length < r)
+    throw new Error("digestInto() expects output buffer of length at least " + r);
+}
+function m(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function x(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+function A(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function E(e, t) {
+  return e << 32 - t | e >>> t;
+}
+const a = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function l(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function y(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = l(e[t]);
+  return e;
+}
+const U = a ? (e) => e : y;
+function p(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function w(e) {
+  return typeof e == "string" && (e = p(e)), i(e), e;
+}
+function B(...e) {
+  let t = 0;
+  for (let n = 0; n < e.length; n++) {
+    const f = e[n];
+    i(f), t += f.length;
+  }
+  const r = new Uint8Array(t);
+  for (let n = 0, f = 0; n < e.length; n++) {
+    const u = e[n];
+    r.set(u, f), f += u.length;
+  }
+  return r;
+}
+class L {
+}
+function H(e) {
+  const t = (n) => e().update(w(n)).digest(), r = e();
+  return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
+}
+function V(e = 32) {
+  if (o && typeof o.getRandomValues == "function")
+    return o.getRandomValues(new Uint8Array(e));
+  if (o && typeof o.randomBytes == "function")
+    return Uint8Array.from(o.randomBytes(e));
+  throw new Error("crypto.getRandomValues must be defined");
 }
 export {
-  u as formatAbiItem
+  L as Hash,
+  i as abytes,
+  d as aexists,
+  g as ahash,
+  c as anumber,
+  b as aoutput,
+  l as byteSwap,
+  y as byteSwap32,
+  x as clean,
+  B as concatBytes,
+  H as createHasher,
+  A as createView,
+  s as isBytes,
+  a as isLE,
+  V as randomBytes,
+  E as rotr,
+  U as swap32IfBE,
+  w as toBytes,
+  m as u32,
+  p as utf8ToBytes
 };

package/dist/index223.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index224.cjs");function m(r){let e="";const a=r.length;for(let t=0;t<a;t++){const o=r[t];e+=i.formatAbiParameter(o),t!==a-1&&(e+=", ")}return e}exports.formatAbiParameters=m;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const w=BigInt(0),m=BigInt(1);function y(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function d(t){if(!y(t))throw new Error("Uint8Array expected")}function I(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}function N(t){const e=t.toString(16);return e.length&1?"0"+e:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?w:BigInt("0x"+t)}const U=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",_=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function E(t){if(d(t),U)return t.toHex();let e="";for(let r=0;r<t.length;r++)e+=_[t[r]];return e}const u={_0:48,_9:57,A:65,F:70,a:97,f:102};function B(t){if(t>=u._0&&t<=u._9)return t-u._0;if(t>=u.A&&t<=u.F)return t-(u.A-10);if(t>=u.a&&t<=u.f)return t-(u.a-10)}function A(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(U)return Uint8Array.fromHex(t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=B(t.charCodeAt(i)),f=B(t.charCodeAt(i+1));if(a===void 0||f===void 0){const c=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+c+'" at index '+i)}n[o]=a*16+f}return n}function k(t){return h(E(t))}function O(t){return d(t),h(E(Uint8Array.from(t).reverse()))}function T(t,e){return A(t.toString(16).padStart(e*2,"0"))}function F(t,e){return T(t,e).reverse()}function M(t,e,r){let n;if(typeof e=="string")try{n=A(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(y(e))n=Uint8Array.from(e);else throw new Error(t+" must be hex string or Uint8Array");const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(t+" of length "+r+" expected, got "+o);return n}function v(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];d(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}const b=t=>typeof t=="bigint"&&w<=t;function H(t,e,r){return b(t)&&b(e)&&b(r)&&e<=t&&t<r}function R(t,e,r,n){if(!H(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function j(t){let e;for(e=0;t>w;t>>=m,e+=1);return e}const V=t=>(m<<BigInt(t))-m,p=t=>new Uint8Array(t),x=t=>Uint8Array.from(t);function z(t,e,r){if(typeof t!="number"||t<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=p(t),o=p(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},f=(...s)=>r(o,n,...s),c=(s=p(0))=>{o=f(x([0]),s),n=f(),s.length!==0&&(o=f(x([1]),s),n=f())},S=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const l=[];for(;s<e;){n=f();const g=n.slice();l.push(g),s+=n.length}return v(...l)};return(s,l)=>{a(),c(s);let g;for(;!(g=l(S()));)c();return a(),g}}const C={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"||y(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function D(t,e,r={}){const n=(o,i,a)=>{const f=C[i];if(typeof f!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!f(c,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+c)};for(const[o,i]of Object.entries(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}function L(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=R;exports.abool=I;exports.abytes=d;exports.bitLen=j;exports.bitMask=V;exports.bytesToHex=E;exports.bytesToNumberBE=k;exports.bytesToNumberLE=O;exports.concatBytes=v;exports.createHmacDrbg=z;exports.ensureBytes=M;exports.hexToBytes=A;exports.hexToNumber=h;exports.inRange=H;exports.isBytes=y;exports.memoized=L;exports.numberToBytesBE=T;exports.numberToBytesLE=F;exports.numberToHexUnpadded=N;exports.validateObject=D;

package/dist/index223.js

@@ -1,13 +1,209 @@
-import { formatAbiParameter as m } from "./index224.js";
-function f(e) {
-  let r = "";
-  const o = e.length;
-  for (let t = 0; t < o; t++) {
-    const a = e[t];
-    r += m(a), t !== o - 1 && (r += ", ");
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
+function b(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
+}
+function h(t) {
+  if (!b(t))
+    throw new Error("Uint8Array expected");
+}
+function k(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+function F(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function E(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? w : BigInt("0x" + t);
+}
+const U = (
+  // @ts-ignore
+  typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
+), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function x(t) {
+  if (h(t), U)
+    return t.toHex();
+  let n = "";
+  for (let e = 0; e < t.length; e++)
+    n += S[t[e]];
+  return n;
+}
+const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function m(t) {
+  if (t >= u._0 && t <= u._9)
+    return t - u._0;
+  if (t >= u.A && t <= u.F)
+    return t - (u.A - 10);
+  if (t >= u.a && t <= u.f)
+    return t - (u.a - 10);
+}
+function B(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (U)
+    return Uint8Array.fromHex(t);
+  const n = t.length, e = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const r = new Uint8Array(e);
+  for (let o = 0, i = 0; o < e; o++, i += 2) {
+    const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
+    if (a === void 0 || f === void 0) {
+      const c = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
+    }
+    r[o] = a * 16 + f;
   }
   return r;
 }
+function O(t) {
+  return E(x(t));
+}
+function V(t) {
+  return h(t), E(x(Uint8Array.from(t).reverse()));
+}
+function T(t, n) {
+  return B(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return T(t, n).reverse();
+}
+function M(t, n, e) {
+  let r;
+  if (typeof n == "string")
+    try {
+      r = B(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
+    }
+  else if (b(n))
+    r = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = r.length;
+  if (typeof e == "number" && o !== e)
+    throw new Error(t + " of length " + e + " expected, got " + o);
+  return r;
+}
+function H(...t) {
+  let n = 0;
+  for (let r = 0; r < t.length; r++) {
+    const o = t[r];
+    h(o), n += o.length;
+  }
+  const e = new Uint8Array(n);
+  for (let r = 0, o = 0; r < t.length; r++) {
+    const i = t[r];
+    e.set(i, o), o += i.length;
+  }
+  return e;
+}
+const y = (t) => typeof t == "bigint" && w <= t;
+function I(t, n, e) {
+  return y(t) && y(n) && y(e) && n <= t && t < e;
+}
+function R(t, n, e, r) {
+  if (!I(n, e, r))
+    throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
+}
+function j(t) {
+  let n;
+  for (n = 0; t > w; t >>= p, n += 1)
+    ;
+  return n;
+}
+const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function D(t, n, e) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof n != "number" || n < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof e != "function")
+    throw new Error("hmacFn must be a function");
+  let r = d(t), o = d(t), i = 0;
+  const a = () => {
+    r.fill(1), o.fill(0), i = 0;
+  }, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
+    o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
+  }, v = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let s = 0;
+    const l = [];
+    for (; s < n; ) {
+      r = f();
+      const g = r.slice();
+      l.push(g), s += r.length;
+    }
+    return H(...l);
+  };
+  return (s, l) => {
+    a(), c(s);
+    let g;
+    for (; !(g = l(v())); )
+      c();
+    return a(), g;
+  };
+}
+const _ = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  stringOrUint8Array: (t) => typeof t == "string" || b(t),
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, n) => n.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function P(t, n, e = {}) {
+  const r = (o, i, a) => {
+    const f = _[i];
+    if (typeof f != "function")
+      throw new Error("invalid validator function");
+    const c = t[o];
+    if (!(a && c === void 0) && !f(c, t))
+      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
+  };
+  for (const [o, i] of Object.entries(n))
+    r(o, i, !1);
+  for (const [o, i] of Object.entries(e))
+    r(o, i, !0);
+  return t;
+}
+function W(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (e, ...r) => {
+    const o = n.get(e);
+    if (o !== void 0)
+      return o;
+    const i = t(e, ...r);
+    return n.set(e, i), i;
+  };
+}
 export {
-  f as formatAbiParameters
+  R as aInRange,
+  k as abool,
+  h as abytes,
+  j as bitLen,
+  z as bitMask,
+  x as bytesToHex,
+  O as bytesToNumberBE,
+  V as bytesToNumberLE,
+  H as concatBytes,
+  D as createHmacDrbg,
+  M as ensureBytes,
+  B as hexToBytes,
+  E as hexToNumber,
+  I as inRange,
+  b as isBytes,
+  W as memoized,
+  T as numberToBytesBE,
+  C as numberToBytesLE,
+  F as numberToHexUnpadded,
+  P as validateObject
 };

package/dist/index224.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index225.cjs"),d=/^tuple(?<array>(\[(\d*)\])*)$/;function c(n){let e=n.type;if(d.test(n.type)&&"components"in n){e="(";const p=n.components.length;for(let t=0;t<p;t++){const s=n.components[t];e+=c(s),t<p-1&&(e+=", ")}const o=f.execTyped(d,n.type);return e+=`)${(o==null?void 0:o.array)||""}`,c({...n,type:e})}return"indexed"in n&&n.indexed&&(e=`${e} indexed`),n.name?`${e} ${n.name}`:e}exports.formatAbiParameter=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index222.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;

package/dist/index224.js

@@ -1,22 +1,45 @@
-import { execTyped as s } from "./index225.js";
-const c = /^tuple(?<array>(\[(\d*)\])*)$/;
-function d(n) {
-  let o = n.type;
-  if (c.test(n.type) && "components" in n) {
-    o = "(";
-    const p = n.components.length;
-    for (let t = 0; t < p; t++) {
-      const f = n.components[t];
-      o += d(f), t < p - 1 && (o += ", ");
-    }
-    const e = s(c, n.type);
-    return o += `)${(e == null ? void 0 : e.array) || ""}`, d({
-      ...n,
-      type: o
-    });
+import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index222.js";
+class r extends d {
+  constructor(t, i) {
+    super(), this.finished = !1, this.destroyed = !1, u(t);
+    const h = H(i);
+    if (this.iHash = t.create(), typeof this.iHash.update != "function")
+      throw new Error("Expected instance of class which extends utils.Hash");
+    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+    const o = this.blockLen, e = new Uint8Array(o);
+    e.set(h.length > o ? t.create().update(h).digest() : h);
+    for (let s = 0; s < e.length; s++)
+      e[s] ^= 54;
+    this.iHash.update(e), this.oHash = t.create();
+    for (let s = 0; s < e.length; s++)
+      e[s] ^= 106;
+    this.oHash.update(e), l(e);
+  }
+  update(t) {
+    return a(this), this.iHash.update(t), this;
+  }
+  digestInto(t) {
+    a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+  }
+  digest() {
+    const t = new Uint8Array(this.oHash.outputLen);
+    return this.digestInto(t), t;
+  }
+  _cloneInto(t) {
+    t || (t = Object.create(Object.getPrototypeOf(this), {}));
+    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
+    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+  destroy() {
+    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
   }
-  return "indexed" in n && n.indexed && (o = `${o} indexed`), n.name ? `${o} ${n.name}` : o;
 }
+const y = (n, t, i) => new r(n, t).update(i).digest();
+y.create = (n, t) => new r(n, t);
 export {
-  d as formatAbiParameter
+  r as HMAC,
+  y as hmac
 };

package/dist/index225.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function s(t,n){const e=t.exec(n);return e==null?void 0:e.groups}const g=/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/,o=/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/,c=/^\(.+?\).*?$/;exports.bytesRegex=g;exports.execTyped=s;exports.integerRegex=o;exports.isTupleRegex=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index222.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;