@gardenfi/utils 2.1.2-beta.5 → 2.1.2-beta.7

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 (181) hide show
  1. package/dist/index100.cjs +1 -1
  2. package/dist/index100.js +5 -5
  3. package/dist/index101.cjs +1 -2
  4. package/dist/index101.js +11 -3
  5. package/dist/index102.cjs +1 -1
  6. package/dist/index102.js +6 -18
  7. package/dist/index103.cjs +1 -1
  8. package/dist/index103.js +15 -638
  9. package/dist/index104.cjs +1 -1
  10. package/dist/index104.js +5 -173
  11. package/dist/index15.cjs +1 -1
  12. package/dist/index15.js +2 -2
  13. package/dist/index18.cjs +1 -1
  14. package/dist/index18.js +2 -2
  15. package/dist/index19.cjs +1 -1
  16. package/dist/index19.js +9 -9
  17. package/dist/index20.cjs +1 -1
  18. package/dist/index20.js +18 -17
  19. package/dist/index21.cjs +16 -1
  20. package/dist/index21.js +112 -30
  21. package/dist/index22.cjs +1 -16
  22. package/dist/index22.js +30 -113
  23. package/dist/index23.cjs +1 -2
  24. package/dist/index23.js +40 -49
  25. package/dist/index24.cjs +1 -1
  26. package/dist/index24.js +45 -24
  27. package/dist/index25.cjs +1 -1
  28. package/dist/index25.js +25 -41
  29. package/dist/index26.cjs +1 -1
  30. package/dist/index26.js +6 -45
  31. package/dist/index27.cjs +1 -1
  32. package/dist/index27.js +12 -24
  33. package/dist/index28.cjs +1 -1
  34. package/dist/index28.js +15 -6
  35. package/dist/index29.cjs +1 -1
  36. package/dist/index29.js +5 -13
  37. package/dist/index30.cjs +1 -1
  38. package/dist/index30.js +12 -14
  39. package/dist/index31.cjs +1 -1
  40. package/dist/index31.js +10 -5
  41. package/dist/index32.cjs +1 -1
  42. package/dist/index32.js +12 -13
  43. package/dist/index33.cjs +1 -1
  44. package/dist/index33.js +11 -10
  45. package/dist/index34.cjs +1 -1
  46. package/dist/index34.js +13 -12
  47. package/dist/index35.cjs +1 -1
  48. package/dist/index35.js +23 -11
  49. package/dist/index36.cjs +1 -1
  50. package/dist/index36.js +55 -13
  51. package/dist/index37.cjs +1 -1
  52. package/dist/index37.js +16 -23
  53. package/dist/index38.cjs +1 -1
  54. package/dist/index38.js +5 -55
  55. package/dist/index39.cjs +1 -1
  56. package/dist/index39.js +8 -16
  57. package/dist/index4.cjs +1 -1
  58. package/dist/index4.js +3 -5
  59. package/dist/index40.cjs +1 -1
  60. package/dist/index40.js +171 -5
  61. package/dist/index41.cjs +1 -1
  62. package/dist/index41.js +103 -8
  63. package/dist/index42.cjs +1 -1
  64. package/dist/index42.js +20 -170
  65. package/dist/index43.cjs +2 -1
  66. package/dist/index43.js +44 -97
  67. package/dist/index44.cjs +1 -1
  68. package/dist/index44.js +24 -21
  69. package/dist/index45.cjs +1 -1
  70. package/dist/index45.js +1 -1
  71. package/dist/index46.cjs +1 -1
  72. package/dist/index46.js +1 -1
  73. package/dist/index47.cjs +1 -1
  74. package/dist/index47.js +40 -6
  75. package/dist/index48.cjs +1 -2
  76. package/dist/index48.js +33 -58
  77. package/dist/index49.cjs +1 -1
  78. package/dist/index49.js +70 -2
  79. package/dist/index50.cjs +1 -1
  80. package/dist/index50.js +111 -5
  81. package/dist/index51.cjs +1 -1
  82. package/dist/index51.js +67 -4
  83. package/dist/index52.cjs +1 -1
  84. package/dist/index52.js +2 -12
  85. package/dist/index53.cjs +1 -1
  86. package/dist/index53.js +17 -8
  87. package/dist/index54.cjs +1 -5
  88. package/dist/index54.js +215 -48
  89. package/dist/index55.cjs +1 -2
  90. package/dist/index55.js +228 -31
  91. package/dist/index56.cjs +2 -1
  92. package/dist/index56.js +59 -5
  93. package/dist/index57.cjs +1 -1
  94. package/dist/index57.js +22 -2
  95. package/dist/index58.cjs +1 -1
  96. package/dist/index58.js +101 -18
  97. package/dist/index59.cjs +1 -1
  98. package/dist/index59.js +3 -8
  99. package/dist/index60.cjs +1 -1
  100. package/dist/index60.js +16 -9
  101. package/dist/index61.cjs +1 -1
  102. package/dist/index61.js +8 -11
  103. package/dist/index62.cjs +1 -1
  104. package/dist/index62.js +10 -6
  105. package/dist/index63.cjs +1 -1
  106. package/dist/index63.js +11 -13
  107. package/dist/index64.cjs +1 -1
  108. package/dist/index64.js +12 -31
  109. package/dist/index65.cjs +1 -1
  110. package/dist/index65.js +18 -14
  111. package/dist/index66.cjs +1 -1
  112. package/dist/index66.js +6 -64
  113. package/dist/index67.cjs +1 -1
  114. package/dist/index67.js +40 -25
  115. package/dist/index68.cjs +1 -1
  116. package/dist/index68.js +79 -3
  117. package/dist/index69.cjs +1 -1
  118. package/dist/index69.js +14 -3
  119. package/dist/index70.cjs +1 -1
  120. package/dist/index70.js +18 -8
  121. package/dist/index71.cjs +1 -1
  122. package/dist/index71.js +8 -191
  123. package/dist/index72.cjs +1 -1
  124. package/dist/index72.js +191 -18
  125. package/dist/index73.cjs +1 -1
  126. package/dist/index73.js +63 -7
  127. package/dist/index74.cjs +1 -1
  128. package/dist/index74.js +4 -40
  129. package/dist/index75.cjs +1 -1
  130. package/dist/index75.js +2 -35
  131. package/dist/index76.cjs +1 -1
  132. package/dist/index76.js +5 -68
  133. package/dist/index77.cjs +1 -1
  134. package/dist/index77.js +11 -112
  135. package/dist/index78.cjs +1 -1
  136. package/dist/index78.js +8 -68
  137. package/dist/index79.cjs +5 -1
  138. package/dist/index79.js +57 -2
  139. package/dist/index80.cjs +2 -1
  140. package/dist/index80.js +33 -15
  141. package/dist/index81.cjs +1 -1
  142. package/dist/index81.js +5 -223
  143. package/dist/index82.cjs +1 -1
  144. package/dist/index82.js +2 -232
  145. package/dist/index83.cjs +1 -1
  146. package/dist/index83.js +6 -42
  147. package/dist/index84.cjs +1 -1
  148. package/dist/index84.js +30 -102
  149. package/dist/index85.cjs +1 -1
  150. package/dist/index85.js +26 -16
  151. package/dist/index86.cjs +1 -1
  152. package/dist/index86.js +3 -79
  153. package/dist/index87.cjs +1 -1
  154. package/dist/index87.js +10 -17
  155. package/dist/index88.cjs +1 -1
  156. package/dist/index88.js +18 -11
  157. package/dist/index89.cjs +1 -1
  158. package/dist/index89.js +8 -38
  159. package/dist/index9.cjs +1 -1
  160. package/dist/index9.js +2 -2
  161. package/dist/index90.cjs +1 -1
  162. package/dist/index90.js +13 -2
  163. package/dist/index91.cjs +1 -1
  164. package/dist/index91.js +19 -5
  165. package/dist/index92.cjs +1 -1
  166. package/dist/index92.js +643 -10
  167. package/dist/index93.cjs +1 -1
  168. package/dist/index93.js +171 -10
  169. package/dist/index94.cjs +1 -1
  170. package/dist/index94.js +127 -19
  171. package/dist/index95.cjs +2 -1
  172. package/dist/index95.js +3 -128
  173. package/dist/index96.cjs +1 -1
  174. package/dist/index96.js +2 -7
  175. package/dist/index97.cjs +1 -1
  176. package/dist/index97.js +2 -2
  177. package/dist/index98.cjs +1 -1
  178. package/dist/index98.js +2 -2
  179. package/dist/index99.cjs +1 -1
  180. package/dist/index99.js +35 -17
  181. package/package.json +1 -1
package/dist/index74.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index75.cjs"),c=require("./index76.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.ahash(t);const h=c.toBytes(i);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(h.length>a?t.create().update(h).digest():h);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),e.fill(0)}update(t){return o.aexists(this),this.iHash.update(t),this}digestInto(t){o.aexists(this),o.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:i,iHash:h,finished:a,destroyed:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=u,t.oHash=i._cloneInto(t.oHash),t.iHash=h._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index59.cjs");function i(e){return t.isHex(e,{strict:!1})?Math.ceil((e.length-2)/2):e.length}exports.size=i;
package/dist/index74.js CHANGED
@@ -1,43 +1,7 @@
1
- import { ahash as c, aexists as a, abytes as u } from "./index75.js";
2
- import { Hash as H, toBytes as p } from "./index76.js";
3
- class r extends H {
4
- constructor(t, i) {
5
- super(), this.finished = !1, this.destroyed = !1, c(t);
6
- const h = p(i);
7
- if (this.iHash = t.create(), typeof this.iHash.update != "function")
8
- throw new Error("Expected instance of class which extends utils.Hash");
9
- this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
10
- const o = this.blockLen, e = new Uint8Array(o);
11
- e.set(h.length > o ? t.create().update(h).digest() : h);
12
- for (let s = 0; s < e.length; s++)
13
- e[s] ^= 54;
14
- this.iHash.update(e), this.oHash = t.create();
15
- for (let s = 0; s < e.length; s++)
16
- e[s] ^= 106;
17
- this.oHash.update(e), e.fill(0);
18
- }
19
- update(t) {
20
- return a(this), this.iHash.update(t), this;
21
- }
22
- digestInto(t) {
23
- a(this), u(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
24
- }
25
- digest() {
26
- const t = new Uint8Array(this.oHash.outputLen);
27
- return this.digestInto(t), t;
28
- }
29
- _cloneInto(t) {
30
- t || (t = Object.create(Object.getPrototypeOf(this), {}));
31
- const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: d } = this;
32
- return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = d, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
33
- }
34
- destroy() {
35
- this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
36
- }
1
+ import { isHex as r } from "./index59.js";
2
+ function i(t) {
3
+ return r(t, { strict: !1 }) ? Math.ceil((t.length - 2) / 2) : t.length;
37
4
  }
38
- const l = (n, t, i) => new r(n, t).update(i).digest();
39
- l.create = (n, t) => new r(n, t);
40
5
  export {
41
- r as HMAC,
42
- l as hmac
6
+ i as size
43
7
  };
package/dist/index75.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function i(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!i(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error("Uint8Array expected of length "+t+", got length="+e.length)}function a(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");r(e.outputLen),r(e.blockLen)}function s(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function u(e,t){o(e);const n=t.outputLen;if(e.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}exports.abytes=o;exports.aexists=s;exports.ahash=a;exports.anumber=r;exports.aoutput=u;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="2.26.3";exports.version=e;
package/dist/index75.js CHANGED
@@ -1,37 +1,4 @@
1
- function n(e) {
2
- if (!Number.isSafeInteger(e) || e < 0)
3
- throw new Error("positive integer expected, got " + e);
4
- }
5
- function o(e) {
6
- return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
7
- }
8
- function i(e, ...t) {
9
- if (!o(e))
10
- throw new Error("Uint8Array expected");
11
- if (t.length > 0 && !t.includes(e.length))
12
- throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
13
- }
14
- function f(e) {
15
- if (typeof e != "function" || typeof e.create != "function")
16
- throw new Error("Hash should be wrapped by utils.wrapConstructor");
17
- n(e.outputLen), n(e.blockLen);
18
- }
19
- function s(e, t = !0) {
20
- if (e.destroyed)
21
- throw new Error("Hash instance has been destroyed");
22
- if (t && e.finished)
23
- throw new Error("Hash#digest() has already been called");
24
- }
25
- function u(e, t) {
26
- i(e);
27
- const r = t.outputLen;
28
- if (e.length < r)
29
- throw new Error("digestInto() expects output buffer of length at least " + r);
30
- }
1
+ const o = "2.26.3";
31
2
  export {
32
- i as abytes,
33
- s as aexists,
34
- f as ahash,
35
- n as anumber,
36
- u as aoutput
3
+ o as version
37
4
  };
package/dist/index76.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index79.cjs"),f=require("./index75.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function a(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function l(t,e){return t<<32-e|t>>>e}const b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function i(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function w(t){for(let e=0;e<t.length;e++)t[e]=i(t[e])}function y(t){if(typeof t!="string")throw new Error("utf8ToBytes expected string, got "+typeof t);return new Uint8Array(new TextEncoder().encode(t))}function s(t){return typeof t=="string"&&(t=y(t)),f.abytes(t),t}function g(...t){let e=0;for(let n=0;n<t.length;n++){const u=t[n];f.abytes(u),e+=u.length}const r=new Uint8Array(e);for(let n=0,u=0;n<t.length;n++){const c=t[n];r.set(c,u),u+=c.length}return r}class m{clone(){return this._cloneInto()}}function B(t){const e=n=>t().update(s(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function d(t=32){if(o.crypto&&typeof o.crypto.getRandomValues=="function")return o.crypto.getRandomValues(new Uint8Array(t));if(o.crypto&&typeof o.crypto.randomBytes=="function")return o.crypto.randomBytes(t);throw new Error("crypto.getRandomValues must be defined")}exports.Hash=m;exports.byteSwap=i;exports.byteSwap32=w;exports.concatBytes=g;exports.createView=a;exports.isLE=b;exports.randomBytes=d;exports.rotr=l;exports.toBytes=s;exports.u32=p;exports.utf8ToBytes=y;exports.wrapConstructor=B;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index56.cjs");class i extends e.BaseError{constructor({chainId:r}){super(typeof r=="number"?`Chain ID "${r}" is invalid.`:"Chain ID is invalid.",{name:"InvalidChainIdError"})}}exports.InvalidChainIdError=i;
package/dist/index76.js CHANGED
@@ -1,72 +1,9 @@
1
- import { crypto as o } from "./index79.js";
2
- import { abytes as i } from "./index75.js";
3
- /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
4
- function g(t) {
5
- return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
6
- }
7
- function m(t) {
8
- return new DataView(t.buffer, t.byteOffset, t.byteLength);
9
- }
10
- function w(t, e) {
11
- return t << 32 - e | t >>> e;
12
- }
13
- const b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
14
- function c(t) {
15
- return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
16
- }
17
- function a(t) {
18
- for (let e = 0; e < t.length; e++)
19
- t[e] = c(t[e]);
20
- }
21
- function s(t) {
22
- if (typeof t != "string")
23
- throw new Error("utf8ToBytes expected string, got " + typeof t);
24
- return new Uint8Array(new TextEncoder().encode(t));
25
- }
26
- function y(t) {
27
- return typeof t == "string" && (t = s(t)), i(t), t;
28
- }
29
- function x(...t) {
30
- let e = 0;
31
- for (let n = 0; n < t.length; n++) {
32
- const r = t[n];
33
- i(r), e += r.length;
34
- }
35
- const f = new Uint8Array(e);
36
- for (let n = 0, r = 0; n < t.length; n++) {
37
- const u = t[n];
38
- f.set(u, r), r += u.length;
39
- }
40
- return f;
41
- }
42
- class h {
43
- // Safe version that clones internal state
44
- clone() {
45
- return this._cloneInto();
1
+ import { BaseError as i } from "./index56.js";
2
+ class o extends i {
3
+ constructor({ chainId: r }) {
4
+ super(typeof r == "number" ? `Chain ID "${r}" is invalid.` : "Chain ID is invalid.", { name: "InvalidChainIdError" });
46
5
  }
47
6
  }
48
- function B(t) {
49
- const e = (n) => t().update(y(n)).digest(), f = t();
50
- return e.outputLen = f.outputLen, e.blockLen = f.blockLen, e.create = () => t(), e;
51
- }
52
- function d(t = 32) {
53
- if (o && typeof o.getRandomValues == "function")
54
- return o.getRandomValues(new Uint8Array(t));
55
- if (o && typeof o.randomBytes == "function")
56
- return o.randomBytes(t);
57
- throw new Error("crypto.getRandomValues must be defined");
58
- }
59
7
  export {
60
- h as Hash,
61
- c as byteSwap,
62
- a as byteSwap32,
63
- x as concatBytes,
64
- m as createView,
65
- b as isLE,
66
- d as randomBytes,
67
- w as rotr,
68
- y as toBytes,
69
- g as u32,
70
- s as utf8ToBytes,
71
- B as wrapConstructor
8
+ o as InvalidChainIdError
72
9
  };
package/dist/index77.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index78.cjs"),s=require("./index76.cjs"),S=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),b=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),f=new Uint32Array(64);class g extends H.HashMD{constructor(){super(64,32,8,!1),this.A=b[0]|0,this.B=b[1]|0,this.C=b[2]|0,this.D=b[3]|0,this.E=b[4]|0,this.F=b[5]|0,this.G=b[6]|0,this.H=b[7]|0}get(){const{A:d,B:o,C:x,D:e,E:a,F:i,G:c,H:r}=this;return[d,o,x,e,a,i,c,r]}set(d,o,x,e,a,i,c,r){this.A=d|0,this.B=o|0,this.C=x|0,this.D=e|0,this.E=a|0,this.F=i|0,this.G=c|0,this.H=r|0}process(d,o){for(let t=0;t<16;t++,o+=4)f[t]=d.getUint32(o,!1);for(let t=16;t<64;t++){const A=f[t-15],n=f[t-2],C=s.rotr(A,7)^s.rotr(A,18)^A>>>3,u=s.rotr(n,17)^s.rotr(n,19)^n>>>10;f[t]=u+f[t-7]+C+f[t-16]|0}let{A:x,B:e,C:a,D:i,E:c,F:r,G:h,H:l}=this;for(let t=0;t<64;t++){const A=s.rotr(c,6)^s.rotr(c,11)^s.rotr(c,25),n=l+A+H.Chi(c,r,h)+S[t]+f[t]|0,u=(s.rotr(x,2)^s.rotr(x,13)^s.rotr(x,22))+H.Maj(x,e,a)|0;l=h,h=r,r=c,c=i+n|0,i=a,a=e,e=x,x=n+u|0}x=x+this.A|0,e=e+this.B|0,a=a+this.C|0,i=i+this.D|0,c=c+this.E|0,r=r+this.F|0,h=h+this.G|0,l=l+this.H|0,this.set(x,e,a,i,c,r,h,l)}roundClean(){f.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const y=s.wrapConstructor(()=>new g);exports.SHA256=g;exports.sha256=y;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(n,{args:a,eventName:t}={}){return{...n,blockHash:n.blockHash?n.blockHash:null,blockNumber:n.blockNumber?BigInt(n.blockNumber):null,logIndex:n.logIndex?Number(n.logIndex):null,transactionHash:n.transactionHash?n.transactionHash:null,transactionIndex:n.transactionIndex?Number(n.transactionIndex):null,...t?{args:a,eventName:t}:{}}}exports.formatLog=r;
package/dist/index77.js CHANGED
@@ -1,115 +1,14 @@
1
- import { HashMD as m, Chi as p, Maj as u } from "./index78.js";
2
- import { wrapConstructor as D, rotr as i } from "./index76.js";
3
- const g = /* @__PURE__ */ new Uint32Array([
4
- 1116352408,
5
- 1899447441,
6
- 3049323471,
7
- 3921009573,
8
- 961987163,
9
- 1508970993,
10
- 2453635748,
11
- 2870763221,
12
- 3624381080,
13
- 310598401,
14
- 607225278,
15
- 1426881987,
16
- 1925078388,
17
- 2162078206,
18
- 2614888103,
19
- 3248222580,
20
- 3835390401,
21
- 4022224774,
22
- 264347078,
23
- 604807628,
24
- 770255983,
25
- 1249150122,
26
- 1555081692,
27
- 1996064986,
28
- 2554220882,
29
- 2821834349,
30
- 2952996808,
31
- 3210313671,
32
- 3336571891,
33
- 3584528711,
34
- 113926993,
35
- 338241895,
36
- 666307205,
37
- 773529912,
38
- 1294757372,
39
- 1396182291,
40
- 1695183700,
41
- 1986661051,
42
- 2177026350,
43
- 2456956037,
44
- 2730485921,
45
- 2820302411,
46
- 3259730800,
47
- 3345764771,
48
- 3516065817,
49
- 3600352804,
50
- 4094571909,
51
- 275423344,
52
- 430227734,
53
- 506948616,
54
- 659060556,
55
- 883997877,
56
- 958139571,
57
- 1322822218,
58
- 1537002063,
59
- 1747873779,
60
- 1955562222,
61
- 2024104815,
62
- 2227730452,
63
- 2361852424,
64
- 2428436474,
65
- 2756734187,
66
- 3204031479,
67
- 3329325298
68
- ]), b = /* @__PURE__ */ new Uint32Array([
69
- 1779033703,
70
- 3144134277,
71
- 1013904242,
72
- 2773480762,
73
- 1359893119,
74
- 2600822924,
75
- 528734635,
76
- 1541459225
77
- ]), h = /* @__PURE__ */ new Uint32Array(64);
78
- class w extends m {
79
- constructor() {
80
- super(64, 32, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
81
- }
82
- get() {
83
- const { A: d, B: o, C: t, D: s, E: a, F: f, G: c, H: e } = this;
84
- return [d, o, t, s, a, f, c, e];
85
- }
86
- // prettier-ignore
87
- set(d, o, t, s, a, f, c, e) {
88
- this.A = d | 0, this.B = o | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
89
- }
90
- process(d, o) {
91
- for (let x = 0; x < 16; x++, o += 4)
92
- h[x] = d.getUint32(o, !1);
93
- for (let x = 16; x < 64; x++) {
94
- const A = h[x - 15], n = h[x - 2], C = i(A, 7) ^ i(A, 18) ^ A >>> 3, H = i(n, 17) ^ i(n, 19) ^ n >>> 10;
95
- h[x] = H + h[x - 7] + C + h[x - 16] | 0;
96
- }
97
- let { A: t, B: s, C: a, D: f, E: c, F: e, G: r, H: l } = this;
98
- for (let x = 0; x < 64; x++) {
99
- const A = i(c, 6) ^ i(c, 11) ^ i(c, 25), n = l + A + p(c, e, r) + g[x] + h[x] | 0, H = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + u(t, s, a) | 0;
100
- l = r, r = e, e = c, c = f + n | 0, f = a, a = s, s = t, t = n + H | 0;
101
- }
102
- t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, r = r + this.G | 0, l = l + this.H | 0, this.set(t, s, a, f, c, e, r, l);
103
- }
104
- roundClean() {
105
- h.fill(0);
106
- }
107
- destroy() {
108
- this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
109
- }
1
+ function r(n, { args: t, eventName: a } = {}) {
2
+ return {
3
+ ...n,
4
+ blockHash: n.blockHash ? n.blockHash : null,
5
+ blockNumber: n.blockNumber ? BigInt(n.blockNumber) : null,
6
+ logIndex: n.logIndex ? Number(n.logIndex) : null,
7
+ transactionHash: n.transactionHash ? n.transactionHash : null,
8
+ transactionIndex: n.transactionIndex ? Number(n.transactionIndex) : null,
9
+ ...a ? { args: t, eventName: a } : {}
10
+ };
110
11
  }
111
- const G = /* @__PURE__ */ D(() => new w());
112
12
  export {
113
- w as SHA256,
114
- G as sha256
13
+ r as formatLog
115
14
  };
package/dist/index78.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index75.cjs"),c=require("./index76.cjs");function a(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 d(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class w extends c.Hash{constructor(t,s,i,n){super(),this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=c.createView(this.buffer)}update(t){p.aexists(this);const{view:s,buffer:i,blockLen:n}=this;t=c.toBytes(t);const r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=c.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){p.aexists(this),p.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,this.buffer.subarray(e).fill(0),this.padOffset>n-e&&(this.process(i,0),e=0);for(let f=e;f<n;f++)s[f]=0;a(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=c.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let f=0;f<l;f++)h.setUint32(4*f,g[f],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.length=n,t.pos=h,t.finished=r,t.destroyed=e,n%s&&t.buffer.set(i),t}}exports.Chi=d;exports.HashMD=w;exports.Maj=b;exports.setBigUint64=a;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e={"0x0":"legacy","0x1":"eip2930","0x2":"eip1559","0x3":"eip4844","0x4":"eip7702"};exports.transactionType=e;
package/dist/index78.js CHANGED
@@ -1,70 +1,10 @@
1
- import { aexists as g, aoutput as d } from "./index75.js";
2
- import { Hash as b, createView as p, toBytes as a } from "./index76.js";
3
- function w(o, t, s, i) {
4
- if (typeof o.setBigUint64 == "function")
5
- return o.setBigUint64(t, s, i);
6
- const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
7
- o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
8
- }
9
- function B(o, t, s) {
10
- return o & t ^ ~o & s;
11
- }
12
- function L(o, t, s) {
13
- return o & t ^ o & s ^ t & s;
14
- }
15
- class U extends b {
16
- constructor(t, s, i, n) {
17
- super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
18
- }
19
- update(t) {
20
- g(this);
21
- const { view: s, buffer: i, blockLen: n } = this;
22
- t = a(t);
23
- const h = t.length;
24
- for (let e = 0; e < h; ) {
25
- const r = Math.min(n - this.pos, h - e);
26
- if (r === n) {
27
- const u = p(t);
28
- for (; n <= h - e; e += n)
29
- this.process(u, e);
30
- continue;
31
- }
32
- i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
33
- }
34
- return this.length += t.length, this.roundClean(), this;
35
- }
36
- digestInto(t) {
37
- g(this), d(t, this), this.finished = !0;
38
- const { buffer: s, view: i, blockLen: n, isLE: h } = this;
39
- let { pos: e } = this;
40
- s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
41
- for (let f = e; f < n; f++)
42
- s[f] = 0;
43
- w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
44
- const r = p(t), u = this.outputLen;
45
- if (u % 4)
46
- throw new Error("_sha2: outputLen should be aligned to 32bit");
47
- const c = u / 4, l = this.get();
48
- if (c > l.length)
49
- throw new Error("_sha2: outputLen bigger than state");
50
- for (let f = 0; f < c; f++)
51
- r.setUint32(4 * f, l[f], h);
52
- }
53
- digest() {
54
- const { buffer: t, outputLen: s } = this;
55
- this.digestInto(t);
56
- const i = t.slice(0, s);
57
- return this.destroy(), i;
58
- }
59
- _cloneInto(t) {
60
- t || (t = new this.constructor()), t.set(...this.get());
61
- const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
62
- return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
63
- }
64
- }
1
+ const e = {
2
+ "0x0": "legacy",
3
+ "0x1": "eip2930",
4
+ "0x2": "eip1559",
5
+ "0x3": "eip4844",
6
+ "0x4": "eip7702"
7
+ };
65
8
  export {
66
- B as Chi,
67
- U as HashMD,
68
- L as Maj,
69
- w as setBigUint64
9
+ e as transactionType
70
10
  };
package/dist/index79.cjs CHANGED
@@ -1 +1,5 @@
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("./index74.cjs"),n=require("./index56.cjs");class o extends n.BaseError{constructor({expectedLength:r,givenLength:e,type:t}){super([`ABI encoding array length mismatch for type ${t}.`,`Expected length: ${r}`,`Given length: ${e}`].join(`
2
+ `),{name:"AbiEncodingArrayLengthMismatchError"})}}class a extends n.BaseError{constructor({expectedSize:r,value:e}){super(`Size of bytes "${e}" (bytes${i.size(e)}) does not match expected size (bytes${r}).`,{name:"AbiEncodingBytesSizeMismatchError"})}}class c extends n.BaseError{constructor({expectedLength:r,givenLength:e}){super(["ABI encoding params/values length mismatch.",`Expected length (params): ${r}`,`Given length (values): ${e}`].join(`
3
+ `),{name:"AbiEncodingLengthMismatchError"})}}class d extends n.BaseError{constructor({expectedSize:r,givenSize:e}){super(`Expected bytes${r}, got bytes${e}.`,{name:"BytesSizeMismatchError"})}}class E extends n.BaseError{constructor(r,{docsPath:e}){super([`Type "${r}" is not a valid encoding type.`,"Please provide a valid ABI type."].join(`
4
+ `),{docsPath:e,name:"InvalidAbiEncodingType"})}}class g extends n.BaseError{constructor(r){super([`Value "${r}" is not a valid array.`].join(`
5
+ `),{name:"InvalidArrayError"})}}exports.AbiEncodingArrayLengthMismatchError=o;exports.AbiEncodingBytesSizeMismatchError=a;exports.AbiEncodingLengthMismatchError=c;exports.BytesSizeMismatchError=d;exports.InvalidAbiEncodingTypeError=E;exports.InvalidArrayError=g;
package/dist/index79.js CHANGED
@@ -1,4 +1,59 @@
1
- const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
1
+ import { size as i } from "./index74.js";
2
+ import { BaseError as n } from "./index56.js";
3
+ class c extends n {
4
+ constructor({ expectedLength: e, givenLength: r, type: s }) {
5
+ super([
6
+ `ABI encoding array length mismatch for type ${s}.`,
7
+ `Expected length: ${e}`,
8
+ `Given length: ${r}`
9
+ ].join(`
10
+ `), { name: "AbiEncodingArrayLengthMismatchError" });
11
+ }
12
+ }
13
+ class d extends n {
14
+ constructor({ expectedSize: e, value: r }) {
15
+ super(`Size of bytes "${r}" (bytes${i(r)}) does not match expected size (bytes${e}).`, { name: "AbiEncodingBytesSizeMismatchError" });
16
+ }
17
+ }
18
+ class m extends n {
19
+ constructor({ expectedLength: e, givenLength: r }) {
20
+ super([
21
+ "ABI encoding params/values length mismatch.",
22
+ `Expected length (params): ${e}`,
23
+ `Given length (values): ${r}`
24
+ ].join(`
25
+ `), { name: "AbiEncodingLengthMismatchError" });
26
+ }
27
+ }
28
+ class E extends n {
29
+ constructor({ expectedSize: e, givenSize: r }) {
30
+ super(`Expected bytes${e}, got bytes${r}.`, {
31
+ name: "BytesSizeMismatchError"
32
+ });
33
+ }
34
+ }
35
+ class g extends n {
36
+ constructor(e, { docsPath: r }) {
37
+ super([
38
+ `Type "${e}" is not a valid encoding type.`,
39
+ "Please provide a valid ABI type."
40
+ ].join(`
41
+ `), { docsPath: r, name: "InvalidAbiEncodingType" });
42
+ }
43
+ }
44
+ class l extends n {
45
+ constructor(e) {
46
+ super([`Value "${e}" is not a valid array.`].join(`
47
+ `), {
48
+ name: "InvalidArrayError"
49
+ });
50
+ }
51
+ }
2
52
  export {
3
- o as crypto
53
+ c as AbiEncodingArrayLengthMismatchError,
54
+ d as AbiEncodingBytesSizeMismatchError,
55
+ m as AbiEncodingLengthMismatchError,
56
+ E as BytesSizeMismatchError,
57
+ g as InvalidAbiEncodingTypeError,
58
+ l as InvalidArrayError
4
59
  };
package/dist/index80.cjs CHANGED
@@ -1 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index74.cjs"),s=require("./index76.cjs"),o=require("./index103.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index81.cjs"),t=require("./index56.cjs");class i extends t.BaseError{constructor({cause:r,maxFeePerGas:e}={}){super(`The fee cap (\`maxFeePerGas\`${e?` = ${a.formatGwei(e)} gwei`:""}) cannot be higher than the maximum allowed value (2^256-1).`,{cause:r,name:"FeeCapTooHighError"})}}Object.defineProperty(i,"nodeMessage",{enumerable:!0,configurable:!0,writable:!0,value:/max fee per gas higher than 2\^256-1|fee cap higher than 2\^256-1/});class n extends t.BaseError{constructor({cause:r,maxPriorityFeePerGas:e,maxFeePerGas:o}={}){super([`The provided tip (\`maxPriorityFeePerGas\`${e?` = ${a.formatGwei(e)} gwei`:""}) cannot be higher than the fee cap (\`maxFeePerGas\`${o?` = ${a.formatGwei(o)} gwei`:""}).`].join(`
2
+ `),{cause:r,name:"TipAboveFeeCapError"})}}Object.defineProperty(n,"nodeMessage",{enumerable:!0,configurable:!0,writable:!0,value:/max priority fee per gas higher than max fee per gas|tip higher than fee cap/});exports.FeeCapTooHighError=i;exports.TipAboveFeeCapError=n;
package/dist/index80.js CHANGED
@@ -1,19 +1,37 @@
1
- import { hmac as c } from "./index74.js";
2
- import { randomBytes as m, concatBytes as n } from "./index76.js";
3
- import { weierstrass as a } from "./index103.js";
4
- /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
5
- function i(r) {
6
- return {
7
- hash: r,
8
- hmac: (e, ...t) => c(r, e, n(...t)),
9
- randomBytes: m
10
- };
1
+ import { formatGwei as a } from "./index81.js";
2
+ import { BaseError as o } from "./index56.js";
3
+ class n extends o {
4
+ constructor({ cause: r, maxFeePerGas: e } = {}) {
5
+ super(`The fee cap (\`maxFeePerGas\`${e ? ` = ${a(e)} gwei` : ""}) cannot be higher than the maximum allowed value (2^256-1).`, {
6
+ cause: r,
7
+ name: "FeeCapTooHighError"
8
+ });
9
+ }
11
10
  }
12
- function p(r, e) {
13
- const t = (o) => a({ ...r, ...i(o) });
14
- return { ...t(e), create: t };
11
+ Object.defineProperty(n, "nodeMessage", {
12
+ enumerable: !0,
13
+ configurable: !0,
14
+ writable: !0,
15
+ value: /max fee per gas higher than 2\^256-1|fee cap higher than 2\^256-1/
16
+ });
17
+ class h extends o {
18
+ constructor({ cause: r, maxPriorityFeePerGas: e, maxFeePerGas: t } = {}) {
19
+ super([
20
+ `The provided tip (\`maxPriorityFeePerGas\`${e ? ` = ${a(e)} gwei` : ""}) cannot be higher than the fee cap (\`maxFeePerGas\`${t ? ` = ${a(t)} gwei` : ""}).`
21
+ ].join(`
22
+ `), {
23
+ cause: r,
24
+ name: "TipAboveFeeCapError"
25
+ });
26
+ }
15
27
  }
28
+ Object.defineProperty(h, "nodeMessage", {
29
+ enumerable: !0,
30
+ configurable: !0,
31
+ writable: !0,
32
+ value: /max priority fee per gas higher than max fee per gas|tip higher than fee cap/
33
+ });
16
34
  export {
17
- p as createCurve,
18
- i as getHash
35
+ n as FeeCapTooHighError,
36
+ h as TipAboveFeeCapError
19
37
  };
package/dist/index81.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index82.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),c=BigInt(1),w=BigInt(2),j=BigInt(3),E=BigInt(4),S=BigInt(5),I=BigInt(8);function g(t,i){const r=t%i;return r>=d?r:i+r}function L(t,i,r){if(i<d)throw new Error("invalid exponent, negatives unsupported");if(r<=d)throw new Error("invalid modulus");if(r===c)return d;let n=c;for(;i>d;)i&c&&(n=n*t%r),t=t*t%r,i>>=c;return n}function H(t,i,r){let n=t;for(;i-- >d;)n*=n,n%=r;return n}function m(t,i){if(t===d)throw new Error("invert: expected non-zero number");if(i<=d)throw new Error("invert: expected positive modulus, got "+i);let r=g(t,i),n=i,s=d,u=c;for(;r!==d;){const o=n/r,e=n%r,l=s-u*o;n=r,r=e,s=u,u=l}if(n!==c)throw new Error("invert: does not exist");return g(s,i)}function T(t){const i=(t-c)/w;let r,n,s;for(r=t-c,n=0;r%w===d;r/=w,n++);for(s=w;s<t&&L(s,i,t)!==t-c;s++)if(s>1e3)throw new Error("Cannot find square root: likely non-prime P");if(n===1){const f=(t+c)/E;return function(e,l){const h=e.pow(l,f);if(!e.eql(e.sqr(h),l))throw new Error("Cannot find square root");return h}}const u=(r+c)/w;return function(o,e){if(o.pow(e,i)===o.neg(o.ONE))throw new Error("Cannot find square root");let l=n,h=o.pow(o.mul(o.ONE,s),r),v=o.pow(e,u),q=o.pow(e,r);for(;!o.eql(q,o.ONE);){if(o.eql(q,o.ZERO))return o.ZERO;let b=1;for(let B=o.sqr(q);b<l&&!o.eql(B,o.ONE);b++)B=o.sqr(B);const y=o.pow(h,c<<BigInt(l-b-1));h=o.sqr(y),v=o.mul(v,y),q=o.mul(q,h),l=b}return v}}function x(t){if(t%E===j){const i=(t+c)/E;return function(n,s){const u=n.pow(s,i);if(!n.eql(n.sqr(u),s))throw new Error("Cannot find square root");return u}}if(t%I===S){const i=(t-S)/I;return function(n,s){const u=n.mul(s,w),f=n.pow(u,i),o=n.mul(s,f),e=n.mul(n.mul(o,w),f),l=n.mul(o,n.sub(e,n.ONE));if(!n.eql(n.sqr(l),s))throw new Error("Cannot find square root");return l}}return T(t)}const Z=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const i={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},r=Z.reduce((n,s)=>(n[s]="function",n),i);return a.validateObject(t,r)}function M(t,i,r){if(r<d)throw new Error("invalid exponent, negatives unsupported");if(r===d)return t.ONE;if(r===c)return i;let n=t.ONE,s=i;for(;r>d;)r&c&&(n=t.mul(n,s)),s=t.sqr(s),r>>=c;return n}function _(t,i){const r=new Array(i.length),n=i.reduce((u,f,o)=>t.is0(f)?u:(r[o]=u,t.mul(u,f)),t.ONE),s=t.inv(n);return i.reduceRight((u,f,o)=>t.is0(f)?u:(r[o]=t.mul(u,r[o]),t.mul(u,f)),s),r}function p(t,i){const r=i!==void 0?i:t.toString(2).length,n=Math.ceil(r/8);return{nBitLength:r,nByteLength:n}}function z(t,i,r=!1,n={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:u}=p(t,i);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let f;const o=Object.freeze({ORDER:t,isLE:r,BITS:s,BYTES:u,MASK:a.bitMask(s),ZERO:d,ONE:c,create:e=>g(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return d<=e&&e<t},is0:e=>e===d,isOdd:e=>(e&c)===c,neg:e=>g(-e,t),eql:(e,l)=>e===l,sqr:e=>g(e*e,t),add:(e,l)=>g(e+l,t),sub:(e,l)=>g(e-l,t),mul:(e,l)=>g(e*l,t),pow:(e,l)=>M(o,e,l),div:(e,l)=>g(e*m(l,t),t),sqrN:e=>e*e,addN:(e,l)=>e+l,subN:(e,l)=>e-l,mulN:(e,l)=>e*l,inv:e=>m(e,t),sqrt:n.sqrt||(e=>(f||(f=x(t)),f(o,e))),invertBatch:e=>_(o,e),cmov:(e,l,h)=>h?l:e,toBytes:e=>r?a.numberToBytesLE(e,u):a.numberToBytesBE(e,u),fromBytes:e=>{if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);return r?a.bytesToNumberLE(e):a.bytesToNumberBE(e)}});return Object.freeze(o)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const i=t.toString(2).length;return Math.ceil(i/8)}function C(t){const i=N(t);return i+Math.ceil(i/2)}function A(t,i,r=!1){const n=t.length,s=N(i),u=C(i);if(n<16||n<u||n>1024)throw new Error("expected "+u+"-1024 bytes of input, got "+n);const f=r?a.bytesToNumberLE(t):a.bytesToNumberBE(t),o=g(f,i-c)+c;return r?a.numberToBytesLE(o,s):a.numberToBytesBE(o,s)}exports.Field=z;exports.FpInvertBatch=_;exports.FpPow=M;exports.FpSqrt=x;exports.getFieldBytesLength=N;exports.getMinHashLength=C;exports.invert=m;exports.mapHashToField=A;exports.mod=g;exports.nLength=p;exports.pow=L;exports.pow2=H;exports.tonelliShanks=T;exports.validateField=k;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index100.cjs"),r=require("./index101.cjs");function n(t,e="wei"){return r.formatUnits(t,i.gweiUnits[e])}exports.formatGwei=n;