A curated list of resources around BitVM

BitVM is a computing paradigm to express Turing-complete Bitcoin contracts. This requires no changes to the network’s consensus rules.

Committing to a large program in a Taproot address requires significant amounts of off-chain computation and communication, however the resulting on-chain footprint is minimal. As long as both parties collaborate, they can perform arbitrarily complex, stateful off-chain computation, without leaving any trace in the chain. On-chain execution is required only in case of a dispute.

• Complex smart contracts
• Prediction Markets
• Privacy
• Multisig
• 2WP for sidechains

• BitVM Whitepaper
• BitVM Online
• bitcoin-dev BitVM: Compute Anything on Bitcoin
• BitVM Primer
• BitVM Toy Implementation
• BitVM FAQ
• Simple Explanation of BitVM
• BitVM and MATT
• Script, Taproot and BitVM
• Things bitvm needs
• BitVM vs RGB
• Nand Game
• BitVM Illustrated
• BitVM Builders - Telegram group
• Bitcoin Script Interpreter
• BitVM and sCrypt
• STARK proof for BitVM circuit execution
• BitVM in Spanish
• BitVM Transaction Graph
• Ultimate BitVM Guide
• Unnamed Noncustodial Inchoate Sidechains On Bitvm (Unisob)

BitVM operates on a simple yet powerful architecture involving two principal actors: the Prover and the Verifier. The Prover is the party that initiates a computation or claim, essentially saying, “Here’s a program, and here’s what I assert it will do or produce.” The Verifier, on the other hand, is responsible for validating that claim. This dual-role system enables a level of checks and balances, ensuring that the computational results are both accurate and trustworthy.

The ingenuity of BitVM lies in its handling of computational workloads. Unlike conventional blockchain operations, which put significant computational burdens on-chain, BitVM performs most of its complex calculations off-chain. This drastically reduces the amount of data that needs to be stored directly on the Bitcoin blockchain, enhancing efficiency and lowering costs. This off-chain methodology also provides greater speed and flexibility, as developers or users can run intricate programs or simulations without worrying about overwhelming the blockchain.

However, BitVM does employ on-chain verification when needed, especially in cases of disputes. Should the Verifier question the legitimacy of the Prover’s claim, the system will then refer to the unalterable, decentralised ledger of the Bitcoin blockchain to resolve the issue. This is accomplished through what are known as “Fraud Proofs.”

If the Prover’s claim turns out to be false, the Verifier can submit a concise fraud proof to the blockchain, thereby exposing the dishonesty. This not only settles the dispute but also maintains the overall integrity of the system. By integrating both off-chain computations and on-chain verifications, BitVM has struck a balance that offers both computational efficiency and robust security.

Optimistic Rollups are a Layer 2 scaling solution for blockchains that enable more efficient computation and data storage by performing most operations off-chain while maintaining the same level of security as on-chain transactions. The fundamental idea is to assume that all transactions are correct (“optimistic”) unless proven otherwise. Only if a dispute arises is the relevant data and computation published and verified on the main blockchain. This significantly reduces the amount of data that has to be stored on-chain, thereby freeing up space and lowering transaction fees.

In BitVM, Optimistic Rollups can be particularly beneficial. Recall that BitVM primarily works with two parties: a Prover and a Verifier. Most of the computational work happens off-chain, reducing the amount of data that needs to be stored on the Bitcoin blockchain. When a transaction is initiated, BitVM can use Optimistic Rollups to bundle multiple off-chain transactions into a single on-chain transaction, further reducing the blockchain footprint.

Moreover, in the event of a dispute, BitVM’s use of fraud proofs dovetails well with the “challenge-response” system inherent in Optimistic Rollups. If the Prover makes a false claim, the Verifier can quickly expose the dishonesty by providing a succinct fraud proof. This fraud proof would then be scrutinised within the Optimistic Rollup framework, and if validated, the dishonest party would be penalised.

• The Big Deal with BitVM: Arbitrary Computation Now Possible on Bitcoin Without a Fork
• BitVM: But Can It Run DOOM?
• The Protocol: Bitcoin Might Get Ethereum-Style Smart Contracts Under ‘BitVM’ Plan
• BitVM: A Computational Revolution in Bitcoin
• Bitcoin Smart Contracts and BitVM
• Is BitVM the Next Evolution for Smart Contracts on Bitcoin?
• Bitcoin’s Fifteen Years Of Evolution: A Look Beyond the Original Whitepaper
• Lightning Network explainer
• Base58 explainer
• BitVM Slides by Cartesi
• Deep dive into BitVM -Computing paradigm to express Turing-complete Bitcoin contracts
• Bitcoin BitVM: What is it?, exactly?
• What is BitVM? And why does it matter to rollups?
• 2024 Crypto Market Outlook by Coinsbase Institutional
• Introduce sCrypt: a Layer-1 Smart Contract Framework for BTC
• Exploring the Landing Paths for Bitcoin Layer 2 Ecosystem

• What is BitVM?
• BitVM Intro: Create Logic Gates and Circuits in Python
• BitVM 8 bit CPU: Write Bitcoin programs in Assembly
• Demo of Robin Linus's implementation of bitvm
• BitVM 8 bit CPU: Assembly Quirks
• How bitvm works: from logic gates to an 8bit cpu for bitcoin
• S15 E13: Robin Linus on BitVM & Permissionless Bitcoin Development
• Robin Linus on BitVM
• BitVM: A Tool for Smarter Smart Contracts

• Bitcoin compiler in C++
• BitVM Toy Implementation
• BitVM in Rust
• LogicGates: Logical gates in Python for different scenarios on BitVM (Phython)
• SHA256 WASM
• BLAKE3 WASM
• RIPEMD160 WASM
• Elftrace
• rv32i to BitVM
• Toy BitVM RS
• Tapleaf Circuits

• BitLDC (Bitcoin Life/Death Certificate) Protocol
• ASM to Bin
• Citrea
• Bitstake: A proof of stake bridge based on BitVM