什么是Q-Day奖？

2025年4月16日，以量子计算为重点的公司项目11宣布了“ Q-Day奖”，这是一项与量子计算机打破比特币密码学的“玩具版本”的比赛。

output: A quantum computing-focused company Project 11 announced the “Q-Day Prize,” a competition to break a “toy version” of the Bitcoin network.

输出：以量子计算为重点的公司项目11宣布了“ Q-Day Prive”，这是一项打破比特币网络“玩具版本”的竞赛。

What is the Q-Day Prize?

什么是Q-Day奖？

Announced on April 16, the Q-Day Prize challenges contestants to break a toy version of the Bitcoin network using a quantum computer.

Q-Day奖在4月16日宣布，挑战参赛者使用Quantum计算机打破比特币网络的玩具版本。

Those who complete the challenge by April 5, 2026, will win 1 Bitcoin.

那些在2026年4月5日之前完成挑战的人将赢得1个比特币。

The “Q” in Q-Day stands for quantum computing, which is said to pose a threat to many existing cryptographic security measures.

Q-Day中的“ Q”代表量子计算，据说这对许多现有的加密安全措施构成了威胁。

However, Project 11 noted that breaking the Bitcoin network would be nearly impossible with current quantum computers.

但是，项目11指出，当前量子计算机几乎不可能打破比特币网络。

“This is a light-hearted initiative to highlight the capabilities and potential of quantum computing in a way that is both engaging and meaningful,” said Project 11 CEO Ari Mizner.

Project 11首席执行官Ari Mizner说：“这是一项轻松的举措，旨在以一种既吸引人又有意义的方式突出量子计算的能力和潜力。”

“We hope that this prize will inspire more people to get involved in this exciting field and contribute to the development of technologies that can benefit society as a whole.”

“我们希望该奖项将激发更多的人参与这个令人兴奋的领域，并为可以使整个社会受益的技术的发展做出贡献。”

Can quantum computers break Bitcoin?

量子计算机可以破坏比特币吗？

Bitcoin uses the SHA-256 hashing algorithm, which was developed by the National Security Agency (NSA) and is used to prevent brute force attacks.

比特币使用由国家安全局（NSA）开发的SHA-256哈希算法，用于防止蛮力攻击。

However, a new and emerging threat to SHA-256 is posed by quantum computers, which are capable of performing operations much faster than traditional computers.

但是，量子计算机对SHA-256产生了新的和新兴的威胁，量子计算机能够比传统计算机更快地执行操作。

At its core, quantum computing utilizes qubits, which can exist in superposition (multiple states) at the same time. This is in contrast to binary (traditional) computing, which uses bits that can be either 1 or 0.

量子计算以此为核心，利用了量子位，这可以同时存在于叠加（多个状态）中。这与二进制（传统）计算相反，该计算使用可以是1或0的位。

In 1994, mathematician Peter Shor presented an algorithm for quantum computers to solve complex algorithms in seconds, as opposed to the decades it would take for conventional hardware at the time.

1994年，数学家彼得·谢尔（Peter Shor）提出了一种量子计算机的算法，以在几秒钟内求解复杂算法，而不是当时传统硬件所花费的数十年。

While no hardware could effectively run it at the time, recent advances like Google Willow are now nearing that capability.

尽管当时没有硬件可以有效地运行它，但是像Google Willow这样的最新进展现在正在接近该功能。

When combined with Shor’s algorithm, quantum computers could disrupt Bitcoin cryptographic systems as we know them.

当与Shor的算法结合使用时，量子计算机可能会破坏比特币加密系统，如我们所知。

This is because Shor’s algorithm enables quantum computers to solve complex mathematical problems, such as those used in cryptography, with incredible speed, posing a potential threat to Bitcoin’s security.

这是因为Shor的算法使量子计算机能够解决复杂的数学问题，例如在加密术中使用的问题，速度令人难以置信，对比特币的安全构成了潜在的威胁。

However, Bitcoin developers are already working on creating "quantum-proof" shields using new mathematical formulas that even Shor's algorithm cannot break.

但是，比特币开发人员已经在使用新的数学公式来创建“量子防护”盾牌，甚至Shor的算法也无法破坏。