plonky2/src/gates/insertion.rs

214 lines
6.9 KiB
Rust
Raw Normal View History

2021-07-09 16:31:19 -07:00
use std::convert::TryInto;
use std::ops::Range;
use std::marker::PhantomData;
2021-07-01 13:11:34 -07:00
use crate::circuit_builder::CircuitBuilder;
2021-07-08 15:20:26 -07:00
use crate::field::extension_field::algebra::ExtensionAlgebra;
2021-07-01 13:11:34 -07:00
use crate::field::extension_field::target::ExtensionTarget;
2021-07-12 12:14:14 -07:00
use crate::field::extension_field::{FieldExtension, Extendable};
2021-07-01 13:11:34 -07:00
use crate::field::field::Field;
use crate::gates::gate::{Gate, GateRef};
use crate::generator::{SimpleGenerator, WitnessGenerator};
use crate::target::Target;
use crate::vars::{EvaluationTargets, EvaluationVars};
use crate::wire::Wire;
use crate::witness::PartialWitness;
/// A gate for inserting a value into a list at a non-deterministic location.
2021-07-06 10:28:39 -07:00
#[derive(Clone, Debug)]
pub(crate) struct InsertionGate<F: Extendable<D>, const D: usize> {
pub vec_size: usize,
pub _phantom: PhantomData<F>,
}
2021-07-01 13:11:34 -07:00
2021-07-09 16:31:19 -07:00
impl<F: Extendable<D>, const D: usize> InsertionGate<F, D> {
2021-07-06 10:28:39 -07:00
pub fn new(vec_size: usize) -> GateRef<F, D> {
let gate = Self {
vec_size,
_phantom: PhantomData,
};
GateRef::new(gate)
}
2021-07-08 15:20:26 -07:00
pub fn wires_insertion_index() -> usize {
0
}
pub fn wires_element_to_insert() -> Range<usize> {
1..D+1
2021-07-07 14:32:27 -07:00
}
pub fn wires_list_item(i: usize) -> Range<usize> {
2021-07-08 15:20:26 -07:00
let start = (i + 1) * D + 1;
2021-07-07 14:32:27 -07:00
start..start + D
}
2021-07-01 13:11:34 -07:00
2021-07-08 15:20:26 -07:00
fn start_of_output_wires(&self) -> usize {
2021-07-09 16:31:19 -07:00
(self.vec_size + 1) * D + 1
2021-07-01 13:11:34 -07:00
}
2021-07-08 15:20:26 -07:00
pub fn wires_output_list_item(&self, i: usize) -> Range<usize> {
2021-07-08 17:05:04 -07:00
let start = self.start_of_output_wires() + i * D;
2021-07-08 15:20:26 -07:00
start..start + D
2021-07-07 14:32:27 -07:00
}
2021-07-01 13:11:34 -07:00
2021-07-08 15:20:26 -07:00
fn start_of_intermediate_wires(&self) -> usize {
2021-07-08 17:05:04 -07:00
self.start_of_output_wires() + self.vec_size * D
2021-07-07 14:32:27 -07:00
}
pub fn equality_dummy_for_round_r(&self, r: usize) -> usize {
self.start_of_intermediate_wires() + r
}
pub fn insert_here_for_round_r(&self, r: usize) -> usize {
self.start_of_intermediate_wires() + (self.vec_size + 1) + r
2021-07-07 14:32:27 -07:00
}
2021-07-01 13:11:34 -07:00
}
2021-07-09 16:31:19 -07:00
impl<F: Extendable<D>, const D: usize> Gate<F, D> for InsertionGate<F, D> {
2021-07-01 13:11:34 -07:00
fn id(&self) -> String {
format!("{:?}<D={}>", self, D)
}
fn eval_unfiltered(&self, vars: EvaluationVars<F, D>) -> Vec<F::Extension> {
2021-07-09 16:31:19 -07:00
let insertion_index = vars.local_wires[Self::wires_insertion_index()];
2021-07-12 12:14:14 -07:00
2021-07-07 14:32:27 -07:00
let mut list_items = Vec::new();
2021-07-08 17:05:04 -07:00
for i in 0..self.vec_size {
2021-07-07 14:32:27 -07:00
list_items.push(vars.get_local_ext_algebra(Self::wires_list_item(i)));
}
2021-07-12 12:14:14 -07:00
let dummy_value : ExtensionAlgebra<F::Extension, D> = F::Extension::ZERO.into(); // will never be reached
list_items.push(dummy_value);
let mut output_list_items = Vec::new();
for i in 0..self.vec_size+1 {
output_list_items.push(vars.get_local_ext_algebra(self.wires_output_list_item(i)));
}
2021-07-07 14:32:27 -07:00
2021-07-08 15:20:26 -07:00
let element_to_insert = vars.get_local_ext_algebra(Self::wires_element_to_insert());
2021-07-07 14:32:27 -07:00
let mut constraints = Vec::new();
let mut already_inserted = F::Extension::ZERO;
2021-07-12 12:14:14 -07:00
for r in 0..self.vec_size + 1 {
2021-07-08 15:20:26 -07:00
let cur_index = F::Extension::from_canonical_usize(r);
let equality_dummy = vars.local_wires[self.equality_dummy_for_round_r(r)];
2021-07-08 15:20:26 -07:00
let difference = cur_index - insertion_index;
let insert_here = vars.local_wires[self.insert_here_for_round_r(r)];
2021-07-08 15:20:26 -07:00
// The two equality constraints.
2021-07-12 12:14:14 -07:00
let difference_algebra : ExtensionAlgebra<F::Extension, D> = difference.into();
let equality_dummy_constraint : ExtensionAlgebra<F::Extension, D> = difference_algebra * equality_dummy.into() - insert_here.into();
2021-07-09 16:31:19 -07:00
constraints.extend(equality_dummy_constraint.to_basefield_array());
let mul_to_zero_constraint : ExtensionAlgebra<F::Extension, D> = ((F::Extension::ONE - insert_here) * difference).into();
2021-07-09 16:31:19 -07:00
constraints.extend(mul_to_zero_constraint.to_basefield_array());
2021-07-08 15:20:26 -07:00
let mut new_item = element_to_insert * insert_here.into() + already_inserted.into();
2021-07-08 15:20:26 -07:00
if r > 0 {
new_item += list_items[r - 1] * already_inserted.into();
2021-07-08 15:20:26 -07:00
}
already_inserted += insert_here;
new_item += list_items[r] * (F::Extension::ONE - already_inserted).into();
2021-07-12 12:14:14 -07:00
constraints.extend((new_item - output_list_items[r]).to_basefield_array());
2021-07-07 14:32:27 -07:00
}
constraints
2021-07-01 13:11:34 -07:00
}
fn eval_unfiltered_recursively(
&self,
builder: &mut CircuitBuilder<F, D>,
vars: EvaluationTargets<D>,
) -> Vec<ExtensionTarget<D>> {
2021-07-07 14:32:27 -07:00
todo!()
2021-07-01 13:11:34 -07:00
}
fn generators(
&self,
gate_index: usize,
local_constants: &[F],
) -> Vec<Box<dyn WitnessGenerator<F>>> {
2021-07-06 10:28:39 -07:00
let gen = InsertionGenerator::<F, D> {
2021-07-01 13:11:34 -07:00
gate_index,
2021-07-06 10:28:39 -07:00
gate: self.clone(),
_phantom: PhantomData,
2021-07-01 13:11:34 -07:00
};
vec![Box::new(gen)]
}
fn num_wires(&self) -> usize {
2021-07-07 14:32:27 -07:00
let num_input_wires = self.vec_size + 1; // the original vector, and the insertion index
let num_output_wires = self.vec_size + 1; // the final vector, with the inserted element
let num_intermediate_wires = 6 * self.vec_size; // six intermediate variables needed for each element of the vector
self.vec_size + 1
2021-07-01 13:11:34 -07:00
}
fn num_constants(&self) -> usize {
2021-07-07 14:32:27 -07:00
0
2021-07-01 13:11:34 -07:00
}
fn degree(&self) -> usize {
1
}
fn num_constraints(&self) -> usize {
1
}
}
#[derive(Debug)]
2021-07-09 16:31:19 -07:00
struct InsertionGenerator<F: Extendable<D>, const D: usize> {
2021-07-01 13:11:34 -07:00
gate_index: usize,
2021-07-08 17:05:04 -07:00
gate: InsertionGate<F, D>,
2021-07-06 10:28:39 -07:00
_phantom: PhantomData<F>,
2021-07-01 13:11:34 -07:00
}
2021-07-09 16:31:19 -07:00
impl<F: Extendable<D>, const D: usize> SimpleGenerator<F> for InsertionGenerator<F, D> {
2021-07-01 13:11:34 -07:00
fn dependencies(&self) -> Vec<Target> {
2021-07-08 17:05:04 -07:00
let local_target = |input| {
Target::Wire(Wire {
gate: self.gate_index,
input,
})
};
let local_targets = |inputs: Range<usize>| inputs.map(local_target);
let mut deps = Vec::new();
2021-07-09 16:31:19 -07:00
deps.push(local_target(InsertionGate::<F, D>::wires_insertion_index()));
deps.extend(local_targets(InsertionGate::<F, D>::wires_element_to_insert()));
2021-07-08 17:05:04 -07:00
for i in 0..self.gate.vec_size {
2021-07-09 16:31:19 -07:00
deps.extend(local_targets(InsertionGate::<F, D>::wires_list_item(i)));
2021-07-08 17:05:04 -07:00
}
deps
2021-07-01 13:11:34 -07:00
}
2021-07-09 16:31:19 -07:00
fn run_once(&self, witness: &PartialWitness<F>) -> PartialWitness<F> {
2021-07-08 17:05:04 -07:00
let local_wire = |input| Wire {
2021-07-01 13:11:34 -07:00
gate: self.gate_index,
2021-07-08 17:05:04 -07:00
input,
};
let get_local_wire = |input| witness.get_wire(local_wire(input));
let get_local_ext = |wire_range: Range<usize>| {
debug_assert_eq!(wire_range.len(), D);
let values = wire_range.map(get_local_wire).collect::<Vec<_>>();
let arr = values.try_into().unwrap();
F::Extension::from_basefield_array(arr)
2021-07-01 13:11:34 -07:00
};
2021-07-08 17:05:04 -07:00
// Compute the new vector and the values for equality_dummy and insert_here
2021-07-08 17:05:04 -07:00
todo!()
2021-07-01 13:11:34 -07:00
}
}
#[cfg(test)]
mod tests {
}