Succinctness currently is taken with respect to the number of rounds r. However, it reads more easily to talk about succinctness with respect to the chain size |C|. In particular, we want to say that the NIPoPoW proof size will be \tilde{O}(1) wrt |C| i.e. O(polylog(|C|)).
Succinctness currently is taken with respect to the number of rounds
r. However, it reads more easily to talk about succinctness with respect to the chain size|C|. In particular, we want to say that the NIPoPoW proof size will be\tilde{O}(1)wrt|C|i.e.O(polylog(|C|)).