From Curves
to Constraints
Five experiments connect elliptic-curve groups, a running arithmetic example, R1CS, QAP divisibility, and the anatomy of a Groth16 proof. Every calculation is local; no server, dependencies, or external calls.
1. Add points in a finite-field group
The curve is y² = x³ − x + 1 over F₁₇. Choose any two curve points and advance through the exact modular group law. The field grid is discrete: there is no continuous Euclidean chord here.
2. Turn a function into three constraints
Compute x³ + x + 5 over F₁₀₁. Observe each gate, which wires are private, and the separate public claim y. Changing a value changes the truth of the statement.
3. Inspect every R1CS row
Edit the witness values independently. This is deliberate: the witness is a proposed assignment, not necessarily an honest execution. Each row checks (A · z) × (B · z) = (C · z) in F₁₀₁.
4. Turn many row checks into divisibility
Rows 1, 2, 3 become the interpolation points t = 1, 2, 3. Interpolate Aᶻ(t), Bᶻ(t), Cᶻ(t), form P(t), then divide by Z(t) = (t−1)(t−2)(t−3). All coefficients are in F₁₀₁.
5. Explore the Groth16 pairing identity
A mathematically faithful exponent-level shadow of the Groth16 verification equation, over F₁₀₁. Change the prover's randomizers or the verifier's public input to see what stays invariant and what breaks.
Pause at the named chapter, make the default example succeed, then deliberately break an input. Click Next to replay the conceptual chain. The companion does not replace the narration or implement a real prover. The essay walks the same chapters, including the experiments and the caveat that this Groth16 panel is a scalar-exponent shadow with visible trapdoors, not a cryptographic implementation.