@gardenfi/utils 2.1.3-beta.2 → 2.1.3-beta.21

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 (233) hide show
  1. package/dist/index104.cjs +1 -1
  2. package/dist/index104.js +1 -1
  3. package/dist/index107.cjs +1 -1
  4. package/dist/index107.js +75 -46
  5. package/dist/index108.cjs +1 -1
  6. package/dist/index108.js +4 -4
  7. package/dist/index110.cjs +1 -1
  8. package/dist/index110.js +1 -1
  9. package/dist/index111.cjs +1 -1
  10. package/dist/index111.js +1 -1
  11. package/dist/index112.cjs +1 -1
  12. package/dist/index112.js +1 -1
  13. package/dist/index113.cjs +1 -1
  14. package/dist/index113.js +1 -1
  15. package/dist/index125.cjs +1 -1
  16. package/dist/index125.js +1 -1
  17. package/dist/index166.cjs +1 -1
  18. package/dist/index166.js +36 -34
  19. package/dist/index192.cjs +1 -1
  20. package/dist/index192.js +27 -25
  21. package/dist/index203.cjs +1 -1
  22. package/dist/index203.js +16 -16
  23. package/dist/index22.cjs +1 -1
  24. package/dist/index22.js +6 -6
  25. package/dist/index222.cjs +1 -1
  26. package/dist/index222.js +2 -2
  27. package/dist/index225.cjs +1 -1
  28. package/dist/index225.js +43 -43
  29. package/dist/index226.cjs +1 -1
  30. package/dist/index226.js +3 -113
  31. package/dist/index228.cjs +1 -1
  32. package/dist/index228.js +14 -14
  33. package/dist/index230.cjs +1 -1
  34. package/dist/index230.js +10 -25
  35. package/dist/index231.cjs +1 -1
  36. package/dist/index231.js +16 -13
  37. package/dist/index232.cjs +1 -1
  38. package/dist/index232.js +21 -14
  39. package/dist/index233.cjs +1 -1
  40. package/dist/index233.js +30 -5
  41. package/dist/index234.cjs +1 -1
  42. package/dist/index234.js +2 -14
  43. package/dist/index235.cjs +1 -1
  44. package/dist/index235.js +12 -9
  45. package/dist/index236.cjs +1 -1
  46. package/dist/index236.js +12 -16
  47. package/dist/index237.cjs +1 -1
  48. package/dist/index237.js +47 -10
  49. package/dist/index238.cjs +1 -1
  50. package/dist/index238.js +10 -15
  51. package/dist/index239.cjs +1 -1
  52. package/dist/index239.js +7 -22
  53. package/dist/index240.cjs +1 -1
  54. package/dist/index240.js +9 -30
  55. package/dist/index241.cjs +1 -1
  56. package/dist/index241.js +14 -2
  57. package/dist/index242.cjs +1 -1
  58. package/dist/index242.js +14 -13
  59. package/dist/index243.cjs +1 -1
  60. package/dist/index243.js +9 -12
  61. package/dist/index244.cjs +1 -1
  62. package/dist/index244.js +24 -47
  63. package/dist/index245.cjs +1 -1
  64. package/dist/index245.js +12 -11
  65. package/dist/index246.cjs +1 -1
  66. package/dist/index246.js +24 -7
  67. package/dist/index247.cjs +1 -1
  68. package/dist/index247.js +12 -8
  69. package/dist/index248.cjs +1 -1
  70. package/dist/index248.js +15 -13
  71. package/dist/index249.cjs +2 -1
  72. package/dist/index249.js +21 -11
  73. package/dist/index250.cjs +1 -1
  74. package/dist/index250.js +52 -9
  75. package/dist/index251.cjs +1 -1
  76. package/dist/index251.js +25 -24
  77. package/dist/index252.cjs +1 -1
  78. package/dist/index252.js +13 -12
  79. package/dist/index253.cjs +1 -1
  80. package/dist/index253.js +15 -24
  81. package/dist/index254.cjs +1 -2
  82. package/dist/index254.js +5 -24
  83. package/dist/index255.cjs +1 -1
  84. package/dist/index255.js +12 -12
  85. package/dist/index256.cjs +1 -1
  86. package/dist/index256.js +10 -15
  87. package/dist/index257.cjs +1 -1
  88. package/dist/index257.js +16 -52
  89. package/dist/index266.cjs +1 -1
  90. package/dist/index266.js +1 -1
  91. package/dist/index277.cjs +1 -1
  92. package/dist/index277.js +103 -16
  93. package/dist/index278.cjs +1 -1
  94. package/dist/index278.js +5 -222
  95. package/dist/index279.cjs +1 -1
  96. package/dist/index279.js +224 -6
  97. package/dist/index28.cjs +1 -1
  98. package/dist/index28.js +2 -2
  99. package/dist/index280.cjs +1 -1
  100. package/dist/index280.js +7 -7
  101. package/dist/index281.cjs +1 -1
  102. package/dist/index281.js +7 -27
  103. package/dist/index282.cjs +1 -1
  104. package/dist/index282.js +26 -34
  105. package/dist/index283.cjs +1 -1
  106. package/dist/index283.js +13 -12
  107. package/dist/index284.cjs +1 -1
  108. package/dist/index284.js +124 -48
  109. package/dist/index285.cjs +1 -1
  110. package/dist/index285.js +3 -67
  111. package/dist/index286.cjs +1 -1
  112. package/dist/index286.js +137 -37
  113. package/dist/index287.cjs +1 -1
  114. package/dist/index287.js +156 -2
  115. package/dist/index288.cjs +1 -1
  116. package/dist/index288.js +8 -205
  117. package/dist/index289.cjs +1 -1
  118. package/dist/index289.js +113 -3
  119. package/dist/index290.cjs +2 -1
  120. package/dist/index290.js +122 -128
  121. package/dist/index291.cjs +1 -1
  122. package/dist/index291.js +137 -153
  123. package/dist/index292.cjs +1 -1
  124. package/dist/index292.js +42 -9
  125. package/dist/index293.cjs +1 -1
  126. package/dist/index293.js +72 -107
  127. package/dist/index294.cjs +1 -2
  128. package/dist/index294.js +2 -135
  129. package/dist/index295.cjs +1 -1
  130. package/dist/index295.js +68 -11
  131. package/dist/index296.cjs +1 -1
  132. package/dist/index296.js +696 -17
  133. package/dist/index297.cjs +1 -1
  134. package/dist/index297.js +200 -67
  135. package/dist/index298.cjs +2 -1
  136. package/dist/index298.js +63 -639
  137. package/dist/index299.cjs +1 -1
  138. package/dist/index299.js +4 -172
  139. package/dist/index30.cjs +1 -1
  140. package/dist/index30.js +1 -1
  141. package/dist/index300.cjs +1 -2
  142. package/dist/index300.js +39 -65
  143. package/dist/index301.cjs +1 -1
  144. package/dist/index301.js +7 -4
  145. package/dist/index302.cjs +1 -1
  146. package/dist/index302.js +60 -38
  147. package/dist/index303.cjs +1 -1
  148. package/dist/index303.js +77 -7
  149. package/dist/index304.cjs +1 -1
  150. package/dist/index304.js +4 -63
  151. package/dist/index305.cjs +1 -1
  152. package/dist/index305.js +181 -64
  153. package/dist/index306.cjs +1 -1
  154. package/dist/index306.js +12 -4
  155. package/dist/index307.cjs +1 -1
  156. package/dist/index307.js +19 -194
  157. package/dist/index308.cjs +1 -1
  158. package/dist/index308.js +3 -3
  159. package/dist/index310.cjs +1 -1
  160. package/dist/index310.js +1 -1
  161. package/dist/index311.cjs +1 -1
  162. package/dist/index311.js +5 -105
  163. package/dist/index312.cjs +1 -1
  164. package/dist/index312.js +2 -5
  165. package/dist/index313.cjs +1 -1
  166. package/dist/index313.js +22 -2
  167. package/dist/index35.cjs +1 -1
  168. package/dist/index35.js +41 -41
  169. package/dist/index36.cjs +1 -1
  170. package/dist/index36.js +1 -1
  171. package/dist/index39.cjs +1 -1
  172. package/dist/index39.js +29 -24
  173. package/dist/index43.cjs +1 -1
  174. package/dist/index43.js +40 -21
  175. package/dist/index44.cjs +1 -1
  176. package/dist/index44.js +24 -24
  177. package/dist/index53.cjs +1 -1
  178. package/dist/index53.js +2 -2
  179. package/dist/index54.cjs +1 -1
  180. package/dist/index54.js +1 -1
  181. package/dist/index55.cjs +1 -1
  182. package/dist/index55.js +2 -2
  183. package/dist/index56.cjs +1 -1
  184. package/dist/index56.js +1 -1
  185. package/dist/index57.cjs +1 -1
  186. package/dist/index57.js +2 -2
  187. package/dist/index58.cjs +1 -1
  188. package/dist/index58.js +98 -97
  189. package/dist/index59.cjs +1 -1
  190. package/dist/index59.js +2 -2
  191. package/dist/index60.cjs +1 -1
  192. package/dist/index60.js +1 -1
  193. package/dist/index61.cjs +1 -1
  194. package/dist/index61.js +1 -1
  195. package/dist/index62.cjs +1 -1
  196. package/dist/index62.js +1 -1
  197. package/dist/index64.cjs +1 -1
  198. package/dist/index64.js +4 -4
  199. package/dist/index73.cjs +1 -1
  200. package/dist/index73.js +1 -1
  201. package/dist/index74.cjs +1 -1
  202. package/dist/index74.js +1 -1
  203. package/dist/index79.cjs +1 -1
  204. package/dist/index79.js +1 -1
  205. package/dist/index84.cjs +1 -1
  206. package/dist/index84.js +53 -51
  207. package/dist/index85.cjs +1 -1
  208. package/dist/index85.js +56 -55
  209. package/dist/index86.cjs +1 -1
  210. package/dist/index86.js +55 -59
  211. package/dist/index88.cjs +1 -1
  212. package/dist/index88.js +1 -1
  213. package/dist/index89.cjs +1 -1
  214. package/dist/index89.js +1 -1
  215. package/dist/index90.cjs +1 -1
  216. package/dist/index90.js +44 -42
  217. package/dist/index91.cjs +1 -1
  218. package/dist/index91.js +41 -41
  219. package/dist/index92.cjs +1 -1
  220. package/dist/index92.js +35 -34
  221. package/dist/index93.cjs +1 -1
  222. package/dist/index93.js +28 -28
  223. package/dist/index94.cjs +1 -1
  224. package/dist/index94.js +26 -26
  225. package/dist/index95.cjs +1 -1
  226. package/dist/index95.js +1 -1
  227. package/package.json +1 -1
  228. package/dist/index314.cjs +0 -1
  229. package/dist/index314.js +0 -22
  230. package/dist/index315.cjs +0 -1
  231. package/dist/index315.js +0 -74
  232. package/dist/index316.cjs +0 -1
  233. package/dist/index316.js +0 -24
package/dist/index291.js CHANGED
@@ -1,158 +1,142 @@
1
- import { BaseError as o } from "./index300.js";
2
- import { stringify as b } from "./index301.js";
3
- import { pad as d, assertEndOffset as m, assertSize as g, assertStartOffset as p } from "./index302.js";
4
- const $ = /* @__PURE__ */ new TextEncoder(), h = /* @__PURE__ */ Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
5
- function y(t, e = {}) {
6
- const { strict: r = !1 } = e;
7
- if (!t)
8
- throw new f(t);
1
+ import { hexToBytes as p, isBytes as B, abytes as v, bytesToHex as d, concatBytes as U } from "./index284.js";
2
+ import { anumber as W, randomBytes as C, utf8ToBytes as G } from "./index284.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);
8
+ }
9
+ function j(t) {
10
+ const r = t.toString(16);
11
+ return r.length & 1 ? "0" + r : r;
12
+ }
13
+ function h(t) {
9
14
  if (typeof t != "string")
10
- throw new f(t);
11
- if (r && !/^0x[0-9a-fA-F]*$/.test(t))
12
- throw new l(t);
13
- if (!t.startsWith("0x"))
14
- throw new l(t);
15
- }
16
- function B(...t) {
17
- return `0x${t.reduce((e, r) => e + r.replace("0x", ""), "")}`;
18
- }
19
- function P(t, e = {}) {
20
- const r = `0x${Number(t)}`;
21
- return typeof e.size == "number" ? (g(r, e.size), x(r, e.size)) : r;
22
- }
23
- function w(t, e = {}) {
24
- let r = "";
25
- for (let i = 0; i < t.length; i++)
26
- r += h[t[i]];
27
- const n = `0x${r}`;
28
- return typeof e.size == "number" ? (g(n, e.size), E(n, e.size)) : n;
29
- }
30
- function V(t, e = {}) {
31
- const { signed: r, size: n } = e, i = BigInt(t);
32
- let s;
33
- n ? r ? s = (1n << BigInt(n) * 8n - 1n) - 1n : s = 2n ** (BigInt(n) * 8n) - 1n : typeof t == "number" && (s = BigInt(Number.MAX_SAFE_INTEGER));
34
- const u = typeof s == "bigint" && r ? -s - 1n : 0;
35
- if (s && i > s || i < u) {
36
- const a = typeof t == "bigint" ? "n" : "";
37
- throw new O({
38
- max: s ? `${s}${a}` : void 0,
39
- min: `${u}${a}`,
40
- signed: r,
41
- size: n,
42
- value: `${t}${a}`
43
- });
44
- }
45
- const c = `0x${(r && i < 0 ? (1n << BigInt(n * 8)) + BigInt(i) : i).toString(16)}`;
46
- return n ? x(c, n) : c;
47
- }
48
- function j(t, e = {}) {
49
- return w($.encode(t), e);
50
- }
51
- function x(t, e) {
52
- return d(t, { dir: "left", size: e });
53
- }
54
- function E(t, e) {
55
- return d(t, { dir: "right", size: e });
56
- }
57
- function v(t, e, r, n = {}) {
58
- const { strict: i } = n;
59
- p(t, e);
60
- const s = `0x${t.replace("0x", "").slice((e ?? 0) * 2, (r ?? t.length) * 2)}`;
61
- return i && m(s, e, r), s;
62
- }
63
- function A(t) {
64
- return Math.ceil((t.length - 2) / 2);
65
- }
66
- function N(t, e = {}) {
67
- const { strict: r = !1 } = e;
68
- try {
69
- return y(t, { strict: r }), !0;
70
- } catch {
71
- return !1;
72
- }
73
- }
74
- class O extends o {
75
- constructor({ max: e, min: r, signed: n, size: i, value: s }) {
76
- super(`Number \`${s}\` is not in safe${i ? ` ${i * 8}-bit` : ""}${n ? " signed" : " unsigned"} integer range ${e ? `(\`${r}\` to \`${e}\`)` : `(above \`${r}\`)`}`), Object.defineProperty(this, "name", {
77
- enumerable: !0,
78
- configurable: !0,
79
- writable: !0,
80
- value: "Hex.IntegerOutOfRangeError"
81
- });
82
- }
83
- }
84
- class f extends o {
85
- constructor(e) {
86
- super(`Value \`${typeof e == "object" ? b(e) : e}\` of type \`${typeof e}\` is an invalid hex type.`, {
87
- metaMessages: ['Hex types must be represented as `"0x${string}"`.']
88
- }), Object.defineProperty(this, "name", {
89
- enumerable: !0,
90
- configurable: !0,
91
- writable: !0,
92
- value: "Hex.InvalidHexTypeError"
93
- });
94
- }
95
- }
96
- class l extends o {
97
- constructor(e) {
98
- super(`Value \`${e}\` is an invalid hex value.`, {
99
- metaMessages: [
100
- 'Hex values must start with `"0x"` and contain only hexadecimal characters (0-9, a-f, A-F).'
101
- ]
102
- }), Object.defineProperty(this, "name", {
103
- enumerable: !0,
104
- configurable: !0,
105
- writable: !0,
106
- value: "Hex.InvalidHexValueError"
107
- });
108
- }
109
- }
110
- class _ extends o {
111
- constructor({ givenSize: e, maxSize: r }) {
112
- super(`Size cannot exceed \`${r}\` bytes. Given size: \`${e}\` bytes.`), Object.defineProperty(this, "name", {
113
- enumerable: !0,
114
- configurable: !0,
115
- writable: !0,
116
- value: "Hex.SizeOverflowError"
117
- });
118
- }
119
- }
120
- class M extends o {
121
- constructor({ offset: e, position: r, size: n }) {
122
- super(`Slice ${r === "start" ? "starting" : "ending"} at offset \`${e}\` is out-of-bounds (size: \`${n}\`).`), Object.defineProperty(this, "name", {
123
- enumerable: !0,
124
- configurable: !0,
125
- writable: !0,
126
- value: "Hex.SliceOffsetOutOfBoundsError"
127
- });
128
- }
129
- }
130
- class R extends o {
131
- constructor({ size: e, targetSize: r, type: n }) {
132
- super(`${n.charAt(0).toUpperCase()}${n.slice(1).toLowerCase()} size (\`${e}\`) exceeds padding size (\`${r}\`).`), Object.defineProperty(this, "name", {
133
- enumerable: !0,
134
- configurable: !0,
135
- writable: !0,
136
- value: "Hex.SizeExceedsPaddingSizeError"
137
- });
15
+ throw new Error("hex string expected, got " + typeof t);
16
+ return t === "" ? y : BigInt("0x" + t);
17
+ }
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);
37
+ }
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}`);
138
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
+ };
139
117
  }
140
118
  export {
141
- O as IntegerOutOfRangeError,
142
- f as InvalidHexTypeError,
143
- l as InvalidHexValueError,
144
- R as SizeExceedsPaddingSizeError,
145
- _ as SizeOverflowError,
146
- M as SliceOffsetOutOfBoundsError,
147
- y as assert,
148
- B as concat,
149
- P as fromBoolean,
150
- w as fromBytes,
151
- V as fromNumber,
152
- j as fromString,
153
- x as padLeft,
154
- E as padRight,
155
- A as size,
156
- v as slice,
157
- N as validate
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
158
142
  };
package/dist/index292.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index291.cjs");function r(e){return{address:e.address,amount:o.fromNumber(e.amount),index:o.fromNumber(e.index),validatorIndex:o.fromNumber(e.validatorIndex)}}exports.toRpc=r;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index284.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/index292.js CHANGED
@@ -1,12 +1,45 @@
1
- import { fromNumber as e } from "./index291.js";
2
- function r(o) {
3
- return {
4
- address: o.address,
5
- amount: e(o.amount),
6
- index: e(o.index),
7
- validatorIndex: e(o.validatorIndex)
8
- };
1
+ import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index284.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
+ }
9
39
  }
40
+ const y = (n, t, i) => new r(n, t).update(i).digest();
41
+ y.create = (n, t) => new r(n, t);
10
42
  export {
11
- r as toRpc
43
+ r as HMAC,
44
+ y as hmac
12
45
  };
package/dist/index293.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./index300.cjs"),$=require("./index303.cjs"),g=require("./index291.cjs"),c=require("./index304.cjs"),y=require("./index267.cjs"),h=require("./index260.cjs");function I(t,r={}){const{prepare:i=!0}=r,n=Array.isArray(t)||typeof t=="string"?y.parseAbiItem(t):t;return{...n,...i?{hash:o(n)}:{}}}function q(t,r,i){const{args:n=[],prepare:a=!0}=i??{},v=g.validate(r,{strict:!1}),s=t.filter(e=>v?e.type==="function"||e.type==="error"?A(e)===g.slice(r,0,4):e.type==="event"?o(e)===r:!1:"name"in e&&e.name===r);if(s.length===0)throw new l({name:r});if(s.length===1)return{...s[0],...a?{hash:o(s[0])}:{}};let u;for(const e of s){if(!("inputs"in e))continue;if(!n||n.length===0){if(!e.inputs||e.inputs.length===0)return{...e,...a?{hash:o(e)}:{}};continue}if(!e.inputs||e.inputs.length===0||e.inputs.length!==n.length)continue;if(n.every((f,E)=>{const d="inputs"in e&&e.inputs[E];return d?c.isArgOfType(f,d):!1})){if(u&&"inputs"in u&&u.inputs){const f=c.getAmbiguousTypes(e.inputs,u.inputs,n);if(f)throw new w({abiItem:e,type:f[0]},{abiItem:u,type:f[1]})}u=e}}const p=(()=>{if(u)return u;const[e,...m]=s;return{...e,overloads:m}})();if(!p)throw new l({name:r});return{...p,...a?{hash:o(p)}:{}}}function A(t){return g.slice(o(t),0,4)}function S(t){const r=typeof t=="string"?t:h.formatAbiItem(t);return c.normalizeSignature(r)}function o(t){return typeof t!="string"&&"hash"in t&&t.hash?t.hash:$.keccak256(g.fromString(S(t)))}class w extends b.BaseError{constructor(r,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${r.type}\` in \`${c.normalizeSignature(h.formatAbiItem(r.abiItem))}\`, and`,`\`${i.type}\` in \`${c.normalizeSignature(h.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class l extends b.BaseError{constructor({name:r,data:i,type:n="item"}){const a=r?` with name "${r}"`:i?` with data "${i}"`:"";super(`ABI ${n}${a} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=w;exports.NotFoundError=l;exports.from=I;exports.fromAbi=q;exports.getSelector=A;exports.getSignature=S;exports.getSignatureHash=o;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index284.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/index293.js CHANGED
@@ -1,116 +1,81 @@
1
- import { BaseError as y } from "./index300.js";
2
- import { keccak256 as v } from "./index303.js";
3
- import { validate as $, slice as A, fromString as S } from "./index291.js";
4
- import { isArgOfType as E, normalizeSignature as p, getAmbiguousTypes as B } from "./index304.js";
5
- import { parseAbiItem as l } from "./index267.js";
6
- import { formatAbiItem as h } from "./index260.js";
7
- function H(e, r = {}) {
8
- const { prepare: i = !0 } = r, n = Array.isArray(e) ? l(e) : typeof e == "string" ? l(e) : e;
9
- return {
10
- ...n,
11
- ...i ? { hash: s(n) } : {}
12
- };
1
+ import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index284.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);
13
7
  }
14
- function M(e, r, i) {
15
- const { args: n = [], prepare: f = !0 } = i ?? {}, b = $(r, { strict: !1 }), u = e.filter((t) => b ? t.type === "function" || t.type === "error" ? T(t) === A(r, 0, 4) : t.type === "event" ? s(t) === r : !1 : "name" in t && t.name === r);
16
- if (u.length === 0)
17
- throw new d({ name: r });
18
- if (u.length === 1)
19
- return {
20
- ...u[0],
21
- ...f ? { hash: s(u[0]) } : {}
22
- };
23
- let o;
24
- for (const t of u) {
25
- if (!("inputs" in t))
26
- continue;
27
- if (!n || n.length === 0) {
28
- if (!t.inputs || t.inputs.length === 0)
29
- return {
30
- ...t,
31
- ...f ? { hash: s(t) } : {}
32
- };
33
- continue;
34
- }
35
- if (!t.inputs || t.inputs.length === 0 || t.inputs.length !== n.length)
36
- continue;
37
- if (n.every((a, w) => {
38
- const g = "inputs" in t && t.inputs[w];
39
- return g ? E(a, g) : !1;
40
- })) {
41
- if (o && "inputs" in o && o.inputs) {
42
- const a = B(t.inputs, o.inputs, n);
43
- if (a)
44
- throw new O({
45
- abiItem: t,
46
- type: a[0]
47
- }, {
48
- abiItem: o,
49
- type: a[1]
50
- });
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;
51
28
  }
52
- o = t;
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);
53
30
  }
31
+ return this.length += t.length, this.roundClean(), this;
54
32
  }
55
- const c = (() => {
56
- if (o)
57
- return o;
58
- const [t, ...m] = u;
59
- return { ...t, overloads: m };
60
- })();
61
- if (!c)
62
- throw new d({ name: r });
63
- return {
64
- ...c,
65
- ...f ? { hash: s(c) } : {}
66
- };
67
- }
68
- function T(e) {
69
- return A(s(e), 0, 4);
70
- }
71
- function F(e) {
72
- const r = typeof e == "string" ? e : h(e);
73
- return p(r);
74
- }
75
- function s(e) {
76
- return typeof e != "string" && "hash" in e && e.hash ? e.hash : v(S(F(e)));
77
- }
78
- class O extends y {
79
- constructor(r, i) {
80
- super("Found ambiguous types in overloaded ABI Items.", {
81
- metaMessages: [
82
- // TODO: abitype to add support for signature-formatted ABI items.
83
- `\`${r.type}\` in \`${p(h(r.abiItem))}\`, and`,
84
- `\`${i.type}\` in \`${p(h(i.abiItem))}\``,
85
- "",
86
- "These types encode differently and cannot be distinguished at runtime.",
87
- "Remove one of the ambiguous items in the ABI."
88
- ]
89
- }), Object.defineProperty(this, "name", {
90
- enumerable: !0,
91
- configurable: !0,
92
- writable: !0,
93
- value: "AbiItem.AmbiguityError"
94
- });
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);
95
49
  }
96
- }
97
- class d extends y {
98
- constructor({ name: r, data: i, type: n = "item" }) {
99
- const f = r ? ` with name "${r}"` : i ? ` with data "${i}"` : "";
100
- super(`ABI ${n}${f} not found.`), Object.defineProperty(this, "name", {
101
- enumerable: !0,
102
- configurable: !0,
103
- writable: !0,
104
- value: "AbiItem.NotFoundError"
105
- });
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();
106
63
  }
107
64
  }
65
+ const B = /* @__PURE__ */ Uint32Array.from([
66
+ 1779033703,
67
+ 3144134277,
68
+ 1013904242,
69
+ 2773480762,
70
+ 1359893119,
71
+ 2600822924,
72
+ 528734635,
73
+ 1541459225
74
+ ]);
108
75
  export {
109
- O as AmbiguityError,
110
- d as NotFoundError,
111
- H as from,
112
- M as fromAbi,
113
- T as getSelector,
114
- F as getSignature,
115
- s as getSignatureHash
76
+ U as Chi,
77
+ m as HashMD,
78
+ _ as Maj,
79
+ B as SHA256_IV,
80
+ y as setBigUint64
116
81
  };
package/dist/index294.cjs CHANGED
@@ -1,2 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const x=require("./index305.cjs"),d=require("./index300.cjs"),a=require("./index291.cjs"),g=require("./index306.cjs"),p=require("./index307.cjs");function P(n,e,t){const{checksumAddress:r=!1}={};if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const s=p.prepareParameters({checksumAddress:r,parameters:n,values:e}),o=p.encode(s);return o.length===0?"0x":o}function l(n,e){if(n.length!==e.length)throw new m({expectedLength:n.length,givenLength:e.length});const t=[];for(let r=0;r<n.length;r++){const s=n[r],o=e[r];t.push(l.encode(s,o))}return a.concat(...t)}(function(n){function e(t,r,s=!1){if(t==="address"){const c=r;return x.assert(c),a.padLeft(c.toLowerCase(),s?32:0)}if(t==="string")return a.fromString(r);if(t==="bytes")return r;if(t==="bool")return a.padLeft(a.fromBoolean(r),s?32:1);const o=t.match(g.integerRegex);if(o){const[c,i,u="256"]=o,h=Number.parseInt(u)/8;return a.fromNumber(r,{size:s?32:h,signed:i==="int"})}const b=t.match(g.bytesRegex);if(b){const[c,i]=b;if(Number.parseInt(i)!==(r.length-2)/2)throw new y({expectedSize:Number.parseInt(i),value:r});return a.padRight(r,s?32:0)}const f=t.match(g.arrayRegex);if(f&&Array.isArray(r)){const[c,i]=f,u=[];for(let h=0;h<r.length;h++)u.push(e(i,r[h],!0));return u.length===0?"0x":a.concat(...u)}throw new E(t)}n.encode=e})(l||(l={}));class A extends d.BaseError{constructor({expectedLength:e,givenLength:t,type:r}){super(`Array length mismatch for type \`${r}\`. Expected: \`${e}\`. Given: \`${t}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class y extends d.BaseError{constructor({expectedSize:e,value:t}){super(`Size of bytes "${t}" (bytes${a.size(t)}) does not match expected size (bytes${e}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class m extends d.BaseError{constructor({expectedLength:e,givenLength:t}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${e}`,`Given length (values): ${t}`].join(`
2
- `)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class w extends d.BaseError{constructor(e){super(`Value \`${e}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class E extends d.BaseError{constructor(e){super(`Type \`${e}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=A;exports.BytesSizeMismatchError=y;exports.InvalidArrayError=w;exports.InvalidTypeError=E;exports.LengthMismatchError=m;exports.encode=P;exports.encodePacked=l;
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;