{
  "id": "self-verification",
  "code": "PTL-0118",
  "term": "Self-Verification",
  "aliases": [
    "backward verification"
  ],
  "category": "verification",
  "definition": "Self-verification is a technique in which a model, after producing candidate answers with chain-of-thought, checks each one by working backward, predicting the original conditions of the problem from the answer, and keeps the answer that is most consistent.",
  "description": "It turns verification into a separate prediction task rather than asking the model whether it is right, which reduces the tendency to approve its own mistakes. It applies most naturally to arithmetic and logical problems whose conditions can be masked and recovered.",
  "example": null,
  "broader": [],
  "narrower": [],
  "related": [
    "self-consistency",
    "chain-of-verification",
    "self-correction"
  ],
  "introduced": 2022,
  "added": "2026-10-10",
  "sources": [
    {
      "title": "Large Language Models are Better Reasoners with Self-Verification",
      "authors": "Weng et al.",
      "year": 2022,
      "url": "https://arxiv.org/abs/2212.09561"
    }
  ],
  "url": "https://protologue.com/t/self-verification/",
  "citation": "Protologue. (2026). Self-Verification. In Protologue: A Taxonomy of Prompting and LLM Techniques (v1.4.0, PTL-0118). https://protologue.com/t/self-verification/"
}