ParetoStack 0.3.13 documentation

ParetoStack is an AI-enabled optimizer for whole code bases: it explores combinations of optimizations, measures every candidate on real hardware and keeps a change only when it is verified against your program's outputs (byte for byte, or a tolerance you declare). This is the documentation of version 0.3.13 (2026-10-29).

• Glossary: plain-language meaning of contract, bit-exact, tolerance, PGO, LTO, SIMD, speed-up, p-value and every other term used here.
• Install: Windows, Linux, DGX.
• Command line reference: every command and option.
• Optimizations: what can change in your code, and what the output guarantee is.
• Examples and Benchmarks.
• OpenCV rules.
• What changed in this version and the history of all versions.

Words used

Contract. The rule a changed program's output must meet before its speed-up counts. The default is identical output (byte for byte). Where small differences are expected (rounding, fixed-point arithmetic, an FFT), the contract is a tolerance you declare: a numeric error, PSNR or SSIM for images, or a task metric. A change that does not meet its contract is rejected, whatever its speed.

More terms (PGO, LTO, tolerance, SIMD, p-value and others) are explained in the Glossary.

Quick start

paretostack examples                      list the example projects
paretostack examples run word_filter --yes   optimize one (runs its program several times, in a copy)
paretostack plan ./myproject               what would change in your code (nothing is run)
paretostack run ./myproject --yes          optimize, verify, report

Your original files are never changed: the result is a patch (paretostack apply ./myproject --patch FILE).