Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
] ≤ negl Special Soundness (Strong Version aka Knowledge Extractability): For every (x, w) in the language L, there exists a polynomial-time algorithm E (the extractor) such that the witness w can be extracted from valid conversations with the prover P and the verifier V. That is, ∀(x,w) ∈ L , ∃ E