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 …
in backend/plonly3/stark.rs
there is a challenge test, to run it with trace logging, use the below command:
RUST_LOG=trace cargo test --features plonky3 --package powdr-backend --lib -- plonky3::stark::tests::challenge --exact --show-outputmore info comes out like:
to see a logging from a specific module add the module name in the …
contains width(the number of columns) and preprocessed_trace(what is this used for?)
it extend the AirBuilder trait, which is the main trait, by adding the function to get public values
it has many functions like these: to help user build air constraints
The main function return M, …
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 …
add these to workspace dependencies
tracing = "0.1.37"
tracing-forest = "0.1.6"
tracing-subscriber = "0.3.17"add tracing subscriber to dependencies, namely, the dependencies should have these three
tracing.workspace = true
tracing-subscriber = { workspace = true, features = ["std", "env-filter"] }
tracing-forest = { workspace = true, features 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 …
An isomorphism is a structure-preserving map between two algebraic structures, such as groups, rings, or fields, that demonstrates their equivalence in terms of their structure. If two structures are isomorphic, they are essentially the same in terms of their algebraic properties, even if …
A polynomial field, also called a finite field or Galois field, is a field constructed by taking polynomials over a smaller field and reducing them modulo an irreducible polynomial. It is used to create fields with more elements than the base field.
A …