Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | BitVM: Compute Anything on Bitcoin |
|---|---|
| What the text proposes | A way to dispute an arbitrary computation between two Bitcoin parties using hashlocks, timelocks and large Taproot trees, without a new opcode. Honest execution stays off-chain. A false claim can be challenged on-chain. It is not a global virtual machine. |
| Who may write | Robin Linus |
| What is settled | The prover commits to a circuit, gate by gate, inside Taproot leaves. |
| Load-bearing assumption | No consensus change is required, and none is granted. Miners do not learn a new opcode. |
| What this library says afterwards | A commitment to a circuit is not an implementation of a bridge. The paper says bridging is a possible application, not a completed one. |
| Rights | Official external source only |