FA-8881 / Selection controls / Open access

Two-thumb range-slider constraints: The low thumb escapes the slider domain · case 01

The low thumb escapes the slider domain.

Verified by executionVariant 1 · 9 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The lower domain operation uses `min(value, high-gap)` where the contract requires `max(minimum, min(value, high-gap))`.

THE FAILURE

The lower domain operation uses `min(value, high-gap)` where the contract requires `max(minimum, min(value, high-gap))`.

Unsuccessful approach: Using min turns the domain minimum into a ceiling.

Case contract

Thumbs clamp to domain and maintain minimum separation; translating preserves span and clamps delta against both domain edges.

Why this case matters

A deterministic model of two-thumb range-slider constraints; this isolates one interface invariant without requiring a browser.

1 / The failure

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(low, high, target, value, minimum, maximum, gap):
    if target == 'low': low = min(value, high-gap)
    elif target == 'high': high = min(maximum, max(value, low+gap))
    elif target == 'translate':
        delta = max(minimum-low, min(value, maximum-high))
        low += delta; high += delta
    return (low, high)
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('low minimum', solve(20, 60, 'low', -10, 0, 100, 10), (0, 60))
check('low gap', solve(20, 60, 'low', 65, 0, 100, 10), (50, 60))
check('high maximum', solve(20, 60, 'high', 120, 0, 100, 10), (20, 100))
check('high gap', solve(20, 60, 'high', 15, 0, 100, 10), (20, 30))
check('translate upper', solve(20, 60, 'translate', 80, 0, 100, 10), (60, 100))
check('translate lower', solve(20, 60, 'translate', -40, 0, 100, 10), (0, 40))
check('ordinary', solve(20, 60, 'low', 30, 0, 100, 10), (30, 60))
check('parameterized range translation', solve(2*N,6*N,'translate',N,0,10*N,N), (3*N,7*N))
for repetition in range(N):
    check('repeat ordinary', solve(20, 60, 'low', 30, 0, 100, 10), (30, 60))
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
low minimum	`[-10, 60]`	`[0, 60]`	Failed
low gap	`[50, 60]`	`[50, 60]`	Passed
high maximum	`[20, 100]`	`[20, 100]`	Passed
high gap	`[20, 30]`	`[20, 30]`	Passed
translate upper	`[60, 100]`	`[60, 100]`	Passed
translate lower	`[0, 40]`	`[0, 40]`	Passed
ordinary	`[30, 60]`	`[30, 60]`	Passed
parameterized range translation	`[3, 7]`	`[3, 7]`	Passed
repeat ordinary	`[30, 60]`	`[30, 60]`	Passed

SHA-256 / 4696667d9973c56b9fbb5f8fa8fcfca8e53b3b6fb5ca112d39cc97ae3d48f3f9

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(low, high, target, value, minimum, maximum, gap):
    if target == 'low': low = min(minimum, min(value, high-gap))
    elif target == 'high': high = min(maximum, max(value, low+gap))
    elif target == 'translate':
        delta = max(minimum-low, min(value, maximum-high))
        low += delta; high += delta
    return (low, high)
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('low minimum', solve(20, 60, 'low', -10, 0, 100, 10), (0, 60))
check('low gap', solve(20, 60, 'low', 65, 0, 100, 10), (50, 60))
check('high maximum', solve(20, 60, 'high', 120, 0, 100, 10), (20, 100))
check('high gap', solve(20, 60, 'high', 15, 0, 100, 10), (20, 30))
check('translate upper', solve(20, 60, 'translate', 80, 0, 100, 10), (60, 100))
check('translate lower', solve(20, 60, 'translate', -40, 0, 100, 10), (0, 40))
check('ordinary', solve(20, 60, 'low', 30, 0, 100, 10), (30, 60))
check('parameterized range translation', solve(2*N,6*N,'translate',N,0,10*N,N), (3*N,7*N))
for repetition in range(N):
    check('repeat ordinary', solve(20, 60, 'low', 30, 0, 100, 10), (30, 60))
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
low minimum	`[-10, 60]`	`[0, 60]`	Failed
low gap	`[0, 60]`	`[50, 60]`	Failed
high maximum	`[20, 100]`	`[20, 100]`	Passed
high gap	`[20, 30]`	`[20, 30]`	Passed
translate upper	`[60, 100]`	`[60, 100]`	Passed
translate lower	`[0, 40]`	`[0, 40]`	Passed
ordinary	`[0, 60]`	`[30, 60]`	Failed
parameterized range translation	`[3, 7]`	`[3, 7]`	Passed
repeat ordinary	`[0, 60]`	`[30, 60]`	Failed

SHA-256 / 3cb3303461c820b87db5c3931549c5076c046bce1364656f30d83cb6b70a5e2a

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 9 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

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

Verification & scope

This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.

Observations recorded using Python 3.12.14 at 2026-09-29T14:38:25.414951+00:00.

Case digest / 4ad778de762e270bd3c2935677e2301fc843e5493ed1c0b9617f9d5a8da3d27d