binary pow

const binpowCount = () => {
  let i = 0;
  return function binpow (a, b) {
    i++
    if (b === 1) {
      console.log(i)
      return a;
    }
  
    return b & 1 ? a * binpow(a, b - 1) : binpow(a, b >> 1 ) ** 2
  }
}

const binpow1 = binpowCount()
const binpow2 = binpowCount()
const binpow3 = binpowCount()
const binpow4 = binpowCount()
const binpow5 = binpowCount()

console.assert(binpow1(2, 3) === 8);
console.assert(binpow2(5, 7) === 78125);
console.assert(binpow3(6, 8) === 1679616);
console.assert(binpow4(2, 32) === 4294967296);
console.assert(binpow5(2, 52) === 4503599627370496);