Time-Locked Puzzle (TLP) and timed-release encryption (T-RE) are both time-based locking mechanisms. The former requires the decryptor to perform a predetermined amount of computation, while the latter requires a trusted server to release the decryption information after a preset time, thereby sending information to the future. As research has progressed, many feature-rich TLPs and TREs have emerged. However, TLP and TRE still face issues in practical deployment. The imbalance in computation load with TLP can result in significant computational burdens in many deployment scenarios, while the timed release in TRE necessitates that the server remains online. To address these issues, our goal is to develop a multifunctional solution to offload the computational burden and allow the server to be offline. Our scheme focuses on RSA-based TLPs and builds upon the sequential TRE schemes proposed by Chvojka and Jager et al.(ESORICS’21). We construct a multi-timeline scheme that aggregates multiple functions and allows the server to be offline. The multi-timeline structure proposed in our scheme, consisting of a main timeline, sub-timelines, and reward timelines, allows different timelines to assume different functions, and the main timeline controls the information release of the remaining timelines to achieve an efficient puzzle-solving release mechanism. The reward timeline provides a transfer account for storing bonuses for entities that solve puzzles, which achieves a self-balancing mechanism for computing resources. Due to the completion of a transaction guaranteed by the adaptor signature and smart contract, which ensure the atomicity of the transaction, the scheme achieves a traceable fair trading mechanism and a public verification mechanism.