Table 2 Comparison of VDFs. For simplity, all times are assumed to be bounded by a constant factor, where T and \(\lambda\) are the delay parameter and security parameter, respectively
From: Verifiable delay functions and delay encryptions from hyperelliptic curves
VDF | Setup | Eval | Verify | Proof size |
|---|---|---|---|---|
Wesolowski’s VDF (Wesolowski 2020) | \(\lambda ^3\) | \((1+\frac{2}{\log T})T\) | \(\lambda ^4\) | \(\lambda ^3\) |
Pietrzak’s VDF (Pietrzak 2019) | \(\lambda ^3\) | \((1+\frac{2}{\sqrt{T}})T\) | \(\log T\) | \(\lambda ^3\) |
Leo’s VDF (Loe et al. 2022) | \(\lambda ^3\) | T | 1 | – |
Isogeny VDF (De Feo et al. 2019) | \(T \log \lambda\) | T | \(\lambda ^4\) | – |
This work | \(T \log \lambda\) | T | \(\lambda ^4\) | – |