tolerance-prover

This skill should be used when a bound is about to be relied on and nobody has checked it — "is this bound tight", "can I trust this tolerance", "is the Pisot constant 2 attained", "which n is the worst case", "my error bound has no margin", "prove the bound is sharp", "is this crossover a property of the sequence or of my code", "does adding precision change which n breaks worst", "is this measurement reproducible or noise". Measures the tightness of the Pisot bound 2 for the tribonacci and plastic constants, shows that the bound is a supremum that no finite n attains, and demonstrates that the digit count at which the bound starts holding is a property of the arithmetic rather than of the sequence. Stdlib-only Python 3.10+, no network, no build step.

Version

1.0.0

License

MIT

Compatibility

Python 3.10 or newer, standard library only. No network access, no build step, no third-party packages. Runs on Linux, macOS and Windows.