Function condition_guards_carry_independent_boundaries
pub async fn condition_guards_carry_independent_boundaries<F: Fixture>(
open: impl AsyncFn() -> F,
) -> RuleOutcomeExpand description
Each guard of an AppendCondition is evaluated against its own
boundary.
VT-30. A decision model assembled from fragments read separately produces
one boundary per fragment, and there is no single boundary that is correct
for all of them. VT-27 is [FROZEN] and refuses per-item bounds inside a
Query, telling such an application to issue one read per fragment — and
that refusal is only sound if the resulting boundaries can be carried
into one condition. Without guards the prescribed workaround is the
min(p₁…p₄) collapse, and a collapse is a liveness failure: the quiet
fragment’s stale boundary governs the busy one, so appends that never
conflicted are refused and the deployment reads the rejection rate as
contention.
MinCollapseStore is that workaround promoted into an adapter, and it is
the compiled version. It passes the entire existing condition_after_*
family, because every rule in it carries a single guard and the minimum
over one boundary is that boundary — which is exactly why this rule has to
exist rather than be inferred.
§The arrangement, and why the boundaries sit where they do
The store holds a quiet event, a marker, a busy event and a second marker, in that order. The quiet guard’s boundary is the first marker — above its own last match and below the busy event — and the busy guard’s is the second. Under correct per-guard evaluation neither guard has a match above its own boundary and the append is admitted; under a collapse to the minimum, the busy event sits above it and the append is refused.
Each boundary is strictly above its own guard’s last match rather than at
it, so that this rule does not also reject a probe reading after as
inclusive — condition_after_ignores_events_at_the_boundary owns that and
AfterIsInclusiveStore is its mutant.
The mirror re-runs the same shape with the busy guard unbounded, which must be refused. It is the non-vacuity anchor: without it a store whose probe never fires satisfies the admission above for free, and the rule would certify an inert condition.
Nothing here reads the store back, and that is deliberate: every position
comes from the append that assigned it, so a store whose read path is
wrong fails the rules that own the read path and not this one.