10 questions · need 7/10 to pass.
Q1.When applying "Polynomial arithmetic over finite fields" in practice, which of these holds?
single
Q2.Which statement about how "Groups, generators, and the discrete logarithm problem" actually works is correct?
single
Q3.Which definition of "Fields and finite fields F_p" matches what the module established?
single
Q4.When applying "The random oracle model" in practice, which of these holds?
single
Q5."Commitment schemes — hiding and binding" — which of these claims is supported by the module?
single
Q6.For "Pedersen commitments", which detail or constraint from the module is accurate?
single
Q7.Which of these correctly identifies the role of "Groups, generators, and the discrete logarithm problem" in the broader system?
single
Q8.Which fact about "The Schwartz–Zippel lemma (fingerprinting)" matches the mechanism the module covered?
single
Q9.Which statement about how "Hash-based commitments" actually works is correct?
single
Q10.For "Fields and finite fields F_p", which detail or constraint from the module is accurate?
single