Learning new things!
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 …
An extension field \( \mathbb{F}_{q^m} \) is constructed by extending a smaller field \( \mathbb{F}_q \) (the base field) with additional elements, typically through the introduction of a root of an irreducible polynomial over \( \mathbb{F}_q \).
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 …
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…