@gardenfi/utils 2.5.3-beta.1 → 2.5.3-beta.2

package/dist/index236.js

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

package/dist/index237.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index233.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index232.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;

package/dist/index237.js

@@ -1,4 +1,4 @@
-import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index233.js";
+import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index232.js";
 class r extends d {
   constructor(t, i) {
     super(), this.finished = !1, this.destroyed = !1, u(t);

package/dist/index238.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index233.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index232.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/index238.js

@@ -1,4 +1,4 @@
-import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index233.js";
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index232.js";
 function y(o, t, s, n) {
   if (typeof o.setBigUint64 == "function")
     return o.setBigUint64(t, s, n);

package/dist/index24.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=e=>{try{return JSON.parse(e)}catch{return e}};exports.safeParseJson=r;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const j=require("./index135.cjs"),E=require("./index136.cjs"),H=require("./index46.cjs"),U=require("./index137.cjs"),_=require("./index133.cjs");function k(v,r={}){const{batch:o,fetchFn:l,fetchOptions:u,key:h="http",methods:q,name:d="HTTP JSON-RPC",onFetchRequest:y,onFetchResponse:f,retryDelay:R,raw:w}=r;return({chain:n,retryCount:S,timeout:m})=>{const{batchSize:C=1e3,wait:b=0}=typeof o=="object"?o:{},T=r.retryCount??S,c=m??r.timeout??1e4,e=n==null?void 0:n.rpcUrls.default.http[0];if(!e)throw new E.UrlRequiredError;const a=U.getHttpRpcClient(e,{fetchFn:l,fetchOptions:u,onRequest:y,onResponse:f,timeout:c});return _.createTransport({key:h,methods:q,name:d,async request({method:B,params:F}){const i={method:B,params:F},{schedule:O}=H.createBatchScheduler({id:e,wait:b,shouldSplitBatch(t){return t.length>C},fn:t=>a.request({body:t}),sort:(t,g)=>t.id-g.id}),P=async t=>o?O(t):[await a.request({body:t})],[{error:s,result:p}]=await P(i);if(w)return{error:s,result:p};if(s)throw new j.RpcRequestError({body:i,error:s,url:e});return p},retryCount:T,retryDelay:R,timeout:c,type:"http"},{fetchOptions:u,url:e})}}exports.http=k;

package/dist/index24.js

@@ -1,10 +1,61 @@
-const t = (r) => {
-  try {
-    return JSON.parse(r);
-  } catch {
-    return r;
-  }
-};
+import { RpcRequestError as P } from "./index135.js";
+import { UrlRequiredError as U } from "./index136.js";
+import { createBatchScheduler as _ } from "./index46.js";
+import { getHttpRpcClient as j } from "./index137.js";
+import { createTransport as k } from "./index133.js";
+function v(x, r = {}) {
+  const { batch: o, fetchFn: h, fetchOptions: u, key: m = "http", methods: a, name: f = "HTTP JSON-RPC", onFetchRequest: y, onFetchResponse: d, retryDelay: R, raw: w } = r;
+  return ({ chain: n, retryCount: q, timeout: C }) => {
+    const { batchSize: S = 1e3, wait: b = 0 } = typeof o == "object" ? o : {}, F = r.retryCount ?? q, c = C ?? r.timeout ?? 1e4, e = n == null ? void 0 : n.rpcUrls.default.http[0];
+    if (!e)
+      throw new U();
+    const p = j(e, {
+      fetchFn: h,
+      fetchOptions: u,
+      onRequest: y,
+      onResponse: d,
+      timeout: c
+    });
+    return k({
+      key: m,
+      methods: a,
+      name: f,
+      async request({ method: T, params: B }) {
+        const i = { method: T, params: B }, { schedule: E } = _({
+          id: e,
+          wait: b,
+          shouldSplitBatch(t) {
+            return t.length > S;
+          },
+          fn: (t) => p.request({
+            body: t
+          }),
+          sort: (t, O) => t.id - O.id
+        }), H = async (t) => o ? E(t) : [
+          await p.request({
+            body: t
+          })
+        ], [{ error: s, result: l }] = await H(i);
+        if (w)
+          return { error: s, result: l };
+        if (s)
+          throw new P({
+            body: i,
+            error: s,
+            url: e
+          });
+        return l;
+      },
+      retryCount: F,
+      retryDelay: R,
+      timeout: c,
+      type: "http"
+    }, {
+      fetchOptions: u,
+      url: e
+    });
+  };
+}
 export {
-  t as safeParseJson
+  v as http
 };

package/dist/index240.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index38.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index35.cjs");class t extends a.BaseError{constructor(e){const{docsPath:s,field:r,metaMessages:i}=e;super(`Invalid Sign-In with Ethereum message field "${r}".`,{docsPath:s,metaMessages:i,name:"SiweInvalidMessageFieldError"})}}exports.SiweInvalidMessageFieldError=t;

package/dist/index240.js

@@ -1,4 +1,4 @@
-import { BaseError as i } from "./index38.js";
+import { BaseError as i } from "./index35.js";
 class d extends i {
   constructor(e) {
     const { docsPath: s, field: r, metaMessages: a } = e;

package/dist/index241.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(/[^a-z0-9:/?#[\]@!$&'()*+,;=.\-_~%]/i.test(e)||/%[^0-9a-f]/i.test(e)||/%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))return!1;const s=a(e),f=s[1],t=s[2],i=s[3],r=s[4],l=s[5];if(!(f!=null&&f.length&&i.length>=0))return!1;if(t!=null&&t.length){if(!(i.length===0||/^\//.test(i)))return!1}else if(/^\/\//.test(i))return!1;if(!/^[a-z][a-z0-9+\-.]*$/.test(f.toLowerCase()))return!1;let n="";return n+=`${f}:`,t!=null&&t.length&&(n+=`//${t}`),n+=i,r!=null&&r.length&&(n+=`?${r}`),l!=null&&l.length&&(n+=`#${l}`),n}function a(e){return e.match(/(?:([^:/?#]+):)?(?:\/\/([^/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/)}exports.isUri=o;

package/dist/index241.js

@@ -1,5 +1,5 @@
 function o(e) {
-  if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
+  if (/[^a-z0-9:/?#[\]@!$&'()*+,;=.\-_~%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
     return !1;
   const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
   if (!(f != null && f.length && i.length >= 0))
@@ -9,13 +9,13 @@ function o(e) {
       return !1;
   } else if (/^\/\//.test(i))
     return !1;
-  if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
+  if (!/^[a-z][a-z0-9+\-.]*$/.test(f.toLowerCase()))
     return !1;
   let n = "";
   return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
 }
 function a(e) {
-  return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
+  return e.match(/(?:([^:/?#]+):)?(?:\/\/([^/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
 }
 export {
   o as isUri

package/dist/index242.cjs

@@ -1 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(n,a,y){let i="";if(y)for(const e of Object.entries(y)){if(!e)continue;let s="";for(const t of e[1])s+=`[${t.type}${t.name?`:${t.name}`:""}]`;i+=`(${e[0]}{${s}})`}return a?`${a}:${n}${i}`:n}const d=new Map([["address",{type:"address"}],["bool",{type:"bool"}],["bytes",{type:"bytes"}],["bytes32",{type:"bytes32"}],["int",{type:"int256"}],["int256",{type:"int256"}],["string",{type:"string"}],["uint",{type:"uint256"}],["uint8",{type:"uint8"}],["uint16",{type:"uint16"}],["uint24",{type:"uint24"}],["uint32",{type:"uint32"}],["uint64",{type:"uint64"}],["uint96",{type:"uint96"}],["uint112",{type:"uint112"}],["uint160",{type:"uint160"}],["uint192",{type:"uint192"}],["uint256",{type:"uint256"}],["address owner",{type:"address",name:"owner"}],["address to",{type:"address",name:"to"}],["bool approved",{type:"bool",name:"approved"}],["bytes _data",{type:"bytes",name:"_data"}],["bytes data",{type:"bytes",name:"data"}],["bytes signature",{type:"bytes",name:"signature"}],["bytes32 hash",{type:"bytes32",name:"hash"}],["bytes32 r",{type:"bytes32",name:"r"}],["bytes32 root",{type:"bytes32",name:"root"}],["bytes32 s",{type:"bytes32",name:"s"}],["string name",{type:"string",name:"name"}],["string symbol",{type:"string",name:"symbol"}],["string tokenURI",{type:"string",name:"tokenURI"}],["uint tokenId",{type:"uint256",name:"tokenId"}],["uint8 v",{type:"uint8",name:"v"}],["uint256 balance",{type:"uint256",name:"balance"}],["uint256 tokenId",{type:"uint256",name:"tokenId"}],["uint256 value",{type:"uint256",name:"value"}],["event:address indexed from",{type:"address",name:"from",indexed:!0}],["event:address indexed to",{type:"address",name:"to",indexed:!0}],["event:uint indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}],["event:uint256 indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}]]);exports.getParameterCacheKey=r;exports.parameterCache=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index248.cjs");class c extends Error{constructor(r,e={}){const a=(()=>{var s;if(e.cause instanceof c){if(e.cause.details)return e.cause.details;if(e.cause.shortMessage)return e.cause.shortMessage}return e.cause&&"details"in e.cause&&typeof e.cause.details=="string"?e.cause.details:(s=e.cause)!=null&&s.message?e.cause.message:e.details})(),u=e.cause instanceof c&&e.cause.docsPath||e.docsPath,i=`https://oxlib.sh${u??""}`,d=[r||"An error occurred.",...e.metaMessages?["",...e.metaMessages]:[],...a||u?["",a?`Details: ${a}`:void 0,u?`See: ${i}`:void 0]:[]].filter(s=>typeof s=="string").join(`
+`);super(d,e.cause?{cause:e.cause}:void 0),Object.defineProperty(this,"details",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docs",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"docsPath",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"shortMessage",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"cause",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"BaseError"}),Object.defineProperty(this,"version",{enumerable:!0,configurable:!0,writable:!0,value:`ox@${n.getVersion()}`}),this.cause=e.cause,this.details=a,this.docs=i,this.docsPath=u,this.shortMessage=r}walk(r){return l(this,r)}}function l(t,r){return r!=null&&r(t)?t:t&&typeof t=="object"&&"cause"in t&&t.cause?l(t.cause,r):r?null:t}exports.BaseError=c;

package/dist/index242.js

@@ -1,71 +1,69 @@
-function d(n, y, i) {
-  let a = "";
-  if (i)
-    for (const e of Object.entries(i)) {
-      if (!e)
-        continue;
-      let s = "";
-      for (const t of e[1])
-        s += `[${t.type}${t.name ? `:${t.name}` : ""}]`;
-      a += `(${e[0]}{${s}})`;
-    }
-  return y ? `${y}:${n}${a}` : n;
+import { getVersion as n } from "./index248.js";
+class c extends Error {
+  constructor(t, e = {}) {
+    const a = (() => {
+      var s;
+      if (e.cause instanceof c) {
+        if (e.cause.details)
+          return e.cause.details;
+        if (e.cause.shortMessage)
+          return e.cause.shortMessage;
+      }
+      return e.cause && "details" in e.cause && typeof e.cause.details == "string" ? e.cause.details : (s = e.cause) != null && s.message ? e.cause.message : e.details;
+    })(), u = e.cause instanceof c && e.cause.docsPath || e.docsPath, i = `https://oxlib.sh${u ?? ""}`, d = [
+      t || "An error occurred.",
+      ...e.metaMessages ? ["", ...e.metaMessages] : [],
+      ...a || u ? [
+        "",
+        a ? `Details: ${a}` : void 0,
+        u ? `See: ${i}` : void 0
+      ] : []
+    ].filter((s) => typeof s == "string").join(`
+`);
+    super(d, e.cause ? { cause: e.cause } : void 0), Object.defineProperty(this, "details", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "docs", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "docsPath", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "shortMessage", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "cause", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: void 0
+    }), Object.defineProperty(this, "name", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: "BaseError"
+    }), Object.defineProperty(this, "version", {
+      enumerable: !0,
+      configurable: !0,
+      writable: !0,
+      value: `ox@${n()}`
+    }), this.cause = e.cause, this.details = a, this.docs = i, this.docsPath = u, this.shortMessage = t;
+  }
+  walk(t) {
+    return l(this, t);
+  }
+}
+function l(r, t) {
+  return t != null && t(r) ? r : r && typeof r == "object" && "cause" in r && r.cause ? l(r.cause, t) : t ? null : r;
 }
-const p = /* @__PURE__ */ new Map([
-  // Unnamed
-  ["address", { type: "address" }],
-  ["bool", { type: "bool" }],
-  ["bytes", { type: "bytes" }],
-  ["bytes32", { type: "bytes32" }],
-  ["int", { type: "int256" }],
-  ["int256", { type: "int256" }],
-  ["string", { type: "string" }],
-  ["uint", { type: "uint256" }],
-  ["uint8", { type: "uint8" }],
-  ["uint16", { type: "uint16" }],
-  ["uint24", { type: "uint24" }],
-  ["uint32", { type: "uint32" }],
-  ["uint64", { type: "uint64" }],
-  ["uint96", { type: "uint96" }],
-  ["uint112", { type: "uint112" }],
-  ["uint160", { type: "uint160" }],
-  ["uint192", { type: "uint192" }],
-  ["uint256", { type: "uint256" }],
-  // Named
-  ["address owner", { type: "address", name: "owner" }],
-  ["address to", { type: "address", name: "to" }],
-  ["bool approved", { type: "bool", name: "approved" }],
-  ["bytes _data", { type: "bytes", name: "_data" }],
-  ["bytes data", { type: "bytes", name: "data" }],
-  ["bytes signature", { type: "bytes", name: "signature" }],
-  ["bytes32 hash", { type: "bytes32", name: "hash" }],
-  ["bytes32 r", { type: "bytes32", name: "r" }],
-  ["bytes32 root", { type: "bytes32", name: "root" }],
-  ["bytes32 s", { type: "bytes32", name: "s" }],
-  ["string name", { type: "string", name: "name" }],
-  ["string symbol", { type: "string", name: "symbol" }],
-  ["string tokenURI", { type: "string", name: "tokenURI" }],
-  ["uint tokenId", { type: "uint256", name: "tokenId" }],
-  ["uint8 v", { type: "uint8", name: "v" }],
-  ["uint256 balance", { type: "uint256", name: "balance" }],
-  ["uint256 tokenId", { type: "uint256", name: "tokenId" }],
-  ["uint256 value", { type: "uint256", name: "value" }],
-  // Indexed
-  [
-    "event:address indexed from",
-    { type: "address", name: "from", indexed: !0 }
-  ],
-  ["event:address indexed to", { type: "address", name: "to", indexed: !0 }],
-  [
-    "event:uint indexed tokenId",
-    { type: "uint256", name: "tokenId", indexed: !0 }
-  ],
-  [
-    "event:uint256 indexed tokenId",
-    { type: "uint256", name: "tokenId", indexed: !0 }
-  ]
-]);
 export {
-  d as getParameterCacheKey,
-  p as parameterCache
+  c as BaseError
 };

package/dist/index243.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const we=require("./index237.cjs"),H=require("./index233.cjs"),h=require("./index244.cjs"),L=require("./index245.cjs"),ee=require("./index228.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const ce=(r,s)=>(r+(r>=0?s:-s)/le)/s;function ae(r,s,c){const[[e,w],[p,l]]=s,F=ce(l*r,c),R=ce(-w*r,c);let T=r-F*e-R*p,U=-F*w-R*l;const X=T<D,j=U<D;X&&(T=-T),j&&(U=-U);const E=h.bitMask(Math.ceil(h.bitLen(c)/2))+M;if(T<D||T>=E||U<D||U>=E)throw new Error("splitScalar (endomorphism): failed, k="+r);return{k1neg:X,k1:T,k2neg:j,k2:U}}function oe(r){if(!["compact","recovered","der"].includes(r))throw new Error('Signature format must be "compact", "recovered", or "der"');return r}function ne(r,s){const c={};for(let e of Object.keys(s))c[e]=r[e]===void 0?s[e]:r[e];return h._abool2(c.lowS,"lowS"),h._abool2(c.prehash,"prehash"),c.format!==void 0&&oe(c.format),c}class ue extends Error{constructor(s=""){super(s)}}const C={Err:ue,_tlv:{encode:(r,s)=>{const{Err:c}=C;if(r<0||r>256)throw new c("tlv.encode: wrong tag");if(s.length&1)throw new c("tlv.encode: unpadded data");const e=s.length/2,w=h.numberToHexUnpadded(e);if(w.length/2&128)throw new c("tlv.encode: long form length too big");const p=e>127?h.numberToHexUnpadded(w.length/2|128):"";return h.numberToHexUnpadded(r)+p+w+s},decode(r,s){const{Err:c}=C;let e=0;if(r<0||r>256)throw new c("tlv.encode: wrong tag");if(s.length<2||s[e++]!==r)throw new c("tlv.decode: wrong tlv");const w=s[e++],p=!!(w&128);let l=0;if(!p)l=w;else{const R=w&127;if(!R)throw new c("tlv.decode(long): indefinite length not supported");if(R>4)throw new c("tlv.decode(long): byte length is too big");const T=s.subarray(e,e+R);if(T.length!==R)throw new c("tlv.decode: length bytes not complete");if(T[0]===0)throw new c("tlv.decode(long): zero leftmost byte");for(const U of T)l=l<<8|U;if(e+=R,l<128)throw new c("tlv.decode(long): not minimal encoding")}const F=s.subarray(e,e+l);if(F.length!==l)throw new c("tlv.decode: wrong value length");return{v:F,l:s.subarray(e+l)}}},_int:{encode(r){const{Err:s}=C;if(r<D)throw new s("integer: negative integers are not allowed");let c=h.numberToHexUnpadded(r);if(Number.parseInt(c[0],16)&8&&(c="00"+c),c.length&1)throw new s("unexpected DER parsing assertion: unpadded hex");return c},decode(r){const{Err:s}=C;if(r[0]&128)throw new s("invalid signature integer: negative");if(r[0]===0&&!(r[1]&128))throw new s("invalid signature integer: unnecessary leading zero");return h.bytesToNumberBE(r)}},toSig(r){const{Err:s,_int:c,_tlv:e}=C,w=h.ensureBytes("signature",r),{v:p,l}=e.decode(48,w);if(l.length)throw new s("invalid signature: left bytes after parsing");const{v:F,l:R}=e.decode(2,p),{v:T,l:U}=e.decode(2,R);if(U.length)throw new s("invalid signature: left bytes after parsing");return{r:c.decode(F),s:c.decode(T)}},hexFromSig(r){const{_tlv:s,_int:c}=C,e=s.encode(2,c.encode(r.r)),w=s.encode(2,c.encode(r.s)),p=e+w;return s.encode(48,p)}},D=BigInt(0),M=BigInt(1),le=BigInt(2),J=BigInt(3),pe=BigInt(4);function I(r,s){const{BYTES:c}=r;let e;if(typeof s=="bigint")e=s;else{let w=h.ensureBytes("private key",s);try{e=r.fromBytes(w)}catch{throw new Error(`invalid private key: expected ui8a of size ${c}, got ${typeof s}`)}}if(!r.isValidNot0(e))throw new Error("invalid private key: out of range [1..N-1]");return e}function de(r,s={}){const c=L._createCurveFields("weierstrass",r,s),{Fp:e,Fn:w}=c;let p=c.CURVE;const{h:l,n:F}=p;h._validateObject(s,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:R}=s;if(R&&(!e.is0(p.a)||typeof R.beta!="bigint"||!Array.isArray(R.basises)))throw new Error('invalid endo: expected "beta": bigint and "basises": array');const T=ye(e,w);function U(){if(!e.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}function X(B,o,n){const{x:t,y:i}=o.toAffine(),a=e.toBytes(t);if(h._abool2(n,"isCompressed"),n){U();const f=!e.isOdd(i);return H.concatBytes(fe(f),a)}else return H.concatBytes(Uint8Array.of(4),a,e.toBytes(i))}function j(B){h._abytes2(B,void 0,"Point");const{publicKey:o,publicKeyUncompressed:n}=T,t=B.length,i=B[0],a=B.subarray(1);if(t===o&&(i===2||i===3)){const f=e.fromBytes(a);if(!e.isValid(f))throw new Error("bad point: is not on curve, wrong x");const d=N(f);let u;try{u=e.sqrt(d)}catch(Z){const v=Z instanceof Error?": "+Z.message:"";throw new Error("bad point: is not on curve, sqrt error"+v)}U();const y=e.isOdd(u);return(i&1)===1!==y&&(u=e.neg(u)),{x:f,y:u}}else if(t===n&&i===4){const f=e.BYTES,d=e.fromBytes(a.subarray(0,f)),u=e.fromBytes(a.subarray(f,f*2));if(!K(d,u))throw new Error("bad point: is not on curve");return{x:d,y:u}}else throw new Error(`bad point: got length ${t}, expected compressed=${o} or uncompressed=${n}`)}const E=s.toBytes||X,O=s.fromBytes||j;function N(B){const o=e.sqr(B),n=e.mul(o,B);return e.add(e.add(n,e.mul(B,p.a)),p.b)}function K(B,o){const n=e.sqr(o),t=N(B);return e.eql(n,t)}if(!K(p.Gx,p.Gy))throw new Error("bad curve params: generator point");const q=e.mul(e.pow(p.a,J),pe),te=e.mul(e.sqr(p.b),BigInt(27));if(e.is0(e.add(q,te)))throw new Error("bad curve params: a or b");function A(B,o,n=!1){if(!e.isValid(o)||n&&e.is0(o))throw new Error(`bad point coordinate ${B}`);return o}function G(B){if(!(B instanceof g))throw new Error("ProjectivePoint expected")}function z(B){if(!R||!R.basises)throw new Error("no endo");return ae(B,R.basises,w.ORDER)}const re=h.memoized((B,o)=>{const{X:n,Y:t,Z:i}=B;if(e.eql(i,e.ONE))return{x:n,y:t};const a=B.is0();o==null&&(o=a?e.ONE:e.inv(i));const f=e.mul(n,o),d=e.mul(t,o),u=e.mul(i,o);if(a)return{x:e.ZERO,y:e.ZERO};if(!e.eql(u,e.ONE))throw new Error("invZ was invalid");return{x:f,y:d}}),P=h.memoized(B=>{if(B.is0()){if(s.allowInfinityPoint&&!e.is0(B.Y))return;throw new Error("bad point: ZERO")}const{x:o,y:n}=B.toAffine();if(!e.isValid(o)||!e.isValid(n))throw new Error("bad point: x or y not field elements");if(!K(o,n))throw new Error("bad point: equation left != right");if(!B.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});function $(B,o,n,t,i){return n=new g(e.mul(n.X,B),n.Y,n.Z),o=L.negateCt(t,o),n=L.negateCt(i,n),o.add(n)}class g{constructor(o,n,t){this.X=A("x",o),this.Y=A("y",n,!0),this.Z=A("z",t),Object.freeze(this)}static CURVE(){return p}static fromAffine(o){const{x:n,y:t}=o||{};if(!o||!e.isValid(n)||!e.isValid(t))throw new Error("invalid affine point");if(o instanceof g)throw new Error("projective point not allowed");return e.is0(n)&&e.is0(t)?g.ZERO:new g(n,t,e.ONE)}static fromBytes(o){const n=g.fromAffine(O(h._abytes2(o,void 0,"point")));return n.assertValidity(),n}static fromHex(o){return g.fromBytes(h.ensureBytes("pointHex",o))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(o=8,n=!0){return k.createCache(this,o),n||this.multiply(J),this}assertValidity(){P(this)}hasEvenY(){const{y:o}=this.toAffine();if(!e.isOdd)throw new Error("Field doesn't support isOdd");return!e.isOdd(o)}equals(o){G(o);const{X:n,Y:t,Z:i}=this,{X:a,Y:f,Z:d}=o,u=e.eql(e.mul(n,d),e.mul(a,i)),y=e.eql(e.mul(t,d),e.mul(f,i));return u&&y}negate(){return new g(this.X,e.neg(this.Y),this.Z)}double(){const{a:o,b:n}=p,t=e.mul(n,J),{X:i,Y:a,Z:f}=this;let d=e.ZERO,u=e.ZERO,y=e.ZERO,m=e.mul(i,i),Z=e.mul(a,a),v=e.mul(f,f),b=e.mul(i,a);return b=e.add(b,b),y=e.mul(i,f),y=e.add(y,y),d=e.mul(o,y),u=e.mul(t,v),u=e.add(d,u),d=e.sub(Z,u),u=e.add(Z,u),u=e.mul(d,u),d=e.mul(b,d),y=e.mul(t,y),v=e.mul(o,v),b=e.sub(m,v),b=e.mul(o,b),b=e.add(b,y),y=e.add(m,m),m=e.add(y,m),m=e.add(m,v),m=e.mul(m,b),u=e.add(u,m),v=e.mul(a,f),v=e.add(v,v),m=e.mul(v,b),d=e.sub(d,m),y=e.mul(v,Z),y=e.add(y,y),y=e.add(y,y),new g(d,u,y)}add(o){G(o);const{X:n,Y:t,Z:i}=this,{X:a,Y:f,Z:d}=o;let u=e.ZERO,y=e.ZERO,m=e.ZERO;const Z=p.a,v=e.mul(p.b,J);let b=e.mul(n,a),x=e.mul(t,f),_=e.mul(i,d),Y=e.add(n,t),S=e.add(a,f);Y=e.mul(Y,S),S=e.add(b,x),Y=e.sub(Y,S),S=e.add(n,i);let V=e.add(a,d);return S=e.mul(S,V),V=e.add(b,_),S=e.sub(S,V),V=e.add(t,i),u=e.add(f,d),V=e.mul(V,u),u=e.add(x,_),V=e.sub(V,u),m=e.mul(Z,S),u=e.mul(v,_),m=e.add(u,m),u=e.sub(x,m),m=e.add(x,m),y=e.mul(u,m),x=e.add(b,b),x=e.add(x,b),_=e.mul(Z,_),S=e.mul(v,S),x=e.add(x,_),_=e.sub(b,_),_=e.mul(Z,_),S=e.add(S,_),b=e.mul(x,S),y=e.add(y,b),b=e.mul(V,S),u=e.mul(Y,u),u=e.sub(u,b),b=e.mul(Y,x),m=e.mul(V,m),m=e.add(m,b),new g(u,y,m)}subtract(o){return this.add(o.negate())}is0(){return this.equals(g.ZERO)}multiply(o){const{endo:n}=s;if(!w.isValidNot0(o))throw new Error("invalid scalar: out of range");let t,i;const a=f=>k.cached(this,f,d=>L.normalizeZ(g,d));if(n){const{k1neg:f,k1:d,k2neg:u,k2:y}=z(o),{p:m,f:Z}=a(d),{p:v,f:b}=a(y);i=Z.add(b),t=$(n.beta,m,v,f,u)}else{const{p:f,f:d}=a(o);t=f,i=d}return L.normalizeZ(g,[t,i])[0]}multiplyUnsafe(o){const{endo:n}=s,t=this;if(!w.isValid(o))throw new Error("invalid scalar: out of range");if(o===D||t.is0())return g.ZERO;if(o===M)return t;if(k.hasCache(this))return this.multiply(o);if(n){const{k1neg:i,k1:a,k2neg:f,k2:d}=z(o),{p1:u,p2:y}=L.mulEndoUnsafe(g,t,a,d);return $(n.beta,u,y,i,f)}else return k.unsafe(t,o)}multiplyAndAddUnsafe(o,n,t){const i=this.multiplyUnsafe(n).add(o.multiplyUnsafe(t));return i.is0()?void 0:i}toAffine(o){return re(this,o)}isTorsionFree(){const{isTorsionFree:o}=s;return l===M?!0:o?o(g,this):k.unsafe(this,F).is0()}clearCofactor(){const{clearCofactor:o}=s;return l===M?this:o?o(g,this):this.multiplyUnsafe(l)}isSmallOrder(){return this.multiplyUnsafe(l).is0()}toBytes(o=!0){return h._abool2(o,"isCompressed"),this.assertValidity(),E(g,this,o)}toHex(o=!0){return H.bytesToHex(this.toBytes(o))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(o=!0){return this.toBytes(o)}_setWindowSize(o){this.precompute(o)}static normalizeZ(o){return L.normalizeZ(g,o)}static msm(o,n){return L.pippenger(g,w,o,n)}static fromPrivateKey(o){return g.BASE.multiply(I(w,o))}}g.BASE=new g(p.Gx,p.Gy,e.ONE),g.ZERO=new g(e.ZERO,e.ONE,e.ZERO),g.Fp=e,g.Fn=w;const W=w.BITS,k=new L.wNAF(g,s.endo?Math.ceil(W/2):W);return g.BASE.precompute(8),g}function fe(r){return Uint8Array.of(r?2:3)}function ye(r,s){return{secretKey:s.BYTES,publicKey:1+r.BYTES,publicKeyUncompressed:1+2*r.BYTES,publicKeyHasPrefix:!0,signature:2*s.BYTES}}function he(r,s={}){const{Fn:c}=r,e=s.randomBytes||H.randomBytes,w=Object.assign(ye(r.Fp,c),{seed:ee.getMinHashLength(c.ORDER)});function p(E){try{return!!I(c,E)}catch{return!1}}function l(E,O){const{publicKey:N,publicKeyUncompressed:K}=w;try{const q=E.length;return O===!0&&q!==N||O===!1&&q!==K?!1:!!r.fromBytes(E)}catch{return!1}}function F(E=e(w.seed)){return ee.mapHashToField(h._abytes2(E,w.seed,"seed"),c.ORDER)}function R(E,O=!0){return r.BASE.multiply(I(c,E)).toBytes(O)}function T(E){const O=F(E);return{secretKey:O,publicKey:R(O)}}function U(E){if(typeof E=="bigint")return!1;if(E instanceof r)return!0;const{secretKey:O,publicKey:N,publicKeyUncompressed:K}=w;if(c.allowedLengths||O===N)return;const q=h.ensureBytes("key",E).length;return q===N||q===K}function X(E,O,N=!0){if(U(E)===!0)throw new Error("first arg must be private key");if(U(O)===!1)throw new Error("second arg must be public key");const K=I(c,E);return r.fromHex(O).multiply(K).toBytes(N)}return Object.freeze({getPublicKey:R,getSharedSecret:X,keygen:T,Point:r,utils:{isValidSecretKey:p,isValidPublicKey:l,randomSecretKey:F,isValidPrivateKey:p,randomPrivateKey:F,normPrivateKeyToScalar:E=>I(c,E),precompute(E=8,O=r.BASE){return O.precompute(E,!1)}},lengths:w})}function me(r,s,c={}){H.ahash(s),h._validateObject(c,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const e=c.randomBytes||H.randomBytes,w=c.hmac||((n,...t)=>we.hmac(s,n,H.concatBytes(...t))),{Fp:p,Fn:l}=r,{ORDER:F,BITS:R}=l,{keygen:T,getPublicKey:U,getSharedSecret:X,utils:j,lengths:E}=he(r,c),O={prehash:!1,lowS:typeof c.lowS=="boolean"?c.lowS:!1,format:void 0,extraEntropy:!1},N="compact";function K(n){const t=F>>M;return n>t}function q(n,t){if(!l.isValidNot0(t))throw new Error(`invalid signature ${n}: out of range 1..Point.Fn.ORDER`);return t}function te(n,t){oe(t);const i=E.signature,a=t==="compact"?i:t==="recovered"?i+1:void 0;return h._abytes2(n,a,`${t} signature`)}class A{constructor(t,i,a){this.r=q("r",t),this.s=q("s",i),a!=null&&(this.recovery=a),Object.freeze(this)}static fromBytes(t,i=N){te(t,i);let a;if(i==="der"){const{r:y,s:m}=C.toSig(h._abytes2(t));return new A(y,m)}i==="recovered"&&(a=t[0],i="compact",t=t.subarray(1));const f=l.BYTES,d=t.subarray(0,f),u=t.subarray(f,f*2);return new A(l.fromBytes(d),l.fromBytes(u),a)}static fromHex(t,i){return this.fromBytes(H.hexToBytes(t),i)}addRecoveryBit(t){return new A(this.r,this.s,t)}recoverPublicKey(t){const i=p.ORDER,{r:a,s:f,recovery:d}=this;if(d==null||![0,1,2,3].includes(d))throw new Error("recovery id invalid");if(F*le<i&&d>1)throw new Error("recovery id is ambiguous for h>1 curve");const y=d===2||d===3?a+F:a;if(!p.isValid(y))throw new Error("recovery id 2 or 3 invalid");const m=p.toBytes(y),Z=r.fromBytes(H.concatBytes(fe((d&1)===0),m)),v=l.inv(y),b=z(h.ensureBytes("msgHash",t)),x=l.create(-b*v),_=l.create(f*v),Y=r.BASE.multiplyUnsafe(x).add(Z.multiplyUnsafe(_));if(Y.is0())throw new Error("point at infinify");return Y.assertValidity(),Y}hasHighS(){return K(this.s)}toBytes(t=N){if(oe(t),t==="der")return H.hexToBytes(C.hexFromSig(this));const i=l.toBytes(this.r),a=l.toBytes(this.s);if(t==="recovered"){if(this.recovery==null)throw new Error("recovery bit must be present");return H.concatBytes(Uint8Array.of(this.recovery),i,a)}return H.concatBytes(i,a)}toHex(t){return H.bytesToHex(this.toBytes(t))}assertValidity(){}static fromCompact(t){return A.fromBytes(h.ensureBytes("sig",t),"compact")}static fromDER(t){return A.fromBytes(h.ensureBytes("sig",t),"der")}normalizeS(){return this.hasHighS()?new A(this.r,l.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return H.bytesToHex(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return H.bytesToHex(this.toBytes("compact"))}}const G=c.bits2int||function(t){if(t.length>8192)throw new Error("input is too large");const i=h.bytesToNumberBE(t),a=t.length*8-R;return a>0?i>>BigInt(a):i},z=c.bits2int_modN||function(t){return l.create(G(t))},re=h.bitMask(R);function P(n){return h.aInRange("num < 2^"+R,n,D,re),l.toBytes(n)}function $(n,t){return h._abytes2(n,void 0,"message"),t?h._abytes2(s(n),void 0,"prehashed message"):n}function g(n,t,i){if(["recovered","canonical"].some(x=>x in i))throw new Error("sign() legacy options not supported");const{lowS:a,prehash:f,extraEntropy:d}=ne(i,O);n=$(n,f);const u=z(n),y=I(l,t),m=[P(y),P(u)];if(d!=null&&d!==!1){const x=d===!0?e(E.secretKey):d;m.push(h.ensureBytes("extraEntropy",x))}const Z=H.concatBytes(...m),v=u;function b(x){const _=G(x);if(!l.isValidNot0(_))return;const Y=l.inv(_),S=r.BASE.multiply(_).toAffine(),V=l.create(S.x);if(V===D)return;const Q=l.create(Y*l.create(v+V*y));if(Q===D)return;let se=(S.x===V?0:2)|Number(S.y&M),ie=Q;return a&&K(Q)&&(ie=l.neg(Q),se^=1),new A(V,ie,se)}return{seed:Z,k2sig:b}}function W(n,t,i={}){n=h.ensureBytes("message",n);const{seed:a,k2sig:f}=g(n,t,i);return h.createHmacDrbg(s.outputLen,l.BYTES,w)(a,f)}function k(n){let t;const i=typeof n=="string"||H.isBytes(n),a=!i&&n!==null&&typeof n=="object"&&typeof n.r=="bigint"&&typeof n.s=="bigint";if(!i&&!a)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(a)t=new A(n.r,n.s);else if(i){try{t=A.fromBytes(h.ensureBytes("sig",n),"der")}catch(f){if(!(f instanceof C.Err))throw f}if(!t)try{t=A.fromBytes(h.ensureBytes("sig",n),"compact")}catch{return!1}}return t||!1}function B(n,t,i,a={}){const{lowS:f,prehash:d,format:u}=ne(a,O);if(i=h.ensureBytes("publicKey",i),t=$(h.ensureBytes("message",t),d),"strict"in a)throw new Error("options.strict was renamed to lowS");const y=u===void 0?k(n):A.fromBytes(h.ensureBytes("sig",n),u);if(y===!1)return!1;try{const m=r.fromBytes(i);if(f&&y.hasHighS())return!1;const{r:Z,s:v}=y,b=z(t),x=l.inv(v),_=l.create(b*x),Y=l.create(Z*x),S=r.BASE.multiplyUnsafe(_).add(m.multiplyUnsafe(Y));return S.is0()?!1:l.create(S.x)===Z}catch{return!1}}function o(n,t,i={}){const{prehash:a}=ne(i,O);return t=$(t,a),A.fromBytes(n,"recovered").recoverPublicKey(t).toBytes()}return Object.freeze({keygen:T,getPublicKey:U,getSharedSecret:X,utils:j,lengths:E,Point:r,sign:W,verify:B,recoverPublicKey:o,Signature:A,hash:s})}function ge(r){const s={a:r.a,b:r.b,p:r.Fp.ORDER,n:r.n,h:r.h,Gx:r.Gx,Gy:r.Gy},c=r.Fp;let e=r.allowedPrivateKeyLengths?Array.from(new Set(r.allowedPrivateKeyLengths.map(l=>Math.ceil(l/2)))):void 0;const w=ee.Field(s.n,{BITS:r.nBitLength,allowedLengths:e,modFromBytes:r.wrapPrivateKey}),p={Fp:c,Fn:w,allowInfinityPoint:r.allowInfinityPoint,endo:r.endo,isTorsionFree:r.isTorsionFree,clearCofactor:r.clearCofactor,fromBytes:r.fromBytes,toBytes:r.toBytes};return{CURVE:s,curveOpts:p}}function be(r){const{CURVE:s,curveOpts:c}=ge(r),e={hmac:r.hmac,randomBytes:r.randomBytes,lowS:r.lowS,bits2int:r.bits2int,bits2int_modN:r.bits2int_modN};return{CURVE:s,curveOpts:c,hash:r.hash,ecdsaOpts:e}}function Ee(r,s){const c=s.Point;return Object.assign({},s,{ProjectivePoint:c,CURVE:Object.assign({},r,ee.nLength(c.Fn.ORDER,c.Fn.BITS))})}function Be(r){const{CURVE:s,curveOpts:c,hash:e,ecdsaOpts:w}=be(r),p=de(s,c),l=me(p,e,w);return Ee(r,l)}exports.DER=C;exports.DERErr=ue;exports._normFnElement=I;exports._splitEndoScalar=ae;exports.ecdh=he;exports.ecdsa=me;exports.weierstrass=Be;exports.weierstrassN=de;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index211.cjs");function d(r,i={}){const{dir:n,size:e=32}=i;if(e===0)return r;const t=r.replace("0x","");if(t.length>e*2)throw new a.SizeExceedsPaddingSizeError({size:Math.ceil(t.length/2),targetSize:e,type:"Hex"});return`0x${t[n==="right"?"padEnd":"padStart"](e*2,"0")}`}exports.pad=d;