The paper introduces a novel approach to fault-tolerant quantum computing called "algorithmic fault tolerance," which significantly reduces the space-time cost of large-scale quantum computations. The authors demonstrate that for a broad class of quantum error correction (QEC) codes, including the surface code with magic state inputs and feed-forward operations, fault-tolerant logical operations can be performed with constant time overhead. This is achieved by combining transversal operations and novel strategies for correlated decoding, even with only partial syndrome information. The key idea is to consider the fault tolerance of the algorithm as a whole, leveraging the deterministic propagation of errors through transversal Clifford circuits. The authors prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance, and they support their findings with circuit-level simulations. This work provides a theoretical foundation for reducing the space-time volume of practical fault-tolerant quantum computation by orders of magnitude.The paper introduces a novel approach to fault-tolerant quantum computing called "algorithmic fault tolerance," which significantly reduces the space-time cost of large-scale quantum computations. The authors demonstrate that for a broad class of quantum error correction (QEC) codes, including the surface code with magic state inputs and feed-forward operations, fault-tolerant logical operations can be performed with constant time overhead. This is achieved by combining transversal operations and novel strategies for correlated decoding, even with only partial syndrome information. The key idea is to consider the fault tolerance of the algorithm as a whole, leveraging the deterministic propagation of errors through transversal Clifford circuits. The authors prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance, and they support their findings with circuit-level simulations. This work provides a theoretical foundation for reducing the space-time volume of practical fault-tolerant quantum computation by orders of magnitude.