TorchLean API

NN.Proofs.RuntimeApprox.Graph.NumericalCertificate.Certificate

Backend-linked graph numerical certificates #

Certificate data, backend-plan linkage, generation, checking, and checked execution interfaces. Most users should import NN.Proofs.RuntimeApprox.Graph.NumericalCertificate.

Backend-linked graph certificates #

Untrusted certificate data.

The audit field records the data selected by kernel selection. The checker replans the graph under profileName and compares the complete audit, so an artifact cannot choose its own provider, trust level, or evidence classification.

Instances For

    Result returned after registry replay and backend-plan checking.

    The checker reconstructs the range rows and proves that the artifact matches that reconstruction. This structure does not by itself prove that the rows enclose the graph's real denotation; that semantic statement is carried separately by ProvedRealEnclosure.

    Instances For

      Convert an accepted kernel plan and checked range trace into raw certificate data.

      Instances For

        Obtain an accepted kernel plan or report the acceptance-gate failures.

        Instances For

          Generate a canonical certificate using an explicit numerical operation registry.

          Instances For

            Generate a canonical certificate using TorchLean's built-in numerical contracts.

            Instances For

              Check an untrusted certificate with an explicit numerical operation registry.

              Instances For

                Check an untrusted certificate using TorchLean's built-in numerical contracts.

                Instances For

                  Generate and immediately check a certificate. This is convenient for in-process callers and ensures examples exercise exactly the same checker used for imported artifacts.

                  Instances For

                    Generate and immediately check with one explicit registry.

                    Instances For

                      Exact-real execution evidence for the graph stored in a registry-checked certificate.

                      The numerical checker reconstructs interval transfers, while a semantic proof establishes that the real graph trace lies in those intervals. Keeping this proof separate prevents successful endpoint replay from being mistaken for a theorem about an unsupported real operation.

                      Instances For

                        Pair a checked IEEE replay with a proved real enclosure trace to obtain a graph-wide, pointwise error trace. Each node's error budget is the width of its checked outward interval.