Summation with a large dynamic range
Compare sequential sum and math.fsum on a repeated cancellation pattern, with a Fraction reference for the exact represented inputs.
Proposed original example. Source release and any execution are separate steps.
Which summation strategy preserves the small contributions in this adversarial finite sequence?
Sum every represented binary float as an exact rational number; compare both numerical outputs to that reference.
What you could produce
- A scoped observations JSON record and a comparison with the stated reference.
Before you use it
- Python 3.13 standard library
Limits to keep in view
- No research code was executed by the preparation tool.
- Author output cannot issue an independent scientific-verification result.
Source and permission context
Original local preparation by the Executable Science seed collection; upstream API references remain separately attributed.
Rights need review. Review the scope and upstream conditions before reuse.
Still unresolved
- Proposed local-draft licenses: original code MIT, explanations CC-BY-4.0, synthetic numeric data CC0-1.0; publication/disclosure approval remains separate.