Grammar of PAPER

<aside> 💡 How can instances overwrite a previous or conflicting witness declaration? When can you declare witnesses before?

</aside>

Execution Phases

Two phases:

• setup phase
  • generate circuit and R1cs
• prover phase
  • witness, instance assignment is made and task of prover is to compute a valid assignment to all witness variables of circuit
  • either used as proof for proper circuit execution, or used as input to generate a proof of some zk proof system

Modern circuit languages do both phases in the background, so developer does not have to worry about writing two pieces of code and instead just writing one that will be used in both phases

• compilers abstract the phases and provide interphase

Setup phase

• compile to graphical circuit representation

After derived circuit, it can be executed in prover phase

• generate a valid assignment.

The assignment is then interpreted as constructive proof for a knowledge claim in the proof system (R1CS, PLONK, QAP)

<aside> 💡 What is purpose of a circuit compiler?

It does all the work for these two phases: setup and prover. Generates a graphical circuit representation, then generates valid assignment by executing in that circuit, then interpret it for a specified proof system.

Can the setup and prover phase be agnostic with any proof system? Like can the graphical representation be flexible for any proving system?

</aside>

Setup Phase

Braincompiling