@gardenfi/utils 2.0.6-beta.7 → 2.0.6-beta.9

package/dist/index104.js

@@ -1,234 +1,9 @@
-/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
-function h(t) {
-  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
-}
-function b(t) {
-  if (!h(t))
-    throw new Error("Uint8Array expected");
-}
-function O(t, n) {
-  if (typeof n != "boolean")
-    throw new Error(t + " boolean expected, got " + n);
-}
-const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
-function B(t) {
-  b(t);
-  let n = "";
-  for (let r = 0; r < t.length; r++)
-    n += T[t[r]];
-  return n;
-}
-function S(t) {
-  const n = t.toString(16);
-  return n.length & 1 ? "0" + n : n;
-}
-function U(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  return t === "" ? d : BigInt("0x" + t);
-}
-const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
-function E(t) {
-  if (t >= s._0 && t <= s._9)
-    return t - s._0;
-  if (t >= s.A && t <= s.F)
-    return t - (s.A - 10);
-  if (t >= s.a && t <= s.f)
-    return t - (s.a - 10);
-}
-function m(t) {
-  if (typeof t != "string")
-    throw new Error("hex string expected, got " + typeof t);
-  const n = t.length, r = n / 2;
-  if (n % 2)
-    throw new Error("hex string expected, got unpadded hex of length " + n);
-  const e = new Uint8Array(r);
-  for (let o = 0, i = 0; o < r; o++, i += 2) {
-    const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
-    if (a === void 0 || f === void 0) {
-      const c = t[i] + t[i + 1];
-      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
-    }
-    e[o] = a * 16 + f;
-  }
-  return e;
-}
-function V(t) {
-  return U(B(t));
-}
-function H(t) {
-  return b(t), U(B(Uint8Array.from(t).reverse()));
-}
-function v(t, n) {
-  return m(t.toString(16).padStart(n * 2, "0"));
-}
-function C(t, n) {
-  return v(t, n).reverse();
-}
-function M(t) {
-  return m(S(t));
-}
-function R(t, n, r) {
-  let e;
-  if (typeof n == "string")
-    try {
-      e = m(n);
-    } catch (i) {
-      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
-    }
-  else if (h(n))
-    e = Uint8Array.from(n);
-  else
-    throw new Error(t + " must be hex string or Uint8Array");
-  const o = e.length;
-  if (typeof r == "number" && o !== r)
-    throw new Error(t + " of length " + r + " expected, got " + o);
-  return e;
-}
-function _(...t) {
-  let n = 0;
-  for (let e = 0; e < t.length; e++) {
-    const o = t[e];
-    b(o), n += o.length;
-  }
-  const r = new Uint8Array(n);
-  for (let e = 0, o = 0; e < t.length; e++) {
-    const i = t[e];
-    r.set(i, o), o += i.length;
-  }
-  return r;
-}
-function j(t, n) {
-  if (t.length !== n.length)
-    return !1;
-  let r = 0;
-  for (let e = 0; e < t.length; e++)
-    r |= t[e] ^ n[e];
-  return r === 0;
-}
-function z(t) {
-  if (typeof t != "string")
-    throw new Error("string expected");
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-const w = (t) => typeof t == "bigint" && d <= t;
-function N(t, n, r) {
-  return w(t) && w(n) && w(r) && n <= t && t < r;
-}
-function D(t, n, r, e) {
-  if (!N(n, r, e))
-    throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
-}
-function G(t) {
-  let n;
-  for (n = 0; t > d; t >>= y, n += 1)
-    ;
-  return n;
-}
-function P(t, n) {
-  return t >> BigInt(n) & y;
-}
-function W(t, n, r) {
-  return t | (r ? y : d) << BigInt(n);
-}
-const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
-function J(t, n, r) {
-  if (typeof t != "number" || t < 2)
-    throw new Error("hashLen must be a number");
-  if (typeof n != "number" || n < 2)
-    throw new Error("qByteLen must be a number");
-  if (typeof r != "function")
-    throw new Error("hmacFn must be a function");
-  let e = p(t), o = p(t), i = 0;
-  const a = () => {
-    e.fill(1), o.fill(0), i = 0;
-  }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
-    o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
-  }, x = () => {
-    if (i++ >= 1e3)
-      throw new Error("drbg: tried 1000 values");
-    let u = 0;
-    const l = [];
-    for (; u < n; ) {
-      e = f();
-      const g = e.slice();
-      l.push(g), u += e.length;
-    }
-    return _(...l);
-  };
-  return (u, l) => {
-    a(), c(u);
-    let g;
-    for (; !(g = l(x())); )
-      c();
-    return a(), g;
-  };
-}
-const k = {
-  bigint: (t) => typeof t == "bigint",
-  function: (t) => typeof t == "function",
-  boolean: (t) => typeof t == "boolean",
-  string: (t) => typeof t == "string",
-  stringOrUint8Array: (t) => typeof t == "string" || h(t),
-  isSafeInteger: (t) => Number.isSafeInteger(t),
-  array: (t) => Array.isArray(t),
-  field: (t, n) => n.Fp.isValid(t),
-  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
-};
-function K(t, n, r = {}) {
-  const e = (o, i, a) => {
-    const f = k[i];
-    if (typeof f != "function")
-      throw new Error("invalid validator function");
-    const c = t[o];
-    if (!(a && c === void 0) && !f(c, t))
-      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
-  };
-  for (const [o, i] of Object.entries(n))
-    e(o, i, !1);
-  for (const [o, i] of Object.entries(r))
-    e(o, i, !0);
-  return t;
-}
-const Q = () => {
-  throw new Error("not implemented");
-};
-function X(t) {
-  const n = /* @__PURE__ */ new WeakMap();
-  return (r, ...e) => {
-    const o = n.get(r);
-    if (o !== void 0)
-      return o;
-    const i = t(r, ...e);
-    return n.set(r, i), i;
-  };
+import { sha256 as o } from "./index88.js";
+import { isHex as s } from "./index84.js";
+import { toBytes as r } from "./index53.js";
+function p(t, i) {
+  return o(s(t, { strict: !1 }) ? r(t) : t);
 }
 export {
-  D as aInRange,
-  O as abool,
-  b as abytes,
-  P as bitGet,
-  G as bitLen,
-  q as bitMask,
-  W as bitSet,
-  B as bytesToHex,
-  V as bytesToNumberBE,
-  H as bytesToNumberLE,
-  _ as concatBytes,
-  J as createHmacDrbg,
-  R as ensureBytes,
-  j as equalBytes,
-  m as hexToBytes,
-  U as hexToNumber,
-  N as inRange,
-  h as isBytes,
-  X as memoized,
-  Q as notImplemented,
-  v as numberToBytesBE,
-  C as numberToBytesLE,
-  S as numberToHexUnpadded,
-  M as numberToVarBytesBE,
-  z as utf8ToBytes,
-  K as validateObject
+  p as sha256
 };

package/dist/index105.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index64.cjs"),y=require("./index104.cjs");/*! 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 E(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){E(e,r);const t=Math.ceil(r/e)+1,n=2**(e-1);return{windows:t,windowSize:n}}function O(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 x(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=new WeakMap,N=new WeakMap;function S(e){return N.get(e)||1}function L(e,r){return{constTimeNegate:m,hasPrecomputes(t){return S(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>I;)n&p&&(o=o.add(i)),i=i.double(),n>>=p;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,r),a=[];let c=t,d=c;for(let g=0;g<o;g++){d=c,a.push(d);for(let l=1;l<i;l++)d=d.add(c),a.push(d);c=d.double()}return a},wNAF(t,n,o){const{windows:i,windowSize:a}=b(t,r);let c=e.ZERO,d=e.BASE;const g=BigInt(2**t-1),l=2**t,w=BigInt(t);for(let u=0;u<i;u++){const s=u*a;let f=Number(o&g);o>>=w,f>a&&(f-=l,o+=p);const h=s,M=s+Math.abs(f)-1,F=u%2!==0,z=f<0;f===0?d=d.add(m(F,n[h])):c=c.add(m(z,n[M]))}return{p:c,f:d}},wNAFUnsafe(t,n,o,i=e.ZERO){const{windows:a,windowSize:c}=b(t,r),d=BigInt(2**t-1),g=2**t,l=BigInt(t);for(let w=0;w<a;w++){const u=w*c;if(o===I)break;let s=Number(o&d);if(o>>=l,s>c&&(s-=g,o+=p),s===0)continue;let f=n[u+Math.abs(s)-1];s<0&&(f=f.negate()),i=i.add(f)}return i},getPrecomputes(t,n,o){let i=B.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&B.set(n,o(i))),i},wNAFCached(t,n,o){const i=S(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const a=S(t);return a===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(a,this.getPrecomputes(a,t,o),n,i)},setWindowSize(t,n){E(n,r),N.set(t,n),B.delete(t)}}}function j(e,r,t,n){if(O(t,e),x(n,r),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=y.bitLen(BigInt(t.length)),a=i>12?i-3:i>4?i-2:i?2:1,c=(1<<a)-1,d=new Array(c+1).fill(o),g=Math.floor((r.BITS-1)/a)*a;let l=o;for(let w=g;w>=0;w-=a){d.fill(o);for(let s=0;s<n.length;s++){const f=n[s],h=Number(f>>BigInt(w)&BigInt(c));d[h]=d[h].add(t[s])}let u=o;for(let s=d.length-1,f=o;s>0;s--)f=f.add(d[s]),u=u.add(f);if(l=l.add(u),w!==0)for(let s=0;s<a;s++)l=l.double()}return l}function k(e){return A.validateField(e.Fp),y.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=j;exports.validateBasic=k;exports.wNAF=L;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=6,s=32,e=4096,n=s*e,o=n*t-1-1*e*t;exports.bytesPerBlob=n;exports.bytesPerFieldElement=s;exports.fieldElementsPerBlob=e;exports.maxBytesPerTransaction=o;

package/dist/index105.js

@@ -1,175 +1,7 @@
-import { validateField as z, nLength as F } from "./index64.js";
-import { validateObject as x, bitLen as O } from "./index104.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 = 32, s = 4096, t = 131072, l = 761855;
 export {
-  Z as pippenger,
-  U as validateBasic,
-  v as wNAF
+  t as bytesPerBlob,
+  e as bytesPerFieldElement,
+  s as fieldElementsPerBlob,
+  l as maxBytesPerTransaction
 };

package/dist/index106.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index65.cjs");class i extends t.BaseError{constructor({offset:r,position:s,size:e}){super(`Slice ${s==="start"?"starting":"ending"} at offset "${r}" is out-of-bounds (size: ${e}).`,{name:"SliceOffsetOutOfBoundsError"})}}class d extends t.BaseError{constructor({size:r,targetSize:s,type:e}){super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`,{name:"SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=d;exports.SliceOffsetOutOfBoundsError=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index108.cjs"),s=require("./index64.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/index106.js

@@ -1,15 +1,40 @@
-import { BaseError as o } from "./index65.js";
-class d extends o {
-  constructor({ offset: r, position: s, size: e }) {
-    super(`Slice ${s === "start" ? "starting" : "ending"} at offset "${r}" is out-of-bounds (size: ${e}).`, { name: "SliceOffsetOutOfBoundsError" });
+import { versionedHashVersionKzg as a } from "./index108.js";
+import { BaseError as s } from "./index64.js";
+class t extends s {
+  constructor({ maxSize: e, size: r }) {
+    super("Blob size is too large.", {
+      metaMessages: [`Max: ${e} bytes`, `Given: ${r} bytes`],
+      name: "BlobSizeTooLargeError"
+    });
   }
 }
-class n extends o {
-  constructor({ size: r, targetSize: s, type: e }) {
-    super(`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()} size (${r}) exceeds padding size (${s}).`, { name: "SizeExceedsPaddingSizeError" });
+class d extends s {
+  constructor() {
+    super("Blob data must not be empty.", { name: "EmptyBlobError" });
+  }
+}
+class l extends s {
+  constructor({ hash: e, size: r }) {
+    super(`Versioned hash "${e}" size is invalid.`, {
+      metaMessages: ["Expected: 32", `Received: ${r}`],
+      name: "InvalidVersionedHashSizeError"
+    });
+  }
+}
+class c extends s {
+  constructor({ hash: e, version: r }) {
+    super(`Versioned hash "${e}" version is invalid.`, {
+      metaMessages: [
+        `Expected: ${a}`,
+        `Received: ${r}`
+      ],
+      name: "InvalidVersionedHashVersionError"
+    });
   }
 }
 export {
-  n as SizeExceedsPaddingSizeError,
-  d as SliceOffsetOutOfBoundsError
+  t as BlobSizeTooLargeError,
+  d as EmptyBlobError,
+  l as InvalidVersionedHashSizeError,
+  c as InvalidVersionedHashVersionError
 };

package/dist/index107.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;
+"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;

package/dist/index107.js

@@ -1,21 +1,130 @@
-const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
-function f(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) {
-  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
-  for (let e = 0; e < t.length; e++) {
-    const { h: c, l: u } = f(t[e], r);
-    [n[e], l[e]] = [c, u];
+import { RecursiveReadLimitExceededError as e, PositionOutOfBoundsError as n, NegativeOffsetError as o } 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 e({
+        count: this.recursiveReadCount + 1,
+        limit: this.recursiveReadLimit
+      });
+  },
+  assertPosition(t) {
+    if (t < 0 || t > this.bytes.length - 1)
+      throw new n({
+        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++;
   }
-  return [n, l];
+};
+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;
 }
-const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  f as fromBig,
-  A as rotlBH,
-  B as rotlBL,
-  g as rotlSH,
-  m as rotlSL,
-  h as split
+  a as createCursor
 };

package/dist/index108.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 e=1;exports.versionedHashVersionKzg=e;

package/dist/index108.js

@@ -1,5 +1,4 @@
-const e = `Ethereum Signed Message:
-`;
+const e = 1;
 export {
-  e as presignMessagePrefix
+  e as versionedHashVersionKzg
 };

package/dist/index109.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index116.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"});const e=`Ethereum Signed Message:
+`;exports.presignMessagePrefix=e;