@gardenfi/utils 2.1.3-beta.9 → 2.2.0-beta.1

package/dist/index279.js

@@ -1,217 +1,14 @@
-import { anumber as C } from "./index284.js";
-import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index298.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);
+import { LruMap as u } from "./index223.js";
+const t = /* @__PURE__ */ new u(8192);
+function s(r, { enabled: o = !0, id: e }) {
+  if (!o || !e)
+    return r();
+  if (t.get(e))
+    return t.get(e);
+  const n = r().finally(() => t.delete(e));
+  return t.set(e, n), n;
 }
 export {
-  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
+  t as promiseCache,
+  s as withDedupe
 };

package/dist/index28.cjs

@@ -1 +1,16 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index44.cjs"),n=require("./index52.cjs");function l(e){const{key:t="public",name:i="Public Client"}=e;return c.createClient({...e,key:t,name:i,type:"publicClient"}).extend(n.publicActions)}exports.createPublicClient=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index294.cjs"),M=require("./index162.cjs"),h=require("./index295.cjs");function R(r){const{chainId:o,domain:s,expirationTime:l,issuedAt:m=new Date,nonce:a,notBefore:f,requestId:w,resources:g,scheme:i,uri:c,version:d}=r;{if(o!==Math.floor(o))throw new e.SiweInvalidMessageFieldError({field:"chainId",metaMessages:["- Chain ID must be a EIP-155 chain ID.","- See https://eips.ethereum.org/EIPS/eip-155","",`Provided value: ${o}`]});if(!(E.test(s)||F.test(s)||b.test(s)))throw new e.SiweInvalidMessageFieldError({field:"domain",metaMessages:["- Domain must be an RFC 3986 authority.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${s}`]});if(!A.test(a))throw new e.SiweInvalidMessageFieldError({field:"nonce",metaMessages:["- Nonce must be at least 8 characters.","- Nonce must be alphanumeric.","",`Provided value: ${a}`]});if(!h.isUri(c))throw new e.SiweInvalidMessageFieldError({field:"uri",metaMessages:["- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${c}`]});if(d!=="1")throw new e.SiweInvalidMessageFieldError({field:"version",metaMessages:["- Version must be '1'.","",`Provided value: ${d}`]});if(i&&!P.test(i))throw new e.SiweInvalidMessageFieldError({field:"scheme",metaMessages:["- Scheme must be an RFC 3986 URI scheme.","- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1","",`Provided value: ${i}`]});const t=r.statement;if(t!=null&&t.includes(`
+`))throw new e.SiweInvalidMessageFieldError({field:"statement",metaMessages:["- Statement must not include '\\n'.","",`Provided value: ${t}`]})}const $=M.getAddress(r.address),v=i?`${i}://${s}`:s,I=r.statement?`${r.statement}
+`:"",S=`${v} wants you to sign in with your Ethereum account:
+${$}
+
+${I}`;let n=`URI: ${c}
+Version: ${d}
+Chain ID: ${o}
+Nonce: ${a}
+Issued At: ${m.toISOString()}`;if(l&&(n+=`
+Expiration Time: ${l.toISOString()}`),f&&(n+=`
+Not Before: ${f.toISOString()}`),w&&(n+=`
+Request ID: ${w}`),g){let t=`
+Resources:`;for(const u of g){if(!h.isUri(u))throw new e.SiweInvalidMessageFieldError({field:"resources",metaMessages:["- Every resource must be a RFC 3986 URI.","- See https://www.rfc-editor.org/rfc/rfc3986","",`Provided value: ${u}`]});t+=`
+- ${u}`}n+=t}return`${S}
+${n}`}const E=/^([a-zA-Z0-9]([a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/,F=/^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/,b=/^localhost(:[0-9]{1,5})?$/,A=/^[a-zA-Z0-9]{8,}$/,P=/^([a-zA-Z][a-zA-Z0-9+-.]*)$/;exports.createSiweMessage=R;

package/dist/index28.js

@@ -1,14 +1,116 @@
-import { createClient as n } from "./index44.js";
-import { publicActions as c } from "./index52.js";
-function u(t) {
-  const { key: e = "public", name: i = "Public Client" } = t;
-  return n({
-    ...t,
-    key: e,
-    name: i,
-    type: "publicClient"
-  }).extend(c);
+import { SiweInvalidMessageFieldError as e } from "./index294.js";
+import { getAddress as S } from "./index162.js";
+import { isUri as $ } from "./index295.js";
+function C(n) {
+  const { chainId: i, domain: s, expirationTime: u, issuedAt: g = /* @__PURE__ */ new Date(), nonce: a, notBefore: m, requestId: h, resources: w, scheme: o, uri: c, version: f } = n;
+  {
+    if (i !== Math.floor(i))
+      throw new e({
+        field: "chainId",
+        metaMessages: [
+          "- Chain ID must be a EIP-155 chain ID.",
+          "- See https://eips.ethereum.org/EIPS/eip-155",
+          "",
+          `Provided value: ${i}`
+        ]
+      });
+    if (!(p.test(s) || M.test(s) || x.test(s)))
+      throw new e({
+        field: "domain",
+        metaMessages: [
+          "- Domain must be an RFC 3986 authority.",
+          "- See https://www.rfc-editor.org/rfc/rfc3986",
+          "",
+          `Provided value: ${s}`
+        ]
+      });
+    if (!A.test(a))
+      throw new e({
+        field: "nonce",
+        metaMessages: [
+          "- Nonce must be at least 8 characters.",
+          "- Nonce must be alphanumeric.",
+          "",
+          `Provided value: ${a}`
+        ]
+      });
+    if (!$(c))
+      throw new e({
+        field: "uri",
+        metaMessages: [
+          "- URI must be a RFC 3986 URI referring to the resource that is the subject of the signing.",
+          "- See https://www.rfc-editor.org/rfc/rfc3986",
+          "",
+          `Provided value: ${c}`
+        ]
+      });
+    if (f !== "1")
+      throw new e({
+        field: "version",
+        metaMessages: [
+          "- Version must be '1'.",
+          "",
+          `Provided value: ${f}`
+        ]
+      });
+    if (o && !P.test(o))
+      throw new e({
+        field: "scheme",
+        metaMessages: [
+          "- Scheme must be an RFC 3986 URI scheme.",
+          "- See https://www.rfc-editor.org/rfc/rfc3986#section-3.1",
+          "",
+          `Provided value: ${o}`
+        ]
+      });
+    const t = n.statement;
+    if (t != null && t.includes(`
+`))
+      throw new e({
+        field: "statement",
+        metaMessages: [
+          "- Statement must not include '\\n'.",
+          "",
+          `Provided value: ${t}`
+        ]
+      });
+  }
+  const l = S(n.address), v = o ? `${o}://${s}` : s, I = n.statement ? `${n.statement}
+` : "", R = `${v} wants you to sign in with your Ethereum account:
+${l}
+
+${I}`;
+  let r = `URI: ${c}
+Version: ${f}
+Chain ID: ${i}
+Nonce: ${a}
+Issued At: ${g.toISOString()}`;
+  if (u && (r += `
+Expiration Time: ${u.toISOString()}`), m && (r += `
+Not Before: ${m.toISOString()}`), h && (r += `
+Request ID: ${h}`), w) {
+    let t = `
+Resources:`;
+    for (const d of w) {
+      if (!$(d))
+        throw new e({
+          field: "resources",
+          metaMessages: [
+            "- Every resource must be a RFC 3986 URI.",
+            "- See https://www.rfc-editor.org/rfc/rfc3986",
+            "",
+            `Provided value: ${d}`
+          ]
+        });
+      t += `
+- ${d}`;
+    }
+    r += t;
+  }
+  return `${R}
+${r}`;
 }
+const p = /^([a-zA-Z0-9]([a-zA-Z0-9\-]{0,61}[a-zA-Z0-9])?\.)+[a-zA-Z]{2,}(:[0-9]{1,5})?$/, M = /^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)(:[0-9]{1,5})?$/, x = /^localhost(:[0-9]{1,5})?$/, A = /^[a-zA-Z0-9]{8,}$/, P = /^([a-zA-Z][a-zA-Z0-9+-.]*)$/;
 export {
-  u as createPublicClient
+  C as createSiweMessage
 };

package/dist/index280.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index149.cjs"),r=require("./index151.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index152.cjs"),r=require("./index154.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index280.js

@@ -1,5 +1,5 @@
-import { toBytes as o } from "./index149.js";
-import { keccak256 as r } from "./index151.js";
+import { toBytes as o } from "./index152.js";
+import { keccak256 as r } from "./index154.js";
 const e = (t) => r(o(t));
 function c(t) {
   return e(t);

package/dist/index281.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index282.cjs"),n=require("./index260.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index282.cjs"),n=require("./index263.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index281.js

@@ -1,5 +1,5 @@
 import { normalizeSignature as o } from "./index282.js";
-import { formatAbiItem as n } from "./index260.js";
+import { formatAbiItem as n } from "./index263.js";
 const m = (r) => {
   const t = typeof r == "string" ? r : n(r);
   return o(t);

package/dist/index282.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index38.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index41.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;

package/dist/index282.js

@@ -1,4 +1,4 @@
-import { BaseError as u } from "./index38.js";
+import { BaseError as u } from "./index41.js";
 function a(r) {
   let l = !0, i = "", f = 0, t = "", o = !1;
   for (let n = 0; n < r.length; n++) {

package/dist/index284.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index293.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index299.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function s(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function c(t,...e){if(!p(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 m(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");s(t.outputLen),s(t.blockLen)}function B(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 E(t,e){c(t);const n=e.outputLen;if(t.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}function H(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function U(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function L(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function S(t,e){return t<<32-e|t>>>e}const h=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function w(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function g(t){for(let e=0;e<t.length;e++)t[e]=w(t[e]);return t}const T=h?t=>t:g,d=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",V=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function _(t){if(c(t),d)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=V[t[n]];return e}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function l(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 I(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(d)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let o=0,i=0;o<n;o++,i+=2){const a=l(t.charCodeAt(i)),y=l(t.charCodeAt(i+1));if(a===void 0||y===void 0){const A=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+A+'" at index '+i)}r[o]=a*16+y}return r}function x(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function b(t){return typeof t=="string"&&(t=x(t)),c(t),t}function k(...t){let e=0;for(let r=0;r<t.length;r++){const o=t[r];c(o),e+=o.length}const n=new Uint8Array(e);for(let r=0,o=0;r<t.length;r++){const i=t[r];n.set(i,o),o+=i.length}return n}class O{}function R(t){const e=r=>t().update(b(r)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}function v(t=32){if(u.crypto&&typeof u.crypto.getRandomValues=="function")return u.crypto.getRandomValues(new Uint8Array(t));if(u.crypto&&typeof u.crypto.randomBytes=="function")return Uint8Array.from(u.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=O;exports.abytes=c;exports.aexists=B;exports.ahash=m;exports.anumber=s;exports.aoutput=E;exports.byteSwap=w;exports.byteSwap32=g;exports.bytesToHex=_;exports.clean=U;exports.concatBytes=k;exports.createHasher=R;exports.createView=L;exports.hexToBytes=I;exports.isBytes=p;exports.isLE=h;exports.randomBytes=v;exports.rotr=S;exports.swap32IfBE=T;exports.toBytes=b;exports.u32=H;exports.utf8ToBytes=x;