FA-27554 / HTTP ranges / Member archive

A range-set guard limits amplification before serving resolved byte ranges: overlap detection sweeps ranges in start order rather than request order · case 04

A range-set guard limits amplification before serving resolved byte ranges: overlap detection sweeps ranges in start order rather than request order.

Member previewVariant 4 · 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
overlap-sorted-sweep fixture 4	`["ranges", [[50, 59]]]`	`["ranges", [[50, 59], [0, 9]]]`	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.