FA-16608 / Floating-point arithmetic / Member archive

Floating total-order sorting drops repeated encodings · case 03

Floating total-order sorting drops repeated encodings.

Member previewVariant 3 · 3 implementations · 9 checks per implementation

Case contract

Sort unsigned binary64 encodings by the stipulated IEEE-style total encoding order: negative NaNs, negative infinity, negative finite, negative zero, positive zero, positive finite, positive infinity, positive NaNs. Within signed NaNs, reversing bits on negatives reverses quietness and payload ordering. Preserve all encodings.

Why this case matters

An offline floating representation model isolates a reproducible arithmetic fault.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
duplicates	`[3]`	`[3, 3]`	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.