Skip to main content
Understand the core mental model behind QWED in one page.

The trust boundary

QWED is built on a simple idea:
LLMs are useful translators, not final authorities.
The important boundary is between translation and verification:
  • Before verification: output is untrusted.
  • After deterministic verification: output is accepted, corrected, or blocked.

How verification actually works

1

1) Receive natural language input

Example: “Is the sum of triangle angles 180 degrees?”
2

2) Translate to a structured form

LLM maps intent into DSL, symbolic expression, or typed schema.
3

3) Verify with deterministic engine

QWED uses engines like SymPy, Z3, AST analyzers, and SQL parsers.
4

4) Return a proof-backed result

Final status is returned with evidence, not just confidence.

One concrete example

Determinism vs probability

Verification statuses

Where each engine fits

Attestations and auditability

QWED can generate signed attestations so downstream systems can verify that a check occurred:
Use this for compliance, audit logs, and third-party verification.

Next steps

  1. Quick start
  2. Architecture overview
  3. Verification engines
  4. Attestation spec