Hacker News Reader

Hey All!

We're one of the sponsors of this competition. Please let us know if you have any questions!

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?

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...

Head's up -- your link is broken. I don't think markdown is supported :)

> https://eprint.iacr.org/2018/623.pdf

Have you considered the impact of superconducting circuitry? They're very niche and few people have heard of them, but they're not science fiction[1] and have a significant speed advantage.

[1] https://www.hypres.com/ seems to sell them

Reply on news.ycombinator.com