No Timeless Shortcut: Why Completed Block Time Cannot Contain Irreducible Computation

Any continuous completed block time (where all truths co-exist timelessly as actually true) forces consequential outcomes to exist without generative realization creating logical contradiction with threshold computational irreducibility (e.g., Sudoku constraint-resolution work). The proof is domain-neutral and blocks common escapes. We establish axioms about foundational versus consequential truth, derive strengthening lemmas, then prove that continuous completion forces logical contradiction. The result creates a trilemma: one must deny threshold irreducibility, deny completed block time, or accept that the block contains performed computation.