10 questions · need 7/10 to pass.
Q1.Which statement about how "Hash-based commitments" actually works is correct?
single
Q2.Which fact about "Catch a Lying Prover With One Random Point (Schwartz-Zippel)" matches the mechanism the module covered?
single
Q3."Seal a Value Now, Prove It Later (Commitments)" — which of these claims is supported by the module?
single
Q4.For "Why Proofs Do Their Math in Finite Fields", which detail or constraint from the module is accurate?
single
Q5.For "Commitments You Can Add Together (Pedersen)", which detail or constraint from the module is accurate?
single
Q6.Which definition of "Why Proofs Do Their Math in Finite Fields" matches what the module established?
single
Q7.Which statement about how "Easy One Way, Impossible the Other (Discrete Log)" actually works is correct?
single
Q8.When applying "Pretending the Hash Is Truly Random (Random Oracle Model)" in practice, which of these holds?
single
Q9.Which of these correctly identifies the role of "Easy One Way, Impossible the Other (Discrete Log)" in the broader system?
single
Q10.When applying "Why Proof Systems Turn Everything Into Polynomials" in practice, which of these holds?
single