@mtcute/core 0.1.0 → 0.1.2

package/cjs/utils/buffer-utils.d.ts

@@ -1,4 +1,3 @@
-export { _randomBytes as randomBytes } from './platform/random.js';
 /**
  * Check if two buffers are equal
  *
@@ -18,4 +17,11 @@ export declare function cloneBuffer(buf: Uint8Array, start?: number, end?: numbe
  * Concatenate multiple buffers into one
  */
 export declare function concatBuffers(buffers: Uint8Array[]): Uint8Array;
+/**
+ * Shortcut for creating a DataView from a Uint8Array
+ */
 export declare function dataViewFromBuffer(buf: Uint8Array): DataView;
+/**
+ * Reverse a buffer (or a part of it) into a new buffer
+ */
+export declare function bufferToReversed(buf: Uint8Array, start?: number, end?: number): Uint8Array;

package/cjs/utils/buffer-utils.js

@@ -1,8 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.dataViewFromBuffer = exports.concatBuffers = exports.cloneBuffer = exports.buffersEqual = exports.randomBytes = void 0;
-var random_js_1 = require("./platform/random.js");
-Object.defineProperty(exports, "randomBytes", { enumerable: true, get: function () { return random_js_1._randomBytes; } });
+exports.bufferToReversed = exports.dataViewFromBuffer = exports.concatBuffers = exports.cloneBuffer = exports.buffersEqual = void 0;
 /**
  * Check if two buffers are equal
  *
@@ -56,8 +54,23 @@ function concatBuffers(buffers) {
     return ret;
 }
 exports.concatBuffers = concatBuffers;
+/**
+ * Shortcut for creating a DataView from a Uint8Array
+ */
 function dataViewFromBuffer(buf) {
     return new DataView(buf.buffer, buf.byteOffset, buf.byteLength);
 }
 exports.dataViewFromBuffer = dataViewFromBuffer;
+/**
+ * Reverse a buffer (or a part of it) into a new buffer
+ */
+function bufferToReversed(buf, start = 0, end = buf.length) {
+    const len = end - start;
+    const ret = new Uint8Array(len);
+    for (let i = 0; i < len; i++) {
+        ret[i] = buf[end - i - 1];
+    }
+    return ret;
+}
+exports.bufferToReversed = bufferToReversed;
 //# sourceMappingURL=buffer-utils.js.map

package/cjs/utils/buffer-utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"buffer-utils.js","sourceRoot":"","sources":["../../../src/utils/buffer-utils.ts"],"names":[],"mappings":";;;AAAA,kDAAkE;AAAzD,wGAAA,YAAY,OAAe;AAEpC;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,CAAa,EAAE,CAAa;IACrD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;KAClC;IAED,OAAO,IAAI,CAAA;AACf,CAAC;AARD,oCAQC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM;IACpE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,CAAA;IACvC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;IAEjC,OAAO,GAAG,CAAA;AACd,CAAC;AALD,kCAKC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,OAAqB;IAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAA;IAE3C,0CAA0C;IAC1C,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;QAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;KAChC;IACD,yCAAyC;IAEzC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QACvB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;KACvB;IAED,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QACvB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACpB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;KACvB;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAxBD,sCAwBC;AAED,SAAgB,kBAAkB,CAAC,GAAe;IAC9C,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAA;AACnE,CAAC;AAFD,gDAEC","sourcesContent":["export { _randomBytes as randomBytes } from './platform/random.js'\n\n/**\n * Check if two buffers are equal\n *\n * @param a  First buffer\n * @param b  Second buffer\n */\nexport function buffersEqual(a: Uint8Array, b: Uint8Array): boolean {\n    if (a.length !== b.length) return false\n\n    for (let i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false\n    }\n\n    return true\n}\n\n/**\n * Copy a buffer\n *\n * @param buf  Buffer to copy\n * @param start  Start offset\n * @param end  End offset\n */\nexport function cloneBuffer(buf: Uint8Array, start = 0, end = buf.length): Uint8Array {\n    const ret = new Uint8Array(end - start)\n    ret.set(buf.subarray(start, end))\n\n    return ret\n}\n\n/**\n * Concatenate multiple buffers into one\n */\nexport function concatBuffers(buffers: Uint8Array[]): Uint8Array {\n    if (buffers.length === 1) return buffers[0]\n\n    /* eslint-disable no-restricted-globals */\n    if (typeof Buffer !== 'undefined') {\n        return Buffer.concat(buffers)\n    }\n    /* eslint-enable no-restricted-globals */\n\n    let length = 0\n\n    for (const buf of buffers) {\n        length += buf.length\n    }\n\n    const ret = new Uint8Array(length)\n    let offset = 0\n\n    for (const buf of buffers) {\n        ret.set(buf, offset)\n        offset += buf.length\n    }\n\n    return ret\n}\n\nexport function dataViewFromBuffer(buf: Uint8Array): DataView {\n    return new DataView(buf.buffer, buf.byteOffset, buf.byteLength)\n}\n"]}
+{"version":3,"file":"buffer-utils.js","sourceRoot":"","sources":["../../../src/utils/buffer-utils.ts"],"names":[],"mappings":";;;AAAA;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,CAAa,EAAE,CAAa;IACrD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;KAClC;IAED,OAAO,IAAI,CAAA;AACf,CAAC;AARD,oCAQC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM;IACpE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,CAAA;IACvC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;IAEjC,OAAO,GAAG,CAAA;AACd,CAAC;AALD,kCAKC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,OAAqB;IAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAA;IAE3C,0CAA0C;IAC1C,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;QAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;KAChC;IACD,yCAAyC;IAEzC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QACvB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;KACvB;IAED,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,MAAM,GAAG,CAAC,CAAA;IAEd,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QACvB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACpB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAA;KACvB;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAxBD,sCAwBC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAAC,GAAe;IAC9C,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAA;AACnE,CAAC;AAFD,gDAEC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAC,GAAe,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM;IACzE,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAA;IACvB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;KAC5B;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AATD,4CASC","sourcesContent":["/**\n * Check if two buffers are equal\n *\n * @param a  First buffer\n * @param b  Second buffer\n */\nexport function buffersEqual(a: Uint8Array, b: Uint8Array): boolean {\n    if (a.length !== b.length) return false\n\n    for (let i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false\n    }\n\n    return true\n}\n\n/**\n * Copy a buffer\n *\n * @param buf  Buffer to copy\n * @param start  Start offset\n * @param end  End offset\n */\nexport function cloneBuffer(buf: Uint8Array, start = 0, end = buf.length): Uint8Array {\n    const ret = new Uint8Array(end - start)\n    ret.set(buf.subarray(start, end))\n\n    return ret\n}\n\n/**\n * Concatenate multiple buffers into one\n */\nexport function concatBuffers(buffers: Uint8Array[]): Uint8Array {\n    if (buffers.length === 1) return buffers[0]\n\n    /* eslint-disable no-restricted-globals */\n    if (typeof Buffer !== 'undefined') {\n        return Buffer.concat(buffers)\n    }\n    /* eslint-enable no-restricted-globals */\n\n    let length = 0\n\n    for (const buf of buffers) {\n        length += buf.length\n    }\n\n    const ret = new Uint8Array(length)\n    let offset = 0\n\n    for (const buf of buffers) {\n        ret.set(buf, offset)\n        offset += buf.length\n    }\n\n    return ret\n}\n\n/**\n * Shortcut for creating a DataView from a Uint8Array\n */\nexport function dataViewFromBuffer(buf: Uint8Array): DataView {\n    return new DataView(buf.buffer, buf.byteOffset, buf.byteLength)\n}\n\n/**\n * Reverse a buffer (or a part of it) into a new buffer\n */\nexport function bufferToReversed(buf: Uint8Array, start = 0, end = buf.length): Uint8Array {\n    const len = end - start\n    const ret = new Uint8Array(len)\n\n    for (let i = 0; i < len; i++) {\n        ret[i] = buf[end - i - 1]\n    }\n\n    return ret\n}\n"]}

package/cjs/utils/buffer-utils.test.d.ts

@@ -0,0 +1 @@
+export {};

package/cjs/utils/buffer-utils.test.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const buffer_utils_js_1 = require("./buffer-utils.js");
+(0, vitest_1.describe)('buffersEqual', () => {
+    (0, vitest_1.it)('should return true for equal buffers', () => {
+        (0, vitest_1.expect)((0, buffer_utils_js_1.buffersEqual)(new Uint8Array([]), new Uint8Array([]))).is.true;
+        (0, vitest_1.expect)((0, buffer_utils_js_1.buffersEqual)(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2, 3]))).is.true;
+    });
+    (0, vitest_1.it)('should return false for non-equal buffers', () => {
+        (0, vitest_1.expect)((0, buffer_utils_js_1.buffersEqual)(new Uint8Array([1]), new Uint8Array([]))).is.false;
+        (0, vitest_1.expect)((0, buffer_utils_js_1.buffersEqual)(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2, 4]))).is.false;
+    });
+});
+(0, vitest_1.describe)('cloneBuffer', () => {
+    (0, vitest_1.it)('should clone buffer', () => {
+        const orig = new Uint8Array([1, 2, 3]);
+        const copy = (0, buffer_utils_js_1.cloneBuffer)(orig);
+        (0, vitest_1.expect)([...copy]).eql([1, 2, 3]);
+        orig[0] = 0xff;
+        (0, vitest_1.expect)(copy[0]).not.eql(0xff);
+    });
+    (0, vitest_1.it)('should clone buffer partially', () => {
+        const orig = new Uint8Array([1, 2, 3, 4, 5]);
+        const copy = (0, buffer_utils_js_1.cloneBuffer)(orig, 1, 4);
+        (0, vitest_1.expect)([...copy]).eql([2, 3, 4]);
+        orig[0] = 0xff;
+        (0, vitest_1.expect)(copy[0]).not.eql(0xff);
+    });
+});
+(0, vitest_1.describe)('concatBuffers', () => {
+    (0, vitest_1.it)('should concat buffers', () => {
+        const buf = (0, buffer_utils_js_1.concatBuffers)([new Uint8Array([1, 2, 3]), new Uint8Array([4, 5, 6])]);
+        (0, vitest_1.expect)([...buf]).eql([1, 2, 3, 4, 5, 6]);
+    });
+    (0, vitest_1.it)('should create a new buffer', () => {
+        const buf1 = new Uint8Array([1, 2, 3]);
+        const buf2 = new Uint8Array([4, 5, 6]);
+        const buf = (0, buffer_utils_js_1.concatBuffers)([buf1, buf2]);
+        buf[0] = 0xff;
+        (0, vitest_1.expect)(buf1[0]).not.eql(0xff);
+    });
+    (0, vitest_1.it)('should work without native Buffer', () => {
+        vitest_1.vi.stubGlobal('Buffer', undefined);
+        const buf1 = new Uint8Array([1, 2, 3]);
+        const buf2 = new Uint8Array([4, 5, 6]);
+        const buf = (0, buffer_utils_js_1.concatBuffers)([buf1, buf2]);
+        buf1[0] = 0xff;
+        (0, vitest_1.expect)([...buf]).eql([1, 2, 3, 4, 5, 6]);
+    });
+    (0, vitest_1.afterEach)(() => void vitest_1.vi.unstubAllGlobals());
+});
+(0, vitest_1.describe)('bufferToReversed', () => {
+    (0, vitest_1.it)('should reverse the buffer', () => {
+        const buf = (0, buffer_utils_js_1.bufferToReversed)(new Uint8Array([1, 2, 3, 4, 5, 6]));
+        (0, vitest_1.expect)([...buf]).eql([6, 5, 4, 3, 2, 1]);
+    });
+    (0, vitest_1.it)('should reverse a part of the buffer', () => {
+        const buf = (0, buffer_utils_js_1.bufferToReversed)(new Uint8Array([1, 2, 3, 4, 5, 6]), 1, 5);
+        (0, vitest_1.expect)([...buf]).eql([5, 4, 3, 2]);
+    });
+    (0, vitest_1.it)('should create a new buffer', () => {
+        const buf1 = new Uint8Array([1, 2, 3]);
+        const buf2 = (0, buffer_utils_js_1.bufferToReversed)(buf1);
+        buf2[0] = 0xff;
+        (0, vitest_1.expect)([...buf1]).eql([1, 2, 3]);
+    });
+});
+//# sourceMappingURL=buffer-utils.test.js.map

package/cjs/utils/buffer-utils.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffer-utils.test.js","sourceRoot":"","sources":["../../../src/utils/buffer-utils.test.ts"],"names":[],"mappings":";;AAAA,mCAA4D;AAE5D,uDAA8F;AAE9F,IAAA,iBAAQ,EAAC,cAAc,EAAE,GAAG,EAAE;IAC1B,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAA;QACpE,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAA;IACtF,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAA;QACtE,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAA;IACvF,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,IAAA,iBAAQ,EAAC,aAAa,EAAE,GAAG,EAAE;IACzB,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC3B,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,IAAA,6BAAW,EAAC,IAAI,CAAC,CAAA;QAE9B,IAAA,eAAM,EAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACd,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC5C,MAAM,IAAI,GAAG,IAAA,6BAAW,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAEpC,IAAA,eAAM,EAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAChC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACd,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA;AAEF,IAAA,iBAAQ,EAAC,eAAe,EAAE,GAAG,EAAE;IAC3B,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC7B,MAAM,GAAG,GAAG,IAAA,+BAAa,EAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEjF,IAAA,eAAM,EAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC5C,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,GAAG,GAAG,IAAA,+BAAa,EAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;QAEvC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACb,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QACzC,WAAE,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;QAClC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,GAAG,GAAG,IAAA,+BAAa,EAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;QAEvC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QAEd,IAAA,eAAM,EAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC5C,CAAC,CAAC,CAAA;IAEF,IAAA,kBAAS,EAAC,GAAG,EAAE,CAAC,KAAK,WAAE,CAAC,gBAAgB,EAAE,CAAC,CAAA;AAC/C,CAAC,CAAC,CAAA;AAEF,IAAA,iBAAQ,EAAC,kBAAkB,EAAE,GAAG,EAAE;IAC9B,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACjC,MAAM,GAAG,GAAG,IAAA,kCAAgB,EAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAEhE,IAAA,eAAM,EAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC5C,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC3C,MAAM,GAAG,GAAG,IAAA,kCAAgB,EAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAEtE,IAAA,eAAM,EAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,IAAA,kCAAgB,EAAC,IAAI,CAAC,CAAA;QAEnC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACd,IAAA,eAAM,EAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACpC,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA","sourcesContent":["import { afterEach, describe, expect, it, vi } from 'vitest'\n\nimport { buffersEqual, bufferToReversed, cloneBuffer, concatBuffers } from './buffer-utils.js'\n\ndescribe('buffersEqual', () => {\n    it('should return true for equal buffers', () => {\n        expect(buffersEqual(new Uint8Array([]), new Uint8Array([]))).is.true\n        expect(buffersEqual(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2, 3]))).is.true\n    })\n\n    it('should return false for non-equal buffers', () => {\n        expect(buffersEqual(new Uint8Array([1]), new Uint8Array([]))).is.false\n        expect(buffersEqual(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2, 4]))).is.false\n    })\n})\n\ndescribe('cloneBuffer', () => {\n    it('should clone buffer', () => {\n        const orig = new Uint8Array([1, 2, 3])\n        const copy = cloneBuffer(orig)\n\n        expect([...copy]).eql([1, 2, 3])\n        orig[0] = 0xff\n        expect(copy[0]).not.eql(0xff)\n    })\n\n    it('should clone buffer partially', () => {\n        const orig = new Uint8Array([1, 2, 3, 4, 5])\n        const copy = cloneBuffer(orig, 1, 4)\n\n        expect([...copy]).eql([2, 3, 4])\n        orig[0] = 0xff\n        expect(copy[0]).not.eql(0xff)\n    })\n})\n\ndescribe('concatBuffers', () => {\n    it('should concat buffers', () => {\n        const buf = concatBuffers([new Uint8Array([1, 2, 3]), new Uint8Array([4, 5, 6])])\n\n        expect([...buf]).eql([1, 2, 3, 4, 5, 6])\n    })\n\n    it('should create a new buffer', () => {\n        const buf1 = new Uint8Array([1, 2, 3])\n        const buf2 = new Uint8Array([4, 5, 6])\n        const buf = concatBuffers([buf1, buf2])\n\n        buf[0] = 0xff\n        expect(buf1[0]).not.eql(0xff)\n    })\n\n    it('should work without native Buffer', () => {\n        vi.stubGlobal('Buffer', undefined)\n        const buf1 = new Uint8Array([1, 2, 3])\n        const buf2 = new Uint8Array([4, 5, 6])\n        const buf = concatBuffers([buf1, buf2])\n\n        buf1[0] = 0xff\n\n        expect([...buf]).eql([1, 2, 3, 4, 5, 6])\n    })\n\n    afterEach(() => void vi.unstubAllGlobals())\n})\n\ndescribe('bufferToReversed', () => {\n    it('should reverse the buffer', () => {\n        const buf = bufferToReversed(new Uint8Array([1, 2, 3, 4, 5, 6]))\n\n        expect([...buf]).eql([6, 5, 4, 3, 2, 1])\n    })\n\n    it('should reverse a part of the buffer', () => {\n        const buf = bufferToReversed(new Uint8Array([1, 2, 3, 4, 5, 6]), 1, 5)\n\n        expect([...buf]).eql([5, 4, 3, 2])\n    })\n\n    it('should create a new buffer', () => {\n        const buf1 = new Uint8Array([1, 2, 3])\n        const buf2 = bufferToReversed(buf1)\n\n        buf2[0] = 0xff\n        expect([...buf1]).eql([1, 2, 3])\n    })\n})\n"]}

package/cjs/utils/condition-variable.test.d.ts

@@ -0,0 +1 @@
+export {};

package/cjs/utils/condition-variable.test.js

@@ -0,0 +1,27 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const condition_variable_js_1 = require("./condition-variable.js");
+(0, vitest_1.describe)('ConditionVariable', () => {
+    (0, vitest_1.it)('should correctly unlock execution', async () => {
+        const cv = new condition_variable_js_1.ConditionVariable();
+        setTimeout(() => cv.notify(), 10);
+        await cv.wait();
+        (0, vitest_1.expect)(true).toBeTruthy();
+    });
+    (0, vitest_1.it)('should correctly time out', async () => {
+        const cv = new condition_variable_js_1.ConditionVariable();
+        await cv.wait(10);
+        (0, vitest_1.expect)(true).toBeTruthy();
+    });
+    (0, vitest_1.it)('should only unlock once', async () => {
+        const cv = new condition_variable_js_1.ConditionVariable();
+        setTimeout(() => {
+            cv.notify();
+            cv.notify();
+        }, 10);
+        await cv.wait();
+        (0, vitest_1.expect)(true).toBeTruthy();
+    });
+});
+//# sourceMappingURL=condition-variable.test.js.map

package/cjs/utils/condition-variable.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"condition-variable.test.js","sourceRoot":"","sources":["../../../src/utils/condition-variable.test.ts"],"names":[],"mappings":";;AAAA,mCAA6C;AAE7C,mEAA2D;AAE3D,IAAA,iBAAQ,EAAC,mBAAmB,EAAE,GAAG,EAAE;IAC/B,IAAA,WAAE,EAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,EAAE,GAAG,IAAI,yCAAiB,EAAE,CAAA;QAElC,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;QAEjC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAA;QAEf,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,UAAU,EAAE,CAAA;IAC7B,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,2BAA2B,EAAE,KAAK,IAAI,EAAE;QACvC,MAAM,EAAE,GAAG,IAAI,yCAAiB,EAAE,CAAA;QAElC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAEjB,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,UAAU,EAAE,CAAA;IAC7B,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,yBAAyB,EAAE,KAAK,IAAI,EAAE;QACrC,MAAM,EAAE,GAAG,IAAI,yCAAiB,EAAE,CAAA;QAElC,UAAU,CAAC,GAAG,EAAE;YACZ,EAAE,CAAC,MAAM,EAAE,CAAA;YACX,EAAE,CAAC,MAAM,EAAE,CAAA;QACf,CAAC,EAAE,EAAE,CAAC,CAAA;QAEN,MAAM,EAAE,CAAC,IAAI,EAAE,CAAA;QAEf,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,UAAU,EAAE,CAAA;IAC7B,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA","sourcesContent":["import { describe, expect, it } from 'vitest'\n\nimport { ConditionVariable } from './condition-variable.js'\n\ndescribe('ConditionVariable', () => {\n    it('should correctly unlock execution', async () => {\n        const cv = new ConditionVariable()\n\n        setTimeout(() => cv.notify(), 10)\n\n        await cv.wait()\n\n        expect(true).toBeTruthy()\n    })\n\n    it('should correctly time out', async () => {\n        const cv = new ConditionVariable()\n\n        await cv.wait(10)\n\n        expect(true).toBeTruthy()\n    })\n\n    it('should only unlock once', async () => {\n        const cv = new ConditionVariable()\n\n        setTimeout(() => {\n            cv.notify()\n            cv.notify()\n        }, 10)\n\n        await cv.wait()\n\n        expect(true).toBeTruthy()\n    })\n})\n"]}

package/cjs/utils/controllable-promise.test.d.ts

@@ -0,0 +1 @@
+export {};

package/cjs/utils/controllable-promise.test.js

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const controllable_promise_js_1 = require("./controllable-promise.js");
+(0, vitest_1.describe)('createControllablePromise', () => {
+    (0, vitest_1.it)('should resolve', async () => {
+        const p = (0, controllable_promise_js_1.createControllablePromise)();
+        p.resolve(1);
+        await (0, vitest_1.expect)(p).resolves.toBe(1);
+    });
+    (0, vitest_1.it)('should reject', async () => {
+        const p = (0, controllable_promise_js_1.createControllablePromise)();
+        p.reject(1);
+        await (0, vitest_1.expect)(p).rejects.toBe(1);
+    });
+});
+//# sourceMappingURL=controllable-promise.test.js.map

package/cjs/utils/controllable-promise.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"controllable-promise.test.js","sourceRoot":"","sources":["../../../src/utils/controllable-promise.test.ts"],"names":[],"mappings":";;AAAA,mCAA6C;AAE7C,uEAAqE;AAErE,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,gBAAgB,EAAE,KAAK,IAAI,EAAE;QAC5B,MAAM,CAAC,GAAG,IAAA,mDAAyB,GAAE,CAAA;QACrC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;QACZ,MAAM,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACpC,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,eAAe,EAAE,KAAK,IAAI,EAAE;QAC3B,MAAM,CAAC,GAAG,IAAA,mDAAyB,GAAE,CAAA;QACrC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACX,MAAM,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACnC,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA","sourcesContent":["import { describe, expect, it } from 'vitest'\n\nimport { createControllablePromise } from './controllable-promise.js'\n\ndescribe('createControllablePromise', () => {\n    it('should resolve', async () => {\n        const p = createControllablePromise()\n        p.resolve(1)\n        await expect(p).resolves.toBe(1)\n    })\n\n    it('should reject', async () => {\n        const p = createControllablePromise()\n        p.reject(1)\n        await expect(p).rejects.toBe(1)\n    })\n})\n"]}

package/cjs/utils/crypto/abstract.d.ts

@@ -1,23 +1,30 @@
 import { MaybeAsync } from '../../types/index.js';
 export interface IEncryptionScheme {
-    encrypt(data: Uint8Array): MaybeAsync<Uint8Array>;
-    decrypt(data: Uint8Array): MaybeAsync<Uint8Array>;
+    encrypt(data: Uint8Array): Uint8Array;
+    decrypt(data: Uint8Array): Uint8Array;
+}
+export interface IAesCtr {
+    process(data: Uint8Array): Uint8Array;
+    close?(): void;
 }
 export interface ICryptoProvider {
     initialize?(): MaybeAsync<void>;
-    sha1(data: Uint8Array): MaybeAsync<Uint8Array>;
-    sha256(data: Uint8Array): MaybeAsync<Uint8Array>;
+    sha1(data: Uint8Array): Uint8Array;
+    sha256(data: Uint8Array): Uint8Array;
     pbkdf2(password: Uint8Array, salt: Uint8Array, iterations: number, keylen?: number, // = 64
     algo?: string): MaybeAsync<Uint8Array>;
     hmacSha256(data: Uint8Array, key: Uint8Array): MaybeAsync<Uint8Array>;
-    createAesCtr(key: Uint8Array, iv: Uint8Array, encrypt: boolean): MaybeAsync<IEncryptionScheme>;
-    createAesIge(key: Uint8Array, iv: Uint8Array): MaybeAsync<IEncryptionScheme>;
-    createAesEcb(key: Uint8Array): MaybeAsync<IEncryptionScheme>;
+    createAesCtr(key: Uint8Array, iv: Uint8Array, encrypt: boolean): IAesCtr;
+    createAesIge(key: Uint8Array, iv: Uint8Array): IEncryptionScheme;
     factorizePQ(pq: Uint8Array): MaybeAsync<[Uint8Array, Uint8Array]>;
+    gzip(data: Uint8Array, maxSize: number): Uint8Array | null;
+    gunzip(data: Uint8Array): Uint8Array;
+    randomFill(buf: Uint8Array): void;
+    randomBytes(size: number): Uint8Array;
 }
 export declare abstract class BaseCryptoProvider {
-    createAesIge(key: Uint8Array, iv: Uint8Array): MaybeAsync<IEncryptionScheme>;
+    abstract randomFill(buf: Uint8Array): void;
     factorizePQ(pq: Uint8Array): [Uint8Array, Uint8Array];
-    abstract createAesEcb(key: Uint8Array): MaybeAsync<IEncryptionScheme>;
+    randomBytes(size: number): Uint8Array;
 }
 export type CryptoProviderFactory = () => ICryptoProvider;

package/cjs/utils/crypto/abstract.js

@@ -1,18 +1,15 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BaseCryptoProvider = void 0;
-const common_js_1 = require("./common.js");
 const factorization_js_1 = require("./factorization.js");
 class BaseCryptoProvider {
-    createAesIge(key, iv) {
-        const ecb = this.createAesEcb(key);
-        if ('then' in ecb) {
-            return ecb.then((ecb) => new common_js_1.AesModeOfOperationIge(key, iv, ecb));
-        }
-        return new common_js_1.AesModeOfOperationIge(key, iv, ecb);
-    }
     factorizePQ(pq) {
-        return (0, factorization_js_1.factorizePQSync)(pq);
+        return (0, factorization_js_1.factorizePQSync)(this, pq);
+    }
+    randomBytes(size) {
+        const buf = new Uint8Array(size);
+        this.randomFill(buf);
+        return buf;
     }
 }
 exports.BaseCryptoProvider = BaseCryptoProvider;

package/cjs/utils/crypto/abstract.js.map

@@ -1 +1 @@
-{"version":3,"file":"abstract.js","sourceRoot":"","sources":["../../../../src/utils/crypto/abstract.ts"],"names":[],"mappings":";;;AACA,2CAAmD;AACnD,yDAAoD;AAmCpD,MAAsB,kBAAkB;IACpC,YAAY,CAAC,GAAe,EAAE,EAAc;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAA;QAElC,IAAI,MAAM,IAAI,GAAG,EAAE;YACf,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,iCAAqB,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA;SACpE;QAED,OAAO,IAAI,iCAAqB,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAA;IAClD,CAAC;IAED,WAAW,CAAC,EAAc;QACtB,OAAO,IAAA,kCAAe,EAAC,EAAE,CAAC,CAAA;IAC9B,CAAC;CAGJ;AAhBD,gDAgBC","sourcesContent":["import { MaybeAsync } from '../../types/index.js'\nimport { AesModeOfOperationIge } from './common.js'\nimport { factorizePQSync } from './factorization.js'\n\nexport interface IEncryptionScheme {\n    encrypt(data: Uint8Array): MaybeAsync<Uint8Array>\n\n    decrypt(data: Uint8Array): MaybeAsync<Uint8Array>\n}\n\nexport interface ICryptoProvider {\n    initialize?(): MaybeAsync<void>\n\n    sha1(data: Uint8Array): MaybeAsync<Uint8Array>\n\n    sha256(data: Uint8Array): MaybeAsync<Uint8Array>\n\n    pbkdf2(\n        password: Uint8Array,\n        salt: Uint8Array,\n        iterations: number,\n        keylen?: number, // = 64\n        algo?: string, // sha1 or sha512 (default sha512)\n    ): MaybeAsync<Uint8Array>\n\n    hmacSha256(data: Uint8Array, key: Uint8Array): MaybeAsync<Uint8Array>\n\n    // in telegram, iv is always either used only once, or is the same for all calls for the key\n    createAesCtr(key: Uint8Array, iv: Uint8Array, encrypt: boolean): MaybeAsync<IEncryptionScheme>\n\n    createAesIge(key: Uint8Array, iv: Uint8Array): MaybeAsync<IEncryptionScheme>\n\n    createAesEcb(key: Uint8Array): MaybeAsync<IEncryptionScheme>\n\n    factorizePQ(pq: Uint8Array): MaybeAsync<[Uint8Array, Uint8Array]>\n}\n\nexport abstract class BaseCryptoProvider {\n    createAesIge(key: Uint8Array, iv: Uint8Array): MaybeAsync<IEncryptionScheme> {\n        const ecb = this.createAesEcb(key)\n\n        if ('then' in ecb) {\n            return ecb.then((ecb) => new AesModeOfOperationIge(key, iv, ecb))\n        }\n\n        return new AesModeOfOperationIge(key, iv, ecb)\n    }\n\n    factorizePQ(pq: Uint8Array) {\n        return factorizePQSync(pq)\n    }\n\n    abstract createAesEcb(key: Uint8Array): MaybeAsync<IEncryptionScheme>\n}\n\nexport type CryptoProviderFactory = () => ICryptoProvider\n"]}
+{"version":3,"file":"abstract.js","sourceRoot":"","sources":["../../../../src/utils/crypto/abstract.ts"],"names":[],"mappings":";;;AACA,yDAAoD;AA0CpD,MAAsB,kBAAkB;IAGpC,WAAW,CAAC,EAAc;QACtB,OAAO,IAAA,kCAAe,EAAC,IAAkC,EAAE,EAAE,CAAC,CAAA;IAClE,CAAC;IAED,WAAW,CAAC,IAAY;QACpB,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;QAEpB,OAAO,GAAG,CAAA;IACd,CAAC;CACJ;AAbD,gDAaC","sourcesContent":["import { MaybeAsync } from '../../types/index.js'\nimport { factorizePQSync } from './factorization.js'\n\nexport interface IEncryptionScheme {\n    encrypt(data: Uint8Array): Uint8Array\n    decrypt(data: Uint8Array): Uint8Array\n}\n\nexport interface IAesCtr {\n    process(data: Uint8Array): Uint8Array\n    close?(): void\n}\n\nexport interface ICryptoProvider {\n    initialize?(): MaybeAsync<void>\n\n    sha1(data: Uint8Array): Uint8Array\n\n    sha256(data: Uint8Array): Uint8Array\n\n    pbkdf2(\n        password: Uint8Array,\n        salt: Uint8Array,\n        iterations: number,\n        keylen?: number, // = 64\n        algo?: string, // sha1 or sha512 (default sha512)\n    ): MaybeAsync<Uint8Array>\n\n    hmacSha256(data: Uint8Array, key: Uint8Array): MaybeAsync<Uint8Array>\n\n    createAesCtr(key: Uint8Array, iv: Uint8Array, encrypt: boolean): IAesCtr\n\n    createAesIge(key: Uint8Array, iv: Uint8Array): IEncryptionScheme\n\n    factorizePQ(pq: Uint8Array): MaybeAsync<[Uint8Array, Uint8Array]>\n\n    gzip(data: Uint8Array, maxSize: number): Uint8Array | null\n    gunzip(data: Uint8Array): Uint8Array\n\n    randomFill(buf: Uint8Array): void\n    randomBytes(size: number): Uint8Array\n}\n\nexport abstract class BaseCryptoProvider {\n    abstract randomFill(buf: Uint8Array): void\n\n    factorizePQ(pq: Uint8Array) {\n        return factorizePQSync(this as unknown as ICryptoProvider, pq)\n    }\n\n    randomBytes(size: number) {\n        const buf = new Uint8Array(size)\n        this.randomFill(buf)\n\n        return buf\n    }\n}\n\nexport type CryptoProviderFactory = () => ICryptoProvider\n"]}

package/cjs/utils/crypto/factorization.d.ts

@@ -1,5 +1,6 @@
+import { ICryptoProvider } from './abstract.js';
 /**
  * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm
  * @param pq
  */
-export declare function factorizePQSync(pq: Uint8Array): [Uint8Array, Uint8Array];
+export declare function factorizePQSync(crypto: ICryptoProvider, pq: Uint8Array): [Uint8Array, Uint8Array];

package/cjs/utils/crypto/factorization.js

@@ -1,22 +1,18 @@
 "use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.factorizePQSync = void 0;
-const big_integer_1 = __importDefault(require("big-integer"));
 const bigint_utils_js_1 = require("../bigint-utils.js");
 /**
  * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm
  * @param pq
  */
-function factorizePQSync(pq) {
+function factorizePQSync(crypto, pq) {
     const pq_ = (0, bigint_utils_js_1.bufferToBigInt)(pq);
-    const n = PollardRhoBrent(pq_);
-    const m = pq_.divide(n);
+    const n = PollardRhoBrent(crypto, pq_);
+    const m = pq_ / n;
     let p;
     let q;
-    if (n.lt(m)) {
+    if (n < m) {
         p = n;
         q = m;
     }
@@ -27,42 +23,38 @@ function factorizePQSync(pq) {
     return [(0, bigint_utils_js_1.bigIntToBuffer)(p), (0, bigint_utils_js_1.bigIntToBuffer)(q)];
 }
 exports.factorizePQSync = factorizePQSync;
-function PollardRhoBrent(n) {
-    if (n.isEven())
-        return big_integer_1.default[2];
-    let y = (0, bigint_utils_js_1.randomBigIntInRange)(n.minus(1));
-    const c = (0, bigint_utils_js_1.randomBigIntInRange)(n.minus(1));
-    const m = (0, bigint_utils_js_1.randomBigIntInRange)(n.minus(1));
-    let g = big_integer_1.default.one;
-    let r = big_integer_1.default.one;
-    let q = big_integer_1.default.one;
+function PollardRhoBrent(crypto, n) {
+    if (n % 2n === 0n)
+        return 2n;
+    let y = (0, bigint_utils_js_1.randomBigIntInRange)(crypto, n - 1n);
+    const c = (0, bigint_utils_js_1.randomBigIntInRange)(crypto, n - 1n);
+    const m = (0, bigint_utils_js_1.randomBigIntInRange)(crypto, n - 1n);
+    let g = 1n;
+    let r = 1n;
+    let q = 1n;
     let ys;
     let x;
-    while (g.eq(big_integer_1.default.one)) {
+    while (g === 1n) {
         x = y;
-        for (let i = 0; r.geq(i); i++)
-            y = y.multiply(y).mod(n).plus(c).mod(n);
-        // y = ((y * y) % n + c) % n
-        let k = big_integer_1.default.zero;
-        while (k.lt(r) && g.eq(1)) {
+        for (let i = 0; r >= i; i++)
+            y = (((y * y) % n) + c) % n;
+        let k = 0n;
+        while (k < r && g === 1n) {
             ys = y;
-            for (let i = big_integer_1.default.zero; i.lt(big_integer_1.default.min(m, r.minus(k))); i = i.plus(big_integer_1.default.one)) {
-                y = y.multiply(y).mod(n).plus(c).mod(n);
-                q = q.multiply(x.minus(y).abs()).mod(n);
-                // y = (y * y % n + c) % n
-                // q = q * abs(x - y) % n
+            for (let i = 0n; i < (0, bigint_utils_js_1.bigIntMin)(m, r - k); i++) {
+                y = (((y * y) % n) + c) % n;
+                q = (q * (0, bigint_utils_js_1.bigIntAbs)(x - y)) % n;
             }
-            g = big_integer_1.default.gcd(q, n);
-            k = k.plus(m);
+            g = (0, bigint_utils_js_1.bigIntGcd)(q, n);
+            k = k + m;
         }
-        r = r.multiply(big_integer_1.default[2]);
+        r <<= 1n;
     }
-    if (g.eq(n)) {
+    if (g === n) {
         do {
-            ys = ys.multiply(ys).mod(n).plus(c).mod(n);
-            // ys = ((ys * ys) % n + c) % n
-            g = big_integer_1.default.gcd(x.minus(ys), n);
-        } while (g.leq(big_integer_1.default.one));
+            ys = (((ys * ys) % n) + c) % n;
+            g = (0, bigint_utils_js_1.bigIntGcd)(x - ys, n);
+        } while (g <= 1n);
     }
     return g;
 }

package/cjs/utils/crypto/factorization.js.map

@@ -1 +1 @@
-{"version":3,"file":"factorization.js","sourceRoot":"","sources":["../../../../src/utils/crypto/factorization.ts"],"names":[],"mappings":";;;;;;AAAA,8DAAgD;AAEhD,wDAAwF;AAExF;;;GAGG;AACH,SAAgB,eAAe,CAAC,EAAc;IAC1C,MAAM,GAAG,GAAG,IAAA,gCAAc,EAAC,EAAE,CAAC,CAAA;IAE9B,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAEvB,IAAI,CAAC,CAAA;IACL,IAAI,CAAC,CAAA;IAEL,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;QACT,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;KACR;SAAM;QACH,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;KACR;IAED,OAAO,CAAC,IAAA,gCAAc,EAAC,CAAC,CAAC,EAAE,IAAA,gCAAc,EAAC,CAAC,CAAC,CAAC,CAAA;AACjD,CAAC;AAlBD,0CAkBC;AAED,SAAS,eAAe,CAAC,CAAa;IAClC,IAAI,CAAC,CAAC,MAAM,EAAE;QAAE,OAAO,qBAAM,CAAC,CAAC,CAAC,CAAA;IAEhC,IAAI,CAAC,GAAG,IAAA,qCAAmB,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IACvC,MAAM,CAAC,GAAG,IAAA,qCAAmB,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IACzC,MAAM,CAAC,GAAG,IAAA,qCAAmB,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IACzC,IAAI,CAAC,GAAG,qBAAM,CAAC,GAAG,CAAA;IAClB,IAAI,CAAC,GAAG,qBAAM,CAAC,GAAG,CAAA;IAClB,IAAI,CAAC,GAAG,qBAAM,CAAC,GAAG,CAAA;IAElB,IAAI,EAAc,CAAA;IAClB,IAAI,CAAa,CAAA;IAEjB,OAAO,CAAC,CAAC,EAAE,CAAC,qBAAM,CAAC,GAAG,CAAC,EAAE;QACrB,CAAC,GAAG,CAAC,CAAA;QACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACtE,4BAA4B;QAE5B,IAAI,CAAC,GAAG,qBAAM,CAAC,IAAI,CAAA;QAEnB,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACvB,EAAE,GAAG,CAAC,CAAA;YAEN,KAAK,IAAI,CAAC,GAAG,qBAAM,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,qBAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,qBAAM,CAAC,GAAG,CAAC,EAAE;gBAC/E,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACvC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACvC,0BAA0B;gBAC1B,yBAAyB;aAC5B;YAED,CAAC,GAAG,qBAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACpB,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SAChB;QAED,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,qBAAM,CAAC,CAAC,CAAC,CAAC,CAAA;KAC5B;IAED,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;QACT,GAAG;YACC,EAAE,GAAG,EAAG,CAAC,QAAQ,CAAC,EAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YAC5C,+BAA+B;YAE/B,CAAC,GAAG,qBAAM,CAAC,GAAG,CAAC,CAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;SAClC,QAAQ,CAAC,CAAC,GAAG,CAAC,qBAAM,CAAC,GAAG,CAAC,EAAC;KAC9B;IAED,OAAO,CAAC,CAAA;AACZ,CAAC","sourcesContent":["import bigInt, { BigInteger } from 'big-integer'\n\nimport { bigIntToBuffer, bufferToBigInt, randomBigIntInRange } from '../bigint-utils.js'\n\n/**\n * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm\n * @param pq\n */\nexport function factorizePQSync(pq: Uint8Array): [Uint8Array, Uint8Array] {\n    const pq_ = bufferToBigInt(pq)\n\n    const n = PollardRhoBrent(pq_)\n    const m = pq_.divide(n)\n\n    let p\n    let q\n\n    if (n.lt(m)) {\n        p = n\n        q = m\n    } else {\n        p = m\n        q = n\n    }\n\n    return [bigIntToBuffer(p), bigIntToBuffer(q)]\n}\n\nfunction PollardRhoBrent(n: BigInteger): BigInteger {\n    if (n.isEven()) return bigInt[2]\n\n    let y = randomBigIntInRange(n.minus(1))\n    const c = randomBigIntInRange(n.minus(1))\n    const m = randomBigIntInRange(n.minus(1))\n    let g = bigInt.one\n    let r = bigInt.one\n    let q = bigInt.one\n\n    let ys: BigInteger\n    let x: BigInteger\n\n    while (g.eq(bigInt.one)) {\n        x = y\n        for (let i = 0; r.geq(i); i++) y = y.multiply(y).mod(n).plus(c).mod(n)\n        // y = ((y * y) % n + c) % n\n\n        let k = bigInt.zero\n\n        while (k.lt(r) && g.eq(1)) {\n            ys = y\n\n            for (let i = bigInt.zero; i.lt(bigInt.min(m, r.minus(k))); i = i.plus(bigInt.one)) {\n                y = y.multiply(y).mod(n).plus(c).mod(n)\n                q = q.multiply(x.minus(y).abs()).mod(n)\n                // y = (y * y % n + c) % n\n                // q = q * abs(x - y) % n\n            }\n\n            g = bigInt.gcd(q, n)\n            k = k.plus(m)\n        }\n\n        r = r.multiply(bigInt[2])\n    }\n\n    if (g.eq(n)) {\n        do {\n            ys = ys!.multiply(ys!).mod(n).plus(c).mod(n)\n            // ys = ((ys * ys) % n + c) % n\n\n            g = bigInt.gcd(x!.minus(ys), n)\n        } while (g.leq(bigInt.one))\n    }\n\n    return g\n}\n"]}
+{"version":3,"file":"factorization.js","sourceRoot":"","sources":["../../../../src/utils/crypto/factorization.ts"],"names":[],"mappings":";;;AAAA,wDAO2B;AAG3B;;;GAGG;AACH,SAAgB,eAAe,CAAC,MAAuB,EAAE,EAAc;IACnE,MAAM,GAAG,GAAG,IAAA,gCAAc,EAAC,EAAE,CAAC,CAAA;IAE9B,MAAM,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;IACtC,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;IAEjB,IAAI,CAAC,CAAA;IACL,IAAI,CAAC,CAAA;IAEL,IAAI,CAAC,GAAG,CAAC,EAAE;QACP,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;KACR;SAAM;QACH,CAAC,GAAG,CAAC,CAAA;QACL,CAAC,GAAG,CAAC,CAAA;KACR;IAED,OAAO,CAAC,IAAA,gCAAc,EAAC,CAAC,CAAC,EAAE,IAAA,gCAAc,EAAC,CAAC,CAAC,CAAC,CAAA;AACjD,CAAC;AAlBD,0CAkBC;AAED,SAAS,eAAe,CAAC,MAAuB,EAAE,CAAS;IACvD,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,CAAA;IAE5B,IAAI,CAAC,GAAG,IAAA,qCAAmB,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;IAC3C,MAAM,CAAC,GAAG,IAAA,qCAAmB,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;IAC7C,MAAM,CAAC,GAAG,IAAA,qCAAmB,EAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;IAC7C,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IACV,IAAI,CAAC,GAAG,EAAE,CAAA;IAEV,IAAI,EAAU,CAAA;IACd,IAAI,CAAS,CAAA;IAEb,OAAO,CAAC,KAAK,EAAE,EAAE;QACb,CAAC,GAAG,CAAC,CAAA;QACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAExD,IAAI,CAAC,GAAG,EAAE,CAAA;QAEV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE;YACtB,EAAE,GAAG,CAAC,CAAA;YAEN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC3C,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC3B,CAAC,GAAG,CAAC,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;aACjC;YAED,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACnB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;SACZ;QAED,CAAC,KAAK,EAAE,CAAA;KACX;IAED,IAAI,CAAC,KAAK,CAAC,EAAE;QACT,GAAG;YACC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAG,GAAG,EAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YAEhC,CAAC,GAAG,IAAA,2BAAS,EAAC,CAAE,GAAG,EAAG,EAAE,CAAC,CAAC,CAAA;SAC7B,QAAQ,CAAC,IAAI,EAAE,EAAC;KACpB;IAED,OAAO,CAAC,CAAA;AACZ,CAAC","sourcesContent":["import {\n    bigIntAbs,\n    bigIntGcd,\n    bigIntMin,\n    bigIntToBuffer,\n    bufferToBigInt,\n    randomBigIntInRange,\n} from '../bigint-utils.js'\nimport { ICryptoProvider } from './abstract.js'\n\n/**\n * Factorize `p*q` to `p` and `q` synchronously using Brent-Pollard rho algorithm\n * @param pq\n */\nexport function factorizePQSync(crypto: ICryptoProvider, pq: Uint8Array): [Uint8Array, Uint8Array] {\n    const pq_ = bufferToBigInt(pq)\n\n    const n = PollardRhoBrent(crypto, pq_)\n    const m = pq_ / n\n\n    let p\n    let q\n\n    if (n < m) {\n        p = n\n        q = m\n    } else {\n        p = m\n        q = n\n    }\n\n    return [bigIntToBuffer(p), bigIntToBuffer(q)]\n}\n\nfunction PollardRhoBrent(crypto: ICryptoProvider, n: bigint): bigint {\n    if (n % 2n === 0n) return 2n\n\n    let y = randomBigIntInRange(crypto, n - 1n)\n    const c = randomBigIntInRange(crypto, n - 1n)\n    const m = randomBigIntInRange(crypto, n - 1n)\n    let g = 1n\n    let r = 1n\n    let q = 1n\n\n    let ys: bigint\n    let x: bigint\n\n    while (g === 1n) {\n        x = y\n        for (let i = 0; r >= i; i++) y = (((y * y) % n) + c) % n\n\n        let k = 0n\n\n        while (k < r && g === 1n) {\n            ys = y\n\n            for (let i = 0n; i < bigIntMin(m, r - k); i++) {\n                y = (((y * y) % n) + c) % n\n                q = (q * bigIntAbs(x - y)) % n\n            }\n\n            g = bigIntGcd(q, n)\n            k = k + m\n        }\n\n        r <<= 1n\n    }\n\n    if (g === n) {\n        do {\n            ys = (((ys! * ys!) % n) + c) % n\n\n            g = bigIntGcd(x! - ys!, n)\n        } while (g <= 1n)\n    }\n\n    return g\n}\n"]}

package/cjs/utils/crypto/index.d.ts

@@ -1,5 +1,9 @@
 export * from './abstract.js';
+export * from './factorization.js';
 export * from './keys.js';
+export * from './miller-rabin.js';
+export * from './mtproto.js';
 export * from './password.js';
+export * from './utils.js';
 import { CryptoProviderFactory } from './abstract.js';
 export declare const defaultCryptoProviderFactory: CryptoProviderFactory;

package/cjs/utils/crypto/index.js

@@ -16,8 +16,12 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.defaultCryptoProviderFactory = void 0;
 __exportStar(require("./abstract.js"), exports);
+__exportStar(require("./factorization.js"), exports);
 __exportStar(require("./keys.js"), exports);
+__exportStar(require("./miller-rabin.js"), exports);
+__exportStar(require("./mtproto.js"), exports);
 __exportStar(require("./password.js"), exports);
+__exportStar(require("./utils.js"), exports);
 const crypto_js_1 = require("../platform/crypto.js");
 exports.defaultCryptoProviderFactory = crypto_js_1._defaultCryptoProviderFactory;
 //# sourceMappingURL=index.js.map

package/cjs/utils/crypto/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/utils/crypto/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,gDAA6B;AAC7B,4CAAyB;AACzB,gDAA6B;AAE7B,qDAAqE;AAGxD,QAAA,4BAA4B,GAA0B,yCAA6B,CAAA","sourcesContent":["export * from './abstract.js'\nexport * from './keys.js'\nexport * from './password.js'\n\nimport { _defaultCryptoProviderFactory } from '../platform/crypto.js'\nimport { CryptoProviderFactory } from './abstract.js'\n\nexport const defaultCryptoProviderFactory: CryptoProviderFactory = _defaultCryptoProviderFactory\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/utils/crypto/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,gDAA6B;AAC7B,qDAAkC;AAClC,4CAAyB;AACzB,oDAAiC;AACjC,+CAA4B;AAC5B,gDAA6B;AAC7B,6CAA0B;AAE1B,qDAAqE;AAGxD,QAAA,4BAA4B,GAA0B,yCAA6B,CAAA","sourcesContent":["export * from './abstract.js'\nexport * from './factorization.js'\nexport * from './keys.js'\nexport * from './miller-rabin.js'\nexport * from './mtproto.js'\nexport * from './password.js'\nexport * from './utils.js'\n\nimport { _defaultCryptoProviderFactory } from '../platform/crypto.js'\nimport { CryptoProviderFactory } from './abstract.js'\n\nexport const defaultCryptoProviderFactory: CryptoProviderFactory = _defaultCryptoProviderFactory\n"]}

package/cjs/utils/crypto/keys.d.ts

@@ -9,7 +9,7 @@ import { ICryptoProvider } from './abstract.js';
  * @param key  PEM-encoded RSA public key
  * @param old  Whether this is an "old" key
  */
-export declare function parsePublicKey(crypto: ICryptoProvider, key: string, old?: boolean): Promise<TlPublicKey>;
+export declare function parsePublicKey(crypto: ICryptoProvider, key: string, old?: boolean): TlPublicKey;
 /**
  * Add public key to the global index.
  *
@@ -17,7 +17,7 @@ export declare function parsePublicKey(crypto: ICryptoProvider, key: string, old
  * @param key  PEM-encoded RSA public key
  * @param old  Whether this is an "old" key
  */
-export declare function addPublicKey(crypto: ICryptoProvider, key: string, old?: boolean): Promise<void>;
+export declare function addPublicKey(crypto: ICryptoProvider, key: string, old?: boolean): void;
 /**
  * Get public key by its fingerprint.
  *

package/cjs/utils/crypto/keys.js

@@ -12,7 +12,7 @@ const asn1_parser_js_1 = require("../binary/asn1-parser.js");
  * @param key  PEM-encoded RSA public key
  * @param old  Whether this is an "old" key
  */
-async function parsePublicKey(crypto, key, old = false) {
+function parsePublicKey(crypto, key, old = false) {
     const asn1 = (0, asn1_parser_js_1.parseAsn1)((0, asn1_parser_js_1.parsePemContents)(key));
     const modulus = asn1.children?.[0].value;
     const exponent = asn1.children?.[1].value;
@@ -23,7 +23,7 @@ async function parsePublicKey(crypto, key, old = false) {
     writer.bytes(modulus);
     writer.bytes(exponent);
     const data = writer.result();
-    const sha = await crypto.sha1(data);
+    const sha = crypto.sha1(data);
     const fp = (0, tl_runtime_1.hexEncode)(sha.slice(-8).reverse());
     return {
         modulus: (0, tl_runtime_1.hexEncode)(modulus),
@@ -40,8 +40,8 @@ exports.parsePublicKey = parsePublicKey;
  * @param key  PEM-encoded RSA public key
  * @param old  Whether this is an "old" key
  */
-async function addPublicKey(crypto, key, old = false) {
-    const parsed = await parsePublicKey(crypto, key, old);
+function addPublicKey(crypto, key, old = false) {
+    const parsed = parsePublicKey(crypto, key, old);
     rsa_keys_js_1.__publicKeyIndex[parsed.fingerprint] = parsed;
 }
 exports.addPublicKey = addPublicKey;

package/cjs/utils/crypto/keys.js.map

@@ -1 +1 @@
-{"version":3,"file":"keys.js","sourceRoot":"","sources":["../../../../src/utils/crypto/keys.ts"],"names":[],"mappings":";;;AAEA,+DAA0F;AAC1F,mDAA8D;AAE9D,6DAAsE;AAGtE;;;;;;;GAOG;AACI,KAAK,UAAU,cAAc,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,KAAK;IAClF,MAAM,IAAI,GAAG,IAAA,0BAAS,EAAC,IAAA,iCAAgB,EAAC,GAAG,CAAC,CAAC,CAAA;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IACzC,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAA;IAEhE,MAAM,MAAM,GAAG,2BAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACzC,yDAAyD;IACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IACrB,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IAEtB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnC,MAAM,EAAE,GAAG,IAAA,sBAAS,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;IAE7C,OAAO;QACH,OAAO,EAAE,IAAA,sBAAS,EAAC,OAAO,CAAC;QAC3B,QAAQ,EAAE,IAAA,sBAAS,EAAC,QAAQ,CAAC;QAC7B,WAAW,EAAE,EAAE;QACf,GAAG;KACN,CAAA;AACL,CAAC;AArBD,wCAqBC;AAED;;;;;;GAMG;AACI,KAAK,UAAU,YAAY,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,KAAK;IAChF,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IACrD,8BAAS,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,MAAM,CAAA;AAC1C,CAAC;AAHD,oCAGC;AAED;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,YAA+B,EAAE,QAAQ,GAAG,KAAK;IACnF,KAAK,IAAI,EAAE,IAAI,YAAY,EAAE;QACzB,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE;YACxB,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;SACpC;QACD,IAAI,EAAE,IAAI,8BAAS,EAAE;YACjB,IAAI,8BAAS,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ;gBAAE,SAAQ;YAE5C,OAAO,8BAAS,CAAC,EAAE,CAAC,CAAA;SACvB;KACJ;IACD,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAA;IAE/D,OAAO,IAAI,CAAA;AACf,CAAC;AAdD,sDAcC","sourcesContent":["import Long from 'long'\n\nimport { __publicKeyIndex as keysIndex, TlPublicKey } from '@mtcute/tl/binary/rsa-keys.js'\nimport { hexEncode, TlBinaryWriter } from '@mtcute/tl-runtime'\n\nimport { parseAsn1, parsePemContents } from '../binary/asn1-parser.js'\nimport { ICryptoProvider } from './abstract.js'\n\n/**\n * Parse PEM-encoded RSA public key information into modulus and exponent\n * and compute its fingerprint as defined by MTProto.\n *\n * @param crypto  Crypto provider\n * @param key  PEM-encoded RSA public key\n * @param old  Whether this is an \"old\" key\n */\nexport async function parsePublicKey(crypto: ICryptoProvider, key: string, old = false): Promise<TlPublicKey> {\n    const asn1 = parseAsn1(parsePemContents(key))\n    const modulus = asn1.children?.[0].value\n    const exponent = asn1.children?.[1].value\n    if (!modulus || !exponent) throw new Error('Invalid public key')\n\n    const writer = TlBinaryWriter.manual(512)\n    // they are actually smaller, about 270 bytes, but idc :D\n    writer.bytes(modulus)\n    writer.bytes(exponent)\n\n    const data = writer.result()\n    const sha = await crypto.sha1(data)\n    const fp = hexEncode(sha.slice(-8).reverse())\n\n    return {\n        modulus: hexEncode(modulus),\n        exponent: hexEncode(exponent),\n        fingerprint: fp,\n        old,\n    }\n}\n\n/**\n * Add public key to the global index.\n *\n * @param crypto  Crypto provider\n * @param key  PEM-encoded RSA public key\n * @param old  Whether this is an \"old\" key\n */\nexport async function addPublicKey(crypto: ICryptoProvider, key: string, old = false): Promise<void> {\n    const parsed = await parsePublicKey(crypto, key, old)\n    keysIndex[parsed.fingerprint] = parsed\n}\n\n/**\n * Get public key by its fingerprint.\n *\n * @param fingerprints  Fingerprints to match. The first one to match is returned.\n * @param allowOld  Whether to allow \"old\" keys\n */\nexport function findKeyByFingerprints(fingerprints: (string | Long)[], allowOld = false): TlPublicKey | null {\n    for (let fp of fingerprints) {\n        if (typeof fp !== 'string') {\n            fp = fp.toUnsigned().toString(16)\n        }\n        if (fp in keysIndex) {\n            if (keysIndex[fp].old && !allowOld) continue\n\n            return keysIndex[fp]\n        }\n    }\n    if (!allowOld) return findKeyByFingerprints(fingerprints, true)\n\n    return null\n}\n"]}
+{"version":3,"file":"keys.js","sourceRoot":"","sources":["../../../../src/utils/crypto/keys.ts"],"names":[],"mappings":";;;AAEA,+DAA0F;AAC1F,mDAA8D;AAE9D,6DAAsE;AAGtE;;;;;;;GAOG;AACH,SAAgB,cAAc,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,KAAK;IAC5E,MAAM,IAAI,GAAG,IAAA,0BAAS,EAAC,IAAA,iCAAgB,EAAC,GAAG,CAAC,CAAC,CAAA;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IACzC,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAA;IAEhE,MAAM,MAAM,GAAG,2BAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACzC,yDAAyD;IACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IACrB,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IAEtB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAA;IAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7B,MAAM,EAAE,GAAG,IAAA,sBAAS,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;IAE7C,OAAO;QACH,OAAO,EAAE,IAAA,sBAAS,EAAC,OAAO,CAAC;QAC3B,QAAQ,EAAE,IAAA,sBAAS,EAAC,QAAQ,CAAC;QAC7B,WAAW,EAAE,EAAE;QACf,GAAG;KACN,CAAA;AACL,CAAC;AArBD,wCAqBC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAAC,MAAuB,EAAE,GAAW,EAAE,GAAG,GAAG,KAAK;IAC1E,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;IAC/C,8BAAS,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,MAAM,CAAA;AAC1C,CAAC;AAHD,oCAGC;AAED;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,YAA+B,EAAE,QAAQ,GAAG,KAAK;IACnF,KAAK,IAAI,EAAE,IAAI,YAAY,EAAE;QACzB,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE;YACxB,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;SACpC;QACD,IAAI,EAAE,IAAI,8BAAS,EAAE;YACjB,IAAI,8BAAS,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ;gBAAE,SAAQ;YAE5C,OAAO,8BAAS,CAAC,EAAE,CAAC,CAAA;SACvB;KACJ;IACD,IAAI,CAAC,QAAQ;QAAE,OAAO,qBAAqB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAA;IAE/D,OAAO,IAAI,CAAA;AACf,CAAC;AAdD,sDAcC","sourcesContent":["import Long from 'long'\n\nimport { __publicKeyIndex as keysIndex, TlPublicKey } from '@mtcute/tl/binary/rsa-keys.js'\nimport { hexEncode, TlBinaryWriter } from '@mtcute/tl-runtime'\n\nimport { parseAsn1, parsePemContents } from '../binary/asn1-parser.js'\nimport { ICryptoProvider } from './abstract.js'\n\n/**\n * Parse PEM-encoded RSA public key information into modulus and exponent\n * and compute its fingerprint as defined by MTProto.\n *\n * @param crypto  Crypto provider\n * @param key  PEM-encoded RSA public key\n * @param old  Whether this is an \"old\" key\n */\nexport function parsePublicKey(crypto: ICryptoProvider, key: string, old = false): TlPublicKey {\n    const asn1 = parseAsn1(parsePemContents(key))\n    const modulus = asn1.children?.[0].value\n    const exponent = asn1.children?.[1].value\n    if (!modulus || !exponent) throw new Error('Invalid public key')\n\n    const writer = TlBinaryWriter.manual(512)\n    // they are actually smaller, about 270 bytes, but idc :D\n    writer.bytes(modulus)\n    writer.bytes(exponent)\n\n    const data = writer.result()\n    const sha = crypto.sha1(data)\n    const fp = hexEncode(sha.slice(-8).reverse())\n\n    return {\n        modulus: hexEncode(modulus),\n        exponent: hexEncode(exponent),\n        fingerprint: fp,\n        old,\n    }\n}\n\n/**\n * Add public key to the global index.\n *\n * @param crypto  Crypto provider\n * @param key  PEM-encoded RSA public key\n * @param old  Whether this is an \"old\" key\n */\nexport function addPublicKey(crypto: ICryptoProvider, key: string, old = false): void {\n    const parsed = parsePublicKey(crypto, key, old)\n    keysIndex[parsed.fingerprint] = parsed\n}\n\n/**\n * Get public key by its fingerprint.\n *\n * @param fingerprints  Fingerprints to match. The first one to match is returned.\n * @param allowOld  Whether to allow \"old\" keys\n */\nexport function findKeyByFingerprints(fingerprints: (string | Long)[], allowOld = false): TlPublicKey | null {\n    for (let fp of fingerprints) {\n        if (typeof fp !== 'string') {\n            fp = fp.toUnsigned().toString(16)\n        }\n        if (fp in keysIndex) {\n            if (keysIndex[fp].old && !allowOld) continue\n\n            return keysIndex[fp]\n        }\n    }\n    if (!allowOld) return findKeyByFingerprints(fingerprints, true)\n\n    return null\n}\n"]}

package/cjs/utils/crypto/keys.test.d.ts

@@ -0,0 +1 @@
+export {};

package/cjs/utils/crypto/keys.test.js

@@ -0,0 +1,40 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const index_js_1 = require("../index.js");
+const node_js_1 = require("./node.js");
+const crypto = new node_js_1.NodeCryptoProvider();
+(0, vitest_1.describe)('parsePublicKey', () => {
+    (0, vitest_1.it)('should parse telegram public keys', () => {
+        (0, vitest_1.expect)((0, index_js_1.parsePublicKey)(crypto, `-----BEGIN RSA PUBLIC KEY-----
+MIIBCgKCAQEAruw2yP/BCcsJliRoW5eBVBVle9dtjJw+OYED160Wybum9SXtBBLX
+riwt4rROd9csv0t0OHCaTmRqBcQ0J8fxhN6/cpR1GWgOZRUAiQxoMnlt0R93LCX/
+j1dnVa/gVbCjdSxpbrfY2g2L4frzjJvdl84Kd9ORYjDEAyFnEA7dD556OptgLQQ2
+e2iVNq8NZLYTzLp5YpOdO1doK+ttrltggTCy5SrKeLoCPPbOgGsdxJxyz5KKcZnS
+Lj16yE5HvJQn0CNpRdENvRUXe6tBP78O39oJ8BTHp9oIjd6XWXAsp2CvK45Ol8wF
+XGF710w9lwCGNbmNxNYhtIkdqfsEcwR5JwIDAQAB
+-----END RSA PUBLIC KEY-----`)).eql({
+            modulus: 'aeec36c8ffc109cb099624685b97815415657bd76d8c9c3e398103d7ad16c9bba6f525ed0412d7ae2c2de2b44e77d72cbf4b7438709a4e646a05c43427c7f184debf72947519680e651500890c6832796dd11f772c25ff8f576755afe055b0a3752c696eb7d8da0d8be1faf38c9bdd97ce0a77d3916230c4032167100edd0f9e7a3a9b602d04367b689536af0d64b613ccba7962939d3b57682beb6dae5b608130b2e52aca78ba023cf6ce806b1dc49c72cf928a7199d22e3d7ac84e47bc9427d0236945d10dbd15177bab413fbf0edfda09f014c7a7da088dde9759702ca760af2b8e4e97cc055c617bd74c3d97008635b98dc4d621b4891da9fb0473047927',
+            exponent: '010001',
+            fingerprint: '0bc35f3509f7b7a5',
+            old: false,
+        });
+    });
+    (0, vitest_1.it)('should be able to find a key by its fingerprint', () => {
+        (0, vitest_1.expect)((0, index_js_1.findKeyByFingerprints)(['b25898df208d2603'])).toMatchInlineSnapshot(`
+          {
+            "exponent": "010001",
+            "fingerprint": "b25898df208d2603",
+            "modulus": "c8c11d635691fac091dd9489aedced2932aa8a0bcefef05fa800892d9b52ed03200865c9e97211cb2ee6c7ae96d3fb0e15aeffd66019b44a08a240cfdd2868a85e1f54d6fa5deaa041f6941ddf302690d61dc476385c2fa655142353cb4e4b59f6e5b6584db76fe8b1370263246c010c93d011014113ebdf987d093f9d37c2be48352d69a1683f8f6e6c2167983c761e3ab169fde5daaa12123fa1beab621e4da5935e9c198f82f35eae583a99386d8110ea6bd1abb0f568759f62694419ea5f69847c43462abef858b4cb5edc84e7b9226cd7bd7e183aa974a712c079dde85b9dc063b8a5c08e8f859c0ee5dcd824c7807f20153361a7f63cfd2a433a1be7f5",
+            "old": false,
+          }
+        `);
+    });
+    (0, vitest_1.it)('should prefer new keys over old', () => {
+        (0, vitest_1.expect)((0, index_js_1.findKeyByFingerprints)(['71e025b6c76033e3', 'b25898df208d2603'])?.fingerprint).toEqual('b25898df208d2603');
+    });
+    (0, vitest_1.it)('should return null if not found', () => {
+        (0, vitest_1.expect)((0, index_js_1.findKeyByFingerprints)(['deadbeefdeadbeef'])).toBeNull();
+    });
+});
+//# sourceMappingURL=keys.test.js.map

package/cjs/utils/crypto/keys.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keys.test.js","sourceRoot":"","sources":["../../../../src/utils/crypto/keys.test.ts"],"names":[],"mappings":";;AAAA,mCAA6C;AAE7C,0CAAmE;AACnE,uCAA8C;AAE9C,MAAM,MAAM,GAAG,IAAI,4BAAkB,EAAE,CAAA;AAEvC,IAAA,iBAAQ,EAAC,gBAAgB,EAAE,GAAG,EAAE;IAC5B,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QACzC,IAAA,eAAM,EACF,IAAA,yBAAc,EACV,MAAM,EACN;;;;;;;6BAOa,CAChB,CACJ,CAAC,GAAG,CAAC;YACF,OAAO,EACH,kgBAAkgB;YACtgB,QAAQ,EAAE,QAAQ;YAClB,WAAW,EAAE,kBAAkB;YAC/B,GAAG,EAAE,KAAK;SACb,CAAC,CAAA;IACN,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACvD,IAAA,eAAM,EAAC,IAAA,gCAAqB,EAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC;;;;;;;SAOzE,CAAC,CAAA;IACN,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACvC,IAAA,eAAM,EAAC,IAAA,gCAAqB,EAAC,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAA;IACpH,CAAC,CAAC,CAAA;IAEF,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACvC,IAAA,eAAM,EAAC,IAAA,gCAAqB,EAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;IAClE,CAAC,CAAC,CAAA;AACN,CAAC,CAAC,CAAA","sourcesContent":["import { describe, expect, it } from 'vitest'\n\nimport { findKeyByFingerprints, parsePublicKey } from '../index.js'\nimport { NodeCryptoProvider } from './node.js'\n\nconst crypto = new NodeCryptoProvider()\n\ndescribe('parsePublicKey', () => {\n    it('should parse telegram public keys', () => {\n        expect(\n            parsePublicKey(\n                crypto,\n                `-----BEGIN RSA PUBLIC KEY-----\nMIIBCgKCAQEAruw2yP/BCcsJliRoW5eBVBVle9dtjJw+OYED160Wybum9SXtBBLX\nriwt4rROd9csv0t0OHCaTmRqBcQ0J8fxhN6/cpR1GWgOZRUAiQxoMnlt0R93LCX/\nj1dnVa/gVbCjdSxpbrfY2g2L4frzjJvdl84Kd9ORYjDEAyFnEA7dD556OptgLQQ2\ne2iVNq8NZLYTzLp5YpOdO1doK+ttrltggTCy5SrKeLoCPPbOgGsdxJxyz5KKcZnS\nLj16yE5HvJQn0CNpRdENvRUXe6tBP78O39oJ8BTHp9oIjd6XWXAsp2CvK45Ol8wF\nXGF710w9lwCGNbmNxNYhtIkdqfsEcwR5JwIDAQAB\n-----END RSA PUBLIC KEY-----`,\n            ),\n        ).eql({\n            modulus:\n                'aeec36c8ffc109cb099624685b97815415657bd76d8c9c3e398103d7ad16c9bba6f525ed0412d7ae2c2de2b44e77d72cbf4b7438709a4e646a05c43427c7f184debf72947519680e651500890c6832796dd11f772c25ff8f576755afe055b0a3752c696eb7d8da0d8be1faf38c9bdd97ce0a77d3916230c4032167100edd0f9e7a3a9b602d04367b689536af0d64b613ccba7962939d3b57682beb6dae5b608130b2e52aca78ba023cf6ce806b1dc49c72cf928a7199d22e3d7ac84e47bc9427d0236945d10dbd15177bab413fbf0edfda09f014c7a7da088dde9759702ca760af2b8e4e97cc055c617bd74c3d97008635b98dc4d621b4891da9fb0473047927',\n            exponent: '010001',\n            fingerprint: '0bc35f3509f7b7a5',\n            old: false,\n        })\n    })\n\n    it('should be able to find a key by its fingerprint', () => {\n        expect(findKeyByFingerprints(['b25898df208d2603'])).toMatchInlineSnapshot(`\n          {\n            \"exponent\": \"010001\",\n            \"fingerprint\": \"b25898df208d2603\",\n            \"modulus\": \"c8c11d635691fac091dd9489aedced2932aa8a0bcefef05fa800892d9b52ed03200865c9e97211cb2ee6c7ae96d3fb0e15aeffd66019b44a08a240cfdd2868a85e1f54d6fa5deaa041f6941ddf302690d61dc476385c2fa655142353cb4e4b59f6e5b6584db76fe8b1370263246c010c93d011014113ebdf987d093f9d37c2be48352d69a1683f8f6e6c2167983c761e3ab169fde5daaa12123fa1beab621e4da5935e9c198f82f35eae583a99386d8110ea6bd1abb0f568759f62694419ea5f69847c43462abef858b4cb5edc84e7b9226cd7bd7e183aa974a712c079dde85b9dc063b8a5c08e8f859c0ee5dcd824c7807f20153361a7f63cfd2a433a1be7f5\",\n            \"old\": false,\n          }\n        `)\n    })\n\n    it('should prefer new keys over old', () => {\n        expect(findKeyByFingerprints(['71e025b6c76033e3', 'b25898df208d2603'])?.fingerprint).toEqual('b25898df208d2603')\n    })\n\n    it('should return null if not found', () => {\n        expect(findKeyByFingerprints(['deadbeefdeadbeef'])).toBeNull()\n    })\n})\n"]}

package/cjs/utils/crypto/miller-rabin.d.ts

@@ -1,2 +1,2 @@
-import { BigInteger } from 'big-integer';
-export declare function millerRabin(n: BigInteger, rounds?: number): boolean;
+import { ICryptoProvider } from './abstract.js';
+export declare function millerRabin(crypto: ICryptoProvider, n: bigint, rounds?: number): boolean;