Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |
For each ε(0 ≤ ε 0, there are (fn, n)- grates (see Definition 1) of size linear in n, where fn(x):= c1 ċ n2 x ≤ c2 ċ n/0 otherwise