Re:Time, Randomness, and a $100k Prize to Forever Change Blo...
by justindrake on Thursday August 01, 2019 @06:09PM
(#20588846)
One efficient verification scheme is by Benjamin Wesolowski (see academic paper [here](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...
Re:Time, Randomness, and a $100k Prize to Forever Change Blo...
by gchamonlive on Thursday August 01, 2019 @07:52PM
(#20589485)
Specifically, I compute y = x^(2^N) mod M using N modular squarings, how do you verify the result?