{
  "slug": "nave",
  "name": "NAVe",
  "tagline": "Automatic proper-constrainedness checking for Noir",
  "maintainer": "Pedro Antonino, Namrata Jain",
  "url": "https://arxiv.org/abs/2601.09372",
  "category": "zk-circuits",
  "targets": [
    "Noir",
    "ACIR"
  ],
  "approach": "cvc5 with finite-field SMT-LIB theories",
  "license": "Research",
  "status": "Research (January 2026)",
  "summary": "NAVe checks Noir programs for proper constrainedness using cvc5's finite-field theory, giving the Noir ecosystem an automatic underconstraint detector comparable to Picus for Circom.",
  "details": [
    "Noir compiles to ACIR, which NAVe analyses directly. It is the automatic complement to Lampe's proof-assistant route."
  ],
  "strengths": [
    "Automatic, no spec required.",
    "Targets Noir directly."
  ],
  "limits": [
    "Young research tool.",
    "Solver limits on large programs.",
    "Determinism, not correctness."
  ],
  "fit": [
    "Run it on Noir circuits as the first pass, then Lampe for proofs."
  ],
  "references": [
    [
      "NAVe paper (arXiv 2601.09372)",
      "https://arxiv.org/abs/2601.09372"
    ]
  ],
  "category_name": "ZK circuit verification",
  "page": "https://sorryfree.com/frameworks/nave/",
  "updated": "2026-09-13"
}