Learning new things!
run_stage function is called in prove function, prover.
it takes a stage as input, as stage is defined as:
AirStage is defined as
it seems to have all the info to run a stage
back to the first picture,
stage0 is like this
The first place the challenger is called is in stark.rs prove function:
in circuit_builder.rs in plonky3, the ConstraintSystem has a field: challenges_by_stage, can check how this field is built.
in stark.rs, the constraintSystem is initialized from a pil file
Data struct has a challenges field, and has a get …
contains the proof info, the interesting part is the commitments, in the verification function, there will be commitments[0], commitments[1],commitments[2] represent the commitment of pre-process trace, witness trace and lookup trace commitments. namely, they only have three root commitments, every root commitment should …
need to get more detailed understanding of the concept of publics, isn’t it just some of the witness get revealed before the proving step?
following this …
this statemachine example has component with different degrees:
StateTRansitionEval is the evaluation function, coordinate mark the number of the Eval
statemachine 0 has just two numbers, the mix_into put these numbers in to channel
statemachine 1 aslo implement the mix_into function, and mix all …
Canonical coset:
odd coset setup
CirclePointIndex is just a wrapper of usize, which represent actually the order of the coset generator.
when creating a new coset, we need a generator and shiftoffset, the shiftoffset mostly be the generator of the subgroup of one log size bigger
so here, CirclePointIndex::subgroup_gen is …
Trace table looks like this:
| a_wire | a_val | b_wire | b_val | c_wire | c_val | multiplicity |
| 0 | 1 | 1 | 1 | 2 | 2 | 2 |
| 1 | 1 | 2 | 2 | 3 | 3 | 2 |
| 2 | 2 | 3 | 3 | 4 | 5 | 1 |
| 3 |