BA-12 · LESSON 05

BitVM

BitVM-style systems use commitments, challenge games, and Bitcoin-enforced disputes to verify computations without adding general execution to consensus.

35 min Difficulty 3/5 Not started

VISUAL MODEL

See the whole mechanism before going step by step

Use the diagrams to orient yourself. Then the guided explanation below teaches every part in depth.

4 explanatory views

CONCEPT-SPECIFIC MAP · data commitmentExternal meaning is anchored to exact Bitcoin bytesSelect any state to inspect its exact role.

RELATIONSHIP MAPOrdered validation pipeline

01
PAYLOADTyped external meaning
An application defines a payload, event, inscription, or token instruction.
02
ENCODECanonical bytes
Ordering, lengths, tags, and version rules must be unambiguous.
03
COMMITBitVM
The BitVM mechanism places or commits those bytes in a Bitcoin transaction.
04
BITCOINValid transaction
Bitcoin nodes enforce only Bitcoin consensus rules for the carrier transaction.
05
INDEXReconstructed state
Application software scans the chain and applies its own versioned state-transition rules.

Rule shown: Bitcoin validates transaction bytes and Script; indexers apply additional protocol meaning deterministically.

STAGE 1 OF 5PAYLOAD: Typed external meaning

An application defines a payload, event, inscription, or token instruction.

Governing relationship: Bitcoin validates transaction bytes and Script; indexers apply additional protocol meaning deterministically. Complete path: 1. PAYLOAD, Typed external meaning. An application defines a payload, event, inscription, or token instruction. 2. ENCODE, Canonical bytes. Ordering, lengths, tags, and version rules must be unambiguous. 3. COMMIT, BitVM. The BitVM mechanism places or commits those bytes in a Bitcoin transaction. 4. BITCOIN, Valid transaction. Bitcoin nodes enforce only Bitcoin consensus rules for the carrier transaction. 5. INDEX, Reconstructed state. Application software scans the chain and applies its own versioned state-transition rules.

1. State transitionWhat exists, what changes, and what results

BEFORE

Trace states 0 through 4 follow x = 2x + 1 except the prover's transition from state 2 to 3. The prover commits a Merkle root, both sides lock 600 units, challenge height is…

MECHANISM

Both parties agree on program, input, state-transition rule, and expected trace format so one step can be checked unambiguously.

AFTER

Interactive bisection reduces a long disagreement to one committed transition, but membership, the one-step rule, authorization, deadline, and locked-value settlement still d…

Text equivalent: Starting from Trace states 0 through 4 follow x = 2x + 1 except the prover's transition from state 2 to 3. The prover commits a Merkle root, both sides lock 600 units, challenge height is 40, and response deadline is height 46. The mechanism begins when Both parties agree on program, input, state-transition rule, and expected trace format so one step can be checked unambiguously. The resulting lesson is Interactive bisection reduces a long disagreement to one committed transition, but membership, the one-step rule, authorization, deadline, and locked-value settlement still decide the dispute.

2. Mechanism pathSelect a stage to inspect its job

STAGE 1 OF 5

Define deterministic computation

Both parties agree on program, input, state-transition rule, and expected trace format so one step can be checked unambiguously.

Complete path: 1. Define deterministic computation: Both parties agree on program, input, state-transition rule, and expected trace format so one step can be checked unambiguously. 2. Commit to the trace: The prover constructs hash or Merkle commitments to intermediate states without placing the full execution on Bitcoin. 3. Challenge a result: A verifier detecting an invalid claim opens a dispute within a deadline and identifies a region where committed states disagree. 4. Bisect interactively: The parties reveal commitments at midpoints, repeatedly narrowing the disputed interval until one transition remains. 5. Adjudicate on Bitcoin: A precommitted Script path checks the selected transition, signatures, hashes, and timeouts, then awards or slashes locked value according to the design.

3. Rule and failure boundaryWhat accepts the result and where it can stop

ACCEPTED PATH

Bisection must isolate the committed transition, both Merkle proofs and authorization must verify, the one-step Script must match the claimed rule, the response must meet its deadline, and payout must conserve locked value.

CHANGED CONDITION

A mutated proof, invalid signature, late response, or honest isolated transition awards the bounded dispute to the prover; only a timely proven bad step awards the verifier.

Important distinction: BitVM turns Bitcoin Script into a general-purpose virtual machine that executes any program directly. The heavy computation and trace stay off chain. Bitcoin adjudicates committed disputes under a specific protocol and available Script primitives.

Text equivalent: The accepted path is enforced by Bisection must isolate the committed transition, both Merkle proofs and authorization must verify, the one-step Script must match the claimed rule, the response must meet its deadline, and payout must conserve locked value. If the required condition changes, A mutated proof, invalid signature, late response, or honest isolated transition awards the bounded dispute to the prover; only a timely proven bad step awards the verifier.

Loading lesson visuals...

Learn the idea

BitVM-style proposals seek to enforce outcomes of off-chain computation through commitments and an interactive dispute game, while Bitcoin Script checks only a small disputed step. A prover commits to an execution trace, a verifier challenges a claimed error, and repeated narrowing identifies one transition for on-chain adjudication. Designs, opcode assumptions, bridges, and operator models vary and remain proposal-specific.

GUIDED EXPLANATION1/5 ideas inspected

Define deterministic computation

Both parties agree on program, input, state-transition rule, and expected trace format so one step can be checked unambiguously.

The worked example follows the explanation

Inspect every idea above to open it.

Important distinction“BitVM turns Bitcoin Script into a general-purpose virtual machine that executes any program directly.”

The heavy computation and trace stay off chain. Bitcoin adjudicates committed disputes under a specific protocol and available Script primitives.

FINISH LEARNING FIRST

The questions unlock after every required learning activity

Inspect every guided idea, open the worked example, rebuild its mechanism, and complete the deterministic lesson tool. Your progress is saved automatically.