> For the complete documentation index, see [llms.txt](https://docs.lpp-minduniverse.org/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://docs.lpp-minduniverse.org/lingua-pactum-protocol-lpp-documentation/6.-intent-and-trajectory-governance/6.4-verification-states.md).

# 6.4 Verification States

The current Semantic Verification model contains four public verification states:

```
MATCH
CONTESTED
MISMATCH
UNVERIFIABLE
```

These states describe semantic-verification evidence.

They are not direct substitutes for the Admission Kernel's:

```
ADMIT
DENY
DEFER
COLLAPSE
```

#### MATCH

`MATCH` indicates that available verification evidence supports the conclusion that the current trajectory preserves the relevant authorized intent.

Conceptually:

```
Current Trajectory
≈
Authorized Meaning
```

A `MATCH` result supports continued admission evaluation.

It does not bypass other Layer 0 predicates.

Therefore:

```
MATCH
⇏
ADMIT
```

The Authority Object may still be:

* revoked,
* expired,
* out of scope,
* structurally invalid,
* or otherwise inadmissible.

#### CONTESTED

`CONTESTED` indicates that verification evidence does not support a single sufficiently stable semantic conclusion.

This may occur when:

* validators disagree,
* evidence is conflicting,
* the action admits materially different interpretations,
* or semantic consistency remains disputed.

`CONTESTED` must not be silently interpreted as `MATCH`.

For consequential execution, contested meaning may require:

* stronger verification,
* additional evidence,
* human review,
* or re-admission,

depending on the applicable governance profile.

#### MISMATCH

`MISMATCH` indicates that the current task or action trajectory materially fails to preserve the authorized intent.

Conceptually:

```
Current Trajectory
≠
Authorized Meaning
```

A mismatch means that earlier authority cannot simply be reused as if no semantic change occurred.

This is a primary trigger for Material Mutation analysis and re-admission.

#### UNVERIFIABLE

`UNVERIFIABLE` means that the system cannot establish a sufficient verification basis for determining whether authorized meaning is preserved.

Possible causes may include insufficient evidence, missing trajectory information, unavailable required validators, or a representation that cannot be reliably evaluated under the applicable verification profile.

The important principle is:

```
Unable to verify
≠
Verified match
```

For high-consequence actions, unresolved semantic verification follows the broader LPP fail-closed direction.

#### Verification State vs Admission State

The two state spaces must remain separate.

| Semantic Verification | Layer 0 Admission               |
| --------------------- | ------------------------------- |
| MATCH                 | ADMIT / DENY / DEFER / COLLAPSE |
| CONTESTED             | Admission Kernel decides        |
| MISMATCH              | Admission Kernel decides        |
| UNVERIFIABLE          | Admission Kernel decides        |

Semantic Verification supplies evidence.

The Admission Kernel evaluates the complete constitutional state.