code: function be(Ce,Ne,je){je.negative=Ne.negative^Ce.negative;var Le=0|Ce.length+Ne.length;je.length=Le,Le=0|Le-1;// Peel one iteration (compiler can't do it, because of code complexity)
  var ze=0|Ce.words[0],De=0|Ne.words[0],Me=ze*De,Ue=67108863&Me,Fe=0|Me/67108864;je.words[0]=Ue;for(var He=1;He<Le;He++){for(var Ke=Fe>>>26,qe=67108863&Fe,Ve=Math.min(He,Ne.length-1),Ge=Math.max(0,He-Ce.length+1),Ye;Ge<=Ve;Ge++)Ye=0|He-Ge,ze=0|Ce.words[Ye],De=0|Ne.words[Ge],Me=ze*De+qe,Ke+=0|Me/67108864,qe=67108863&Me;// Sum all words with the same `i + j = k` and accumulate `ncarry`,
  // note that ncarry could be >= 0x3ffffff
  je.words[He]=0|qe,Fe=0|Ke}return 0==Fe?je.length--:je.words[He]=0|Fe,je.strip()}
docs: Number of trailing zero bits