eidS Lab — research on verifiable computingVerifiable computing is the field of making any program prove what it actually did. Alongside its result, the program produces a small cryptographic proof of the computation — often much smaller and faster to verify than the computation itself. Anyone can check the proof without re-running the program, and without trusting the hardware that ran it.The Knowledge Complexity of Interactive Proof-SystemsGoldwasser, Micali, Rackoff·STOC 1985Read↗A Survey of Interactive Verifiable ComputingAngold J. Wang·WeidS Lab, 2025Read↗.

Computation that proves itself

◇ INSTRUMENT

#include <wrappers>

int main() {

Traced<int> sum = 0;

for (int i = 0; i < 10; ++i)

sum += i * i;

return sum.value();

}

#include away from proving your code

◇ RUN + PROVE

Native speed, no trusted setup

◇ VERIFY

result 285

proof 0x7f1c…b903 1.2 KB · 8 ms

Succinct proof, verified in milliseconds

Find us

Questions, collaborations, or curious about Wrappers?