mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-07 00:03:10 +00:00
Merge branch 'main' into partial_witness_vec
# Conflicts: # src/iop/challenger.rs
This commit is contained in:
commit
213de80a3a
@ -367,9 +367,9 @@ mod tests {
|
|||||||
generate_partial_witness(
|
generate_partial_witness(
|
||||||
&mut witness,
|
&mut witness,
|
||||||
&generators,
|
&generators,
|
||||||
130,
|
gate.num_wires(),
|
||||||
100,
|
1,
|
||||||
100,
|
1,
|
||||||
&mut TimingTree::default(),
|
&mut TimingTree::default(),
|
||||||
);
|
);
|
||||||
|
|
||||||
|
|||||||
@ -400,7 +400,7 @@ mod tests {
|
|||||||
..CircuitConfig::default()
|
..CircuitConfig::default()
|
||||||
};
|
};
|
||||||
let mut witness = PartialWitness::new(1 << 14, config.num_wires, 1000);
|
let mut witness = PartialWitness::new(1 << 14, config.num_wires, 1000);
|
||||||
let mut builder = CircuitBuilder::<F, 4>::new(config);
|
let mut builder = CircuitBuilder::<F, 4>::new(config.clone());
|
||||||
let mut recursive_challenger = RecursiveChallenger::new(&mut builder);
|
let mut recursive_challenger = RecursiveChallenger::new(&mut builder);
|
||||||
let mut recursive_outputs_per_round: Vec<Vec<Target>> = Vec::new();
|
let mut recursive_outputs_per_round: Vec<Vec<Target>> = Vec::new();
|
||||||
for (r, inputs) in inputs_per_round.iter().enumerate() {
|
for (r, inputs) in inputs_per_round.iter().enumerate() {
|
||||||
@ -413,9 +413,9 @@ mod tests {
|
|||||||
generate_partial_witness(
|
generate_partial_witness(
|
||||||
&mut witness,
|
&mut witness,
|
||||||
&circuit.prover_only.generators,
|
&circuit.prover_only.generators,
|
||||||
130,
|
config.num_wires,
|
||||||
1000,
|
circuit.common.degree(),
|
||||||
1000,
|
circuit.prover_only.num_virtual_targets,
|
||||||
&mut TimingTree::default(),
|
&mut TimingTree::default(),
|
||||||
);
|
);
|
||||||
let recursive_output_values_per_round: Vec<Vec<F>> = recursive_outputs_per_round
|
let recursive_output_values_per_round: Vec<Vec<F>> = recursive_outputs_per_round
|
||||||
|
|||||||
@ -576,7 +576,7 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
|
|||||||
gate_instances: self.gate_instances,
|
gate_instances: self.gate_instances,
|
||||||
public_inputs: self.public_inputs,
|
public_inputs: self.public_inputs,
|
||||||
marked_targets: self.marked_targets,
|
marked_targets: self.marked_targets,
|
||||||
max_virtual_target_index: self.virtual_target_index,
|
num_virtual_targets: self.virtual_target_index,
|
||||||
};
|
};
|
||||||
|
|
||||||
// The HashSet of gates will have a non-deterministic order. When converting to a Vec, we
|
// The HashSet of gates will have a non-deterministic order. When converting to a Vec, we
|
||||||
|
|||||||
@ -136,7 +136,8 @@ pub(crate) struct ProverOnlyCircuitData<F: Extendable<D>, const D: usize> {
|
|||||||
pub public_inputs: Vec<Target>,
|
pub public_inputs: Vec<Target>,
|
||||||
/// A vector of marked targets. The values assigned to these targets will be displayed by the prover.
|
/// A vector of marked targets. The values assigned to these targets will be displayed by the prover.
|
||||||
pub marked_targets: Vec<MarkedTargets<D>>,
|
pub marked_targets: Vec<MarkedTargets<D>>,
|
||||||
pub max_virtual_target_index: usize,
|
/// Number of virtual targets used in the circuit.
|
||||||
|
pub num_virtual_targets: usize,
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Circuit data required by the verifier, but not the prover.
|
/// Circuit data required by the verifier, but not the prover.
|
||||||
|
|||||||
@ -42,7 +42,7 @@ pub(crate) fn prove<F: Extendable<D>, const D: usize>(
|
|||||||
&prover_data.generators,
|
&prover_data.generators,
|
||||||
config.num_wires,
|
config.num_wires,
|
||||||
degree,
|
degree,
|
||||||
prover_data.max_virtual_target_index,
|
prover_data.num_virtual_targets,
|
||||||
&mut timing
|
&mut timing
|
||||||
)
|
)
|
||||||
);
|
);
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user