Pith. sign in

REVIEW 1 cited by

Fast Number Parsing Without Fallback

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.06644 v2 pith:F6KMABHO submitted 2022-12-13 cs.DS

Noble Mushtak , Daniel Lemire This is my paper · ORCID
classification cs.DS
keywords algorithmfallbacknumberfastfloating-pointfunctionadoptedbeen
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In recent work, Lemire (2021) presented a fast algorithm to convert number strings into binary floating-point numbers. The algorithm has been adopted by several important systems: e.g., it is part of the runtime libraries of GCC 12, Rust 1.55, and Go 1.16. The algorithm parses any number string with a significand containing no more than 19 digits into an IEEE floating-point number. However, there is a check leading to a fallback function to ensure correctness. This fallback function is never called in practice. We prove that the fallback is unnecessary. Thus we can slightly simplify the algorithm and its implementation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. G\"{o}del-type universes in unimodular gravity

    gr-qc 2025-06 reject novelty 5.0 of 10

    Gödel-type universes in unimodular gravity are claimed to reproduce the causal structure of general relativity, but the paper's field equations do not admit the solutions it presents.

Pith tools