{ "status": "passed", "external_variables": 29, "existential_witnesses": 28, "formal_algebra_generators_not_external_variables": 13, "coefficient_dag_nodes": 4353, "source_point_quartics_checked": 9, "quadratic_zero_nonzero_bits": 4, "source_closed_conditions": 0, "source_guard_atomic_factors_checked": 117, "affine_source_substitutions_checked_exactly": true, "all_repeated_quadratic_root_cases_included": true, "source_point_derivative_guards_present": true, "source_rational_square_clearings_checked": 4, "all_external_base_coordinates_occur": true, "indexed_elliptic_guard_canonical_clearing_checked": false, "degree_and_coefficient_majorants_checked": true, "maximum_rank_power_of_two_exponent": 22, "degree_bound_power_of_two_exponent": 174, "coefficient_height_bound_double_power_of_two_exponent": 177, "scope": "Exact coefficient conversion, guard coverage, finite-case grammar, and degree/coefficient bounds. The finite-algebra theorem justifies the determinant, trace, resultant and finite-product operations. The supplied source arithmetic proof uses its four cited inputs; this computation does not verify those deep theorems.", "source_json_sha256": "ca02313846d55b4940b009e9746cc3b0be7c8035991792cf6359983429b99728", "specification_sha256": "05930eebc0834299ec043cef63bd94f7c99e7e012c8015cef60f4bf6480b6a9b", "checker_sha256": "22e268054e0dbfc5e6f1093f2212e8065ef0a2d2b5b7dd1b05e22170315c7695" }