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

feedback

Browse Source
This commit is contained in:
Daniel Lubarov 2023-01-03 11:23:28 -08:00
parent 18ce7ea547
commit 5719c0b70b
2 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
evm/src/fixed_recursive_verifier.rs
View File

@ -402,6 +402,9 @@ where
}
}
/// Our usual recursion threshold is 2^12 gates, but for these shrinking circuits, we use a few more
/// gates for a constant inner VK and for public inputs. This pushes us over the threshold to 2^13.
/// As long as we're at 2^13 gates, we might as well use a narrower witness.
fn shrinking_config() -> CircuitConfig {
CircuitConfig {
num_routed_wires: 40,

2
evm/src/recursive_verifier.rs
View File

@ -83,7 +83,6 @@ fn next_chunk<T: Debug, const N: usize>(iter: &mut impl Iterator<Item = T>) -> [
impl<T: Copy + Eq + PartialEq + Debug> PublicInputs<T> {
pub(crate) fn from_vec(v: &[T], config: &StarkConfig) -> Self {
log::info!("from_vec {}", v.len());
let mut iter = v.iter().copied();
let trace_cap = (0..config.fri_config.num_cap_elements())
.map(|_| next_chunk::<_, 4>(&mut iter).to_vec())
@ -99,7 +98,6 @@ impl<T: Copy + Eq + PartialEq + Debug> PublicInputs<T> {
let challenger_state_before = next_chunk(&mut iter);
let challenger_state_after = next_chunk(&mut iter);
let ctl_zs_last: Vec<_> = iter.collect();
log::info!("from_vec num Zs: {}", ctl_zs_last.len()); // TODO
Self {
trace_cap,