@gardenfi/utils 2.1.3-beta.22 → 2.1.3-beta.23

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (53) hide show
  1. package/dist/index15.cjs +1 -1
  2. package/dist/index15.js +4 -4
  3. package/dist/index23.cjs +1 -1
  4. package/dist/index23.js +13 -31
  5. package/dist/index24.cjs +1 -1
  6. package/dist/index24.js +58 -32
  7. package/dist/index25.cjs +16 -1
  8. package/dist/index25.js +113 -11
  9. package/dist/index26.cjs +1 -1
  10. package/dist/index26.js +32 -58
  11. package/dist/index27.cjs +1 -1
  12. package/dist/index27.js +31 -13
  13. package/dist/index28.cjs +1 -16
  14. package/dist/index28.js +11 -113
  15. package/dist/index283.cjs +1 -1
  16. package/dist/index283.js +1 -1
  17. package/dist/index285.cjs +1 -1
  18. package/dist/index285.js +1 -1
  19. package/dist/index290.cjs +1 -1
  20. package/dist/index290.js +1 -1
  21. package/dist/index291.cjs +1 -1
  22. package/dist/index291.js +138 -10
  23. package/dist/index292.cjs +1 -1
  24. package/dist/index292.js +42 -19
  25. package/dist/index293.cjs +1 -1
  26. package/dist/index293.js +73 -134
  27. package/dist/index294.cjs +1 -1
  28. package/dist/index294.js +2 -43
  29. package/dist/index295.cjs +1 -1
  30. package/dist/index295.js +10 -77
  31. package/dist/index296.cjs +1 -1
  32. package/dist/index296.js +20 -2
  33. package/dist/index297.cjs +1 -1
  34. package/dist/index297.js +1 -1
  35. package/dist/index300.cjs +1 -1
  36. package/dist/index300.js +1 -1
  37. package/dist/index302.cjs +1 -1
  38. package/dist/index302.js +2 -2
  39. package/dist/index306.cjs +1 -1
  40. package/dist/index306.js +2 -2
  41. package/dist/index307.cjs +1 -1
  42. package/dist/index307.js +1 -1
  43. package/dist/index308.cjs +1 -1
  44. package/dist/index308.js +63 -4
  45. package/dist/index309.cjs +1 -1
  46. package/dist/index309.js +40 -59
  47. package/dist/index310.cjs +1 -1
  48. package/dist/index310.js +5 -5
  49. package/dist/index311.cjs +1 -1
  50. package/dist/index311.js +5 -45
  51. package/dist/index9.cjs +1 -1
  52. package/dist/index9.js +4 -4
  53. package/package.json +1 -1
package/dist/index295.js CHANGED
@@ -1,81 +1,14 @@
1
- import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index290.js";
2
- function y(o, t, s, n) {
3
- if (typeof o.setBigUint64 == "function")
4
- return o.setBigUint64(t, s, n);
5
- const i = BigInt(32), h = BigInt(4294967295), e = Number(s >> i & h), r = Number(s & h), c = n ? 4 : 0, u = n ? 0 : 4;
6
- o.setUint32(t + c, e, n), o.setUint32(t + u, r, n);
7
- }
8
- function U(o, t, s) {
9
- return o & t ^ ~o & s;
10
- }
11
- function _(o, t, s) {
12
- return o & t ^ o & s ^ t & s;
13
- }
14
- class m extends g {
15
- constructor(t, s, n, i) {
16
- 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);
17
- }
18
- update(t) {
19
- b(this), t = a(t), d(t);
20
- const { view: s, buffer: n, blockLen: i } = this, h = t.length;
21
- for (let e = 0; e < h; ) {
22
- const r = Math.min(i - this.pos, h - e);
23
- if (r === i) {
24
- const c = l(t);
25
- for (; i <= h - e; e += i)
26
- this.process(c, e);
27
- continue;
28
- }
29
- n.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === i && (this.process(s, 0), this.pos = 0);
30
- }
31
- return this.length += t.length, this.roundClean(), this;
32
- }
33
- digestInto(t) {
34
- b(this), x(t, this), this.finished = !0;
35
- const { buffer: s, view: n, blockLen: i, isLE: h } = this;
36
- let { pos: e } = this;
37
- s[e++] = 128, w(this.buffer.subarray(e)), this.padOffset > i - e && (this.process(n, 0), e = 0);
38
- for (let f = e; f < i; f++)
39
- s[f] = 0;
40
- y(n, i - 8, BigInt(this.length * 8), h), this.process(n, 0);
41
- const r = l(t), c = this.outputLen;
42
- if (c % 4)
43
- throw new Error("_sha2: outputLen should be aligned to 32bit");
44
- const u = c / 4, p = this.get();
45
- if (u > p.length)
46
- throw new Error("_sha2: outputLen bigger than state");
47
- for (let f = 0; f < u; f++)
48
- r.setUint32(4 * f, p[f], h);
49
- }
50
- digest() {
51
- const { buffer: t, outputLen: s } = this;
52
- this.digestInto(t);
53
- const n = t.slice(0, s);
54
- return this.destroy(), n;
55
- }
56
- _cloneInto(t) {
57
- t || (t = new this.constructor()), t.set(...this.get());
58
- const { blockLen: s, buffer: n, length: i, finished: h, destroyed: e, pos: r } = this;
59
- return t.destroyed = e, t.finished = h, t.length = i, t.pos = r, i % s && t.buffer.set(n), t;
60
- }
61
- clone() {
62
- return this._cloneInto();
1
+ import { BaseError as i } from "./index56.js";
2
+ class d extends i {
3
+ constructor(e) {
4
+ const { docsPath: s, field: r, metaMessages: a } = e;
5
+ super(`Invalid Sign-In with Ethereum message field "${r}".`, {
6
+ docsPath: s,
7
+ metaMessages: a,
8
+ name: "SiweInvalidMessageFieldError"
9
+ });
63
10
  }
64
11
  }
65
- const B = /* @__PURE__ */ Uint32Array.from([
66
- 1779033703,
67
- 3144134277,
68
- 1013904242,
69
- 2773480762,
70
- 1359893119,
71
- 2600822924,
72
- 528734635,
73
- 1541459225
74
- ]);
75
12
  export {
76
- U as Chi,
77
- m as HashMD,
78
- _ as Maj,
79
- B as SHA256_IV,
80
- y as setBigUint64
13
+ d as SiweInvalidMessageFieldError
81
14
  };
package/dist/index296.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;
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;
package/dist/index296.js CHANGED
@@ -1,4 +1,22 @@
1
- const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
1
+ function o(e) {
2
+ if (/[^a-z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\.\-\_\~\%]/i.test(e) || /%[^0-9a-f]/i.test(e) || /%[0-9a-f](:?[^0-9a-f]|$)/i.test(e))
3
+ return !1;
4
+ const s = a(e), f = s[1], t = s[2], i = s[3], r = s[4], l = s[5];
5
+ if (!(f != null && f.length && i.length >= 0))
6
+ return !1;
7
+ if (t != null && t.length) {
8
+ if (!(i.length === 0 || /^\//.test(i)))
9
+ return !1;
10
+ } else if (/^\/\//.test(i))
11
+ return !1;
12
+ if (!/^[a-z][a-z0-9\+\-\.]*$/.test(f.toLowerCase()))
13
+ return !1;
14
+ let n = "";
15
+ return n += `${f}:`, t != null && t.length && (n += `//${t}`), n += i, r != null && r.length && (n += `?${r}`), l != null && l.length && (n += `#${l}`), n;
16
+ }
17
+ function a(e) {
18
+ return e.match(/(?:([^:\/?#]+):)?(?:\/\/([^\/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?/);
19
+ }
2
20
  export {
3
- o as crypto
21
+ o as isUri
4
22
  };
package/dist/index297.cjs CHANGED
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index308.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(`
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index310.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(`
2
2
  `);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/index297.js CHANGED
@@ -1,4 +1,4 @@
1
- import { getVersion as n } from "./index308.js";
1
+ import { getVersion as n } from "./index310.js";
2
2
  class c extends Error {
3
3
  constructor(t, e = {}) {
4
4
  const a = (() => {
package/dist/index300.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index246.cjs"),o=require("./index309.cjs"),n=require("./index260.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index246.cjs"),o=require("./index308.cjs"),n=require("./index260.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;
package/dist/index300.js CHANGED
@@ -1,5 +1,5 @@
1
1
  import { keccak_256 as f } from "./index246.js";
2
- import { from as m } from "./index309.js";
2
+ import { from as m } from "./index308.js";
3
3
  import { fromBytes as s } from "./index260.js";
4
4
  function p(t, o = {}) {
5
5
  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
package/dist/index302.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index309.cjs"),c=require("./index310.cjs"),o=require("./index297.cjs"),m=require("./index300.cjs"),b=/^0x[a-fA-F0-9]{40}$/;function i(e,t={}){const{strict:s=!0}=t;if(!b.test(e))throw new a({address:e,cause:new l});if(s){if(e.toLowerCase()===e)return;if(d(e)!==e)throw new a({address:e,cause:new h})}}function d(e){if(c.checksum.has(e))return c.checksum.get(e);i(e,{strict:!1});const t=e.substring(2).toLowerCase(),s=m.keccak256(f.fromString(t),{as:"Bytes"}),n=t.split("");for(let r=0;r<40;r+=2)s[r>>1]>>4>=8&&n[r]&&(n[r]=n[r].toUpperCase()),(s[r>>1]&15)>=8&&n[r+1]&&(n[r+1]=n[r+1].toUpperCase());const u=`0x${n.join("")}`;return c.checksum.set(e,u),u}function p(e,t={}){const{strict:s=!0}=t??{};try{return i(e,{strict:s}),!0}catch{return!1}}class a extends o.BaseError{constructor({address:t,cause:s}){super(`Address "${t}" is invalid.`,{cause:s}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidAddressError"})}}class l extends o.BaseError{constructor(){super("Address is not a 20 byte (40 hexadecimal character) value."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidInputError"})}}class h extends o.BaseError{constructor(){super("Address does not match its checksum counterpart."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidChecksumError"})}}exports.InvalidAddressError=a;exports.InvalidChecksumError=h;exports.InvalidInputError=l;exports.assert=i;exports.checksum=d;exports.validate=p;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index308.cjs"),c=require("./index311.cjs"),o=require("./index297.cjs"),m=require("./index300.cjs"),b=/^0x[a-fA-F0-9]{40}$/;function i(e,t={}){const{strict:s=!0}=t;if(!b.test(e))throw new a({address:e,cause:new l});if(s){if(e.toLowerCase()===e)return;if(d(e)!==e)throw new a({address:e,cause:new h})}}function d(e){if(c.checksum.has(e))return c.checksum.get(e);i(e,{strict:!1});const t=e.substring(2).toLowerCase(),s=m.keccak256(f.fromString(t),{as:"Bytes"}),n=t.split("");for(let r=0;r<40;r+=2)s[r>>1]>>4>=8&&n[r]&&(n[r]=n[r].toUpperCase()),(s[r>>1]&15)>=8&&n[r+1]&&(n[r+1]=n[r+1].toUpperCase());const u=`0x${n.join("")}`;return c.checksum.set(e,u),u}function p(e,t={}){const{strict:s=!0}=t??{};try{return i(e,{strict:s}),!0}catch{return!1}}class a extends o.BaseError{constructor({address:t,cause:s}){super(`Address "${t}" is invalid.`,{cause:s}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidAddressError"})}}class l extends o.BaseError{constructor(){super("Address is not a 20 byte (40 hexadecimal character) value."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidInputError"})}}class h extends o.BaseError{constructor(){super("Address does not match its checksum counterpart."),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Address.InvalidChecksumError"})}}exports.InvalidAddressError=a;exports.InvalidChecksumError=h;exports.InvalidInputError=l;exports.assert=i;exports.checksum=d;exports.validate=p;
package/dist/index302.js CHANGED
@@ -1,5 +1,5 @@
1
- import { fromString as d } from "./index309.js";
2
- import { checksum as o } from "./index310.js";
1
+ import { fromString as d } from "./index308.js";
2
+ import { checksum as o } from "./index311.js";
3
3
  import { BaseError as c } from "./index297.js";
4
4
  import { keccak256 as f } from "./index300.js";
5
5
  const l = /^0x[a-fA-F0-9]{40}$/;
package/dist/index306.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const lt=require("./index294.cjs"),p=require("./index293.cjs"),K=require("./index307.cjs"),et=require("./index285.cjs"),N=require("./index290.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;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const lt=require("./index292.cjs"),p=require("./index291.cjs"),K=require("./index307.cjs"),et=require("./index285.cjs"),N=require("./index290.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;
package/dist/index306.js CHANGED
@@ -1,5 +1,5 @@
1
- import { hmac as dt } from "./index294.js";
2
- import { _validateObject as at, bitMask as ft, abool as Q, ensureBytes as z, memoized as nt, createHmacDrbg as ht, bytesToNumberBE as ct, numberToHexUnpadded as M, aInRange as mt } from "./index293.js";
1
+ import { hmac as dt } from "./index292.js";
2
+ import { _validateObject as at, bitMask as ft, abool as Q, ensureBytes as z, memoized as nt, createHmacDrbg as ht, bytesToNumberBE as ct, numberToHexUnpadded as M, aInRange as mt } from "./index291.js";
3
3
  import { _createCurveFields as wt, wNAF as yt, normalizeZ as pt, pippenger as gt, mulEndoUnsafe as Et, negateCt as ot } from "./index307.js";
4
4
  import { Field as bt, mapHashToField as vt, getMinHashLength as Bt } from "./index285.js";
5
5
  import { concatBytes as I, abytes as it, bytesToHex as rt, hexToBytes as xt, randomBytes as St, isBytes as Rt } from "./index290.js";
package/dist/index307.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index293.cjs"),v=require("./index285.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const m=BigInt(0),h=BigInt(1);function b(t,r){const e=r.negate();return t?e:r}function B(t,r,e){const n=s=>s.pz,i=v.FpInvertBatch(t.Fp,e.map(n));return e.map((s,a)=>s.toAffine(i[a])).map(t.fromAffine)}function I(t,r){if(!Number.isSafeInteger(t)||t<=0||t>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+t)}function E(t,r){I(t,r);const e=Math.ceil(r/t)+1,n=2**(t-1),i=2**t,o=y.bitMask(t),s=BigInt(t);return{windows:e,windowSize:n,mask:o,maxNumber:i,shiftBy:s}}function M(t,r,e){const{windowSize:n,mask:i,maxNumber:o,shiftBy:s}=e;let a=Number(t&i),f=t>>s;a>n&&(a-=o,f+=h);const d=r*n,c=d+Math.abs(a)-1,p=a===0,l=a<0,w=r%2!==0;return{nextN:f,offset:c,isZero:p,isNeg:l,isNegF:w,offsetF:d}}function O(t,r){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,n)=>{if(!(e instanceof r))throw new Error("invalid point at index "+n)})}function R(t,r){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,n)=>{if(!r.isValid(e))throw new Error("invalid scalar at index "+n)})}const N=new WeakMap,Z=new WeakMap;function A(t){return Z.get(t)||1}function x(t){if(t!==m)throw new Error("invalid wNAF")}function j(t,r){return{constTimeNegate:b,hasPrecomputes(e){return A(e)!==1},unsafeLadder(e,n,i=t.ZERO){let o=e;for(;n>m;)n&h&&(i=i.add(o)),o=o.double(),n>>=h;return i},precomputeWindow(e,n){const{windows:i,windowSize:o}=E(n,r),s=[];let a=e,f=a;for(let d=0;d<i;d++){f=a,s.push(f);for(let c=1;c<o;c++)f=f.add(a),s.push(f);a=f.double()}return s},wNAF(e,n,i){let o=t.ZERO,s=t.BASE;const a=E(e,r);for(let f=0;f<a.windows;f++){const{nextN:d,offset:c,isZero:p,isNeg:l,isNegF:w,offsetF:g}=M(i,f,a);i=d,p?s=s.add(b(w,n[g])):o=o.add(b(l,n[c]))}return x(i),{p:o,f:s}},wNAFUnsafe(e,n,i,o=t.ZERO){const s=E(e,r);for(let a=0;a<s.windows&&i!==m;a++){const{nextN:f,offset:d,isZero:c,isNeg:p}=M(i,a,s);if(i=f,!c){const l=n[d];o=o.add(p?l.negate():l)}}return x(i),o},getPrecomputes(e,n,i){let o=N.get(n);return o||(o=this.precomputeWindow(n,e),e!==1&&(typeof i=="function"&&(o=i(o)),N.set(n,o))),o},wNAFCached(e,n,i){const o=A(e);return this.wNAF(o,this.getPrecomputes(o,e,i),n)},wNAFCachedUnsafe(e,n,i,o){const s=A(e);return s===1?this.unsafeLadder(e,n,o):this.wNAFUnsafe(s,this.getPrecomputes(s,e,i),n,o)},setWindowSize(e,n){I(n,r),Z.set(e,n),N.delete(e)}}}function _(t,r,e,n){let i=r,o=t.ZERO,s=t.ZERO;for(;e>m||n>m;)e&h&&(o=o.add(i)),n&h&&(s=s.add(i)),i=i.double(),e>>=h,n>>=h;return{p1:o,p2:s}}function C(t,r,e,n){O(e,t),R(n,r);const i=e.length,o=n.length;if(i!==o)throw new Error("arrays of points and scalars must have equal length");const s=t.ZERO,a=y.bitLen(BigInt(i));let f=1;a>12?f=a-3:a>4?f=a-2:a>0&&(f=2);const d=y.bitMask(f),c=new Array(Number(d)+1).fill(s),p=Math.floor((r.BITS-1)/f)*f;let l=s;for(let w=p;w>=0;w-=f){c.fill(s);for(let u=0;u<o;u++){const F=n[u],S=Number(F>>BigInt(w)&d);c[S]=c[S].add(e[u])}let g=s;for(let u=c.length-1,F=s;u>0;u--)F=F.add(c[u]),g=g.add(F);if(l=l.add(g),w!==0)for(let u=0;u<f;u++)l=l.double()}return l}function z(t,r){if(r){if(r.ORDER!==t)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return v.validateField(r),r}else return v.Field(t)}function k(t,r,e={}){if(!r||typeof r!="object")throw new Error(`expected valid ${t} CURVE object`);for(const a of["p","n","h"]){const f=r[a];if(!(typeof f=="bigint"&&f>m))throw new Error(`CURVE.${a} must be positive bigint`)}const n=z(r.p,e.Fp),i=z(r.n,e.Fn),s=["Gx","Gy","a","b"];for(const a of s)if(!n.isValid(r[a]))throw new Error(`CURVE.${a} must be valid field element of CURVE.Fp`);return{Fp:n,Fn:i}}exports._createCurveFields=k;exports.mulEndoUnsafe=_;exports.negateCt=b;exports.normalizeZ=B;exports.pippenger=C;exports.wNAF=j;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index291.cjs"),v=require("./index285.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const m=BigInt(0),h=BigInt(1);function b(t,r){const e=r.negate();return t?e:r}function B(t,r,e){const n=s=>s.pz,i=v.FpInvertBatch(t.Fp,e.map(n));return e.map((s,a)=>s.toAffine(i[a])).map(t.fromAffine)}function I(t,r){if(!Number.isSafeInteger(t)||t<=0||t>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+t)}function E(t,r){I(t,r);const e=Math.ceil(r/t)+1,n=2**(t-1),i=2**t,o=y.bitMask(t),s=BigInt(t);return{windows:e,windowSize:n,mask:o,maxNumber:i,shiftBy:s}}function M(t,r,e){const{windowSize:n,mask:i,maxNumber:o,shiftBy:s}=e;let a=Number(t&i),f=t>>s;a>n&&(a-=o,f+=h);const d=r*n,c=d+Math.abs(a)-1,p=a===0,l=a<0,w=r%2!==0;return{nextN:f,offset:c,isZero:p,isNeg:l,isNegF:w,offsetF:d}}function O(t,r){if(!Array.isArray(t))throw new Error("array expected");t.forEach((e,n)=>{if(!(e instanceof r))throw new Error("invalid point at index "+n)})}function R(t,r){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((e,n)=>{if(!r.isValid(e))throw new Error("invalid scalar at index "+n)})}const N=new WeakMap,Z=new WeakMap;function A(t){return Z.get(t)||1}function x(t){if(t!==m)throw new Error("invalid wNAF")}function j(t,r){return{constTimeNegate:b,hasPrecomputes(e){return A(e)!==1},unsafeLadder(e,n,i=t.ZERO){let o=e;for(;n>m;)n&h&&(i=i.add(o)),o=o.double(),n>>=h;return i},precomputeWindow(e,n){const{windows:i,windowSize:o}=E(n,r),s=[];let a=e,f=a;for(let d=0;d<i;d++){f=a,s.push(f);for(let c=1;c<o;c++)f=f.add(a),s.push(f);a=f.double()}return s},wNAF(e,n,i){let o=t.ZERO,s=t.BASE;const a=E(e,r);for(let f=0;f<a.windows;f++){const{nextN:d,offset:c,isZero:p,isNeg:l,isNegF:w,offsetF:g}=M(i,f,a);i=d,p?s=s.add(b(w,n[g])):o=o.add(b(l,n[c]))}return x(i),{p:o,f:s}},wNAFUnsafe(e,n,i,o=t.ZERO){const s=E(e,r);for(let a=0;a<s.windows&&i!==m;a++){const{nextN:f,offset:d,isZero:c,isNeg:p}=M(i,a,s);if(i=f,!c){const l=n[d];o=o.add(p?l.negate():l)}}return x(i),o},getPrecomputes(e,n,i){let o=N.get(n);return o||(o=this.precomputeWindow(n,e),e!==1&&(typeof i=="function"&&(o=i(o)),N.set(n,o))),o},wNAFCached(e,n,i){const o=A(e);return this.wNAF(o,this.getPrecomputes(o,e,i),n)},wNAFCachedUnsafe(e,n,i,o){const s=A(e);return s===1?this.unsafeLadder(e,n,o):this.wNAFUnsafe(s,this.getPrecomputes(s,e,i),n,o)},setWindowSize(e,n){I(n,r),Z.set(e,n),N.delete(e)}}}function _(t,r,e,n){let i=r,o=t.ZERO,s=t.ZERO;for(;e>m||n>m;)e&h&&(o=o.add(i)),n&h&&(s=s.add(i)),i=i.double(),e>>=h,n>>=h;return{p1:o,p2:s}}function C(t,r,e,n){O(e,t),R(n,r);const i=e.length,o=n.length;if(i!==o)throw new Error("arrays of points and scalars must have equal length");const s=t.ZERO,a=y.bitLen(BigInt(i));let f=1;a>12?f=a-3:a>4?f=a-2:a>0&&(f=2);const d=y.bitMask(f),c=new Array(Number(d)+1).fill(s),p=Math.floor((r.BITS-1)/f)*f;let l=s;for(let w=p;w>=0;w-=f){c.fill(s);for(let u=0;u<o;u++){const F=n[u],S=Number(F>>BigInt(w)&d);c[S]=c[S].add(e[u])}let g=s;for(let u=c.length-1,F=s;u>0;u--)F=F.add(c[u]),g=g.add(F);if(l=l.add(g),w!==0)for(let u=0;u<f;u++)l=l.double()}return l}function z(t,r){if(r){if(r.ORDER!==t)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return v.validateField(r),r}else return v.Field(t)}function k(t,r,e={}){if(!r||typeof r!="object")throw new Error(`expected valid ${t} CURVE object`);for(const a of["p","n","h"]){const f=r[a];if(!(typeof f=="bigint"&&f>m))throw new Error(`CURVE.${a} must be positive bigint`)}const n=z(r.p,e.Fp),i=z(r.n,e.Fn),s=["Gx","Gy","a","b"];for(const a of s)if(!n.isValid(r[a]))throw new Error(`CURVE.${a} must be valid field element of CURVE.Fp`);return{Fp:n,Fn:i}}exports._createCurveFields=k;exports.mulEndoUnsafe=_;exports.negateCt=b;exports.normalizeZ=B;exports.pippenger=C;exports.wNAF=j;
package/dist/index307.js CHANGED
@@ -1,4 +1,4 @@
1
- import { bitLen as B, bitMask as z } from "./index293.js";
1
+ import { bitLen as B, bitMask as z } from "./index291.js";
2
2
  import { validateField as Z, Field as O, FpInvertBatch as R } from "./index285.js";
3
3
  /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
4
4
  const g = BigInt(0), h = BigInt(1);
package/dist/index308.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index312.cjs");function r(){return e.version}exports.getVersion=r;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index297.cjs"),y=require("./index260.cjs"),s=require("./index309.cjs"),z=require("./index299.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;
package/dist/index308.js CHANGED
@@ -1,7 +1,66 @@
1
- import { version as r } from "./index312.js";
2
- function e() {
3
- return r;
1
+ import { BaseError as c } from "./index297.js";
2
+ import { padRight as h } from "./index260.js";
3
+ import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index309.js";
4
+ import { assertSize as p } from "./index299.js";
5
+ const l = /* @__PURE__ */ new TextEncoder();
6
+ function E(e) {
7
+ return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
8
+ }
9
+ function z(e) {
10
+ return e instanceof Uint8Array ? e : new Uint8Array(e);
11
+ }
12
+ function y(e, t = {}) {
13
+ const { size: r } = t;
14
+ let n = e;
15
+ r && (p(e, r), n = h(e, r));
16
+ let i = n.slice(2);
17
+ i.length % 2 && (i = `0${i}`);
18
+ const f = i.length / 2, a = new Uint8Array(f);
19
+ for (let s = 0, o = 0; s < f; s++) {
20
+ const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
21
+ if (d === void 0 || u === void 0)
22
+ throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
23
+ a[s] = d * 16 + u;
24
+ }
25
+ return a;
26
+ }
27
+ function C(e, t = {}) {
28
+ const { size: r } = t, n = l.encode(e);
29
+ return typeof r == "number" ? (g(n, r), x(n, r)) : n;
30
+ }
31
+ function x(e, t) {
32
+ return m(e, { dir: "right", size: t });
33
+ }
34
+ function U(e) {
35
+ return e.length;
36
+ }
37
+ class B extends c {
38
+ constructor({ givenSize: t, maxSize: r }) {
39
+ super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
40
+ enumerable: !0,
41
+ configurable: !0,
42
+ writable: !0,
43
+ value: "Bytes.SizeOverflowError"
44
+ });
45
+ }
46
+ }
47
+ class O extends c {
48
+ constructor({ size: t, targetSize: r, type: n }) {
49
+ super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
50
+ enumerable: !0,
51
+ configurable: !0,
52
+ writable: !0,
53
+ value: "Bytes.SizeExceedsPaddingSizeError"
54
+ });
55
+ }
4
56
  }
5
57
  export {
6
- e as getVersion
58
+ O as SizeExceedsPaddingSizeError,
59
+ B as SizeOverflowError,
60
+ E as from,
61
+ z as fromArray,
62
+ y as fromHex,
63
+ C as fromString,
64
+ x as padRight,
65
+ U as size
7
66
  };
package/dist/index309.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index297.cjs"),y=require("./index260.cjs"),s=require("./index311.cjs"),z=require("./index299.cjs"),S=new TextEncoder;function x(e){return e instanceof Uint8Array?e:typeof e=="string"?h(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function h(e,t={}){const{size:r}=t;let n=e;r&&(z.assertSize(e,r),n=y.padRight(e,r));let i=n.slice(2);i.length%2&&(i=`0${i}`);const d=i.length/2,f=new Uint8Array(d);for(let c=0,o=0;c<d;c++){const u=s.charCodeToBase16(i.charCodeAt(o++)),b=s.charCodeToBase16(i.charCodeAt(o++));if(u===void 0||b===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[o-2]}${i[o-1]}" in "${i}").`);f[c]=u*16+b}return f}function m(e,t={}){const{size:r}=t,n=S.encode(e);return typeof r=="number"?(s.assertSize(n,r),l(n,r)):n}function l(e,t){return s.pad(e,{dir:"right",size:t})}function E(e){return e.length}class p extends a.BaseError{constructor({givenSize:t,maxSize:r}){super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class $ extends a.BaseError{constructor({size:t,targetSize:r,type:n}){super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.SizeExceedsPaddingSizeError=$;exports.SizeOverflowError=p;exports.from=x;exports.fromArray=g;exports.fromHex=h;exports.fromString=m;exports.padRight=l;exports.size=E;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index308.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;
package/dist/index309.js CHANGED
@@ -1,66 +1,47 @@
1
- import { BaseError as c } from "./index297.js";
2
- import { padRight as h } from "./index260.js";
3
- import { charCodeToBase16 as b, assertSize as g, pad as m } from "./index311.js";
4
- import { assertSize as p } from "./index299.js";
5
- const l = /* @__PURE__ */ new TextEncoder();
6
- function E(e) {
7
- return e instanceof Uint8Array ? e : typeof e == "string" ? y(e) : z(e);
8
- }
9
- function z(e) {
10
- return e instanceof Uint8Array ? e : new Uint8Array(e);
11
- }
12
- function y(e, t = {}) {
13
- const { size: r } = t;
14
- let n = e;
15
- r && (p(e, r), n = h(e, r));
16
- let i = n.slice(2);
17
- i.length % 2 && (i = `0${i}`);
18
- const f = i.length / 2, a = new Uint8Array(f);
19
- for (let s = 0, o = 0; s < f; s++) {
20
- const d = b(i.charCodeAt(o++)), u = b(i.charCodeAt(o++));
21
- if (d === void 0 || u === void 0)
22
- throw new c(`Invalid byte sequence ("${i[o - 2]}${i[o - 1]}" in "${i}").`);
23
- a[s] = d * 16 + u;
24
- }
25
- return a;
26
- }
27
- function C(e, t = {}) {
28
- const { size: r } = t, n = l.encode(e);
29
- return typeof r == "number" ? (g(n, r), x(n, r)) : n;
30
- }
31
- function x(e, t) {
32
- return m(e, { dir: "right", size: t });
33
- }
34
- function U(e) {
35
- return e.length;
36
- }
37
- class B extends c {
38
- constructor({ givenSize: t, maxSize: r }) {
39
- super(`Size cannot exceed \`${r}\` bytes. Given size: \`${t}\` bytes.`), Object.defineProperty(this, "name", {
40
- enumerable: !0,
41
- configurable: !0,
42
- writable: !0,
43
- value: "Bytes.SizeOverflowError"
1
+ import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index308.js";
2
+ function p(e, t) {
3
+ if (d(e) > t)
4
+ throw new u({
5
+ givenSize: d(e),
6
+ maxSize: t
44
7
  });
45
- }
46
8
  }
47
- class O extends c {
48
- constructor({ size: t, targetSize: r, type: n }) {
49
- super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
50
- enumerable: !0,
51
- configurable: !0,
52
- writable: !0,
53
- value: "Bytes.SizeExceedsPaddingSizeError"
9
+ const n = {
10
+ zero: 48,
11
+ nine: 57,
12
+ A: 65,
13
+ F: 70,
14
+ a: 97,
15
+ f: 102
16
+ };
17
+ function s(e) {
18
+ if (e >= n.zero && e <= n.nine)
19
+ return e - n.zero;
20
+ if (e >= n.A && e <= n.F)
21
+ return e - (n.A - 10);
22
+ if (e >= n.a && e <= n.f)
23
+ return e - (n.a - 10);
24
+ }
25
+ function S(e, t = {}) {
26
+ const { dir: z, size: i = 32 } = t;
27
+ if (i === 0)
28
+ return e;
29
+ if (e.length > i)
30
+ throw new a({
31
+ size: e.length,
32
+ targetSize: i,
33
+ type: "Bytes"
54
34
  });
35
+ const o = new Uint8Array(i);
36
+ for (let r = 0; r < i; r++) {
37
+ const f = z === "right";
38
+ o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
55
39
  }
40
+ return o;
56
41
  }
57
42
  export {
58
- O as SizeExceedsPaddingSizeError,
59
- B as SizeOverflowError,
60
- E as from,
61
- z as fromArray,
62
- y as fromHex,
63
- C as fromString,
64
- x as padRight,
65
- U as size
43
+ p as assertSize,
44
+ n as charCodeMap,
45
+ s as charCodeToBase16,
46
+ S as pad
66
47
  };
package/dist/index310.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index313.cjs"),e={checksum:new c.LruMap(8192)},s=e.checksum;exports.checksum=s;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index312.cjs");function r(){return e.version}exports.getVersion=r;
package/dist/index310.js CHANGED
@@ -1,7 +1,7 @@
1
- import { LruMap as c } from "./index313.js";
2
- const e = {
3
- checksum: /* @__PURE__ */ new c(8192)
4
- }, m = e.checksum;
1
+ import { version as r } from "./index312.js";
2
+ function e() {
3
+ return r;
4
+ }
5
5
  export {
6
- m as checksum
6
+ e as getVersion
7
7
  };
package/dist/index311.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index309.cjs");function s(e,t){if(o.size(e)>t)throw new o.SizeOverflowError({givenSize:o.size(e),maxSize:t})}const n={zero:48,nine:57,A:65,F:70,a:97,f:102};function u(e){if(e>=n.zero&&e<=n.nine)return e-n.zero;if(e>=n.A&&e<=n.F)return e-(n.A-10);if(e>=n.a&&e<=n.f)return e-(n.a-10)}function z(e,t={}){const{dir:f,size:r=32}=t;if(r===0)return e;if(e.length>r)throw new o.SizeExceedsPaddingSizeError({size:e.length,targetSize:r,type:"Bytes"});const d=new Uint8Array(r);for(let i=0;i<r;i++){const a=f==="right";d[a?i:r-i-1]=e[a?i:e.length-i-1]}return d}exports.assertSize=s;exports.charCodeMap=n;exports.charCodeToBase16=u;exports.pad=z;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index313.cjs"),e={checksum:new c.LruMap(8192)},s=e.checksum;exports.checksum=s;
package/dist/index311.js CHANGED
@@ -1,47 +1,7 @@
1
- import { size as d, SizeOverflowError as u, SizeExceedsPaddingSizeError as a } from "./index309.js";
2
- function p(e, t) {
3
- if (d(e) > t)
4
- throw new u({
5
- givenSize: d(e),
6
- maxSize: t
7
- });
8
- }
9
- const n = {
10
- zero: 48,
11
- nine: 57,
12
- A: 65,
13
- F: 70,
14
- a: 97,
15
- f: 102
16
- };
17
- function s(e) {
18
- if (e >= n.zero && e <= n.nine)
19
- return e - n.zero;
20
- if (e >= n.A && e <= n.F)
21
- return e - (n.A - 10);
22
- if (e >= n.a && e <= n.f)
23
- return e - (n.a - 10);
24
- }
25
- function S(e, t = {}) {
26
- const { dir: z, size: i = 32 } = t;
27
- if (i === 0)
28
- return e;
29
- if (e.length > i)
30
- throw new a({
31
- size: e.length,
32
- targetSize: i,
33
- type: "Bytes"
34
- });
35
- const o = new Uint8Array(i);
36
- for (let r = 0; r < i; r++) {
37
- const f = z === "right";
38
- o[f ? r : i - r - 1] = e[f ? r : e.length - r - 1];
39
- }
40
- return o;
41
- }
1
+ import { LruMap as c } from "./index313.js";
2
+ const e = {
3
+ checksum: /* @__PURE__ */ new c(8192)
4
+ }, m = e.checksum;
42
5
  export {
43
- p as assertSize,
44
- n as charCodeMap,
45
- s as charCodeToBase16,
46
- S as pad
6
+ m as checksum
47
7
  };
package/dist/index9.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("tough-cookie"),g=require("fetch-cookie"),n=require("./index17.cjs"),k=require("./index13.cjs"),f=require("./index14.cjs"),h=require("./index3.cjs"),m=require("./index27.cjs"),y=require("./index26.cjs"),C=require("./index22.cjs"),T=require("./index28.cjs"),v=require("./index24.cjs"),S=c=>c&&c.__esModule?c:{default:c},p=S(g);class u{constructor(t,i,e){if(this.url=t.endpoint("siwe"),this.walletClient=i,this.domain=(e==null?void 0:e.domain)||"app.garden.finance",this.domain.startsWith("https://")&&(this.domain=this.domain.split("https://")[1]),this.signingStatement=(e==null?void 0:e.signingStatement)??"Garden.fi",this.store=(e==null?void 0:e.store)??(typeof window<"u"?window.localStorage:new k.MemoryStorage),typeof window>"u"){const r=new w.CookieJar;this.fetchWithCookies=p.default(fetch,r)}else this.fetchWithCookies=window.fetch.bind(window)}static fromDigestKey(t,i,e){const r=m.createWalletClient({account:C.privateKeyToAccount(h.add0x(i.digestKey)),transport:y.http(),chain:v.mainnet});return new u(t,r,e)}verifyToken(t,i){try{const e=h.parseJwt(t);if(!e)return n.Ok(!1);const r=Math.floor(Date.now()/1e3)+120;return n.Ok(e.exp>r&&e.user_id.toLowerCase()===i.toLowerCase())}catch{return n.Ok(!1)}}async getToken(){var s;if(!((s=this.walletClient.account)!=null&&s.address))return n.Err("Wallet client does not have an account");const t=this.store.getItem(f.StoreKeys.AUTH_TOKEN);if(t){const o=this.verifyToken(t,this.walletClient.account.address);if(o.ok&&o.val)return n.Ok(t)}const i=await this.signStatement();if(i.error)return n.Err(i.error);let e;try{const a=await(await this.fetchWithCookies(this.url.endpoint("tokens"),{method:"POST",body:JSON.stringify({...i.val}),headers:{"Content-Type":"application/json"},credentials:"include"})).json();if(a.error||!a.result)return n.Err(a.error??"Failed to get token");e=a.result}catch(o){return n.Err("Failed to get token",o)}if(!this.verifyToken(e,this.walletClient.account.address).val)throw new Error("Token verification failed");return this.store.setItem(f.StoreKeys.AUTH_TOKEN,e),n.Ok(e)}async signStatement(){var a;if(!((a=this.walletClient.account)!=null&&a.address))return n.Err("Wallet client does not have a valid account");const t=new Date,i=new Date(t.getTime()+300*1e3);let e;try{const l=await(await this.fetchWithCookies(this.url.endpoint("challenges"),{method:"POST",headers:{"Content-Type":"application/json"},credentials:"include"})).json();if(l.error||!l.result)return n.Err("Failed to get nonce");e=l.result}catch(d){return n.Err("Failed to get nonce",d)}const r=await this.walletClient.getChainId(),s=T.createSiweMessage({domain:this.domain,address:this.walletClient.account.address,statement:this.signingStatement,nonce:e,uri:"https://"+this.domain,version:"1",chainId:r,notBefore:i}),o=await this.walletClient.signMessage({account:this.walletClient.account,message:s});return n.Ok({message:s,signature:o,nonce:e})}async getAuthHeaders(){const t=await this.getToken();return t.error?n.Err(t.error):n.Ok({Authorization:h.Authorization(t.val)})}}exports.Siwe=u;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("tough-cookie"),g=require("fetch-cookie"),n=require("./index17.cjs"),k=require("./index13.cjs"),f=require("./index14.cjs"),h=require("./index3.cjs"),m=require("./index23.cjs"),y=require("./index24.cjs"),C=require("./index22.cjs"),T=require("./index25.cjs"),v=require("./index26.cjs"),S=c=>c&&c.__esModule?c:{default:c},p=S(g);class u{constructor(t,i,e){if(this.url=t.endpoint("siwe"),this.walletClient=i,this.domain=(e==null?void 0:e.domain)||"app.garden.finance",this.domain.startsWith("https://")&&(this.domain=this.domain.split("https://")[1]),this.signingStatement=(e==null?void 0:e.signingStatement)??"Garden.fi",this.store=(e==null?void 0:e.store)??(typeof window<"u"?window.localStorage:new k.MemoryStorage),typeof window>"u"){const r=new w.CookieJar;this.fetchWithCookies=p.default(fetch,r)}else this.fetchWithCookies=window.fetch.bind(window)}static fromDigestKey(t,i,e){const r=m.createWalletClient({account:C.privateKeyToAccount(h.add0x(i.digestKey)),transport:y.http(),chain:v.mainnet});return new u(t,r,e)}verifyToken(t,i){try{const e=h.parseJwt(t);if(!e)return n.Ok(!1);const r=Math.floor(Date.now()/1e3)+120;return n.Ok(e.exp>r&&e.user_id.toLowerCase()===i.toLowerCase())}catch{return n.Ok(!1)}}async getToken(){var s;if(!((s=this.walletClient.account)!=null&&s.address))return n.Err("Wallet client does not have an account");const t=this.store.getItem(f.StoreKeys.AUTH_TOKEN);if(t){const o=this.verifyToken(t,this.walletClient.account.address);if(o.ok&&o.val)return n.Ok(t)}const i=await this.signStatement();if(i.error)return n.Err(i.error);let e;try{const a=await(await this.fetchWithCookies(this.url.endpoint("tokens"),{method:"POST",body:JSON.stringify({...i.val}),headers:{"Content-Type":"application/json"},credentials:"include"})).json();if(a.error||!a.result)return n.Err(a.error??"Failed to get token");e=a.result}catch(o){return n.Err("Failed to get token",o)}if(!this.verifyToken(e,this.walletClient.account.address).val)throw new Error("Token verification failed");return this.store.setItem(f.StoreKeys.AUTH_TOKEN,e),n.Ok(e)}async signStatement(){var a;if(!((a=this.walletClient.account)!=null&&a.address))return n.Err("Wallet client does not have a valid account");const t=new Date,i=new Date(t.getTime()+300*1e3);let e;try{const l=await(await this.fetchWithCookies(this.url.endpoint("challenges"),{method:"POST",headers:{"Content-Type":"application/json"},credentials:"include"})).json();if(l.error||!l.result)return n.Err("Failed to get nonce");e=l.result}catch(d){return n.Err("Failed to get nonce",d)}const r=await this.walletClient.getChainId(),s=T.createSiweMessage({domain:this.domain,address:this.walletClient.account.address,statement:this.signingStatement,nonce:e,uri:"https://"+this.domain,version:"1",chainId:r,notBefore:i}),o=await this.walletClient.signMessage({account:this.walletClient.account,message:s});return n.Ok({message:s,signature:o,nonce:e})}async getAuthHeaders(){const t=await this.getToken();return t.error?n.Err(t.error):n.Ok({Authorization:h.Authorization(t.val)})}}exports.Siwe=u;
package/dist/index9.js CHANGED
@@ -4,11 +4,11 @@ import { Ok as s, Err as r } from "./index17.js";
4
4
  import { MemoryStorage as w } from "./index13.js";
5
5
  import { StoreKeys as d } from "./index14.js";
6
6
  import { add0x as g, parseJwt as p, Authorization as k } from "./index3.js";
7
- import { createWalletClient as y } from "./index27.js";
8
- import { http as C } from "./index26.js";
7
+ import { createWalletClient as y } from "./index23.js";
8
+ import { http as C } from "./index24.js";
9
9
  import { privateKeyToAccount as T } from "./index22.js";
10
- import { createSiweMessage as v } from "./index28.js";
11
- import { mainnet as S } from "./index24.js";
10
+ import { createSiweMessage as v } from "./index25.js";
11
+ import { mainnet as S } from "./index26.js";
12
12
  class f {
13
13
  constructor(e, n, t) {
14
14
  if (this.url = e.endpoint("siwe"), this.walletClient = n, this.domain = (t == null ? void 0 : t.domain) || "app.garden.finance", this.domain.startsWith("https://") && (this.domain = this.domain.split("https://")[1]), this.signingStatement = (t == null ? void 0 : t.signingStatement) ?? "Garden.fi", this.store = (t == null ? void 0 : t.store) ?? (typeof window < "u" ? window.localStorage : new w()), typeof window > "u") {
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@gardenfi/utils",
3
- "version": "2.1.3-beta.22",
3
+ "version": "2.1.3-beta.23",
4
4
  "type": "module",
5
5
  "scripts": {
6
6
  "build": "vite build",