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.
- profileName : String
Backend profile the artifact claims to have been planned under.
- registryName : String
Numerical operation registry the artifact claims produced its range rows.
- sources : Array SourceRange
Interval assumptions on the graph's external sources.
Claimed node-by-node range rows; the checker replays and compares them.
- audit : NN.Backend.KernelPlanAudit
Claimed kernel-plan audit; the checker replans the graph and compares it.
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.
- graph : NN.IR.Graph
The exact graph whose ranges and kernel plan were reconstructed by the checker.
The untrusted artifact supplied to the checker, retained for inspection and serialization.
- sources : Array CheckedSourceRange
Source assumptions whose interval endpoints have been proved finite and ordered.
- ranges : Array CheckedNodeRange
The canonical node-by-node range trace reconstructed from the graph.
- backendPlan : NN.Backend.AcceptedGraphKernelPlan
The kernel plan accepted when the checker replanned
graph. Proof that the reconstructed trace matches every range row claimed by
raw.Proof that the accepted plan's audit is the one stored in
raw.
Instances For
Result of executing the canonical IR with bit-level binary32 semantics and checking every intermediate value against a registry-replayed range trace.
- certificate : RegistryCheckedCertificate
The registry-checked certificate the replay was checked against.
- values : Array (Spec.SomeTensor (FloatLib.Floats.ExecFloat.Binary 8 23 FloatLib.Floats.Formats.BinaryInterchange.FloatFormat.Encoding.ieee (FloatLib.Floats.Formats.BinaryInterchange.FloatFormat.Encoding.ieee.defaultBias 8) _proof_1 _proof_2 _proof_3 _proof_4))
Bit-level binary32 node values.
executeIEEE32obtains these from graph replay; this structure does not itself carry a denotation equality for independently supplied values. Proof that every replayed value lies in its checked range row.
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
Execute a graph under ExecFloat.Binary 8 23 and check all intermediate tensors against the
certificate.
This reference replay path gives imported runtime artifacts a bit-level oracle. The backend audit records the capsules and numerical policies selected when the graph is replanned. The audit is not runtime provenance and does not prove that those kernels produced the imported values.
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.
- payload : NN.IR.Payload ℝ
Real-valued constants and external tensors used by the graph execution.
- input : Spec.SomeTensor ℝ
Real-valued graph input.
- values : Array (Spec.SomeTensor ℝ)
Complete real-valued node trace, in graph order.
Evidence that
valuesis exactly the graph's denotational execution trace.- enclosed : ArraysRelated SomeTensorEnclosed certificate.ranges self.values
Pointwise evidence that every real node value lies in its checked interval.
Instances For
Pair range-checked binary32 values with a proved real enclosure trace to obtain a graph-wide, pointwise error trace. Each node's error budget is its interval width. The bound follows from shared enclosure; it does not require or establish native execution provenance.