src/vendor/leemon.js
function modInt(x, n) {
  var i, c=0;
  for (i=x.length-1; i>=0; i--)
    c=(c*radix+x[i])%n;
  return c;
}
function modInt(x, n) {
  var i, c=0;
  for (i=x.length-1; i>=0; i--)
    c=(c*radix+x[i])%n;
  return c;
}
function modInt ( x , n ) { var i , c = 0 ; for ( i = x . length - 1 ; i >= 0 ; i -- ) c = ( c * radix + x [ i ] ) % n ; return c ; }
return x mod n for bigInt x and integer n.
return x mod n for bigInt x and integer n .