@gardenfi/utils 2.1.2-beta.8 → 2.1.2-beta.9

package/dist/index71.js

@@ -1,194 +1,72 @@
-import { AbiEncodingLengthMismatchError as y, InvalidAbiEncodingTypeError as u, InvalidArrayError as g, AbiEncodingArrayLengthMismatchError as l, AbiEncodingBytesSizeMismatchError as b } from "./index54.js";
-import { InvalidAddressError as w } from "./index34.js";
-import { BaseError as A } from "./index48.js";
-import { IntegerOutOfRangeError as x } from "./index45.js";
-import { isAddress as z } from "./index35.js";
-import { concat as f } from "./index72.js";
-import { padHex as d } from "./index46.js";
-import { size as a } from "./index51.js";
-import { slice as E } from "./index91.js";
-import { numberToHex as m, boolToHex as P, stringToHex as S } from "./index26.js";
-import { integerRegex as I } from "./index68.js";
-function K(e, t) {
-  if (e.length !== t.length)
-    throw new y({
-      expectedLength: e.length,
-      givenLength: t.length
-    });
-  const o = L({
-    params: e,
-    values: t
-  }), n = h(o);
-  return n.length === 0 ? "0x" : n;
+import { crypto as o } from "./index73.js";
+import { abytes as i } from "./index70.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function g(t) {
+  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
 }
-function L({ params: e, values: t }) {
-  const o = [];
-  for (let n = 0; n < e.length; n++)
-    o.push(p({ param: e[n], value: t[n] }));
-  return o;
+function m(t) {
+  return new DataView(t.buffer, t.byteOffset, t.byteLength);
 }
-function p({ param: e, value: t }) {
-  const o = W(e.type);
-  if (o) {
-    const [n, r] = o;
-    return M(t, { length: n, param: { ...e, type: r } });
-  }
-  if (e.type === "tuple")
-    return H(t, {
-      param: e
-    });
-  if (e.type === "address")
-    return B(t);
-  if (e.type === "bool")
-    return T(t);
-  if (e.type.startsWith("uint") || e.type.startsWith("int")) {
-    const n = e.type.startsWith("int"), [, , r = "256"] = I.exec(e.type) ?? [];
-    return $(t, {
-      signed: n,
-      size: Number(r)
-    });
-  }
-  if (e.type.startsWith("bytes"))
-    return N(t, { param: e });
-  if (e.type === "string")
-    return C(t);
-  throw new u(e.type, {
-    docsPath: "/docs/contract/encodeAbiParameters"
-  });
+function w(t, e) {
+  return t << 32 - e | t >>> e;
 }
-function h(e) {
-  let t = 0;
-  for (let i = 0; i < e.length; i++) {
-    const { dynamic: c, encoded: s } = e[i];
-    c ? t += 32 : t += a(s);
-  }
-  const o = [], n = [];
-  let r = 0;
-  for (let i = 0; i < e.length; i++) {
-    const { dynamic: c, encoded: s } = e[i];
-    c ? (o.push(m(t + r, { size: 32 })), n.push(s), r += a(s)) : o.push(s);
-  }
-  return f([...o, ...n]);
+const b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function c(t) {
+  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
 }
-function B(e) {
-  if (!z(e))
-    throw new w({ address: e });
-  return { dynamic: !1, encoded: d(e.toLowerCase()) };
+function a(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = c(t[e]);
 }
-function M(e, { length: t, param: o }) {
-  const n = t === null;
-  if (!Array.isArray(e))
-    throw new g(e);
-  if (!n && e.length !== t)
-    throw new l({
-      expectedLength: t,
-      givenLength: e.length,
-      type: `${o.type}[${t}]`
-    });
-  let r = !1;
-  const i = [];
-  for (let c = 0; c < e.length; c++) {
-    const s = p({ param: o, value: e[c] });
-    s.dynamic && (r = !0), i.push(s);
-  }
-  if (n || r) {
-    const c = h(i);
-    if (n) {
-      const s = m(i.length, { size: 32 });
-      return {
-        dynamic: !0,
-        encoded: i.length > 0 ? f([s, c]) : s
-      };
-    }
-    if (r)
-      return { dynamic: !0, encoded: c };
-  }
-  return {
-    dynamic: !1,
-    encoded: f(i.map(({ encoded: c }) => c))
-  };
+function s(t) {
+  if (typeof t != "string")
+    throw new Error("utf8ToBytes expected string, got " + typeof t);
+  return new Uint8Array(new TextEncoder().encode(t));
 }
-function N(e, { param: t }) {
-  const [, o] = t.type.split("bytes"), n = a(e);
-  if (!o) {
-    let r = e;
-    return n % 32 !== 0 && (r = d(r, {
-      dir: "right",
-      size: Math.ceil((e.length - 2) / 2 / 32) * 32
-    })), {
-      dynamic: !0,
-      encoded: f([d(m(n, { size: 32 })), r])
-    };
-  }
-  if (n !== Number.parseInt(o))
-    throw new b({
-      expectedSize: Number.parseInt(o),
-      value: e
-    });
-  return { dynamic: !1, encoded: d(e, { dir: "right" }) };
-}
-function T(e) {
-  if (typeof e != "boolean")
-    throw new A(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);
-  return { dynamic: !1, encoded: d(P(e)) };
+function y(t) {
+  return typeof t == "string" && (t = s(t)), i(t), t;
 }
-function $(e, { signed: t, size: o = 256 }) {
-  if (typeof o == "number") {
-    const n = 2n ** (BigInt(o) - (t ? 1n : 0n)) - 1n, r = t ? -n - 1n : 0n;
-    if (e > n || e < r)
-      throw new x({
-        max: n.toString(),
-        min: r.toString(),
-        signed: t,
-        size: o / 8,
-        value: e.toString()
-      });
+function x(...t) {
+  let e = 0;
+  for (let n = 0; n < t.length; n++) {
+    const r = t[n];
+    i(r), e += r.length;
   }
-  return {
-    dynamic: !1,
-    encoded: m(e, {
-      size: 32,
-      signed: t
-    })
-  };
-}
-function C(e) {
-  const t = S(e), o = Math.ceil(a(t) / 32), n = [];
-  for (let r = 0; r < o; r++)
-    n.push(d(E(t, r * 32, (r + 1) * 32), {
-      dir: "right"
-    }));
-  return {
-    dynamic: !0,
-    encoded: f([
-      d(m(a(t), { size: 32 })),
-      ...n
-    ])
-  };
+  const f = new Uint8Array(e);
+  for (let n = 0, r = 0; n < t.length; n++) {
+    const u = t[n];
+    f.set(u, r), r += u.length;
+  }
+  return f;
 }
-function H(e, { param: t }) {
-  let o = !1;
-  const n = [];
-  for (let r = 0; r < t.components.length; r++) {
-    const i = t.components[r], c = Array.isArray(e) ? r : i.name, s = p({
-      param: i,
-      value: e[c]
-    });
-    n.push(s), s.dynamic && (o = !0);
+class h {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
   }
-  return {
-    dynamic: o,
-    encoded: o ? h(n) : f(n.map(({ encoded: r }) => r))
-  };
 }
-function W(e) {
-  const t = e.match(/^(.*)\[(\d+)?\]$/);
-  return t ? (
-    // Return `null` if the array is dynamic.
-    [t[2] ? Number(t[2]) : null, t[1]]
-  ) : void 0;
+function B(t) {
+  const e = (n) => t().update(y(n)).digest(), f = t();
+  return e.outputLen = f.outputLen, e.blockLen = f.blockLen, e.create = () => t(), e;
+}
+function d(t = 32) {
+  if (o && typeof o.getRandomValues == "function")
+    return o.getRandomValues(new Uint8Array(t));
+  if (o && typeof o.randomBytes == "function")
+    return o.randomBytes(t);
+  throw new Error("crypto.getRandomValues must be defined");
 }
 export {
-  K as encodeAbiParameters,
-  W as getArrayComponents
+  h as Hash,
+  c as byteSwap,
+  a as byteSwap32,
+  x as concatBytes,
+  m as createView,
+  b as isLE,
+  d as randomBytes,
+  w as rotr,
+  y as toBytes,
+  g as u32,
+  s as utf8ToBytes,
+  B as wrapConstructor
 };

package/dist/index72.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function a(t){return typeof t[0]=="string"?f(t):o(t)}function o(t){let n=0;for(const r of t)n+=r.length;const e=new Uint8Array(n);let c=0;for(const r of t)e.set(r,c),c+=r.length;return e}function f(t){return`0x${t.reduce((n,e)=>n+e.replace("0x",""),"")}`}exports.concat=a;exports.concatBytes=o;exports.concatHex=f;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index70.cjs"),c=require("./index71.cjs");function a(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 d(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class w extends c.Hash{constructor(t,s,i,n){super(),this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=c.createView(this.buffer)}update(t){p.aexists(this);const{view:s,buffer:i,blockLen:n}=this;t=c.toBytes(t);const r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=c.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){p.aexists(this),p.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,this.buffer.subarray(e).fill(0),this.padOffset>n-e&&(this.process(i,0),e=0);for(let f=e;f<n;f++)s[f]=0;a(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=c.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let f=0;f<l;f++)h.setUint32(4*f,g[f],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.length=n,t.pos=h,t.finished=r,t.destroyed=e,n%s&&t.buffer.set(i),t}}exports.Chi=d;exports.HashMD=w;exports.Maj=b;exports.setBigUint64=a;

package/dist/index72.js

@@ -1,21 +1,70 @@
-function i(t) {
-  return typeof t[0] == "string" ? f(t) : c(t);
+import { aexists as g, aoutput as d } from "./index70.js";
+import { Hash as b, createView as p, toBytes as a } from "./index71.js";
+function w(o, t, s, i) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, i);
+  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
+  o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
 }
-function c(t) {
-  let n = 0;
-  for (const e of t)
-    n += e.length;
-  const r = new Uint8Array(n);
-  let o = 0;
-  for (const e of t)
-    r.set(e, o), o += e.length;
-  return r;
+function B(o, t, s) {
+  return o & t ^ ~o & s;
 }
-function f(t) {
-  return `0x${t.reduce((n, r) => n + r.replace("0x", ""), "")}`;
+function L(o, t, s) {
+  return o & t ^ o & s ^ t & s;
+}
+class U extends b {
+  constructor(t, s, i, n) {
+    super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
+  }
+  update(t) {
+    g(this);
+    const { view: s, buffer: i, blockLen: n } = this;
+    t = a(t);
+    const h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(n - this.pos, h - e);
+      if (r === n) {
+        const u = p(t);
+        for (; n <= h - e; e += n)
+          this.process(u, e);
+        continue;
+      }
+      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    g(this), d(t, this), this.finished = !0;
+    const { buffer: s, view: i, blockLen: n, isLE: h } = this;
+    let { pos: e } = this;
+    s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
+    for (let f = e; f < n; f++)
+      s[f] = 0;
+    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
+    const r = p(t), u = this.outputLen;
+    if (u % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const c = u / 4, l = this.get();
+    if (c > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < c; f++)
+      r.setUint32(4 * f, l[f], h);
+  }
+  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: h, destroyed: e, pos: r } = this;
+    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
+  }
 }
 export {
-  i as concat,
-  c as concatBytes,
-  f as concatHex
+  B as Chi,
+  U as HashMD,
+  L as Maj,
+  w as setBigUint64
 };

package/dist/index73.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index74.cjs"),c=require("./index75.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.ahash(t);const h=c.toBytes(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 a=this.blockLen,e=new Uint8Array(a);e.set(h.length>a?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),e.fill(0)}update(t){return o.aexists(this),this.iHash.update(t),this}digestInto(t){o.aexists(this),o.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:i,iHash:h,finished:a,destroyed:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=u,t.oHash=i._cloneInto(t.oHash),t.iHash=h._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

package/dist/index73.js

@@ -1,43 +1,4 @@
-import { ahash as c, aexists as a, abytes as u } from "./index74.js";
-import { Hash as H, toBytes as p } from "./index75.js";
-class r extends H {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, c(t);
-    const h = p(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), e.fill(0);
-  }
-  update(t) {
-    return a(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a(this), u(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: d } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = d, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const l = (n, t, i) => new r(n, t).update(i).digest();
-l.create = (n, t) => new r(n, t);
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  r as HMAC,
-  l as hmac
+  o as crypto
 };

package/dist/index74.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function i(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!i(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 a(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");r(e.outputLen),r(e.blockLen)}function s(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 u(e,t){o(e);const n=t.outputLen;if(e.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}exports.abytes=o;exports.aexists=s;exports.ahash=a;exports.anumber=r;exports.aoutput=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const y=BigInt(0),d=BigInt(1),N=BigInt(2);function b(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function m(t){if(!b(t))throw new Error("Uint8Array expected")}function _(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}const k=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function B(t){m(t);let e="";for(let r=0;r<t.length;r++)e+=k[t[r]];return e}function x(t){const e=t.toString(16);return e.length&1?"0"+e:e}function E(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?y:BigInt("0x"+t)}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function T(t){if(t>=f._0&&t<=f._9)return t-f._0;if(t>=f.A&&t<=f.F)return t-(f.A-10);if(t>=f.a&&t<=f.f)return t-(f.a-10)}function p(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof 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=T(t.charCodeAt(i)),s=T(t.charCodeAt(i+1));if(a===void 0||s===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+s}return n}function H(t){return E(B(t))}function O(t){return m(t),E(B(Uint8Array.from(t).reverse()))}function U(t,e){return p(t.toString(16).padStart(e*2,"0"))}function F(t,e){return U(t,e).reverse()}function V(t){return p(x(t))}function M(t,e,r){let n;if(typeof e=="string")try{n=p(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(b(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 I(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];m(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}function R(t,e){if(t.length!==e.length)return!1;let r=0;for(let n=0;n<t.length;n++)r|=t[n]^e[n];return r===0}function j(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}const w=t=>typeof t=="bigint"&&y<=t;function S(t,e,r){return w(t)&&w(e)&&w(r)&&e<=t&&t<r}function z(t,e,r,n){if(!S(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function C(t){let e;for(e=0;t>y;t>>=d,e+=1);return e}function D(t,e){return t>>BigInt(e)&d}function G(t,e,r){return t|(r?d:y)<<BigInt(e)}const L=t=>(N<<BigInt(t-1))-d,h=t=>new Uint8Array(t),A=t=>Uint8Array.from(t);function P(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=h(t),o=h(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},s=(...u)=>r(o,n,...u),c=(u=h())=>{o=s(A([0]),u),n=s(),u.length!==0&&(o=s(A([1]),u),n=s())},v=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let u=0;const l=[];for(;u<e;){n=s();const g=n.slice();l.push(g),u+=n.length}return I(...l)};return(u,l)=>{a(),c(u);let g;for(;!(g=l(v()));)c();return a(),g}}const q={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,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function W(t,e,r={}){const n=(o,i,a)=>{const s=q[i];if(typeof s!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!s(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}const J=()=>{throw new Error("not implemented")};function K(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=z;exports.abool=_;exports.abytes=m;exports.bitGet=D;exports.bitLen=C;exports.bitMask=L;exports.bitSet=G;exports.bytesToHex=B;exports.bytesToNumberBE=H;exports.bytesToNumberLE=O;exports.concatBytes=I;exports.createHmacDrbg=P;exports.ensureBytes=M;exports.equalBytes=R;exports.hexToBytes=p;exports.hexToNumber=E;exports.inRange=S;exports.isBytes=b;exports.memoized=K;exports.notImplemented=J;exports.numberToBytesBE=U;exports.numberToBytesLE=F;exports.numberToHexUnpadded=x;exports.numberToVarBytesBE=V;exports.utf8ToBytes=j;exports.validateObject=W;