FA-7208 / Transport flow control / Member archive

Send window is minimum of peer and congestion windows · case 03

Send window is minimum of peer and congestion windows.

Member previewVariant 3 · 3 implementations · 4 checks per implementation

Case contract

Bounded offline decision model: send window is minimum of peer and congestion windows. Inputs are already validated protocol fields; the explicit fixtures define the supported policy, not a complete protocol implementation.

Why this case matters

This deterministic transport flow control model isolates the send-window-is-minimum-of-peer-and-congestion-windows policy at a network component boundary.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
fixture 4	`10`	`0`	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.