@gardenfi/utils 2.5.2 → 2.5.3

package/dist/index264.js

@@ -1,8 +1,106 @@
-import { formatAbiParameters as r } from "./index265.js";
-function u(t) {
-  var n;
-  return t.type === "function" ? `function ${t.name}(${r(t.inputs)})${t.stateMutability && t.stateMutability !== "nonpayable" ? ` ${t.stateMutability}` : ""}${(n = t.outputs) != null && n.length ? ` returns (${r(t.outputs)})` : ""}` : t.type === "event" ? `event ${t.name}(${r(t.inputs)})` : t.type === "error" ? `error ${t.name}(${r(t.inputs)})` : t.type === "constructor" ? `constructor(${r(t.inputs)})${t.stateMutability === "payable" ? " payable" : ""}` : t.type === "fallback" ? `fallback() external${t.stateMutability === "payable" ? " payable" : ""}` : "receive() external payable";
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index265.js";
+import { createHasher as u, clean as C, rotr as i } from "./index263.js";
+const B = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class E extends D {
+  constructor(o = 32) {
+    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
+  }
+  get() {
+    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [o, r, t, s, a, f, c, e];
+  }
+  // prettier-ignore
+  set(o, r, t, s, a, f, c, e) {
+    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
+  }
+  process(o, r) {
+    for (let x = 0; x < 16; x++, r += 4)
+      h[x] = o.getUint32(r, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
+      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
+    }
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
+      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
+  }
+  roundClean() {
+    C(h);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+  }
 }
+const y = /* @__PURE__ */ u(() => new E());
 export {
-  u as formatAbiItem
+  E as SHA256,
+  y as sha256
 };

package/dist/index265.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index266.cjs");function m(r){let e="";const a=r.length;for(let t=0;t<a;t++){const o=r[t];e+=i.formatAbiParameter(o),t!==a-1&&(e+=", ")}return e}exports.formatAbiParameters=m;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index263.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;

package/dist/index265.js

@@ -1,13 +1,81 @@
-import { formatAbiParameter as m } from "./index266.js";
-function f(e) {
-  let r = "";
-  const o = e.length;
-  for (let t = 0; t < o; t++) {
-    const a = e[t];
-    r += m(a), t !== o - 1 && (r += ", ");
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index263.js";
+function y(o, t, s, n) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, n);
+  const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
+  o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
+}
+function U(o, t, s) {
+  return o & t ^ ~o & s;
+}
+function _(o, t, s) {
+  return o & t ^ o & s ^ t & s;
+}
+class m extends g {
+  constructor(t, s, n, i) {
+    super(), this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.blockLen = t, this.outputLen = s, this.padOffset = n, this.isLE = i, this.buffer = new Uint8Array(t), this.view = l(this.buffer);
+  }
+  update(t) {
+    b(this), t = a(t), d(t);
+    const { view: s, buffer: n, blockLen: i } = this, h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(i - this.pos, h - e);
+      if (r === i) {
+        const c = l(t);
+        for (; i <= h - e; e += i)
+          this.process(c, e);
+        continue;
+      }
+      n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    b(this), x(t, this), this.finished = !0;
+    const { buffer: s, view: n, blockLen: i, isLE: h } = this;
+    let { pos: e } = this;
+    s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
+    for (let f = e; f < i; f++)
+      s[f] = 0;
+    y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
+    const r = l(t), c = this.outputLen;
+    if (c % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = c / 4, p = this.get();
+    if (u > p.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < u; f++)
+      r.setUint32(4 * f, p[f], h);
+  }
+  digest() {
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const n = t.slice(0, s);
+    return this.destroy(), n;
+  }
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
+    return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
+  }
+  clone() {
+    return this._cloneInto();
   }
-  return r;
 }
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
 export {
-  f as formatAbiParameters
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/index266.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index267.cjs"),d=/^tuple(?<array>(\[(\d*)\])*)$/;function c(n){let e=n.type;if(d.test(n.type)&&"components"in n){e="(";const p=n.components.length;for(let t=0;t<p;t++){const s=n.components[t];e+=c(s),t<p-1&&(e+=", ")}const o=f.execTyped(d,n.type);return e+=`)${(o==null?void 0:o.array)??""}`,c({...n,type:e})}return"indexed"in n&&n.indexed&&(e=`${e} indexed`),n.name?`${e} ${n.name}`:e}exports.formatAbiParameter=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

package/dist/index266.js

@@ -1,22 +1,4 @@
-import { execTyped as s } from "./index267.js";
-const c = /^tuple(?<array>(\[(\d*)\])*)$/;
-function d(n) {
-  let o = n.type;
-  if (c.test(n.type) && "components" in n) {
-    o = "(";
-    const p = n.components.length;
-    for (let t = 0; t < p; t++) {
-      const f = n.components[t];
-      o += d(f), t < p - 1 && (o += ", ");
-    }
-    const e = s(c, n.type);
-    return o += `)${(e == null ? void 0 : e.array) ?? ""}`, d({
-      ...n,
-      type: o
-    });
-  }
-  return "indexed" in n && n.indexed && (o = `${o} indexed`), n.name ? `${o} ${n.name}` : o;
-}
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  d as formatAbiParameter
+  o as crypto
 };

package/dist/index267.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function s(t,n){const e=t.exec(n);return e==null?void 0:e.groups}const g=/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/,o=/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/,c=/^\(.+?\).*?$/;exports.bytesRegex=g;exports.execTyped=s;exports.integerRegex=o;exports.isTupleRegex=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index300.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/index267.js

@@ -1,11 +1,9 @@
-function s(t, n) {
-  const e = t.exec(n);
-  return e == null ? void 0 : e.groups;
+import { weierstrass as s } from "./index300.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 };
 }
-const o = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/, c = /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/, x = /^\(.+?\).*?$/;
 export {
-  o as bytesRegex,
-  s as execTyped,
-  c as integerRegex,
-  x as isTupleRegex
+  c as createCurve
 };

package/dist/index268.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index267.cjs"),n=/^error (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*)\((?<parameters>.*?)\)$/;function o(e){return n.test(e)}function s(e){return t.execTyped(n,e)}const r=/^event (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*)\((?<parameters>.*?)\)$/;function g(e){return r.test(e)}function S(e){return t.execTyped(r,e)}const i=/^function (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*)\((?<parameters>.*?)\)(?: (?<scope>external|public{1}))?(?: (?<stateMutability>pure|view|nonpayable|payable{1}))?(?: returns\s?\((?<returns>.*?)\))?$/;function x(e){return i.test(e)}function l(e){return t.execTyped(i,e)}const a=/^struct (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*) \{(?<properties>.*?)\}$/;function f(e){return a.test(e)}function p(e){return t.execTyped(a,e)}const u=/^constructor\((?<parameters>.*?)\)(?:\s(?<stateMutability>payable{1}))?$/;function b(e){return u.test(e)}function y(e){return t.execTyped(u,e)}const c=/^fallback\(\) external(?:\s(?<stateMutability>payable{1}))?$/;function d(e){return c.test(e)}function $(e){return t.execTyped(c,e)}const v=/^receive\(\) external payable$/;function m(e){return v.test(e)}const R=new Set(["indexed"]),z=new Set(["calldata","memory","storage"]);exports.eventModifiers=R;exports.execConstructorSignature=y;exports.execErrorSignature=s;exports.execEventSignature=S;exports.execFallbackSignature=$;exports.execFunctionSignature=l;exports.execStructSignature=p;exports.functionModifiers=z;exports.isConstructorSignature=b;exports.isErrorSignature=o;exports.isEventSignature=g;exports.isFallbackSignature=d;exports.isFunctionSignature=x;exports.isReceiveSignature=m;exports.isStructSignature=f;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("./index301.cjs"),V=require("./index263.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/index268.js

@@ -1,69 +1,227 @@
-import { execTyped as t } from "./index267.js";
-const n = /^error (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*)\((?<parameters>.*?)\)$/;
-function g(e) {
-  return n.test(e);
+import { numberToBytesLE as y, numberToBytesBE as I, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as _, _validateObject as j } from "./index301.js";
+import { anumber as z } from "./index263.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 S(e) {
-  return t(n, e);
+function O(t, n, o) {
+  let r = t;
+  for (; n-- > g; )
+    r *= r, r %= o;
+  return r;
 }
-const r = /^event (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*)\((?<parameters>.*?)\)$/;
-function l(e) {
-  return r.test(e);
+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 f(e) {
-  return t(r, e);
+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;
 }
-const a = /^function (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*)\((?<parameters>.*?)\)(?: (?<scope>external|public{1}))?(?: (?<stateMutability>pure|view|nonpayable|payable{1}))?(?: returns\s?\((?<returns>.*?)\))?$/;
-function x(e) {
-  return a.test(e);
+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 p(e) {
-  return t(a, e);
+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;
+  };
 }
-const u = /^struct (?<name>[a-zA-Z$_][a-zA-Z0-9$_]*) \{(?<properties>.*?)\}$/;
-function $(e) {
-  return u.test(e);
+function Q(t) {
+  return t % x === V ? M : t % L === T ? H : K(t);
 }
-function b(e) {
-  return t(u, e);
+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;
 }
-const i = /^constructor\((?<parameters>.*?)\)(?:\s(?<stateMutability>payable{1}))?$/;
-function m(e) {
-  return i.test(e);
+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 y(e) {
-  return t(i, e);
+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;
 }
-const c = /^fallback\(\) external(?:\s(?<stateMutability>payable{1}))?$/;
-function v(e) {
-  return c.test(e);
+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 z(e) {
-  return t(c, e);
+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 };
 }
-const o = /^receive\(\) external payable$/;
-function A(e) {
-  return o.test(e);
+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);
 }
-const R = /* @__PURE__ */ new Set(["indexed"]), Z = /* @__PURE__ */ new Set([
-  "calldata",
-  "memory",
-  "storage"
-]);
 export {
-  R as eventModifiers,
-  y as execConstructorSignature,
-  S as execErrorSignature,
-  f as execEventSignature,
-  z as execFallbackSignature,
-  p as execFunctionSignature,
-  b as execStructSignature,
-  Z as functionModifiers,
-  m as isConstructorSignature,
-  g as isErrorSignature,
-  l as isEventSignature,
-  v as isFallbackSignature,
-  x as isFunctionSignature,
-  A as isReceiveSignature,
-  $ as isStructSignature
+  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/index269.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./index267.cjs"),b=require("./index272.cjs"),T=require("./index273.cjs"),y=require("./index274.cjs"),q=require("./index276.cjs"),f=require("./index268.cjs"),S=require("./index270.cjs");function v(i){const n={},u=i.length;for(let e=0;e<u;e++){const o=i[e];if(!f.isStructSignature(o))continue;const r=f.execStructSignature(o);if(!r)throw new y.InvalidSignatureError({signature:o,type:"struct"});const p=r.properties.split(";"),t=[],w=p.length;for(let l=0;l<w;l++){const g=p[l].trim();if(!g)continue;const d=S.parseAbiParameter(g,{type:"struct"});t.push(d)}if(!t.length)throw new y.InvalidStructSignatureError({signature:o});n[r.name]=t}const s={},a=Object.entries(n),c=a.length;for(let e=0;e<c;e++){const[o,r]=a[e];s[o]=m(r,n)}return s}const P=/^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*)(?<array>(?:\[\d*?\])+?)?$/;function m(i,n,u=new Set){const s=[],a=i.length;for(let c=0;c<a;c++){const e=i[c];if(h.isTupleRegex.test(e.type))s.push(e);else{const r=h.execTyped(P,e.type);if(!(r!=null&&r.type))throw new T.InvalidAbiTypeParameterError({abiParameter:e});const{array:p,type:t}=r;if(t in n){if(u.has(t))throw new q.CircularReferenceError({type:t});s.push({...e,type:`tuple${p??""}`,components:m(n[t]??[],n,new Set([...u,t]))})}else if(S.isSolidityType(t))s.push(e);else throw new b.UnknownTypeError({type:t})}}return s}exports.parseStructs=v;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return`[${e.slice(2)}]`}exports.encodeLabelhash=t;

package/dist/index269.js

@@ -1,68 +1,6 @@
-import { isTupleRegex as g, execTyped as w } from "./index267.js";
-import { UnknownTypeError as S } from "./index272.js";
-import { InvalidAbiTypeParameterError as d } from "./index273.js";
-import { InvalidSignatureError as T, InvalidStructSignatureError as v } from "./index274.js";
-import { CircularReferenceError as x } from "./index276.js";
-import { isStructSignature as E, execStructSignature as b } from "./index268.js";
-import { parseAbiParameter as A, isSolidityType as $ } from "./index270.js";
-function C(s) {
-  const n = {}, c = s.length;
-  for (let t = 0; t < c; t++) {
-    const i = s[t];
-    if (!E(i))
-      continue;
-    const r = b(i);
-    if (!r)
-      throw new T({ signature: i, type: "struct" });
-    const u = r.properties.split(";"), e = [], h = u.length;
-    for (let l = 0; l < h; l++) {
-      const m = u[l].trim();
-      if (!m)
-        continue;
-      const y = A(m, {
-        type: "struct"
-      });
-      e.push(y);
-    }
-    if (!e.length)
-      throw new v({ signature: i });
-    n[r.name] = e;
-  }
-  const o = {}, a = Object.entries(n), p = a.length;
-  for (let t = 0; t < p; t++) {
-    const [i, r] = a[t];
-    o[i] = f(r, n);
-  }
-  return o;
-}
-const I = /^(?<type>[a-zA-Z$_][a-zA-Z0-9$_]*)(?<array>(?:\[\d*?\])+?)?$/;
-function f(s, n, c = /* @__PURE__ */ new Set()) {
-  const o = [], a = s.length;
-  for (let p = 0; p < a; p++) {
-    const t = s[p];
-    if (g.test(t.type))
-      o.push(t);
-    else {
-      const r = w(I, t.type);
-      if (!(r != null && r.type))
-        throw new d({ abiParameter: t });
-      const { array: u, type: e } = r;
-      if (e in n) {
-        if (c.has(e))
-          throw new x({ type: e });
-        o.push({
-          ...t,
-          type: `tuple${u ?? ""}`,
-          components: f(n[e] ?? [], n, /* @__PURE__ */ new Set([...c, e]))
-        });
-      } else if ($(e))
-        o.push(t);
-      else
-        throw new S({ type: e });
-    }
-  }
-  return o;
+function n(e) {
+  return `[${e.slice(2)}]`;
 }
 export {
-  C as parseStructs
+  n as encodeLabelhash
 };

package/dist/index27.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index218.cjs"),t=e.defineChain({id:1,name:"Ethereum",nativeCurrency:{name:"Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://eth.merkle.io"]}},blockExplorers:{default:{name:"Etherscan",url:"https://etherscan.io",apiUrl:"https://api.etherscan.io/api"}},contracts:{ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xce01f8eee7E479C928F8919abD53E553a36CeF67",blockCreated:19258213},multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:14353601}}});exports.mainnet=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index252.cjs"),t=e.defineChain({id:1,name:"Ethereum",nativeCurrency:{name:"Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://eth.merkle.io"]}},blockExplorers:{default:{name:"Etherscan",url:"https://etherscan.io",apiUrl:"https://api.etherscan.io/api"}},contracts:{ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xce01f8eee7E479C928F8919abD53E553a36CeF67",blockCreated:19258213},multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:14353601}}});exports.mainnet=t;