Complete-theta quintic witness: reproduction supplement

The companion paper proves a negative pointwise polynomial square for
P(z)=z^5-264z^3+10952z at s0=log(13/(4*pi))/4>0. The checkers include the
complete infinite theta tail. They do not calculate an averaged-kernel sign.

Requirements
CPython3.10 or later, standard library only; no packages or network access.
Run without -O, which disables the assertion gates. No runtime or resource
estimate is supplied.

From this directory:
  python verify_quintic_192bit.py
  python verify_quintic_160bit.py

Each command prints its exact rational JSON enclosure to the console.
Optionally write to a new file (the parent directory must exist):
  python verify_quintic_192bit.py --output reproduced_192bit.json
  python verify_quintic_160bit.py --output reproduced_160bit.json
An existing output file is never replaced.

Both methods use rational Taylor120 exponential bounds and the complete
n>=4 geometric tail. The 192-bit program constructs derivatives by a closed
Stirling formula. The 160-bit program uses a recurrence and independently
checks the same closed formula. Both form the signed moments and square the
declared polynomial exactly; both assert a witness upper below -1000000000.
The old odd-prefix positivity and negative next Schur innovation are also
checked. The two enclosure grids produce different conservative endpoints.

certificate_192bit.json and certificate_160bit.json contain mathematical data
copied from the previously saved exact calculations. The 160-bit saved report
contains its witness, prefix, innovation, mu2 and tail data; it does not contain
the full derivative/moment tables. The pi bound in both certificates is copied
from the previously saved 192-bit calculation. The checkers calculate their
enclosures directly rather than taking the certificates as sign premises.

integer_moment_bounds.json contains the previously saved integer moment boxes
and coarse integer upper used in the paper. The boxes are ordered mu0, mu2,
mu4, mu6, mu8, mu10. All intervals are closed outward enclosures; endpoints are
exact rational strings or exact integers.

The reproduction scripts were adapted for portable publication and have not
been newly executed during publication assembly. Only syntax parsing, static
source comparison, JSON transcription checks and package checksums were done.
Mathematical arithmetic and sign gates were retained; old path, receipt and
file-binding wrappers were removed. No claim of a new reproduction run is made.

supplement_manifest.json lists SHA256 digests and byte sizes of these files.
It records file identity, not mathematical acceptance or peer review.
