Documentation

The edge a pending request names. Only the two edges the model admits settle; any other edge is refused edge-inadmissible.

The live leaf for a key, read from the registry state before the decision.

The model's approval check, decided by the caller from the live state: a missing approval, an approval under another policy (both no-approval), an approval whose tuple does not match (approval-mismatch), or a match.

The application step's verdict, asked through the application value and carried on the pending request: the settlement inputs are ready, the carried datum does not read, or the value carries no holding rules for a termination, naming the application's executable.

One pending request with everything the seven checks need. The application verdict arrives as a field, like the decode verdict does: the selection never calls the application value.

A request that passed all seven checks.

Every exclusion reason: eight model refusals in the model's own words, six selection-policy reasons of the processor.

Why a pending request is left out: its reason and a detail text. The detail of application-required names the application's executable.

The selection: the settled requests and the excluded requests, each in ledger input order, with the capacity bound used and its provenance.

The live facts: per key, the leaf and whether a live output holds the key's one active token.

Judge every pending request alone, keep ledger input order, and settle the first included requests up to the capacity bound. The only cross-request rule is the seventh check, which reads earlier included requests of the same key; the capacity cut runs after every request has its own verdict. Both lists keep ledger input order.

Judge one request alone against the live facts: the six per-request checks in the spec's order. No argument names any other pending request, so a request's verdict never depends on requests on other keys. The seventh check, ReasonKeyInBatch, needs the earlier verdicts and runs in selectFold.

The capacity bound of a fold: nine requests per fold, an estimate under preprod's execution budget of 14 million memory units, bound by trie-proof verification. The number is not measured under preprod parameters.

an estimate, not a measurement: about nine requests fit in a fold under preprod's execution budget of 14 million memory units, bound by trie-proof verification

The reason's name in the receipt's vocabulary.

Which vocabulary the reason belongs to: a refusal of the model or the processor's own selection policy.