Module verify 

Result verification — the trusted gate that runs before payment. It never trusts the executor; it re-derives correctness cheaply with a local reference.

• Dense matrix product → Freivalds’ algorithm: to check A·B = C without recomputing the O(n³) product, pick a random ±1 vector x and test A(Bx) == Cx in O(n²). A wrong C passes a single round with probability ≤ ½, so r independent rounds bound the false-accept probability by 2⁻ʳ. This makes verify-before-pay cheaper than doing the work — essential for the economics.
• Embedding artifact → ranking reproduction: a trained table is trusted only if it actually ranks the held-out check triples well (MRR ≥ floor) — termination is not evidence of learning.

Structs

VerifyPolicy

Tunables for verification.

Enums

VerificationVerdict

The verdict of verifying a returned result against the job’s input.

Functions

verify

Verify a result against the job input. Mismatched kinds are rejected (fail closed).