Time-lock puzzles are a mechanism for sending messages "to the future". A sender can quickly generate a puzzle with a solution s that remains hidden until a moderately large amount of time t has elapsed. The solution s should be hidden from any adversary that runs in time significantly less than t, including resourceful parallel adversaries with polynomially many processors.
No takes yet. Share an insight, caveat, or question.
Bitansky et al. (2016) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: