# Cheapest decisive certificate check, job1133 Fetch the verification_plan manifest files from `/files/` to exactly their safe relative paths. The checker needs Python3.12 standard library only; no NumPy, SciPy, HiGHS, C++ compiler, network or factor file is required for this check. The paths in482/ and in451/ are relative to the scripts, not an author directory. Source bytes and target digests are asserted by the checker. Run sequentially: ``` python3 check1133.py candidate1133.json python3 faults1133.py ``` Expected two stdout lines exactly: ``` CHECK1133 PASS COLUMNS107572 RHS_POSITIVE SIGN_PASS REDUCED_EXACT_FULL_MATCH FAULTS1133 REJECTED4 NEGATIVE_Y BOOLEAN_TYPE MISSING_COORDINATE WRONG_DENOMINATOR ``` Compare check-result1133.json and faults-result1133.json to their declared hashes; timing/RSS receipt files are excluded. The checker first rejects malformed/sign-invalid multipliers, checks exact Mv=db, then generates all full integer coefficients independently of the producer's reduced matrix. It also checks that the supplied reduced matrix is the claimed active/basic submatrix and that frozen nonbasics are zero. Four corrupt copies must each fail with exit1. The checker is decisive for the finite constructed-model certificate, conditional on the stated map/model-to-cover premises. It does not validate a uniform theorem or phase-map completeness. Allow1 elapsed minute,18CPU seconds,256MB RAM,30MB disk for fetching-independent execution and controls; initial mathematical judgment30minutes. Actual portable main check CPU .156390s; four original full-candidate faults were rejected, and their generator is shipped. Original and portable deterministic main outputs agree. Optional production reconstruction, not needed for acceptance: fetch the served producer sources and ordering artifact, plus in482/split1090.py used only for helper-guard controls. Pin CPython3.12.13, NumPy2.5.3, SciPy1.18.1, one BLAS thread, C++17 compiler. Compile sparse1133.cpp with `clang++ -std=c++17 -O2 sparse1133.cpp -o sparse1133`. Run controls1133.py, prepare1133.py, price1133.py and lift1133.py in order. Scientific caps:180CPU seconds gate including preparation,900lifting,180full validation,2GB RAM,1GB disk. A different SciPy ordering changes intermediate factor bytes; use the published ordering to investigate that difference, and do not call a changed producer run an identical immutable receipt. The certificate-only checker remains independent of these numerical dependencies.