FA-41619 / Listener lifecycle / Member archive

Priority ceiling counts disabled callbacks as dispatch overflow · case 04

Priority ceiling counts disabled callbacks as dispatch overflow; the returned lifecycle plan violates the stated transition contract.

Member previewVariant 4 · 3 implementations · 8 checks per implementation

Case contract

Build independent priority-dispatch projections from [id,priority,sequence,enabled] records. Eligibility applies inclusive floor and ceiling to enabled entries. Order sorts all stored entries by descending priority then ascending registration sequence. Separately, take/defer project a nonnegative budget split of raw storage order. Disabled entries remain stored. Above/below list enabled entries strictly outside bounds. Budget-left is clamped; an equal floor/ceiling is a valid window. Inputs are finite state snapshots, including transitional and stale states; output fields are the exact independent actions/metadata defined by the corrected expression table. Numeric fixture capacities and counts vary with N. Field definitions, each independently computed from the input snapshot: eligible = [r[0] for r in s['entries'] if r[3] and s['floor']<=r[1]<=s['ceiling']]; order = [r[0] for r in sorted(s['entries'],key=lambda r:(-r[1],r[2]))]; disabled = [r[0] for r in s['entries'] if not r[3]]; take = [r[0] for r in s['entries'][:max(0,s['budget'])]]; defer = [r[0] for r in s['entries'][max(0,s['budget']):]]; above = [r[0] for r in s['entries'] if r[3] and r[1]>s['ceiling']]; below = [r[0] for r in s['entries'] if r[3] and r[1]<s['floor']]; tie_sequence = [[r[0],r[2]] for r in s['entries']]; budget_left = max(0,s['budget']-len(s['entries'])); valid_window = s['floor']<=s['ceiling']

Why this case matters

Observer implementations need to preserve this state while subscriptions enter, execute, and leave their lifecycle.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
transition 0	`{"above": ["a", "c"], "below": [], "budget_left": 0, "defer": ["a", "b", "c"], "disabled": ["a"], "eligible": ["b"], "order": ["c", "a", "b"], "take": [], "tie_sequence": [["a", 0], ["b", 1], ["c", 8]], "valid_window": true}`	`{"above": ["c"], "below": [], "budget_left": 0, "defer": ["a", "b", "c"], "disabled": ["a"], "eligible": ["b"], "order": ["c", "a", "b"], "take": [], "tie_sequence": [["a", 0], ["b", 1], ["c", 8]], "valid_window": true}`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.