Test end.offset <= 1 before revTruncLeOneLow in the reversed crossed
dispatch, and specialize revTruncLeOneLow under that path fact. The
helper drops the now-tautological end.offset conjuncts and the key
comparison implied by a failed optLe.
The crossed truncated reverse benchmark drops from about 67 ns to
about 61 ns. Sweep, corpus, SMT cases, and 100% line and branch
coverage still pass.
Drop the redundant begin.offset split in crossedCompleteOvershoot and
the rE > 0 guard in closedFormForwardSaturated; both are implied by
the call-site invariants.
Add an SMT-derived empty-interval case as the smt_cases CTest and as a
committed fuzz_readable seed. run-fuzz.sh now loads the read-only seed
corpus alongside the writable one.
Rename exhaustive to sweep and document that it is exhaustive only
over its bounded family of instances.
- Correct stale references and headline-path wording in READMEs and Lean docstrings
- Document build steps, comparator requirements, sweep scope, and coverage
- Unify Apache headers across Lean and C++ sources
- Add a bwrap-free axiom audit for the headline theorems
- Add a Gitea workflow running lake build, the axiom audit, C++ tests, and coverage
- Match LLVM coverage tool versions to the compiler and recreate stale build dirs
Drop predicate operands and unreachable arms that dispatch and readable invariants fix, and extend the exhaustive sweep to cover every branch side. Gate coverage on branch coverage as well.
Add an exhaustive readable-instance sweep and a coverage gate requiring
100% line coverage of the summarised implementation. Delete branches that
are unreachable under `Readable`, centralise and assert the 32-bit offset
contract at the public entry points, and stop materialising `n` zero bytes
when deciding `keyAfterN n k < upper`.
Also add the extreme-offset regression test, harden the corpus parsers,
remove unused model helpers, document the literal-total / fast-readable
split, and refresh the validation and benchmark numbers.
- Literal transliteration of `Statement.closedForm` plus an equivalent
summarised implementation
- Borrowed input keys (`std::string_view` / `std::span`) and owned result
keys (`std::string`)
- Golden-vector test, differential/safety fuzzers, and a nanobench
comparison
The literal and summarised implementations agree on 40,000 Lean golden
vectors, 18,971 sorted corpus cases, and the readable fuzzer; the raw fuzzer
runs both implementations under ASan/UBSan. `build/` and the generated
`oracle/golden.txt` are ignored.