FA-1414 / Concurrency / Member archive
Release a distributed generation barrier: Unregistered arrivals manufacture barrier completion · case 04
The barrier release operation is admitted even though unregistered arrivals manufacture barrier completion.
Case contract
Return a Boolean admission decision for release a distributed generation barrier. The record r must satisfy all of: len(set(r['participant_count'][0])) >= r['participant_count'][1]; all(x == r['generation_match'][0] for x in r['generation_match'][1]); set(r['registered_members'][0]) <= set(r['registered_members'][1]); r['barrier_not_broken'] is False; r['release_persisted'] is True. Extra tracing fields are ignored; validation does not mutate the record.
Why this case matters
A deterministic local contract for concurrency. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| Unregistered arrivals manufacture barrier completion | true | false | 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.
Sign in to the archive ↗