チャマス・パリハピティヤ氏、量子コンピューティングの進歩によりビットコイン（BTC）暗号化は2～5年以内に解読される可能性があると予測

ベンチャーキャピタル会社ソーシャル・キャピタルの創設者兼最高経営責任者（CEO）であるチャマス・パリハピティヤ氏は、ビットコイン（BTC）暗号が最終的に解読される可能性のあるタイムラインを提示した

Venture capitalist Chamath Palihapitiya has offered a possible timeline for when Bitcoin's (CRYPTO: BTC) encryption might finally be cracked, given the ongoing advancements in quantum computing.

ベンチャーキャピタリストのチャマス・パリハピティヤ氏は、量子コンピューティングの進歩が続いていることを踏まえ、ビットコイン（CRYPTO：BTC）の暗号化が最終的に解読される可能性のある時期を示唆した。

This projection follows Alphabet's (NASDAQ:GOOGL) (NASDAQ:GOOG) announcement of Willow, a quantum computing chip with 105 qubits.

この予測は、アルファベット (NASDAQ:GOOGL) (NASDAQ:GOOG) が 105 量子ビットを備えた量子コンピューティング チップ Willow を発表したことに続くものです。

What Happened: Palihapitiya, the founder and CEO of venture capital firm Social Capital, believes that the encryption framework underpinning Bitcoin—SHA-256—could be cracked in the next two to five years due to progress in quantum computing, as he stated during the All-In Podcast, published on December 13.

何が起こったのか：ベンチャーキャピタル会社ソーシャルキャピタルの創設者兼最高経営責任者（CEO）であるパリハピティヤ氏は、量子コンピューティングの進歩により、ビットコインを支える暗号化フレームワークであるSHA-256が今後2～5年以内に解読される可能性があると信じていると述べた。 All-In ポッドキャスト、12 月 13 日に公開されました。

“I had to figure out how long it will take us to crack the encryption standards we use for Bitcoin. We need about 8000 chips to break SHA-256. We’re in the 2-5 year shot clock for chains reimplementing new hashing algorithms,” Palihapitiya said.

「ビットコインに使用されている暗号化標準を解読するのにどれくらいの時間がかかるかを把握する必要がありました。 SHA-256 を解読するには約 8000 個のチップが必要です。チェーンが新しいハッシュアルゴリズムを再実装するには、2～5 年はかかるだろう」とパリハピティヤ氏は語った。

A key development in this area is Willow, which Palihapitiya claims could accelerate the timeline for breaking the cryptographic standards that secure Bitcoin and other digital currencies.

この分野における重要な開発は Willow であり、パリハピティヤ氏は、これによりビットコインやその他のデジタル通貨を保護する暗号規格の破りのスケジュールが加速する可能性があると主張しています。

While the technology to achieve this level of quantum computing is still in its early stages, Palihapitiya suggested that the chip is a significant step toward achieving this capability. However, he acknowledged that substantial challenges, particularly in scaling the technology, still lie ahead.

このレベルの量子コンピューティングを実現する技術はまだ初期段階にあるが、パリハピティヤ氏は、このチップはこの機能の実現に向けた重要な一歩であると示唆した。しかし、特にテクノロジーの拡張において、大きな課題が依然として待ち受けていることを同氏は認めた。

The investor noted that Bitcoin and other blockchain networks must adapt rapidly, potentially reimplementing core cryptographic frameworks at a foundational level.

同投資家は、ビットコインやその他のブロックチェーンネットワークは迅速に適応する必要があり、コア暗号フレームワークを基礎レベルで再実装する可能性があると指摘した。

At the same time, Palihapitiya expressed optimism about the future of the cryptocurrency space, noting that advances in quantum computing could lead to the development of new encryption methods resistant to quantum attacks.

同時にパリハピティヤ氏は、量子コンピューティングの進歩が量子攻撃に耐性のある新しい暗号化方式の開発につながる可能性があると指摘し、暗号通貨空間の将来について楽観的な見方を表明した。

Bitcoin Crackdown Debate: Interestingly, not all crypto industry players believe that quantum computing poses an immediate threat to Bitcoin.

ビットコイン取り締まりの議論: 興味深いことに、すべての暗号通貨業界関係者が、量子コンピューティングがビットコインに差し迫った脅威をもたらすと信じているわけではありません。

In an X post on December 14, Ki Young Ju, the founder of onchain cryptocurrency analysis platform CryptoQuant, stated that Bitcoin is unlikely to be compromised within this decade.

オンチェーン暗号通貨分析プラットフォーム CryptoQuant の創設者である Ki Young Ju 氏は、12 月 14 日の X への投稿で、ビットコインがこの 10 年以内に侵害される可能性は低いと述べました。

If Bitcoin’s encryption is cracked, a blueprint from its anonymous founder, Satoshi Nakamoto, could provide a potential solution.

ビットコインの暗号化が解読された場合、匿名の創設者サトシ・ナカモトの青写真が潜在的な解決策を提供する可能性がある。

In a June 2010 BitcoinTalk post, Satoshi suggested that if SHA-256 were ever compromised, the community could agree on the last valid blockchain snapshot and continue using a new hash function.

2010 年 6 月の BitcoinTalk の投稿で、サトシ氏は、SHA-256 が侵害された場合、コミュニティが最後の有効なブロックチェーン スナップショットについて合意し、新しいハッシュ関数を使用し続けることができると示唆しました。

“If SHA-256 became completely broken, I think we could come to some agreement about what the honest blockchain was before the trouble started, lock that in and continue from there with a new hash function,” Satoshi said.

「SHA-256が完全に壊れたとしても、問題が始まる前に誠実なブロックチェーンが何であるかについてある程度の合意に達し、それを固定して、そこから新しいハッシュ関数を使用して続行できると思います」とサトシ氏は述べた。

On the other hand, some industry人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士人士

一方で、一部の業界人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人人