@gkucmierz/utils 1.7.0 → 1.9.0

package/package-lock.json

@@ -1,12 +1,12 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.7.0",
+  "version": "1.9.0",
   "lockfileVersion": 2,
   "requires": true,
   "packages": {
     "": {
       "name": "@gkucmierz/utils",
-      "version": "1.7.0",
+      "version": "1.9.0",
       "license": "MIT",
       "devDependencies": {
         "husky": "^8.0.1",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gkucmierz/utils",
-  "version": "1.7.0",
+  "version": "1.9.0",
   "description": "Usefull functions for solving programming tasks",
   "main": "src/main.mjs",
   "scripts": {

package/spec/mod.spec.mjs

@@ -0,0 +1,35 @@
+
+import {
+  mod,
+  modBI,
+} from '../src/mod.mjs';
+
+describe('mod', () => {
+  it('mod', () => {
+    expect(mod(4, 100)).toEqual(4);
+    expect(mod(104, 100)).toEqual(4);
+    expect(mod(4 - 100, 100)).toEqual(4);
+  });
+
+  it('mod sign', () => {
+    expect(mod(4, 100)).toEqual(4);
+    expect(mod(-4, 100)).toEqual(96);
+    expect(mod(4, -100)).toEqual(-96);
+    expect(mod(-4, -100)).toEqual(-4);
+  });
+});
+
+describe('mod BI', () => {
+  it('mod', () => {
+    expect(modBI(4n, 100n)).toEqual(4n);
+    expect(modBI(104n, 100n)).toEqual(4n);
+    expect(modBI(4n - 100n, 100n)).toEqual(4n);
+  });
+
+  it('mod sign', () => {
+    expect(modBI(4n, 100n)).toEqual(4n);
+    expect(modBI(-4n, 100n)).toEqual(96n);
+    expect(modBI(4n, -100n)).toEqual(-96n);
+    expect(modBI(-4n, -100n)).toEqual(-4n);
+  });
+});

package/spec/tonelli-shanks.spec.mjs

@@ -0,0 +1,15 @@
+
+import {
+  tonelliShanksBI,
+} from '../src/tonelli-shanks.mjs';
+
+describe('tonelli-shanks', () => {
+  it('tonelliShanksBI', () => {
+    const a = 8479994658316772151941616510097127087554541274812435112009425778595495359700244470400642403747058566807127814165396640215844192327900454116257979487432016769329970767046735091249898678088061634796559556704959846424131820416048436501387617211770124292793308079214153179977624440438616958575058361193975686620046439877308339989295604537867493683872778843921771307305602776398786978353866231661453376056771972069776398999013769588936194859344941268223184197231368887060609212875507518936172060702209557124430477137421847130682601666968691651447236917018634902407704797328509461854842432015009878011354022108661461024768n;
+    const p = 30531851861994333252675935111487950694414332763909083514133769861350960895076504687261369815735742549428789138300843082086550059082835141454526618160634109969195486322015775943030060449557090064811940139431735209185996454739163555910726493597222646855506445602953689527405362207926990442391705014604777038685880527537489845359101552442292804398472642356609304810680731556542002301547846635101455995732584071355903010856718680732337369128498655255277003643669031694516851390505923416710601212618443109844041514942401969629158975457079026906304328749039997262960301209158175920051890620947063936347307238412281568760161n;
+    const r = tonelliShanksBI(a, p);
+
+    expect((r * r) % p).toEqual(a);
+  });
+
+});

package/src/mod.mjs

@@ -0,0 +1,14 @@
+
+// python like mod implementation
+
+const getMod = ZERO => {
+  return (dividend, divisor) => {
+    if ((dividend < ZERO) ^ (divisor < ZERO)) {
+      return divisor - (-dividend % divisor);
+    }
+    return dividend % divisor;
+  };
+};
+
+export const mod = getMod(0);
+export const modBI = getMod(0n);

package/src/tonelli-shanks.mjs

@@ -0,0 +1,44 @@
+
+import {
+  powModBI,
+} from './pow-mod.mjs';
+
+/* Takes as input an odd prime p and n < p and returns r
+ * such that r * r = n [mod p]. */
+export const tonelliShanksBI = (n, p) => {
+  let s = 0n;
+  let q = p - 1n;
+  while ((q & 1n) === 0n) {
+    q /= 2n;
+    ++s;
+  }
+  if (s === 1n) {
+    const r = powModBI(n, (p+1n) / 4n, p);
+    if ((r * r) % p === n) return r;
+    return 0n;
+  }
+  // Find the first quadratic non-residue z by brute-force search
+  let z = 1n;
+  while (powModBI(++z, (p-1n)/2n, p) !== p - 1n);
+  let c = powModBI(z, q, p);
+  let r = powModBI(n, (q+1n)/2n, p);
+  let t = powModBI(n, q, p);
+  let m = s;
+  while (t !== 1n) {
+    let tt = t;
+    let i = 0n;
+    while (tt !== 1n) {
+      tt = (tt * tt) % p;
+      ++i;
+      if (i === m) return 0n;
+    }
+    let b = powModBI(c, powModBI(2n, m-i-1n, p-1n), p);
+    let b2 = (b * b) % p;
+    r = (r * b) % p;
+    t = (t * b2) % p;
+    c = b2;
+    m = i;
+  }
+  if ((r * r) % p === n) return r;
+  return 0n;
+};