Comparator and Condition Admission Architecture

Comparator compatibility rules and validation enforcement.

Current

Current raw predicates use comparator-specific variants. Scenario admission constructs the closed observation domain, admits every operand into that exact domain, validates union-wide legality, closes the evidence-use policy, and binds acquisition separately. The validated representation preserves that relation directly; it contains no generic comparator, optional operand, or dynamic JSON value.

Target

ValidatedTypedPredicate retains its closed comparator-specific typed variant. ConditionDefinition contains only condition identity, closed observation domain, typed predicate, and evidence-use policy. Acquisition bindings separately prove how a local or future provider operation projects into that domain.

Exact integers/decimals, booleans, bounded strings/bytes, dates/instants, closed arrays/records, and closed unions have explicit semantics. No implicit coercion, generic float, unnamed collation, or overloaded containment enters through JSON. Signed integers, unsigned integers, exact decimals, dates, and instants support exact inclusive closed ranges whose sealed construction proves both endpoints belong to the owning domain and minimum <= maximum.

Current boundary and residual

PF-01 implements the target. Post-validation type mismatch is an integrity failure, never semantic Unknown. Generated dag-v3 projections describe the typed relation. Specialized IEEE-754 and locale-collation domains remain separate future mathematical families; accepted-run protocol behavior is owned by the implemented PF-04 authority rather than comparator validation.