Recent research indicates that building a quantum computer capable of breaking elliptic-curve cryptography (ECC) is becoming less resource-intensive than previously thought. Two whitepapers detail significant advancements in quantum computing capabilities. One study illustrates the use of neutral atoms as qubits, allowing a quantum computer to crack 256-bit ECC in just 10 days while requiring 100 times less overhead than earlier estimates. Meanwhile, a team from Google claims to break ECC securing cryptocurrencies like Bitcoin in under nine minutes, achieving a 20-fold reduction in resource needs. These findings signal substantial progress in cryptographically relevant quantum computing (CRQC). Innovations are largely driven by new quantum architectures that enhance the reliability of quantum computers, even in error-prone environments. The research also highlights improved algorithms that optimize Shor's algorithm, which demonstrates that quantum computers can solve problems like ECC and RSA in cubic time, a stark contrast to the exponential time needed by classical computers. Despite the promising results, neither paper has undergone peer review. Brian LaMacchia, a noted cryptography engineer, emphasizes that while these studies do not pinpoint an exact timeline for practical CRQC, they underscore the ongoing advancements in both qubit development and quantum algorithms. The steady progress continues to suggest that the path toward a functional CRQC is solid, with no signs of a slowdown in momentum.