FA-27578 / HTTP ranges / Member archive

A range-set guard limits amplification before serving resolved byte ranges: any tolerated overlap still forces coalesced output · case 03

A range-set guard limits amplification before serving resolved byte ranges: any tolerated overlap still forces coalesced output.

Member previewVariant 3 · 3 implementations · 19 checks per implementation

Case contract

x holds a representation length, already resolved satisfiable inclusive ranges in request order, and local policy limits. Serve ["full",null] for an empty list, more than max_ranges members, requested byte sum above twice the length (duplicates count every time), more than max_tiny members shorter than min_span, or more than max_overlaps overlaps. Overlaps are counted by a sweep over start-sorted ranges against the running maximum end; adjacent ranges do not overlap. Inversions count request neighbors whose start decreases. Without overlaps and with inversions within max_disorder, return ["ranges",request-order ranges]; otherwise return ["ranges",start-sorted ranges with overlapping or adjacent members coalesced].

Why this case matters

Range responses combine representation identity, conditional requests, framing, and partial-object state.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
pass-through-overlap-gate fixture 8	`["ranges", [[0, 9], [5, 14]]]`	`["ranges", [[0, 14]]]`	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.