@gardenfi/utils 2.4.6-beta.1 → 2.4.6

package/dist/index294.js

@@ -1,137 +1,81 @@
-import { assert as p } from "./index309.js";
-import { BaseError as u } from "./index304.js";
-import { size as y, padLeft as f, fromString as x, fromBoolean as w, fromNumber as E, padRight as P, concat as g } from "./index291.js";
-import { integerRegex as A, bytesRegex as $, arrayRegex as L } from "./index310.js";
-import { prepareParameters as z, encode as I } from "./index311.js";
-function N(n, e, t) {
-  const { checksumAddress: r = !1 } = {};
-  if (n.length !== e.length)
-    throw new b({
-      expectedLength: n.length,
-      givenLength: e.length
-    });
-  const a = z({
-    checksumAddress: r,
-    parameters: n,
-    values: e
-  }), s = I(a);
-  return s.length === 0 ? "0x" : s;
+import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index291.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 m(n, e) {
-  if (n.length !== e.length)
-    throw new b({
-      expectedLength: n.length,
-      givenLength: e.length
-    });
-  const t = [];
-  for (let r = 0; r < n.length; r++) {
-    const a = n[r], s = e[r];
-    t.push(m.encode(a, s));
-  }
-  return g(...t);
+function U(o, t, s) {
+  return o & t ^ ~o & s;
 }
-(function(n) {
-  function e(t, r, a = !1) {
-    if (t === "address") {
-      const i = r;
-      return p(i), f(i.toLowerCase(), a ? 32 : 0);
-    }
-    if (t === "string")
-      return x(r);
-    if (t === "bytes")
-      return r;
-    if (t === "bool")
-      return f(w(r), a ? 32 : 1);
-    const s = t.match(A);
-    if (s) {
-      const [i, o, c = "256"] = s, h = Number.parseInt(c) / 8;
-      return E(r, {
-        size: a ? 32 : h,
-        signed: o === "int"
-      });
-    }
-    const d = t.match($);
-    if (d) {
-      const [i, o] = d;
-      if (Number.parseInt(o) !== (r.length - 2) / 2)
-        throw new M({
-          expectedSize: Number.parseInt(o),
-          value: r
-        });
-      return P(r, a ? 32 : 0);
-    }
-    const l = t.match(L);
-    if (l && Array.isArray(r)) {
-      const [i, o] = l, c = [];
-      for (let h = 0; h < r.length; h++)
-        c.push(e(o, r[h], !0));
-      return c.length === 0 ? "0x" : g(...c);
-    }
-    throw new j(t);
+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);
   }
-  n.encode = e;
-})(m || (m = {}));
-class R extends u {
-  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"
-    });
+  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;
   }
-}
-class M extends u {
-  constructor({ expectedSize: e, value: t }) {
-    super(`Size of bytes "${t}" (bytes${y(t)}) does not match expected size (bytes${e}).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "AbiParameters.BytesSizeMismatchError"
-    });
+  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);
   }
-}
-class b extends u {
-  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"
-    });
+  digest() {
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const n = t.slice(0, s);
+    return this.destroy(), n;
   }
-}
-class _ extends u {
-  constructor(e) {
-    super(`Value \`${e}\` is not a valid array.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "AbiParameters.InvalidArrayError"
-    });
+  _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;
   }
-}
-class j extends u {
-  constructor(e) {
-    super(`Type \`${e}\` is not a valid ABI Type.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "AbiParameters.InvalidTypeError"
-    });
+  clone() {
+    return this._cloneInto();
   }
 }
+const B = /* @__PURE__ */ Uint32Array.from([
+  1779033703,
+  3144134277,
+  1013904242,
+  2773480762,
+  1359893119,
+  2600822924,
+  528734635,
+  1541459225
+]);
 export {
-  R as ArrayLengthMismatchError,
-  M as BytesSizeMismatchError,
-  _ as InvalidArrayError,
-  j as InvalidTypeError,
-  b as LengthMismatchError,
-  N as encode,
-  m as encodePacked
+  U as Chi,
+  m as HashMD,
+  _ as Maj,
+  B as SHA256_IV,
+  y as setBigUint64
 };

package/dist/index295.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index41.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 o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

package/dist/index295.js

@@ -1,14 +1,4 @@
-import { BaseError as i } from "./index41.js";
-class d extends i {
-  constructor(e) {
-    const { docsPath: s, field: r, metaMessages: a } = e;
-    super(`Invalid Sign-In with Ethereum message field "${r}".`, {
-      docsPath: s,
-      metaMessages: a,
-      name: "SiweInvalidMessageFieldError"
-    });
-  }
-}
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  d as SiweInvalidMessageFieldError
+  o as crypto
 };

package/dist/index296.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"});const lt=require("./index298.cjs"),p=require("./index297.cjs"),K=require("./index299.cjs"),et=require("./index256.cjs"),N=require("./index291.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function nt(e){e.lowS!==void 0&&p.abool("lowS",e.lowS),e.prehash!==void 0&&p.abool("prehash",e.prehash)}class ot extends Error{constructor(s=""){super(s)}}const z={Err:ot,_tlv:{encode:(e,s)=>{const{Err:t}=z;if(e<0||e>256)throw new t("tlv.encode: wrong tag");if(s.length&1)throw new t("tlv.encode: unpadded data");const m=s.length/2,g=p.numberToHexUnpadded(m);if(g.length/2&128)throw new t("tlv.encode: long form length too big");const B=m>127?p.numberToHexUnpadded(g.length/2|128):"";return p.numberToHexUnpadded(e)+B+g+s},decode(e,s){const{Err:t}=z;let m=0;if(e<0||e>256)throw new t("tlv.encode: wrong tag");if(s.length<2||s[m++]!==e)throw new t("tlv.decode: wrong tlv");const g=s[m++],B=!!(g&128);let u=0;if(!B)u=g;else{const R=g&127;if(!R)throw new t("tlv.decode(long): indefinite length not supported");if(R>4)throw new t("tlv.decode(long): byte length is too big");const q=s.subarray(m,m+R);if(q.length!==R)throw new t("tlv.decode: length bytes not complete");if(q[0]===0)throw new t("tlv.decode(long): zero leftmost byte");for(const L of q)u=u<<8|L;if(m+=R,u<128)throw new t("tlv.decode(long): not minimal encoding")}const S=s.subarray(m,m+u);if(S.length!==u)throw new t("tlv.decode: wrong value length");return{v:S,l:s.subarray(m+u)}}},_int:{encode(e){const{Err:s}=z;if(e<k)throw new s("integer: negative integers are not allowed");let t=p.numberToHexUnpadded(e);if(Number.parseInt(t[0],16)&8&&(t="00"+t),t.length&1)throw new s("unexpected DER parsing assertion: unpadded hex");return t},decode(e){const{Err:s}=z;if(e[0]&128)throw new s("invalid signature integer: negative");if(e[0]===0&&!(e[1]&128))throw new s("invalid signature integer: unnecessary leading zero");return p.bytesToNumberBE(e)}},toSig(e){const{Err:s,_int:t,_tlv:m}=z,g=p.ensureBytes("signature",e),{v:B,l:u}=m.decode(48,g);if(u.length)throw new s("invalid signature: left bytes after parsing");const{v:S,l:R}=m.decode(2,B),{v:q,l:L}=m.decode(2,R);if(L.length)throw new s("invalid signature: left bytes after parsing");return{r:t.decode(S),s:t.decode(q)}},hexFromSig(e){const{_tlv:s,_int:t}=z,m=s.encode(2,t.encode(e.r)),g=s.encode(2,t.encode(e.s)),B=m+g;return s.encode(48,B)}},k=BigInt(0),C=BigInt(1),ut=BigInt(2),W=BigInt(3),dt=BigInt(4);function st(e,s,t){function m(g){const B=e.sqr(g),u=e.mul(B,g);return e.add(e.add(u,e.mul(g,s)),t)}return m}function rt(e,s,t){const{BYTES:m}=e;function g(B){let u;if(typeof B=="bigint")u=B;else{let S=p.ensureBytes("private key",B);if(s){if(!s.includes(S.length*2))throw new Error("invalid private key");const R=new Uint8Array(m);R.set(S,R.length-S.length),S=R}try{u=e.fromBytes(S)}catch{throw new Error(`invalid private key: expected ui8a of size ${m}, got ${typeof B}`)}}if(t&&(u=e.create(u)),!e.isValidNot0(u))throw new Error("invalid private key: out of range [1..N-1]");return u}return g}function it(e,s={}){const{Fp:t,Fn:m}=K._createCurveFields("weierstrass",e,s),{h:g,n:B}=e;p._validateObject(s,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:u}=s;if(u&&(!t.is0(e.a)||typeof u.beta!="bigint"||typeof u.splitScalar!="function"))throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function');function S(){if(!t.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}function R(v,r,i){const{x:n,y:o}=r.toAffine(),a=t.toBytes(n);if(p.abool("isCompressed",i),i){S();const d=!t.isOdd(o);return N.concatBytes(at(d),a)}else return N.concatBytes(Uint8Array.of(4),a,t.toBytes(o))}function q(v){N.abytes(v);const r=t.BYTES,i=r+1,n=2*r+1,o=v.length,a=v[0],d=v.subarray(1);if(o===i&&(a===2||a===3)){const c=t.fromBytes(d);if(!t.isValid(c))throw new Error("bad point: is not on curve, wrong x");const l=Z(c);let h;try{h=t.sqrt(l)}catch(E){const y=E instanceof Error?": "+E.message:"";throw new Error("bad point: is not on curve, sqrt error"+y)}S();const f=t.isOdd(h);return(a&1)===1!==f&&(h=t.neg(h)),{x:c,y:h}}else if(o===n&&a===4){const c=t.fromBytes(d.subarray(r*0,r*1)),l=t.fromBytes(d.subarray(r*1,r*2));if(!_(c,l))throw new Error("bad point: is not on curve");return{x:c,y:l}}else throw new Error(`bad point: got length ${o}, expected compressed=${i} or uncompressed=${n}`)}const L=s.toBytes||R,$=s.fromBytes||q,Z=st(t,e.a,e.b);function _(v,r){const i=t.sqr(r),n=Z(v);return t.eql(i,n)}if(!_(e.Gx,e.Gy))throw new Error("bad curve params: generator point");const Q=t.mul(t.pow(e.a,W),dt),J=t.mul(t.sqr(e.b),BigInt(27));if(t.is0(t.add(Q,J)))throw new Error("bad curve params: a or b");function j(v,r,i=!1){if(!t.isValid(r)||i&&t.is0(r))throw new Error(`bad point coordinate ${v}`);return r}function P(v){if(!(v instanceof w))throw new Error("ProjectivePoint expected")}const G=p.memoized((v,r)=>{const{px:i,py:n,pz:o}=v;if(t.eql(o,t.ONE))return{x:i,y:n};const a=v.is0();r==null&&(r=a?t.ONE:t.inv(o));const d=t.mul(i,r),c=t.mul(n,r),l=t.mul(o,r);if(a)return{x:t.ZERO,y:t.ZERO};if(!t.eql(l,t.ONE))throw new Error("invZ was invalid");return{x:d,y:c}}),I=p.memoized(v=>{if(v.is0()){if(s.allowInfinityPoint&&!t.is0(v.py))return;throw new Error("bad point: ZERO")}const{x:r,y:i}=v.toAffine();if(!t.isValid(r)||!t.isValid(i))throw new Error("bad point: x or y not field elements");if(!_(r,i))throw new Error("bad point: equation left != right");if(!v.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});function X(v,r,i,n,o){return i=new w(t.mul(i.px,v),i.py,i.pz),r=K.negateCt(n,r),i=K.negateCt(o,i),r.add(i)}class w{constructor(r,i,n){this.px=j("x",r),this.py=j("y",i,!0),this.pz=j("z",n),Object.freeze(this)}static fromAffine(r){const{x:i,y:n}=r||{};if(!r||!t.isValid(i)||!t.isValid(n))throw new Error("invalid affine point");if(r instanceof w)throw new Error("projective point not allowed");return t.is0(i)&&t.is0(n)?w.ZERO:new w(i,n,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(r){return K.normalizeZ(w,"pz",r)}static fromBytes(r){return N.abytes(r),w.fromHex(r)}static fromHex(r){const i=w.fromAffine($(p.ensureBytes("pointHex",r)));return i.assertValidity(),i}static fromPrivateKey(r){const i=rt(m,s.allowedPrivateKeyLengths,s.wrapPrivateKey);return w.BASE.multiply(i(r))}static msm(r,i){return K.pippenger(w,m,r,i)}precompute(r=8,i=!0){return F.setWindowSize(this,r),i||this.multiply(W),this}_setWindowSize(r){this.precompute(r)}assertValidity(){I(this)}hasEvenY(){const{y:r}=this.toAffine();if(!t.isOdd)throw new Error("Field doesn't support isOdd");return!t.isOdd(r)}equals(r){P(r);const{px:i,py:n,pz:o}=this,{px:a,py:d,pz:c}=r,l=t.eql(t.mul(i,c),t.mul(a,o)),h=t.eql(t.mul(n,c),t.mul(d,o));return l&&h}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:r,b:i}=e,n=t.mul(i,W),{px:o,py:a,pz:d}=this;let c=t.ZERO,l=t.ZERO,h=t.ZERO,f=t.mul(o,o),x=t.mul(a,a),E=t.mul(d,d),y=t.mul(o,a);return y=t.add(y,y),h=t.mul(o,d),h=t.add(h,h),c=t.mul(r,h),l=t.mul(n,E),l=t.add(c,l),c=t.sub(x,l),l=t.add(x,l),l=t.mul(c,l),c=t.mul(y,c),h=t.mul(n,h),E=t.mul(r,E),y=t.sub(f,E),y=t.mul(r,y),y=t.add(y,h),h=t.add(f,f),f=t.add(h,f),f=t.add(f,E),f=t.mul(f,y),l=t.add(l,f),E=t.mul(a,d),E=t.add(E,E),f=t.mul(E,y),c=t.sub(c,f),h=t.mul(E,x),h=t.add(h,h),h=t.add(h,h),new w(c,l,h)}add(r){P(r);const{px:i,py:n,pz:o}=this,{px:a,py:d,pz:c}=r;let l=t.ZERO,h=t.ZERO,f=t.ZERO;const x=e.a,E=t.mul(e.b,W);let y=t.mul(i,a),T=t.mul(n,d),O=t.mul(o,c),A=t.add(i,n),b=t.add(a,d);A=t.mul(A,b),b=t.add(y,T),A=t.sub(A,b),b=t.add(i,o);let H=t.add(a,c);return b=t.mul(b,H),H=t.add(y,O),b=t.sub(b,H),H=t.add(n,o),l=t.add(d,c),H=t.mul(H,l),l=t.add(T,O),H=t.sub(H,l),f=t.mul(x,b),l=t.mul(E,O),f=t.add(l,f),l=t.sub(T,f),f=t.add(T,f),h=t.mul(l,f),T=t.add(y,y),T=t.add(T,y),O=t.mul(x,O),b=t.mul(E,b),T=t.add(T,O),O=t.sub(y,O),O=t.mul(x,O),b=t.add(b,O),y=t.mul(T,b),h=t.add(h,y),y=t.mul(H,b),l=t.mul(A,l),l=t.sub(l,y),y=t.mul(A,T),f=t.mul(H,f),f=t.add(f,y),new w(l,h,f)}subtract(r){return this.add(r.negate())}is0(){return this.equals(w.ZERO)}multiply(r){const{endo:i}=s;if(!m.isValidNot0(r))throw new Error("invalid scalar: out of range");let n,o;const a=d=>F.wNAFCached(this,d,w.normalizeZ);if(i){const{k1neg:d,k1:c,k2neg:l,k2:h}=i.splitScalar(r),{p:f,f:x}=a(c),{p:E,f:y}=a(h);o=x.add(y),n=X(i.beta,f,E,d,l)}else{const{p:d,f:c}=a(r);n=d,o=c}return w.normalizeZ([n,o])[0]}multiplyUnsafe(r){const{endo:i}=s,n=this;if(!m.isValid(r))throw new Error("invalid scalar: out of range");if(r===k||n.is0())return w.ZERO;if(r===C)return n;if(F.hasPrecomputes(this))return this.multiply(r);if(i){const{k1neg:o,k1:a,k2neg:d,k2:c}=i.splitScalar(r),{p1:l,p2:h}=K.mulEndoUnsafe(w,n,a,c);return X(i.beta,l,h,o,d)}else return F.wNAFCachedUnsafe(n,r)}multiplyAndAddUnsafe(r,i,n){const o=this.multiplyUnsafe(i).add(r.multiplyUnsafe(n));return o.is0()?void 0:o}toAffine(r){return G(this,r)}isTorsionFree(){const{isTorsionFree:r}=s;return g===C?!0:r?r(w,this):F.wNAFCachedUnsafe(this,B).is0()}clearCofactor(){const{clearCofactor:r}=s;return g===C?this:r?r(w,this):this.multiplyUnsafe(g)}toBytes(r=!0){return p.abool("isCompressed",r),this.assertValidity(),L(w,this,r)}toRawBytes(r=!0){return this.toBytes(r)}toHex(r=!0){return N.bytesToHex(this.toBytes(r))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}}w.BASE=new w(e.Gx,e.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO),w.Fp=t,w.Fn=m;const M=m.BITS,F=K.wNAF(w,s.endo?Math.ceil(M/2):M);return w}function at(e){return Uint8Array.of(e?2:3)}function ct(e,s,t={}){p._validateObject(s,{hash:"function"},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const m=s.randomBytes||N.randomBytes,g=s.hmac||((n,...o)=>lt.hmac(s.hash,n,N.concatBytes(...o))),{Fp:B,Fn:u}=e,{ORDER:S,BITS:R}=u;function q(n){const o=S>>C;return n>o}function L(n){return q(n)?u.neg(n):n}function $(n,o){if(!u.isValidNot0(o))throw new Error(`invalid signature ${n}: out of range 1..CURVE.n`)}class Z{constructor(o,a,d){$("r",o),$("s",a),this.r=o,this.s=a,d!=null&&(this.recovery=d),Object.freeze(this)}static fromCompact(o){const a=u.BYTES,d=p.ensureBytes("compactSignature",o,a*2);return new Z(u.fromBytes(d.subarray(0,a)),u.fromBytes(d.subarray(a,a*2)))}static fromDER(o){const{r:a,s:d}=z.toSig(p.ensureBytes("DER",o));return new Z(a,d)}assertValidity(){}addRecoveryBit(o){return new Z(this.r,this.s,o)}recoverPublicKey(o){const a=B.ORDER,{r:d,s:c,recovery:l}=this;if(l==null||![0,1,2,3].includes(l))throw new Error("recovery id invalid");if(S*ut<a&&l>1)throw new Error("recovery id is ambiguous for h>1 curve");const f=l===2||l===3?d+S:d;if(!B.isValid(f))throw new Error("recovery id 2 or 3 invalid");const x=B.toBytes(f),E=e.fromHex(N.concatBytes(at((l&1)===0),x)),y=u.inv(f),T=I(p.ensureBytes("msgHash",o)),O=u.create(-T*y),A=u.create(c*y),b=e.BASE.multiplyUnsafe(O).add(E.multiplyUnsafe(A));if(b.is0())throw new Error("point at infinify");return b.assertValidity(),b}hasHighS(){return q(this.s)}normalizeS(){return this.hasHighS()?new Z(this.r,u.neg(this.s),this.recovery):this}toBytes(o){if(o==="compact")return N.concatBytes(u.toBytes(this.r),u.toBytes(this.s));if(o==="der")return N.hexToBytes(z.hexFromSig(this));throw new Error("invalid format")}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return N.bytesToHex(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return N.bytesToHex(this.toBytes("compact"))}}const _=rt(u,t.allowedPrivateKeyLengths,t.wrapPrivateKey),Q={isValidPrivateKey(n){try{return _(n),!0}catch{return!1}},normPrivateKeyToScalar:_,randomPrivateKey:()=>{const n=S;return et.mapHashToField(m(et.getMinHashLength(n)),n)},precompute(n=8,o=e.BASE){return o.precompute(n,!1)}};function J(n,o=!0){return e.fromPrivateKey(n).toBytes(o)}function j(n){if(typeof n=="bigint")return!1;if(n instanceof e)return!0;const a=p.ensureBytes("key",n).length,d=B.BYTES,c=d+1,l=2*d+1;if(!(t.allowedPrivateKeyLengths||u.BYTES===c))return a===c||a===l}function P(n,o,a=!0){if(j(n)===!0)throw new Error("first arg must be private key");if(j(o)===!1)throw new Error("second arg must be public key");return e.fromHex(o).multiply(_(n)).toBytes(a)}const G=s.bits2int||function(n){if(n.length>8192)throw new Error("input is too large");const o=p.bytesToNumberBE(n),a=n.length*8-R;return a>0?o>>BigInt(a):o},I=s.bits2int_modN||function(n){return u.create(G(n))},X=p.bitMask(R);function w(n){return p.aInRange("num < 2^"+R,n,k,X),u.toBytes(n)}function M(n,o,a=F){if(["recovered","canonical"].some(A=>A in a))throw new Error("sign() legacy options not supported");const{hash:d}=s;let{lowS:c,prehash:l,extraEntropy:h}=a;c==null&&(c=!0),n=p.ensureBytes("msgHash",n),nt(a),l&&(n=p.ensureBytes("prehashed msgHash",d(n)));const f=I(n),x=_(o),E=[w(x),w(f)];if(h!=null&&h!==!1){const A=h===!0?m(B.BYTES):h;E.push(p.ensureBytes("extraEntropy",A))}const y=N.concatBytes(...E),T=f;function O(A){const b=G(A);if(!u.isValidNot0(b))return;const H=u.inv(b),V=e.BASE.multiply(b).toAffine(),U=u.create(V.x);if(U===k)return;const D=u.create(H*u.create(T+U*x));if(D===k)return;let tt=(V.x===U?0:2)|Number(V.y&C),Y=D;return c&&q(D)&&(Y=L(D),tt^=1),new Z(U,Y,tt)}return{seed:y,k2sig:O}}const F={lowS:s.lowS,prehash:!1},v={lowS:s.lowS,prehash:!1};function r(n,o,a=F){const{seed:d,k2sig:c}=M(n,o,a);return p.createHmacDrbg(s.hash.outputLen,u.BYTES,g)(d,c)}e.BASE.precompute(8);function i(n,o,a,d=v){const c=n;o=p.ensureBytes("msgHash",o),a=p.ensureBytes("publicKey",a),nt(d);const{lowS:l,prehash:h,format:f}=d;if("strict"in d)throw new Error("options.strict was renamed to lowS");if(f!==void 0&&!["compact","der","js"].includes(f))throw new Error('format must be "compact", "der" or "js"');const x=typeof c=="string"||N.isBytes(c),E=!x&&!f&&typeof c=="object"&&c!==null&&typeof c.r=="bigint"&&typeof c.s=="bigint";if(!x&&!E)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let y,T;try{if(E)if(f===void 0||f==="js")y=new Z(c.r,c.s);else throw new Error("invalid format");if(x){try{f!=="compact"&&(y=Z.fromDER(c))}catch(Y){if(!(Y instanceof z.Err))throw Y}!y&&f!=="der"&&(y=Z.fromCompact(c))}T=e.fromHex(a)}catch{return!1}if(!y||l&&y.hasHighS())return!1;h&&(o=s.hash(o));const{r:O,s:A}=y,b=I(o),H=u.inv(A),V=u.create(b*H),U=u.create(O*H),D=e.BASE.multiplyUnsafe(V).add(T.multiplyUnsafe(U));return D.is0()?!1:u.create(D.x)===O}return Object.freeze({getPublicKey:J,getSharedSecret:P,sign:r,verify:i,utils:Q,Point:e,Signature:Z})}function ft(e){const s={a:e.a,b:e.b,p:e.Fp.ORDER,n:e.n,h:e.h,Gx:e.Gx,Gy:e.Gy},t=e.Fp,m=et.Field(s.n,e.nBitLength),g={Fp:t,Fn:m,allowedPrivateKeyLengths:e.allowedPrivateKeyLengths,allowInfinityPoint:e.allowInfinityPoint,endo:e.endo,wrapPrivateKey:e.wrapPrivateKey,isTorsionFree:e.isTorsionFree,clearCofactor:e.clearCofactor,fromBytes:e.fromBytes,toBytes:e.toBytes};return{CURVE:s,curveOpts:g}}function ht(e){const{CURVE:s,curveOpts:t}=ft(e),m={hash:e.hash,hmac:e.hmac,randomBytes:e.randomBytes,lowS:e.lowS,bits2int:e.bits2int,bits2int_modN:e.bits2int_modN};return{CURVE:s,curveOpts:t,ecdsaOpts:m}}function yt(e,s){return Object.assign({},s,{ProjectivePoint:s.Point,CURVE:e})}function mt(e){const{CURVE:s,curveOpts:t,ecdsaOpts:m}=ht(e),g=it(s,t),B=ct(g,m,t);return yt(e,B)}exports.DER=z;exports.DERErr=ot;exports._legacyHelperEquat=st;exports._legacyHelperNormPriv=rt;exports.ecdsa=ct;exports.weierstrass=mt;exports.weierstrassN=it;