Item Q4: What certifies resource-separated computational futurity?

FAF can name and quote a later market computation, but the current type has no resource-indexed process state and proves no separation between present naming and present possession of the quoted result. A later index alone does not show that a bounded present reasoner has not already performed the computation.

What is missing: a minimal execution or evaluation relation with an explicit present resource bound, a later resource bound, and a certificate that the later computation is unavailable at the former and available at the latter. It must not relabel a total presently computable function as a future agent. This is model and formalization debt; it is the computational half of the successor comparator's precondition.