No. Timelocked enforces “do this much work” rather than “unlock at this exact date and time”. The actual duration depends on the machine that unlocks it and its current conditions, such as power mode, thermal throttling, and background load.

Because CPU clock speeds have improved slowly since the early 2000s, the delay should not usually shrink dramatically on a modern desktop. Still, calibrate conservatively if timing matters.

Timelocked turns a file or message into a locked package (a file ending in .timelocked). Anyone can copy and keep that package, but opening it requires making a computer do a long, step-by-step calculation. Because each step depends on the previous one, there is no practical way to “skip ahead” and open it early.

Technically, the lock phase generates a random symmetric key K, encrypts the original file/message with AEAD using XChaCha20-Poly1305, and stores the ciphertext in the timelocked file payload. K is then time-locked using an RSW-style repeated-squaring time-lock puzzle parameterized by T iterations. unlock performs the sequential work to recover K, then decrypts the payload back to the exact original bytes. Reed-Solomon error correction is added to protect against some file corruption.

Faster computers with higher CPU frequencies can do the required work faster, so the “delay” can be shorter on very powerful hardware. However, CPU clock speeds have improved slowly since the early 2000s. If your use case is important, choose a conservative delay and add a safety margin.

Quantum computers are especially relevant to some problems, including factoring. If large, practical quantum computers become available, they may be able to recover the secret factors used by the time-lock puzzle and unlock files much faster.

The goal is for the only realistic way to open a .timelocked file early to be doing the same long computation required by normal unlocking. There is not supposed to be a clever trick that jumps to the end.

Timelocked is designed so there is no known practical shortcut to recover the cryptographic key K faster than the required sequential work, for the chosen parameters and assumptions. It is based on Rivest, Shamir, and Wagner’s 1996 paper Time-lock puzzles and timed-release crypto.

Important nuance:

• Timelocked protects confidentiality and integrity of the content.
• It does not stop copying, deleting, or withholding the .timelocked file.
• If an attacker tampers with file bytes, integrity checks (AEAD) should make unlock fail explicitly.

The creator already has the original content at creation time. If they keep a copy, or share the key some other way, they can read it immediately.

Timelocked is meant to delay access for someone who only has the .timelocked file, including the creator if they delete the original content and do not keep the key.

Timelocked is not a backup service. If you lose both the original file/message and the .timelocked file, the content is gone.

If you lose the original but still have the .timelocked file, you can unlock later and recover the original.

If you lose the .timelocked file but still have the original, you still have your content; you just do not have the timelocked copy anymore.

If it matters, keep multiple backups of the .timelocked file and the Timelocked portable apps.

Sometimes, yes.

Timelocked v1 stores the encrypted payload with Reed-Solomon redundancy, so some limited damage in the payload region can be repaired during recovery. This is meant to help with a small amount of storage corruption or transmission damage.

Important limits:

• Recovery is not guaranteed for arbitrary corruption.
• The file can only be repaired when the damage stays within the stored redundancy budget.
• The recovery metadata also has to remain usable. Timelocked stores two authoritative superblock copies, so it can survive some damage there too.
• If the file is too damaged, Timelocked fails explicitly rather than silently producing wrong bytes.

In practice: minor corruption may be recoverable, but Timelocked is not a substitute for keeping backups.

Encryption keeps the content private until the unlock work is done. AEAD adds a tamper-evident seal: if the .timelocked file is corrupted or modified, Timelocked can detect that and fail loudly instead of producing wrong output.

AEAD (Authenticated Encryption with Associated Data) is required because it provides both:

• Confidentiality: protects content from being read before K is recovered.
• Integrity/authenticity (with respect to K): detects tampering and corruption.

This is important for Timelocked files because:

• A time-lock puzzle enforces delay, but does not prevent an attacker from modifying bytes in the timelocked file.
• Without AEAD, modified ciphertext could produce silent bit flips in recovered output.
• Timelocked files are portable, offline, and long-lived; data may be moved or stored for years, so corruption/tampering detection is critical.
• With chunked encryption, AEAD tags and associated data can bind chunk index and relevant header context to prevent chunk swapping/reordering attacks.

In short: the time-lock controls when K is obtained; AEAD ensures decrypted output is the exact original bytes once K is obtained.