A prover is the participant who executes a program with secret and public values, publishes the claimed output, and generates evidence that the computation was followed. section 15.3.9
A prover’s constrained workflow includes:
- Compute the output from secret value a and public values b and w. section 15.3.9
- Represent the computation as polynomials whose coefficients include inputs, intermediate values, and outputs. section 15.3.9
- Fill only the polynomial components corresponding to hidden values, leaving the verifier to supply the remaining parts. section 15.3.9
- Evaluate hidden polynomial components at a random point concealed in the exponent. section 15.3.9
A constrained polynomial step
For f(1) = a × (b + 3) – m, the prover contributes aL1(x) and mO1(x), so evaluation at the hidden random point represents the secret-dependent terms without revealing a or m. section 15.3.9
