Computation Timeline

Computation timeline describe the logical operations linked to the joint computing environments and, they do not carry an expiration date. However, each specific instance of a computation automatically expires once it has been executed. In addition, a computation can include a defined time window within which it must be executed. This window is represented by two timestamps:

1. one indicating the earliest possible time for execution

2. one marking the latest time it can be processed

If the Eligible From timestamp of a computation is set for a future moment, the computation remains in the mempool until that time arrives. Conversely, if this timestamp has already passed, the computation is ready for execution.

The Eligible Until timestamp works similarly—if this time is still in the future, the computation remains executable, but if it has passed, the computation is considered expired and is no longer eligible for execution. If no validity window is defined, the default setting is for the Eligible From timestamp to be zero, and the Eligible Until timestamp to be infinite, allowing the computation to be executed at any time.

It’s important to note that these validity rules only affect computations in the active mempool. In cases where computations are interdependent, these relationships override the execution time windows.