# Exact certificate for the frozen split-D51 constructed relaxation I obtained and checked an integer Farkas witness for the frozen constructed model. All107572 combined column coefficients are nonpositive, all5091 inequality multipliers are nonnegative, and the normalization RHS is positive. The supplied reduction also matches the full exact model generated from the unchanged maps. I request review at verified finite-computation rung. The mathematical connection from these maps/model to the arithmetic cover remains conditional on pending/recorded premises; no uniform bound, target exponent or twin-prime statement follows. ## What was executed I followed484's bounded route20 sprint. I read the current route and484, updated the prior-work search, and used482's unchanged reduced_system.txt and aux_basis.txt. Preflight verifies the named active/basic/frozen indices against the explicit basis statuses, the zero nonbasic bounds, the normalization RHS position, coefficient grammar and duplicate-free entries. No auxiliary LP, phase-map generation, old determinant/float-solution statistic or earlier dryrun ran. The bundled runtime lacked SciPy, so I installed NumPy2.5.3/SciPy1.18.1 in a local work virtual environment. A single one-thread SuperLU factorization supplied a floating ordering only. I implemented a C++17 sparse modular factorization/solve helper; signed64 products are safe for the enforced prime<2^30. It checks inverses/pivots, sparsity/RSS/CPU caps and the full modular residual. There is no dense matrix allocation. Fresh helper controls pass: a valid sign/type/length/RHS guard case and five rejected invalid cases; three independent RHS residual checks on a new2x2 matrix; singular modular pivot rejection; and a corrupted factor inverse detected by an independent residual. These are checks of new code, not repeats of482's ten-column example or484's original scalar probe. The gate passed at the first deterministic prime1073741789:837845 stored factor entries, peak live-plus-stored entry counter841205. Measured gate CPU including preflight/helper controls is0.755572s, below180s. The factor file is a12.50MB local intermediate; no large intermediate is needed for the cheapest certificate check. I reused this modular factorization for Dixon lifting. At16 digits the component reconstruction stopped after2 coordinates. At32 digits all8537 basic coordinates reconstructed, with a960-bit modulus and explicit symmetric trial numerator/denominator bounds satisfying2BnBd=0; RHS equals the positive233-digit denominator. * Saved reduction matches the full exact model; exact reduced residual is zero. * Immutable candidate SHA256 `747ad4ad91bbe9920f8cd0199bf0c12ad82772cbbe1948097fde4d8ab2357f8c`. Four corrupted copies each exit1: negative y, boolean coefficient type, missing coordinate and wrong denominator. Their observations are retained; the fault generator reproduces them from the unchanged target. I then adapted only source-input paths for the portable shipping package and reran its checker once. Its deterministic result/stdout bytes match the original; producer stages were not rerun. Original local files and failed observations remain preserved. For primal x>=0, Ax>=0, Ex=f, the checked conditions imply a contradiction: y^T Ax+z^T Ex>=f^T z>0, while(A^T y+E^T z)^T x<=0. This is the elementary conditional Farkas derivation, not an assumption that the numerical optimum or basis is nondegenerate/optimal. ## Cost, prior work and scope Total measured scientific CPU is1.966743s, including the helper controls, preflight/ordering, modular gate, lifting, full checker, four corruptions and portable path check. Peak processRSS95813632B. Local environment plus this assignment's files occupy about173200KiB. Dependency installation, compilation, fetching, packaging and transcript handling are administration and not scientific timing. Registered0.35CPUh/2GB/1GB caps were respected. Dixon lifting, component rational reconstruction and exact verification are known methods from Cook–Steffy; SciPy's documented permutations supplied the heuristic mapping. This is a new finite application/certificate, not a novel exact-linear-algebra method. Precise inspected locators are in prior-art1133.md. The233-digit denominator of this basis point is smaller than482's floating determinant size estimate. This does not prove any bound on other certificates, and does not restore a universal claim that all rounding methods are impossible. Its earlier finite rounding failures stand. I did not rerun them. Required premises451(pending),453(recorded),482(recorded) remain conditional. Success decides infeasibility of this constructed frozen relaxation, with exact map/model coefficient identity checked here. It does not independently verify phase-map completeness or prove the map/model-to-cover implication for all intervals. I return research outcome result with no automatic next_step: the finite question reached its stated success criterion and now merits independent review. Transcript publication: removed credentials/session and provider identifiers, private account/environment/local-path data, hidden reasoning/instructions, unrelated assignments and bulk third-party source payloads; retained this assignment's public work, dependency failure, actual executions and native usage records.