logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-09 09:13:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Working

Browse Source
This commit is contained in:
wborgeaud 2022-02-14 09:53:33 +01:00
parent 2e008eac23
commit b0de3328c1
4 changed files with 22 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
plonky2/src/iop/generator.rs
View File

@ -158,6 +158,22 @@ impl<F: Field> GeneratedValues<F> {
}
pub fn set_target(&mut self, target: Target, value: F) {
if target
== Target::Wire(Wire {
gate: 42,
input: 54,
})
{
dbg!(value);
}
if target
== Target::Wire(Wire {
gate: 41,
input: 34,
})
{
dbg!(value);
}
self.target_values.push((target, value))
}

4
starky/src/constraint_consumer.rs
View File

@ -150,7 +150,7 @@ impl<F: RichField + Extendable<D>, const D: usize> RecursiveConstraintConsumer<F
constraint: ExtensionTarget<D>,
) {
let filtered_constraint = builder.mul_extension(constraint, self.lagrange_basis_first);
self.constraint(builder, filtered_constraint);
self.constraint_wrapping(builder, filtered_constraint);
}
/// Add one constraint, but first multiply it by a filter such that it will only apply to the
@ -161,6 +161,6 @@ impl<F: RichField + Extendable<D>, const D: usize> RecursiveConstraintConsumer<F
constraint: ExtensionTarget<D>,
) {
let filtered_constraint = builder.mul_extension(constraint, self.lagrange_basis_last);
self.constraint(builder, filtered_constraint);
self.constraint_wrapping(builder, filtered_constraint);
}
}

1
starky/src/fibonacci_stark.rs
View File

@ -191,6 +191,7 @@ mod tests {
public_inputs,
&mut TimingTree::default(),
)?;
verify(stark, proof.clone(), &config)?;
recursive_proof::<F, C, S, C, D>(stark, proof, &config, true, true)
}

3
starky/src/proof.rs
View File

@ -16,6 +16,7 @@ use rayon::prelude::*;
use crate::config::StarkConfig;
// TODO: Permutation polynomials.
#[derive(Debug, Clone)]
pub struct StarkProof<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const D: usize> {
/// Merkle cap of LDEs of trace values.
pub trace_cap: MerkleCap<F, C::Hasher>,
@ -56,6 +57,7 @@ impl<const D: usize> StarkProofTarget<D> {
}
}
#[derive(Debug, Clone)]
pub struct StarkProofWithPublicInputs<
F: RichField + Extendable<D>,
C: GenericConfig<D, F = F>,
@ -110,6 +112,7 @@ pub(crate) struct StarkProofChallengesTarget<const D: usize> {
}
/// Purported values of each polynomial at the challenge point.
#[derive(Debug, Clone)]
pub struct StarkOpeningSet<F: RichField + Extendable<D>, const D: usize> {
pub local_values: Vec<F::Extension>,
pub next_values: Vec<F::Extension>,