mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-04 06:43:07 +00:00
* Halo2 style lookup arguments in System Zero It's a really nice and simple protocol, particularly for the verifier since the constraints are trivial (aside from the underlying batched permutation checks, which we already support). See the [Halo2 book](https://zcash.github.io/halo2/design/proving-system/lookup.html) and this [talk](https://www.youtube.com/watch?v=YlTt12s7vGE&t=5237s) by @daira. Previously we generated the whole trace in row-wise form, but it's much more efficient to generate these "permuted" columns column-wise. So I changed our STARK framework to accept the trace in column-wise form. STARK impls now have the flexibility to do some generation row-wise and some column-wise (without extra costs; there's a single transpose as before). * sorting * fixes * PR feedback * into_iter * timing
12 lines
419 B
Rust
12 lines
419 B
Rust
//! Range check unit which checks that values are in `[0, degree)`.
|
|
|
|
pub(crate) const NUM_RANGE_CHECKS: usize = 5;
|
|
|
|
/// The input of the `i`th range check, i.e. the value being range checked.
|
|
pub(crate) const fn col_rc_degree_input(i: usize) -> usize {
|
|
debug_assert!(i < NUM_RANGE_CHECKS);
|
|
super::START_RANGE_CHECK_DEGREE + i
|
|
}
|
|
|
|
pub(super) const END: usize = super::START_RANGE_CHECK_DEGREE + NUM_RANGE_CHECKS;
|