By @josebrox
> **Current and retained checks.** Current counts, exact specifications and arithmetic qualifications are in the [README](../README.md), [v82 result records](../data/results_20261120_v82.json), and [v82 proof guide](results_20261120_v82.md). The full ordered sequence is in the [CI workflow](../.github/workflows/verify.yml). Historical source equations and their checks below remain available for reproduction.
# Reproducing the mathematical data
## Current verification
Use **Python 3.12**, **SymPy 1.14.0**, and **PassageMath PARI 10.8.14** for the complete current sequence. Run the new exact gate and its source audit with:
```sh
python -m pip install sympy==1.14.0 passagemath-pari==10.8.14
python -B scripts/verify_v83.py --report /tmp/v83-verification.json
python -B scripts/verify_v82.py --report /tmp/v82-verification.json
python -B scripts/verify_v81.py --report /tmp/v81-verification.json
python -B scripts/verify_v80.py --report /tmp/v80-verification.json
python -B scripts/verify_v79.py --report /tmp/v79-verification.json
python -B scripts/verify_v78.py --report /tmp/v78-verification.json
```
The v83 research gate checks the new raw-scalar square identity and exact prepared counterexamples, while binding the unchanged current result record. The universal valuation and approximation arguments have separate written proofs. It does not infer actual elliptic-trace realization from these checks.
The v82 gate independently reconstructs and expands the 163/179 quartics, checks all rational inverse maps including the family fiber at `R=0`, and reproduces the coefficient files in a temporary directory. It also runs the exact elliptic divisibility fixtures and PARI algebraic descents for the prepared genus-one counterexample. Those research results do not assert a new 25/11 bound. All published inputs are read-only during verification.
The v81 gate independently expands every coefficient of the 56-variable
quartic, reconstructs its nonlinear contact and two-adic identities,
and checks the amplified number-field descent and finite-algebra
encoding. It preserves the prior review pins and compares regenerated
quartic data byte for byte in a temporary tree. The number-field counts
refer to Q inside K, under their separate stated hypotheses.
The v80 gate reconstructs the 58-variable abc quartic, including its one-helper normalization and the exact native map from the published pole theorem. The v79 gate preserves the 59-variable construction in a temporary tree, independently checks every coefficient and physical source map, and verifies the general-pole normalization and scoped parity certificate. The v78 gate restores the pinned notes of **Gabe Conant with Astra 6.2** and replays their source checks and subsequent extensions. The original attribution-era review hashes remain authenticated by exact reverse edits. Neither gate establishes the retained arithmetic premises or an effective shift for an existence family.
Run every command in the CI workflow for the complete regression sequence. The final `scripts/verify.py --full` command covers the retained legacy inputs; it does not by itself run all later dated gates. Verification receipts should be written outside the checkout. If the system temporary directory is unavailable, set `TMPDIR` to a writable directory outside the checkout before running the copy-based gates.
## Fixed pole fibers and separated obstructions
```sh
python -B scripts/verify_v42.py
```
This reconstructs the native scalar-dependency and fixed-fiber certificate, including all four source circuits and exact odd-multiple examples. It also reconstructs the mixed-reference-sign certificate and checks it independently with Jacobian coordinates, then verifies the exact branch and local-resolution identities for the fixed-input K3 models and the maps, twists, fixed points and explicit formulas in the rational-section classification. The positive proof is [Fixed pole fibers and independent detector indices](../papers/pole_parameters/common_parameter_guard_reduction_20261116_v42.tex); the obstruction proof and computational package are indexed separately in [negative_results](../negative_results/README.md). The universal recurrence, density and infinite-progression statements are proved in the manuscripts. No smaller defining polynomial or common rational fiber is certified by these computations.
## Requirements for the retained legacy sequence
All polynomial construction checks and the finite structural algebra use **Python 3.10 or newer and its standard library**. The optional exact elliptic rank, descent, and function-field calculations additionally require **cypari2** (tested with version 2.2.4 and PARI/GP 2.17.2). The published data support offline reproduction. TeX is needed only to rebuild the PDFs.
From the repository root:
~~~sh
python3 scripts/verify.py --full
~~~
The verifier checks the publication manifest and quartic provenance, copies the inputs to a temporary directory, restores compressed data with hash checks, and runs every supplied reconstruction. It leaves published inputs unchanged. A failed equality, hash, or bound stops the verification. A receipt can be saved outside the publication tree with the optional argument --receipt /path/to/verification.json.
The standard-library stages reconstruct every source dependency and the leading **226- and 262-variable quartics**, together with the separately labelled **87-variable additional-abc quartic**. Their independent checkers reconstruct every retained and changed quadratic row, reciprocal-weight identity, nonzero-domain condition, and coefficient of the expanded sum of squares. Exact degree, content, ordinary support, and coefficient-height formulas are checked separately from the arithmetic projection theorems. The fixed 262-variable member uses $N=9682$; its effective numerical inequalities are also certified.
The **25- and 27-variable specifications**, together with **both 13-variable additional-hypothesis specifications**, are rebuilt from complete guarded source algebras. The source-to-integer conversion, point quartics, square clearings, denominator guards, matrix bounds, and finite-product cases are exact checks. Fifteen independent finite-field reconstructions for each current source are explicitly bounded supplementary evidence for the rational formulas. They are not proofs of universal identities or of the arithmetic projection theorems. The two 13-variable final specifications also certify the exact multiplication by the input coordinate.
The 25-variable degree calculation uses formal coefficient symbols to prove the bound below $2^{85}$ uniformly in the fixed odd exponent. Its $L=3$ fixture is not certified to define the integers. The effective 27-variable construction has fixed exponent $L=20483$, degree below $2^{87}$, coefficient height below $2^{2^{99}}$, and a separately checked numerical sufficient threshold. Uniform support bounds are below $2^{1979}$ and $2^{2192}$, respectively. Earlier coefficient systems are retained where they are required for exact source reconstruction.
Additional structural stages check the modular multiplicity constants, local normalization profile, exceptional contact primes, number-field finite-difference identities, elliptic examples, input-normalization obstructions, and product-height counterfamilies. These computations support the full proofs; bounded examples are labelled as such.
The release verification receipts linked from the README record every completed standard-library and optional PARI stage. They distinguish exact identities from bounded searches and state which optional rank computations were rerun.
## Individual quartic commands
Restore the compressed source tables, then reconstruct dependencies in order:
~~~sh
python3 scripts/restore_data.py
python3 computation/quartic/build_quartic392.py
python3 computation/quartic/verify_quartic392.py
python3 computation/quartic/build_quartic389.py
python3 computation/quartic/check_quartic389.py
python3 computation/quartic/verify_detector_normalizations.py
python3 computation/quartic/build_quartic370.py
python3 computation/quartic/check_quartic370.py
python3 computation/quartic/build_quartic329.py
python3 computation/quartic/check_quartic329.py
python3 computation/quartic/build_quartic317.py
python3 computation/quartic/check_quartic317.py
python3 computation/quartic/build_quartic_mixed.py
python3 computation/quartic/check_quartic_mixed.py
python3 computation/quartic/build_quartic_shared_weights.py
python3 computation/quartic/check_quartic_shared_weights.py
python3 computation/quartic/build_quartic_even.py
python3 computation/quartic/check_quartic_even.py
python3 computation/quartic/build_quartic279.py
python3 computation/quartic/check_quartic279.py
python3 computation/quartic/build_quartic273.py
python3 computation/quartic/check_quartic273.py
python3 computation/quartic/build_quartic267.py
python3 computation/quartic/check_quartic267.py
python3 computation/quartic/build_quartic263.py
python3 computation/quartic/check_quartic263.py
python3 computation/quartic/build_quartic259_v17.py
python3 computation/quartic/check_quartic259_v17.py
python3 computation/quartic/build_quartic249_v17.py
python3 computation/quartic/check_quartic249_v17.py
python3 computation/quartic/build_quartic248_v17.py
python3 computation/quartic/check_quartic248_v17.py
python3 computation/quartic/build_quartic_abc97_v17.py
python3 computation/quartic/check_quartic_abc97_v17.py
python3 computation/quartic/build_fixed_difference_v18.py
python3 computation/quartic/check_fixed_difference_v18.py
python3 computation/quartic/build_quartic318_v18.py
python3 computation/quartic/check_quartic318_v18.py
python3 computation/quartic/build_quartic276_v19.py
python3 computation/quartic/check_quartic276_v19.py
python3 computation/quartic/build_reciprocal_factors_v19.py
python3 computation/quartic/check_reciprocal_factors_v19.py
python3 computation/quartic/build_quartic265_v19.py
python3 computation/quartic/check_quartic265_v19.py
python3 computation/quartic/build_inverse_contact_v21.py
python3 computation/quartic/check_inverse_contact_v21.py
python3 computation/quartic/build_abc_inverse_contact_v21.py
python3 computation/quartic/check_abc_inverse_contact_v21.py
python3 computation/quartic/build_abc_reciprocal_contacts_v21.py
python3 computation/quartic/check_abc_reciprocal_contacts_v21.py
python3 computation/elliptic_constraints/check_fixed_difference_chart.py
python3 computation/quartic/check_coordinate_budget.py
~~~
The 329-coordinate step is an algebraic dependency needed to reconstruct the exact 317-coordinate source. All fixed source hashes are checked before they are used. The new quartic builders do not depend on unreported searches or unpublished intermediate polynomials.
## Pinned few-variable dependencies and supporting checks
~~~sh
python3 computation/few_variables/effective29_nontorsion/reproduce.py
python3 computation/few_variables/trace27_nontorsion/reproduce.py --anchor-exponent 137731
python3 computation/few_variables/forced_prime29/reproduce.py
python3 computation/square_predicates/check_square_predicates.py
python3 computation/square_predicates/check_height7_linear_multiplier.py
python3 computation/effective_sums/check_effective_elliptic_sums.py
python3 computation/quadratic_squares/check_quadratic_square_chart.py
python3 computation/scalar_normalization/check_scalar_normalization.py
~~~
These earlier exact source modules are dependencies of the current specifications. They are standalone. Their default commands reconstruct in temporary directories and compare the source and specification byte for byte with the distributed certificate. An optional --output DIRECTORY retains the reconstruction. The other individual scripts may write generated reports beside their sources; use the top-level verifier to preserve every distributed byte.
### Weighted source dependencies
After reproducing the two source algebras above, run:
~~~sh
python3 computation/few_variables/weighted_elimination/build_weighted_specification.py computation/few_variables/trace27_nontorsion/example_L137731/polynomial-specification.json computation/few_variables/weighted_elimination/weighted27
python3 computation/few_variables/weighted_elimination/build_weighted_specification.py computation/few_variables/effective29_nontorsion/certificate/polynomial-specification.json computation/few_variables/weighted_elimination/weighted29
python3 computation/few_variables/weighted_elimination/check_weighted_specification.py computation/few_variables/weighted_elimination/weighted27 computation/few_variables/weighted_elimination/weighted29 --output computation/few_variables/weighted_elimination/verification.json
~~~
### Supporting finite-algebra specifications
The following commands rebuild pinned source specifications used by the finite-algebra proofs and check their specializations. The current leading specifications have their own commands below. Each builder reads a guarded source specification; the independent checker does not import its coefficient-bound implementation.
~~~sh
python3 computation/few_variables/active_elimination/build_active_specification.py computation/few_variables/trace27_nontorsion/example_L137731/polynomial-specification.json computation/few_variables/active_elimination/active27
python3 computation/few_variables/active_elimination/build_active_specification.py computation/few_variables/effective29_nontorsion/certificate/polynomial-specification.json computation/few_variables/active_elimination/active29
python3 computation/few_variables/active_elimination/check_active_specification.py computation/few_variables/active_elimination/active27 computation/few_variables/active_elimination/active29 --output computation/few_variables/active_elimination/independent-verification.json
python3 computation/few_variables/active_elimination/check_active_degenerations.py --output computation/few_variables/active_elimination/degeneration-certificate.json
~~~
### Number fields and input normalization
The following programs use exact integers and rational arithmetic. The number-field checker writes its certificate in the current directory; the input-map checker takes an explicit output path. The full verifier runs both in an isolated copy.
~~~sh
python3 computation/number_fields/check_norm_image_reduction.py
python3 computation/input_normalization/check_quadratic_input_obstruction.py --output computation/input_normalization/quadratic-input-obstruction-certificate.json
~~~
### Uniform scalar normalization and witness constraints
~~~sh
python3 computation/scalar_normalization/check_uniform_scalar_normalization.py
python3 computation/elliptic_constraints/search_reduction_parities.py
python3 computation/elliptic_constraints/check_large_split_orders.py
~~~
The scalar checker verifies the two resultant computations, exact polynomial identities, all residue classes at the avoidance primes, local square conditions, and rational bounds. The elliptic checkers verify explicit reduction-order counterexamples and the stated finite enumeration. The large-prime check uses exact modular group arithmetic, prime-quotient witnesses, primality checks, and two independent finite-field point counts. Its example at 77017 satisfies the displayed rational congruences, without asserting the stronger Gaussian-generator conditions. The papers prove the uniform statements and specify the scope of each obstruction.
### Disjoint contacts and elliptic ranks
The contact checker factors every determinant and exclusion value specifying the exceptional primes. It uses exact integer arithmetic and does not claim to prove the underlying height premise by testing examples.
~~~sh
python3 computation/contact_heights/check_contact_height_amplification.py --output computation/contact_heights/contact-height-certificate.json
python3 -m pip install cypari2
python3 scripts/verify.py --full --with-pari
~~~
The standard-library rationality-filter checker expands the degree-eleven slope and degree-nine ordinate polynomials and repeats the explicitly bounded point search. The infinite-omission theorem uses the cited Corvaja–Zannier theorem and the proved rational-map containment, not this search.
The optional PARI stages also check the prepared fixed-pole counterexamples, with matching exact rank bounds and squareclass descent. The elliptic-ratio stage recomputes matching lower and upper rank bounds for the explicit curves and all eight quadratic twists, exact torsion orders, the polynomial expansion, and finite local identities. It uses unconditional 2-descent bounds, without analytic rank or BSD. Without `--with-pari`, the full verifier checks integrity of the stored rank certificate but does not rerun its descent calculations. The receipt states whether this stage was run.
## What the verification establishes
A passing receipt establishes the finite assertions stated in that receipt. Complete quartic coefficient tables and the finite-algebra expression graphs are exact polynomial specifications. The enormous few-variable polynomials are specified and bounded without expanding all their terms: the determinant, resultant, trace, and finite-product inequalities are proved in their papers and independently checked by the programs.
Coefficient verification does not prove the global arithmetic inputs in [Arithmetic inputs](arithmetic_inputs.md). It also does not produce a numerical sufficient parameter for an ineffective existence theorem. The 25-variable and 226-variable results retain this explicit limitation. The numerical threshold for the explicit 27-variable source is checked separately from its coefficient reconstruction.
The nonzero pole-witness strengthening uses the retained restricted-converse and descent hypotheses and the source simultaneous-realization construction. Its mathematical proof is in both leading few-variable papers. It is not a conclusion of enumerating finite cases.
## Rebuilding the papers
~~~sh
python3 scripts/build_papers.py
~~~
The build requires pdflatex and the AMS, lmodern, mathtools, geometry, booktabs, longtable, microtype, xcolor, and hyperref packages. It runs three passes per paper and rejects undefined or duplicate references, unresolved rerun requests, and overfull boxes. The [main paper index](../README.md#current-papers) links every PDF and editable TeX source. Rendered pages should be inspected after substantive edits.
PDF bytes can depend on the TeX distribution and timestamp settings even when the mathematical text is unchanged. Source and data integrity are recorded separately.
## Integrity and provenance
MANIFEST.json records the distributed file sizes and SHA-256 hashes. The quartic PROVENANCE.json binds exact source bytes, builders, independent checkers, mathematical proof files, and the data-format guide. Compressed-source metadata additionally records the uncompressed byte length and hash of each restored table.
After a reviewed change, refresh the publication manifest with:
~~~sh
python3 scripts/update_manifest.py
~~~
## Exceptional correspondences and pole parameters
~~~sh
python3 computation/number_fields/check_exceptional_correspondence.py
python3 computation/pole_parameters/check_fixed_e_obstruction.py
~~~
The first checker uses only exact rational arithmetic. It verifies the smooth exceptional surface, its birational formulas, and the exceptional lines. The second requires cypari2 and verifies the prepared inputs, their elliptic images, exact ranks, torsion, and the squareclass obstruction. PARI's rank bounds are unconditional; BSD is not used. The full verifier runs these checks in its temporary copy.
## Families under additional abc hypotheses
The full verifier rebuilds both [direct-input 13-variable sources](../computation/few_variables/direct_input13_v22/README.md), audits all three point quartics, both pole clearings and all 48 atomic guards, then reconstructs the finite-algebra polynomial $Q_B$ and the final polynomial $F_B=XQ_B$. All 64 active degree cases and the final support and coefficient consequences are checked independently. Each variant is compared byte for byte with its distributed source, specifications, and certificates.
Run the four commands for the weak $121/100$, sixth-power variant:
~~~sh
python3 computation/few_variables/direct_input13_v22/build_direct_input_source.py --shift 3 --scale-power 6 --output computation/few_variables/direct_input13_v22/weak/certificate
python3 computation/few_variables/direct_input13_v22/check_direct_input_source.py computation/few_variables/direct_input13_v22/weak/certificate --output computation/few_variables/direct_input13_v22/weak/independent-source-verification.json
python3 computation/few_variables/direct_input13_v22/build_direct_input_specification.py computation/few_variables/direct_input13_v22/weak
python3 computation/few_variables/direct_input13_v22/check_direct_input_bounds.py computation/few_variables/direct_input13_v22/weak --output computation/few_variables/direct_input13_v22/weak/independent-bound-verification.json
~~~
For the weak $16/15$, fourth-power variant:
~~~sh
python3 computation/few_variables/direct_input13_v22/build_direct_input_source.py --shift 3 --scale-power 4 --output computation/few_variables/direct_input13_v22/abc/certificate
python3 computation/few_variables/direct_input13_v22/check_direct_input_source.py computation/few_variables/direct_input13_v22/abc/certificate --output computation/few_variables/direct_input13_v22/abc/independent-source-verification.json
python3 computation/few_variables/direct_input13_v22/build_direct_input_specification.py computation/few_variables/direct_input13_v22/abc
python3 computation/few_variables/direct_input13_v22/check_direct_input_bounds.py computation/few_variables/direct_input13_v22/abc --output computation/few_variables/direct_input13_v22/abc/independent-bound-verification.json
~~~
Both use $\beta=X^2+B$ and compare the elliptic label directly with $X$. Their final degree bounds are $11774654098433$ and $11212784195585$, with support bounds below $2^{508}$ and $2^{507}$. Multiplication by $X$ preserves the complete coefficient multiset. These stages verify the coefficient families and the degree bounds uniform in the fixed shift. They neither verify the additional conjectures nor certify that the supplied shift three exceeds the ineffective defining threshold.
Ordinary Szpiro supplies weak abc at $121/100$; ordinary rational abc supplies both stated exponents. The additional-abc quartic uses ordinary rational abc. All these constructions retain the specified elliptic, pole-realization, and prime-pattern premises. The `weak_abc13` and `conditional13` modules and their proof files remain supporting dependencies, and the full verifier still reconstructs their exact data.
Exact quartic monomial counts come from complete expansions. For the determinant specifications, the current independent bound checkers give uniform support upper bounds and leave the exact support counts unknown. The older `computation/few_variables/check_monomial_bounds.py` certificate remains a dependency.
The following optional PARI commands check two retained-parameter counterexamples and the compressed elliptic subtraction identity:
~~~sh
python3 computation/pole_parameters/check_fixed_tau_obstruction.py
python3 computation/pole_parameters/check_fixed_tau17_obstruction.py
python3 computation/quartic/check_z_difference_identity.py
~~~
The common-parameter and product-contact obstructions use only the standard library:
~~~sh
python3 computation/pole_parameters/check_pole_merger_obstructions.py --output computation/pole_parameters/pole-merger-obstructions.json
python3 computation/few_variables/check_monomial_bounds.py
~~~
## Restricted abc and dense pole obstructions
~~~sh
python3 computation/restricted_abc/check_frey_denominator.py
python3 computation/pole_parameters/check_small_fixed_tau17_obstruction.py
python3 computation/pole_parameters/check_quartic_pole_obstruction.py
python3 computation/contact_heights/check_evaluation_height.py
~~~
These exact checks certify finite constants and algebraic identities used by the corresponding proofs. The height and density theorems are established mathematically in the papers.
## Local normalization and the refined height estimate
The following exact checks use only the Python standard library:
~~~sh
python3 computation/local_tests/check_rational_normalization.py
python3 computation/contact_heights/check_nebentypus_height.py
python3 computation/contact_heights/check_multiplicity_height.py
python3 computation/few_variables/merged25_v19/check_local_profile.py --output computation/few_variables/merged25_v19/local-profile-verification.json
~~~
The local checker includes equal-valuation cancellation, the mixed even-valuation inequalities, disjoint contact and pole residues, and the complete finite exceptional-prime calculation. Its finite cases support the general proofs in the local-normalization paper. The height checkers verify character-order and multiplicity arithmetic, fixed-prime constants, and the explicit exponent-$7/3$ bound. They do not replace the normalized modular-realization premise by computation. The raw-profile checker additionally verifies the Hasse clustering polynomial identity, integer-rounding inequalities, and both complete finite exceptional-prime sets.
The default verifier checks the rational identities and pinned rank inputs for the small fixed-pole obstruction. Only `--with-pari` reruns its exact two-descent. This keeps the documented standard-library route independent of optional packages.
## Twenty-five-variable source and degree certificate
~~~sh
python3 computation/few_variables/merged25_v19/build_merged_source.py --anchor-exponent 3 --output computation/few_variables/merged25_v19/certificate
python3 computation/few_variables/merged25_v19/check_merged_source.py computation/few_variables/merged25_v19/certificate --output computation/few_variables/merged25_v19/independent-source-verification.json
python3 computation/few_variables/active_elimination/build_active_specification.py computation/few_variables/merged25_v19/certificate/source-polynomial-specification.json computation/few_variables/merged25_v19/active25
python3 computation/few_variables/merged25_v19/check_merged_bounds.py --output computation/few_variables/merged25_v19/independent-bound-verification.json
~~~
The source checker proves the source-to-integer conversion, the point quartics, square clearings, and atomic guard coverage exactly. It also independently evaluates every new rational formula over fifteen finite-field samples; these samples are explicitly supplementary evidence rather than a general identity proof. The degree checker independently sums all 262,144 cases and verifies the uniform symbolic coefficient envelope. These calculations accompany the mathematical projection proof and do not certify that the numerical fixture exceeds its ineffective threshold.
## Explicit twenty-seven-variable source
~~~sh
python3 computation/few_variables/effective27_v19/build_effective_source.py --anchor-exponent 20483 --output computation/few_variables/effective27_v19/certificate
python3 computation/few_variables/active_elimination/build_active_specification.py computation/few_variables/effective27_v19/certificate/source-polynomial-specification.json computation/few_variables/effective27_v19/active27
python3 computation/few_variables/effective27_v19/check_effective_source.py computation/few_variables/effective27_v19/certificate --output computation/few_variables/effective27_v19/independent-source-verification.json
python3 computation/few_variables/effective27_v19/check_effective_bounds.py --output computation/few_variables/effective27_v19/independent-bound-verification.json
python3 computation/few_variables/effective27_v19/check_effective27_constants.py
~~~
The source audit checks nine point quartics, three square clearings, and 164 atomic guards exactly. Its fifteen finite-field reconstructions are supplementary bounded evidence. The bound checker independently sums all 262144 active cases and verifies the uniform symbolic coefficient envelope. The constant checker separately proves the exact numerical inequalities used for the fixed exponent $20483$; the paper supplies the effective height and projection arguments. The module [README](../computation/few_variables/effective27_v19/README.md) records the source census, coefficient-norm bound, and complete commands.
## Product-height obstructions
The contact-product counterfamilies are checked using exact rational polynomial identities, contact permutations, squareclasses, and their stated scale and norm conditions:
~~~sh
python3 computation/pole_parameters/check_six_contact_product.py
python3 computation/pole_parameters/check_product_height_obstructions_v19.py
~~~
The current certificate is `computation/pole_parameters/product-height-obstructions-v19-certificate.json`; the earlier six-contact identity certificate remains a dependency. The current paper includes a negative-square cancellation at every prescribed positive scale greater than four and separate norm-compatible positive-squareclass families. Each theorem states exactly which scale and norm conditions its family satisfies. None is asserted to satisfy all equations of the thirteen-variable source. These are obstructions to replacing separate contact-height controls by a height bound on their product.
## Complex multiplication and trace cancellation
`python3 computation/number_fields/check_trace_cancellation.py` checks the universal complex-multiplication and chord identities, conjugation and rank-decomposition identities, and the explicit point of infinite order. Two independent finite-field counts at17 and23 and the exact reduction orders give its nontorsion certificate. The general rank formula and height growth follow from the proofs in the [trace-cancellation paper](../negative_results/papers/number_fields/complex_multiplication_and_trace_cancellation_20261110_v19.pdf), not from finite samples.
## Rational contact-parity examples
~~~sh
python3 computation/pole_parameters/check_rational_contact_combinations_v20.py
~~~
This standard-library check uses exact `Fraction` arithmetic to reconstruct two positive-slope examples, including the simple-root residues, primality, all contact valuations, the even combined valuations, and the unit input residuals. The certificate was also independently evaluated with exact `BigInt` numerator/denominator arithmetic. These finite examples illustrate the separate universal theorem proved in `negative_results/papers/pole_parameters/rational_combinations_of_contacts_20261110_v20.tex`; they do not establish the theorem by sampling. The full verifier includes this check. The complete proof is available in both TeX and PDF.
## Logarithmic contact-height thresholds
```sh
python3 computation/contact_heights/check_logarithmic_thresholds_v21.py
```
This exact integer and rational checker certifies the amplified constants, strict index thresholds, forced-prime comparisons, and final scalar inequalities for the explicit parameters $N=9682$ and $L=20483$. The proofs appear in the two explicit construction papers. Their retained arithmetic premises and the analytic inequalities are separate from the finite numerical certificate.
## Quadratic contact covers
The exact section identities, the ten branch points, and the inert-prime obstruction are verified by:
~~~sh
python3 computation/pole_parameters/check_quadratic_contact_covers.py
~~~
The checker reconstructs the trace at index three in two ways, verifies the finite-field annihilator and congruence modulo the inert prime squared, and checks the two odd contact valuations. The paper proves the infinite progression and the genus and finiteness theorems separately. No computation asserts the completeness of a one-pole definition.
## Input-height amplification and four-contact obstruction
~~~sh
python3 computation/contact_heights/check_input_height_amplification.py
~~~
This standard-library checker verifies the exact absorption fractions for the stated eight-, six-, and five-contact criteria, the quartic-to-cubic transformations, the elliptic doubling identities, the nonzero discriminant, and the Nagell--Lutz nontorsion certificate for the four-contact obstruction. The uniform monic-power height inequality is proved in the [height-amplification paper](../papers/contact_heights/input_height_amplification_20261110_v22.tex). The infinitude and unbounded-height assertions are proved separately in the [four-contact obstruction](../negative_results/papers/contact_heights/four_contact_radical_obstruction_20261116_v42.tex). The full verifier requires byte-for-byte reproduction of `input-height-amplification-certificate.json`. This certificate does not assert a new five-contact defining polynomial or a nonintegral solution of a full source.