Thibaut Schaeffer

Thanks for the quick response! This is indeed a very trivial program, it would be nice to support it if possible though, or at least have a specification of which...

I updated my examples due to a mistake on my end. These are even simpler now.

This actually extends to arbitrary boolean arrays: `x == y` with `x` and `y` of type `bool[N]` ``` We split `x` and `y` into `M ~ N/chunk_size` chunks of each...

This requires supporting bellman. The current plan on this is the following: - define intermediate language based on flattened code without function call resolution - define interfaces from that intermediate...

Update on this. Bellman is coming with #273 The part on unresolved function calls is not relevant anymore, we resolve all calls before hitting the backend. From there, the extra...

We should have a separate sum check error that we use for arguments and which is not marked malicious.

Right! The main advantage here is when passing public inputs. One alternative way to solve the same problem could be to automatically "pack" public inputs: `(field, u32, u32[3])` could for...

Sounds like a good idea! It's indeed generated from `zokrates_book`, and updated on zokrates.github.io when we release. Let's see what we can do

I think that makes sense! To clarify, array equality in *assertions* is already available, but not in boolean expressions. By the way, I think that it's more efficient with ```...

Right, this needs to be handled more gracefully.