@gardenfi/utils 2.4.6 → 2.5.0

package/dist/index282.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index301.cjs"),$=require("./index302.cjs"),o=require("./index303.cjs"),E=new TextEncoder,h=Array.from({length:256},(r,e)=>e.toString(16).padStart(2,"0"));function x(r,e={}){const{strict:t=!1}=e;if(!r)throw new c(r);if(typeof r!="string")throw new c(r);if(t&&!/^0x[0-9a-fA-F]*$/.test(r))throw new f(r);if(!r.startsWith("0x"))throw new f(r)}function y(...r){return`0x${r.reduce((e,t)=>e+t.replace("0x",""),"")}`}function O(r,e={}){const t=`0x${Number(r)}`;return typeof e.size=="number"?(o.assertSize(t,e.size),l(t,e.size)):t}function b(r,e={}){let t="";for(let i=0;i<r.length;i++)t+=h[r[i]];const n=`0x${t}`;return typeof e.size=="number"?(o.assertSize(n,e.size),m(n,e.size)):n}function S(r,e={}){const{signed:t,size:n}=e,i=BigInt(r);let s;n?t?s=(1n<<BigInt(n)*8n-1n)-1n:s=2n**(BigInt(n)*8n)-1n:typeof r=="number"&&(s=BigInt(Number.MAX_SAFE_INTEGER));const d=typeof s=="bigint"&&t?-s-1n:0;if(s&&i>s||i<d){const u=typeof r=="bigint"?"n":"";throw new p({max:s?`${s}${u}`:void 0,min:`${d}${u}`,signed:t,size:n,value:`${r}${u}`})}const g=`0x${(t&&i<0?(1n<<BigInt(n*8))+BigInt(i):i).toString(16)}`;return n?l(g,n):g}function z(r,e={}){return b(E.encode(r),e)}function l(r,e){return o.pad(r,{dir:"left",size:e})}function m(r,e){return o.pad(r,{dir:"right",size:e})}function w(r,e,t,n={}){const{strict:i}=n;o.assertStartOffset(r,e);const s=`0x${r.replace("0x","").slice((e??0)*2,(t??r.length)*2)}`;return i&&o.assertEndOffset(s,e,t),s}function B(r){return Math.ceil((r.length-2)/2)}function I(r,e={}){const{strict:t=!1}=e;try{return x(r,{strict:t}),!0}catch{return!1}}class p extends a.BaseError{constructor({max:e,min:t,signed:n,size:i,value:s}){super(`Number \`${s}\` is not in safe${i?` ${i*8}-bit`:""}${n?" signed":" unsigned"} integer range ${e?`(\`${t}\` to \`${e}\`)`:`(above \`${t}\`)`}`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Hex.IntegerOutOfRangeError"})}}class c extends a.BaseError{constructor(e){super(`Value \`${typeof e=="object"?$.stringify(e):e}\` of type \`${typeof e}\` is an invalid hex type.`,{metaMessages:['Hex types must be represented as `"0x${string}"`.']}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Hex.InvalidHexTypeError"})}}class f extends a.BaseError{constructor(e){super(`Value \`${e}\` is an invalid hex value.`,{metaMessages:['Hex values must start with `"0x"` and contain only hexadecimal characters (0-9, a-f, A-F).']}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Hex.InvalidHexValueError"})}}class H extends a.BaseError{constructor({givenSize:e,maxSize:t}){super(`Size cannot exceed \`${t}\` bytes. Given size: \`${e}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Hex.SizeOverflowError"})}}class v extends a.BaseError{constructor({offset:e,position:t,size:n}){super(`Slice ${t==="start"?"starting":"ending"} at offset \`${e}\` is out-of-bounds (size: \`${n}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Hex.SliceOffsetOutOfBoundsError"})}}class P extends a.BaseError{constructor({size:e,targetSize:t,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${e}\`) exceeds padding size (\`${t}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Hex.SizeExceedsPaddingSizeError"})}}exports.IntegerOutOfRangeError=p;exports.InvalidHexTypeError=c;exports.InvalidHexValueError=f;exports.SizeExceedsPaddingSizeError=P;exports.SizeOverflowError=H;exports.SliceOffsetOutOfBoundsError=v;exports.assert=x;exports.concat=y;exports.fromBoolean=O;exports.fromBytes=b;exports.fromNumber=S;exports.fromString=z;exports.padLeft=l;exports.padRight=m;exports.size=B;exports.slice=w;exports.validate=I;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index301.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(r,t){const e=s=>a.weierstrass({...r,hash:s});return{...e(t),create:e}}exports.createCurve=c;

package/dist/index282.js

@@ -1,158 +1,9 @@
-import { BaseError as o } from "./index301.js";
-import { stringify as b } from "./index302.js";
-import { pad as d, assertEndOffset as m, assertSize as g, assertStartOffset as p } from "./index303.js";
-const $ = /* @__PURE__ */ new TextEncoder(), h = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
-function y(t, e = {}) {
-  const { strict: r = !1 } = e;
-  if (!t)
-    throw new f(t);
-  if (typeof t != "string")
-    throw new f(t);
-  if (r && !/^0x[0-9a-fA-F]*$/.test(t))
-    throw new l(t);
-  if (!t.startsWith("0x"))
-    throw new l(t);
-}
-function B(...t) {
-  return `0x${t.reduce((e, r) => e + r.replace("0x", ""), "")}`;
-}
-function P(t, e = {}) {
-  const r = `0x${Number(t)}`;
-  return typeof e.size == "number" ? (g(r, e.size), x(r, e.size)) : r;
-}
-function w(t, e = {}) {
-  let r = "";
-  for (let i = 0; i < t.length; i++)
-    r += h[t[i]];
-  const n = `0x${r}`;
-  return typeof e.size == "number" ? (g(n, e.size), E(n, e.size)) : n;
-}
-function V(t, e = {}) {
-  const { signed: r, size: n } = e, i = BigInt(t);
-  let s;
-  n ? r ? s = (1n << BigInt(n) * 8n - 1n) - 1n : s = 2n ** (BigInt(n) * 8n) - 1n : typeof t == "number" && (s = BigInt(Number.MAX_SAFE_INTEGER));
-  const u = typeof s == "bigint" && r ? -s - 1n : 0;
-  if (s && i > s || i < u) {
-    const a = typeof t == "bigint" ? "n" : "";
-    throw new O({
-      max: s ? `${s}${a}` : void 0,
-      min: `${u}${a}`,
-      signed: r,
-      size: n,
-      value: `${t}${a}`
-    });
-  }
-  const c = `0x${(r && i < 0 ? (1n << BigInt(n * 8)) + BigInt(i) : i).toString(16)}`;
-  return n ? x(c, n) : c;
-}
-function j(t, e = {}) {
-  return w($.encode(t), e);
-}
-function x(t, e) {
-  return d(t, { dir: "left", size: e });
-}
-function E(t, e) {
-  return d(t, { dir: "right", size: e });
-}
-function v(t, e, r, n = {}) {
-  const { strict: i } = n;
-  p(t, e);
-  const s = `0x${t.replace("0x", "").slice((e ?? 0) * 2, (r ?? t.length) * 2)}`;
-  return i && m(s, e, r), s;
-}
-function A(t) {
-  return Math.ceil((t.length - 2) / 2);
-}
-function N(t, e = {}) {
-  const { strict: r = !1 } = e;
-  try {
-    return y(t, { strict: r }), !0;
-  } catch {
-    return !1;
-  }
-}
-class O extends o {
-  constructor({ max: e, min: r, signed: n, size: i, value: s }) {
-    super(`Number \`${s}\` is not in safe${i ? ` ${i * 8}-bit` : ""}${n ? " signed" : " unsigned"} integer range ${e ? `(\`${r}\` to \`${e}\`)` : `(above \`${r}\`)`}`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Hex.IntegerOutOfRangeError"
-    });
-  }
-}
-class f extends o {
-  constructor(e) {
-    super(`Value \`${typeof e == "object" ? b(e) : e}\` of type \`${typeof e}\` is an invalid hex type.`, {
-      metaMessages: ['Hex types must be represented as `"0x${string}"`.']
-    }), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Hex.InvalidHexTypeError"
-    });
-  }
-}
-class l extends o {
-  constructor(e) {
-    super(`Value \`${e}\` is an invalid hex value.`, {
-      metaMessages: [
-        'Hex values must start with `"0x"` and contain only hexadecimal characters (0-9, a-f, A-F).'
-      ]
-    }), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Hex.InvalidHexValueError"
-    });
-  }
-}
-class _ extends o {
-  constructor({ givenSize: e, maxSize: r }) {
-    super(`Size cannot exceed \`${r}\` bytes. Given size: \`${e}\` bytes.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Hex.SizeOverflowError"
-    });
-  }
-}
-class M extends o {
-  constructor({ offset: e, position: r, size: n }) {
-    super(`Slice ${r === "start" ? "starting" : "ending"} at offset \`${e}\` is out-of-bounds (size: \`${n}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Hex.SliceOffsetOutOfBoundsError"
-    });
-  }
-}
-class R extends o {
-  constructor({ size: e, targetSize: r, type: n }) {
-    super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${e}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Hex.SizeExceedsPaddingSizeError"
-    });
-  }
+import { weierstrass as s } from "./index301.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function c(e, t) {
+  const r = (o) => s({ ...e, hash: o });
+  return { ...r(t), create: r };
 }
 export {
-  O as IntegerOutOfRangeError,
-  f as InvalidHexTypeError,
-  l as InvalidHexValueError,
-  R as SizeExceedsPaddingSizeError,
-  _ as SizeOverflowError,
-  M as SliceOffsetOutOfBoundsError,
-  y as assert,
-  B as concat,
-  P as fromBoolean,
-  w as fromBytes,
-  V as fromNumber,
-  j as fromString,
-  x as padLeft,
-  E as padRight,
-  A as size,
-  v as slice,
-  N as validate
+  c as createCurve
 };

package/dist/index283.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index282.cjs");function r(e){return{address:e.address,amount:o.fromNumber(e.amount),index:o.fromNumber(e.index),validatorIndex:o.fromNumber(e.validatorIndex)}}exports.toRpc=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./index302.cjs"),V=require("./index288.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const g=BigInt(0),d=BigInt(1),b=BigInt(2),K=BigInt(3),I=BigInt(4),T=BigInt(5),_=BigInt(8);function h(t,n){const o=t%n;return o>=g?o:n+o}function Q(t,n,o){let r=t;for(;n-- >g;)r*=r,r%=o;return r}function v(t,n){if(t===g)throw new Error("invert: expected non-zero number");if(n<=g)throw new Error("invert: expected positive modulus, got "+n);let o=h(t,n),r=n,s=g,c=d;for(;o!==g;){const u=r/o,i=r%o,a=s-c*u;r=o,o=i,s=c,c=a}if(r!==d)throw new Error("invert: does not exist");return h(s,n)}function L(t,n){const o=(t.ORDER+d)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function Y(t,n){const o=(t.ORDER-T)/_,r=t.mul(n,b),s=t.pow(r,o),c=t.mul(n,s),f=t.mul(t.mul(c,b),s),u=t.mul(c,t.sub(f,t.ONE));if(!t.eql(t.sqr(u),n))throw new Error("Cannot find square root");return u}function x(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-d,o=0;for(;n%b===g;)n/=b,o++;let r=b;const s=Z(t);for(;y(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(o===1)return L;let c=s.pow(r,n);const f=(n+d)/b;return function(i,a){if(i.is0(a))return a;if(y(i,a)!==1)throw new Error("Cannot find square root");let e=o,l=i.mul(i.ONE,c),q=i.pow(a,n),B=i.pow(a,f);for(;!i.eql(q,i.ONE);){if(i.is0(q))return i.ZERO;let m=1,E=i.sqr(q);for(;!i.eql(E,i.ONE);)if(m++,E=i.sqr(E),m===e)throw new Error("Cannot find square root");const H=d<<BigInt(e-m-1),S=i.pow(l,H);e=m,l=i.sqr(S),q=i.mul(q,l),B=i.mul(B,S)}return B}}function M(t){return t%I===K?L:t%_===T?Y:x(t)}const k=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function P(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"},o=k.reduce((r,s)=>(r[s]="function",r),n);return w._validateObject(t,o),t}function j(t,n,o){if(o<g)throw new Error("invalid exponent, negatives unsupported");if(o===g)return t.ONE;if(o===d)return n;let r=t.ONE,s=n;for(;o>g;)o&d&&(r=t.mul(r,s)),s=t.sqr(s),o>>=d;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((f,u,i)=>t.is0(u)?f:(r[i]=f,t.mul(f,u)),t.ONE),c=t.inv(s);return n.reduceRight((f,u,i)=>t.is0(u)?f:(r[i]=t.mul(f,r[i]),t.mul(f,u)),c),r}function y(t,n){const o=(t.ORDER-d)/b,r=t.pow(n,o),s=t.eql(r,t.ONE),c=t.eql(r,t.ZERO),f=t.eql(r,t.neg(t.ONE));if(!s&&!c&&!f)throw new Error("invalid Legendre symbol result");return s?1:c?0:-1}function C(t,n){n!==void 0&&V.anumber(n);const o=n!==void 0?n:t.toString(2).length,r=Math.ceil(o/8);return{nBitLength:o,nByteLength:r}}function Z(t,n,o=!1,r={}){if(t<=g)throw new Error("invalid field: expected ORDER > 0, got "+t);let s,c;if(typeof n=="object"&&n!=null){if(r.sqrt||o)throw new Error("cannot specify opts in two arguments");const e=n;e.BITS&&(s=e.BITS),e.sqrt&&(c=e.sqrt),typeof e.isLE=="boolean"&&(o=e.isLE)}else typeof n=="number"&&(s=n),r.sqrt&&(c=r.sqrt);const{nBitLength:f,nByteLength:u}=C(t,s);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let i;const a=Object.freeze({ORDER:t,isLE:o,BITS:f,BYTES:u,MASK:w.bitMask(f),ZERO:g,ONE:d,create:e=>h(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return g<=e&&e<t},is0:e=>e===g,isValidNot0:e=>!a.is0(e)&&a.isValid(e),isOdd:e=>(e&d)===d,neg:e=>h(-e,t),eql:(e,l)=>e===l,sqr:e=>h(e*e,t),add:(e,l)=>h(e+l,t),sub:(e,l)=>h(e-l,t),mul:(e,l)=>h(e*l,t),pow:(e,l)=>j(a,e,l),div:(e,l)=>h(e*v(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>v(e,t),sqrt:c||(e=>(i||(i=M(t)),i(a,e))),toBytes:e=>o?w.numberToBytesLE(e,u):w.numberToBytesBE(e,u),fromBytes:e=>{if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);return o?w.bytesToNumberLE(e):w.bytesToNumberBE(e)},invertBatch:e=>A(a,e),cmov:(e,l,q)=>q?l:e});return Object.freeze(a)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function z(t){const n=N(t);return n+Math.ceil(n/2)}function $(t,n,o=!1){const r=t.length,s=N(n),c=z(n);if(r<16||r<c||r>1024)throw new Error("expected "+c+"-1024 bytes of input, got "+r);const f=o?w.bytesToNumberLE(t):w.bytesToNumberBE(t),u=h(f,n-d)+d;return o?w.numberToBytesLE(u,s):w.numberToBytesBE(u,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=j;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=z;exports.invert=v;exports.mapHashToField=$;exports.mod=h;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=x;exports.validateField=P;

package/dist/index283.js

@@ -1,12 +1,227 @@
-import { fromNumber as e } from "./index282.js";
-function r(o) {
-  return {
-    address: o.address,
-    amount: e(o.amount),
-    index: e(o.index),
-    validatorIndex: e(o.validatorIndex)
+import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index302.js";
+import { anumber as z } from "./index288.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const g = BigInt(0), d = BigInt(1), q = /* @__PURE__ */ BigInt(2), V = /* @__PURE__ */ BigInt(3), x = /* @__PURE__ */ BigInt(4), T = /* @__PURE__ */ BigInt(5), L = /* @__PURE__ */ BigInt(8);
+function h(t, n) {
+  const o = t % n;
+  return o >= g ? o : n + o;
+}
+function O(t, n, o) {
+  let r = t;
+  for (; n-- > g; )
+    r *= r, r %= o;
+  return r;
+}
+function B(t, n) {
+  if (t === g)
+    throw new Error("invert: expected non-zero number");
+  if (n <= g)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let o = h(t, n), r = n, s = g, f = d;
+  for (; o !== g; ) {
+    const u = r / o, i = r % o, w = s - f * u;
+    r = o, o = i, s = f, f = w;
+  }
+  if (r !== d)
+    throw new Error("invert: does not exist");
+  return h(s, n);
+}
+function M(t, n) {
+  const o = (t.ORDER + d) / x, r = t.pow(n, o);
+  if (!t.eql(t.sqr(r), n))
+    throw new Error("Cannot find square root");
+  return r;
+}
+function H(t, n) {
+  const o = (t.ORDER - T) / L, r = t.mul(n, q), s = t.pow(r, o), f = t.mul(n, s), c = t.mul(t.mul(f, q), s), u = t.mul(f, t.sub(c, t.ONE));
+  if (!t.eql(t.sqr(u), n))
+    throw new Error("Cannot find square root");
+  return u;
+}
+function K(t) {
+  if (t < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let n = t - d, o = 0;
+  for (; n % q === g; )
+    n /= q, o++;
+  let r = q;
+  const s = U(t);
+  for (; N(s, r) === 1; )
+    if (r++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (o === 1)
+    return M;
+  let f = s.pow(r, n);
+  const c = (n + d) / q;
+  return function(i, w) {
+    if (i.is0(w))
+      return w;
+    if (N(i, w) !== 1)
+      throw new Error("Cannot find square root");
+    let e = o, l = i.mul(i.ONE, f), a = i.pow(w, n), b = i.pow(w, c);
+    for (; !i.eql(a, i.ONE); ) {
+      if (i.is0(a))
+        return i.ZERO;
+      let m = 1, E = i.sqr(a);
+      for (; !i.eql(E, i.ONE); )
+        if (m++, E = i.sqr(E), m === e)
+          throw new Error("Cannot find square root");
+      const C = d << BigInt(e - m - 1), v = i.pow(l, C);
+      e = m, l = i.sqr(v), a = i.mul(a, l), b = i.mul(b, v);
+    }
+    return b;
   };
 }
+function Q(t) {
+  return t % x === V ? M : t % L === T ? H : K(t);
+}
+const Y = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function P(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "number",
+    BITS: "number"
+  }, o = Y.reduce((r, s) => (r[s] = "function", r), n);
+  return j(t, o), t;
+}
+function k(t, n, o) {
+  if (o < g)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (o === g)
+    return t.ONE;
+  if (o === d)
+    return n;
+  let r = t.ONE, s = n;
+  for (; o > g; )
+    o & d && (r = t.mul(r, s)), s = t.sqr(s), o >>= d;
+  return r;
+}
+function G(t, n, o = !1) {
+  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((c, u, i) => t.is0(u) ? c : (r[i] = c, t.mul(c, u)), t.ONE), f = t.inv(s);
+  return n.reduceRight((c, u, i) => t.is0(u) ? c : (r[i] = t.mul(c, r[i]), t.mul(c, u)), f), r;
+}
+function N(t, n) {
+  const o = (t.ORDER - d) / q, r = t.pow(n, o), s = t.eql(r, t.ONE), f = t.eql(r, t.ZERO), c = t.eql(r, t.neg(t.ONE));
+  if (!s && !f && !c)
+    throw new Error("invalid Legendre symbol result");
+  return s ? 1 : f ? 0 : -1;
+}
+function J(t, n) {
+  n !== void 0 && z(n);
+  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
+  return { nBitLength: o, nByteLength: r };
+}
+function U(t, n, o = !1, r = {}) {
+  if (t <= g)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  let s, f;
+  if (typeof n == "object" && n != null) {
+    if (r.sqrt || o)
+      throw new Error("cannot specify opts in two arguments");
+    const e = n;
+    e.BITS && (s = e.BITS), e.sqrt && (f = e.sqrt), typeof e.isLE == "boolean" && (o = e.isLE);
+  } else
+    typeof n == "number" && (s = n), r.sqrt && (f = r.sqrt);
+  const { nBitLength: c, nByteLength: u } = J(t, s);
+  if (u > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let i;
+  const w = Object.freeze({
+    ORDER: t,
+    isLE: o,
+    BITS: c,
+    BYTES: u,
+    MASK: Z(c),
+    ZERO: g,
+    ONE: d,
+    create: (e) => h(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof e);
+      return g <= e && e < t;
+    },
+    is0: (e) => e === g,
+    // is valid and invertible
+    isValidNot0: (e) => !w.is0(e) && w.isValid(e),
+    isOdd: (e) => (e & d) === d,
+    neg: (e) => h(-e, t),
+    eql: (e, l) => e === l,
+    sqr: (e) => h(e * e, t),
+    add: (e, l) => h(e + l, t),
+    sub: (e, l) => h(e - l, t),
+    mul: (e, l) => h(e * l, t),
+    pow: (e, l) => k(w, e, l),
+    div: (e, l) => h(e * B(l, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, l) => e + l,
+    subN: (e, l) => e - l,
+    mulN: (e, l) => e * l,
+    inv: (e) => B(e, t),
+    sqrt: f || ((e) => (i || (i = Q(t)), i(w, e))),
+    toBytes: (e) => o ? y(e, u) : I(e, u),
+    fromBytes: (e) => {
+      if (e.length !== u)
+        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + e.length);
+      return o ? S(e) : _(e);
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => G(w, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, l, a) => a ? l : e
+  });
+  return Object.freeze(w);
+}
+function A(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function W(t) {
+  const n = A(t);
+  return n + Math.ceil(n / 2);
+}
+function D(t, n, o = !1) {
+  const r = t.length, s = A(n), f = W(n);
+  if (r < 16 || r < f || r > 1024)
+    throw new Error("expected " + f + "-1024 bytes of input, got " + r);
+  const c = o ? S(t) : _(t), u = h(c, n - d) + d;
+  return o ? y(u, s) : I(u, s);
+}
 export {
-  r as toRpc
+  U as Field,
+  G as FpInvertBatch,
+  N as FpLegendre,
+  k as FpPow,
+  Q as FpSqrt,
+  A as getFieldBytesLength,
+  W as getMinHashLength,
+  B as invert,
+  D as mapHashToField,
+  h as mod,
+  J as nLength,
+  O as pow2,
+  K as tonelliShanks,
+  P as validateField
 };

package/dist/index284.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./index301.cjs"),$=require("./index304.cjs"),g=require("./index282.cjs"),c=require("./index305.cjs"),y=require("./index273.cjs"),h=require("./index266.cjs");function I(t,r={}){const{prepare:i=!0}=r,n=Array.isArray(t)||typeof t=="string"?y.parseAbiItem(t):t;return{...n,...i?{hash:o(n)}:{}}}function q(t,r,i){const{args:n=[],prepare:a=!0}=i??{},v=g.validate(r,{strict:!1}),s=t.filter(e=>v?e.type==="function"||e.type==="error"?A(e)===g.slice(r,0,4):e.type==="event"?o(e)===r:!1:"name"in e&&e.name===r);if(s.length===0)throw new l({name:r});if(s.length===1)return{...s[0],...a?{hash:o(s[0])}:{}};let u;for(const e of s){if(!("inputs"in e))continue;if(!n||n.length===0){if(!e.inputs||e.inputs.length===0)return{...e,...a?{hash:o(e)}:{}};continue}if(!e.inputs||e.inputs.length===0||e.inputs.length!==n.length)continue;if(n.every((f,E)=>{const d="inputs"in e&&e.inputs[E];return d?c.isArgOfType(f,d):!1})){if(u&&"inputs"in u&&u.inputs){const f=c.getAmbiguousTypes(e.inputs,u.inputs,n);if(f)throw new w({abiItem:e,type:f[0]},{abiItem:u,type:f[1]})}u=e}}const p=(()=>{if(u)return u;const[e,...m]=s;return{...e,overloads:m}})();if(!p)throw new l({name:r});return{...p,...a?{hash:o(p)}:{}}}function A(t){return g.slice(o(t),0,4)}function S(t){const r=typeof t=="string"?t:h.formatAbiItem(t);return c.normalizeSignature(r)}function o(t){return typeof t!="string"&&"hash"in t&&t.hash?t.hash:$.keccak256(g.fromString(S(t)))}class w extends b.BaseError{constructor(r,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${r.type}\` in \`${c.normalizeSignature(h.formatAbiItem(r.abiItem))}\`, and`,`\`${i.type}\` in \`${c.normalizeSignature(h.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class l extends b.BaseError{constructor({name:r,data:i,type:n="item"}){const a=r?` with name "${r}"`:i?` with data "${i}"`:"";super(`ABI ${n}${a} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=w;exports.NotFoundError=l;exports.from=I;exports.fromAbi=q;exports.getSelector=A;exports.getSignature=S;exports.getSignatureHash=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index154.cjs"),r=require("./index156.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index284.js

@@ -1,116 +1,9 @@
-import { BaseError as y } from "./index301.js";
-import { keccak256 as v } from "./index304.js";
-import { validate as $, slice as A, fromString as S } from "./index282.js";
-import { isArgOfType as E, normalizeSignature as p, getAmbiguousTypes as B } from "./index305.js";
-import { parseAbiItem as l } from "./index273.js";
-import { formatAbiItem as h } from "./index266.js";
-function H(e, r = {}) {
-  const { prepare: i = !0 } = r, n = Array.isArray(e) ? l(e) : typeof e == "string" ? l(e) : e;
-  return {
-    ...n,
-    ...i ? { hash: s(n) } : {}
-  };
-}
-function M(e, r, i) {
-  const { args: n = [], prepare: f = !0 } = i ?? {}, b = $(r, { strict: !1 }), u = e.filter((t) => b ? t.type === "function" || t.type === "error" ? T(t) === A(r, 0, 4) : t.type === "event" ? s(t) === r : !1 : "name" in t && t.name === r);
-  if (u.length === 0)
-    throw new d({ name: r });
-  if (u.length === 1)
-    return {
-      ...u[0],
-      ...f ? { hash: s(u[0]) } : {}
-    };
-  let o;
-  for (const t of u) {
-    if (!("inputs" in t))
-      continue;
-    if (!n || n.length === 0) {
-      if (!t.inputs || t.inputs.length === 0)
-        return {
-          ...t,
-          ...f ? { hash: s(t) } : {}
-        };
-      continue;
-    }
-    if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
-      continue;
-    if (n.every((a, w) => {
-      const g = "inputs" in t && t.inputs[w];
-      return g ? E(a, g) : !1;
-    })) {
-      if (o && "inputs" in o && o.inputs) {
-        const a = B(t.inputs, o.inputs, n);
-        if (a)
-          throw new O({
-            abiItem: t,
-            type: a[0]
-          }, {
-            abiItem: o,
-            type: a[1]
-          });
-      }
-      o = t;
-    }
-  }
-  const c = (() => {
-    if (o)
-      return o;
-    const [t, ...m] = u;
-    return { ...t, overloads: m };
-  })();
-  if (!c)
-    throw new d({ name: r });
-  return {
-    ...c,
-    ...f ? { hash: s(c) } : {}
-  };
-}
-function T(e) {
-  return A(s(e), 0, 4);
-}
-function F(e) {
-  const r = typeof e == "string" ? e : h(e);
-  return p(r);
-}
-function s(e) {
-  return typeof e != "string" && "hash" in e && e.hash ? e.hash : v(S(F(e)));
-}
-class O extends y {
-  constructor(r, i) {
-    super("Found ambiguous types in overloaded ABI Items.", {
-      metaMessages: [
-        // TODO: abitype to add support for signature-formatted ABI items.
-        `\`${r.type}\` in \`${p(h(r.abiItem))}\`, and`,
-        `\`${i.type}\` in \`${p(h(i.abiItem))}\``,
-        "",
-        "These types encode differently and cannot be distinguished at runtime.",
-        "Remove one of the ambiguous items in the ABI."
-      ]
-    }), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "AbiItem.AmbiguityError"
-    });
-  }
-}
-class d extends y {
-  constructor({ name: r, data: i, type: n = "item" }) {
-    const f = r ? ` with name "${r}"` : i ? ` with data "${i}"` : "";
-    super(`ABI ${n}${f} not found.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "AbiItem.NotFoundError"
-    });
-  }
+import { toBytes as o } from "./index154.js";
+import { keccak256 as r } from "./index156.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
 }
 export {
-  O as AmbiguityError,
-  d as NotFoundError,
-  H as from,
-  M as fromAbi,
-  T as getSelector,
-  F as getSignature,
-  s as getSignatureHash
+  c as hashSignature
 };

package/dist/index285.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const x=require("./index306.cjs"),d=require("./index301.cjs"),a=require("./index282.cjs"),g=require("./index307.cjs"),p=require("./index308.cjs");function P(n,e,t){const{checksumAddress:r=!1}={};if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const s=p.prepareParameters({checksumAddress:r,parameters:n,values:e}),o=p.encode(s);return o.length===0?"0x":o}function l(n,e){if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const t=[];for(let r=0;r<n.length;r++){const s=n[r],o=e[r];t.push(l.encode(s,o))}return a.concat(...t)}(function(n){function e(t,r,s=!1){if(t==="address"){const c=r;return x.assert(c),a.padLeft(c.toLowerCase(),s?32:0)}if(t==="string")return a.fromString(r);if(t==="bytes")return r;if(t==="bool")return a.padLeft(a.fromBoolean(r),s?32:1);const o=t.match(g.integerRegex);if(o){const[c,i,u="256"]=o,h=Number.parseInt(u)/8;return a.fromNumber(r,{size:s?32:h,signed:i==="int"})}const b=t.match(g.bytesRegex);if(b){const[c,i]=b;if(Number.parseInt(i)!==(r.length-2)/2)throw new y({expectedSize:Number.parseInt(i),value:r});return a.padRight(r,s?32:0)}const f=t.match(g.arrayRegex);if(f&&Array.isArray(r)){const[c,i]=f,u=[];for(let h=0;h<r.length;h++)u.push(e(i,r[h],!0));return u.length===0?"0x":a.concat(...u)}throw new E(t)}n.encode=e})(l||(l={}));class A extends d.BaseError{constructor({expectedLength:e,givenLength:t,type:r}){super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class y extends d.BaseError{constructor({expectedSize:e,value:t}){super(`Size of bytes "${t}" (bytes${a.size(t)}) does not match expected size (bytes${e}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class m extends d.BaseError{constructor({expectedLength:e,givenLength:t}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${e}`,`Given length (values): ${t}`].join(`
-`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class w extends d.BaseError{constructor(e){super(`Value \`${e}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class E extends d.BaseError{constructor(e){super(`Type \`${e}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=A;exports.BytesSizeMismatchError=y;exports.InvalidArrayError=w;exports.InvalidTypeError=E;exports.LengthMismatchError=m;exports.encode=P;exports.encodePacked=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index286.cjs"),n=require("./index264.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;