zero-knowledge

#306 addresses a term-precedence bug with exponentiation. However, we do not have an end-to-end test case for this.
It should be included, ideally for all operators.

Is your feature request related to a problem? Please describe.
Adding a new member to a Semaphore group changes the root, invalidating any currently-generated proofs. This makes it so that a transaction submitted with a valid proof can become invalid if another transaction modifying a group is submitted first.

Describe the solution you'd like
Root history kind of solves this (by accep

🐛 Bug Report

using an invalid character in an import name gives no error information

Error Message

Error [EPAR0370000]: ~
    --> D:\Work\leo-playground\src/main.leo:1:12
     |
   1 | import test~.lib.func;

Expected Behavior

it should display the same error message as when an uppercase letter is used:

Error [EPAR0370012]: package names must be lowercase 

Describe what you want implemented
Remove the bit_iterator macro.

Describe "Why" this is needed
As far as I can see we only invoke the macro once to create BitIterator8 so I don't see the need to have a macro for it. Creating BitIterator8 directly is much clearer.

Describe alternatives you've considered
Leave as is.

Additional context
NA

As pointed out by @Al-Kindi-0, it is currently possible for the prover to compute incorrect results in the bitwise operations, due to missing constraints on the operation selectors.

Example:

I'll demonstrate this using the example from the bitwise docs, which shows computation for bitwise AND.

Suppose that at the sec

A fix has been made for Macs using the intel chip as of this commit: https://github.com/AztecProtocol/barretenberg/tree/9861b2c230723e73c188865d47b67e161b0371f1

We should update the dependency in the aztec backend crate

In this PR we used the method from this post from Daniel Lubarov https://mirprotocol.org/blog/Adding-zero-knowledge-to-Plonk-Halo to update our blinding method to one that does not increase the degree of polynomials.

This method is sound, but the post was written for Halo2-style polynomial commitments which are hiding by nature, meaning they need