_deterministic-proving

If challenged, state transitions are replayable and verified onchain.

To achieve this, Arbitrum compiles the State Transition Function (STF) into different formats:

• Execution mode: Uses Go's native compiler for high-performance execution on validator nodes.

• Proving mode: Compiles to WebAssembly (WASM), which transforms into WebAssembly for Arbitrum Virtual Machine (WAVM) for fraud-proof verification.