{"repo":"AbdelStark/collidervm","free":true,"listed":false,"github":"https://github.com/AbdelStark/collidervm","clone":"git clone https://github.com/AbdelStark/collidervm.git","description":"ColliderVM: Stateful Computation on Bitcoin without Fraud Proofs","language":"Rust","stars":18,"topics":["bitcoin","bitvm","fraud-proofs","starks","zero-knowledge-proofs"],"license":"MIT","category":"blockchain-web3","readme_excerpt":"ColliderVM Executable Rust prototype for exploring stateful computation on Bitcoin with presigned Taproot flows and hash-prefix collision puzzles. ColliderVM is a research prototype inspired by the ColliderVM paper. It turns the core idea into runnable code: find a nonce for an input x , select a presigned flow d = H(x r) B , then spend through Taproot scripts that verify the same hash-prefix commitment while checking a split toy computation. This repository is intentionally narrow. It is useful for understanding, testing, and extending the protocol mechanics. It is not a bridge, not a production ColliderVM implementation, and not mainnet-ready wallet software. What It Demonstrates - Taproot script construction for a two-step toy program: F1(x) = x 100 and F2(x) = x F1 - F2 - final spend . - Script dry-run tests for valid and invalid input consistency. Protocol Shape The demo uses small parameters so it runs locally: Parameter Demo value Meaning --- ---: --- L 4 Flow set size is 2^L = 16 B 16 Hash prefix size checked by the scripts Expected honest work 2^(B-L) = 4096 hashes Average nonce search cost Valid input range 100 A₿del ∞/21M 💻 📖 🤔 Stephen 💻 Phạm Xuân Trung 💻 Maciej Kamiński @ StarkWare 💻 This project follows the all-contributors specification.","default_branch":null,"files":null,"tree":[],"storefront":"/r/AbdelStark","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/AbdelStark/collidervm/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}