FAILURE MAP
← Case archive

FA-40040 / Heap invariants / Member archive

Binomial carry consumes precisely the linked pair · case 05

The bounded binomial carry certificate reports an incorrect suffix.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A consolidation cursor sees ordered ranks and index i. Report whether to link now, current rank, carry rank, suffix retained after a link, triple-collision deferral, and link partner. In three equal consecutive ranks defer the first pair so a carry is not consolidated twice out of order. Empty cursor is allowed.

Why this case matters

This isolates an internal heap representation or priority-structure invariant using deterministic finite records.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixtureActualExpectedOutcome
regression certificate 2{"carry_rank": 1, "current": 0, "defer": false, "link_now": true, "partner": 1, "suffix": [0]}{"carry_rank": 1, "current": 0, "defer": false, "link_now": true, "partner": 1, "suffix": []}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.

Sign in to the archive ↗