ledwards2225
ledwards2225
`check_circuit()` is incomplete for the UltraGoblinCircuitBuilder because it does not check the goblin ecc op gates or the databus lookup gates. For this reason, various tests utilizing the UG arithmetization...
To complete the ZM degree check, we need to commit to $(q_{\zeta} + z\cdot q_Z)X^{N_{max} - N - 1}$. Verification then requires a pairing check similar to the standard KZG...
It is often useful to consider only a subset of relations when running certain tests. This used to be possible by simply commenting out specific relations in the relevant Flavor...
Execution trace sorting requires the addition of dummy gates where they were previously not required in cases where one gate was reading into the next row of different gate type....
`q_arith` can currently take arbitrary values. We actively use q_arith = 0,1,2,3. (Comments in code suggest that at one time there was some use for q_arith > 3 but this...
Various subrelations in the Auxiliary relation are triggered by combinations of (non-gate) selectors, e.g. q_m, q_2. The `RAM_CONSISTENCY_CHECK` subrelation is triggered via `q_arith` which is a gate selector. This means...
Background: As part of our 2023 goals, we hooked up Goblin to ACIR. This essentially meant constructing and verifying GUH proofs over acir-generated circuits, and also constucting and verifying ECCVM...
Maybe just a typo in a comment but worth investigating. This method has the following block comment: ``` /** * we want the following layout in program memory * (x...
Some minor gate optimizations need to be removed to achieve trace sorting. (See issue #873). One sorting is complete, return to these and see if there's anything to be done.
We can take advantage of a sorted execution trace in sumcheck by only evaluating relations that are active at each row. This will involve logic for determining active relations in...