Unify basic and recursive constraints (WIP) #1211
Conversation
| @@ -228,3 +244,482 @@ mod tests { | |||
| Ok(()) | |||
| } | |||
| } | |||
|
|
|||
| #[derive(Debug, Clone)] | |||
There was a problem hiding this comment.
For simplicity, we are going with the 'initial' style of encoding an embedded DSL here.
Further down, there's some scratch code that can show you how to use the 'final' style in Rust. See https://okmij.org/ftp/tagless-final/index.html for background.
However, I'm not sure whether the final style makes a lot of sense in Rust for what we are doing. Mostly because evaluation for the extended circuit needs mutable access to the builder object; but we also want to ideally use overloaded operators (like * and +) to build our expressions.
| // P: PackedField<Scalar = FE>, { | ||
|
|
||
| // And now we can evaluate expressions in the language: | ||
| pub fn eval_as_packed_generic<F, FE, P, const D2: usize>(&self) -> P |
There was a problem hiding this comment.
This evaluates the AST for the base prover..
| // ) { | ||
| // ExtensionTarget<const D: usize> | ||
|
|
||
| pub fn eval_as_builder<F, P, const D: usize>( |
There was a problem hiding this comment.
.. and this evaluates the AST for the recursive prover.
|
Closed in favour of @jakzale's implementation of the same idea. |
No description provided.