SNARKs for NP can't be built from falsifiable assumptions in a black-box way

Parallel repetition preserves zero-knowledge

Using Fiat-Shamir, we can only make constant round protocols non-interactive

Correlation Intractability for function f can be achieved by a publicly efficient function if the input is fixed-length and f has a fixed running time

Random oracle for fixed-length input can be instantiated by a publicly computable efficient function

In a somewhere statistically binding commitment, the prover chooses the index at which the commitment is statistically binding