search

noir-lang / noir-examples

A repo of example Noir projects.
MIT License
36 stars 13 forks source link

Is it OK, that the proof generation takes multiple minutes on recursive example? #19

Open LogvinovLeon opened 5 months ago

LogvinovLeon commented 5 months ago

Aim

Just wanted to ask if it's a local problem or if it's to be expected. Seems like such a small example proving that x !== y should not take multiple minutes as it renders it completely unusable for the users

Expected Behavior

.

Bug

.

To Reproduce

1. 2. 3. 4.

Environment

No response

Additional Context

No response

Would you like to submit a PR for this Issue?

No

Support Needs

No response