FA-351 / Consensus / Open access

Activate a joint voting configuration: The old configuration has only a minority · case 01

The joint configuration operation is admitted even though the old configuration has only a minority.

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

ROOT CAUSE

The admission path omits the old majority invariant while validating the other operation preconditions.

THE FAILURE

The admission path omits the old majority invariant while validating the other operation preconditions.

Unsuccessful approach: Adding the old majority check repairs the reported defect, but replacing the adjacent new majority check loses that independent invariant.

Case contract

Return a Boolean admission decision for activate a joint voting configuration. The record r must satisfy all of: len(set(r['old_majority'][0]) & set(r['old_majority'][1])) * 2 > len(set(r['old_majority'][0])); len(set(r['new_majority'][0]) & set(r['new_majority'][1])) * 2 > len(set(r['new_majority'][0])); r['configuration_entry'][0] <= r['configuration_entry'][1]; r['no_pending_change'] is None; all(x >= r['learner_catchup'][0] for x in r['learner_catchup'][1]). Extra tracing fields are ignored; validation does not mutate the record.

Why this case matters

A deterministic local contract for consensus. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.

1 / The failure

Exit 1

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

N = 1
observations = []
def solve(r):
    return (len(set(r['new_majority'][0]) & set(r['new_majority'][1])) * 2 > len(set(r['new_majority'][0]))) and (r['configuration_entry'][0] <= r['configuration_entry'][1]) and (r['no_pending_change'] is None) and (all(x >= r['learner_catchup'][0] for x in r['learner_catchup'][1]))
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
r = {'old_majority': [[1, 2, 3], [1, 2]], 'new_majority': [[3, 4, 5], [3, 4]], 'configuration_entry': [8, 8], 'no_pending_change': None, 'learner_catchup': [8, [8, 10]]}
check('valid operation', solve(r), True)
check('The old configuration has only a minority', solve(dict(r, **{'old_majority': [[1, 2, 3], [1]]})), False)
check('The new configuration has only a minority', solve(dict(r, **{'new_majority': [[3, 4, 5], [3]]})), False)
check('The configuration entry is beyond the committed prefix', solve(dict(r, **{'configuration_entry': [9, 8]})), False)
check('A second membership change overlaps an unfinalized change', solve(dict(r, **{'no_pending_change': 'pending'})), False)
check('A promoted learner lacks the configuration entry', solve(dict(r, **{'learner_catchup': [8, [7, 10]]})), False)
check('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)
check('repeat validation is pure', solve(r), True)
invalid = {'old_majority': [[1, 2, 3], [1]], 'new_majority': [[3, 4, 5], [3]], 'configuration_entry': [9, 8], 'no_pending_change': 'pending', 'learner_catchup': [8, [7, 10]]}
keys = list(invalid)
pair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}
check('two independent violations in variant', solve(dict(r, **pair)), False)
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
valid operation	`True`	`True`	Passed
The old configuration has only a minority	`True`	`False`	Failed
The new configuration has only a minority	`False`	`False`	Passed
The configuration entry is beyond the committed prefix	`False`	`False`	Passed
A second membership change overlaps an unfinalized change	`False`	`False`	Passed
A promoted learner lacks the configuration entry	`False`	`False`	Passed
unrelated tracing metadata	`True`	`True`	Passed
repeat validation is pure	`True`	`True`	Passed
two independent violations in variant	`False`	`False`	Passed

SHA-256 / d2e87ed60269cfbe57dc72335eb921e30a041cebd8a6afc27532528274956922

2 / The unsuccessful fix

Exit 1

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

N = 1
observations = []
def solve(r):
    return (len(set(r['old_majority'][0]) & set(r['old_majority'][1])) * 2 > len(set(r['old_majority'][0]))) and (r['configuration_entry'][0] <= r['configuration_entry'][1]) and (r['no_pending_change'] is None) and (all(x >= r['learner_catchup'][0] for x in r['learner_catchup'][1]))
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
r = {'old_majority': [[1, 2, 3], [1, 2]], 'new_majority': [[3, 4, 5], [3, 4]], 'configuration_entry': [8, 8], 'no_pending_change': None, 'learner_catchup': [8, [8, 10]]}
check('valid operation', solve(r), True)
check('The old configuration has only a minority', solve(dict(r, **{'old_majority': [[1, 2, 3], [1]]})), False)
check('The new configuration has only a minority', solve(dict(r, **{'new_majority': [[3, 4, 5], [3]]})), False)
check('The configuration entry is beyond the committed prefix', solve(dict(r, **{'configuration_entry': [9, 8]})), False)
check('A second membership change overlaps an unfinalized change', solve(dict(r, **{'no_pending_change': 'pending'})), False)
check('A promoted learner lacks the configuration entry', solve(dict(r, **{'learner_catchup': [8, [7, 10]]})), False)
check('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)
check('repeat validation is pure', solve(r), True)
invalid = {'old_majority': [[1, 2, 3], [1]], 'new_majority': [[3, 4, 5], [3]], 'configuration_entry': [9, 8], 'no_pending_change': 'pending', 'learner_catchup': [8, [7, 10]]}
keys = list(invalid)
pair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}
check('two independent violations in variant', solve(dict(r, **pair)), False)
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
valid operation	`True`	`True`	Passed
The old configuration has only a minority	`False`	`False`	Passed
The new configuration has only a minority	`True`	`False`	Failed
The configuration entry is beyond the committed prefix	`False`	`False`	Passed
A second membership change overlaps an unfinalized change	`False`	`False`	Passed
A promoted learner lacks the configuration entry	`False`	`False`	Passed
unrelated tracing metadata	`True`	`True`	Passed
repeat validation is pure	`True`	`True`	Passed
two independent violations in variant	`False`	`False`	Passed

SHA-256 / c36ec1c36b826177fd110c2bdb3879de3e7afbadb95ddd84afd38b19d4f12af1

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:36:52.596199+00:00.

Case digest / 7f06a15018e73475e6acbe899232aa64e580e1b19e54a10caf25c6f5d8e88d8d