@coinbase/cdp-core 0.0.86 → 0.0.87

package/dist/native/index.native16.js

@@ -1,7 +1,7 @@
 import { verifyOAuthCode as i } from "@coinbase/cdp-api-client";
 import { Analytics as m } from "./index.native2.js";
 import "./index.native3.js";
-import { verifyOTP as f } from "./index.native95.js";
+import { verifyOTP as f } from "./index.native96.js";
 import "viem";
 const u = async (e) => (m.sendActionCallEvent({ name: "verify_oauth" }), f(
   e,

package/dist/native/index.native160.js

@@ -1,31 +1,14 @@
-import { SliceOffsetOutOfBoundsError as n } from "./index.native158.js";
-import { isHex as c } from "./index.native156.js";
-import { size as s } from "./index.native159.js";
-function O(e, f, i, { strict: o } = {}) {
-  return c(e, { strict: !1 }) ? l(e, f, i, {
-    strict: o
-  }) : u(e, f, i, {
-    strict: o
-  });
-}
-function t(e, f, i) {
-  if (s(e) !== i - f)
-    throw new n({
-      offset: i,
-      position: "end",
-      size: s(e)
-    });
-}
-function u(e, f, i, { strict: o } = {}) {
-  const r = e.slice(f, i);
-  return o && t(r, f, i), r;
-}
-function l(e, f, i, { strict: o } = {}) {
-  const r = `0x${e.replace("0x", "").slice(f * 2, i * 2)}`;
-  return o && t(r, f, i), r;
+import { commitmentToVersionedHash as i } from "./index.native212.js";
+function r(o) {
+  const { commitments: t, version: n } = o, e = o.to ?? (typeof t[0] == "string" ? "hex" : "bytes"), s = [];
+  for (const m of t)
+    s.push(i({
+      commitment: m,
+      to: e,
+      version: n
+    }));
+  return s;
 }
 export {
-  O as slice,
-  u as sliceBytes,
-  l as sliceHex
+  r as commitmentsToVersionedHashes
 };

package/dist/native/index.native161.js

@@ -1,9 +1,16 @@
-function f(e, { dir: n = "left" } = {}) {
-  let t = typeof e == "string" ? e.replace("0x", "") : e, i = 0;
-  for (let l = 0; l < t.length - 1 && t[n === "left" ? l : t.length - l - 1].toString() === "0"; l++)
-    i++;
-  return t = n === "left" ? t.slice(i) : t.slice(0, t.length - i), typeof e == "string" ? (t.length === 1 && n === "right" && (t = `${t}0`), `0x${t.length % 2 === 1 ? `0${t}` : t}`) : t;
+import { blobsToCommitments as f } from "./index.native158.js";
+import { blobsToProofs as l } from "./index.native159.js";
+import { toBlobs as p } from "./index.native211.js";
+function k(t) {
+  const { data: i, kzg: n, to: m } = t, s = t.blobs ?? p({ data: i, to: m }), b = t.commitments ?? f({ blobs: s, kzg: n, to: m }), r = t.proofs ?? l({ blobs: s, commitments: b, kzg: n, to: m }), c = [];
+  for (let o = 0; o < s.length; o++)
+    c.push({
+      blob: s[o],
+      commitment: b[o],
+      proof: r[o]
+    });
+  return c;
 }
 export {
-  f as trim
+  k as toBlobSidecars
 };

package/dist/native/index.native162.js

@@ -1,45 +1,21 @@
-import { BaseError as l } from "./index.native163.js";
-import { createCursor as r } from "./index.native164.js";
-import { hexToBytes as g } from "./index.native152.js";
-import { bytesToHex as u } from "./index.native150.js";
-function m(n, e = "hex") {
-  const i = s(n), h = r(new Uint8Array(i.length));
-  return i.encode(h), e === "hex" ? u(h.bytes) : h.bytes;
-}
-function s(n) {
-  return Array.isArray(n) ? p(n.map((e) => s(e))) : y(n);
-}
-function p(n) {
-  const e = n.reduce((t, f) => t + f.length, 0), i = o(e);
-  return {
-    length: e <= 55 ? 1 + e : 1 + i + e,
-    encode(t) {
-      e <= 55 ? t.pushByte(192 + e) : (t.pushByte(247 + i), i === 1 ? t.pushUint8(e) : i === 2 ? t.pushUint16(e) : i === 3 ? t.pushUint24(e) : t.pushUint32(e));
-      for (const { encode: f } of n)
-        f(t);
-    }
-  };
-}
-function y(n) {
-  const e = typeof n == "string" ? g(n) : n, i = o(e.length);
-  return {
-    length: e.length === 1 && e[0] < 128 ? 1 : e.length <= 55 ? 1 + e.length : 1 + i + e.length,
-    encode(t) {
-      e.length === 1 && e[0] < 128 ? t.pushBytes(e) : e.length <= 55 ? (t.pushByte(128 + e.length), t.pushBytes(e)) : (t.pushByte(183 + i), i === 1 ? t.pushUint8(e.length) : i === 2 ? t.pushUint16(e.length) : i === 3 ? t.pushUint24(e.length) : t.pushUint32(e.length), t.pushBytes(e));
-    }
-  };
-}
-function o(n) {
-  if (n < 2 ** 8)
-    return 1;
-  if (n < 2 ** 16)
-    return 2;
-  if (n < 2 ** 24)
-    return 3;
-  if (n < 2 ** 32)
-    return 4;
-  throw new l("Length is too large.");
+import { InvalidAddressError as s } from "./index.native120.js";
+import { InvalidStorageKeySizeError as l } from "./index.native151.js";
+import { isAddress as f } from "./index.native121.js";
+function a(r) {
+  if (!r || r.length === 0)
+    return [];
+  const n = [];
+  for (let o = 0; o < r.length; o++) {
+    const { address: i, storageKeys: e } = r[o];
+    for (let t = 0; t < e.length; t++)
+      if (e[t].length - 2 !== 64)
+        throw new l({ storageKey: e[t] });
+    if (!f(i, { strict: !1 }))
+      throw new s({ address: i });
+    n.push([i, e]);
+  }
+  return n;
 }
 export {
-  m as toRlp
+  a as serializeAccessList
 };

package/dist/native/index.native163.js

@@ -1,58 +1,8 @@
-import { version as o } from "./index.native207.js";
-let r = {
-  getDocsUrl: ({ docsBaseUrl: s, docsPath: t = "", docsSlug: e }) => t ? `${s ?? "https://viem.sh"}${t}${e ? `#${e}` : ""}` : void 0,
-  version: `viem@${o}`
-};
-class u extends Error {
-  constructor(t, e = {}) {
-    const i = e.cause instanceof u ? e.cause.details : e.cause?.message ? e.cause.message : e.details, n = e.cause instanceof u && e.cause.docsPath || e.docsPath, a = r.getDocsUrl?.({ ...e, docsPath: n }), l = [
-      t || "An error occurred.",
-      "",
-      ...e.metaMessages ? [...e.metaMessages, ""] : [],
-      ...a ? [`Docs: ${a}`] : [],
-      ...i ? [`Details: ${i}`] : [],
-      ...r.version ? [`Version: ${r.version}`] : []
-    ].join(`
-`);
-    super(l, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "docsPath", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "metaMessages", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "shortMessage", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "version", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "BaseError"
-    }), this.details = i, this.docsPath = n, this.metaMessages = e.metaMessages, this.name = e.name ?? this.name, this.shortMessage = t, this.version = o;
-  }
-  walk(t) {
-    return c(this, t);
-  }
-}
-function c(s, t) {
-  return t?.(s) ? s : s && typeof s == "object" && "cause" in s && s.cause !== void 0 ? c(s.cause, t) : t ? null : s;
+import { gweiUnits as i } from "./index.native164.js";
+import { formatUnits as o } from "./index.native165.js";
+function f(r, t = "wei") {
+  return o(r, i[t]);
 }
 export {
-  u as BaseError
+  f as formatGwei
 };

package/dist/native/index.native164.js

@@ -1,130 +1,7 @@
-import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index.native208.js";
-const h = {
-  bytes: new Uint8Array(),
-  dataView: new DataView(new ArrayBuffer(0)),
-  position: 0,
-  positionReadCount: /* @__PURE__ */ new Map(),
-  recursiveReadCount: 0,
-  recursiveReadLimit: Number.POSITIVE_INFINITY,
-  assertReadLimit() {
-    if (this.recursiveReadCount >= this.recursiveReadLimit)
-      throw new n({
-        count: this.recursiveReadCount + 1,
-        limit: this.recursiveReadLimit
-      });
-  },
-  assertPosition(t) {
-    if (t < 0 || t > this.bytes.length - 1)
-      throw new e({
-        length: this.bytes.length,
-        position: t
-      });
-  },
-  decrementPosition(t) {
-    if (t < 0)
-      throw new o({ offset: t });
-    const i = this.position - t;
-    this.assertPosition(i), this.position = i;
-  },
-  getReadCount(t) {
-    return this.positionReadCount.get(t || this.position) || 0;
-  },
-  incrementPosition(t) {
-    if (t < 0)
-      throw new o({ offset: t });
-    const i = this.position + t;
-    this.assertPosition(i), this.position = i;
-  },
-  inspectByte(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i), this.bytes[i];
-  },
-  inspectBytes(t, i) {
-    const s = i ?? this.position;
-    return this.assertPosition(s + t - 1), this.bytes.subarray(s, s + t);
-  },
-  inspectUint8(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i), this.bytes[i];
-  },
-  inspectUint16(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i + 1), this.dataView.getUint16(i);
-  },
-  inspectUint24(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i + 2), (this.dataView.getUint16(i) << 8) + this.dataView.getUint8(i + 2);
-  },
-  inspectUint32(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i + 3), this.dataView.getUint32(i);
-  },
-  pushByte(t) {
-    this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
-  },
-  pushBytes(t) {
-    this.assertPosition(this.position + t.length - 1), this.bytes.set(t, this.position), this.position += t.length;
-  },
-  pushUint8(t) {
-    this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
-  },
-  pushUint16(t) {
-    this.assertPosition(this.position + 1), this.dataView.setUint16(this.position, t), this.position += 2;
-  },
-  pushUint24(t) {
-    this.assertPosition(this.position + 2), this.dataView.setUint16(this.position, t >> 8), this.dataView.setUint8(this.position + 2, t & 255), this.position += 3;
-  },
-  pushUint32(t) {
-    this.assertPosition(this.position + 3), this.dataView.setUint32(this.position, t), this.position += 4;
-  },
-  readByte() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectByte();
-    return this.position++, t;
-  },
-  readBytes(t, i) {
-    this.assertReadLimit(), this._touch();
-    const s = this.inspectBytes(t);
-    return this.position += i ?? t, s;
-  },
-  readUint8() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint8();
-    return this.position += 1, t;
-  },
-  readUint16() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint16();
-    return this.position += 2, t;
-  },
-  readUint24() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint24();
-    return this.position += 3, t;
-  },
-  readUint32() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint32();
-    return this.position += 4, t;
-  },
-  get remaining() {
-    return this.bytes.length - this.position;
-  },
-  setPosition(t) {
-    const i = this.position;
-    return this.assertPosition(t), this.position = t, () => this.position = i;
-  },
-  _touch() {
-    if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)
-      return;
-    const t = this.getReadCount();
-    this.positionReadCount.set(this.position, t + 1), t > 0 && this.recursiveReadCount++;
-  }
+const e = {
+  ether: -9,
+  wei: 9
 };
-function a(t, { recursiveReadLimit: i = 8192 } = {}) {
-  const s = Object.create(h);
-  return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
-}
 export {
-  a as createCursor
+  e as gweiUnits
 };

package/dist/native/index.native165.js

@@ -1,26 +1,13 @@
-import { SizeOverflowError as u } from "./index.native166.js";
-import { size as t } from "./index.native159.js";
-function s(n, { size: i }) {
-  if (t(n) > i)
-    throw new u({
-      givenSize: t(n),
-      maxSize: i
-    });
-}
-function z(n, i = {}) {
-  const { signed: o } = i;
-  i.size && s(n, { size: i.size });
-  const e = BigInt(n);
-  if (!o)
-    return e;
-  const r = (n.length - 2) / 2, f = (1n << BigInt(r) * 8n - 1n) - 1n;
-  return e <= f ? e : e - BigInt(`0x${"f".padStart(r * 2, "f")}`) - 1n;
-}
-function g(n, i = {}) {
-  return Number(z(n, i));
+function a(r, n) {
+  let t = r.toString();
+  const i = t.startsWith("-");
+  i && (t = t.slice(1)), t = t.padStart(n, "0");
+  let [l, e] = [
+    t.slice(0, t.length - n),
+    t.slice(t.length - n)
+  ];
+  return e = e.replace(/(0+)$/, ""), `${i ? "-" : ""}${l || "0"}${e ? `.${e}` : ""}`;
 }
 export {
-  s as assertSize,
-  z as hexToBigInt,
-  g as hexToNumber
+  a as formatUnits
 };

package/dist/native/index.native166.js

@@ -1,15 +1,23 @@
-import { BaseError as t } from "./index.native163.js";
-class $ extends t {
-  constructor({ max: e, min: r, signed: s, size: n, value: a }) {
-    super(`Number "${a}" is not in safe ${n ? `${n * 8}-bit ${s ? "signed" : "unsigned"} ` : ""}integer range ${e ? `(${r} to ${e})` : `(above ${r})`}`, { name: "IntegerOutOfRangeError" });
+import { encoder as t, decoder as o } from "./index.native116.js";
+import { encodeBase64 as c, decodeBase64 as a } from "./index.native213.js";
+function i(r) {
+  if (Uint8Array.fromBase64)
+    return Uint8Array.fromBase64(typeof r == "string" ? r : o.decode(r), {
+      alphabet: "base64url"
+    });
+  let e = r;
+  e instanceof Uint8Array && (e = o.decode(e)), e = e.replace(/-/g, "+").replace(/_/g, "/").replace(/\s/g, "");
+  try {
+    return a(e);
+  } catch {
+    throw new TypeError("The input to be decoded is not correctly encoded.");
   }
 }
-class c extends t {
-  constructor({ givenSize: e, maxSize: r }) {
-    super(`Size cannot exceed ${r} bytes. Given size: ${e} bytes.`, { name: "SizeOverflowError" });
-  }
+function p(r) {
+  let e = r;
+  return typeof e == "string" && (e = t.encode(e)), Uint8Array.prototype.toBase64 ? e.toBase64({ alphabet: "base64url", omitPadding: !0 }) : c(e).replace(/=/g, "").replace(/\+/g, "-").replace(/\//g, "_");
 }
 export {
-  $ as IntegerOutOfRangeError,
-  c as SizeOverflowError
+  i as decode,
+  p as encode
 };

package/dist/native/index.native167.js

@@ -1,107 +1,12 @@
-import { split as L, rotlSH as T, rotlSL as S, rotlBH as m, rotlBL as F } from "./index.native210.js";
-import { createHasher as X, Hash as E, anumber as d, u32 as U, swap32IfBE as I, aexists as x, toBytes as P, abytes as k, aoutput as M, clean as y } from "./index.native188.js";
-const R = BigInt(0), f = BigInt(1), j = BigInt(2), q = BigInt(7), v = BigInt(256), z = BigInt(113), _ = [], g = [], B = [];
-for (let n = 0, t = f, s = 1, i = 0; n < 24; n++) {
-  [s, i] = [i, (2 * s + 3 * i) % 5], _.push(2 * (5 * i + s)), g.push((n + 1) * (n + 2) / 2 % 64);
-  let o = R;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> q) * z) % v, t & j && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  B.push(o);
-}
-const A = L(B, !0), C = A[0], D = A[1], O = (n, t, s) => s > 32 ? m(n, t, s) : T(n, t, s), w = (n, t, s) => s > 32 ? F(n, t, s) : S(n, t, s);
-function G(n, t = 24) {
-  const s = new Uint32Array(10);
-  for (let i = 24 - t; i < 24; i++) {
-    for (let e = 0; e < 10; e++)
-      s[e] = n[e] ^ n[e + 10] ^ n[e + 20] ^ n[e + 30] ^ n[e + 40];
-    for (let e = 0; e < 10; e += 2) {
-      const h = (e + 8) % 10, l = (e + 2) % 10, u = s[l], c = s[l + 1], b = O(u, c, 1) ^ s[h], H = w(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        n[e + a] ^= b, n[e + a + 1] ^= H;
-    }
-    let o = n[2], r = n[3];
-    for (let e = 0; e < 24; e++) {
-      const h = g[e], l = O(o, r, h), u = w(o, r, h), c = _[e];
-      o = n[c], r = n[c + 1], n[c] = l, n[c + 1] = u;
-    }
-    for (let e = 0; e < 50; e += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = n[e + h];
-      for (let h = 0; h < 10; h++)
-        n[e + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
-    }
-    n[0] ^= C[i], n[1] ^= D[i];
-  }
-  y(s);
-}
-class p extends E {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, i, o = !1, r = 24) {
-    if (super(), this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, this.enableXOF = !1, this.blockLen = t, this.suffix = s, this.outputLen = i, this.enableXOF = o, this.rounds = r, d(i), !(0 < t && t < 200))
-      throw new Error("only keccak-f1600 function is supported");
-    this.state = new Uint8Array(200), this.state32 = U(this.state);
-  }
-  clone() {
-    return this._cloneInto();
-  }
-  keccak() {
-    I(this.state32), G(this.state32, this.rounds), I(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    x(this), t = P(t), k(t);
-    const { blockLen: s, state: i } = this, o = t.length;
-    for (let r = 0; r < o; ) {
-      const e = Math.min(s - this.pos, o - r);
-      for (let h = 0; h < e; h++)
-        i[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: s, pos: i, blockLen: o } = this;
-    t[i] ^= s, (s & 128) !== 0 && i === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    x(this, !1), k(t), this.finish();
-    const s = this.state, { blockLen: i } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= i && this.keccak();
-      const e = Math.min(i - this.posOut, r - o);
-      t.set(s.subarray(this.posOut, this.posOut + e), o), this.posOut += e, o += e;
-    }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return d(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (M(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, y(this.state);
-  }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: i, outputLen: o, rounds: r, enableXOF: e } = this;
-    return t || (t = new p(s, i, o, e, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = i, t.outputLen = o, t.enableXOF = e, t.destroyed = this.destroyed, t;
-  }
-}
-const J = (n, t, s) => X(() => new p(t, n, s)), Q = J(1, 136, 256 / 8);
+import n from "./index.native214.js";
+import s from "./index.native215.js";
+import a from "./index.native216.js";
+const y = async (t, o, e) => {
+  const r = await a(t, o, "sign");
+  s(t, r);
+  const i = await crypto.subtle.sign(n(t, r.algorithm), r, e);
+  return new Uint8Array(i);
+};
 export {
-  p as Keccak,
-  G as keccakP,
-  Q as keccak_256
+  y as default
 };

package/dist/native/index.native168.js

@@ -1,9 +1,22 @@
-import { sha256 as o } from "./index.native169.js";
-import { isHex as s } from "./index.native156.js";
-import { toBytes as r } from "./index.native152.js";
-function p(t, i) {
-  return o(s(t, { strict: !1 }) ? r(t) : t);
-}
+const a = (...o) => {
+  const t = o.filter(Boolean);
+  if (t.length === 0 || t.length === 1)
+    return !0;
+  let e;
+  for (const s of t) {
+    const r = Object.keys(s);
+    if (!e || e.size === 0) {
+      e = new Set(r);
+      continue;
+    }
+    for (const n of r) {
+      if (e.has(n))
+        return !1;
+      e.add(n);
+    }
+  }
+  return !0;
+};
 export {
-  p as sha256
+  a as default
 };

package/dist/native/index.native169.js

@@ -1,5 +1,96 @@
-import { sha256 as s } from "./index.native186.js";
-const o = s;
+import { withAlg as n } from "./index.native217.js";
+import c from "./index.native218.js";
+import { isJWK as p, isSecretJWK as a, isPublicJWK as y, isPrivateJWK as f } from "./index.native219.js";
+const s = (r) => r?.[Symbol.toStringTag], o = (r, e, t) => {
+  if (e.use !== void 0) {
+    let i;
+    switch (t) {
+      case "sign":
+      case "verify":
+        i = "sig";
+        break;
+      case "encrypt":
+      case "decrypt":
+        i = "enc";
+        break;
+    }
+    if (e.use !== i)
+      throw new TypeError(`Invalid key for this operation, its "use" must be "${i}" when present`);
+  }
+  if (e.alg !== void 0 && e.alg !== r)
+    throw new TypeError(`Invalid key for this operation, its "alg" must be "${r}" when present`);
+  if (Array.isArray(e.key_ops)) {
+    let i;
+    switch (!0) {
+      case t === "sign":
+      case r === "dir":
+      case r.includes("CBC-HS"):
+        i = t;
+        break;
+      case r.startsWith("PBES2"):
+        i = "deriveBits";
+        break;
+      case /^A\d{3}(?:GCM)?(?:KW)?$/.test(r):
+        !r.includes("GCM") && r.endsWith("KW") ? i = "unwrapKey" : i = t;
+        break;
+      case t === "encrypt":
+        i = "wrapKey";
+        break;
+      case t === "decrypt":
+        i = r.startsWith("RSA") ? "unwrapKey" : "deriveBits";
+        break;
+    }
+    if (i && e.key_ops?.includes?.(i) === !1)
+      throw new TypeError(`Invalid key for this operation, its "key_ops" must include "${i}" when present`);
+  }
+  return !0;
+}, h = (r, e, t) => {
+  if (!(e instanceof Uint8Array)) {
+    if (p(e)) {
+      if (a(e) && o(r, e, t))
+        return;
+      throw new TypeError('JSON Web Key for symmetric algorithms must have JWK "kty" (Key Type) equal to "oct" and the JWK "k" (Key Value) present');
+    }
+    if (!c(e))
+      throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key", "Uint8Array"));
+    if (e.type !== "secret")
+      throw new TypeError(`${s(e)} instances for symmetric algorithms must be of type "secret"`);
+  }
+}, m = (r, e, t) => {
+  if (p(e))
+    switch (t) {
+      case "decrypt":
+      case "sign":
+        if (f(e) && o(r, e, t))
+          return;
+        throw new TypeError("JSON Web Key for this operation be a private JWK");
+      case "encrypt":
+      case "verify":
+        if (y(e) && o(r, e, t))
+          return;
+        throw new TypeError("JSON Web Key for this operation be a public JWK");
+    }
+  if (!c(e))
+    throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key"));
+  if (e.type === "secret")
+    throw new TypeError(`${s(e)} instances for asymmetric algorithms must not be of type "secret"`);
+  if (e.type === "public")
+    switch (t) {
+      case "sign":
+        throw new TypeError(`${s(e)} instances for asymmetric algorithm signing must be of type "private"`);
+      case "decrypt":
+        throw new TypeError(`${s(e)} instances for asymmetric algorithm decryption must be of type "private"`);
+    }
+  if (e.type === "private")
+    switch (t) {
+      case "verify":
+        throw new TypeError(`${s(e)} instances for asymmetric algorithm verifying must be of type "public"`);
+      case "encrypt":
+        throw new TypeError(`${s(e)} instances for asymmetric algorithm encryption must be of type "public"`);
+    }
+}, d = (r, e, t) => {
+  r.startsWith("HS") || r === "dir" || r.startsWith("PBES2") || /^A(?:128|192|256)(?:GCM)?(?:KW)?$/.test(r) || /^A(?:128|192|256)CBC-HS(?:256|384|512)$/.test(r) ? h(r, e, t) : m(r, e, t);
+};
 export {
-  o as sha256
+  d as default
 };