marsenne_primes_primality_test.js

const M = (n, verbose = false) => {
  const steps = n - 2;
  const prime = 2n ** BigInt(n) - 1n;
  verbose && console.log('prime: ', prime);
  let s = 4n;
  for (let i = 0; i < steps; ++i) {
    s = (s ** 2n - 2n) % prime;
    verbose && console.log(i, s);
  }
  return s === 0n;
};

M(67, true);