FAILURE MAP
← Case archive

FA-31861 / Keyboard interactions / Open access

Keyboard usage snapshot delta decoder: Snapshot decoder emits releases for newly pressed or still-held keys · case 01

The event trace violates the key release delta rule and produces incorrect keyboard state or command output.

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

ROOT CAUSE

Snapshot decoder emits releases for newly pressed or still-held keys.

VERIFIED REPAIR

Use the contract transition `sorted(old_keys-keys)` at the key release delta fault site; preserve the other state transitions.

Unsuccessful approach: The partial repair changes this transition to sorted(old_keys), which still violates the model contract on the explicit regression traces.

Case contract

Each report is [modifier_mask,usage_slots]. Usages are integers >=0; 0 is padding, 1 is an error sentinel that invalidates the whole report. Other usages are unique logical keys even when slots duplicate. Modifier bits 0..7 identify M0..M7. Emit sorted key releases, sorted modifier releases, sorted modifier presses, then sorted key presses per valid report. Return emitted [phase,kind,identity] and final usage/modifier sets. Inputs are finite ordered event traces; return the stated deterministic state. Batch entries are independent. N varies the number of independent input transactions.

Why this case matters

Controlled keyboard event processing model for debugging application event logic.

1 / The failure

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

N = 1
observations = []
def solve(cases):
    def run(c):
        old_keys=set(); old_mods=set(); out=[]; rejected=0
        for mask,slots in c:
            if 1 in slots:
                rejected+=1
                continue
            keys=set(slots)-{0}
            mods={bit for bit in range(8) if mask & (1<<bit)}
            for key in sorted(keys-old_keys): out.append(['up','key',key])
            for mod in sorted(old_mods-mods): out.append(['up','mod',mod])
            for mod in sorted(mods-old_mods): out.append(['down','mod',mod])
            for key in sorted(keys-old_keys): out.append(['down','key',key])
            old_keys=keys
            old_mods=mods
        return [out,sorted(old_keys),sorted(old_mods),rejected]
    return [run(c) for c in cases]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('hid-report-delta scenario 0', solve([[]] * N), [[[], [], [], 0]] * N)
check('hid-report-delta scenario 1', solve([[[0, [0, 0]]]] * N), [[[], [], [], 0]] * N)
check('hid-report-delta scenario 2', solve([[[1, [2, 3, 3, 0]], [1, [2, 3, 0]]]] * N), [[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]] * N)
check('hid-report-delta scenario 3', solve([[[1, [2, 3]], [2, [3, 4]], [0, []]]] * N), [[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]] * N)
check('hid-report-delta scenario 4', solve([[[4, [5]], [0, [1, 0, 0]], [4, [5]]]] * N), [[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]] * N)
check('hid-report-delta scenario 5', solve([[[0, [1, 0]], [0, [1, 2]]]] * N), [[[], [], [], 2]] * N)
check('hid-report-delta scenario 6', solve([[[128, [2]], [0, []], [128, [2]]]] * N), [[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]] * N)
check('hid-report-delta scenario 7', solve([[[0, [2]], [0, []], [0, [2]]]] * N), [[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]] * N)
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 fixtureActualExpectedOutcome
hid-report-delta scenario 0[[[], [], [], 0]][[[], [], [], 0]]Passed
hid-report-delta scenario 1[[[], [], [], 0]][[[], [], [], 0]]Passed
hid-report-delta scenario 2[[[['up', 'key', 2], ['up', 'key', 3], ['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]][[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]]Failed
hid-report-delta scenario 3[[[['up', 'key', 2], ['up', 'key', 3], ['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 4], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'mod', 1]], [], [], 0]][[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]]Failed
hid-report-delta scenario 4[[[['up', 'key', 5], ['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]][[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]]Failed
hid-report-delta scenario 5[[[], [], [], 2]][[[], [], [], 2]]Passed
hid-report-delta scenario 6[[[['up', 'key', 2], ['down', 'mod', 7], ['down', 'key', 2], ['up', 'mod', 7], ['up', 'key', 2], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]][[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]]Failed
hid-report-delta scenario 7[[[['up', 'key', 2], ['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]][[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]]Failed

SHA-256 / bc3eef365871ae6278217842593da49e134e09fdfbc8306c9b984c9136e398ac

2 / The unsuccessful fix

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

N = 1
observations = []
def solve(cases):
    def run(c):
        old_keys=set(); old_mods=set(); out=[]; rejected=0
        for mask,slots in c:
            if 1 in slots:
                rejected+=1
                continue
            keys=set(slots)-{0}
            mods={bit for bit in range(8) if mask & (1<<bit)}
            for key in sorted(old_keys): out.append(['up','key',key])
            for mod in sorted(old_mods-mods): out.append(['up','mod',mod])
            for mod in sorted(mods-old_mods): out.append(['down','mod',mod])
            for key in sorted(keys-old_keys): out.append(['down','key',key])
            old_keys=keys
            old_mods=mods
        return [out,sorted(old_keys),sorted(old_mods),rejected]
    return [run(c) for c in cases]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('hid-report-delta scenario 0', solve([[]] * N), [[[], [], [], 0]] * N)
check('hid-report-delta scenario 1', solve([[[0, [0, 0]]]] * N), [[[], [], [], 0]] * N)
check('hid-report-delta scenario 2', solve([[[1, [2, 3, 3, 0]], [1, [2, 3, 0]]]] * N), [[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]] * N)
check('hid-report-delta scenario 3', solve([[[1, [2, 3]], [2, [3, 4]], [0, []]]] * N), [[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]] * N)
check('hid-report-delta scenario 4', solve([[[4, [5]], [0, [1, 0, 0]], [4, [5]]]] * N), [[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]] * N)
check('hid-report-delta scenario 5', solve([[[0, [1, 0]], [0, [1, 2]]]] * N), [[[], [], [], 2]] * N)
check('hid-report-delta scenario 6', solve([[[128, [2]], [0, []], [128, [2]]]] * N), [[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]] * N)
check('hid-report-delta scenario 7', solve([[[0, [2]], [0, []], [0, [2]]]] * N), [[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]] * N)
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 fixtureActualExpectedOutcome
hid-report-delta scenario 0[[[], [], [], 0]][[[], [], [], 0]]Passed
hid-report-delta scenario 1[[[], [], [], 0]][[[], [], [], 0]]Passed
hid-report-delta scenario 2[[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'key', 3]], [2, 3], [0], 0]][[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]]Failed
hid-report-delta scenario 3[[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'key', 3], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]][[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]]Failed
hid-report-delta scenario 4[[[['down', 'mod', 2], ['down', 'key', 5], ['up', 'key', 5]], [5], [2], 1]][[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]]Failed
hid-report-delta scenario 5[[[], [], [], 2]][[[], [], [], 2]]Passed
hid-report-delta scenario 6[[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]][[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]]Passed
hid-report-delta scenario 7[[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]][[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]]Passed

SHA-256 / 7de1421d72b259dbd9cff7f8d5517e26487cdf947e9241fdcd872c4903597fef

3 / The verified repair

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

N = 1
observations = []
def solve(cases):
    def run(c):
        old_keys=set(); old_mods=set(); out=[]; rejected=0
        for mask,slots in c:
            if 1 in slots:
                rejected+=1
                continue
            keys=set(slots)-{0}
            mods={bit for bit in range(8) if mask & (1<<bit)}
            for key in sorted(old_keys-keys): out.append(['up','key',key])
            for mod in sorted(old_mods-mods): out.append(['up','mod',mod])
            for mod in sorted(mods-old_mods): out.append(['down','mod',mod])
            for key in sorted(keys-old_keys): out.append(['down','key',key])
            old_keys=keys
            old_mods=mods
        return [out,sorted(old_keys),sorted(old_mods),rejected]
    return [run(c) for c in cases]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('hid-report-delta scenario 0', solve([[]] * N), [[[], [], [], 0]] * N)
check('hid-report-delta scenario 1', solve([[[0, [0, 0]]]] * N), [[[], [], [], 0]] * N)
check('hid-report-delta scenario 2', solve([[[1, [2, 3, 3, 0]], [1, [2, 3, 0]]]] * N), [[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]] * N)
check('hid-report-delta scenario 3', solve([[[1, [2, 3]], [2, [3, 4]], [0, []]]] * N), [[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]] * N)
check('hid-report-delta scenario 4', solve([[[4, [5]], [0, [1, 0, 0]], [4, [5]]]] * N), [[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]] * N)
check('hid-report-delta scenario 5', solve([[[0, [1, 0]], [0, [1, 2]]]] * N), [[[], [], [], 2]] * N)
check('hid-report-delta scenario 6', solve([[[128, [2]], [0, []], [128, [2]]]] * N), [[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]] * N)
check('hid-report-delta scenario 7', solve([[[0, [2]], [0, []], [0, [2]]]] * N), [[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]] * N)
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 fixtureActualExpectedOutcome
hid-report-delta scenario 0[[[], [], [], 0]][[[], [], [], 0]]Passed
hid-report-delta scenario 1[[[], [], [], 0]][[[], [], [], 0]]Passed
hid-report-delta scenario 2[[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]][[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3]], [2, 3], [0], 0]]Passed
hid-report-delta scenario 3[[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]][[[['down', 'mod', 0], ['down', 'key', 2], ['down', 'key', 3], ['up', 'key', 2], ['up', 'mod', 0], ['down', 'mod', 1], ['down', 'key', 4], ['up', 'key', 3], ['up', 'key', 4], ['up', 'mod', 1]], [], [], 0]]Passed
hid-report-delta scenario 4[[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]][[[['down', 'mod', 2], ['down', 'key', 5]], [5], [2], 1]]Passed
hid-report-delta scenario 5[[[], [], [], 2]][[[], [], [], 2]]Passed
hid-report-delta scenario 6[[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]][[[['down', 'mod', 7], ['down', 'key', 2], ['up', 'key', 2], ['up', 'mod', 7], ['down', 'mod', 7], ['down', 'key', 2]], [2], [7], 0]]Passed
hid-report-delta scenario 7[[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]][[[['down', 'key', 2], ['up', 'key', 2], ['down', 'key', 2]], [2], [], 0]]Passed

SHA-256 / 3fa9febfbb463c08e459fe498b09838f18150df53e3cee5648703597a622ee6f

Verification & scope

Offline stipulated event model, not a browser implementation or web standard conformance claim. 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:42:06.340653+00:00.

Case digest / 8799f818cfc2cbc392a3d491cd22e63c9be5404bfa4ab4c2109f223a26149acf