{
  "slug": "circuit-completeness",
  "term": "Circuit completeness",
  "tools": [
    "clean",
    "garden",
    "zk-golf"
  ],
  "definition": "A circuit is complete with respect to a specification if every input the specification allows has a satisfying witness, so an honest prover is never blocked from proving a true statement.",
  "detail": [
    "Completeness failures are availability bugs: a wallet that cannot spend, a bridge that cannot finalise, a rollup that cannot include a legitimate transaction. They are less discussed than soundness bugs because they do not lose funds directly, but they are common when constraints are tightened during a fix.",
    "A sound-and-complete theorem pins the circuit to its specification exactly, which is what allows untrusted optimisation, including by AI agents, without loss of correctness."
  ],
  "page": "https://sorryfree.com/glossary/circuit-completeness/",
  "updated": "2026-09-13"
}