Skip to main content

Verifiable Computation

Definition

Verifiable computation is a cryptographic technique that allows a party to execute a computation and produce a proof that the computation was performed correctly. This proof can then be efficiently verified by another party without needing to re-execute the entire computation. It is essential for building trustless systems where computational integrity is paramount. This enables verification without direct observation of the process.