Brandon H. Gomes

@cscherrer just a question. I was looking at your example code and tried it out and I ran into a few issues. Here was my sequence: ```julia using MonteCarloMeasurements, Distributions...

Probably better to be the same repo but a different crate (use a workspace), to help manage complexity.

I recommend the following pattern for hash functions which know their arity at compile-time: https://play.rust-lang.org/?version=stable&mode=debug&edition=2021&gist=cc008c861ad5c5455d1ca26622284a4b For denoting the security level, like collision resistance, PRF, preimage resistance etc, I recommend something...

It would be nice to have a function that applies `n`-levels of blinding so that we can just figure out the correct `n` for the `PolynomialCommitment` scheme we're using and...

After speaking with @LukePearson1 and @lopeetall, we think that `q_arith` should actually be removed entirely. The arithmetic gate just represents all the terms which have one of the six basic...

> If we don't use selector polynomials like ```q_arith``` we won't be able to either activate or deactivate a specific gate as the idea behind using those selectors was to...

> I think `q_arith` could be removed but we would need to do some adjustments. Since some gates (like `FIxedBaseScalarMul`) use the selectors `q_l`, `q_r` and `q_c` we would now...

@CPerezz > I really like the proposal! Thanks! > I assume `inputs` in verification stands for the public inputs right? If so, how do we know the possitions at which...

We should use a custom variable type for embedded scalars which can only be constructed by doing the relevant checks. Since the curves are known at compile-time, there should be...

These `BigInt` can be different types, yes. We can't guarantee they are the same.