Learning new things!
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 …
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 …
Related type:
TraitsResolver helps to find the implementation for a given trait function and concrete type arguments.
TraitsResolver has a function resolve_trait_function_reference (see below) for a given polynomial reference, it resolves its trait
one of the input to this polynomialReference,
using fibo_no_public example, PolynomialReference looks like:
remove_trait_implsFollowing the first post: Circle STARK: Understanding Circle Group’s Operation as Rotation
The goal of this post is to explain 2-adic FFT on circle domain.
In STARK, there are two cases where FFT is used:
A Rust program is compiled to ELF, using traditional compiler (as ELF is not only used for ZKVM, but also for embedded system as well, this step is pretty much standard)
instruction explanation:
ADD, value1 stored in address xD, added this value by 5 and store the value in x29…
Runtime refers to the period when a program is actively running or executing on a …
The goal of this blog is to explain circle group without complex mathematical definitions. However, this approach is not rigorous, it serves more like a intuition of understanding the geometry of a circle group. Before diving into the blog, may you need some pre-readings like Exploring circle STARKs or Yet …
Using multiplicative group of size 16 to demonstrate the concept of coset.
suppose we have a trace \([1,2,3,4]\) , and we want to prove \(f(x)+1=f(gx)\)
\(g\) is the group generator for cyclic group of size 4, the same size of the trace.