Quantum low-density parity-check codes face significant challenges in realizing efficient fault-tolerant computation due to their dense encodings. Researchers have proposed using canonical lifted product codes to address this issue, enabling logical computation with high-rate quantum codes. This approach aims to reduce the physical-qubit overhead required for encoding many logical qubits. By leveraging code-agnostic techniques such as code surgery and gate teleportation, developers can create more modular and certifiable computation methods1. The use of canonical lifted product codes has the potential to significantly improve the efficiency of quantum computing, particularly in applications where high-density encoding is necessary. This development is crucial for advancing quantum computing capabilities, which in turn threatens to upend traditional cryptography and computation assumptions. So what matters to practitioners is that this breakthrough could ultimately lead to the creation of more powerful and efficient quantum computers, forcing a reevaluation of current cryptographic standards and practices.