- Motivation
- Binding verified semantics to real execution — libraries, processes, remote APIs, durable jobs — must not smuggle semantic decisions into adapters; whether the current binding contract suffices is an empirical question.
- Hypotheses
- A small, technology-neutral set of binding properties (identity, authority, routing, parameters, invocation, timing, failure, evidence) either reduces to the existing declarative contract or forces a minimal typed extension — decided by evidence, not preference.
- Pre-registered design
- Executable specimens across genuinely independent execution classes (verified non-wrapper relationships; distinct failure ownership); frozen current-contract baselines; a staged protocol where candidate extraction is frozen before a sealed, independently-authored substitution case is revealed; admission requires the same property forced by at least two independent classes.
- Status
- A preparation draft has pinned reproducible candidate baselines; the protocol and result phase remain unratified and blocked on the kernel-realization milestone. No adequacy verdict exists.
- Falsified by
- (For the extension hypothesis) every candidate property reducing to profile data on the existing contract — a RETAIN verdict, published as such. (For the method) non-reproducible classification, reveal-order leakage, inability to distinguish profile data from semantic extension, or a candidate admitted from a single execution class.