@covia/covia-sdk 1.21.0 → 1.22.0

package/dist/index.mjs

@@ -137,134 +137,127 @@ var AgentSessionNotFoundError = class extends CoviaError {
   }
 };
 
-// node_modules/.pnpm/@noble+ed25519@3.1.0/node_modules/@noble/ed25519/index.js
-var ed25519_CURVE = Object.freeze({
-  p: 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffedn,
-  n: 0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3edn,
+// node_modules/.pnpm/@noble+ed25519@3.2.0/node_modules/@noble/ed25519/index.js
+var freeze = Object.freeze;
+var P = 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffedn;
+var N = 0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3edn;
+var _d = 0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3n;
+var Gx = 0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51an;
+var Gy = 0x6666666666666666666666666666666666666666666666666666666666666658n;
+var _a = P - 1n;
+var ed25519_CURVE = freeze({
+  p: P,
+  n: N,
   h: 8n,
-  a: 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffecn,
-  d: 0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3n,
-  Gx: 0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51an,
-  Gy: 0x6666666666666666666666666666666666666666666666666666666666666658n
+  a: _a,
+  d: _d,
+  Gx,
+  Gy
 });
-var { p: P, n: N, Gx, Gy, a: _a, d: _d, h } = ed25519_CURVE;
-var L = 32;
-var captureTrace = (...args) => {
-  if ("captureStackTrace" in Error && typeof Error.captureStackTrace === "function") {
-    Error.captureStackTrace(...args);
-  }
-};
-var err = (message = "") => {
-  const e = new Error(message);
-  captureTrace(e, err);
-  throw e;
+var LEN = 32;
+var isBytes = (a) => {
+  return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array" && a.BYTES_PER_ELEMENT === 1;
 };
-var isBig = (n) => typeof n === "bigint";
-var isStr = (s) => typeof s === "string";
-var isBytes = (a) => a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in a && a.BYTES_PER_ELEMENT === 1;
 var abytes = (value, length, title = "") => {
+  if (isBytes(value) && (length === void 0 || value.length === length))
+    return value;
   const bytes2 = isBytes(value);
-  const len = value?.length;
-  const needsLen = length !== void 0;
-  if (!bytes2 || needsLen && len !== length) {
-    const prefix = title && `"${title}" `;
-    const ofLen = needsLen ? ` of length ${length}` : "";
-    const got = bytes2 ? `length=${len}` : `type=${typeof value}`;
-    const msg = prefix + "expected Uint8Array" + ofLen + ", got " + got;
-    throw bytes2 ? new RangeError(msg) : new TypeError(msg);
-  }
-  return value;
+  const ofLen = length !== void 0 ? ` of length ${length}` : "";
+  const got = bytes2 ? `length=${value.length}` : `type=${typeof value}`;
+  const message = (title ? `"${title}" ` : "") + "expected Uint8Array" + ofLen + ", got " + got;
+  if (!bytes2)
+    throw new TypeError(message);
+  throw new RangeError(message);
 };
-var u8n = (len) => new Uint8Array(len);
-var u8fr = (buf) => Uint8Array.from(buf);
+var snapshotBytes = (value, title = "", length) => Uint8Array.from(abytes(value, length, title));
 var padh = (n, pad) => n.toString(16).padStart(pad, "0");
-var bytesToHex = (b) => Array.from(abytes(b)).map((e) => padh(e, 2)).join("");
-var C = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-var _ch = (ch) => {
-  if (ch >= C._0 && ch <= C._9)
-    return ch - C._0;
-  if (ch >= C.A && ch <= C.F)
-    return ch - (C.A - 10);
-  if (ch >= C.a && ch <= C.f)
-    return ch - (C.a - 10);
-  return;
+var bytesToHex = (bytes2) => {
+  let hex = "";
+  for (const byte of abytes(bytes2))
+    hex += padh(byte, 2);
+  return hex;
 };
 var hexToBytes = (hex) => {
   const e = "hex invalid";
-  if (!isStr(hex))
-    return err(e);
-  const hl = hex.length;
-  const al = hl / 2;
-  if (hl % 2)
-    return err(e);
-  const array = u8n(al);
-  for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {
-    const n1 = _ch(hex.charCodeAt(hi));
-    const n2 = _ch(hex.charCodeAt(hi + 1));
-    if (n1 === void 0 || n2 === void 0)
-      return err(e);
-    array[ai] = n1 * 16 + n2;
+  if (typeof hex !== "string")
+    throw new TypeError(e);
+  if (hex.length % 2 || !/^[\da-f]*$/i.test(hex))
+    throw new RangeError(e);
+  const array = new Uint8Array(hex.length / 2);
+  for (let ai = 0, hi = 0; ai < array.length; ai++, hi += 2) {
+    const n1 = hex.charCodeAt(hi);
+    const n2 = hex.charCodeAt(hi + 1);
+    array[ai] = ((n1 & 15) + (n1 >> 6) * 9) * 16 + (n2 & 15) + (n2 >> 6) * 9;
   }
   return array;
 };
-var cr = () => globalThis?.crypto;
-var subtle = () => cr()?.subtle ?? err("crypto.subtle must be defined, consider polyfill");
-var concatBytes = (...arrs) => {
-  let len = 0;
-  for (const a of arrs)
-    len += abytes(a).length;
-  const r = u8n(len);
+var concatBytes = (...arrays) => {
+  let sum = 0;
+  for (const a of arrays)
+    sum += abytes(a).length;
+  const res = new Uint8Array(sum);
   let pad = 0;
-  arrs.forEach((a) => {
-    r.set(a, pad);
+  for (const a of arrays) {
+    res.set(a, pad);
     pad += a.length;
-  });
-  return r;
+  }
+  return res;
 };
-var randomBytes = (len = L) => {
-  const c = cr();
-  return c.getRandomValues(u8n(len));
+var randomBytes = (len = LEN) => {
+  const c = globalThis?.crypto;
+  if (typeof c?.getRandomValues !== "function")
+    throw new Error("crypto.getRandomValues must be defined, consider polyfill");
+  return c.getRandomValues(new Uint8Array(len));
 };
-var big = BigInt;
-var assertRange = (n, min, max, msg = "bad number: out of range") => {
-  if (!isBig(n))
+var arange = (n, min, max, msg = "bad number: out of range") => {
+  if (typeof n !== "bigint")
     throw new TypeError(msg);
   if (min <= n && n < max)
     return n;
   throw new RangeError(msg);
 };
-var M = (a, b = P) => {
-  const r = a % b;
-  return r >= 0n ? r : b + r;
-};
+var mod = (a, b = P) => (a %= b) >= 0n ? a : b + a;
 var P_MASK = (1n << 255n) - 1n;
 var modP = (num) => {
   if (num < 0n)
-    err("negative coordinate");
+    throw new RangeError("negative coordinate");
   let r = (num >> 255n) * 19n + (num & P_MASK);
   r = (r >> 255n) * 19n + (r & P_MASK);
   return r % P;
 };
-var modN = (a) => M(a, N);
-var invert = (num, md) => {
-  if (num === 0n || md <= 0n)
-    err("no inverse n=" + num + " mod=" + md);
-  let a = M(num, md), b = md, x = 0n, u = 1n;
+var modN = (a) => mod(a, N);
+var invert = (number, modulo) => {
+  if (number === 0n)
+    throw new Error("invert: expected non-zero number");
+  if (modulo <= 1n)
+    throw new Error("invert: expected modulus > 1, got " + modulo);
+  let a = mod(number, modulo);
+  let b = modulo;
+  let x = 0n, u = 1n;
   while (a !== 0n) {
-    const q = b / a, r = b % a;
+    const q = b / a;
+    const r = b - a * q;
     const m = x - u * q;
     b = a, a = r, x = u, u = m;
   }
-  return b === 1n ? M(x, md) : err("no inverse");
+  const gcd = b;
+  if (gcd !== 1n)
+    throw new Error("invert: does not exist");
+  return mod(x, modulo);
 };
-var callHash = (name) => {
+var _hash = (name) => {
   const fn = hashes[name];
   if (typeof fn !== "function")
-    err("hashes." + name + " not set");
+    throw new Error("hashes." + name + " not set");
   return fn;
 };
-var checkDigest = (value) => abytes(value, 64, "digest");
-var apoint = (p) => p instanceof Point ? p : err("Point expected");
+var callHash = (name, ...m) => abytes(_hash(name)(concatBytes(...m)), 64, "digest");
+var callHashAsync = async (name, ...m) => abytes(await _hash(name)(concatBytes(...m)), 64, "digest");
+var apoint = (p) => {
+  if (p instanceof Point)
+    return p;
+  throw new TypeError("Point expected");
+};
 var B256 = 2n ** 256n;
 var _Point = class _Point {
   // Constructor only bounds-checks and freezes XYZT coordinates; it does not prove the point is
@@ -275,11 +268,11 @@ var _Point = class _Point {
     __publicField(this, "Z");
     __publicField(this, "T");
     const max = B256;
-    this.X = assertRange(X, 0n, max);
-    this.Y = assertRange(Y, 0n, max);
-    this.Z = assertRange(Z, 1n, max);
-    this.T = assertRange(T, 0n, max);
-    Object.freeze(this);
+    this.X = arange(X, 0n, max);
+    this.Y = arange(Y, 0n, max);
+    this.Z = arange(Z, 1n, max);
+    this.T = arange(T, 0n, max);
+    freeze(this);
   }
   static CURVE() {
     return ed25519_CURVE;
@@ -287,27 +280,25 @@ var _Point = class _Point {
   static fromAffine(p) {
     return new _Point(p.x, p.y, 1n, modP(p.x * p.y));
   }
-  /** RFC8032 5.1.3: Bytes to Point. */
-  static fromBytes(hex, zip215 = false) {
-    const d = _d;
-    const normed = u8fr(abytes(hex, L));
-    const lastByte = hex[31];
+  /** RFC8032 5.1.3: Uint8Array to Point. */
+  static fromBytes(bytes2, zip215 = false) {
+    const normed = snapshotBytes(bytes2, "point", LEN);
+    const lastByte = normed[31];
     normed[31] = lastByte & -129;
     const y = bytesToNumberLE(normed);
-    const max = zip215 ? B256 : P;
-    assertRange(y, 0n, max);
+    if (!zip215)
+      arange(y, 0n, P);
     const y2 = modP(y * y);
-    const u = M(y2 - 1n);
-    const v = modP(d * y2 + 1n);
+    const u = mod(y2 - 1n);
+    const v = modP(_d * y2 + 1n);
     let { isValid, value: x } = uvRatio(u, v);
     if (!isValid)
-      err("bad point: y not sqrt");
-    const isXOdd = (x & 1n) === 1n;
-    const isLastByteOdd = (lastByte & 128) !== 0;
+      throw new Error("bad point: y not sqrt");
+    const isLastByteOdd = !!(lastByte & 128);
     if (!zip215 && x === 0n && isLastByteOdd)
-      err("bad point: x==0, isLastByteOdd");
-    if (isLastByteOdd !== isXOdd)
-      x = M(-x);
+      throw new Error("bad point: x==0, isLastByteOdd");
+    if (isLastByteOdd !== !!(x & 1n))
+      x = mod(-x);
     return new _Point(x, y, 1n, modP(x * y));
   }
   static fromHex(hex, zip215) {
@@ -325,7 +316,7 @@ var _Point = class _Point {
     const d = _d;
     const p = this;
     if (p.is0())
-      return err("bad point: ZERO");
+      throw new Error("bad point: ZERO");
     const { X, Y, Z, T } = p;
     const X2 = modP(X * X);
     const Y2 = modP(Y * Y);
@@ -333,31 +324,27 @@ var _Point = class _Point {
     const Z4 = modP(Z2 * Z2);
     const aX2 = modP(X2 * a);
     const left = modP(Z2 * (aX2 + Y2));
-    const right = M(Z4 + modP(d * modP(X2 * Y2)));
+    const right = mod(Z4 + modP(d * modP(X2 * Y2)));
     if (left !== right)
-      return err("bad point: equation left != right (1)");
+      throw new Error("bad point: equation left != right (1)");
     const XY = modP(X * Y);
     const ZT = modP(Z * T);
     if (XY !== ZT)
-      return err("bad point: equation left != right (2)");
+      throw new Error("bad point: equation left != right (2)");
     return this;
   }
   /** Equality check: compare points P&Q. */
   equals(other) {
     const { X: X1, Y: Y1, Z: Z1 } = this;
     const { X: X2, Y: Y2, Z: Z2 } = apoint(other);
-    const X1Z2 = modP(X1 * Z2);
-    const X2Z1 = modP(X2 * Z1);
-    const Y1Z2 = modP(Y1 * Z2);
-    const Y2Z1 = modP(Y2 * Z1);
-    return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;
+    return modP(X1 * Z2) === modP(X2 * Z1) && modP(Y1 * Z2) === modP(Y2 * Z1);
   }
   is0() {
     return this.equals(I);
   }
   /** Flip point over y coordinate. */
   negate() {
-    return new _Point(M(-this.X), this.Y, this.Z, M(-this.T));
+    return new _Point(mod(-this.X), this.Y, this.Z, mod(-this.T));
   }
   /** Point doubling. Complete formula. Cost: `4M + 4S + 1*a + 6add + 1*2`. */
   double() {
@@ -365,20 +352,20 @@ var _Point = class _Point {
     const a = _a;
     const A = modP(X1 * X1);
     const B = modP(Y1 * Y1);
-    const C2 = modP(2n * Z1 * Z1);
+    const C = modP(2n * Z1 * Z1);
     const D = modP(a * A);
-    const x1y1 = M(X1 + Y1);
-    const E = M(modP(x1y1 * x1y1) - A - B);
-    const G2 = M(D + B);
-    const F = M(G2 - C2);
-    const H = M(D - B);
+    const x1y1 = mod(X1 + Y1);
+    const E = mod(modP(x1y1 * x1y1) - A - B);
+    const G2 = mod(D + B);
+    const F = mod(G2 - C);
+    const H = mod(D - B);
     const X3 = modP(E * F);
     const Y3 = modP(G2 * H);
     const T3 = modP(E * H);
     const Z3 = modP(F * G2);
     return new _Point(X3, Y3, Z3, T3);
   }
-  /** Point addition. Complete formula. Cost: `8M + 1*k + 8add + 1*2`. */
+  /** Point addition. Complete formula. Cost: `9M + 1*a + 1*d + 7add`. */
   add(other) {
     const { X: X1, Y: Y1, Z: Z1, T: T1 } = this;
     const { X: X2, Y: Y2, Z: Z2, T: T2 } = apoint(other);
@@ -386,12 +373,12 @@ var _Point = class _Point {
     const d = _d;
     const A = modP(X1 * X2);
     const B = modP(Y1 * Y2);
-    const C2 = modP(modP(T1 * d) * T2);
+    const C = modP(modP(T1 * d) * T2);
     const D = modP(Z1 * Z2);
-    const E = M(modP(M(X1 + Y1) * M(X2 + Y2)) - A - B);
-    const F = M(D - C2);
-    const G2 = M(D + C2);
-    const H = M(B - modP(a * A));
+    const E = mod(modP(mod(X1 + Y1) * mod(X2 + Y2)) - A - B);
+    const F = mod(D - C);
+    const G2 = mod(D + C);
+    const H = mod(B - modP(a * A));
     const X3 = modP(E * F);
     const Y3 = modP(G2 * H);
     const T3 = modP(E * H);
@@ -412,7 +399,7 @@ var _Point = class _Point {
   multiply(n, safe = true) {
     if (!safe && n === 0n)
       return I;
-    assertRange(n, 1n, N);
+    arange(n, 1n, N);
     if (!safe && this.is0())
       return I;
     if (n === 1n)
@@ -421,11 +408,14 @@ var _Point = class _Point {
       return wNAF(n).p;
     let p = I;
     let f = G;
-    for (let d = this; n > 0n; d = d.double(), n >>= 1n) {
+    let d = this;
+    for (let i = 0; safe ? i < 256 : n > 0n; i++) {
       if (n & 1n)
         p = p.add(d);
       else if (safe)
         f = f.add(d);
+      d = d.double();
+      n >>= 1n;
     }
     return p;
   }
@@ -439,10 +429,8 @@ var _Point = class _Point {
       return { x: 0n, y: 1n };
     const iz = invert(Z, P);
     if (modP(Z * iz) !== 1n)
-      err("invalid inverse");
-    const x = modP(X * iz);
-    const y = modP(Y * iz);
-    return { x, y };
+      throw new Error("invalid inverse");
+    return { x: modP(X * iz), y: modP(Y * iz) };
   }
   toBytes() {
     const { x, y } = this.toAffine();
@@ -454,30 +442,27 @@ var _Point = class _Point {
     return bytesToHex(this.toBytes());
   }
   clearCofactor() {
-    return this.multiply(big(h), false);
+    return this.multiply(8n, false);
   }
   isSmallOrder() {
     return this.clearCofactor().is0();
   }
   isTorsionFree() {
-    let p = this.multiply(N / 2n, false).double();
-    if (N % 2n)
-      p = p.add(this);
-    return p.is0();
+    return this.multiply(N / 2n, false).double().add(this).is0();
   }
 };
 __publicField(_Point, "BASE");
 __publicField(_Point, "ZERO");
 var Point = _Point;
-var G = new Point(Gx, Gy, 1n, M(Gx * Gy));
+var G = new Point(Gx, Gy, 1n, mod(Gx * Gy));
 var I = new Point(0n, 1n, 1n, 0n);
 Point.BASE = G;
 Point.ZERO = I;
-var numTo32bLE = (num) => hexToBytes(padh(assertRange(num, 0n, B256), 64)).reverse();
-var bytesToNumberLE = (b) => big("0x" + bytesToHex(u8fr(abytes(b)).reverse()));
+var numTo32bLE = (num) => hexToBytes(padh(arange(num, 0n, B256), 64)).reverse();
+var bytesToNumberLE = (b) => BigInt("0x" + bytesToHex(Uint8Array.from(abytes(b)).reverse()));
 var pow2 = (x, power) => {
   let r = x;
-  while (power-- > 0n) {
+  while (power-- > 0) {
     r = modP(r * r);
   }
   return r;
@@ -485,103 +470,95 @@ var pow2 = (x, power) => {
 var pow_2_252_3 = (x) => {
   const x2 = modP(x * x);
   const b2 = modP(x2 * x);
-  const b4 = modP(pow2(b2, 2n) * b2);
-  const b5 = modP(pow2(b4, 1n) * x);
-  const b10 = modP(pow2(b5, 5n) * b5);
-  const b20 = modP(pow2(b10, 10n) * b10);
-  const b40 = modP(pow2(b20, 20n) * b20);
-  const b80 = modP(pow2(b40, 40n) * b40);
-  const b160 = modP(pow2(b80, 80n) * b80);
-  const b240 = modP(pow2(b160, 80n) * b80);
-  const b250 = modP(pow2(b240, 10n) * b10);
-  const pow_p_5_8 = modP(pow2(b250, 2n) * x);
-  return { pow_p_5_8, b2 };
+  const b4 = modP(pow2(b2, 2) * b2);
+  const b5 = modP(pow2(b4, 1) * x);
+  const b10 = modP(pow2(b5, 5) * b5);
+  const b20 = modP(pow2(b10, 10) * b10);
+  const b40 = modP(pow2(b20, 20) * b20);
+  const b80 = modP(pow2(b40, 40) * b40);
+  const b160 = modP(pow2(b80, 80) * b80);
+  const b240 = modP(pow2(b160, 80) * b80);
+  const b250 = modP(pow2(b240, 10) * b10);
+  return modP(pow2(b250, 2) * x);
 };
 var RM1 = 0x2b8324804fc1df0b2b4d00993dfbd7a72f431806ad2fe478c4ee1b274a0ea0b0n;
 var uvRatio = (u, v) => {
   const v3 = modP(v * modP(v * v));
   const v7 = modP(modP(v3 * v3) * v);
-  const pow = pow_2_252_3(modP(u * v7)).pow_p_5_8;
+  const pow = pow_2_252_3(modP(u * v7));
   let x = modP(u * modP(v3 * pow));
   const vx2 = modP(v * modP(x * x));
   const root1 = x;
   const root2 = modP(x * RM1);
   const useRoot1 = vx2 === u;
-  const useRoot2 = vx2 === M(-u);
-  const noRoot = vx2 === M(-u * RM1);
+  const useRoot2 = vx2 === mod(-u);
+  const noRoot = vx2 === mod(-u * RM1);
   if (useRoot1)
     x = root1;
   if (useRoot2 || noRoot)
     x = root2;
-  if ((M(x) & 1n) === 1n)
-    x = M(-x);
+  if ((mod(x) & 1n) === 1n)
+    x = mod(-x);
   return { isValid: useRoot1 || useRoot2, value: x };
 };
 var modL_LE = (hash) => modN(bytesToNumberLE(hash));
-var sha512a = (...m) => Promise.resolve(callHash("sha512Async")(concatBytes(...m))).then(checkDigest);
-var sha512s = (...m) => checkDigest(callHash("sha512")(concatBytes(...m)));
-var hash2extK = (hashed) => {
-  const copy = u8fr(hashed);
+var hashedToExtK = (hashed) => {
+  const copy = snapshotBytes(hashed);
   const head = copy.slice(0, 32);
   head[0] &= 248;
   head[31] &= 127;
   head[31] |= 64;
-  const prefix = copy.slice(32, 64);
+  const prefix = copy.slice(32);
   const scalar = modL_LE(head);
   const point = G.multiply(scalar);
   const pointBytes = point.toBytes();
   return { head, prefix, scalar, point, pointBytes };
 };
-var getExtendedPublicKeyAsync = (secretKey) => sha512a(abytes(secretKey, L)).then(hash2extK);
-var getExtendedPublicKey = (secretKey) => hash2extK(sha512s(abytes(secretKey, L)));
-var getPublicKey = (priv) => getExtendedPublicKey(priv).pointBytes;
-var hashFinishS = (res) => res.finish(sha512s(res.hashable));
+var getExtendedPublicKeyAsync = (secretKey) => callHashAsync("sha512Async", abytes(secretKey, LEN, "secretKey")).then(hashedToExtK);
+var getExtendedPublicKey = (secretKey) => hashedToExtK(callHash("sha512", abytes(secretKey, LEN, "secretKey")));
+var getPublicKey = (secretKey) => getExtendedPublicKey(secretKey).pointBytes;
+var hashFinishSync = (res) => res[1](callHash("sha512", res[0]));
 var _sign = (e, rBytes, msg) => {
-  const { pointBytes: P2, scalar: s } = e;
+  const { pointBytes: A, scalar: s } = e;
   const r = modL_LE(rBytes);
   const R = G.multiply(r).toBytes();
-  const hashable = concatBytes(R, P2, msg);
+  const hashable = concatBytes(R, A, msg);
   const finish = (hashed) => {
     const S = modN(r + modL_LE(hashed) * s);
     return abytes(concatBytes(R, numTo32bLE(S)), 64);
   };
-  return { hashable, finish };
+  return [hashable, finish];
 };
 var sign = (message, secretKey) => {
-  const m = abytes(message);
+  const m = snapshotBytes(message, "message");
   const e = getExtendedPublicKey(secretKey);
-  const rBytes = sha512s(e.prefix, m);
-  return hashFinishS(_sign(e, rBytes, m));
+  return hashFinishSync(_sign(e, callHash("sha512", e.prefix, m), m));
 };
 var hashes = {
   sha512Async: async (message) => {
-    const s = subtle();
-    const m = concatBytes(message);
-    return u8n(await s.digest("SHA-512", m.buffer));
+    const s = globalThis?.crypto?.subtle;
+    if (!s)
+      throw new Error("crypto.subtle must be defined, consider polyfill");
+    return new Uint8Array(await s.digest("SHA-512", concatBytes(message)));
   },
   sha512: void 0
 };
 var randomSecretKey = (seed) => {
-  seed = seed === void 0 ? randomBytes(L) : seed;
-  return abytes(seed, L);
+  return abytes(seed === void 0 ? randomBytes() : seed, LEN, "seed");
 };
-var utils = /* @__PURE__ */ Object.freeze({
+var utils = /* @__PURE__ */ freeze({
   getExtendedPublicKeyAsync,
   getExtendedPublicKey,
   randomSecretKey
 });
-var W = 8;
-var scalarBits = 256;
-var pwindows = Math.ceil(scalarBits / W) + 1;
-var pwindowSize = 2 ** (W - 1);
 var precompute = () => {
   const points = [];
   let p = G;
-  let b = p;
-  for (let w = 0; w < pwindows; w++) {
+  let b;
+  for (let w = 0; w < 33; w++) {
     b = p;
     points.push(b);
-    for (let i = 1; i < pwindowSize; i++) {
+    for (let i = 1; i < 128; i++) {
       b = b.add(p);
       points.push(b);
     }
@@ -598,63 +575,110 @@ var wNAF = (n) => {
   const comp = Gpows || (Gpows = precompute());
   let p = I;
   let f = G;
-  const pow_2_w = 2 ** W;
-  const maxNum = pow_2_w;
-  const mask = big(pow_2_w - 1);
-  const shiftBy = big(W);
-  for (let w = 0; w < pwindows; w++) {
-    let wbits = Number(n & mask);
-    n >>= shiftBy;
-    if (wbits > pwindowSize) {
-      wbits -= maxNum;
+  for (let w = 0; w < 33; w++) {
+    let wbits = Number(n & 255n);
+    n >>= 8n;
+    if (wbits > 128) {
+      wbits -= 256;
       n += 1n;
     }
-    const off = w * pwindowSize;
-    const offF = off;
+    const off = w * 128;
     const offP = off + Math.abs(wbits) - 1;
-    const isEven = w % 2 !== 0;
+    const isOddW = w % 2 !== 0;
     const isNeg = wbits < 0;
     if (wbits === 0) {
-      f = f.add(ctneg(isEven, comp[offF]));
+      f = f.add(ctneg(isOddW, comp[off]));
     } else {
       p = p.add(ctneg(isNeg, comp[offP]));
     }
   }
   if (n !== 0n)
-    err("invalid wnaf");
+    throw new Error("invalid wnaf");
   return { p, f };
 };
 
-// node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/utils.js
+// node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/_u64.js
+var U32_MASK64 = /* @__PURE__ */ (() => BigInt(2 ** 32 - 1))();
+var _32n = /* @__PURE__ */ BigInt(32);
+function fromBig(n, le = false) {
+  if (le)
+    return { h: Number(n & U32_MASK64), l: Number(n >> _32n & U32_MASK64) };
+  return { h: Number(n >> _32n & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
+}
+function split(lst, le = false) {
+  const len = lst.length;
+  let Ah = new Uint32Array(len);
+  let Al = new Uint32Array(len);
+  for (let i = 0; i < len; i++) {
+    const { h, l } = fromBig(lst[i], le);
+    [Ah[i], Al[i]] = [h, l];
+  }
+  return [Ah, Al];
+}
+var fromNumH = (n) => n / 2 ** 32 | 0;
+var fromNumL = (n) => n >>> 0;
+function setU64FromNum(view, byteOffset, n, isLE) {
+  const h = fromNumH(n);
+  const l = fromNumL(n);
+  view.setUint32(byteOffset, isLE ? l : h, isLE);
+  view.setUint32(byteOffset + 4, isLE ? h : l, isLE);
+}
+var shrSH = (h, _l, s) => h >>> s;
+var shrSL = (h, l, s) => h << 32 - s | l >>> s;
+var rotrSH = (h, l, s) => h >>> s | l << 32 - s;
+var rotrSL = (h, l, s) => h << 32 - s | l >>> s;
+var rotrBH = (h, l, s) => h << 64 - s | l >>> s - 32;
+var rotrBL = (h, l, s) => h >>> s - 32 | l << 64 - s;
+function add(Ah, Al, Bh, Bl) {
+  const l = (Al >>> 0) + (Bl >>> 0);
+  return { h: Ah + Bh + (l / 2 ** 32 | 0) | 0, l: l | 0 };
+}
+var add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
+var add3H = (low, Ah, Bh, Ch) => Ah + Bh + Ch + (low / 2 ** 32 | 0) | 0;
+var add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
+var add4H = (low, Ah, Bh, Ch, Dh) => Ah + Bh + Ch + Dh + (low / 2 ** 32 | 0) | 0;
+var add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
+var add5H = (low, Ah, Bh, Ch, Dh, Eh) => Ah + Bh + Ch + Dh + Eh + (low / 2 ** 32 | 0) | 0;
+
+// node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/utils.js
 function isBytes2(a) {
   return a instanceof Uint8Array || ArrayBuffer.isView(a) && a.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in a && a.BYTES_PER_ELEMENT === 1;
 }
+var atitle = (title) => title ? `"${title}" ` : "";
 function abytes2(value, length, title = "") {
+  if (isBytes2(value) && (length === void 0))
+    return value;
   const bytes2 = isBytes2(value);
-  const len = value?.length;
-  const needsLen = length !== void 0;
-  if (!bytes2 || needsLen) {
-    const prefix = title && `"${title}" `;
-    const ofLen = "";
-    const got = bytes2 ? `length=${len}` : `type=${typeof value}`;
-    const message = prefix + "expected Uint8Array" + ofLen + ", got " + got;
-    if (!bytes2)
-      throw new TypeError(message);
-    throw new RangeError(message);
-  }
-  return value;
+  const ofLen = "";
+  const got = bytes2 ? `length=${value.length}` : `type=${typeof value}`;
+  const message = atitle(title) + "expected Uint8Array" + ofLen + ", got " + got;
+  if (!bytes2)
+    throw new TypeError(message);
+  throw new RangeError(message);
 }
+var aobject = (value, label) => {
+  if (value === null || typeof value !== "object" || Array.isArray(value))
+    throw new TypeError((label === "object" ? "" : `"${label}" `) + "expected object, got type=" + typeof value);
+};
+var aopts = (value, label) => {
+  aobject(value, label);
+  const proto = Object.getPrototypeOf(value);
+  if (proto !== Object.prototype && proto !== null)
+    throw new TypeError(`"${label}" expected plain object`);
+  if (Object.hasOwn(value, "__proto__"))
+    throw new TypeError(`"${label}.__proto__" is not allowed`);
+};
 function aexists(instance, checkFinished = true) {
   if (instance.destroyed)
-    throw new Error("Hash instance has been destroyed");
+    throw new Error("hash was destroyed");
   if (checkFinished && instance.finished)
-    throw new Error("Hash#digest() has already been called");
+    throw new Error("digest() was already called");
 }
 function aoutput(out, instance) {
-  abytes2(out, void 0, "digestInto() output");
+  abytes2(out, void 0, "output");
   const min = instance.outputLen;
-  if (out.length < min) {
-    throw new RangeError('"digestInto() output" expected to be of length >=' + min);
+  if (!(out.length >= min)) {
+    throw new RangeError('"output" expected length >= ' + min);
   }
 }
 function clean(...arrays) {
@@ -665,7 +689,17 @@ function clean(...arrays) {
 function createView(arr) {
   return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
 }
+function checkOpts(defaults, opts, title = "opts") {
+  aopts(defaults, "defaults");
+  if (opts !== void 0)
+    aopts(opts, title);
+  const merged = Object.assign(/* @__PURE__ */ Object.create(null), defaults, opts);
+  return merged;
+}
 function createHasher(hashCons, info = {}) {
+  if (typeof hashCons !== "function")
+    throw new TypeError('"hashCons" expected function, got type=' + typeof hashCons);
+  info = checkOpts({}, info, "info");
   const hashC = (msg, opts) => hashCons(opts).update(msg).digest();
   const tmp = hashCons(void 0);
   hashC.outputLen = tmp.outputLen;
@@ -681,7 +715,7 @@ var oidNist = (suffix) => ({
   oid: Uint8Array.from([6, 9, 96, 134, 72, 1, 101, 3, 4, 2, suffix])
 });
 
-// node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/_md.js
+// node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/_md.js
 var HashMD = class {
   constructor(blockLen, outputLen, padOffset, isLE) {
     __publicField(this, "blockLen");
@@ -708,24 +742,28 @@ var HashMD = class {
     abytes2(data);
     const { view, buffer, blockLen } = this;
     const len = data.length;
+    let processed = false;
     for (let pos = 0; pos < len; ) {
       const take = Math.min(blockLen - this.pos, len - pos);
       if (take === blockLen) {
         const dataView = createView(data);
         for (; blockLen <= len - pos; pos += blockLen)
           this.process(dataView, pos);
+        processed = true;
         continue;
       }
-      buffer.set(data.subarray(pos, pos + take), this.pos);
+      buffer.set(pos === 0 && take === len ? data : data.subarray(pos, pos + take), this.pos);
       this.pos += take;
       pos += take;
       if (this.pos === blockLen) {
         this.process(view, 0);
         this.pos = 0;
+        processed = true;
       }
     }
     this.length += data.length;
-    this.roundClean();
+    if (processed)
+      this.roundClean();
     return this;
   }
   digestInto(out) {
@@ -735,23 +773,20 @@ var HashMD = class {
     const { buffer, view, blockLen, isLE } = this;
     let { pos } = this;
     buffer[pos++] = 128;
-    clean(this.buffer.subarray(pos));
+    buffer.fill(0, pos);
     if (this.padOffset > blockLen - pos) {
       this.process(view, 0);
-      pos = 0;
+      buffer.fill(0);
     }
-    for (let i = pos; i < blockLen; i++)
-      buffer[i] = 0;
-    view.setBigUint64(blockLen - 8, BigInt(this.length * 8), isLE);
+    setU64FromNum(view, blockLen - 8, this.length * 8, isLE);
     this.process(view, 0);
-    const oview = createView(out);
+    this.roundClean();
+    const oview = out === buffer ? view : createView(out);
     const len = this.outputLen;
-    if (len % 4)
-      throw new Error("_sha2: outputLen must be aligned to 32bit");
     const outLen = len / 4;
     const state = this.get();
-    if (outLen > state.length)
-      throw new Error("_sha2: outputLen bigger than state");
+    if (len % 4 || outLen > state.length)
+      throw new Error("invalid outputLen");
     for (let i = 0; i < outLen; i++)
       oview.setUint32(4 * i, state[i], isLE);
   }
@@ -762,15 +797,13 @@ var HashMD = class {
     this.destroy();
     return res;
   }
-  _cloneInto(to) {
-    to || (to = new this.constructor());
-    to.set(...this.get());
-    const { blockLen, buffer, length, finished, destroyed, pos } = this;
+  _cloneIntoMeta(to) {
+    const { buffer, length, finished, destroyed, pos } = this;
     to.destroyed = destroyed;
     to.finished = finished;
     to.length = length;
     to.pos = pos;
-    if (length % blockLen)
+    if (pos)
       to.buffer.set(buffer);
     return to;
   }
@@ -797,42 +830,7 @@ var SHA512_IV = /* @__PURE__ */ Uint32Array.from([
   327033209
 ]);
 
-// node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/_u64.js
-var U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
-var _32n = /* @__PURE__ */ BigInt(32);
-function fromBig(n, le = false) {
-  if (le)
-    return { h: Number(n & U32_MASK64), l: Number(n >> _32n & U32_MASK64) };
-  return { h: Number(n >> _32n & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
-}
-function split(lst, le = false) {
-  const len = lst.length;
-  let Ah = new Uint32Array(len);
-  let Al = new Uint32Array(len);
-  for (let i = 0; i < len; i++) {
-    const { h: h2, l } = fromBig(lst[i], le);
-    [Ah[i], Al[i]] = [h2, l];
-  }
-  return [Ah, Al];
-}
-var shrSH = (h2, _l, s) => h2 >>> s;
-var shrSL = (h2, l, s) => h2 << 32 - s | l >>> s;
-var rotrSH = (h2, l, s) => h2 >>> s | l << 32 - s;
-var rotrSL = (h2, l, s) => h2 << 32 - s | l >>> s;
-var rotrBH = (h2, l, s) => h2 << 64 - s | l >>> s - 32;
-var rotrBL = (h2, l, s) => h2 >>> s - 32 | l << 64 - s;
-function add(Ah, Al, Bh, Bl) {
-  const l = (Al >>> 0) + (Bl >>> 0);
-  return { h: Ah + Bh + (l / 2 ** 32 | 0) | 0, l: l | 0 };
-}
-var add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
-var add3H = (low, Ah, Bh, Ch) => Ah + Bh + Ch + (low / 2 ** 32 | 0) | 0;
-var add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);
-var add4H = (low, Ah, Bh, Ch, Dh) => Ah + Bh + Ch + Dh + (low / 2 ** 32 | 0) | 0;
-var add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);
-var add5H = (low, Ah, Bh, Ch, Dh, Eh) => Ah + Bh + Ch + Dh + Eh + (low / 2 ** 32 | 0) | 0;
-
-// node_modules/.pnpm/@noble+hashes@2.2.0/node_modules/@noble/hashes/sha2.js
+// node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/sha2.js
 var K512 = /* @__PURE__ */ (() => split([
   "0x428a2f98d728ae22",
   "0x7137449123ef65cd",
@@ -920,8 +918,45 @@ var SHA512_Kl = /* @__PURE__ */ (() => K512[1])();
 var SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);
 var SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);
 var SHA2_64B = class extends HashMD {
-  constructor(outputLen) {
+  constructor(outputLen, IV) {
     super(128, outputLen, 16, false);
+    // We cannot use array here since array allows indexing by variable
+    // which means optimizer/compiler cannot use registers.
+    // h -- high 32 bits, l -- low 32 bits
+    // Numeric initializers matter: starting the fields as `undefined` changes
+    // V8's field representation and slows hashing down (measured on sha256).
+    __publicField(this, "Ah", 0);
+    __publicField(this, "Al", 0);
+    __publicField(this, "Bh", 0);
+    __publicField(this, "Bl", 0);
+    __publicField(this, "Ch", 0);
+    __publicField(this, "Cl", 0);
+    __publicField(this, "Dh", 0);
+    __publicField(this, "Dl", 0);
+    __publicField(this, "Eh", 0);
+    __publicField(this, "El", 0);
+    __publicField(this, "Fh", 0);
+    __publicField(this, "Fl", 0);
+    __publicField(this, "Gh", 0);
+    __publicField(this, "Gl", 0);
+    __publicField(this, "Hh", 0);
+    __publicField(this, "Hl", 0);
+    this.Ah = IV[0] | 0;
+    this.Al = IV[1] | 0;
+    this.Bh = IV[2] | 0;
+    this.Bl = IV[3] | 0;
+    this.Ch = IV[4] | 0;
+    this.Cl = IV[5] | 0;
+    this.Dh = IV[6] | 0;
+    this.Dl = IV[7] | 0;
+    this.Eh = IV[8] | 0;
+    this.El = IV[9] | 0;
+    this.Fh = IV[10] | 0;
+    this.Fl = IV[11] | 0;
+    this.Gh = IV[12] | 0;
+    this.Gl = IV[13] | 0;
+    this.Hh = IV[14] | 0;
+    this.Hl = IV[15] | 0;
   }
   // prettier-ignore
   get() {
@@ -947,6 +982,10 @@ var SHA2_64B = class extends HashMD {
     this.Hh = Hh | 0;
     this.Hl = Hl | 0;
   }
+  _cloneInto(to) {
+    (to || (to = new this.constructor())).set(...this.get());
+    return this._cloneIntoMeta(to);
+  }
   process(view, offset) {
     for (let i = 0; i < 16; i++, offset += 4) {
       SHA512_W_H[i] = view.getUint32(offset);
@@ -1017,23 +1056,7 @@ var SHA2_64B = class extends HashMD {
 };
 var _SHA512 = class extends SHA2_64B {
   constructor() {
-    super(64);
-    __publicField(this, "Ah", SHA512_IV[0] | 0);
-    __publicField(this, "Al", SHA512_IV[1] | 0);
-    __publicField(this, "Bh", SHA512_IV[2] | 0);
-    __publicField(this, "Bl", SHA512_IV[3] | 0);
-    __publicField(this, "Ch", SHA512_IV[4] | 0);
-    __publicField(this, "Cl", SHA512_IV[5] | 0);
-    __publicField(this, "Dh", SHA512_IV[6] | 0);
-    __publicField(this, "Dl", SHA512_IV[7] | 0);
-    __publicField(this, "Eh", SHA512_IV[8] | 0);
-    __publicField(this, "El", SHA512_IV[9] | 0);
-    __publicField(this, "Fh", SHA512_IV[10] | 0);
-    __publicField(this, "Fl", SHA512_IV[11] | 0);
-    __publicField(this, "Gh", SHA512_IV[12] | 0);
-    __publicField(this, "Gl", SHA512_IV[13] | 0);
-    __publicField(this, "Hh", SHA512_IV[14] | 0);
-    __publicField(this, "Hl", SHA512_IV[15] | 0);
+    super(64, SHA512_IV);
   }
 };
 var sha512 = /* @__PURE__ */ createHasher(
@@ -1203,7 +1226,7 @@ var PKCS8_ED25519_PREFIX = new Uint8Array([
   4,
   32
 ]);
-function subtle2() {
+function subtle() {
   const s = globalThis.crypto?.subtle;
   if (!s) {
     throw new Error("WebCrypto is unavailable: crypto.subtle requires a secure context (HTTPS or localhost)");
@@ -1221,15 +1244,15 @@ function rawKeySigner(privateKey) {
   };
 }
 async function webCryptoSigner(keyPair) {
-  const publicKey = new Uint8Array(await subtle2().exportKey("raw", keyPair.publicKey));
+  const publicKey = new Uint8Array(await subtle().exportKey("raw", keyPair.publicKey));
   const privateKey = keyPair.privateKey;
   return {
     publicKey,
-    sign: async (data) => new Uint8Array(await subtle2().sign(ED25519, privateKey, bytes(data)))
+    sign: async (data) => new Uint8Array(await subtle().sign(ED25519, privateKey, bytes(data)))
   };
 }
 async function generateNonExtractableKeyPair() {
-  return subtle2().generateKey(ED25519, false, ["sign", "verify"]);
+  return subtle().generateKey(ED25519, false, ["sign", "verify"]);
 }
 async function importNonExtractableKey(privateKey) {
   if (privateKey.length !== 32) {
@@ -1239,7 +1262,7 @@ async function importNonExtractableKey(privateKey) {
   pkcs8.set(PKCS8_ED25519_PREFIX, 0);
   pkcs8.set(privateKey, PKCS8_ED25519_PREFIX.length);
   try {
-    const s = subtle2();
+    const s = subtle();
     const [priv, pub] = await Promise.all([
       s.importKey("pkcs8", pkcs8, ED25519, false, ["sign"]),
       s.importKey("raw", bytes(getPublicKey2(privateKey)), ED25519, true, ["verify"])
@@ -1254,7 +1277,7 @@ function isWebCryptoEd25519Supported() {
   supported ?? (supported = (async () => {
     try {
       const kp = await generateNonExtractableKeyPair();
-      await subtle2().sign(ED25519, kp.privateKey, new Uint8Array(1));
+      await subtle().sign(ED25519, kp.privateKey, new Uint8Array(1));
       return true;
     } catch {
       return false;
@@ -1502,8 +1525,8 @@ async function parseErrorBody(response) {
       body = await response.json();
     }
     if (body && typeof body === "object" && "error" in body) {
-      const err2 = body.error;
-      if (typeof err2 === "string") message = err2;
+      const err = body.error;
+      if (typeof err === "string") message = err;
     }
   } catch {
   }
@@ -1662,9 +1685,9 @@ async function* parseSSEStream(response, options) {
       let result;
       try {
         result = await reader.read();
-      } catch (err2) {
+      } catch (err) {
         if (signal?.aborted) break;
-        throw err2;
+        throw err;
       }
       const { done, value } = result;
       if (done) break;
@@ -3761,14 +3784,14 @@ function stripTrailingSlash(value) {
   return value.endsWith("/") ? value.slice(0, -1) : value;
 }
 function hostIsLocal(host) {
-  const h2 = host.toLowerCase();
-  if (h2 === "localhost" || h2.endsWith(".localhost") || h2.endsWith(".local")) return true;
-  if (h2 === "::1" || h2 === "0.0.0.0") return true;
-  if (/^127\./.test(h2)) return true;
-  if (/^10\./.test(h2)) return true;
-  if (/^192\.168\./.test(h2)) return true;
-  if (/^172\.(1[6-9]|2\d|3[01])\./.test(h2)) return true;
-  if (/^169\.254\./.test(h2)) return true;
+  const h = host.toLowerCase();
+  if (h === "localhost" || h.endsWith(".localhost") || h.endsWith(".local")) return true;
+  if (h === "::1" || h === "0.0.0.0") return true;
+  if (/^127\./.test(h)) return true;
+  if (/^10\./.test(h)) return true;
+  if (/^192\.168\./.test(h)) return true;
+  if (/^172\.(1[6-9]|2\d|3[01])\./.test(h)) return true;
+  if (/^169\.254\./.test(h)) return true;
   return false;
 }
 function schemelessVenueCandidates(venueId) {