Georg Wiese e8e9a9375e Simplify BabyBear memory machine (#1883) ...

This removes a complicated comparison mechanism introduced in #1874.

Previously, time steps were compared differently from addresses. Now,
both are compared the same way which is:
- The prover provides a bit indicating whether the high limbs of the
values are equal
- If this bit is 1, a constraints asserts this is actually the case
- The prover provides the 16-Bit difference minus one on the limb that
differs. This asserts that the limb value is strictly increasing.

2024-10-10 14:08:15 +00:00

..

src

Simplify BabyBear memory machine (#1883)

2024-10-10 14:08:15 +00:00

Cargo.toml

Use jit compiler to generate fixed column values. (#1825)

2024-10-03 17:10:58 +00:00