@gardenfi/swap 0.0.1 → 0.0.2

package/dist/index373.js

@@ -0,0 +1,143 @@
+import { readContract as g } from "./index105.js";
+import { EnsAvatarUriResolutionError as d, EnsAvatarInvalidNftUriError as f, EnsAvatarUnsupportedNamespaceError as v, EnsAvatarInvalidMetadataError as A } from "./index202.js";
+const b = /(?<protocol>https?:\/\/[^/]*|ipfs:\/|ipns:\/|ar:\/)?(?<root>\/)?(?<subpath>ipfs\/|ipns\/)?(?<target>[\w\-.]+)(?<subtarget>\/.*)?/, l = /^(Qm[1-9A-HJ-NP-Za-km-z]{44,}|b[A-Za-z2-7]{58,}|B[A-Z2-7]{58,}|z[1-9A-HJ-NP-Za-km-z]{48,}|F[0-9A-F]{50,})(\/(?<target>[\w\-.]+))?(?<subtarget>\/.*)?$/, E = /^data:([a-zA-Z\-/+]*);base64,([^"].*)/, C = /^data:([a-zA-Z\-/+]*)?(;[a-zA-Z0-9].*?)?(,)/;
+async function k(t) {
+  try {
+    const e = await fetch(t, { method: "HEAD" });
+    if (e.status === 200) {
+      const n = e.headers.get("content-type");
+      return n == null ? void 0 : n.startsWith("image/");
+    }
+    return !1;
+  } catch (e) {
+    return typeof e == "object" && typeof e.response < "u" || !Object.hasOwn(globalThis, "Image") ? !1 : new Promise((n) => {
+      const r = new Image();
+      r.onload = () => {
+        n(!0);
+      }, r.onerror = () => {
+        n(!1);
+      }, r.src = t;
+    });
+  }
+}
+function w(t, e) {
+  return t ? t.endsWith("/") ? t.slice(0, -1) : t : e;
+}
+function N({ uri: t, gatewayUrls: e }) {
+  const n = E.test(t);
+  if (n)
+    return { uri: t, isOnChain: !0, isEncoded: n };
+  const r = w(e == null ? void 0 : e.ipfs, "https://ipfs.io"), a = w(e == null ? void 0 : e.arweave, "https://arweave.net"), i = t.match(b), { protocol: o, subpath: p, target: s, subtarget: m = "" } = (i == null ? void 0 : i.groups) || {}, u = o === "ipns:/" || p === "ipns/", h = o === "ipfs:/" || p === "ipfs/" || l.test(t);
+  if (t.startsWith("http") && !u && !h) {
+    let I = t;
+    return e != null && e.arweave && (I = t.replace(/https:\/\/arweave.net/g, e == null ? void 0 : e.arweave)), { uri: I, isOnChain: !1, isEncoded: !1 };
+  }
+  if ((u || h) && s)
+    return {
+      uri: `${r}/${u ? "ipns" : "ipfs"}/${s}${m}`,
+      isOnChain: !1,
+      isEncoded: !1
+    };
+  if (o === "ar:/" && s)
+    return {
+      uri: `${a}/${s}${m || ""}`,
+      isOnChain: !1,
+      isEncoded: !1
+    };
+  let c = t.replace(C, "");
+  if (c.startsWith("<svg") && (c = `data:image/svg+xml;base64,${btoa(c)}`), c.startsWith("data:") || c.startsWith("{"))
+    return {
+      uri: c,
+      isOnChain: !0,
+      isEncoded: !1
+    };
+  throw new d({ uri: t });
+}
+function O(t) {
+  if (typeof t != "object" || !("image" in t) && !("image_url" in t) && !("image_data" in t))
+    throw new A({ data: t });
+  return t.image || t.image_url || t.image_data;
+}
+async function D({ gatewayUrls: t, uri: e }) {
+  try {
+    const n = await fetch(e).then((a) => a.json());
+    return await R({
+      gatewayUrls: t,
+      uri: O(n)
+    });
+  } catch {
+    throw new d({ uri: e });
+  }
+}
+async function R({ gatewayUrls: t, uri: e }) {
+  const { uri: n, isOnChain: r } = N({ uri: e, gatewayUrls: t });
+  if (r || await k(n))
+    return n;
+  throw new d({ uri: e });
+}
+function z(t) {
+  let e = t;
+  e.startsWith("did:nft:") && (e = e.replace("did:nft:", "").replace(/_/g, "/"));
+  const [n, r, a] = e.split("/"), [i, o] = n.split(":"), [p, s] = r.split(":");
+  if (!i || i.toLowerCase() !== "eip155")
+    throw new f({ reason: "Only EIP-155 supported" });
+  if (!o)
+    throw new f({ reason: "Chain ID not found" });
+  if (!s)
+    throw new f({
+      reason: "Contract address not found"
+    });
+  if (!a)
+    throw new f({ reason: "Token ID not found" });
+  if (!p)
+    throw new f({ reason: "ERC namespace not found" });
+  return {
+    chainID: Number.parseInt(o, 10),
+    namespace: p.toLowerCase(),
+    contractAddress: s,
+    tokenID: a
+  };
+}
+async function W(t, { nft: e }) {
+  if (e.namespace === "erc721")
+    return g(t, {
+      address: e.contractAddress,
+      abi: [
+        {
+          name: "tokenURI",
+          type: "function",
+          stateMutability: "view",
+          inputs: [{ name: "tokenId", type: "uint256" }],
+          outputs: [{ name: "", type: "string" }]
+        }
+      ],
+      functionName: "tokenURI",
+      args: [BigInt(e.tokenID)]
+    });
+  if (e.namespace === "erc1155")
+    return g(t, {
+      address: e.contractAddress,
+      abi: [
+        {
+          name: "uri",
+          type: "function",
+          stateMutability: "view",
+          inputs: [{ name: "_id", type: "uint256" }],
+          outputs: [{ name: "", type: "string" }]
+        }
+      ],
+      functionName: "uri",
+      args: [BigInt(e.tokenID)]
+    });
+  throw new v({ namespace: e.namespace });
+}
+export {
+  w as getGateway,
+  O as getJsonImage,
+  D as getMetadataAvatarUri,
+  W as getNftTokenUri,
+  k as isImageUri,
+  R as parseAvatarUri,
+  z as parseNftUri,
+  N as resolveAvatarUri
+};

package/dist/index374.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return`[${e.slice(2)}]`}exports.encodeLabelhash=t;

package/dist/index374.js

@@ -0,0 +1,6 @@
+function n(e) {
+  return `[${e.slice(2)}]`;
+}
+export {
+  n as encodeLabelhash
+};

package/dist/index375.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("./index278.cjs"),E=require("./index284.cjs"),m=require("./index277.cjs"),f=require("./index384.cjs"),A=require("./index297.cjs"),l=require("./index290.cjs");function q(r,e={}){const{prepare:i=!0}=e,n=Array.isArray(r)||typeof r=="string"?A.parseAbiItem(r):r;return{...n,...i?{hash:s(n)}:{}}}function g(r,e,i){const{args:n=[],prepare:o=!0}=i??{},w=m.validate(e,{strict:!1}),a=r.filter(t=>w?t.type==="function"||t.type==="error"?I(t)===m.slice(e,0,4):t.type==="event"?s(t)===e:!1:"name"in t&&t.name===e);if(a.length===0)throw new b({name:e});if(a.length===1)return{...a[0],...o?{hash:s(a[0])}:{}};let u;for(const t of a){if(!("inputs"in t))continue;if(!n||n.length===0){if(!t.inputs||t.inputs.length===0)return{...t,...o?{hash:s(t)}:{}};continue}if(!t.inputs||t.inputs.length===0||t.inputs.length!==n.length)continue;if(n.every((c,v)=>{const y="inputs"in t&&t.inputs[v];return y?f.isArgOfType(c,y):!1})){if(u&&"inputs"in u&&u.inputs){const c=f.getAmbiguousTypes(t.inputs,u.inputs,n);if(c)throw new $({abiItem:t,type:c[0]},{abiItem:u,type:c[1]})}u=t}}const h=(()=>{if(u)return u;const[t,...p]=a;return{...t,overloads:p}})();if(!h)throw new b({name:e});return{...h,...o?{hash:s(h)}:{}}}function I(...r){const e=(()=>{if(Array.isArray(r[0])){const[i,n]=r;return g(i,n)}return r[0]})();return m.slice(s(e),0,4)}function S(...r){const e=(()=>{if(Array.isArray(r[0])){const[n,o]=r;return g(n,o)}return r[0]})(),i=typeof e=="string"?e:l.formatAbiItem(e);return f.normalizeSignature(i)}function s(...r){const e=(()=>{if(Array.isArray(r[0])){const[i,n]=r;return g(i,n)}return r[0]})();return typeof e!="string"&&"hash"in e&&e.hash?e.hash:E.keccak256(m.fromString(S(e)))}class $ extends d.BaseError{constructor(e,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${e.type}\` in \`${f.normalizeSignature(l.formatAbiItem(e.abiItem))}\`, and`,`\`${i.type}\` in \`${f.normalizeSignature(l.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class b extends d.BaseError{constructor({name:e,data:i,type:n="item"}){const o=e?` with name "${e}"`:i?` with data "${i}"`:"";super(`ABI ${n}${o} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=$;exports.NotFoundError=b;exports.from=q;exports.fromAbi=g;exports.getSelector=I;exports.getSignature=S;exports.getSignatureHash=s;

package/dist/index375.js

@@ -0,0 +1,136 @@
+import { BaseError as d } from "./index278.js";
+import { keccak256 as v } from "./index284.js";
+import { validate as $, slice as A, fromString as S } from "./index277.js";
+import { isArgOfType as E, normalizeSignature as m, getAmbiguousTypes as B } from "./index384.js";
+import { parseAbiItem as y } from "./index297.js";
+import { formatAbiItem as p } from "./index290.js";
+function H(r, t = {}) {
+  const { prepare: i = !0 } = t, n = Array.isArray(r) ? y(r) : typeof r == "string" ? y(r) : r;
+  return {
+    ...n,
+    ...i ? { hash: f(n) } : {}
+  };
+}
+function h(r, t, i) {
+  const { args: n = [], prepare: u = !0 } = i ?? {}, w = $(t, { strict: !1 }), s = r.filter((e) => w ? e.type === "function" || e.type === "error" ? T(e) === A(t, 0, 4) : e.type === "event" ? f(e) === t : !1 : "name" in e && e.name === t);
+  if (s.length === 0)
+    throw new b({ name: t });
+  if (s.length === 1)
+    return {
+      ...s[0],
+      ...u ? { hash: f(s[0]) } : {}
+    };
+  let o;
+  for (const e of s) {
+    if (!("inputs" in e))
+      continue;
+    if (!n || n.length === 0) {
+      if (!e.inputs || e.inputs.length === 0)
+        return {
+          ...e,
+          ...u ? { hash: f(e) } : {}
+        };
+      continue;
+    }
+    if (!e.inputs || e.inputs.length === 0 || e.inputs.length !== n.length)
+      continue;
+    if (n.every((a, I) => {
+      const l = "inputs" in e && e.inputs[I];
+      return l ? E(a, l) : !1;
+    })) {
+      if (o && "inputs" in o && o.inputs) {
+        const a = B(e.inputs, o.inputs, n);
+        if (a)
+          throw new O({
+            abiItem: e,
+            type: a[0]
+          }, {
+            abiItem: o,
+            type: a[1]
+          });
+      }
+      o = e;
+    }
+  }
+  const c = (() => {
+    if (o)
+      return o;
+    const [e, ...g] = s;
+    return { ...e, overloads: g };
+  })();
+  if (!c)
+    throw new b({ name: t });
+  return {
+    ...c,
+    ...u ? { hash: f(c) } : {}
+  };
+}
+function T(...r) {
+  const t = (() => {
+    if (Array.isArray(r[0])) {
+      const [i, n] = r;
+      return h(i, n);
+    }
+    return r[0];
+  })();
+  return A(f(t), 0, 4);
+}
+function F(...r) {
+  const t = (() => {
+    if (Array.isArray(r[0])) {
+      const [n, u] = r;
+      return h(n, u);
+    }
+    return r[0];
+  })(), i = typeof t == "string" ? t : p(t);
+  return m(i);
+}
+function f(...r) {
+  const t = (() => {
+    if (Array.isArray(r[0])) {
+      const [i, n] = r;
+      return h(i, n);
+    }
+    return r[0];
+  })();
+  return typeof t != "string" && "hash" in t && t.hash ? t.hash : v(S(F(t)));
+}
+class O extends d {
+  constructor(t, i) {
+    super("Found ambiguous types in overloaded ABI Items.", {
+      metaMessages: [
+        // TODO: abitype to add support for signature-formatted ABI items.
+        `\`${t.type}\` in \`${m(p(t.abiItem))}\`, and`,
+        `\`${i.type}\` in \`${m(p(i.abiItem))}\``,
+        "",
+        "These types encode differently and cannot be distinguished at runtime.",
+        "Remove one of the ambiguous items in the ABI."
+      ]
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiItem.AmbiguityError"
+    });
+  }
+}
+class b extends d {
+  constructor({ name: t, data: i, type: n = "item" }) {
+    const u = t ? ` with name "${t}"` : i ? ` with data "${i}"` : "";
+    super(`ABI ${n}${u} not found.`), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "AbiItem.NotFoundError"
+    });
+  }
+}
+export {
+  O as AmbiguityError,
+  b as NotFoundError,
+  H as from,
+  h as fromAbi,
+  T as getSelector,
+  F as getSignature,
+  f as getSignatureHash
+};

package/dist/index376.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index345.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;

package/dist/index376.js

@@ -0,0 +1,81 @@
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index345.js";
+function y(o, t, s, n) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, n);
+  const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
+  o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
+}
+function U(o, t, s) {
+  return o & t ^ ~o & s;
+}
+function _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
+}
+class m extends g {
+  constructor(t, s, n, i) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
+  }
+  update(t) {
+    b(this), t = a(t), d(t);
+    const { view: s, buffer: n, blockLen: i } = this, h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(i - this.pos, h - e);
+      if (r === i) {
+        const c = l(t);
+        for (; i <= h - e; e += i)
+          this.process(c, e);
+        continue;
+      }
+      n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    b(this), x(t, this), this.finished = !0;
+    const { buffer: s, view: n, blockLen: i, isLE: h } = this;
+    let { pos: e } = this;
+    s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
+    for (let f = e; f < i; f++)
+      s[f] = 0;
+    y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
+    const r = l(t), c = this.outputLen;
+    if (c % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = c / 4, p = this.get();
+    if (u > p.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < u; f++)
+      r.setUint32(4 * f, p[f], h);
+  }
+  digest() {
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const n = t.slice(0, s);
+    return this.destroy(), n;
+  }
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
+    return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
+  }
+  clone() {
+    return this._cloneInto();
+  }
+}
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
+export {
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
+};

package/dist/index377.cjs

@@ -0,0 +1 @@
+"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/index377.js

@@ -0,0 +1,4 @@
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+export {
+  o as crypto
+};

package/dist/index378.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index345.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/index378.js

@@ -0,0 +1,45 @@
+import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index345.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();
+  }
+}
+const y = (n, t, i) => new r(n, t).update(i).digest();
+y.create = (n, t) => new r(n, t);
+export {
+  r as HMAC,
+  y as hmac
+};

package/dist/index379.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const et=require("./index380.cjs"),K=require("./index351.cjs"),a=require("./index359.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(y){y.lowS!==void 0&&a.abool("lowS",y.lowS),y.prehash!==void 0&&a.abool("prehash",y.prehash)}function ut(y){const r=et.validateBasic(y);a.validateObject(r,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:t,Fp:B,a:R}=r;if(t){if(!B.eql(R,B.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...r})}class ct extends Error{constructor(r=""){super(r)}}const U={Err:ct,_tlv:{encode:(y,r)=>{const{Err:t}=U;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length&1)throw new t("tlv.encode: unpadded data");const B=r.length/2,R=a.numberToHexUnpadded(B);if(R.length/2&128)throw new t("tlv.encode: long form length too big");const z=B>127?a.numberToHexUnpadded(R.length/2|128):"";return a.numberToHexUnpadded(y)+z+R+r},decode(y,r){const{Err:t}=U;let B=0;if(y<0||y>256)throw new t("tlv.encode: wrong tag");if(r.length<2||r[B++]!==y)throw new t("tlv.decode: wrong tlv");const R=r[B++],z=!!(R&128);let T=0;if(!z)T=R;else{const S=R&127;if(!S)throw new t("tlv.decode(long): indefinite length not supported");if(S>4)throw new t("tlv.decode(long): byte length is too big");const F=r.subarray(B,B+S);if(F.length!==S)throw new t("tlv.decode: length bytes not complete");if(F[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const A of F)T=T<<8|A;if(B+=S,T<128)throw new t("tlv.decode(long): not minimal encoding")}const Y=r.subarray(B,B+T);if(Y.length!==T)throw new t("tlv.decode: wrong value length");return{v:Y,l:r.subarray(B+T)}}},_int:{encode(y){const{Err:r}=U;if(y<I)throw new r("integer: negative integers are not allowed");let t=a.numberToHexUnpadded(y);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new r("unexpected DER parsing assertion: unpadded hex");return t},decode(y){const{Err:r}=U;if(y[0]&128)throw new r("invalid signature integer: negative");if(y[0]===0&&!(y[1]&128))throw new r("invalid signature integer: unnecessary leading zero");return a.bytesToNumberBE(y)}},toSig(y){const{Err:r,_int:t,_tlv:B}=U,R=a.ensureBytes("signature",y),{v:z,l:T}=B.decode(48,R);if(T.length)throw new r("invalid signature: left bytes after parsing");const{v:Y,l:S}=B.decode(2,z),{v:F,l:A}=B.decode(2,S);if(A.length)throw new r("invalid signature: left bytes after parsing");return{r:t.decode(Y),s:t.decode(F)}},hexFromSig(y){const{_tlv:r,_int:t}=U,B=r.encode(2,t.encode(y.r)),R=r.encode(2,t.encode(y.s)),z=B+R;return r.encode(48,z)}};function st(y,r){return a.bytesToHex(a.numberToBytesBE(y,r))}const I=BigInt(0),O=BigInt(1);BigInt(2);const it=BigInt(3),dt=BigInt(4);function lt(y){const r=ut(y),{Fp:t}=r,B=K.Field(r.n,r.nBitLength),R=r.toBytes||((w,e,s)=>{const c=e.toAffine();return a.concatBytes(Uint8Array.from([4]),t.toBytes(c.x),t.toBytes(c.y))}),z=r.fromBytes||(w=>{const e=w.subarray(1),s=t.fromBytes(e.subarray(0,t.BYTES)),c=t.fromBytes(e.subarray(t.BYTES,2*t.BYTES));return{x:s,y:c}});function T(w){const{a:e,b:s}=r,c=t.sqr(w),f=t.mul(c,w);return t.add(t.add(f,t.mul(w,e)),s)}function Y(w,e){const s=t.sqr(e),c=T(w);return t.eql(s,c)}if(!Y(r.Gx,r.Gy))throw new Error("bad curve params: generator point");const S=t.mul(t.pow(r.a,it),dt),F=t.mul(t.sqr(r.b),BigInt(27));if(t.is0(t.add(S,F)))throw new Error("bad curve params: a or b");function A(w){return a.inRange(w,O,r.n)}function D(w){const{allowedPrivateKeyLengths:e,nByteLength:s,wrapPrivateKey:c,n:f}=r;if(e&&typeof w!="bigint"){if(a.isBytes(w)&&(w=a.bytesToHex(w)),typeof w!="string"||!e.includes(w.length))throw new Error("invalid private key");w=w.padStart(s*2,"0")}let g;try{g=typeof w=="bigint"?w:a.bytesToNumberBE(a.ensureBytes("private key",w,s))}catch{throw new Error("invalid private key, expected hex or "+s+" bytes, got "+typeof w)}return c&&(g=K.mod(g,f)),a.aInRange("private key",g,O,f),g}function _(w){if(!(w instanceof E))throw new Error("ProjectivePoint expected")}const nt=a.memoized((w,e)=>{const{px:s,py:c,pz:f}=w;if(t.eql(f,t.ONE))return{x:s,y:c};const g=w.is0();e==null&&(e=g?t.ONE:t.inv(f));const v=t.mul(s,e),b=t.mul(c,e),l=t.mul(f,e);if(g)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:v,y:b}}),G=a.memoized(w=>{if(w.is0()){if(r.allowInfinityPoint&&!t.is0(w.py))return;throw new Error("bad point: ZERO")}const{x:e,y:s}=w.toAffine();if(!t.isValid(e)||!t.isValid(s))throw new Error("bad point: x or y not FE");if(!Y(e,s))throw new Error("bad point: equation left != right");if(!w.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});class E{constructor(e,s,c){if(e==null||!t.isValid(e))throw new Error("x required");if(s==null||!t.isValid(s)||t.is0(s))throw new Error("y required");if(c==null||!t.isValid(c))throw new Error("z required");this.px=e,this.py=s,this.pz=c,Object.freeze(this)}static fromAffine(e){const{x:s,y:c}=e||{};if(!e||!t.isValid(s)||!t.isValid(c))throw new Error("invalid affine point");if(e instanceof E)throw new Error("projective point not allowed");const f=g=>t.eql(g,t.ZERO);return f(s)&&f(c)?E.ZERO:new E(s,c,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(e){const s=K.FpInvertBatch(t,e.map(c=>c.pz));return e.map((c,f)=>c.toAffine(s[f])).map(E.fromAffine)}static fromHex(e){const s=E.fromAffine(z(a.ensureBytes("pointHex",e)));return s.assertValidity(),s}static fromPrivateKey(e){return E.BASE.multiply(D(e))}static msm(e,s){return et.pippenger(E,B,e,s)}_setWindowSize(e){C.setWindowSize(this,e)}assertValidity(){G(this)}hasEvenY(){const{y:e}=this.toAffine();if(t.isOdd)return!t.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e,l=t.eql(t.mul(s,b),t.mul(g,f)),p=t.eql(t.mul(c,b),t.mul(v,f));return l&&p}negate(){return new E(this.px,t.neg(this.py),this.pz)}double(){const{a:e,b:s}=r,c=t.mul(s,it),{px:f,py:g,pz:v}=this;let b=t.ZERO,l=t.ZERO,p=t.ZERO,u=t.mul(f,f),N=t.mul(g,g),o=t.mul(v,v),n=t.mul(f,g);return n=t.add(n,n),p=t.mul(f,v),p=t.add(p,p),b=t.mul(e,p),l=t.mul(c,o),l=t.add(b,l),b=t.sub(N,l),l=t.add(N,l),l=t.mul(b,l),b=t.mul(n,b),p=t.mul(c,p),o=t.mul(e,o),n=t.sub(u,o),n=t.mul(e,n),n=t.add(n,p),p=t.add(u,u),u=t.add(p,u),u=t.add(u,o),u=t.mul(u,n),l=t.add(l,u),o=t.mul(g,v),o=t.add(o,o),u=t.mul(o,n),b=t.sub(b,u),p=t.mul(o,N),p=t.add(p,p),p=t.add(p,p),new E(b,l,p)}add(e){_(e);const{px:s,py:c,pz:f}=this,{px:g,py:v,pz:b}=e;let l=t.ZERO,p=t.ZERO,u=t.ZERO;const N=r.a,o=t.mul(r.b,it);let n=t.mul(s,g),i=t.mul(c,v),m=t.mul(f,b),d=t.add(s,c),h=t.add(g,v);d=t.mul(d,h),h=t.add(n,i),d=t.sub(d,h),h=t.add(s,f);let x=t.add(g,b);return h=t.mul(h,x),x=t.add(n,m),h=t.sub(h,x),x=t.add(c,f),l=t.add(v,b),x=t.mul(x,l),l=t.add(i,m),x=t.sub(x,l),u=t.mul(N,h),l=t.mul(o,m),u=t.add(l,u),l=t.sub(i,u),u=t.add(i,u),p=t.mul(l,u),i=t.add(n,n),i=t.add(i,n),m=t.mul(N,m),h=t.mul(o,h),i=t.add(i,m),m=t.sub(n,m),m=t.mul(N,m),h=t.add(h,m),n=t.mul(i,h),p=t.add(p,n),n=t.mul(x,h),l=t.mul(d,l),l=t.sub(l,n),n=t.mul(d,i),u=t.mul(x,u),u=t.add(u,n),new E(l,p,u)}subtract(e){return this.add(e.negate())}is0(){return this.equals(E.ZERO)}wNAF(e){return C.wNAFCached(this,e,E.normalizeZ)}multiplyUnsafe(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,I,c);const f=E.ZERO;if(e===I)return f;if(this.is0()||e===O)return this;if(!s||C.hasPrecomputes(this))return C.wNAFCachedUnsafe(this,e,E.normalizeZ);let{k1neg:g,k1:v,k2neg:b,k2:l}=s.splitScalar(e),p=f,u=f,N=this;for(;v>I||l>I;)v&O&&(p=p.add(N)),l&O&&(u=u.add(N)),N=N.double(),v>>=O,l>>=O;return g&&(p=p.negate()),b&&(u=u.negate()),u=new E(t.mul(u.px,s.beta),u.py,u.pz),p.add(u)}multiply(e){const{endo:s,n:c}=r;a.aInRange("scalar",e,O,c);let f,g;if(s){const{k1neg:v,k1:b,k2neg:l,k2:p}=s.splitScalar(e);let{p:u,f:N}=this.wNAF(b),{p:o,f:n}=this.wNAF(p);u=C.constTimeNegate(v,u),o=C.constTimeNegate(l,o),o=new E(t.mul(o.px,s.beta),o.py,o.pz),f=u.add(o),g=N.add(n)}else{const{p:v,f:b}=this.wNAF(e);f=v,g=b}return E.normalizeZ([f,g])[0]}multiplyAndAddUnsafe(e,s,c){const f=E.BASE,g=(b,l)=>l===I||l===O||!b.equals(f)?b.multiplyUnsafe(l):b.multiply(l),v=g(this,s).add(g(e,c));return v.is0()?void 0:v}toAffine(e){return nt(this,e)}isTorsionFree(){const{h:e,isTorsionFree:s}=r;if(e===O)return!0;if(s)return s(E,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:s}=r;return e===O?this:s?s(E,this):this.multiplyUnsafe(r.h)}toRawBytes(e=!0){return a.abool("isCompressed",e),this.assertValidity(),R(E,this,e)}toHex(e=!0){return a.abool("isCompressed",e),a.bytesToHex(this.toRawBytes(e))}}E.BASE=new E(r.Gx,r.Gy,t.ONE),E.ZERO=new E(t.ZERO,t.ONE,t.ZERO);const{endo:tt,nBitLength:H}=r,C=et.wNAF(E,tt?Math.ceil(H/2):H);return{CURVE:r,ProjectivePoint:E,normPrivateKeyToScalar:D,weierstrassEquation:T,isWithinCurveOrder:A}}function ft(y){const r=et.validateBasic(y);return a.validateObject(r,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...r})}function ht(y){const r=ft(y),{Fp:t,n:B,nByteLength:R,nBitLength:z}=r,T=t.BYTES+1,Y=2*t.BYTES+1;function S(o){return K.mod(o,B)}function F(o){return K.invert(o,B)}const{ProjectivePoint:A,normPrivateKeyToScalar:D,weierstrassEquation:_,isWithinCurveOrder:nt}=lt({...r,toBytes(o,n,i){const m=n.toAffine(),d=t.toBytes(m.x),h=a.concatBytes;return a.abool("isCompressed",i),i?h(Uint8Array.from([n.hasEvenY()?2:3]),d):h(Uint8Array.from([4]),d,t.toBytes(m.y))},fromBytes(o){const n=o.length,i=o[0],m=o.subarray(1);if(n===T&&(i===2||i===3)){const d=a.bytesToNumberBE(m);if(!a.inRange(d,O,t.ORDER))throw new Error("Point is not on curve");const h=_(d);let x;try{x=t.sqrt(h)}catch(L){const q=L instanceof Error?": "+L.message:"";throw new Error("Point is not on curve"+q)}const Z=(x&O)===O;return(i&1)===1!==Z&&(x=t.neg(x)),{x:d,y:x}}else if(n===Y&&i===4){const d=t.fromBytes(m.subarray(0,t.BYTES)),h=t.fromBytes(m.subarray(t.BYTES,2*t.BYTES));return{x:d,y:h}}else{const d=T,h=Y;throw new Error("invalid Point, expected length of "+d+", or uncompressed "+h+", got "+n)}}});function G(o){const n=B>>O;return o>n}function E(o){return G(o)?S(-o):o}const tt=(o,n,i)=>a.bytesToNumberBE(o.slice(n,i));class H{constructor(n,i,m){a.aInRange("r",n,O,B),a.aInRange("s",i,O,B),this.r=n,this.s=i,m!=null&&(this.recovery=m),Object.freeze(this)}static fromCompact(n){const i=R;return n=a.ensureBytes("compactSignature",n,i*2),new H(tt(n,0,i),tt(n,i,2*i))}static fromDER(n){const{r:i,s:m}=U.toSig(a.ensureBytes("DER",n));return new H(i,m)}assertValidity(){}addRecoveryBit(n){return new H(this.r,this.s,n)}recoverPublicKey(n){const{r:i,s:m,recovery:d}=this,h=f(a.ensureBytes("msgHash",n));if(d==null||![0,1,2,3].includes(d))throw new Error("recovery id invalid");const x=d===2||d===3?i+r.n:i;if(x>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const Z=d&1?"03":"02",V=A.fromHex(Z+st(x,t.BYTES)),L=F(x),q=S(-h*L),X=S(m*L),j=A.BASE.multiplyAndAddUnsafe(V,q,X);if(!j)throw new Error("point at infinify");return j.assertValidity(),j}hasHighS(){return G(this.s)}normalizeS(){return this.hasHighS()?new H(this.r,S(-this.s),this.recovery):this}toDERRawBytes(){return a.hexToBytes(this.toDERHex())}toDERHex(){return U.hexFromSig(this)}toCompactRawBytes(){return a.hexToBytes(this.toCompactHex())}toCompactHex(){const n=R;return st(this.r,n)+st(this.s,n)}}const C={isValidPrivateKey(o){try{return D(o),!0}catch{return!1}},normPrivateKeyToScalar:D,randomPrivateKey:()=>{const o=K.getMinHashLength(r.n);return K.mapHashToField(r.randomBytes(o),r.n)},precompute(o=8,n=A.BASE){return n._setWindowSize(o),n.multiply(BigInt(3)),n}};function w(o,n=!0){return A.fromPrivateKey(o).toRawBytes(n)}function e(o){if(typeof o=="bigint")return!1;if(o instanceof A)return!0;const i=a.ensureBytes("key",o).length,m=t.BYTES,d=m+1,h=2*m+1;if(!(r.allowedPrivateKeyLengths||R===d))return i===d||i===h}function s(o,n,i=!0){if(e(o)===!0)throw new Error("first arg must be private key");if(e(n)===!1)throw new Error("second arg must be public key");return A.fromHex(n).multiply(D(o)).toRawBytes(i)}const c=r.bits2int||function(o){if(o.length>8192)throw new Error("input is too large");const n=a.bytesToNumberBE(o),i=o.length*8-z;return i>0?n>>BigInt(i):n},f=r.bits2int_modN||function(o){return S(c(o))},g=a.bitMask(z);function v(o){return a.aInRange("num < 2^"+z,o,I,g),a.numberToBytesBE(o,R)}function b(o,n,i=l){if(["recovered","canonical"].some(P=>P in i))throw new Error("sign() legacy options not supported");const{hash:m,randomBytes:d}=r;let{lowS:h,prehash:x,extraEntropy:Z}=i;h==null&&(h=!0),o=a.ensureBytes("msgHash",o),at(i),x&&(o=a.ensureBytes("prehashed msgHash",m(o)));const V=f(o),L=D(n),q=[v(L),v(V)];if(Z!=null&&Z!==!1){const P=Z===!0?d(t.BYTES):Z;q.push(a.ensureBytes("extraEntropy",P))}const X=a.concatBytes(...q),j=V;function rt(P){const M=c(P);if(!nt(M))return;const ot=F(M),Q=A.BASE.multiply(M).toAffine(),k=S(Q.x);if(k===I)return;const $=S(ot*S(j+k*L));if($===I)return;let J=(Q.x===k?0:2)|Number(Q.y&O),W=$;return h&&G($)&&(W=E($),J^=1),new H(k,W,J)}return{seed:X,k2sig:rt}}const l={lowS:r.lowS,prehash:!1},p={lowS:r.lowS,prehash:!1};function u(o,n,i=l){const{seed:m,k2sig:d}=b(o,n,i),h=r;return a.createHmacDrbg(h.hash.outputLen,h.nByteLength,h.hmac)(m,d)}A.BASE._setWindowSize(8);function N(o,n,i,m=p){var J;const d=o;n=a.ensureBytes("msgHash",n),i=a.ensureBytes("publicKey",i);const{lowS:h,prehash:x,format:Z}=m;if(at(m),"strict"in m)throw new Error("options.strict was renamed to lowS");if(Z!==void 0&&Z!=="compact"&&Z!=="der")throw new Error("format must be compact or der");const V=typeof d=="string"||a.isBytes(d),L=!V&&!Z&&typeof d=="object"&&d!==null&&typeof d.r=="bigint"&&typeof d.s=="bigint";if(!V&&!L)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let q,X;try{if(L&&(q=new H(d.r,d.s)),V){try{Z!=="compact"&&(q=H.fromDER(d))}catch(W){if(!(W instanceof U.Err))throw W}!q&&Z!=="der"&&(q=H.fromCompact(d))}X=A.fromHex(i)}catch{return!1}if(!q||h&&q.hasHighS())return!1;x&&(n=r.hash(n));const{r:j,s:rt}=q,P=f(n),M=F(rt),ot=S(P*M),Q=S(j*M),k=(J=A.BASE.multiplyAndAddUnsafe(X,ot,Q))==null?void 0:J.toAffine();return k?S(k.x)===j:!1}return{CURVE:r,getPublicKey:w,getSharedSecret:s,sign:u,verify:N,ProjectivePoint:A,Signature:H,utils:C}}exports.DER=U;exports.DERErr=ct;exports.weierstrass=ht;exports.weierstrassPoints=lt;