Not a Monad Tutorial

Lambdaclass's blog about distributed systems, machine learning, compilers, operating systems, security and cryptography.

zero knowledge proofs

Champagne SuperNova, incrementally verifiable computation

Introduction In the lasts posts we've been writing about proving systems and incremental verifiable computation: * Pinocchio Virtual Machine: Nearly Practical Verifiable Computation * Decentralized private computation: ZEXE and VERI-ZEXE * Incrementally verifiable computation: NOVA Incremental proof systems offer some advantages over conventional proving systems: * They do not require static bounds on loop
5 min read