@gardenfi/utils 2.1.2-beta.7 → 2.1.2-beta.8

package/dist/index93.js

@@ -1,175 +1,7 @@
-import { validateField as z, nLength as F } from "./index54.js";
-import { validateObject as x, bitLen as O } from "./index55.js";
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const I = BigInt(0), p = BigInt(1);
-function m(e, r) {
-  const t = r.negate();
-  return e ? t : r;
-}
-function A(e, r) {
-  if (!Number.isSafeInteger(e) || e <= 0 || e > r)
-    throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
-}
-function b(e, r) {
-  A(e, r);
-  const t = Math.ceil(r / e) + 1, n = 2 ** (e - 1);
-  return { windows: t, windowSize: n };
-}
-function L(e, r) {
-  if (!Array.isArray(e))
-    throw new Error("array expected");
-  e.forEach((t, n) => {
-    if (!(t instanceof r))
-      throw new Error("invalid point at index " + n);
-  });
-}
-function k(e, r) {
-  if (!Array.isArray(e))
-    throw new Error("array of scalars expected");
-  e.forEach((t, n) => {
-    if (!r.isValid(t))
-      throw new Error("invalid scalar at index " + n);
-  });
-}
-const B = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
-function S(e) {
-  return E.get(e) || 1;
-}
-function v(e, r) {
-  return {
-    constTimeNegate: m,
-    hasPrecomputes(t) {
-      return S(t) !== 1;
-    },
-    // non-const time multiplication ladder
-    unsafeLadder(t, n, i = e.ZERO) {
-      let o = t;
-      for (; n > I; )
-        n & p && (i = i.add(o)), o = o.double(), n >>= p;
-      return i;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @param elm Point instance
-     * @param W window size
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(t, n) {
-      const { windows: i, windowSize: o } = b(n, r), a = [];
-      let c = t, d = c;
-      for (let h = 0; h < i; h++) {
-        d = c, a.push(d);
-        for (let w = 1; w < o; w++)
-          d = d.add(c), a.push(d);
-        c = d.double();
-      }
-      return a;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(t, n, i) {
-      const { windows: o, windowSize: a } = b(t, r);
-      let c = e.ZERO, d = e.BASE;
-      const h = BigInt(2 ** t - 1), w = 2 ** t, l = BigInt(t);
-      for (let u = 0; u < o; u++) {
-        const s = u * a;
-        let f = Number(i & h);
-        i >>= l, f > a && (f -= w, i += p);
-        const g = s, N = s + Math.abs(f) - 1, y = u % 2 !== 0, M = f < 0;
-        f === 0 ? d = d.add(m(y, n[g])) : c = c.add(m(M, n[N]));
-      }
-      return { p: c, f: d };
-    },
-    /**
-     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @param acc accumulator point to add result of multiplication
-     * @returns point
-     */
-    wNAFUnsafe(t, n, i, o = e.ZERO) {
-      const { windows: a, windowSize: c } = b(t, r), d = BigInt(2 ** t - 1), h = 2 ** t, w = BigInt(t);
-      for (let l = 0; l < a; l++) {
-        const u = l * c;
-        if (i === I)
-          break;
-        let s = Number(i & d);
-        if (i >>= w, s > c && (s -= h, i += p), s === 0)
-          continue;
-        let f = n[u + Math.abs(s) - 1];
-        s < 0 && (f = f.negate()), o = o.add(f);
-      }
-      return o;
-    },
-    getPrecomputes(t, n, i) {
-      let o = B.get(n);
-      return o || (o = this.precomputeWindow(n, t), t !== 1 && B.set(n, i(o))), o;
-    },
-    wNAFCached(t, n, i) {
-      const o = S(t);
-      return this.wNAF(o, this.getPrecomputes(o, t, i), n);
-    },
-    wNAFCachedUnsafe(t, n, i, o) {
-      const a = S(t);
-      return a === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, t, i), n, o);
-    },
-    // We calculate precomputes for elliptic curve point multiplication
-    // using windowed method. This specifies window size and
-    // stores precomputed values. Usually only base point would be precomputed.
-    setWindowSize(t, n) {
-      A(n, r), E.set(t, n), B.delete(t);
-    }
-  };
-}
-function Z(e, r, t, n) {
-  if (L(t, e), k(n, r), t.length !== n.length)
-    throw new Error("arrays of points and scalars must have equal length");
-  const i = e.ZERO, o = O(BigInt(t.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, c = (1 << a) - 1, d = new Array(c + 1).fill(i), h = Math.floor((r.BITS - 1) / a) * a;
-  let w = i;
-  for (let l = h; l >= 0; l -= a) {
-    d.fill(i);
-    for (let s = 0; s < n.length; s++) {
-      const f = n[s], g = Number(f >> BigInt(l) & BigInt(c));
-      d[g] = d[g].add(t[s]);
-    }
-    let u = i;
-    for (let s = d.length - 1, f = i; s > 0; s--)
-      f = f.add(d[s]), u = u.add(f);
-    if (w = w.add(u), l !== 0)
-      for (let s = 0; s < a; s++)
-        w = w.double();
-  }
-  return w;
-}
-function U(e) {
-  return z(e.Fp), x(e, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...F(e.n, e.nBitLength),
-    ...e,
-    p: e.Fp.ORDER
-  });
-}
+const e = {
+  ether: -9,
+  wei: 9
+};
 export {
-  Z as pippenger,
-  U as validateBasic,
-  v as wNAF
+  e as gweiUnits
 };

package/dist/index94.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index103.cjs"),e={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new o.RecursiveReadLimitExceededError({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new o.PositionOutOfBoundsError({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new o.NegativeOffsetError({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.NegativeOffsetError({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++}};function n(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(e);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}exports.createCursor=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(r,i){let t=r.toString();const n=t.startsWith("-");n&&(t=t.slice(1)),t=t.padStart(i,"0");let[l,e]=[t.slice(0,t.length-i),t.slice(t.length-i)];return e=e.replace(/(0+)$/,""),`${n?"-":""}${l||"0"}${e?`.${e}`:""}`}exports.formatUnits=o;

package/dist/index94.js

@@ -1,130 +1,13 @@
-import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index103.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++;
-  }
-};
-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;
+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 {
-  a as createCursor
+  a as formatUnits
 };

package/dist/index95.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=`Ethereum Signed Message:
-`;exports.presignMessagePrefix=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index99.cjs"),e={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new o.RecursiveReadLimitExceededError({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new o.PositionOutOfBoundsError({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new o.NegativeOffsetError({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.NegativeOffsetError({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++}};function n(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(e);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}exports.createCursor=n;

package/dist/index95.js

@@ -1,5 +1,130 @@
-const e = `Ethereum Signed Message:
-`;
+import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index99.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++;
+  }
+};
+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 {
-  e as presignMessagePrefix
+  a as createCursor
 };

package/dist/index96.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=1;exports.versionedHashVersionKzg=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index76.cjs"),s=require("./index69.cjs"),r=require("./index38.cjs");function o(t,i){return e.sha256(s.isHex(t,{strict:!1})?r.toBytes(t):t)}exports.sha256=o;

package/dist/index96.js

@@ -1,4 +1,9 @@
-const e = 1;
+import { sha256 as o } from "./index76.js";
+import { isHex as s } from "./index69.js";
+import { toBytes as r } from "./index38.js";
+function p(t, i) {
+  return o(s(t, { strict: !1 }) ? r(t) : t);
+}
 export {
-  e as versionedHashVersionKzg
+  p as sha256
 };

package/dist/index97.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=2n**256n-1n;exports.maxUint256=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=1;exports.versionedHashVersionKzg=e;

package/dist/index97.js

@@ -1,4 +1,4 @@
-const n = 2n ** 256n - 1n;
+const e = 1;
 export {
-  n as maxUint256
+  e as versionedHashVersionKzg
 };

package/dist/index98.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index96.cjs"),s=require("./index56.cjs");class i extends s.BaseError{constructor({maxSize:e,size:r}){super("Blob size is too large.",{metaMessages:[`Max: ${e} bytes`,`Given: ${r} bytes`],name:"BlobSizeTooLargeError"})}}class n extends s.BaseError{constructor(){super("Blob data must not be empty.",{name:"EmptyBlobError"})}}class t extends s.BaseError{constructor({hash:e,size:r}){super(`Versioned hash "${e}" size is invalid.`,{metaMessages:["Expected: 32",`Received: ${r}`],name:"InvalidVersionedHashSizeError"})}}class d extends s.BaseError{constructor({hash:e,version:r}){super(`Versioned hash "${e}" version is invalid.`,{metaMessages:[`Expected: ${a.versionedHashVersionKzg}`,`Received: ${r}`],name:"InvalidVersionedHashVersionError"})}}exports.BlobSizeTooLargeError=i;exports.EmptyBlobError=n;exports.InvalidVersionedHashSizeError=t;exports.InvalidVersionedHashVersionError=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index97.cjs"),s=require("./index48.cjs");class i extends s.BaseError{constructor({maxSize:e,size:r}){super("Blob size is too large.",{metaMessages:[`Max: ${e} bytes`,`Given: ${r} bytes`],name:"BlobSizeTooLargeError"})}}class n extends s.BaseError{constructor(){super("Blob data must not be empty.",{name:"EmptyBlobError"})}}class t extends s.BaseError{constructor({hash:e,size:r}){super(`Versioned hash "${e}" size is invalid.`,{metaMessages:["Expected: 32",`Received: ${r}`],name:"InvalidVersionedHashSizeError"})}}class d extends s.BaseError{constructor({hash:e,version:r}){super(`Versioned hash "${e}" version is invalid.`,{metaMessages:[`Expected: ${a.versionedHashVersionKzg}`,`Received: ${r}`],name:"InvalidVersionedHashVersionError"})}}exports.BlobSizeTooLargeError=i;exports.EmptyBlobError=n;exports.InvalidVersionedHashSizeError=t;exports.InvalidVersionedHashVersionError=d;

package/dist/index98.js

@@ -1,5 +1,5 @@
-import { versionedHashVersionKzg as a } from "./index96.js";
-import { BaseError as s } from "./index56.js";
+import { versionedHashVersionKzg as a } from "./index97.js";
+import { BaseError as s } from "./index48.js";
 class t extends s {
   constructor({ maxSize: e, size: r }) {
     super("Blob size is too large.", {

package/dist/index99.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index90.cjs"),O=require("./index59.cjs"),n=require("./index74.cjs");function p(i,e,s,{strict:f}={}){return O.isHex(i,{strict:!1})?l(i,e,s,{strict:f}):u(i,e,s,{strict:f})}function r(i,e){if(typeof e=="number"&&e>0&&e>n.size(i)-1)throw new t.SliceOffsetOutOfBoundsError({offset:e,position:"start",size:n.size(i)})}function c(i,e,s){if(typeof e=="number"&&typeof s=="number"&&n.size(i)!==s-e)throw new t.SliceOffsetOutOfBoundsError({offset:s,position:"end",size:n.size(i)})}function u(i,e,s,{strict:f}={}){r(i,e);const o=i.slice(e,s);return f&&c(o,e,s),o}function l(i,e,s,{strict:f}={}){r(i,e);const o=`0x${i.replace("0x","").slice((e??0)*2,(s??i.length)*2)}`;return f&&c(o,e,s),o}exports.slice=p;exports.sliceBytes=u;exports.sliceHex=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index48.cjs");class t extends o.BaseError{constructor({offset:e}){super(`Offset \`${e}\` cannot be negative.`,{name:"NegativeOffsetError"})}}class i extends o.BaseError{constructor({length:e,position:r}){super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`,{name:"PositionOutOfBoundsError"})}}class n extends o.BaseError{constructor({count:e,limit:r}){super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`,{name:"RecursiveReadLimitExceededError"})}}exports.NegativeOffsetError=t;exports.PositionOutOfBoundsError=i;exports.RecursiveReadLimitExceededError=n;

package/dist/index99.js

@@ -1,41 +1,23 @@
-import { SliceOffsetOutOfBoundsError as t } from "./index90.js";
-import { isHex as p } from "./index59.js";
-import { size as r } from "./index74.js";
-function w(e, f, i, { strict: o } = {}) {
-  return p(e, { strict: !1 }) ? u(e, f, i, {
-    strict: o
-  }) : m(e, f, i, {
-    strict: o
-  });
-}
-function s(e, f) {
-  if (typeof f == "number" && f > 0 && f > r(e) - 1)
-    throw new t({
-      offset: f,
-      position: "start",
-      size: r(e)
-    });
-}
-function c(e, f, i) {
-  if (typeof f == "number" && typeof i == "number" && r(e) !== i - f)
-    throw new t({
-      offset: i,
-      position: "end",
-      size: r(e)
+import { BaseError as o } from "./index48.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
     });
+  }
 }
-function m(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = e.slice(f, i);
-  return o && c(n, f, i), n;
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  }
 }
-function u(e, f, i, { strict: o } = {}) {
-  s(e, f);
-  const n = `0x${e.replace("0x", "").slice((f ?? 0) * 2, (i ?? e.length) * 2)}`;
-  return o && c(n, f, i), n;
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+  }
 }
 export {
-  w as slice,
-  m as sliceBytes,
-  u as sliceHex
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gardenfi/utils",
-  "version": "2.1.2-beta.7",
+  "version": "2.1.2-beta.8",
   "type": "module",
   "scripts": {
     "build": "vite build",