Interactive: run a VDF, live
This runs the exact construction from how it works — real BigInt squaring, a real Wesolowski proof, and real verification, computed live in your browser. Nothing here is precomputed or mocked.
- A demo-sized (512-bit) RSA modulus is generated the moment this page loads — see the honest note about why that’s not a trusted setup.
- Pick an input
xand a delayTwith the slider, then Eval — watch the live counter and timer whileTsequential squarings run. - Generate the proof — at demo scale this costs about as much sequential work as Eval did; how it works explains why production systems avoid that.
- Verify — takes milliseconds, regardless of how large
Twas. Try verifying a tamperedytoo, to see it get rejected.
Generating a demo-sized RSA modulus…
N = (512-bit, generated right here in your browser). This is not a trusted setup — this page generated its own p and q, so it knows the group's order and could cheat if it wanted to. A real deployment needs either an honest multi-party trusted-setup ceremony on a much larger modulus, or a class group (no trusted setup needed at all) — see how it works.
y
π (proof)
Sources: implements the construction derived on how it works.