# Carrier-Aligned Predication Capability Contract

Version: `0.1.0-CANDIDATE`
Status: `NON-RUNTIME / NO-AUTHORITY-EFFECT / PLACEMENT UNRATIFIED`

Scope correction: this contract governs only the bounded carrier-aligned
projection probe. It is not a functional contract for Stack B and grants no
basis for stack placement.

## Capability

Given an admitted declared structural state, project its A/T/E/K bindings into
carrier-keyed controlled predication records. Preserve V as derived and
unresolved unless an external admitted evaluation provides it.

This is a representation and trace operation. It does not investigate truth,
perform the Ars, select principles, infer relations, answer questions, assign a
subject, or evaluate V.

## Input contract

The input names:

- a state and subject expression;
- the exact source-map identifier and hash;
- requested carriers;
- one A/T/E/K binding for every requested carrier;
- ambiguity and contradiction records;
- an explicit requested output count.

Complete mode requires the exact carrier domain
`B,C,D,E,F,G,H,I,K`. Carrier identity is semantic, not array position.

## Output contract

For a complete admitted input, the projection emits nine records ordered by the
declared canonical carrier order. Each record contains:

- stable record and carrier IDs;
- the four source-supported regime values;
- V status (`DERIVED_UNRESOLVED` in this candidate);
- exact source references;
- a controlled sentence surface;
- declared representational loss.

The controlled sentence is an engineering serialization, not a quotation or a
source-mandated proposition.

## Failure semantics

| Condition | Result |
|---|---|
| missing or duplicate carrier | `SUSPENDED_INCOMPLETE_STATE` |
| explicit ambiguity | `SUSPENDED_AMBIGUOUS` |
| explicit contradiction | `SUSPENDED_CONTRADICTORY` |
| value absent from admitted carrier map | `REJECTED_UNSUPPORTED` |
| complete exact state | `COMPILED_COMPLETE` |

No non-complete result may expose a successful `sentences` array. Evidence and
failure details remain available; the system never pads, guesses, or silently
synthesizes to satisfy the number nine.

## Determinism

The same normalized input, carrier map, tool version, and source dependency
lock must yield the same ordered semantic records. Serialization bytes may only
be compared after the runtime-neutral deterministic JSON profile is applied.

## Non-collapse laws

```text
CARRIER != ARRAY POSITION
REGIME VALUE != CARRIER IDENTITY
SOURCE TABLE != ENGINEERING SENTENCE TEMPLATE
CONTROLLED RECORD != NATURAL-LANGUAGE ONTOLOGY
V PAIR != EVALUATED RESULT
DETERMINISM != AUTHORITY
NINE RECORDS != NUMBERED STACK B
```

The process is a controlled, reproducible, traceable reduction of the eligible
representation state space. It does not import STACK ARITHMETICA's categorical
number-quality ontology.