@gardenfi/utils 3.1.1-beta.2 → 3.1.1-beta.4

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 (313) hide show
  1. package/dist/index102.cjs +1 -1
  2. package/dist/index102.js +4 -4
  3. package/dist/index104.cjs +1 -1
  4. package/dist/index104.js +3 -3
  5. package/dist/index111.cjs +1 -1
  6. package/dist/index111.js +2 -2
  7. package/dist/index112.cjs +1 -1
  8. package/dist/index112.js +1 -1
  9. package/dist/index113.cjs +1 -1
  10. package/dist/index113.js +1 -1
  11. package/dist/index114.cjs +1 -1
  12. package/dist/index114.js +1 -1
  13. package/dist/index115.cjs +1 -1
  14. package/dist/index115.js +1 -1
  15. package/dist/index132.cjs +1 -1
  16. package/dist/index132.js +5 -5
  17. package/dist/index138.cjs +1 -1
  18. package/dist/index138.js +13 -33
  19. package/dist/index139.cjs +1 -1
  20. package/dist/index139.js +34 -9
  21. package/dist/index140.cjs +1 -1
  22. package/dist/index140.js +55 -60
  23. package/dist/index141.cjs +1 -1
  24. package/dist/index141.js +23 -17
  25. package/dist/index142.cjs +1 -1
  26. package/dist/index142.js +6 -106
  27. package/dist/index143.cjs +1 -1
  28. package/dist/index143.js +18 -78
  29. package/dist/index144.cjs +1 -1
  30. package/dist/index144.js +15 -9
  31. package/dist/index145.cjs +1 -1
  32. package/dist/index145.js +5 -90
  33. package/dist/index146.cjs +1 -2
  34. package/dist/index146.js +14 -3
  35. package/dist/index147.cjs +1 -1
  36. package/dist/index147.js +11 -9
  37. package/dist/index148.cjs +1 -1
  38. package/dist/index148.js +12 -13
  39. package/dist/index149.cjs +1 -1
  40. package/dist/index149.js +11 -4
  41. package/dist/index150.cjs +1 -1
  42. package/dist/index150.js +8 -12
  43. package/dist/index151.cjs +1 -1
  44. package/dist/index151.js +4 -2
  45. package/dist/index152.cjs +1 -1
  46. package/dist/index152.js +17 -32
  47. package/dist/index153.cjs +1 -1
  48. package/dist/index153.js +5 -21
  49. package/dist/index154.cjs +1 -1
  50. package/dist/index154.js +171 -5
  51. package/dist/index155.cjs +1 -1
  52. package/dist/index155.js +103 -5
  53. package/dist/index156.cjs +1 -1
  54. package/dist/index156.js +33 -5
  55. package/dist/index157.cjs +1 -9
  56. package/dist/index157.js +8 -34
  57. package/dist/index158.cjs +1 -1
  58. package/dist/index158.js +61 -3
  59. package/dist/index159.cjs +1 -1
  60. package/dist/index159.js +19 -18
  61. package/dist/index160.cjs +1 -1
  62. package/dist/index160.js +105 -19
  63. package/dist/index161.cjs +1 -1
  64. package/dist/index161.js +70 -27
  65. package/dist/index162.cjs +1 -1
  66. package/dist/index162.js +7 -6
  67. package/dist/index163.cjs +1 -4
  68. package/dist/index163.js +88 -192
  69. package/dist/index164.cjs +2 -1
  70. package/dist/index164.js +3 -28
  71. package/dist/index165.cjs +1 -1
  72. package/dist/index165.js +9 -162
  73. package/dist/index166.cjs +1 -1
  74. package/dist/index166.js +13 -127
  75. package/dist/index167.cjs +1 -1
  76. package/dist/index167.js +4 -27
  77. package/dist/index168.cjs +1 -1
  78. package/dist/index168.js +2 -56
  79. package/dist/index169.cjs +1 -1
  80. package/dist/index169.js +31 -191
  81. package/dist/index170.cjs +1 -1
  82. package/dist/index170.js +22 -4
  83. package/dist/index171.cjs +1 -1
  84. package/dist/index171.js +5 -20
  85. package/dist/index172.cjs +1 -1
  86. package/dist/index172.js +6 -3
  87. package/dist/index173.cjs +1 -1
  88. package/dist/index173.js +5 -16
  89. package/dist/index174.cjs +9 -1
  90. package/dist/index174.js +35 -11
  91. package/dist/index175.cjs +1 -1
  92. package/dist/index175.js +3 -35
  93. package/dist/index176.cjs +1 -1
  94. package/dist/index176.js +19 -3
  95. package/dist/index177.cjs +1 -1
  96. package/dist/index177.js +18 -25
  97. package/dist/index178.cjs +1 -1
  98. package/dist/index178.js +35 -8
  99. package/dist/index179.cjs +1 -1
  100. package/dist/index179.js +6 -23
  101. package/dist/index180.cjs +4 -1
  102. package/dist/index180.js +194 -28
  103. package/dist/index181.cjs +1 -1
  104. package/dist/index181.js +27 -3
  105. package/dist/index182.cjs +1 -1
  106. package/dist/index182.js +161 -6
  107. package/dist/index183.cjs +1 -1
  108. package/dist/index183.js +127 -6
  109. package/dist/index184.cjs +1 -1
  110. package/dist/index184.js +27 -32
  111. package/dist/index185.cjs +1 -1
  112. package/dist/index185.js +192 -5
  113. package/dist/index186.cjs +1 -1
  114. package/dist/index186.js +4 -38
  115. package/dist/index187.cjs +1 -1
  116. package/dist/index187.js +14 -43
  117. package/dist/index188.cjs +1 -1
  118. package/dist/index188.js +3 -33
  119. package/dist/index189.cjs +1 -1
  120. package/dist/index189.js +15 -16
  121. package/dist/index190.cjs +1 -1
  122. package/dist/index190.js +32 -40
  123. package/dist/index191.cjs +1 -1
  124. package/dist/index191.js +3 -105
  125. package/dist/index192.cjs +1 -1
  126. package/dist/index192.js +28 -3
  127. package/dist/index193.cjs +1 -1
  128. package/dist/index193.js +25 -5
  129. package/dist/index194.cjs +1 -1
  130. package/dist/index194.js +28 -3
  131. package/dist/index195.cjs +1 -1
  132. package/dist/index195.js +6 -17
  133. package/dist/index196.cjs +1 -1
  134. package/dist/index196.js +6 -5
  135. package/dist/index197.cjs +1 -1
  136. package/dist/index197.js +32 -8
  137. package/dist/index198.cjs +1 -1
  138. package/dist/index198.js +5 -104
  139. package/dist/index199.cjs +1 -1
  140. package/dist/index199.js +37 -5
  141. package/dist/index200.cjs +1 -1
  142. package/dist/index200.js +49 -6
  143. package/dist/index201.cjs +1 -1
  144. package/dist/index201.js +30 -25
  145. package/dist/index202.cjs +1 -1
  146. package/dist/index202.js +17 -34
  147. package/dist/index203.cjs +1 -1
  148. package/dist/index203.js +42 -13
  149. package/dist/index204.cjs +1 -1
  150. package/dist/index204.js +100 -74
  151. package/dist/index205.cjs +1 -1
  152. package/dist/index205.js +3 -2
  153. package/dist/index206.cjs +1 -1
  154. package/dist/index206.js +4 -17
  155. package/dist/index207.cjs +1 -1
  156. package/dist/index207.js +3 -171
  157. package/dist/index208.cjs +1 -1
  158. package/dist/index208.js +17 -17
  159. package/dist/index209.cjs +1 -1
  160. package/dist/index209.js +8 -10
  161. package/dist/index210.cjs +1 -1
  162. package/dist/index210.js +5 -25
  163. package/dist/index211.cjs +1 -1
  164. package/dist/index211.js +27 -18
  165. package/dist/index212.cjs +1 -1
  166. package/dist/index212.js +78 -15
  167. package/dist/index213.cjs +1 -1
  168. package/dist/index213.js +2 -6
  169. package/dist/index214.cjs +1 -1
  170. package/dist/index214.js +18 -13
  171. package/dist/index215.cjs +1 -1
  172. package/dist/index215.js +17 -10
  173. package/dist/index216.cjs +1 -1
  174. package/dist/index216.js +10 -16
  175. package/dist/index217.cjs +1 -1
  176. package/dist/index217.js +24 -11
  177. package/dist/index218.cjs +1 -1
  178. package/dist/index218.js +45 -18
  179. package/dist/index219.cjs +1 -1
  180. package/dist/index219.js +9 -24
  181. package/dist/index22.cjs +1 -1
  182. package/dist/index22.js +8 -8
  183. package/dist/index220.cjs +1 -1
  184. package/dist/index220.js +100 -43
  185. package/dist/index221.cjs +1 -1
  186. package/dist/index221.js +14 -7
  187. package/dist/index222.cjs +1 -2
  188. package/dist/index222.js +213 -40
  189. package/dist/index223.cjs +2 -1
  190. package/dist/index223.js +42 -2
  191. package/dist/index224.cjs +1 -1
  192. package/dist/index224.js +2 -6
  193. package/dist/index225.cjs +1 -1
  194. package/dist/index225.js +5 -10
  195. package/dist/index226.cjs +1 -1
  196. package/dist/index226.js +9 -18
  197. package/dist/index227.cjs +1 -1
  198. package/dist/index227.js +19 -8
  199. package/dist/index228.cjs +1 -1
  200. package/dist/index228.js +8 -66
  201. package/dist/index229.cjs +1 -1
  202. package/dist/index229.js +65 -64
  203. package/dist/index23.cjs +1 -1
  204. package/dist/index23.js +2 -2
  205. package/dist/index230.cjs +1 -1
  206. package/dist/index230.js +60 -183
  207. package/dist/index231.cjs +1 -1
  208. package/dist/index231.js +185 -25
  209. package/dist/index232.cjs +1 -1
  210. package/dist/index232.js +13 -61
  211. package/dist/index233.cjs +1 -1
  212. package/dist/index233.js +54 -18
  213. package/dist/index234.cjs +1 -1
  214. package/dist/index234.js +34 -10
  215. package/dist/index235.cjs +1 -1
  216. package/dist/index235.js +10 -7
  217. package/dist/index236.cjs +1 -1
  218. package/dist/index236.js +13 -11
  219. package/dist/index237.cjs +1 -1
  220. package/dist/index237.js +109 -13
  221. package/dist/index238.cjs +1 -1
  222. package/dist/index238.js +205 -18
  223. package/dist/index239.cjs +1 -1
  224. package/dist/index239.js +40 -106
  225. package/dist/index24.cjs +1 -1
  226. package/dist/index24.js +4 -4
  227. package/dist/index240.cjs +1 -1
  228. package/dist/index240.js +78 -6
  229. package/dist/index241.cjs +1 -1
  230. package/dist/index241.js +2 -7
  231. package/dist/index242.cjs +1 -1
  232. package/dist/index242.js +11 -26
  233. package/dist/index243.cjs +1 -1
  234. package/dist/index243.js +11 -102
  235. package/dist/index244.cjs +1 -1
  236. package/dist/index244.js +18 -15
  237. package/dist/index245.cjs +1 -1
  238. package/dist/index245.js +6 -214
  239. package/dist/index246.cjs +1 -1
  240. package/dist/index246.js +6 -206
  241. package/dist/index247.cjs +1 -1
  242. package/dist/index247.js +25 -41
  243. package/dist/index248.cjs +1 -1
  244. package/dist/index248.js +10 -77
  245. package/dist/index249.cjs +1 -1
  246. package/dist/index249.js +20 -2
  247. package/dist/index25.cjs +1 -1
  248. package/dist/index25.js +2 -2
  249. package/dist/index251.cjs +1 -1
  250. package/dist/index251.js +1 -1
  251. package/dist/index252.cjs +1 -1
  252. package/dist/index252.js +657 -68
  253. package/dist/index253.cjs +1 -1
  254. package/dist/index253.js +154 -634
  255. package/dist/index254.cjs +1 -1
  256. package/dist/index254.js +67 -176
  257. package/dist/index26.cjs +1 -1
  258. package/dist/index26.js +1 -1
  259. package/dist/index30.cjs +1 -1
  260. package/dist/index30.js +6 -6
  261. package/dist/index31.cjs +1 -1
  262. package/dist/index31.js +2 -2
  263. package/dist/index35.cjs +1 -1
  264. package/dist/index35.js +1 -1
  265. package/dist/index37.cjs +1 -1
  266. package/dist/index37.js +8 -8
  267. package/dist/index38.cjs +1 -1
  268. package/dist/index38.js +1 -1
  269. package/dist/index39.cjs +1 -1
  270. package/dist/index39.js +1 -1
  271. package/dist/index40.cjs +1 -1
  272. package/dist/index40.js +2 -2
  273. package/dist/index42.cjs +1 -1
  274. package/dist/index42.js +2 -2
  275. package/dist/index43.cjs +1 -1
  276. package/dist/index43.js +2 -2
  277. package/dist/index47.cjs +1 -1
  278. package/dist/index47.js +4 -4
  279. package/dist/index48.cjs +1 -1
  280. package/dist/index48.js +3 -3
  281. package/dist/index49.cjs +1 -1
  282. package/dist/index49.js +3 -3
  283. package/dist/index51.cjs +1 -1
  284. package/dist/index51.js +6 -6
  285. package/dist/index54.cjs +1 -1
  286. package/dist/index54.js +1 -1
  287. package/dist/index58.cjs +1 -1
  288. package/dist/index58.js +1 -1
  289. package/dist/index62.cjs +1 -1
  290. package/dist/index62.js +2 -2
  291. package/dist/index63.cjs +1 -1
  292. package/dist/index63.js +3 -3
  293. package/dist/index65.cjs +1 -1
  294. package/dist/index65.js +2 -2
  295. package/dist/index67.cjs +1 -1
  296. package/dist/index67.js +2 -2
  297. package/dist/index75.cjs +1 -1
  298. package/dist/index75.js +4 -4
  299. package/dist/index78.cjs +1 -1
  300. package/dist/index78.js +3 -3
  301. package/dist/index81.cjs +1 -1
  302. package/dist/index81.js +2 -2
  303. package/dist/index90.cjs +1 -1
  304. package/dist/index90.js +1 -1
  305. package/dist/index93.cjs +1 -1
  306. package/dist/index93.js +1 -1
  307. package/dist/index95.cjs +1 -1
  308. package/dist/index95.js +2 -2
  309. package/dist/index96.cjs +1 -1
  310. package/dist/index96.js +1 -1
  311. package/dist/index97.cjs +1 -1
  312. package/dist/index97.js +5 -5
  313. package/package.json +1 -1
package/dist/index237.js CHANGED
@@ -1,15 +1,111 @@
1
- function r() {
2
- return {
3
- current: 0,
4
- take() {
5
- return this.current++;
6
- },
7
- reset() {
8
- this.current = 0;
9
- }
10
- };
11
- }
12
- const t = /* @__PURE__ */ r();
1
+ import { crypto as o } from "./index241.js";
2
+ /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
3
+ function s(e) {
4
+ return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
5
+ }
6
+ function c(e) {
7
+ if (!Number.isSafeInteger(e) || e < 0)
8
+ throw new Error("positive integer expected, got " + e);
9
+ }
10
+ function i(e, ...t) {
11
+ if (!s(e))
12
+ throw new Error("Uint8Array expected");
13
+ if (t.length > 0 && !t.includes(e.length))
14
+ throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
15
+ }
16
+ function g(e) {
17
+ if (typeof e != "function" || typeof e.create != "function")
18
+ throw new Error("Hash should be wrapped by utils.createHasher");
19
+ c(e.outputLen), c(e.blockLen);
20
+ }
21
+ function d(e, t = !0) {
22
+ if (e.destroyed)
23
+ throw new Error("Hash instance has been destroyed");
24
+ if (t && e.finished)
25
+ throw new Error("Hash#digest() has already been called");
26
+ }
27
+ function b(e, t) {
28
+ i(e);
29
+ const r = t.outputLen;
30
+ if (e.length < r)
31
+ throw new Error("digestInto() expects output buffer of length at least " + r);
32
+ }
33
+ function m(e) {
34
+ return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
35
+ }
36
+ function x(...e) {
37
+ for (let t = 0; t < e.length; t++)
38
+ e[t].fill(0);
39
+ }
40
+ function A(e) {
41
+ return new DataView(e.buffer, e.byteOffset, e.byteLength);
42
+ }
43
+ function E(e, t) {
44
+ return e << 32 - t | e >>> t;
45
+ }
46
+ const a = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
47
+ function l(e) {
48
+ return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
49
+ }
50
+ function y(e) {
51
+ for (let t = 0; t < e.length; t++)
52
+ e[t] = l(e[t]);
53
+ return e;
54
+ }
55
+ const U = a ? (e) => e : y;
56
+ function p(e) {
57
+ if (typeof e != "string")
58
+ throw new Error("string expected");
59
+ return new Uint8Array(new TextEncoder().encode(e));
60
+ }
61
+ function w(e) {
62
+ return typeof e == "string" && (e = p(e)), i(e), e;
63
+ }
64
+ function B(...e) {
65
+ let t = 0;
66
+ for (let n = 0; n < e.length; n++) {
67
+ const f = e[n];
68
+ i(f), t += f.length;
69
+ }
70
+ const r = new Uint8Array(t);
71
+ for (let n = 0, f = 0; n < e.length; n++) {
72
+ const u = e[n];
73
+ r.set(u, f), f += u.length;
74
+ }
75
+ return r;
76
+ }
77
+ class L {
78
+ }
79
+ function H(e) {
80
+ const t = (n) => e().update(w(n)).digest(), r = e();
81
+ return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
82
+ }
83
+ function V(e = 32) {
84
+ if (o && typeof o.getRandomValues == "function")
85
+ return o.getRandomValues(new Uint8Array(e));
86
+ if (o && typeof o.randomBytes == "function")
87
+ return Uint8Array.from(o.randomBytes(e));
88
+ throw new Error("crypto.getRandomValues must be defined");
89
+ }
13
90
  export {
14
- t as idCache
91
+ L as Hash,
92
+ i as abytes,
93
+ d as aexists,
94
+ g as ahash,
95
+ c as anumber,
96
+ b as aoutput,
97
+ l as byteSwap,
98
+ y as byteSwap32,
99
+ x as clean,
100
+ B as concatBytes,
101
+ H as createHasher,
102
+ A as createView,
103
+ s as isBytes,
104
+ a as isLE,
105
+ V as randomBytes,
106
+ E as rotr,
107
+ U as swap32IfBE,
108
+ w as toBytes,
109
+ m as u32,
110
+ p as utf8ToBytes
15
111
  };
package/dist/index238.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=BigInt(2**32-1),c=BigInt(32);function u(t,o=!1){return o?{h:Number(t&l),l:Number(t>>c&l)}:{h:Number(t>>c&l)|0,l:Number(t&l)|0}}function B(t,o=!1){const r=t.length;let n=new Uint32Array(r),i=new Uint32Array(r);for(let e=0;e<r;e++){const{h:f,l:s}=u(t[e],o);[n[e],i[e]]=[f,s]}return[n,i]}const g=(t,o,r)=>t<<r|o>>>32-r,m=(t,o,r)=>o<<r|t>>>32-r,S=(t,o,r)=>o<<r-32|t>>>64-r,a=(t,o,r)=>t<<r-32|o>>>64-r;exports.fromBig=u;exports.rotlBH=S;exports.rotlBL=a;exports.rotlSH=g;exports.rotlSL=m;exports.split=B;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const w=BigInt(0),m=BigInt(1);function y(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function d(t){if(!y(t))throw new Error("Uint8Array expected")}function I(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}function N(t){const e=t.toString(16);return e.length&1?"0"+e:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?w:BigInt("0x"+t)}const U=typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function",_=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function E(t){if(d(t),U)return t.toHex();let e="";for(let r=0;r<t.length;r++)e+=_[t[r]];return e}const u={_0:48,_9:57,A:65,F:70,a:97,f:102};function B(t){if(t>=u._0&&t<=u._9)return t-u._0;if(t>=u.A&&t<=u.F)return t-(u.A-10);if(t>=u.a&&t<=u.f)return t-(u.a-10)}function A(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(U)return Uint8Array.fromHex(t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=B(t.charCodeAt(i)),f=B(t.charCodeAt(i+1));if(a===void 0||f===void 0){const c=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+c+'" at index '+i)}n[o]=a*16+f}return n}function k(t){return h(E(t))}function O(t){return d(t),h(E(Uint8Array.from(t).reverse()))}function T(t,e){return A(t.toString(16).padStart(e*2,"0"))}function F(t,e){return T(t,e).reverse()}function M(t,e,r){let n;if(typeof e=="string")try{n=A(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(y(e))n=Uint8Array.from(e);else throw new Error(t+" must be hex string or Uint8Array");const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(t+" of length "+r+" expected, got "+o);return n}function v(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];d(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}const b=t=>typeof t=="bigint"&&w<=t;function H(t,e,r){return b(t)&&b(e)&&b(r)&&e<=t&&t<r}function R(t,e,r,n){if(!H(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function j(t){let e;for(e=0;t>w;t>>=m,e+=1);return e}const V=t=>(m<<BigInt(t))-m,p=t=>new Uint8Array(t),x=t=>Uint8Array.from(t);function z(t,e,r){if(typeof t!="number"||t<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=p(t),o=p(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},f=(...s)=>r(o,n,...s),c=(s=p(0))=>{o=f(x([0]),s),n=f(),s.length!==0&&(o=f(x([1]),s),n=f())},S=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const l=[];for(;s<e;){n=f();const g=n.slice();l.push(g),s+=n.length}return v(...l)};return(s,l)=>{a(),c(s);let g;for(;!(g=l(S()));)c();return a(),g}}const C={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",stringOrUint8Array:t=>typeof t=="string"||y(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function D(t,e,r={}){const n=(o,i,a)=>{const f=C[i];if(typeof f!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!f(c,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+c)};for(const[o,i]of Object.entries(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}function L(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=R;exports.abool=I;exports.abytes=d;exports.bitLen=j;exports.bitMask=V;exports.bytesToHex=E;exports.bytesToNumberBE=k;exports.bytesToNumberLE=O;exports.concatBytes=v;exports.createHmacDrbg=z;exports.ensureBytes=M;exports.hexToBytes=A;exports.hexToNumber=h;exports.inRange=H;exports.isBytes=y;exports.memoized=L;exports.numberToBytesBE=T;exports.numberToBytesLE=F;exports.numberToHexUnpadded=N;exports.validateObject=D;
package/dist/index238.js CHANGED
@@ -1,22 +1,209 @@
1
- const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
2
- function s(t, r = !1) {
3
- return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
4
- }
5
- function h(t, r = !1) {
6
- const n = t.length;
7
- let l = new Uint32Array(n), c = new Uint32Array(n);
8
- for (let e = 0; e < n; e++) {
9
- const { h: u, l: f } = s(t[e], r);
10
- [l[e], c[e]] = [u, f];
1
+ /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
2
+ const w = /* @__PURE__ */ BigInt(0), p = /* @__PURE__ */ BigInt(1);
3
+ function b(t) {
4
+ return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
5
+ }
6
+ function h(t) {
7
+ if (!b(t))
8
+ throw new Error("Uint8Array expected");
9
+ }
10
+ function k(t, n) {
11
+ if (typeof n != "boolean")
12
+ throw new Error(t + " boolean expected, got " + n);
13
+ }
14
+ function F(t) {
15
+ const n = t.toString(16);
16
+ return n.length & 1 ? "0" + n : n;
17
+ }
18
+ function E(t) {
19
+ if (typeof t != "string")
20
+ throw new Error("hex string expected, got " + typeof t);
21
+ return t === "" ? w : BigInt("0x" + t);
22
+ }
23
+ const U = (
24
+ // @ts-ignore
25
+ typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function"
26
+ ), S = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
27
+ function x(t) {
28
+ if (h(t), U)
29
+ return t.toHex();
30
+ let n = "";
31
+ for (let e = 0; e < t.length; e++)
32
+ n += S[t[e]];
33
+ return n;
34
+ }
35
+ const u = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
36
+ function m(t) {
37
+ if (t >= u._0 && t <= u._9)
38
+ return t - u._0;
39
+ if (t >= u.A && t <= u.F)
40
+ return t - (u.A - 10);
41
+ if (t >= u.a && t <= u.f)
42
+ return t - (u.a - 10);
43
+ }
44
+ function B(t) {
45
+ if (typeof t != "string")
46
+ throw new Error("hex string expected, got " + typeof t);
47
+ if (U)
48
+ return Uint8Array.fromHex(t);
49
+ const n = t.length, e = n / 2;
50
+ if (n % 2)
51
+ throw new Error("hex string expected, got unpadded hex of length " + n);
52
+ const r = new Uint8Array(e);
53
+ for (let o = 0, i = 0; o < e; o++, i += 2) {
54
+ const a = m(t.charCodeAt(i)), f = m(t.charCodeAt(i + 1));
55
+ if (a === void 0 || f === void 0) {
56
+ const c = t[i] + t[i + 1];
57
+ throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
58
+ }
59
+ r[o] = a * 16 + f;
60
+ }
61
+ return r;
62
+ }
63
+ function O(t) {
64
+ return E(x(t));
65
+ }
66
+ function V(t) {
67
+ return h(t), E(x(Uint8Array.from(t).reverse()));
68
+ }
69
+ function T(t, n) {
70
+ return B(t.toString(16).padStart(n * 2, "0"));
71
+ }
72
+ function C(t, n) {
73
+ return T(t, n).reverse();
74
+ }
75
+ function M(t, n, e) {
76
+ let r;
77
+ if (typeof n == "string")
78
+ try {
79
+ r = B(n);
80
+ } catch (i) {
81
+ throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
82
+ }
83
+ else if (b(n))
84
+ r = Uint8Array.from(n);
85
+ else
86
+ throw new Error(t + " must be hex string or Uint8Array");
87
+ const o = r.length;
88
+ if (typeof e == "number" && o !== e)
89
+ throw new Error(t + " of length " + e + " expected, got " + o);
90
+ return r;
91
+ }
92
+ function H(...t) {
93
+ let n = 0;
94
+ for (let r = 0; r < t.length; r++) {
95
+ const o = t[r];
96
+ h(o), n += o.length;
11
97
  }
12
- return [l, c];
98
+ const e = new Uint8Array(n);
99
+ for (let r = 0, o = 0; r < t.length; r++) {
100
+ const i = t[r];
101
+ e.set(i, o), o += i.length;
102
+ }
103
+ return e;
104
+ }
105
+ const y = (t) => typeof t == "bigint" && w <= t;
106
+ function I(t, n, e) {
107
+ return y(t) && y(n) && y(e) && n <= t && t < e;
108
+ }
109
+ function R(t, n, e, r) {
110
+ if (!I(n, e, r))
111
+ throw new Error("expected valid " + t + ": " + e + " <= n < " + r + ", got " + n);
112
+ }
113
+ function j(t) {
114
+ let n;
115
+ for (n = 0; t > w; t >>= p, n += 1)
116
+ ;
117
+ return n;
118
+ }
119
+ const z = (t) => (p << BigInt(t)) - p, d = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
120
+ function D(t, n, e) {
121
+ if (typeof t != "number" || t < 2)
122
+ throw new Error("hashLen must be a number");
123
+ if (typeof n != "number" || n < 2)
124
+ throw new Error("qByteLen must be a number");
125
+ if (typeof e != "function")
126
+ throw new Error("hmacFn must be a function");
127
+ let r = d(t), o = d(t), i = 0;
128
+ const a = () => {
129
+ r.fill(1), o.fill(0), i = 0;
130
+ }, f = (...s) => e(o, r, ...s), c = (s = d(0)) => {
131
+ o = f(A([0]), s), r = f(), s.length !== 0 && (o = f(A([1]), s), r = f());
132
+ }, v = () => {
133
+ if (i++ >= 1e3)
134
+ throw new Error("drbg: tried 1000 values");
135
+ let s = 0;
136
+ const l = [];
137
+ for (; s < n; ) {
138
+ r = f();
139
+ const g = r.slice();
140
+ l.push(g), s += r.length;
141
+ }
142
+ return H(...l);
143
+ };
144
+ return (s, l) => {
145
+ a(), c(s);
146
+ let g;
147
+ for (; !(g = l(v())); )
148
+ c();
149
+ return a(), g;
150
+ };
151
+ }
152
+ const _ = {
153
+ bigint: (t) => typeof t == "bigint",
154
+ function: (t) => typeof t == "function",
155
+ boolean: (t) => typeof t == "boolean",
156
+ string: (t) => typeof t == "string",
157
+ stringOrUint8Array: (t) => typeof t == "string" || b(t),
158
+ isSafeInteger: (t) => Number.isSafeInteger(t),
159
+ array: (t) => Array.isArray(t),
160
+ field: (t, n) => n.Fp.isValid(t),
161
+ hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
162
+ };
163
+ function P(t, n, e = {}) {
164
+ const r = (o, i, a) => {
165
+ const f = _[i];
166
+ if (typeof f != "function")
167
+ throw new Error("invalid validator function");
168
+ const c = t[o];
169
+ if (!(a && c === void 0) && !f(c, t))
170
+ throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
171
+ };
172
+ for (const [o, i] of Object.entries(n))
173
+ r(o, i, !1);
174
+ for (const [o, i] of Object.entries(e))
175
+ r(o, i, !0);
176
+ return t;
177
+ }
178
+ function W(t) {
179
+ const n = /* @__PURE__ */ new WeakMap();
180
+ return (e, ...r) => {
181
+ const o = n.get(e);
182
+ if (o !== void 0)
183
+ return o;
184
+ const i = t(e, ...r);
185
+ return n.set(e, i), i;
186
+ };
13
187
  }
14
- const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
15
188
  export {
16
- s as fromBig,
17
- B as rotlBH,
18
- a as rotlBL,
19
- m as rotlSH,
20
- A as rotlSL,
21
- h as split
189
+ R as aInRange,
190
+ k as abool,
191
+ h as abytes,
192
+ j as bitLen,
193
+ z as bitMask,
194
+ x as bytesToHex,
195
+ O as bytesToNumberBE,
196
+ V as bytesToNumberLE,
197
+ H as concatBytes,
198
+ D as createHmacDrbg,
199
+ M as ensureBytes,
200
+ B as hexToBytes,
201
+ E as hexToNumber,
202
+ I as inRange,
203
+ b as isBytes,
204
+ W as memoized,
205
+ T as numberToBytesBE,
206
+ C as numberToBytesLE,
207
+ F as numberToHexUnpadded,
208
+ P as validateObject
22
209
  };
package/dist/index239.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index249.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function s(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function u(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function f(t,...e){if(!s(t))throw new Error("Uint8Array expected");if(e.length>0&&!e.includes(t.length))throw new Error("Uint8Array expected of length "+e+", got length="+t.length)}function h(t){if(typeof t!="function"||typeof t.create!="function")throw new Error("Hash should be wrapped by utils.createHasher");u(t.outputLen),u(t.blockLen)}function g(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function b(t,e){f(t);const r=e.outputLen;if(t.length<r)throw new Error("digestInto() expects output buffer of length at least "+r)}function d(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function m(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function B(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function x(t,e){return t<<32-e|t>>>e}const a=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function y(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function p(t){for(let e=0;e<t.length;e++)t[e]=y(t[e]);return t}const E=a?t=>t:p;function l(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}function w(t){return typeof t=="string"&&(t=l(t)),f(t),t}function A(...t){let e=0;for(let n=0;n<t.length;n++){const i=t[n];f(i),e+=i.length}const r=new Uint8Array(e);for(let n=0,i=0;n<t.length;n++){const c=t[n];r.set(c,i),i+=c.length}return r}class U{}function L(t){const e=n=>t().update(w(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function H(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 Uint8Array.from(o.crypto.randomBytes(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=U;exports.abytes=f;exports.aexists=g;exports.ahash=h;exports.anumber=u;exports.aoutput=b;exports.byteSwap=y;exports.byteSwap32=p;exports.clean=m;exports.concatBytes=A;exports.createHasher=L;exports.createView=B;exports.isBytes=s;exports.isLE=a;exports.randomBytes=H;exports.rotr=x;exports.swap32IfBE=E;exports.toBytes=w;exports.u32=d;exports.utf8ToBytes=l;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index237.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/index239.js CHANGED
@@ -1,111 +1,45 @@
1
- import { crypto as o } from "./index249.js";
2
- /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
3
- function s(e) {
4
- return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
5
- }
6
- function c(e) {
7
- if (!Number.isSafeInteger(e) || e < 0)
8
- throw new Error("positive integer expected, got " + e);
9
- }
10
- function i(e, ...t) {
11
- if (!s(e))
12
- throw new Error("Uint8Array expected");
13
- if (t.length > 0 && !t.includes(e.length))
14
- throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
15
- }
16
- function g(e) {
17
- if (typeof e != "function" || typeof e.create != "function")
18
- throw new Error("Hash should be wrapped by utils.createHasher");
19
- c(e.outputLen), c(e.blockLen);
20
- }
21
- function d(e, t = !0) {
22
- if (e.destroyed)
23
- throw new Error("Hash instance has been destroyed");
24
- if (t && e.finished)
25
- throw new Error("Hash#digest() has already been called");
26
- }
27
- function b(e, t) {
28
- i(e);
29
- const r = t.outputLen;
30
- if (e.length < r)
31
- throw new Error("digestInto() expects output buffer of length at least " + r);
32
- }
33
- function m(e) {
34
- return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
35
- }
36
- function x(...e) {
37
- for (let t = 0; t < e.length; t++)
38
- e[t].fill(0);
39
- }
40
- function A(e) {
41
- return new DataView(e.buffer, e.byteOffset, e.byteLength);
42
- }
43
- function E(e, t) {
44
- return e << 32 - t | e >>> t;
45
- }
46
- const a = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
47
- function l(e) {
48
- return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
49
- }
50
- function y(e) {
51
- for (let t = 0; t < e.length; t++)
52
- e[t] = l(e[t]);
53
- return e;
54
- }
55
- const U = a ? (e) => e : y;
56
- function p(e) {
57
- if (typeof e != "string")
58
- throw new Error("string expected");
59
- return new Uint8Array(new TextEncoder().encode(e));
60
- }
61
- function w(e) {
62
- return typeof e == "string" && (e = p(e)), i(e), e;
63
- }
64
- function B(...e) {
65
- let t = 0;
66
- for (let n = 0; n < e.length; n++) {
67
- const f = e[n];
68
- i(f), t += f.length;
1
+ import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index237.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);
69
17
  }
70
- const r = new Uint8Array(t);
71
- for (let n = 0, f = 0; n < e.length; n++) {
72
- const u = e[n];
73
- r.set(u, f), f += u.length;
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();
74
38
  }
75
- return r;
76
- }
77
- class L {
78
- }
79
- function H(e) {
80
- const t = (n) => e().update(w(n)).digest(), r = e();
81
- return t.outputLen = r.outputLen, t.blockLen = r.blockLen, t.create = () => e(), t;
82
- }
83
- function V(e = 32) {
84
- if (o && typeof o.getRandomValues == "function")
85
- return o.getRandomValues(new Uint8Array(e));
86
- if (o && typeof o.randomBytes == "function")
87
- return Uint8Array.from(o.randomBytes(e));
88
- throw new Error("crypto.getRandomValues must be defined");
89
39
  }
40
+ const y = (n, t, i) => new r(n, t).update(i).digest();
41
+ y.create = (n, t) => new r(n, t);
90
42
  export {
91
- L as Hash,
92
- i as abytes,
93
- d as aexists,
94
- g as ahash,
95
- c as anumber,
96
- b as aoutput,
97
- l as byteSwap,
98
- y as byteSwap32,
99
- x as clean,
100
- B as concatBytes,
101
- H as createHasher,
102
- A as createView,
103
- s as isBytes,
104
- a as isLE,
105
- V as randomBytes,
106
- E as rotr,
107
- U as swap32IfBE,
108
- w as toBytes,
109
- m as u32,
110
- p as utf8ToBytes
43
+ r as HMAC,
44
+ y as hmac
111
45
  };
package/dist/index24.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const j=require("./index143.cjs"),E=require("./index144.cjs"),H=require("./index46.cjs"),U=require("./index145.cjs"),_=require("./index141.cjs");function k(v,r={}){const{batch:o,fetchFn:l,fetchOptions:u,key:h="http",methods:q,name:d="HTTP JSON-RPC",onFetchRequest:y,onFetchResponse:f,retryDelay:R,raw:w}=r;return({chain:n,retryCount:S,timeout:m})=>{const{batchSize:C=1e3,wait:b=0}=typeof o=="object"?o:{},T=r.retryCount??S,c=m??r.timeout??1e4,e=n==null?void 0:n.rpcUrls.default.http[0];if(!e)throw new E.UrlRequiredError;const a=U.getHttpRpcClient(e,{fetchFn:l,fetchOptions:u,onRequest:y,onResponse:f,timeout:c});return _.createTransport({key:h,methods:q,name:d,async request({method:B,params:F}){const i={method:B,params:F},{schedule:O}=H.createBatchScheduler({id:e,wait:b,shouldSplitBatch(t){return t.length>C},fn:t=>a.request({body:t}),sort:(t,g)=>t.id-g.id}),P=async t=>o?O(t):[await a.request({body:t})],[{error:s,result:p}]=await P(i);if(w)return{error:s,result:p};if(s)throw new j.RpcRequestError({body:i,error:s,url:e});return p},retryCount:T,retryDelay:R,timeout:c,type:"http"},{fetchOptions:u,url:e})}}exports.http=k;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const j=require("./index161.cjs"),E=require("./index162.cjs"),H=require("./index46.cjs"),U=require("./index163.cjs"),_=require("./index159.cjs");function k(v,r={}){const{batch:o,fetchFn:l,fetchOptions:u,key:h="http",methods:q,name:d="HTTP JSON-RPC",onFetchRequest:y,onFetchResponse:f,retryDelay:R,raw:w}=r;return({chain:n,retryCount:S,timeout:m})=>{const{batchSize:C=1e3,wait:b=0}=typeof o=="object"?o:{},T=r.retryCount??S,c=m??r.timeout??1e4,e=n==null?void 0:n.rpcUrls.default.http[0];if(!e)throw new E.UrlRequiredError;const a=U.getHttpRpcClient(e,{fetchFn:l,fetchOptions:u,onRequest:y,onResponse:f,timeout:c});return _.createTransport({key:h,methods:q,name:d,async request({method:B,params:F}){const i={method:B,params:F},{schedule:O}=H.createBatchScheduler({id:e,wait:b,shouldSplitBatch(t){return t.length>C},fn:t=>a.request({body:t}),sort:(t,g)=>t.id-g.id}),P=async t=>o?O(t):[await a.request({body:t})],[{error:s,result:p}]=await P(i);if(w)return{error:s,result:p};if(s)throw new j.RpcRequestError({body:i,error:s,url:e});return p},retryCount:T,retryDelay:R,timeout:c,type:"http"},{fetchOptions:u,url:e})}}exports.http=k;
package/dist/index24.js CHANGED
@@ -1,8 +1,8 @@
1
- import { RpcRequestError as P } from "./index143.js";
2
- import { UrlRequiredError as U } from "./index144.js";
1
+ import { RpcRequestError as P } from "./index161.js";
2
+ import { UrlRequiredError as U } from "./index162.js";
3
3
  import { createBatchScheduler as _ } from "./index46.js";
4
- import { getHttpRpcClient as j } from "./index145.js";
5
- import { createTransport as k } from "./index141.js";
4
+ import { getHttpRpcClient as j } from "./index163.js";
5
+ import { createTransport as k } from "./index159.js";
6
6
  function v(x, r = {}) {
7
7
  const { batch: o, fetchFn: h, fetchOptions: u, key: m = "http", methods: a, name: f = "HTTP JSON-RPC", onFetchRequest: y, onFetchResponse: d, retryDelay: R, raw: w } = r;
8
8
  return ({ chain: n, retryCount: q, timeout: C }) => {
package/dist/index240.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index168.cjs"),r=require("./index178.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index237.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/index240.js CHANGED
@@ -1,9 +1,81 @@
1
- import { toBytes as o } from "./index168.js";
2
- import { keccak256 as r } from "./index178.js";
3
- const e = (t) => r(o(t));
4
- function c(t) {
5
- return e(t);
1
+ import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index237.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);
6
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();
63
+ }
64
+ }
65
+ const B = /* @__PURE__ */ Uint32Array.from([
66
+ 1779033703,
67
+ 3144134277,
68
+ 1013904242,
69
+ 2773480762,
70
+ 1359893119,
71
+ 2600822924,
72
+ 528734635,
73
+ 1541459225
74
+ ]);
7
75
  export {
8
- c as hashSignature
76
+ U as Chi,
77
+ m as HashMD,
78
+ _ as Maj,
79
+ B as SHA256_IV,
80
+ y as setBigUint64
9
81
  };
package/dist/index241.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index242.cjs"),n=require("./index224.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;
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;