3 ms·
What is the algorithm for verifying the VDF output? Specifically, I compute y = x^(2^N) mod M using N modular squarings, how do you verify the result?
by mpreda 7y ago
What is the algorithm for verifying the VDF output?
Specifically, I compute y = x^(2^N) mod M using N modular squarings, how do you verify the result?
- justindrake 7y agoOne efficient verification scheme is by Benjamin Wesolowski (see academic paper [here](https://eprint.iacr.org/2018/623.pdf) https://eprint.iacr.org/2018/623.pdf)). The scheme is surprisingly simple and fits on just one slide. See https://www.youtube.com/watch?v=zqL_cMlPjOI&feature=youtu.be&t=652 https://www.youtube.com/watch?v=zqL_cMlPjOI&feature=youtu.be...
- narush 7y agoHead's up -- your link is broken. I don't think markdown is supported :)
- gchamonlive 7y ago> https://eprint.iacr.org/2018/623.pdf https://eprint.iacr.org/2018/623.pdf