@gardenfi/utils 2.4.1 → 2.4.3

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 (109) hide show
  1. package/dist/index10.cjs +1 -1
  2. package/dist/index10.js +4 -4
  3. package/dist/index119.cjs +1 -1
  4. package/dist/index119.js +1 -1
  5. package/dist/index16.cjs +1 -1
  6. package/dist/index16.js +4 -4
  7. package/dist/index18.cjs +1 -1
  8. package/dist/index18.js +2 -2
  9. package/dist/index195.cjs +1 -1
  10. package/dist/index195.js +3 -3
  11. package/dist/index225.cjs +1 -1
  12. package/dist/index225.js +2 -2
  13. package/dist/index229.cjs +1 -1
  14. package/dist/index229.js +1 -1
  15. package/dist/index24.cjs +1 -1
  16. package/dist/index24.js +31 -13
  17. package/dist/index241.cjs +1 -1
  18. package/dist/index241.js +3 -3
  19. package/dist/index25.cjs +1 -1
  20. package/dist/index25.js +32 -58
  21. package/dist/index26.cjs +1 -16
  22. package/dist/index26.js +11 -113
  23. package/dist/index261.cjs +1 -2
  24. package/dist/index261.js +102 -40
  25. package/dist/index262.cjs +1 -1
  26. package/dist/index262.js +7 -2
  27. package/dist/index263.cjs +1 -1
  28. package/dist/index263.js +224 -5
  29. package/dist/index264.cjs +1 -1
  30. package/dist/index264.js +6 -10
  31. package/dist/index265.cjs +1 -1
  32. package/dist/index265.js +7 -20
  33. package/dist/index266.cjs +1 -1
  34. package/dist/index266.js +26 -8
  35. package/dist/index267.cjs +1 -1
  36. package/dist/index267.js +5 -66
  37. package/dist/index268.cjs +2 -1
  38. package/dist/index268.js +40 -64
  39. package/dist/index269.cjs +1 -1
  40. package/dist/index269.js +2 -187
  41. package/dist/index27.cjs +1 -1
  42. package/dist/index27.js +58 -32
  43. package/dist/index270.cjs +1 -1
  44. package/dist/index270.js +8 -20
  45. package/dist/index271.cjs +1 -1
  46. package/dist/index271.js +17 -40
  47. package/dist/index272.cjs +1 -1
  48. package/dist/index272.js +8 -76
  49. package/dist/index273.cjs +1 -1
  50. package/dist/index273.js +66 -40
  51. package/dist/index274.cjs +1 -1
  52. package/dist/index274.js +64 -15
  53. package/dist/index275.cjs +1 -1
  54. package/dist/index275.js +185 -12
  55. package/dist/index276.cjs +1 -1
  56. package/dist/index276.js +21 -11
  57. package/dist/index277.cjs +1 -2
  58. package/dist/index277.js +42 -18
  59. package/dist/index278.cjs +1 -1
  60. package/dist/index278.js +75 -13
  61. package/dist/index279.cjs +1 -1
  62. package/dist/index279.js +40 -11
  63. package/dist/index28.cjs +1 -1
  64. package/dist/index28.js +12 -26
  65. package/dist/index280.cjs +1 -1
  66. package/dist/index280.js +15 -102
  67. package/dist/index281.cjs +1 -1
  68. package/dist/index281.js +13 -6
  69. package/dist/index282.cjs +1 -1
  70. package/dist/index282.js +10 -222
  71. package/dist/index283.cjs +2 -1
  72. package/dist/index283.js +18 -6
  73. package/dist/index284.cjs +1 -1
  74. package/dist/index284.js +15 -7
  75. package/dist/index285.cjs +1 -1
  76. package/dist/index285.js +11 -26
  77. package/dist/index287.cjs +1 -1
  78. package/dist/index287.js +1 -1
  79. package/dist/index29.cjs +16 -1
  80. package/dist/index29.js +113 -7
  81. package/dist/index292.cjs +1 -1
  82. package/dist/index292.js +2 -2
  83. package/dist/index294.cjs +1 -1
  84. package/dist/index294.js +10 -138
  85. package/dist/index295.cjs +1 -1
  86. package/dist/index295.js +19 -42
  87. package/dist/index296.cjs +1 -1
  88. package/dist/index296.js +134 -73
  89. package/dist/index297.cjs +1 -1
  90. package/dist/index297.js +43 -2
  91. package/dist/index298.cjs +1 -1
  92. package/dist/index298.js +77 -10
  93. package/dist/index299.cjs +1 -1
  94. package/dist/index299.js +2 -20
  95. package/dist/index30.cjs +1 -1
  96. package/dist/index30.js +27 -31
  97. package/dist/index300.cjs +1 -1
  98. package/dist/index300.js +698 -68
  99. package/dist/index301.cjs +1 -1
  100. package/dist/index301.js +178 -675
  101. package/dist/index302.cjs +1 -1
  102. package/dist/index302.js +67 -200
  103. package/dist/index31.cjs +1 -1
  104. package/dist/index31.js +8 -12
  105. package/dist/index53.cjs +1 -1
  106. package/dist/index53.js +1 -1
  107. package/dist/index98.cjs +1 -1
  108. package/dist/index98.js +2 -2
  109. package/package.json +1 -1
package/dist/index296.js CHANGED
@@ -1,81 +1,142 @@
1
- import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index287.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);
1
+ import { hexToBytes as p, isBytes as B, abytes as v, bytesToHex as d, concatBytes as U } from "./index287.js";
2
+ import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index287.js";
3
+ /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
4
+ const y = /* @__PURE__ */ BigInt(0), g = /* @__PURE__ */ BigInt(1);
5
+ function k(t, r) {
6
+ if (typeof r != "boolean")
7
+ throw new Error(t + " boolean expected, got " + r);
7
8
  }
8
- function U(o, t, s) {
9
- return o & t ^ ~o & s;
9
+ function j(t) {
10
+ const r = t.toString(16);
11
+ return r.length & 1 ? "0" + r : r;
10
12
  }
11
- function _(o, t, s) {
12
- return o & t ^ o & s ^ t & s;
13
+ function h(t) {
14
+ if (typeof t != "string")
15
+ throw new Error("hex string expected, got " + typeof t);
16
+ return t === "" ? y : BigInt("0x" + t);
13
17
  }
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);
18
+ function H(t) {
19
+ return h(d(t));
20
+ }
21
+ function O(t) {
22
+ return v(t), h(d(Uint8Array.from(t).reverse()));
23
+ }
24
+ function x(t, r) {
25
+ return p(t.toString(16).padStart(r * 2, "0"));
26
+ }
27
+ function S(t, r) {
28
+ return x(t, r).reverse();
29
+ }
30
+ function _(t, r, n) {
31
+ let o;
32
+ if (typeof r == "string")
33
+ try {
34
+ o = p(r);
35
+ } catch (e) {
36
+ throw new Error(t + " must be hex string or Uint8Array, cause: " + e);
30
37
  }
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();
38
+ else if (B(r))
39
+ o = Uint8Array.from(r);
40
+ else
41
+ throw new Error(t + " must be hex string or Uint8Array");
42
+ const i = o.length;
43
+ if (typeof n == "number" && i !== n)
44
+ throw new Error(t + " of length " + n + " expected, got " + i);
45
+ return o;
46
+ }
47
+ const w = (t) => typeof t == "bigint" && y <= t;
48
+ function T(t, r, n) {
49
+ return w(t) && w(r) && w(n) && r <= t && t < n;
50
+ }
51
+ function $(t, r, n, o) {
52
+ if (!T(r, n, o))
53
+ throw new Error("expected valid " + t + ": " + n + " <= n < " + o + ", got " + r);
54
+ }
55
+ function M(t) {
56
+ let r;
57
+ for (r = 0; t > y; t >>= g, r += 1)
58
+ ;
59
+ return r;
60
+ }
61
+ const N = (t) => (g << BigInt(t)) - g;
62
+ function R(t, r, n) {
63
+ if (typeof t != "number" || t < 2)
64
+ throw new Error("hashLen must be a number");
65
+ if (typeof r != "number" || r < 2)
66
+ throw new Error("qByteLen must be a number");
67
+ if (typeof n != "function")
68
+ throw new Error("hmacFn must be a function");
69
+ const o = (u) => new Uint8Array(u), i = (u) => Uint8Array.of(u);
70
+ let e = o(t), s = o(t), f = 0;
71
+ const c = () => {
72
+ e.fill(1), s.fill(0), f = 0;
73
+ }, l = (...u) => n(s, e, ...u), m = (u = o(0)) => {
74
+ s = l(i(0), u), e = l(), u.length !== 0 && (s = l(i(1), u), e = l());
75
+ }, E = () => {
76
+ if (f++ >= 1e3)
77
+ throw new Error("drbg: tried 1000 values");
78
+ let u = 0;
79
+ const a = [];
80
+ for (; u < r; ) {
81
+ e = l();
82
+ const b = e.slice();
83
+ a.push(b), u += e.length;
84
+ }
85
+ return U(...a);
86
+ };
87
+ return (u, a) => {
88
+ c(), m(u);
89
+ let b;
90
+ for (; !(b = a(E())); )
91
+ m();
92
+ return c(), b;
93
+ };
94
+ }
95
+ function z(t, r, n = {}) {
96
+ if (!t || typeof t != "object")
97
+ throw new Error("expected valid options object");
98
+ function o(i, e, s) {
99
+ const f = t[i];
100
+ if (s && f === void 0)
101
+ return;
102
+ const c = typeof f;
103
+ if (c !== e || f === null)
104
+ throw new Error(`param "${i}" is invalid: expected ${e}, got ${c}`);
63
105
  }
106
+ Object.entries(r).forEach(([i, e]) => o(i, e, !1)), Object.entries(n).forEach(([i, e]) => o(i, e, !0));
107
+ }
108
+ function D(t) {
109
+ const r = /* @__PURE__ */ new WeakMap();
110
+ return (n, ...o) => {
111
+ const i = r.get(n);
112
+ if (i !== void 0)
113
+ return i;
114
+ const e = t(n, ...o);
115
+ return r.set(n, e), e;
116
+ };
64
117
  }
65
- const B = /* @__PURE__ */ Uint32Array.from([
66
- 1779033703,
67
- 3144134277,
68
- 1013904242,
69
- 2773480762,
70
- 1359893119,
71
- 2600822924,
72
- 528734635,
73
- 1541459225
74
- ]);
75
118
  export {
76
- U as Chi,
77
- m as HashMD,
78
- _ as Maj,
79
- B as SHA256_IV,
80
- y as setBigUint64
119
+ z as _validateObject,
120
+ $ as aInRange,
121
+ k as abool,
122
+ v as abytes,
123
+ W as anumber,
124
+ M as bitLen,
125
+ N as bitMask,
126
+ d as bytesToHex,
127
+ H as bytesToNumberBE,
128
+ O as bytesToNumberLE,
129
+ U as concatBytes,
130
+ R as createHmacDrbg,
131
+ _ as ensureBytes,
132
+ p as hexToBytes,
133
+ h as hexToNumber,
134
+ T as inRange,
135
+ B as isBytes,
136
+ D as memoized,
137
+ x as numberToBytesBE,
138
+ S as numberToBytesLE,
139
+ j as numberToHexUnpadded,
140
+ C as randomBytes,
141
+ G as utf8ToBytes
81
142
  };
package/dist/index297.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"});const i=require("./index287.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
package/dist/index297.js CHANGED
@@ -1,4 +1,45 @@
1
- const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
1
+ import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index287.js";
2
+ class r extends d {
3
+ constructor(t, i) {
4
+ super(), this.finished = !1, this.destroyed = !1, u(t);
5
+ const h = H(i);
6
+ if (this.iHash = t.create(), typeof this.iHash.update != "function")
7
+ throw new Error("Expected instance of class which extends utils.Hash");
8
+ this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
9
+ const o = this.blockLen, e = new Uint8Array(o);
10
+ e.set(h.length > o ? t.create().update(h).digest() : h);
11
+ for (let s = 0; s < e.length; s++)
12
+ e[s] ^= 54;
13
+ this.iHash.update(e), this.oHash = t.create();
14
+ for (let s = 0; s < e.length; s++)
15
+ e[s] ^= 106;
16
+ this.oHash.update(e), l(e);
17
+ }
18
+ update(t) {
19
+ return a(this), this.iHash.update(t), this;
20
+ }
21
+ digestInto(t) {
22
+ a(this), p(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
23
+ }
24
+ digest() {
25
+ const t = new Uint8Array(this.oHash.outputLen);
26
+ return this.digestInto(t), t;
27
+ }
28
+ _cloneInto(t) {
29
+ t || (t = Object.create(Object.getPrototypeOf(this), {}));
30
+ const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: c } = this;
31
+ return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = c, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
32
+ }
33
+ clone() {
34
+ return this._cloneInto();
35
+ }
36
+ destroy() {
37
+ this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
38
+ }
39
+ }
40
+ const y = (n, t, i) => new r(n, t).update(i).digest();
41
+ y.create = (n, t) => new r(n, t);
2
42
  export {
3
- o as crypto
43
+ r as HMAC,
44
+ y as hmac
4
45
  };
package/dist/index298.cjs CHANGED
@@ -1 +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;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index287.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;
package/dist/index298.js CHANGED
@@ -1,14 +1,81 @@
1
- import { BaseError as i } from "./index41.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
- });
1
+ import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index287.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();
10
63
  }
11
64
  }
65
+ const B = /* @__PURE__ */ Uint32Array.from([
66
+ 1779033703,
67
+ 3144134277,
68
+ 1013904242,
69
+ 2773480762,
70
+ 1359893119,
71
+ 2600822924,
72
+ 528734635,
73
+ 1541459225
74
+ ]);
12
75
  export {
13
- d as SiweInvalidMessageFieldError
76
+ U as Chi,
77
+ m as HashMD,
78
+ _ as Maj,
79
+ B as SHA256_IV,
80
+ y as setBigUint64
14
81
  };
package/dist/index299.cjs CHANGED
@@ -1 +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;
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;
package/dist/index299.js CHANGED
@@ -1,22 +1,4 @@
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
- }
1
+ const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
20
2
  export {
21
- o as isUri
3
+ o as crypto
22
4
  };
package/dist/index30.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index216.cjs"),a=e.defineChain({id:11155111,name:"Sepolia",nativeCurrency:{name:"Sepolia Ether",symbol:"ETH",decimals:18},rpcUrls:{default:{http:["https://sepolia.drpc.org"]}},blockExplorers:{default:{name:"Etherscan",url:"https://sepolia.etherscan.io",apiUrl:"https://api-sepolia.etherscan.io/api"}},contracts:{multicall3:{address:"0xca11bde05977b3631167028862be2a173976ca11",blockCreated:751532},ensRegistry:{address:"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e"},ensUniversalResolver:{address:"0xc8Af999e38273D658BE1b921b88A9Ddf005769cC",blockCreated:5317080}},testnet:!0});exports.sepolia=a;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index3.cjs");class i{constructor(e,t){this.maxRetries=Math.max(e,0),this.delay=t}async retry(e){let t=0,r;for(;t<this.maxRetries+1;)try{return await e()}catch(s){t++,r=s,await a.sleep(this.delay*t)}throw r}}exports.Retry=i;
package/dist/index30.js CHANGED
@@ -1,33 +1,29 @@
1
- import { defineChain as e } from "./index216.js";
2
- const s = /* @__PURE__ */ e({
3
- id: 11155111,
4
- name: "Sepolia",
5
- nativeCurrency: { name: "Sepolia Ether", symbol: "ETH", decimals: 18 },
6
- rpcUrls: {
7
- default: {
8
- http: ["https://sepolia.drpc.org"]
9
- }
10
- },
11
- blockExplorers: {
12
- default: {
13
- name: "Etherscan",
14
- url: "https://sepolia.etherscan.io",
15
- apiUrl: "https://api-sepolia.etherscan.io/api"
16
- }
17
- },
18
- contracts: {
19
- multicall3: {
20
- address: "0xca11bde05977b3631167028862be2a173976ca11",
21
- blockCreated: 751532
22
- },
23
- ensRegistry: { address: "0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e" },
24
- ensUniversalResolver: {
25
- address: "0xc8Af999e38273D658BE1b921b88A9Ddf005769cC",
26
- blockCreated: 5317080
27
- }
28
- },
29
- testnet: !0
30
- });
1
+ import { sleep as s } from "./index3.js";
2
+ class l {
3
+ /**
4
+ * @param {number} maxRetries - The maximum number of retries, if less < 0 then it is set to 0
5
+ * @param {number} delay - The delay between retries
6
+ */
7
+ constructor(e, t) {
8
+ this.maxRetries = Math.max(e, 0), this.delay = t;
9
+ }
10
+ /**
11
+ * Retries a function until it succeeds or the max number of retries is reached
12
+ *
13
+ * @param {() => Promise<T>} fn - The function to retry
14
+ * @return {Promise<T>} a Promise that resolves to the result of the function
15
+ */
16
+ async retry(e) {
17
+ let t = 0, r;
18
+ for (; t < this.maxRetries + 1; )
19
+ try {
20
+ return await e();
21
+ } catch (a) {
22
+ t++, r = a, await s(this.delay * t);
23
+ }
24
+ throw r;
25
+ }
26
+ }
31
27
  export {
32
- s as sepolia
28
+ l as Retry
33
29
  };
package/dist/index300.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(n,a,y){let i="";if(y)for(const e of Object.entries(y)){if(!e)continue;let s="";for(const t of e[1])s+=`[${t.type}${t.name?`:${t.name}`:""}]`;i+=`(${e[0]}{${s}})`}return a?`${a}:${n}${i}`:n}const d=new Map([["address",{type:"address"}],["bool",{type:"bool"}],["bytes",{type:"bytes"}],["bytes32",{type:"bytes32"}],["int",{type:"int256"}],["int256",{type:"int256"}],["string",{type:"string"}],["uint",{type:"uint256"}],["uint8",{type:"uint8"}],["uint16",{type:"uint16"}],["uint24",{type:"uint24"}],["uint32",{type:"uint32"}],["uint64",{type:"uint64"}],["uint96",{type:"uint96"}],["uint112",{type:"uint112"}],["uint160",{type:"uint160"}],["uint192",{type:"uint192"}],["uint256",{type:"uint256"}],["address owner",{type:"address",name:"owner"}],["address to",{type:"address",name:"to"}],["bool approved",{type:"bool",name:"approved"}],["bytes _data",{type:"bytes",name:"_data"}],["bytes data",{type:"bytes",name:"data"}],["bytes signature",{type:"bytes",name:"signature"}],["bytes32 hash",{type:"bytes32",name:"hash"}],["bytes32 r",{type:"bytes32",name:"r"}],["bytes32 root",{type:"bytes32",name:"root"}],["bytes32 s",{type:"bytes32",name:"s"}],["string name",{type:"string",name:"name"}],["string symbol",{type:"string",name:"symbol"}],["string tokenURI",{type:"string",name:"tokenURI"}],["uint tokenId",{type:"uint256",name:"tokenId"}],["uint8 v",{type:"uint8",name:"v"}],["uint256 balance",{type:"uint256",name:"balance"}],["uint256 tokenId",{type:"uint256",name:"tokenId"}],["uint256 value",{type:"uint256",name:"value"}],["event:address indexed from",{type:"address",name:"from",indexed:!0}],["event:address indexed to",{type:"address",name:"to",indexed:!0}],["event:uint indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}],["event:uint256 indexed tokenId",{type:"uint256",name:"tokenId",indexed:!0}]]);exports.getParameterCacheKey=r;exports.parameterCache=d;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const lt=require("./index297.cjs"),p=require("./index296.cjs"),K=require("./index301.cjs"),et=require("./index263.cjs"),N=require("./index287.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;