BitVM
Smart Contracts● Common
A computing paradigm enabling Turing-complete smart contracts on Bitcoin through optimistic execution and fraud proofs. The prover commits to program execution; if challenged, the dispute is resolved through a bisection protocol finding the first incorrect step.
Technical Notes
Uses Taproot trees with pre-signed challenge-response transactions. Binary search through execution trace requires O(log n) on-chain transactions for n steps. BitVM2 improves efficiency with SNARK verification. Enables trustless two-way pegs for sidechains.
Metadata
Visibility: Public
Created:1/3/2026by System