BitVM: Innovation Without a Soft Fork
summary
Explains how BitVM uses an optimistic computation model to verify SNARKs on Bitcoin, why Bit VM2 moves from a general computational trace to an application-specific SNARK verifier, and how Lamport-style linking and on-chain chunking enable trust-minimized bridges and rollups. Gives cost numbers qualitatively — direct SNARK verification on-chain is currently huge, Bit VM keeps most cost off-chain unless challenged — and covers alternatives: Bitcoin PoW grinding, OP_CAT / covenants, and private-scaling via ZK coins.
AI-written summary · about
chapters (9)
- 0:00Introduction to the Panel Discussion
- 3:07Introduction to Bit BVM
- 6:15Introduction to BBM2
- 9:05Bit VM and the Verification of SNARKs
- 12:19Using Bitcoin Proof of Work for Grinding
- 14:57Progress on Bit VM and the Future of Privacy and Throughput
- 18:16The Cost of Stark Verification
- 21:00The Future of BVM
- 24:11Changes and Impact on Bitcoin Applications
related talks
20mRobin Linus Presents BitVM3
24mThe Bitcoin Virtual Machine Breakthrough Nobody Saw Coming
17mBitVM3, Binohash vs soft forks
26mHow to Build Rollups on Bitcoin
34mBuilding Secure and Watchtower efficient Bitcoin Payment Channels with BitVMX
41mThe Future Is Trustless: How ZkVMS And ZkTLS Transform Bug
28mEvolution of Optimistic Rollup proofs
39mPrivacy and Evolution of SNARKs