3 ms·
You do have other options, you can build your PoW on repeated squarings instead.
by fabiospampinato 3y ago
You do have other options, you can build your PoW on repeated squarings instead.
- lucb1e 3y agoNot sure I understand. Numbers in JavaScript can't hold infinitely large numbers, so after a few squarings using x*x or Math.pow(x, 2) you're at float max (or at least lost some precision, breaking the proof) and would need to resort to custom code again rather than a hardware-accelerated browser-native operation.
- tromp 3y agoHe's talking about repeated squarings in a modular field, like integers mod N where N is the product of two large primes.