FA-23251 / Autocomplete interactions / Open access

Unresolved autocomplete draft on blur: blur reversion runs before a captured suggestion click completes · case 01

The pointer completion transition produces an incorrect observable state.

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

ROOT CAUSE

At blur-resolution/pointer, the implementation evaluates `True` instead of preserving the specified completion transition.

THE FAILURE

At blur-resolution/pointer, the implementation evaluates `True` instead of preserving the specified completion transition.

Unsuccessful approach: The attempted repair uses `False`, which still violates a normal or boundary completion fixture.

Case contract

This strict-selection picker reverts an unresolved draft to the committed label after blur unless a suggestion pointer acceptance or IME composition is in progress. Exact unique candidate confirmation is an explicit separate transition. Blur never chooses a highlighted candidate merely because it exists.

Why this case matters

Autocomplete couples draft text, suggestion identity and asynchronous presentation; this bounded lifecycle model isolates one observable interaction defect.

1 / The failure

Exit 1

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

N = 1
observations = []
def solve(event, d):
    if event == 'revert': return d['label']
    if event == 'value': return d['value']
    if event == 'pointer': return True
    if event == 'composition': return not d['composing']
    if event == 'exact': return d['exact_ids'][0] if len(d['exact_ids'])==1 else None
    if event == 'touched': return True
    if event == 'pending': return None
    if event == 'free-text-rejection': return {'resolved':d['value'] is not None,'free_text':None}
    if event == 'unresolved-validation': return {'invalid_draft':d['draft']!=d['label'],'candidate':None}
    if event == 'changed': return False
    return {'unchanged': True}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'draft':'peach','value':'p1','label':'Pear','active':'p2','pointer_pending':True,'composing':True,'exact_ids':['p3','p4'],'query_epoch':N,'pending':'peach','touched':False}
boundary = {'draft':'','value':None,'label':'','active':None,'pointer_pending':False,'composing':False,'exact_ids':[''],'query_epoch':N,'pending':None,'touched':True}
check('normal revert', solve('revert', normal), 'Pear')
check('boundary revert', solve('revert', boundary), '')
check('normal value', solve('value', normal), 'p1')
check('boundary value', solve('value', boundary), None)
check('normal pointer', solve('pointer', normal), False)
check('boundary pointer', solve('pointer', boundary), True)
check('normal composition', solve('composition', normal), False)
check('boundary composition', solve('composition', boundary), True)
check('normal exact', solve('exact', normal), None)
check('boundary exact', solve('exact', boundary), '')
check('normal touched', solve('touched', normal), True)
check('boundary touched', solve('touched', boundary), True)
check('normal pending', solve('pending', normal), None)
check('boundary pending', solve('pending', boundary), None)
check('normal free-text-rejection', solve('free-text-rejection', normal), {'resolved':True,'free_text':None})
check('boundary free-text-rejection', solve('free-text-rejection', boundary), {'resolved':False,'free_text':None})
check('normal unresolved-validation', solve('unresolved-validation', normal), {'invalid_draft':True,'candidate':None})
check('boundary unresolved-validation', solve('unresolved-validation', boundary), {'invalid_draft':False,'candidate':None})
check('normal changed', solve('changed', normal), False)
check('boundary changed', solve('changed', boundary), False)
variant = dict(normal, **{'label':'L'*N})
check('variant query or selection payload', solve('revert', variant), 'L'*N)
check('unknown completion event', solve('unrecognized', normal), {'unchanged': True})
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
normal revert	`Pear`	`Pear`	Passed
boundary revert			Passed
normal value	`p1`	`p1`	Passed
boundary value	`None`	`None`	Passed
normal pointer	`True`	`False`	Failed
boundary pointer	`True`	`True`	Passed
normal composition	`False`	`False`	Passed
boundary composition	`True`	`True`	Passed
normal exact	`None`	`None`	Passed
boundary exact			Passed
normal touched	`True`	`True`	Passed
boundary touched	`True`	`True`	Passed
normal pending	`None`	`None`	Passed
boundary pending	`None`	`None`	Passed
normal free-text-rejection	`{'free_text': None, 'resolved': True}`	`{'free_text': None, 'resolved': True}`	Passed
boundary free-text-rejection	`{'free_text': None, 'resolved': False}`	`{'free_text': None, 'resolved': False}`	Passed
normal unresolved-validation	`{'candidate': None, 'invalid_draft': True}`	`{'candidate': None, 'invalid_draft': True}`	Passed
boundary unresolved-validation	`{'candidate': None, 'invalid_draft': False}`	`{'candidate': None, 'invalid_draft': False}`	Passed
normal changed	`False`	`False`	Passed
boundary changed	`False`	`False`	Passed
variant query or selection payload	`L`	`L`	Passed
unknown completion event	`{'unchanged': True}`	`{'unchanged': True}`	Passed

SHA-256 / c1c7235ba12edcfdef5cd47c166b0ef550ea2da0250f7f5de6fa59657746b703

2 / The unsuccessful fix

Exit 1

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

N = 1
observations = []
def solve(event, d):
    if event == 'revert': return d['label']
    if event == 'value': return d['value']
    if event == 'pointer': return False
    if event == 'composition': return not d['composing']
    if event == 'exact': return d['exact_ids'][0] if len(d['exact_ids'])==1 else None
    if event == 'touched': return True
    if event == 'pending': return None
    if event == 'free-text-rejection': return {'resolved':d['value'] is not None,'free_text':None}
    if event == 'unresolved-validation': return {'invalid_draft':d['draft']!=d['label'],'candidate':None}
    if event == 'changed': return False
    return {'unchanged': True}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'draft':'peach','value':'p1','label':'Pear','active':'p2','pointer_pending':True,'composing':True,'exact_ids':['p3','p4'],'query_epoch':N,'pending':'peach','touched':False}
boundary = {'draft':'','value':None,'label':'','active':None,'pointer_pending':False,'composing':False,'exact_ids':[''],'query_epoch':N,'pending':None,'touched':True}
check('normal revert', solve('revert', normal), 'Pear')
check('boundary revert', solve('revert', boundary), '')
check('normal value', solve('value', normal), 'p1')
check('boundary value', solve('value', boundary), None)
check('normal pointer', solve('pointer', normal), False)
check('boundary pointer', solve('pointer', boundary), True)
check('normal composition', solve('composition', normal), False)
check('boundary composition', solve('composition', boundary), True)
check('normal exact', solve('exact', normal), None)
check('boundary exact', solve('exact', boundary), '')
check('normal touched', solve('touched', normal), True)
check('boundary touched', solve('touched', boundary), True)
check('normal pending', solve('pending', normal), None)
check('boundary pending', solve('pending', boundary), None)
check('normal free-text-rejection', solve('free-text-rejection', normal), {'resolved':True,'free_text':None})
check('boundary free-text-rejection', solve('free-text-rejection', boundary), {'resolved':False,'free_text':None})
check('normal unresolved-validation', solve('unresolved-validation', normal), {'invalid_draft':True,'candidate':None})
check('boundary unresolved-validation', solve('unresolved-validation', boundary), {'invalid_draft':False,'candidate':None})
check('normal changed', solve('changed', normal), False)
check('boundary changed', solve('changed', boundary), False)
variant = dict(normal, **{'label':'L'*N})
check('variant query or selection payload', solve('revert', variant), 'L'*N)
check('unknown completion event', solve('unrecognized', normal), {'unchanged': True})
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
normal revert	`Pear`	`Pear`	Passed
boundary revert			Passed
normal value	`p1`	`p1`	Passed
boundary value	`None`	`None`	Passed
normal pointer	`False`	`False`	Passed
boundary pointer	`False`	`True`	Failed
normal composition	`False`	`False`	Passed
boundary composition	`True`	`True`	Passed
normal exact	`None`	`None`	Passed
boundary exact			Passed
normal touched	`True`	`True`	Passed
boundary touched	`True`	`True`	Passed
normal pending	`None`	`None`	Passed
boundary pending	`None`	`None`	Passed
normal free-text-rejection	`{'free_text': None, 'resolved': True}`	`{'free_text': None, 'resolved': True}`	Passed
boundary free-text-rejection	`{'free_text': None, 'resolved': False}`	`{'free_text': None, 'resolved': False}`	Passed
normal unresolved-validation	`{'candidate': None, 'invalid_draft': True}`	`{'candidate': None, 'invalid_draft': True}`	Passed
boundary unresolved-validation	`{'candidate': None, 'invalid_draft': False}`	`{'candidate': None, 'invalid_draft': False}`	Passed
normal changed	`False`	`False`	Passed
boundary changed	`False`	`False`	Passed
variant query or selection payload	`L`	`L`	Passed
unknown completion event	`{'unchanged': True}`	`{'unchanged': True}`	Passed

SHA-256 / 0ec2e7245c62538dbf4dfe2a05f68b013b1756aa3c2da754bf1be0ec17af3d0c

HELD IN THE MEMBER ARCHIVE

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

This mechanism has 22 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

Stipulated deterministic widget transition model; inputs are validated snapshots. It does not model browser event dispatch, network transport, or linguistic standards. 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:40:46.183136+00:00.

Case digest / a537f91068ac8b43f56af84776218bb64a25cee5bf0ee2e896407ea8fb6d55df