chriseth 06abb2a28a Simplify parsed identities and introduce the concept of proof item. (#1820) ...

At the on-site, we introduced operators for all lookup-like constraints.
This means that `[x, y] in s $ [a, b];` is not parsed as a lookup
identity any more, but just as a regular expression with binary
operators. The whole concept of a lookup or identity as a rust type is
now only present after the condenser has run. Because of that, we can
remove a lot of code that was concerned with parsed identities.

Since prover functions were introduced, we can have both constraints and
prover functions at statement level. Because of that I extended the
concept of "identity" (which we partly renamed to "constraint" already)
to "proof item". A proof item is either a constraint or a prover
function. Later on, we might also include fixed columns, challenges,
etc.

Co-authored-by: chriseth <chriseth.github@gmail.com>

2024-09-23 12:53:25 +00:00

..

src

Simplify parsed identities and introduce the concept of proof item. (#1820)

2024-09-23 12:53:25 +00:00

Cargo.toml

Add data structures for variably-sized fixed columns (#1542)

2024-07-22 16:10:23 +00:00