CROWNNodeCert #
Per-node α-CROWN certificate checking (graph dialect).
This mirrors NN.Verification.IBPNodeCert, but for affine bounds produced by a CROWN/DeepPoly pass
with optional α-parameters for the ReLU lower relaxation (α-CROWN).
Certificate JSON format:
{
"ctx": { "inputId": 0, "inputDim": 2 },
"ibp": [ null | { "lo": [...], "hi": [...] }, ... ],
"crown": [
null |
{
"loA": [[...], ...], "loC": [...],
"hiA": [[...], ...], "hiC": [...]
},
...
],
"alpha": [ null | [...], ... ] // optional per-node ReLU α vector
}
Trust boundary notes:
- The certificate is untrusted; we accept it only if its binary32 affine transcript exactly matches Lean recomputation.
- Transcendental relaxations are checked only via structural recomputation, not via a formal "libm is correct" guarantee.
The helpers below are the JSON-facing boundary for the CROWN certificate checkers. They parse the artifact, require exact binary32 agreement for affine replay data, and check parent and shape requirements before invoking the semantic checker.
Read a CROWN node certificate from JSON on disk.
Instances For
Check the local CROWN enclosure condition for one node against a certificate entry.
Instances For
The α-CROWN replay function associated with a parsed certificate.
Instances For
The final in-memory acceptance decision for an α-CROWN artifact.
diagnosticsOk records parsing-independent IBP, shape, domain, and incremental-replay checks. The
second conjunct establishes local replay consistency. Semantic enclosure additionally requires
coverage of the relevant graph nodes and proved transfer rules for their operations.
Instances For
Acceptance of the concrete α-CROWN decision supplies graph-level local consistency.
Check a per-node α-CROWN certificate against Lean's propagation rules.
Returns true iff every supplied IBP box contains Lean's authoritative recomputation and every
node's affine replay data agrees exactly with Lean's CROWN step.