MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups

ePrint Report: MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups

Zijing Di, Lucas Xia, Wilson Nguyen, Nirvan Tyagi

Proofs for machine computation allow for proving the correct execution of arbitrary programs that operate over fixed instruction sets (e.g., RISC-V, EVM, Wasm). A standard approach for proving machine computation is to prove a universal set of constraints that encode the full instruction set at each step of program execution. This approach incurs prover cost per execution step on the order …

computation eprint report evm machine nguyen report standard wasm