CleVer: A compute-and-leave anonymous verification framework for general purpose computation

Verifiable computation is essential for ensuring correctness in decentralized systems, yet existing approaches rely heavily on circuit-based proofs, task decomposition, or trusted hardware, which introduce high overhead and limit generality. To address these challenges, we propose CleVer, a compute-and-leave anonymous verification framework for general-purpose computation. CleVer avoids circuit-based proof generation by using snapshot-based state transitions, enabling single-step dispute resolution without task decomposition. We design a cumulative staking incentive mechanism that guarantees profitability for honest verifiers and enforces bounded finality under adversarial budgets. Furthermore, we introduce an anonymous verifier protocol to prevent targeted attacks and collusion. Security is analyzed under a formal threat model, and experiments demonstrate that CleVer significantly reduces verification rounds and on-chain burden compared with existing optimistic-verification frameworks. Our results show that CleVer provides an efficient, incentive-aligned, and privacy-preserving foundation for scalable off-chain computation.