Robin Linus Presents BitVM3
summary
BitVM3 replaces the bulky BitVM2 SNARK verifier with a garbled-circuit verifier that cuts worst‑case on‑chain dispute data from megabytes to kilobytes: an 8 kilobytes assert / 200 bytes disprove footprint instead of ~6 MB. It preserves the 1-of-n honest security model (optimistic SNARK verification plus slashing) and uses conditional disclosure of secrets to turn an invalid SNARK into a simple hash preimage fraud proof. Off‑chain garble size (Liam Egan’s ~20 MB scheme) and setup costs remain the main tradeoffs.
AI-written summary · about
chapters (15)
- 0:00Making Bitcoin Better Money with Bridges
- 0:28Why Bitcoin Needs Bridges
- 1:21The Problem with Multisig & Collateralized Bridges
- 2:29The Core Bridge Challenge: Getting BTC Back Safely
- 3:13SNARKs + BitVM = Trust-Minimized Withdrawals
- 4:04BitVM History & Optimistic SNARK Verification
- 6:12BitVM2 Limitations & the Birth of BitVM3
- 7:09Garbled Circuits Revolution
- 10:20Conditional Disclosure of Secrets Explained
- 11:48How Garbled Circuits Actually Work (AND Gate Demo)
- 14:44Building a Full SNARK Verifier Circuit
- 17:1120 MB Breakthrough Scheme
- 17:36Remaining Challenges & Needed Bitcoin Upgrades
- 18:42Summary: BitVM3 is the Future of Bitcoin L2s
- 19:01Final Thanks & Outlook
related talks
28mBitVM: Innovation Without a Soft Fork
17mBitVM3, Binohash vs soft forks
24mThe Bitcoin Virtual Machine Breakthrough Nobody Saw Coming
34mBuilding Secure and Watchtower efficient Bitcoin Payment Channels with BitVMX
13mJeremy Season
25mGemini: Elastic SNARKs for Diverse Environments
23mSonic: Nearly Trustless SNARK Setups
39mPrivacy and Evolution of SNARKs