Suffix proofs optimization comment
dionyziz opened this issue · comments
We use the notation Q(\epsilon^{|C| - k}\chi). However, this is not explained. Add a textual explanation for this notation and also mention that in an actual implementation, the verifier would only look at \chi and never really construct a fake |C| - k-long prefix.