Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Noir: a language that compiles to a constraint system |
|---|---|
| What the text proposes | Noir publishes a language for writing programs that compile to constraints a proving backend can prove. The language is not the backend. |
| Who may write | Aztec |
| What is settled | The programmer writes Noir. The compiler produces an intermediate constraint system. A backend, which might be Barretenberg or another prover, produces the proof. |
| Load-bearing assumption | This note does not say Noir proofs are verified on any particular chain. |
| What this library says afterwards | A reading of the project's public design document. Not a copy, not a benchmark, and not an offer. |
| Rights | Official external source only |