什麼是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的算法也無法破壞。