@siegesailor/cryptography 1.0.0

package/build/algorithms/euclidean/index.test.js

@@ -0,0 +1,22 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const euclidean_1 = __importDefault(require("../../algorithms/euclidean"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Finding the Greatest Common Divisor of the given numbers", () => {
+    test.each([
+        [2, 4, 2],
+        [816, 2260, 4],
+        [30513, 40242, 3],
+        [614, 513, 1],
+        [5102048903, 307803219, 1],
+    ])(`GCD(%p, %p) = x.\n\tx = ${chalk_1.default.greenBright("%p")}`, (left, right, result) => {
+        const execute = () => (0, euclidean_1.default)(BigInt(left), BigInt(right));
+        expect(execute()).toEqual(BigInt(result));
+        (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/euclidean/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/euclidean/index.test.ts"],"names":[],"mappings":";;;;;AAAA,uEAA+C;AAC/C,+DAAuC;AACvC,gDAA2E;AAE3E,QAAQ,CAAC,0DAA0D,EAAE,GAAG,EAAE;IACxE,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACT,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;QACd,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QACjB,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QACb,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC;KAC3B,CAAC,CACA,2BAA2B,eAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EACpD,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE;QACtB,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,IAAA,mBAAS,EAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAE7D,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1C,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/extended-euclidean/index.js

@@ -0,0 +1,77 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = main;
+exports.prompt = prompt;
+const wasm_1 = require("../../shared/algorithm/wasm");
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const prompt_1 = require("../../shared/cli/prompt");
+const runWASMExtendedEuclidean = (0, wasm_1.createWASMInvoker)("extended-euclidean", (wasmExports, left, right) => {
+    if (!wasmExports.extended_euclidean_i64 ||
+        !(0, wasm_1.fitsInI64)(left) ||
+        !(0, wasm_1.fitsInI64)(right)) {
+        return null;
+    }
+    const allocator = (0, wasm_1.createI64Allocator)(wasmExports);
+    allocator.reset();
+    const gcdPtr = allocator.allocate(wasm_1.I64_BYTES);
+    const xPtr = allocator.allocate(wasm_1.I64_BYTES);
+    const yPtr = allocator.allocate(wasm_1.I64_BYTES);
+    const view = allocator.view();
+    if (gcdPtr === null || xPtr === null || yPtr === null || !view) {
+        return null;
+    }
+    wasmExports.extended_euclidean_i64((0, wasm_1.normalizeI64)(left), (0, wasm_1.normalizeI64)(right), gcdPtr, xPtr, yPtr);
+    return [
+        view[gcdPtr / wasm_1.I64_BYTES],
+        view[xPtr / wasm_1.I64_BYTES],
+        view[yPtr / wasm_1.I64_BYTES],
+    ];
+});
+function main(left, right) {
+    const wasmResult = runWASMExtendedEuclidean(left, right);
+    if (wasmResult !== null) {
+        return wasmResult;
+    }
+    const recursion = (left, right) => {
+        if (right == BigInt(0))
+            return [left, BigInt(1), BigInt(0)];
+        const arrayOfResult = main(right, left % right);
+        return [
+            arrayOfResult[0],
+            arrayOfResult[2],
+            arrayOfResult[1] - (left / right) * arrayOfResult[2],
+        ];
+    };
+    return recursion(left, right);
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("extended-euclidean", async ({ ask, writeLine }) => {
+    writeLine("\tGCD(left, right) = result");
+    writeLine(chalk_1.default.gray("\tGCD(106, 112) = -19 * 106 + 18 * 112 = 2"));
+    const { left, right } = await ask([
+        {
+            type: "number",
+            name: "left",
+            message: `Enter ${chalk_1.default.italic("left")}:`,
+            default: 1,
+        },
+        {
+            type: "number",
+            name: "right",
+            message: `Enter ${chalk_1.default.italic("right")}:`,
+            default: 1,
+        },
+    ]);
+    const [result, x, y] = main(BigInt(left), BigInt(right));
+    writeLine(`GCD(${left}, ${right}) = ${x} * ${left} + ${y} * ${right} = ${result}`);
+    return {
+        inputs: { left, right },
+        result: [result, x, y],
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/extended-euclidean/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/extended-euclidean/index.ts"],"names":[],"mappings":";;;;;AAoDA,uBAkBC;AAmCD,wBAEC;AA3GD,kDAMiC;AACjC,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,wBAAwB,GAAG,IAAA,wBAAiB,EAGhD,oBAAoB,EAAE,CAAC,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;IACnD,IACE,CAAC,WAAW,CAAC,sBAAsB;QACnC,CAAC,IAAA,gBAAS,EAAC,IAAI,CAAC;QAChB,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC,EACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAA,yBAAkB,EAAC,WAAW,CAAC,CAAC;IAClD,SAAS,CAAC,KAAK,EAAE,CAAC;IAElB,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,gBAAS,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,gBAAS,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,gBAAS,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;IAE9B,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC/D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW,CAAC,sBAAsB,CAChC,IAAA,mBAAY,EAAC,IAAI,CAAC,EAClB,IAAA,mBAAY,EAAC,KAAK,CAAC,EACnB,MAAM,EACN,IAAI,EACJ,IAAI,CACL,CAAC;IAEF,OAAO;QACL,IAAI,CAAC,MAAM,GAAG,gBAAS,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,gBAAS,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,gBAAS,CAAC;KACvB,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,SAAwB,IAAI,CAAC,IAAY,EAAE,KAAa;IACtD,MAAM,UAAU,GAAG,wBAAwB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,EAAE;QAChD,IAAI,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5D,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;QAChD,OAAO;YACL,aAAa,CAAC,CAAC,CAAC;YAChB,aAAa,CAAC,CAAC,CAAC;YAChB,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;SACrD,CAAC;IACJ,CAAC,CAAC;IAEF,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,oBAAoB,EACpB,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,6BAA6B,CAAC,CAAC;IACzC,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC,CAAC;IAEpE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAkC;QACjE;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG;YACzC,OAAO,EAAE,CAAC;SACX;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG;YAC1C,OAAO,EAAE,CAAC;SACX;KACF,CAAC,CAAC;IAEH,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,SAAS,CACP,OAAO,IAAI,KAAK,KAAK,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,MAAM,EAAE,CACxE,CAAC;IAEF,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;QACvB,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;KACvB,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}

package/build/algorithms/extended-euclidean/index.test.js

@@ -0,0 +1,22 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const extended_euclidean_1 = __importDefault(require("../../algorithms/extended-euclidean"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Finding the Greatest Common Divisor of the given numbers in smallest integers form", () => {
+    test.each([
+        { left: 106, right: 112, x: -19, y: 18, result: 2 },
+        { left: 640, right: 531, x: 190, y: -229, result: 1 },
+        { left: 9123879, right: 421891, x: -19310, y: 417601, result: 1 },
+        { left: 102039129492, right: 13, x: 1, y: -7849163807, result: 1 },
+        { left: 13, right: 26, x: 1, y: 0, result: 13 },
+    ])(`GCD($left, $right) = x.\n\tx = ${chalk_1.default.greenBright("$x * $left + $y * $right")}`, ({ left, right, x, y, result }) => {
+        const execute = () => (0, extended_euclidean_1.default)(BigInt(left), BigInt(right));
+        expect(execute()).toEqual([BigInt(result), BigInt(x), BigInt(y)]);
+        (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/extended-euclidean/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/extended-euclidean/index.test.ts"],"names":[],"mappings":";;;;;AAAA,yFAAgE;AAChE,+DAAuC;AACvC,gDAA2E;AAE3E,QAAQ,CAAC,oFAAoF,EAAE,GAAG,EAAE;IAClG,IAAI,CAAC,IAAI,CAAC;QACR,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;QACnD,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE;QACrD,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE;QACjE,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE;QAClE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE;KAChD,CAAC,CACA,kCAAkC,eAAK,CAAC,WAAW,CACjD,0BAA0B,CAC3B,EAAE,EACH,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE;QAChC,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,IAAA,4BAAiB,EAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAErE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/fast-modular-exponentiation/index.js

@@ -0,0 +1,80 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = main;
+exports.prompt = prompt;
+const constants_1 = require("../../shared/constants");
+const wasm_1 = require("../../shared/algorithm/wasm");
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const prompt_1 = require("../../shared/cli/prompt");
+const runWASMPowMod = (0, wasm_1.createWASMInvoker)("fast-modular-exponentiation", (wasmExports, base, exponent, modulo) => {
+    if (!wasmExports.powmod_u64 ||
+        base < 0n ||
+        exponent < 0n ||
+        modulo <= 0n ||
+        !(0, wasm_1.fitsInU64)(base) ||
+        !(0, wasm_1.fitsInU64)(exponent) ||
+        !(0, wasm_1.fitsInU64)(modulo)) {
+        return null;
+    }
+    return wasmExports.powmod_u64(base, exponent, modulo);
+});
+function main(base, exponent, modulo) {
+    if (modulo <= 0n) {
+        throw new Error("modulo must be greater than 0.");
+    }
+    if (exponent < 0n) {
+        throw new Error("exponent must be non-negative.");
+    }
+    const maybeWASMResult = runWASMPowMod(base, exponent, modulo);
+    if (maybeWASMResult !== null) {
+        return maybeWASMResult;
+    }
+    let result = 1n;
+    let currentBase = ((base % modulo) + modulo) % modulo;
+    let currentExponent = exponent;
+    while (currentExponent > 0n) {
+        if ((currentExponent & 1n) === 1n) {
+            result = (result * currentBase) % modulo;
+        }
+        currentBase = (currentBase * currentBase) % modulo;
+        currentExponent >>= 1n;
+    }
+    return result;
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("fast-modular-exponentiation", async ({ ask, writeLine }) => {
+    writeLine(`\tbase^exponent % modulo ${constants_1.SYMBOLS.CONGRUENT} x. x = result`);
+    writeLine(chalk_1.default.gray(`\t2^100 % 71 ${constants_1.SYMBOLS.CONGRUENT} 20. x = 20`));
+    const { base, exponent, modulo } = await ask([
+        {
+            type: "number",
+            name: "base",
+            message: `Enter ${chalk_1.default.italic("base")}:`,
+            default: 2,
+        },
+        {
+            type: "number",
+            name: "exponent",
+            message: `Enter ${chalk_1.default.italic("exponent")}:`,
+            default: 100,
+        },
+        {
+            type: "number",
+            name: "modulo",
+            message: `Enter ${chalk_1.default.italic("modulo")}:`,
+            default: 71,
+        },
+    ]);
+    const result = main(BigInt(base), BigInt(exponent), BigInt(modulo));
+    writeLine(`\t${base}^${exponent} % ${modulo} ${constants_1.SYMBOLS.CONGRUENT} ${result}. x = ${result}`);
+    return {
+        inputs: { base, exponent, modulo },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/fast-modular-exponentiation/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/fast-modular-exponentiation/index.ts"],"names":[],"mappings":";;;;;AA2BA,uBA8BC;AA6CD,wBAEC;AAxGD,kDAA6C;AAC7C,kDAAuE;AACvE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,aAAa,GAAG,IAAA,wBAAiB,EACrC,6BAA6B,EAC7B,CAAC,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE;IACtC,IACE,CAAC,WAAW,CAAC,UAAU;QACvB,IAAI,GAAG,EAAE;QACT,QAAQ,GAAG,EAAE;QACb,MAAM,IAAI,EAAE;QACZ,CAAC,IAAA,gBAAS,EAAC,IAAI,CAAC;QAChB,CAAC,IAAA,gBAAS,EAAC,QAAQ,CAAC;QACpB,CAAC,IAAA,gBAAS,EAAC,MAAM,CAAC,EAClB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;AACxD,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAC1B,IAAY,EACZ,QAAgB,EAChB,MAAc;IAEd,IAAI,MAAM,IAAI,EAAE,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,QAAQ,GAAG,EAAE,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,eAAe,GAAG,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,WAAW,GAAG,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;IACtD,IAAI,eAAe,GAAG,QAAQ,CAAC;IAE/B,OAAO,eAAe,GAAG,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;YAClC,MAAM,GAAG,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,MAAM,CAAC;QAC3C,CAAC;QACD,WAAW,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,MAAM,CAAC;QACnD,eAAe,KAAK,EAAE,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,6BAA6B,EAC7B,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,4BAA4B,mBAAO,CAAC,SAAS,gBAAgB,CAAC,CAAC;IACzE,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,gBAAgB,mBAAO,CAAC,SAAS,aAAa,CAAC,CAAC,CAAC;IAEtE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,CAIzC;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG;YACzC,OAAO,EAAE,CAAC;SACX;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,UAAU;YAChB,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG;YAC7C,OAAO,EAAE,GAAG;SACb;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG;YAC3C,OAAO,EAAE,EAAE;SACZ;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACpE,SAAS,CACP,KAAK,IAAI,IAAI,QAAQ,MAAM,MAAM,IAAI,mBAAO,CAAC,SAAS,IAAI,MAAM,SAAS,MAAM,EAAE,CAClF,CAAC;IAEF,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE;QAClC,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}

package/build/algorithms/fast-modular-exponentiation/index.test.js

@@ -0,0 +1,31 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const fast_modular_exponentiation_1 = __importDefault(require("../../algorithms/fast-modular-exponentiation"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const constants_1 = require("../../shared/constants");
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Calculating the remainder from doing modulus for a number with exponentiation", () => {
+    test.each([
+        [2, 100, 71, 20],
+        [394948, 615192, 1093427, 1089500],
+        [11, 2, 2, 1],
+        [985019284, 118293113, 13, 6],
+        [1314520, 17, 11, 4],
+    ])(`%p^%p % %p ${constants_1.SYMBOLS.CONGRUENT} x.\n\tx = ${chalk_1.default.greenBright("%p")}`, (base, exponent, modulo, result) => {
+        const execute = () => {
+            return (0, fast_modular_exponentiation_1.default)(BigInt(base), BigInt(exponent), BigInt(modulo));
+        };
+        expect(execute()).toEqual(BigInt(result));
+        (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
+    });
+    test.each([
+        [2n, -1n, 5n, "exponent must be non-negative."],
+        [2n, 3n, 0n, "modulo must be greater than 0."],
+    ])("keeps the same error with and without WASM for %p^%p mod %p", (base, exponent, modulo, errorMessage) => {
+        (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, fast_modular_exponentiation_1.default)(base, exponent, modulo), errorMessage);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/fast-modular-exponentiation/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/fast-modular-exponentiation/index.test.ts"],"names":[],"mappings":";;;;;AAAA,2GAAiF;AACjF,+DAAuC;AACvC,kDAA6C;AAC7C,gDAG+B;AAE/B,QAAQ,CAAC,+EAA+E,EAAE,GAAG,EAAE;IAC7F,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;QAChB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC;QAClC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACb,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KACrB,CAAC,CACA,cAAc,mBAAO,CAAC,SAAS,cAAc,eAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EACtE,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QACjC,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,OAAO,IAAA,qCAAyB,EAC9B,MAAM,CAAC,IAAI,CAAC,EACZ,MAAM,CAAC,QAAQ,CAAC,EAChB,MAAM,CAAC,MAAM,CAAC,CACf,CAAC;QACJ,CAAC,CAAC;QAEF,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1C,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,gCAAgC,CAAC;QAC/C,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,gCAAgC,CAAC;KAC/C,CAAC,CACA,6DAA6D,EAC7D,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE;QACvC,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,qCAAyB,EAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,EACvD,YAAY,CACb,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/miller-rabin-primarily-test/index.js

@@ -0,0 +1,87 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = main;
+exports.prompt = prompt;
+const fast_modular_exponentiation_1 = __importDefault(require("../../algorithms/fast-modular-exponentiation"));
+const random_1 = require("../../shared/algorithm/random");
+const wasm_1 = require("../../shared/algorithm/wasm");
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const prompt_1 = require("../../shared/cli/prompt");
+const runWASMMillerRabin = (0, wasm_1.createWASMInvoker)("miller-rabin-primarily-test", (wasmExports, input, level) => {
+    if (!wasmExports.miller_rabin_u64 ||
+        input < 0n ||
+        input > wasm_1.MAX_U64 ||
+        !Number.isInteger(level) ||
+        level <= 0) {
+        return null;
+    }
+    return wasmExports.miller_rabin_u64(input, level) === 1;
+});
+function main(input, level) {
+    if (input <= 1n || input === 4n)
+        return false;
+    if (input <= 3n)
+        return true;
+    if (level <= 0) {
+        throw new Error("level must be a positive integer.");
+    }
+    const maybeWASMResult = runWASMMillerRabin(input, level);
+    if (maybeWASMResult !== null) {
+        return maybeWASMResult;
+    }
+    let odd = input - 1n;
+    while ((odd & 1n) === 0n)
+        odd >>= 1n;
+    const witnessRound = (n, d) => {
+        const a = (0, random_1.randomBigIntBetween)(2n, n - 2n);
+        let remainder = (0, fast_modular_exponentiation_1.default)(a, d, n);
+        if (remainder === 1n || remainder === n - 1n)
+            return true;
+        let dCache = d;
+        while (dCache !== n - 1n) {
+            remainder = (remainder * remainder) % n;
+            dCache <<= 1n;
+            if (remainder === 1n)
+                return false;
+            if (remainder === n - 1n)
+                return true;
+        }
+        return false;
+    };
+    for (let count = 0; count < level; count++) {
+        if (!witnessRound(input, odd))
+            return false;
+    }
+    return true;
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("miller-rabin-primarily-test", async ({ ask, writeLine }) => {
+    writeLine("\tisPrime(number, level) = result");
+    writeLine(chalk_1.default.gray("\tisPrime(104729, 10) = true"));
+    const { input, level } = await ask([
+        {
+            type: "number",
+            name: "input",
+            message: `Enter ${chalk_1.default.italic("number")}:`,
+            default: 104729,
+        },
+        {
+            type: "number",
+            name: "level",
+            message: `Enter ${chalk_1.default.italic("level")}:`,
+            default: 10,
+        },
+    ]);
+    const result = main(BigInt(input), Number(level));
+    writeLine(`\tisPrime(${input}, ${level}) = ${result}`);
+    return {
+        inputs: { input, level },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/miller-rabin-primarily-test/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/miller-rabin-primarily-test/index.ts"],"names":[],"mappings":";;;;;AA0BA,uBAqCC;AAiCD,wBAEC;AAlGD,2GAAiF;AACjF,sDAAgE;AAChE,kDAAqE;AACrE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,kBAAkB,GAAG,IAAA,wBAAiB,EAC1C,6BAA6B,EAC7B,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;IAC5B,IACE,CAAC,WAAW,CAAC,gBAAgB;QAC7B,KAAK,GAAG,EAAE;QACV,KAAK,GAAG,cAAO;QACf,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,EACV,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,WAAW,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,KAAa,EAAE,KAAa;IACvD,IAAI,KAAK,IAAI,EAAE,IAAI,KAAK,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAC9C,IAAI,KAAK,IAAI,EAAE;QAAE,OAAO,IAAI,CAAC;IAC7B,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,eAAe,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACzD,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,IAAI,GAAG,GAAG,KAAK,GAAG,EAAE,CAAC;IACrB,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC,KAAK,EAAE;QAAE,GAAG,KAAK,EAAE,CAAC;IAErC,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,4BAAmB,EAAC,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,IAAI,SAAS,GAAG,IAAA,qCAAyB,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,SAAS,KAAK,EAAE,IAAI,SAAS,KAAK,CAAC,GAAG,EAAE;YAAE,OAAO,IAAI,CAAC;QAE1D,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,OAAO,MAAM,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;YACzB,SAAS,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,KAAK,EAAE,CAAC;YAEd,IAAI,SAAS,KAAK,EAAE;gBAAE,OAAO,KAAK,CAAC;YACnC,IAAI,SAAS,KAAK,CAAC,GAAG,EAAE;gBAAE,OAAO,IAAI,CAAC;QACxC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IAC9C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,6BAA6B,EAC7B,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,mCAAmC,CAAC,CAAC;IAC/C,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC;IAEtD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAmC;QACnE;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG;YAC3C,OAAO,EAAE,MAAM;SAChB;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG;YAC1C,OAAO,EAAE,EAAE;SACZ;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAClD,SAAS,CAAC,aAAa,KAAK,KAAK,KAAK,OAAO,MAAM,EAAE,CAAC,CAAC;IAEvD,OAAO;QACL,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE;QACxB,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}

package/build/algorithms/miller-rabin-primarily-test/index.test.js

@@ -0,0 +1,78 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const miller_rabin_primarily_test_1 = __importDefault(require("../../algorithms/miller-rabin-primarily-test"));
+const random = __importStar(require("../../shared/algorithm/random"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Determining if the given number is Prime", () => {
+    afterEach(() => {
+        jest.restoreAllMocks();
+    });
+    test.each([
+        [7984925229121, 10, false],
+        [742621738636840244392549n, 5, true],
+        [38270906631533, 5, false],
+        [436885159382056146719494010011n, 10, true],
+        [1268969304953789, 5, false],
+    ])(`%p at level %p is prime.\n\tis ${chalk_1.default.greenBright("%p")}`, (input, level, result) => {
+        expect((0, miller_rabin_primarily_test_1.default)(BigInt(input), level)).toEqual(result);
+    });
+    test.each([
+        [101n, 5, true],
+        [221n, 5, false],
+        [104729n, 5, true],
+        [341n, 5, false],
+    ])("keeps the same classification with deterministic fallback witnesses for %p", (input, level, result) => {
+        const witnesses = [2n, 3n, 5n, 7n, 11n];
+        let witnessIndex = 0;
+        jest.spyOn(random, "randomBigIntBetween").mockImplementation(() => {
+            const witness = witnesses[witnessIndex % witnesses.length];
+            witnessIndex += 1;
+            return witness;
+        });
+        const actualResult = (0, miller_rabin_primarily_test_1.default)(input, level);
+        expect(actualResult).toEqual(result);
+        witnessIndex = 0;
+        expect((0, wasm_1.runWithoutWASM)(() => (0, miller_rabin_primarily_test_1.default)(input, level))).toEqual(actualResult);
+    });
+    test.each([0, -1])("keeps the same error with and without WASM for level %p", (level) => {
+        (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, miller_rabin_primarily_test_1.default)(7n, level), "level must be a positive integer.");
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/miller-rabin-primarily-test/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/miller-rabin-primarily-test/index.test.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,2GAAgF;AAChF,kEAAoD;AACpD,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,SAAS,CAAC,GAAG,EAAE;QACb,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,aAAa,EAAE,EAAE,EAAE,KAAK,CAAC;QAC1B,CAAC,yBAAyB,EAAE,CAAC,EAAE,IAAI,CAAC;QACpC,CAAC,cAAc,EAAE,CAAC,EAAE,KAAK,CAAC;QAC1B,CAAC,+BAA+B,EAAE,EAAE,EAAE,IAAI,CAAC;QAC3C,CAAC,gBAAgB,EAAE,CAAC,EAAE,KAAK,CAAC;KAC7B,CAAC,CACA,kCAAkC,eAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAC3D,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE;QACvB,MAAM,CAAC,IAAA,qCAAwB,EAAC,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACzE,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC;QACf,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC;QAChB,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC;QAClB,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC;KACjB,CAAC,CACA,4EAA4E,EAC5E,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE;QACvB,MAAM,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;QACxC,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC,kBAAkB,CAAC,GAAG,EAAE;YAChE,MAAM,OAAO,GAAG,SAAS,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;YAC3D,YAAY,IAAI,CAAC,CAAC;YAClB,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,IAAA,qCAAwB,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE5D,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAErC,YAAY,GAAG,CAAC,CAAC;QACjB,MAAM,CACJ,IAAA,qBAAc,EAAC,GAAG,EAAE,CAAC,IAAA,qCAAwB,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAC7D,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC1B,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAChB,yDAAyD,EACzD,CAAC,KAAK,EAAE,EAAE;QACR,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,qCAAwB,EAAC,EAAE,EAAE,KAAK,CAAC,EACzC,mCAAmC,CACpC,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/multiplicative-inverse/index.js

@@ -0,0 +1,83 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = main;
+exports.prompt = prompt;
+const extended_euclidean_1 = __importDefault(require("../../algorithms/extended-euclidean"));
+const wasm_1 = require("../../shared/algorithm/wasm");
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const prompt_1 = require("../../shared/cli/prompt");
+const runWASMMultiplicativeInverse = (0, wasm_1.createWASMInvoker)("multiplicative-inverse", (wasmExports, base, modulo) => {
+    if (!wasmExports.multiplicative_inverse_i64 ||
+        modulo <= 1n ||
+        !(0, wasm_1.fitsInI64)(base) ||
+        !(0, wasm_1.fitsInI64)(modulo)) {
+        return null;
+    }
+    const value = wasmExports.multiplicative_inverse_i64((0, wasm_1.normalizeI64)(base), (0, wasm_1.normalizeI64)(modulo));
+    if (value === wasm_1.MIN_I64) {
+        return null;
+    }
+    return value;
+});
+function main(base, modulo, number) {
+    if (modulo <= 1n) {
+        throw new Error("modulo must be greater than 1.");
+    }
+    if (number <= 0) {
+        throw new Error("number must be a positive integer.");
+    }
+    const maybeWASMInverse = runWASMMultiplicativeInverse(base, modulo);
+    let inverse;
+    if (maybeWASMInverse !== null) {
+        inverse = maybeWASMInverse;
+    }
+    else {
+        const [gcd, x] = (0, extended_euclidean_1.default)(base, modulo);
+        if (gcd !== 1n) {
+            throw new Error("base and modulo must be coprime.");
+        }
+        inverse = ((x % modulo) + modulo) % modulo;
+    }
+    const arrayOfInverse = [];
+    for (let count = BigInt(1); count <= number; count++) {
+        arrayOfInverse.push(inverse * count);
+    }
+    return arrayOfInverse;
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("multiplicative-inverse", async ({ ask, writeLine }) => {
+    writeLine("\tmultiplicativeInverse(base, modulo, count) = [values]");
+    writeLine(chalk_1.default.gray("\tmultiplicativeInverse(23, 41, 5) = [25,50,75,100,125]"));
+    const { base, modulo, number } = await ask([
+        {
+            type: "number",
+            name: "base",
+            message: `Enter ${chalk_1.default.italic("base")}:`,
+            default: 23,
+        },
+        {
+            type: "number",
+            name: "modulo",
+            message: `Enter ${chalk_1.default.italic("modulo")}:`,
+            default: 41,
+        },
+        {
+            type: "number",
+            name: "number",
+            message: `Enter ${chalk_1.default.italic("count")}:`,
+            default: 5,
+        },
+    ]);
+    const result = main(BigInt(base), BigInt(modulo), Number(number));
+    writeLine(`\tResult = ${result}`);
+    return {
+        inputs: { base, modulo, count: number },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/multiplicative-inverse/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/multiplicative-inverse/index.ts"],"names":[],"mappings":";;;;;AAqCA,uBA4BC;AA6CD,wBAEC;AAhHD,yFAAgE;AAChE,kDAKiC;AACjC,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,4BAA4B,GAAG,IAAA,wBAAiB,EAGpD,wBAAwB,EAAE,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;IACxD,IACE,CAAC,WAAW,CAAC,0BAA0B;QACvC,MAAM,IAAI,EAAE;QACZ,CAAC,IAAA,gBAAS,EAAC,IAAI,CAAC;QAChB,CAAC,IAAA,gBAAS,EAAC,MAAM,CAAC,EAClB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,0BAA0B,CAClD,IAAA,mBAAY,EAAC,IAAI,CAAC,EAClB,IAAA,mBAAY,EAAC,MAAM,CAAC,CACrB,CAAC;IACF,IAAI,KAAK,KAAK,cAAO,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,CAAC;AAEH,SAAwB,IAAI,CAAC,IAAY,EAAE,MAAc,EAAE,MAAc;IACvE,IAAI,MAAM,IAAI,EAAE,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,gBAAgB,GAAG,4BAA4B,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACpE,IAAI,OAAe,CAAC;IAEpB,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC9B,OAAO,GAAG,gBAAgB,CAAC;IAC7B,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,IAAA,4BAAiB,EAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACjD,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QAED,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;IAC7C,CAAC;IAED,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACrD,cAAc,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,cAAc,CAAC;AACxB,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,wBAAwB,EACxB,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,yDAAyD,CAAC,CAAC;IACrE,SAAS,CACP,eAAK,CAAC,IAAI,CAAC,yDAAyD,CAAC,CACtE,CAAC;IAEF,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,CAIvC;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG;YACzC,OAAO,EAAE,EAAE;SACZ;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG;YAC3C,OAAO,EAAE,EAAE;SACZ;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG;YAC1C,OAAO,EAAE,CAAC;SACX;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAClE,SAAS,CAAC,cAAc,MAAM,EAAE,CAAC,CAAC;IAElC,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;QACvC,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}

package/build/algorithms/multiplicative-inverse/index.test.js

@@ -0,0 +1,30 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const multiplicative_inverse_1 = __importDefault(require("../../algorithms/multiplicative-inverse"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Finding the Multiplicative Inverses of the given numbers", () => {
+    test.each([
+        { base: 87, modulo: 131, result: [128, 256, 384, 512, 640] },
+        { base: 23, modulo: 41, result: [25, 50, 75, 100, 125] },
+        { base: 11, modulo: 13, result: [6, 12, 18, 24, 30] },
+        { base: 2, modulo: 7, result: [4, 8, 12, 16, 20] },
+        { base: 1011, modulo: 913, result: [736, 1472, 2208, 2944, 3680] },
+    ])(`y is the multiplicative inverse of $base $ $modulo ($base * y % $modulo = 1)\n\ty = ${chalk_1.default.greenBright("$result")}`, ({ base, modulo, result }) => {
+        const execute = () => (0, multiplicative_inverse_1.default)(BigInt(base), BigInt(modulo), 5);
+        expect(execute()).toEqual(result.map((item) => BigInt(item)));
+        (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
+    });
+    test.each([
+        [23n, 1n, 5, "modulo must be greater than 1."],
+        [23n, 41n, 0, "number must be a positive integer."],
+        [2n, 4n, 1, "base and modulo must be coprime."],
+        [(1n << 63n) + 1n, 3n, 1, "base and modulo must be coprime."],
+    ])("keeps the same error with and without WASM for %p mod %p", (base, modulo, count, errorMessage) => {
+        (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, multiplicative_inverse_1.default)(base, modulo, count), errorMessage);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/multiplicative-inverse/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/multiplicative-inverse/index.test.ts"],"names":[],"mappings":";;;;;AAAA,iGAAwE;AACxE,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,0DAA0D,EAAE,GAAG,EAAE;IACxE,IAAI,CAAC,IAAI,CAAC;QACR,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;QAC5D,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;QACxD,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;QACrD,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;QAClD,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;KACnE,CAAC,CACA,uFAAuF,eAAK,CAAC,WAAW,CACtG,SAAS,CACV,EAAE,EACH,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE;QAC3B,MAAM,OAAO,GAAG,GAAG,EAAE,CACnB,IAAA,gCAAqB,EAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzD,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,gCAAgC,CAAC;QAC9C,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,oCAAoC,CAAC;QACnD,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC;QAC/C,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,kCAAkC,CAAC;KAC9D,CAAC,CACA,0DAA0D,EAC1D,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE;QACpC,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,gCAAqB,EAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAChD,YAAY,CACb,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}