2 ms·Time-Locked Cryptography4 points by lispybanana 9mo agoyepchaos 9mo agoInteresting post. Normally, modular exponentiation is O(log e) via binary exponentiation. By setting the exponent to 2^t, u can force the operation to be sequential.