@coinbase/cdp-core 0.0.93 → 0.0.95

package/dist/esm/index.native209.js

@@ -1,82 +1,81 @@
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function o(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index.native210.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 w(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
+function U(o, t, s) {
+  return o & t ^ ~o & s;
 }
-function r(e, ...t) {
-  if (!o(e))
-    throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+function _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
 }
-function h(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function l(e, t) {
-  r(e);
-  const n = t.outputLen;
-  if (e.length < n)
-    throw new Error("digestInto() expects output buffer of length at least " + n);
-}
-function a(e) {
-  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
-}
-function g(...e) {
-  for (let t = 0; t < e.length; t++)
-    e[t].fill(0);
-}
-function p(e) {
-  return new DataView(e.buffer, e.byteOffset, e.byteLength);
-}
-function b(e, t) {
-  return e << 32 - t | e >>> t;
-}
-const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function u(e) {
-  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
-}
-function c(e) {
-  for (let t = 0; t < e.length; t++)
-    e[t] = u(e[t]);
-  return e;
-}
-const x = i ? (e) => e : c;
-function s(e) {
-  if (typeof e != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(e));
-}
-function y(e) {
-  return typeof e == "string" && (e = s(e)), r(e), e;
-}
-class d {
-}
-function E(e) {
-  const t = (f) => e().update(y(f)).digest(), n = e();
-  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
+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 {
-  d as Hash,
-  r as abytes,
-  h as aexists,
-  w as anumber,
-  l as aoutput,
-  u as byteSwap,
-  c as byteSwap32,
-  g as clean,
-  E as createHasher,
-  p as createView,
-  o as isBytes,
-  i as isLE,
-  b as rotr,
-  x as swap32IfBE,
-  y as toBytes,
-  a as u32,
-  s as utf8ToBytes
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/esm/index.native21.js

@@ -1,7 +1,9 @@
-import { Analytics as n } from "./index.native2.js";
+import { Analytics as r } from "./index.native2.js";
 import "./index.native3.js";
-import { getCoreAuthManager as i } from "./index.native61.js";
-const o = async () => (n.sendActionCallEvent({ name: "is_signed_in" }), i().isSignedIn());
+import { getCoreAuthManager as t } from "./index.native62.js";
+import "@coinbase/cdp-api-client";
+import "viem";
+const s = async () => (r.sendActionCallEvent({ name: "get_current_user" }), t().getUser());
 export {
-  o as isSignedIn
+  s as getCurrentUser
 };

package/dist/esm/index.native210.js

@@ -1,4 +1,82 @@
-const o = "0.1.1";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function o(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function w(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error("positive integer expected, got " + e);
+}
+function r(e, ...t) {
+  if (!o(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+}
+function h(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function l(e, t) {
+  r(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
+}
+function a(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function g(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+function p(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function b(e, t) {
+  return e << 32 - t | e >>> t;
+}
+const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function u(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function c(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = u(e[t]);
+  return e;
+}
+const x = i ? (e) => e : c;
+function s(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function y(e) {
+  return typeof e == "string" && (e = s(e)), r(e), e;
+}
+class d {
+}
+function E(e) {
+  const t = (f) => e().update(y(f)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
+}
 export {
-  o as version
+  d as Hash,
+  r as abytes,
+  h as aexists,
+  w as anumber,
+  l as aoutput,
+  u as byteSwap,
+  c as byteSwap32,
+  g as clean,
+  E as createHasher,
+  p as createView,
+  o as isBytes,
+  i as isLE,
+  b as rotr,
+  x as swap32IfBE,
+  y as toBytes,
+  a as u32,
+  s as utf8ToBytes
 };

package/dist/esm/index.native211.js

@@ -1,111 +1,4 @@
-import { __module as x } from "./index.native212.js";
-var w;
-function O() {
-  return w ? x.exports : (w = 1, function(d) {
-    var g = Object.prototype.hasOwnProperty, c = "~";
-    function h() {
-    }
-    Object.create && (h.prototype = /* @__PURE__ */ Object.create(null), new h().__proto__ || (c = !1));
-    function b(s, t, n) {
-      this.fn = s, this.context = t, this.once = n || !1;
-    }
-    function m(s, t, n, r, l) {
-      if (typeof n != "function")
-        throw new TypeError("The listener must be a function");
-      var u = new b(n, r || s, l), o = c ? c + t : t;
-      return s._events[o] ? s._events[o].fn ? s._events[o] = [s._events[o], u] : s._events[o].push(u) : (s._events[o] = u, s._eventsCount++), s;
-    }
-    function y(s, t) {
-      --s._eventsCount === 0 ? s._events = new h() : delete s._events[t];
-    }
-    function f() {
-      this._events = new h(), this._eventsCount = 0;
-    }
-    f.prototype.eventNames = function() {
-      var t = [], n, r;
-      if (this._eventsCount === 0) return t;
-      for (r in n = this._events)
-        g.call(n, r) && t.push(c ? r.slice(1) : r);
-      return Object.getOwnPropertySymbols ? t.concat(Object.getOwnPropertySymbols(n)) : t;
-    }, f.prototype.listeners = function(t) {
-      var n = c ? c + t : t, r = this._events[n];
-      if (!r) return [];
-      if (r.fn) return [r.fn];
-      for (var l = 0, u = r.length, o = new Array(u); l < u; l++)
-        o[l] = r[l].fn;
-      return o;
-    }, f.prototype.listenerCount = function(t) {
-      var n = c ? c + t : t, r = this._events[n];
-      return r ? r.fn ? 1 : r.length : 0;
-    }, f.prototype.emit = function(t, n, r, l, u, o) {
-      var a = c ? c + t : t;
-      if (!this._events[a]) return !1;
-      var e = this._events[a], p = arguments.length, v, i;
-      if (e.fn) {
-        switch (e.once && this.removeListener(t, e.fn, void 0, !0), p) {
-          case 1:
-            return e.fn.call(e.context), !0;
-          case 2:
-            return e.fn.call(e.context, n), !0;
-          case 3:
-            return e.fn.call(e.context, n, r), !0;
-          case 4:
-            return e.fn.call(e.context, n, r, l), !0;
-          case 5:
-            return e.fn.call(e.context, n, r, l, u), !0;
-          case 6:
-            return e.fn.call(e.context, n, r, l, u, o), !0;
-        }
-        for (i = 1, v = new Array(p - 1); i < p; i++)
-          v[i - 1] = arguments[i];
-        e.fn.apply(e.context, v);
-      } else {
-        var E = e.length, _;
-        for (i = 0; i < E; i++)
-          switch (e[i].once && this.removeListener(t, e[i].fn, void 0, !0), p) {
-            case 1:
-              e[i].fn.call(e[i].context);
-              break;
-            case 2:
-              e[i].fn.call(e[i].context, n);
-              break;
-            case 3:
-              e[i].fn.call(e[i].context, n, r);
-              break;
-            case 4:
-              e[i].fn.call(e[i].context, n, r, l);
-              break;
-            default:
-              if (!v) for (_ = 1, v = new Array(p - 1); _ < p; _++)
-                v[_ - 1] = arguments[_];
-              e[i].fn.apply(e[i].context, v);
-          }
-      }
-      return !0;
-    }, f.prototype.on = function(t, n, r) {
-      return m(this, t, n, r, !1);
-    }, f.prototype.once = function(t, n, r) {
-      return m(this, t, n, r, !0);
-    }, f.prototype.removeListener = function(t, n, r, l) {
-      var u = c ? c + t : t;
-      if (!this._events[u]) return this;
-      if (!n)
-        return y(this, u), this;
-      var o = this._events[u];
-      if (o.fn)
-        o.fn === n && (!l || o.once) && (!r || o.context === r) && y(this, u);
-      else {
-        for (var a = 0, e = [], p = o.length; a < p; a++)
-          (o[a].fn !== n || l && !o[a].once || r && o[a].context !== r) && e.push(o[a]);
-        e.length ? this._events[u] = e.length === 1 ? e[0] : e : y(this, u);
-      }
-      return this;
-    }, f.prototype.removeAllListeners = function(t) {
-      var n;
-      return t ? (n = c ? c + t : t, this._events[n] && y(this, n)) : (this._events = new h(), this._eventsCount = 0), this;
-    }, f.prototype.off = f.prototype.removeListener, f.prototype.addListener = f.prototype.on, f.prefixed = c, f.EventEmitter = f, d.exports = f;
-  }(x), x.exports);
-}
+const o = "0.1.1";
 export {
-  O as __require
+  o as version
 };

package/dist/esm/index.native212.js

@@ -1,4 +1,111 @@
-var e = { exports: {} };
+import { __module as x } from "./index.native213.js";
+var w;
+function O() {
+  return w ? x.exports : (w = 1, function(d) {
+    var g = Object.prototype.hasOwnProperty, c = "~";
+    function h() {
+    }
+    Object.create && (h.prototype = /* @__PURE__ */ Object.create(null), new h().__proto__ || (c = !1));
+    function b(s, t, n) {
+      this.fn = s, this.context = t, this.once = n || !1;
+    }
+    function m(s, t, n, r, l) {
+      if (typeof n != "function")
+        throw new TypeError("The listener must be a function");
+      var u = new b(n, r || s, l), o = c ? c + t : t;
+      return s._events[o] ? s._events[o].fn ? s._events[o] = [s._events[o], u] : s._events[o].push(u) : (s._events[o] = u, s._eventsCount++), s;
+    }
+    function y(s, t) {
+      --s._eventsCount === 0 ? s._events = new h() : delete s._events[t];
+    }
+    function f() {
+      this._events = new h(), this._eventsCount = 0;
+    }
+    f.prototype.eventNames = function() {
+      var t = [], n, r;
+      if (this._eventsCount === 0) return t;
+      for (r in n = this._events)
+        g.call(n, r) && t.push(c ? r.slice(1) : r);
+      return Object.getOwnPropertySymbols ? t.concat(Object.getOwnPropertySymbols(n)) : t;
+    }, f.prototype.listeners = function(t) {
+      var n = c ? c + t : t, r = this._events[n];
+      if (!r) return [];
+      if (r.fn) return [r.fn];
+      for (var l = 0, u = r.length, o = new Array(u); l < u; l++)
+        o[l] = r[l].fn;
+      return o;
+    }, f.prototype.listenerCount = function(t) {
+      var n = c ? c + t : t, r = this._events[n];
+      return r ? r.fn ? 1 : r.length : 0;
+    }, f.prototype.emit = function(t, n, r, l, u, o) {
+      var a = c ? c + t : t;
+      if (!this._events[a]) return !1;
+      var e = this._events[a], p = arguments.length, v, i;
+      if (e.fn) {
+        switch (e.once && this.removeListener(t, e.fn, void 0, !0), p) {
+          case 1:
+            return e.fn.call(e.context), !0;
+          case 2:
+            return e.fn.call(e.context, n), !0;
+          case 3:
+            return e.fn.call(e.context, n, r), !0;
+          case 4:
+            return e.fn.call(e.context, n, r, l), !0;
+          case 5:
+            return e.fn.call(e.context, n, r, l, u), !0;
+          case 6:
+            return e.fn.call(e.context, n, r, l, u, o), !0;
+        }
+        for (i = 1, v = new Array(p - 1); i < p; i++)
+          v[i - 1] = arguments[i];
+        e.fn.apply(e.context, v);
+      } else {
+        var E = e.length, _;
+        for (i = 0; i < E; i++)
+          switch (e[i].once && this.removeListener(t, e[i].fn, void 0, !0), p) {
+            case 1:
+              e[i].fn.call(e[i].context);
+              break;
+            case 2:
+              e[i].fn.call(e[i].context, n);
+              break;
+            case 3:
+              e[i].fn.call(e[i].context, n, r);
+              break;
+            case 4:
+              e[i].fn.call(e[i].context, n, r, l);
+              break;
+            default:
+              if (!v) for (_ = 1, v = new Array(p - 1); _ < p; _++)
+                v[_ - 1] = arguments[_];
+              e[i].fn.apply(e[i].context, v);
+          }
+      }
+      return !0;
+    }, f.prototype.on = function(t, n, r) {
+      return m(this, t, n, r, !1);
+    }, f.prototype.once = function(t, n, r) {
+      return m(this, t, n, r, !0);
+    }, f.prototype.removeListener = function(t, n, r, l) {
+      var u = c ? c + t : t;
+      if (!this._events[u]) return this;
+      if (!n)
+        return y(this, u), this;
+      var o = this._events[u];
+      if (o.fn)
+        o.fn === n && (!l || o.once) && (!r || o.context === r) && y(this, u);
+      else {
+        for (var a = 0, e = [], p = o.length; a < p; a++)
+          (o[a].fn !== n || l && !o[a].once || r && o[a].context !== r) && e.push(o[a]);
+        e.length ? this._events[u] = e.length === 1 ? e[0] : e : y(this, u);
+      }
+      return this;
+    }, f.prototype.removeAllListeners = function(t) {
+      var n;
+      return t ? (n = c ? c + t : t, this._events[n] && y(this, n)) : (this._events = new h(), this._eventsCount = 0), this;
+    }, f.prototype.off = f.prototype.removeListener, f.prototype.addListener = f.prototype.on, f.prefixed = c, f.EventEmitter = f, d.exports = f;
+  }(x), x.exports);
+}
 export {
-  e as __module
+  O as __require
 };

package/dist/esm/index.native213.js

@@ -1,4 +1,4 @@
-const o = "2.33.0";
+var e = { exports: {} };
 export {
-  o as version
+  e as __module
 };

package/dist/esm/index.native214.js

@@ -1,23 +1,4 @@
-import { BaseError as o } from "./index.native148.js";
-class i extends o {
-  constructor({ offset: e }) {
-    super(`Offset \`${e}\` cannot be negative.`, {
-      name: "NegativeOffsetError"
-    });
-  }
-}
-class n extends o {
-  constructor({ length: e, position: r }) {
-    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
-  }
-}
-class c extends o {
-  constructor({ count: e, limit: r }) {
-    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
-  }
-}
+const o = "2.33.0";
 export {
-  i as NegativeOffsetError,
-  n as PositionOutOfBoundsError,
-  c as RecursiveReadLimitExceededError
+  o as version
 };

package/dist/esm/index.native215.js

@@ -1,22 +1,23 @@
-const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
-function s(t, r = !1) {
-  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+import { BaseError as o } from "./index.native149.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
+    });
+  }
+}
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  }
 }
-function h(t, r = !1) {
-  const n = t.length;
-  let l = new Uint32Array(n), c = new Uint32Array(n);
-  for (let e = 0; e < n; e++) {
-    const { h: u, l: f } = s(t[e], r);
-    [l[e], c[e]] = [u, f];
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
   }
-  return [l, c];
 }
-const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  s as fromBig,
-  B as rotlBH,
-  a as rotlBL,
-  m as rotlSH,
-  A as rotlSL,
-  h as split
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };

package/dist/esm/index.native216.js

@@ -1,35 +1,22 @@
-import { maxBytesPerTransaction as y, bytesPerBlob as a, fieldElementsPerBlob as f, bytesPerFieldElement as p } from "./index.native231.js";
-import { EmptyBlobError as c, BlobSizeTooLargeError as h } from "./index.native160.js";
-import { createCursor as B } from "./index.native149.js";
-import { size as u } from "./index.native144.js";
-import { hexToBytes as x } from "./index.native137.js";
-import { bytesToHex as d } from "./index.native135.js";
-function S(e) {
-  const m = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), i = typeof e.data == "string" ? x(e.data) : e.data, o = u(i);
-  if (!o)
-    throw new c();
-  if (o > y)
-    throw new h({
-      maxSize: y,
-      size: o
-    });
-  const s = [];
-  let n = !0, r = 0;
-  for (; n; ) {
-    const t = B(new Uint8Array(a));
-    let l = 0;
-    for (; l < f; ) {
-      const b = i.slice(r, r + (p - 1));
-      if (t.pushByte(0), t.pushBytes(b), b.length < 31) {
-        t.pushByte(128), n = !1;
-        break;
-      }
-      l++, r += 31;
-    }
-    s.push(t);
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function s(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  const n = t.length;
+  let l = new Uint32Array(n), c = new Uint32Array(n);
+  for (let e = 0; e < n; e++) {
+    const { h: u, l: f } = s(t[e], r);
+    [l[e], c[e]] = [u, f];
   }
-  return m === "bytes" ? s.map((t) => t.bytes) : s.map((t) => d(t.bytes));
+  return [l, c];
 }
+const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  S as toBlobs
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
 };

package/dist/esm/index.native217.js

@@ -1,9 +1,35 @@
-import { bytesToHex as i } from "./index.native135.js";
-import { sha256 as m } from "./index.native153.js";
-function f(t) {
-  const { commitment: e, version: s = 1 } = t, n = t.to ?? (typeof e == "string" ? "hex" : "bytes"), o = m(e);
-  return o.set([s], 0), n === "bytes" ? o : i(o);
+import { maxBytesPerTransaction as y, bytesPerBlob as a, fieldElementsPerBlob as f, bytesPerFieldElement as p } from "./index.native232.js";
+import { EmptyBlobError as c, BlobSizeTooLargeError as h } from "./index.native161.js";
+import { createCursor as B } from "./index.native150.js";
+import { size as u } from "./index.native145.js";
+import { hexToBytes as x } from "./index.native138.js";
+import { bytesToHex as d } from "./index.native136.js";
+function S(e) {
+  const m = e.to ?? (typeof e.data == "string" ? "hex" : "bytes"), i = typeof e.data == "string" ? x(e.data) : e.data, o = u(i);
+  if (!o)
+    throw new c();
+  if (o > y)
+    throw new h({
+      maxSize: y,
+      size: o
+    });
+  const s = [];
+  let n = !0, r = 0;
+  for (; n; ) {
+    const t = B(new Uint8Array(a));
+    let l = 0;
+    for (; l < f; ) {
+      const b = i.slice(r, r + (p - 1));
+      if (t.pushByte(0), t.pushBytes(b), b.length < 31) {
+        t.pushByte(128), n = !1;
+        break;
+      }
+      l++, r += 31;
+    }
+    s.push(t);
+  }
+  return m === "bytes" ? s.map((t) => t.bytes) : s.map((t) => d(t.bytes));
 }
 export {
-  f as commitmentToVersionedHash
+  S as toBlobs
 };