Time-Locked Cryptography (farlow.dev)

Interesting 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.