@siegesailor/cryptography 1.0.0

package/LICENSE.md

@@ -0,0 +1,19 @@
+Copyright (c) 2026 Jin Yu Zhang
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
+OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE
+OR OTHER DEALINGS IN THE SOFTWARE.

package/README.md

@@ -0,0 +1,79 @@
+# Cryptography
+
+[![Conventional Commits](https://img.shields.io/badge/Conventional%20Commits-1.0.0-%23FE5196?logo=conventionalcommits&logoColor=white)](https://conventionalcommits.org)
+
+This library provides a collection of cryptography algorithms. It serves as a learning resource (Inspired by [Boston University MET CS 789 Cryptography](https://www.bu.edu/academics/met/courses/met-cs-789/)) for understanding the implementation of various cryptographic algorithms and their applications in key encryption flows. The library is also production-ready, with a focus on performance and security, making it suitable for use in real-world applications:
+
+| Algorithm                   | JavaScript | TypeScript | WebAssembly |
+| --------------------------- | ---------- | ---------- | ----------- |
+| Baby Step Giant Step        | ✅         | ✅         | ✅          |
+| Blum Blum Shub              | ✅         | ✅         | ✅          |
+| Chinese Remainder           | ✅         | ✅         | ✅          |
+| Euclidean                   | ✅         | ✅         | ✅          |
+| Extended Euclidean          | ✅         | ✅         | ✅          |
+| Fast Modular Exponentiation | ✅         | ✅         | ✅          |
+| Miller Rabin Primality Test | ✅         | ✅         | ✅          |
+| Multiplicative Inverse      | ✅         | ✅         | ✅          |
+| Naor Reingo                 | ✅         | ✅         | ✅          |
+| Pollard P-1 Factorization   | ✅         | ✅         | ✅          |
+| Pollard Rho                 | ✅         | ✅         | ✅          |
+| Primitive Root Search       | ✅         | ✅         | ✅          |
+
+> [!tip]
+> Zero configuration needed. WebAssembly availability is determined at runtime, with a safe fallback to JavaScript with TypeScript support implemented.
+
+And, a CLI is available to interact with these algorithms and demonstrate the 3 key encryption flows:
+
+- [Diffie Hellman Key Exchange](./source/key-encryptions/DiffieHellman.ts)
+- [ElGamal](./source/key-encryptions/ElGamal.ts)
+- [RSA](./source/key-encryptions/RSA.ts)
+
+## Installation
+
+The package is available on NPM:
+
+```bash
+npm install @siegesailor/cryptography
+```
+
+### Prerequisites
+
+Required software for this module:
+
+- [Node.js](https://nodejs.org/): `>= 25.2.1`
+
+## Use as a Library
+
+You can use it in ESM:
+
+```ts
+import {
+  fastModularExponentiation,
+  millerRabinPrimalityTest,
+  euclidean,
+} from "@siegesailor/cryptography";
+
+const gcd = euclidean(614n, 513n);
+const modPow = fastModularExponentiation(2n, 100n, 71n);
+const isPrime = millerRabinPrimalityTest(104729n, 10);
+```
+
+Or, you can use it in CommonJS:
+
+```js
+const {
+  euclidean,
+  fastModularExponentiation,
+  millerRabinPrimalityTest,
+} = require("@siegesailor/cryptography");
+```
+
+## Use as a CLI
+
+![CLI](./images/CLI.png)
+
+Run directly with NPX:
+
+```bash
+npx @siegesailor/cryptography
+```

package/build/algorithms/baby-step-giant-step/index.js

@@ -0,0 +1,89 @@
+"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 euclidean_1 = __importDefault(require("../../algorithms/euclidean"));
+const fast_modular_exponentiation_1 = __importDefault(require("../../algorithms/fast-modular-exponentiation"));
+const wasm_1 = require("../../shared/algorithm/wasm");
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const prompt_1 = require("../../shared/cli/prompt");
+const constants_1 = require("../../shared/constants");
+const runWASMBabyStepGiantStep = (0, wasm_1.createWASMInvoker)("baby-step-giant-step", (wasmExports, generator, base, modulo) => {
+    if (!wasmExports.baby_step_giant_step_i64 ||
+        modulo <= 1n ||
+        generator < 0n ||
+        base < 0n ||
+        !(0, wasm_1.fitsInI64)(generator) ||
+        !(0, wasm_1.fitsInI64)(base) ||
+        !(0, wasm_1.fitsInI64)(modulo)) {
+        return null;
+    }
+    const limit = modulo > 2000000n ? 2000000n : modulo;
+    const result = wasmExports.baby_step_giant_step_i64(generator, base, modulo, limit);
+    return result < 0n ? null : result;
+});
+function main(generator, base, modulo) {
+    if (modulo <= 1)
+        throw new Error("Given modulo must be higher than 1");
+    if ((0, euclidean_1.default)(generator, modulo) != BigInt(1))
+        throw new Error("Given generator must satisfy GCD(generator, modulo) = 1");
+    if ((0, euclidean_1.default)(base, modulo) != BigInt(1))
+        throw new Error("Given base must satisfy GCD(base, modulo) = 1");
+    const maybeWASMResult = runWASMBabyStepGiantStep(generator, base, modulo);
+    if (maybeWASMResult !== null) {
+        return maybeWASMResult;
+    }
+    const numberOfSteps = BigInt(Math.ceil(Math.sqrt(Number(modulo)))) + 1n;
+    const collision = new Map();
+    for (let i = numberOfSteps; i >= 1n; i--) {
+        const remainder = (0, fast_modular_exponentiation_1.default)(generator, i * numberOfSteps, modulo);
+        collision.set(remainder, i);
+    }
+    for (let j = 0n; j < numberOfSteps; j++) {
+        const indexCurrent = ((0, fast_modular_exponentiation_1.default)(generator, j, modulo) * base) % modulo;
+        const step = collision.get(indexCurrent);
+        if (step && step > 0n) {
+            const result = step * numberOfSteps - j;
+            if (result < modulo)
+                return result;
+        }
+    }
+    return BigInt(-1);
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("baby-step-giant-step", async ({ ask, writeLine }) => {
+    writeLine(`\tgenerator^x ${constants_1.SYMBOLS.CONGRUENT} base % modulo. x = result`);
+    writeLine(chalk_1.default.gray(`\t92^x ${constants_1.SYMBOLS.CONGRUENT} 13 % 5. x = 3`));
+    const { generator, base, modulo } = await ask([
+        {
+            type: "number",
+            name: "generator",
+            message: `Enter ${chalk_1.default.italic("generator")}:`,
+            default: 1,
+        },
+        {
+            type: "number",
+            name: "base",
+            message: `Enter ${chalk_1.default.italic("base")}:`,
+            default: 1,
+        },
+        {
+            type: "number",
+            name: "modulo",
+            message: `Enter ${chalk_1.default.italic("modulo")}:`,
+            default: 2,
+        },
+    ]);
+    const result = main(BigInt(generator), BigInt(base), BigInt(modulo));
+    writeLine(`\t${generator}^x ${constants_1.SYMBOLS.CONGRUENT} ${base} % ${modulo}. x = ${result}`);
+    return {
+        inputs: { generator, base, modulo },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/baby-step-giant-step/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/baby-step-giant-step/index.ts"],"names":[],"mappings":";;;;;AAqCA,uBAoCC;AA6CD,wBAEC;AAxHD,uEAA+C;AAC/C,2GAAiF;AACjF,kDAAuE;AACvE,+DAAuC;AACvC,gDAG6B;AAC7B,kDAA6C;AAE7C,MAAM,wBAAwB,GAAG,IAAA,wBAAiB,EAGhD,sBAAsB,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;IACjE,IACE,CAAC,WAAW,CAAC,wBAAwB;QACrC,MAAM,IAAI,EAAE;QACZ,SAAS,GAAG,EAAE;QACd,IAAI,GAAG,EAAE;QACT,CAAC,IAAA,gBAAS,EAAC,SAAS,CAAC;QACrB,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,MAAM,GAAG,QAAU,CAAC,CAAC,CAAC,QAAU,CAAC,CAAC,CAAC,MAAM,CAAC;IACxD,MAAM,MAAM,GAAG,WAAW,CAAC,wBAAwB,CACjD,SAAS,EACT,IAAI,EACJ,MAAM,EACN,KAAK,CACN,CAAC;IAEF,OAAO,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AACrC,CAAC,CAAC,CAAC;AAEH,SAAwB,IAAI,CAAC,SAAiB,EAAE,IAAY,EAAE,MAAc;IAC1E,IAAI,MAAM,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACvE,IAAI,IAAA,mBAAS,EAAC,SAAS,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC7E,IAAI,IAAA,mBAAS,EAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IAEnE,MAAM,eAAe,GAAG,wBAAwB,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1E,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IAExE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,IAAA,qCAAyB,EACzC,SAAS,EACT,CAAC,GAAG,aAAa,EACjB,MAAM,CACP,CAAC;QACF,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,YAAY,GAChB,CAAC,IAAA,qCAAyB,EAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC;QACpE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAEzC,IAAI,IAAI,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,IAAI,GAAG,aAAa,GAAG,CAAC,CAAC;YACxC,IAAI,MAAM,GAAG,MAAM;gBAAE,OAAO,MAAM,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,sBAAsB,EACtB,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,iBAAiB,mBAAO,CAAC,SAAS,4BAA4B,CAAC,CAAC;IAC1E,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,UAAU,mBAAO,CAAC,SAAS,gBAAgB,CAAC,CAAC,CAAC;IAEnE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,CAI1C;QACD;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,WAAW;YACjB,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG;YAC9C,OAAO,EAAE,CAAC;SACX;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,QAAQ;YACd,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG;YAC3C,OAAO,EAAE,CAAC;SACX;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACrE,SAAS,CACP,KAAK,SAAS,MAAM,mBAAO,CAAC,SAAS,IAAI,IAAI,MAAM,MAAM,SAAS,MAAM,EAAE,CAC3E,CAAC;IAEF,OAAO;QACL,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE;QACnC,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/baby-step-giant-step/index.test.js

@@ -0,0 +1,32 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const baby_step_giant_step_1 = __importDefault(require("../../algorithms/baby-step-giant-step"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const constants_1 = require("../../shared/constants");
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Finding the Discrete Log for the given numbers", () => {
+    test.each([
+        [394948, 615192, 1093427, 246298],
+        [92, 13, 5, 3],
+        [87694, 86324, 114041, 72211],
+        [227801, 155104, 291563, 74399],
+        [62712, 30084, 83437, 68793],
+    ])(`%p^x ${constants_1.SYMBOLS.CONGRUENT} %p % %p.\n\tx = ${chalk_1.default.greenBright("%p")}`, (generator, base, modulo, result) => {
+        const execute = () => {
+            return (0, baby_step_giant_step_1.default)(BigInt(generator), BigInt(base), BigInt(modulo));
+        };
+        expect(execute()).toEqual(BigInt(result));
+        (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
+    });
+    test.each([
+        [1n, 1n, 1n, "Given modulo must be higher than 1"],
+        [4n, 1n, 8n, "Given generator must satisfy GCD(generator, modulo) = 1"],
+        [3n, 4n, 8n, "Given base must satisfy GCD(base, modulo) = 1"],
+    ])("keeps the same error with and without WASM for %p, %p, %p", (generator, base, modulo, errorMessage) => {
+        (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, baby_step_giant_step_1.default)(generator, base, modulo), errorMessage);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/baby-step-giant-step/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/baby-step-giant-step/index.test.ts"],"names":[],"mappings":";;;;;AAAA,6FAAkE;AAClE,+DAAuC;AACvC,kDAA6C;AAC7C,gDAG+B;AAE/B,QAAQ,CAAC,gDAAgD,EAAE,GAAG,EAAE;IAC9D,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;QACjC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACd,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC;QAC7B,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;QAC/B,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC;KAC7B,CAAC,CACA,QAAQ,mBAAO,CAAC,SAAS,oBAAoB,eAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EACtE,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAClC,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,OAAO,IAAA,8BAAiB,EACtB,MAAM,CAAC,SAAS,CAAC,EACjB,MAAM,CAAC,IAAI,CAAC,EACZ,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,EAAE,EAAE,EAAE,EAAE,oCAAoC,CAAC;QAClD,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,yDAAyD,CAAC;QACvE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,+CAA+C,CAAC;KAC9D,CAAC,CACA,2DAA2D,EAC3D,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE;QACxC,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,8BAAiB,EAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,EAChD,YAAY,CACb,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/blum-blum-shub/index.js

@@ -0,0 +1,88 @@
+"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 euclidean_1 = __importDefault(require("../../algorithms/euclidean"));
+const miller_rabin_primarily_test_1 = __importDefault(require("../../algorithms/miller-rabin-primarily-test"));
+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 runWASMBlumBlumShubNext = (0, wasm_1.createWASMInvoker)("blum-blum-shub", (wasmExports, state, modulus) => {
+    if (!wasmExports.blum_blum_shub_next_u64 ||
+        state < 0n ||
+        modulus <= 0n ||
+        !(0, wasm_1.fitsInU64)(state) ||
+        !(0, wasm_1.fitsInU64)(modulus)) {
+        return null;
+    }
+    return wasmExports.blum_blum_shub_next_u64(state, modulus);
+});
+function main(bits) {
+    if (!Number.isInteger(bits) || bits < 8) {
+        throw new Error("Given bits must be an integer and at least 8.");
+    }
+    const certainty = Math.max(5, Math.ceil(Math.log2(bits)));
+    const randomOddWithBits = (size) => {
+        let candidate = (0, random_1.randomBigIntBits)(size);
+        if ((candidate & 1n) === 0n)
+            candidate += 1n;
+        return candidate;
+    };
+    const generateBlumPrime = (size) => {
+        while (true) {
+            let candidate = randomOddWithBits(size);
+            if (candidate % 4n !== 3n) {
+                candidate += (3n - (candidate % 4n) + 4n) % 4n;
+            }
+            if ((0, miller_rabin_primarily_test_1.default)(candidate, certainty)) {
+                return candidate;
+            }
+        }
+    };
+    const p = generateBlumPrime(bits);
+    let q = generateBlumPrime(bits);
+    while (q === p) {
+        q = generateBlumPrime(bits);
+    }
+    const m = p * q;
+    let seed = (0, random_1.randomBigIntBetween)(2n, m - 2n);
+    while ((0, euclidean_1.default)(seed, m) !== 1n) {
+        seed = (0, random_1.randomBigIntBetween)(2n, m - 2n);
+    }
+    let result = (seed * seed) % m;
+    return () => {
+        const maybeWASMResult = runWASMBlumBlumShubNext(result, m);
+        if (maybeWASMResult !== null) {
+            result = maybeWASMResult;
+            return result;
+        }
+        result = (result * result) % m;
+        return result;
+    };
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("blum-blum-shub", async ({ ask, writeLine }) => {
+    writeLine(`\tgenerate a 8-bit pseudo-random number x. x = result`);
+    writeLine(chalk_1.default.gray(`\tx is smaller or equal to ${Math.pow(2, 8) * Math.pow(2, 8)}`));
+    const { bits } = await ask([
+        {
+            type: "number",
+            name: "bits",
+            message: `Enter ${chalk_1.default.italic("bits")}:`,
+            default: 8,
+        },
+    ]);
+    const result = main(bits)();
+    writeLine(`\t${bits}-bit x = ${result}`);
+    return {
+        inputs: { bits },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/blum-blum-shub/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/blum-blum-shub/index.ts"],"names":[],"mappings":";;;;;AA8BA,uBAkDC;AA+BD,wBAEC;AAjHD,uEAA+C;AAC/C,2GAAgF;AAChF,sDAGmC;AACnC,kDAAuE;AACvE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,uBAAuB,GAAG,IAAA,wBAAiB,EAC/C,gBAAgB,EAChB,CAAC,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;IAC9B,IACE,CAAC,WAAW,CAAC,uBAAuB;QACpC,KAAK,GAAG,EAAE;QACV,OAAO,IAAI,EAAE;QACb,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC;QACjB,CAAC,IAAA,gBAAS,EAAC,OAAO,CAAC,EACnB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,WAAW,CAAC,uBAAuB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AAC7D,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,IAAY;IACvC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACnE,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE1D,MAAM,iBAAiB,GAAG,CAAC,IAAY,EAAE,EAAE;QACzC,IAAI,SAAS,GAAG,IAAA,yBAAgB,EAAC,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC,KAAK,EAAE;YAAE,SAAS,IAAI,EAAE,CAAC;QAC7C,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,iBAAiB,GAAG,CAAC,IAAY,EAAE,EAAE;QACzC,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,SAAS,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC1B,SAAS,IAAI,CAAC,EAAE,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;YACjD,CAAC;YACD,IAAI,IAAA,qCAAwB,EAAC,SAAS,EAAE,SAAS,CAAC,EAAE,CAAC;gBACnD,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAChC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAEhB,IAAI,IAAI,GAAG,IAAA,4BAAmB,EAAC,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3C,OAAO,IAAA,mBAAS,EAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,IAAI,GAAG,IAAA,4BAAmB,EAAC,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAE/B,OAAO,GAAG,EAAE;QACV,MAAM,eAAe,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3D,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;YAC7B,MAAM,GAAG,eAAe,CAAC;YACzB,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,gBAAgB,EAChB,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,uDAAuD,CAAC,CAAC;IACnE,SAAS,CACP,eAAK,CAAC,IAAI,CACR,8BAA8B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAChE,CACF,CAAC;IAEF,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,GAAG,CAAmB;QAC3C;YACE,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG;YACzC,OAAO,EAAE,CAAC;SACX;KACF,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAC5B,SAAS,CAAC,KAAK,IAAI,YAAY,MAAM,EAAE,CAAC,CAAC;IAEzC,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE;QAChB,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/blum-blum-shub/index.test.js

@@ -0,0 +1,74 @@
+"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 blum_blum_shub_1 = __importDefault(require("../../algorithms/blum-blum-shub"));
+const random = __importStar(require("../../shared/algorithm/random"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Generate pseudo random numbers", () => {
+    afterEach(() => {
+        jest.restoreAllMocks();
+    });
+    test.each([8, 12, 16])(`${chalk_1.default.greenBright("%p")}-bit random number\n\tis smaller or equal to its base-10 value`, (bits) => {
+        const actualResult = (0, blum_blum_shub_1.default)(bits)();
+        const fallbackResult = (0, wasm_1.runWithoutWASM)(() => (0, blum_blum_shub_1.default)(bits)());
+        expect(actualResult > 0n).toBeTruthy();
+        expect(fallbackResult > 0n).toBeTruthy();
+    });
+    test("produces the same next value with and without WASM when entropy is fixed", () => {
+        const candidateValues = [11n, 19n];
+        let candidateIndex = 0;
+        jest.spyOn(random, "randomBigIntBits").mockImplementation(() => {
+            const value = candidateValues[candidateIndex % candidateValues.length];
+            candidateIndex += 1;
+            return value;
+        });
+        jest.spyOn(random, "randomBigIntBetween").mockReturnValue(3n);
+        const execute = () => {
+            candidateIndex = 0;
+            return (0, blum_blum_shub_1.default)(8)();
+        };
+        const actualResult = execute();
+        expect(actualResult).toEqual(81n);
+        expect((0, wasm_1.runWithoutWASM)(execute)).toEqual(actualResult);
+    });
+    test.each([0, 7])("keeps the same error with and without WASM for %p bits", (bits) => {
+        (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, blum_blum_shub_1.default)(bits), "Given bits must be an integer and at least 8.");
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/blum-blum-shub/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/blum-blum-shub/index.test.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,iFAAuD;AACvD,kEAAoD;AACpD,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,SAAS,CAAC,GAAG,EAAE;QACb,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CACpB,GAAG,eAAK,CAAC,WAAW,CAClB,IAAI,CACL,gEAAgE,EACjE,CAAC,IAAI,EAAE,EAAE;QACP,MAAM,YAAY,GAAG,IAAA,wBAAY,EAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,cAAc,GAAG,IAAA,qBAAc,EAAC,GAAG,EAAE,CAAC,IAAA,wBAAY,EAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElE,MAAM,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;QACvC,MAAM,CAAC,cAAc,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;IAC3C,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,0EAA0E,EAAE,GAAG,EAAE;QACpF,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC,kBAAkB,CAAC,GAAG,EAAE;YAC7D,MAAM,KAAK,GAAG,eAAe,CAAC,cAAc,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;YACvE,cAAc,IAAI,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAE9D,MAAM,OAAO,GAAG,GAAG,EAAE;YACnB,cAAc,GAAG,CAAC,CAAC;YACnB,OAAO,IAAA,wBAAY,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,CAAC,CAAC;QAEF,MAAM,YAAY,GAAG,OAAO,EAAE,CAAC;QAE/B,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,CAAC,IAAA,qBAAc,EAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CACf,wDAAwD,EACxD,CAAC,IAAI,EAAE,EAAE;QACP,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,wBAAY,EAAC,IAAI,CAAC,EACxB,+CAA+C,CAChD,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/chinese-remainder/index.js

@@ -0,0 +1,111 @@
+"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 euclidean_1 = __importDefault(require("../../algorithms/euclidean"));
+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 runWASMChineseRemainder = (0, wasm_1.createWASMInvoker)("chinese-remainder", (wasmExports, remainders, modulos) => {
+    if (!wasmExports.chinese_remainder_i64 ||
+        remainders.length !== modulos.length ||
+        remainders.length === 0) {
+        return null;
+    }
+    if (remainders.some((value) => !(0, wasm_1.fitsInI64)(value)) ||
+        modulos.some((value) => value <= 0n || !(0, wasm_1.fitsInI64)(value))) {
+        return null;
+    }
+    const allocator = (0, wasm_1.createI64Allocator)(wasmExports);
+    allocator.reset();
+    const bytes = remainders.length * wasm_1.I64_BYTES;
+    const remaindersPtr = allocator.allocate(bytes);
+    const modulosPtr = allocator.allocate(bytes);
+    const view = allocator.view();
+    if (remaindersPtr === null || modulosPtr === null || !view) {
+        return null;
+    }
+    for (let index = 0; index < remainders.length; index++) {
+        view[remaindersPtr / wasm_1.I64_BYTES + index] = (0, wasm_1.normalizeI64)(remainders[index]);
+        view[modulosPtr / wasm_1.I64_BYTES + index] = (0, wasm_1.normalizeI64)(modulos[index]);
+    }
+    const result = wasmExports.chinese_remainder_i64(remaindersPtr, modulosPtr, remainders.length);
+    return result === wasm_1.MIN_I64 ? null : result;
+});
+function main(arrayOfBase, arrayOfModulo) {
+    if (arrayOfBase.length !== arrayOfModulo.length)
+        throw new Error("The length for the two given arrays should be the same.");
+    const base = arrayOfBase.map((item) => BigInt(item));
+    const modulo = arrayOfModulo.map((item) => BigInt(item));
+    const maybeWASMResult = runWASMChineseRemainder(base, modulo);
+    if (maybeWASMResult !== null) {
+        if (maybeWASMResult > BigInt(Number.MAX_SAFE_INTEGER)) {
+            throw new Error("CRT result exceeds Number.MAX_SAFE_INTEGER.");
+        }
+        return Number(maybeWASMResult);
+    }
+    for (let i = 0; i < modulo.length; i++) {
+        for (let j = i + 1; j < modulo.length; j++) {
+            if ((0, euclidean_1.default)(modulo[i], modulo[j]) !== 1n) {
+                throw new Error("All modulo values must be pairwise coprime.");
+            }
+        }
+    }
+    let modular = 1n;
+    modulo.forEach((item) => {
+        modular *= item;
+    });
+    let x = 0n;
+    for (let i = 0; i < base.length; i++) {
+        const partialModulo = modular / modulo[i];
+        const [gcd, inverse] = (0, extended_euclidean_1.default)(partialModulo, modulo[i]);
+        if (gcd !== 1n) {
+            throw new Error("Unable to compute modular inverse for CRT.");
+        }
+        const normalizedInverse = ((inverse % modulo[i]) + modulo[i]) % modulo[i];
+        x += base[i] * partialModulo * normalizedInverse;
+    }
+    const result = ((x % modular) + modular) % modular;
+    if (result > Number.MAX_SAFE_INTEGER) {
+        throw new Error("CRT result exceeds Number.MAX_SAFE_INTEGER.");
+    }
+    return Number(result);
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("chinese-remainder", async ({ ask, writeLine }) => {
+    writeLine("\tx % m1 = r1, x % m2 = r2 ... x = result");
+    writeLine(chalk_1.default.gray("\tx % 11 = 2, x % 19 = 1, x % 37 = 2. x = 2851"));
+    const { base, modulo } = await ask([
+        {
+            type: "input",
+            name: "base",
+            message: `Enter ${chalk_1.default.italic("remainders")} (comma-separated):`,
+            default: "2,1,2",
+        },
+        {
+            type: "input",
+            name: "modulo",
+            message: `Enter ${chalk_1.default.italic("modulos")} (comma-separated):`,
+            default: "11,19,37",
+        },
+    ]);
+    const remainders = String(base)
+        .split(",")
+        .map((item) => Number(item.trim()));
+    const modulos = String(modulo)
+        .split(",")
+        .map((item) => Number(item.trim()));
+    const result = main(remainders, modulos);
+    writeLine(`\tResult x = ${result}`);
+    return {
+        inputs: { remainders, modulos },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

package/build/algorithms/chinese-remainder/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/chinese-remainder/index.ts"],"names":[],"mappings":";;;;;AA4DA,uBAiDC;AAwCD,wBAEC;AAvJD,uEAA+C;AAC/C,yFAAgE;AAChE,kDAOiC;AACjC,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,uBAAuB,GAAG,IAAA,wBAAiB,EAC/C,mBAAmB,EACnB,CAAC,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE;IACnC,IACE,CAAC,WAAW,CAAC,qBAAqB;QAClC,UAAU,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;QACpC,UAAU,CAAC,MAAM,KAAK,CAAC,EACvB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IACE,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,IAAI,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC,CAAC,EACzD,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,KAAK,GAAG,UAAU,CAAC,MAAM,GAAG,gBAAS,CAAC;IAC5C,MAAM,aAAa,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;IAE9B,IAAI,aAAa,KAAK,IAAI,IAAI,UAAU,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACvD,IAAI,CAAC,aAAa,GAAG,gBAAS,GAAG,KAAK,CAAC,GAAG,IAAA,mBAAY,EAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1E,IAAI,CAAC,UAAU,GAAG,gBAAS,GAAG,KAAK,CAAC,GAAG,IAAA,mBAAY,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,MAAM,MAAM,GAAG,WAAW,CAAC,qBAAqB,CAC9C,aAAa,EACb,UAAU,EACV,UAAU,CAAC,MAAM,CAClB,CAAC;IACF,OAAO,MAAM,KAAK,cAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AAC5C,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,WAAqB,EAAE,aAAuB;IACzE,IAAI,WAAW,CAAC,MAAM,KAAK,aAAa,CAAC,MAAM;QAC7C,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAE7E,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAEzD,MAAM,eAAe,GAAG,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC9D,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;QAC7B,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,MAAM,CAAC,eAAe,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,IAAA,mBAAS,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;gBAC3C,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACtB,OAAO,IAAI,IAAI,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG,EAAE,CAAC;IAEX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,aAAa,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,IAAA,4BAAiB,EAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,iBAAiB,GAAG,CAAC,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,iBAAiB,CAAC;IACnD,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;IAEnD,IAAI,MAAM,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC;AACxB,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,mBAAmB,EACnB,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,2CAA2C,CAAC,CAAC;IACvD,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC,CAAC;IAExE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,CAAmC;QACnE;YACE,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,YAAY,CAAC,qBAAqB;YACjE,OAAO,EAAE,OAAO;SACjB;QACD;YACE,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,SAAS,eAAK,CAAC,MAAM,CAAC,SAAS,CAAC,qBAAqB;YAC9D,OAAO,EAAE,UAAU;SACpB;KACF,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;SAC5B,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;SAC3B,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEtC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACzC,SAAS,CAAC,gBAAgB,MAAM,EAAE,CAAC,CAAC;IAEpC,OAAO;QACL,MAAM,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE;QAC/B,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/chinese-remainder/index.test.js

@@ -0,0 +1,28 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const chinese_remainder_1 = __importDefault(require("../../algorithms/chinese-remainder"));
+const chalk_1 = __importDefault(require("../../shared/cli/chalk"));
+const wasm_1 = require("../../shared/testing/wasm");
+describe("Finding a number by the product of different remainders", () => {
+    test.each([
+        [[2, 1, 2], [11, 19, 37], 2851],
+        [[2, 1], [11, 19], 134],
+        [[50, 40, 30], [3, 5, 7], 65],
+        [[128, 87, 921], [13, 17, 127], 14129],
+        [[981237, 1238891], [218, 12839], 1469993],
+    ])(`%p as integers and %p as modulo\n\tnumber is ${chalk_1.default.greenBright("%p")}`, (arrayOfBase, arrayOfModulo, result) => {
+        const execute = () => (0, chinese_remainder_1.default)(arrayOfBase, arrayOfModulo);
+        expect(execute()).toEqual(result);
+        (0, wasm_1.expectSameResultWithAndWithoutWASM)(execute);
+    });
+    test.each([
+        [[1, 2], [3], "The length for the two given arrays should be the same."],
+        [[1, 2], [4, 6], "All modulo values must be pairwise coprime."],
+    ])("keeps the same error with and without WASM for %p and %p", (remainders, modulos, errorMessage) => {
+        (0, wasm_1.expectSameErrorWithAndWithoutWASM)(() => (0, chinese_remainder_1.default)(remainders, modulos), errorMessage);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/build/algorithms/chinese-remainder/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../../../source/algorithms/chinese-remainder/index.test.ts"],"names":[],"mappings":";;;;;AAAA,uFAA8D;AAC9D,+DAAuC;AACvC,gDAG+B;AAE/B,QAAQ,CAAC,yDAAyD,EAAE,GAAG,EAAE;IACvE,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC;QAC/B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC;QACvB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;QAC7B,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC;QACtC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC;KAC3C,CAAC,CACA,gDAAgD,eAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EACzE,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,EAAE;QACrC,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,IAAA,2BAAgB,EAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QAEnE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClC,IAAA,yCAAkC,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC;QACR,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,yDAAyD,CAAC;QACxE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,6CAA6C,CAAC;KAChE,CAAC,CACA,0DAA0D,EAC1D,CAAC,UAAU,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE;QACpC,IAAA,wCAAiC,EAC/B,GAAG,EAAE,CAAC,IAAA,2BAAgB,EAAC,UAAU,EAAE,OAAO,CAAC,EAC3C,YAAY,CACb,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC"}

package/build/algorithms/euclidean/index.js

@@ -0,0 +1,60 @@
+"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 runWASMGcd = (0, wasm_1.createWASMInvoker)("euclidean", (wasmExports, left, right) => {
+    if (!wasmExports.gcd_u64 ||
+        left < 0n ||
+        right < 0n ||
+        !(0, wasm_1.fitsInU64)(left) ||
+        !(0, wasm_1.fitsInU64)(right)) {
+        return null;
+    }
+    return wasmExports.gcd_u64(left, right);
+});
+function main(left, right) {
+    const wasmResult = runWASMGcd(left, right);
+    if (wasmResult !== null) {
+        return wasmResult;
+    }
+    while (right !== BigInt(0)) {
+        const cache = right;
+        right = left % right;
+        left = cache;
+    }
+    return left;
+}
+const runPrompt = (0, prompt_1.createAlgorithmPrompt)("euclidean", async ({ ask, writeLine }) => {
+    writeLine("\tGCD(left, right) = result");
+    writeLine(chalk_1.default.gray("\tGCD(614, 513) = 1"));
+    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 = main(BigInt(left), BigInt(right));
+    writeLine(`\tGCD(${left}, ${right}) = ${result}`);
+    return {
+        inputs: { left, right },
+        result,
+    };
+});
+async function prompt(options) {
+    return runPrompt(options);
+}
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../source/algorithms/euclidean/index.ts"],"names":[],"mappings":";;;;;AAwBA,uBAYC;AAiCD,wBAEC;AAvED,kDAAuE;AACvE,+DAAuC;AACvC,gDAG6B;AAE7B,MAAM,UAAU,GAAG,IAAA,wBAAiB,EAClC,WAAW,EACX,CAAC,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;IAC3B,IACE,CAAC,WAAW,CAAC,OAAO;QACpB,IAAI,GAAG,EAAE;QACT,KAAK,GAAG,EAAE;QACV,CAAC,IAAA,gBAAS,EAAC,IAAI,CAAC;QAChB,CAAC,IAAA,gBAAS,EAAC,KAAK,CAAC,EACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC1C,CAAC,CACF,CAAC;AAEF,SAAwB,IAAI,CAAC,IAAY,EAAE,KAAa;IACtD,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC3C,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,OAAO,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC;QACpB,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC;QACrB,IAAI,GAAG,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,SAAS,GAAG,IAAA,8BAAqB,EACrC,WAAW,EACX,KAAK,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,SAAS,CAAC,6BAA6B,CAAC,CAAC;IACzC,SAAS,CAAC,eAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC;IAE7C,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,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACjD,SAAS,CAAC,SAAS,IAAI,KAAK,KAAK,OAAO,MAAM,EAAE,CAAC,CAAC;IAElD,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE;QACvB,MAAM;KACP,CAAC;AACJ,CAAC,CACF,CAAC;AAEK,KAAK,UAAU,MAAM,CAAC,OAAwB;IACnD,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;AAC5B,CAAC"}