Sidechain開發人員Starkware和Weizmann科學研究所聲稱為多個比特幣腳本限制創建了解決方法。

根據最近的一份研究論文，新設計聲稱允許以更高的資本效率方式部署比特幣上的複雜智能合約。

Researchers from Weizmann Institute of Science and StarkWare have reportedly created a workaround for multiple Bitcoin script limitations, aiming to enable the deployment of complex smart contracts on the blockchain in a more capital-efficient manner.

據報導，來自魏茲曼科學與史塔克斯（Starkware）研究所的研究人員已經為多個比特幣腳本限制創建了一個解決方法，旨在以更高的資本效率如何在區塊鏈上部署複雜的智能合約。

The new system, named ColliderVM, is also claimed to be vastly more efficient from a computing point of view. It may also pave the way for the use of Scalable Transparent Arguments of Knowledge (STARKs) on Bitcoin without requiring consensus-level changes to the network.

從計算的角度來看，新系統（名為ColliderVM）也被認為更有效。它也可能為在比特幣上使用可擴展的透明知識參數（Starks）鋪平了道路，而無需對網絡的共識級別更改。

The architecture would allow Bitcoin to verify complex offchain computations using minimal onchain data. It is also capable of handling multi-step processes that are executed over multiple transactions.

該體系結構將允許比特幣使用最小的OnChain數據驗證複雜的離鏈計算。它還能夠處理在多個交易中執行的多步驟過程。

Each Bitcoin block can contain up to 4 million OPCodes (commands) across all transactions, and a single Bitcoin script can contain up to 1,000 stack elements (data entries).

每個比特幣塊都可以包含所有交易中最多400萬個Opcodes（命令），並且單個比特幣腳本最多可包含1,000個堆棧元素（數據輸入）。

Furthermore, stateless execution means that each script executes without memory of previous state or intermediate computations from earlier transactions, making complex computations nearly impossible.

此外，無狀態執行意味著每個腳本在不對先前狀態或中間交易中的中間計算內存執行，從而使復雜的計算幾乎不可能。

The researchers argue that ColliderVM could allow the use of STARKs — a type of zero-knowledge proof — on Bitcoin without requiring consensus-level changes to the network. The architecture would let Bitcoin verify complex offchain computations with minimal onchain data.

研究人員認為，ColliderVM可以允許在比特幣上使用Starks（一種零知識證明），而無需對網絡的共識級變化。該體系結構將使比特幣使用最小的OnChain數據來驗證複雜的離子計算。

ColliderVM: A new system for capital-efficient smart contracts on Bitcoin

ColliderVM：一種用於比特幣資本效率智能合約的新系統

Earlier research from 2023 by Robin Linus from Bitcoin research firm ZeroSync explored the possibility of using fraud proofs to enable the efficient execution of complex smart contracts on Bitcoin.

比特幣研究公司Robin Linus從2023年開始的較早研究探索了使用欺詐證據來有效執行比特幣上複雜的智能合約的可能性。

This approach, named BitVM, required operators to front capital for potential corrective actions in case of fraud. In the BitVM system, operators pay an advance to cover potentially fraudulent transactions, recovering the capital after the fraud-proof window closes.

這種名為BITVM的方法要求操作員在欺詐時進行糾正措施。在BITVM系統中，運營商支付了預付款，以涵蓋潛在的欺詐性交易，並在防欺詐窗口關閉後恢復了資本。

The new system is also more efficient from a computing point of view, compared with previous implementations, but still expensive. Previous implementations used cryptographic one-time signatures (Lamport and Winternitz) that were notably computationally heavy.

與以前的實現相比，從計算的角度來看，新系統也更有效，但仍然昂貴。以前的實現使用了一個密碼的一次性特徵（Lamport和Winternitz），這些特徵在計算上顯得較重。

ColliderVM draws from the November 2024 ColliderScript paper by researchers from StarkWare, Cloudflare and Bitcoin sidechain developer Blockstream. This system relies on a hash collision-based commitment setting a challenge to produce an input that, when run through a hash function, produces an output with pre-determined features.

ColliderVM從2024年11月的ColliderScript論文中汲取了Starkware，Cloudflare和Bitcoin Sidechain開發人員BlockStream的研究人員。該系統依賴於基於哈希碰撞的承諾設定挑戰，以產生輸入，該輸入通過哈希功能運行時會產生具有預定功能的輸出。

This setup requires significantly fewer computing resources from honest operators than from malicious actors.

與惡意演員相比，這種設置需要從誠實運營商那裡的計算資源要少得多。

Computational resources needed by honest and malicious actors depending on collision difficulty. | Source: ColliderVM paper

誠實和惡意參與者所需的計算資源取決於碰撞困難。 |資料來源：ColliderVM紙

A hash is a non-reversible mathematical function that can be run on arbitrary data, producing a fixed-length alphanumeric string. Non-reversible means that it is impossible to run the computation in reverse to obtain the original data from a hash. This results in a sort of data ID identifying data to the bit, without containing any underlying data.

哈希是一種非可逆數學函數，可以在任意數據上運行，產生固定長度字母數字字符串。非可逆性意味著不可能反向運行計算以從哈希獲得原始數據。這會導致某種數據ID將數據識別到位，而無需包含任何基本數據。

This system — somewhat resembling Bitcoin (BTC) mining — requires significantly fewer hash operations compared to BitVM, reducing both script size and processing time. ColliderVM researchers claim to have reduced the number of those operations even further, by at least a factor of 10,000.

與BITVM相比，該系統（有點像比特幣（BTC）挖掘）所需的哈希操作要少得多，從而減少了腳本大小和處理時間。 ColliderVM的研究人員聲稱，這些操作的數量將進一步減少至少10,000倍。

The researchers suggest that this implementation is nearly making a STARKs-based Bitcoin sidechain practical. The paper notes that STARKs are a ZK-proof system recognized for their scalability and trustless nature (no trusted setup is needed).

研究人員認為，這種實施幾乎使基於鮮明的比特幣Sidechain實用。紙張指出，Starks是一種以其可擴展性和無信任性（不需要值得信賴的設置）認可的ZK-PROFFROD系統。

STARKs: A trustless and scalable ZK-proof system

Starks：一個無信任且可擴展的ZK-PON-PO-PONS SYSTEM

Many early ZK-proof systems required a one-time secure setup that relied on “toxic waste” data. If a party were to keep hold of the toxic waste, it would allow them to forge signatures and generate fraudulent proofs. STARKs do not rely on such a setup, making them trustless.

許多早期的ZK-PROFFROD系統需要一次性安全設置，以依靠“有毒廢物”數據。如果一方要抓住有毒廢物，則可以使他們偽造並產生欺詐性證據。 Starks並不依賴於這樣的設置，使其無信任。

Traditional implementation of STARK verifiers would require scripts that exceed Bitcoin’s limits. Now, researchers behind ColliderVM argue that their more efficient system approaches make an onchain verification script for STARK-proofs “nearly practical.”

Stark驗證者的傳統實現將需要超過比特幣限制的腳本。現在，ColliderVM背後的研究人員認為，他們更有效的系統方法使“幾乎實用”的鮮明驗證腳本“幾乎實用”。

Bitcoin is widely considered the most secure and reliable blockchain, but its critics often point out that its feature set is significantly more limited when compared to many altcoins. Sidechains such as Blockstream’s Liquid exist, but are not trustless.

比特幣被普遍認為是最安全，最可靠的區塊鏈，但其批評家通常指出，與許多AltCoins相比，其功能集更加有限。存在諸如Blockstream的液體之類的側鏈，但並非沒有信任。

Director of research at blockchain firm Blockstream and mathematician Andrew Poelstra told Cointelegraph as far back as 2020 that ZK-proof-based systems are “one of the most exciting areas of development” in the cryptography space. Cypherpunk, a developer cited in the Bitcoin white paper and Blockstream founder, explained in a 2014 paper that more work was needed to implement trustless ZK-proof-based sidechains on Bitcoin.

區塊鏈公司Blockstream和數學家Andrew Poelstra的研究總監告訴Cointelegraph，早在2020年，基於ZK-Progroof的系統是加密領域中“最令人興奮的開發領域之一”。在比特幣白皮書和Blockstream創始人中引用的開發人員Cypherpunk在2014年的一份論文中解釋說，需要更多的工作來實施基於ZK-Progronvice ZK-PROFFARE的SIDECHAINS上的比特幣。

Still, even 10 years later, a system based on ColliderVM would be trust-minimized rather than trustless. This is because users would still need to trust that at least a minimal subset of network participants will act honestly to ensure the correct functioning of the system.

儘管如此，即使在十年後，基於Collidervm的系統將被信任最小而不是信任。這是因為用戶仍然需要相信，至少一個網絡參與者的最小子集將誠實地採取行動，以確保系統的正確功能。

The study’s lead authors include Eli Ben

該研究的主要作者包括Eli Ben