Validity
Validity for Legal Agreements

Formal Verification for Legal Documents

Validity proves whether a document's commitments can logically coexist — producing cryptographically verifiable proof of consistency or contradiction.

Validity transforms legal documents from interpretive text into formally testable systems. By extracting commitments, encoding them within a constrained logical framework, and solving them using deterministic methods, Validity delivers a definitive outcome: consistent, contradictory, or formally indeterminate.

The Problem

Legal certainty remains interpretive

Even the most sophisticated legal documents are evaluated through review, not verification. Inconsistencies are identified through human interpretation, and assurance is conveyed through opinion.

This model does not scale with complexity.

As documents grow in length, structure, and conditionality, the risk of internal contradiction increases — while the ability to conclusively detect it does not.

The Validity Approach

A deterministic pipeline for logical verification

Validity applies a four-stage pipeline:

01Extraction of explicit commitments from source text
02Formalization into a constrained logical fragment
03Encoding into a satisfiability model
04Solver-based proof generation

Each stage is fully specified, versioned, and deterministic. Identical inputs under identical configurations produce identical outputs.

Where a commitment cannot be formally represented, Validity does not approximate. It refuses with a structured indeterminacy.

Proof, Not Opinion

From legal interpretation to machine-verifiable proof

Validity produces a cryptographically signed Proof Object containing:

All formalized commitments
The logical assertions submitted to the solver
The satisfiability outcome
The minimal unsatisfiable core, where contradictions exist

Every reported contradiction is traceable to:

Exact source text
Precise logical representation
Solver-verified conflict

This enables independent verification without reliance on the originating party.

What Validity Detects

Provable logical failures

Within its defined logical fragment, Validity detects:

Direct contradictions
φ ∧ ¬φ
Deontic conflicts
Obligated(φ) ∧ Forbidden(φ)
Threshold inconsistencies
x ≥ A ∧ x ≤ B, where A > B
Temporal conflicts
Incompatible time-bound obligations
Quantifier clashes
Universal vs existential conflicts
Conditional loops
Circular dependency chains

These are not heuristics. Each is established through formal proof.

Defined Scope, Explicit Boundaries

Clarity through constraint

Validity does not assess factual truth, regulatory compliance, or commercial reasonableness.

It evaluates only whether the commitments within a document can simultaneously hold within a defined logical system.

Where a claim falls outside this system, it is explicitly classified as UNDERDETERMINED, with a structured explanation. No approximation. No silent omission.

Institutional Use Cases

Designed for high-stakes documents

Validity v1 is optimized for investment fund offering documents, where dense conditional structures and investor commitments demand internal consistency.

Pre-issuance verification of offering materials
Independent diligence by institutional investors
Internal quality control within legal drafting processes
Audit and regulatory review support
Versioned, Reproducible, Verifiable

A new standard of legal assurance

Every Validity output is bound to:

A specific document hash
A defined logical fragment version
A fixed translation policy
A pinned solver configuration

Proofs are reproducible, comparable across versions, and subject to lifecycle status management — VALID, SUPERSEDED, or REVOKED.

Validity does not interpret what a document means. It proves what it permits.

Contact