//! Recursion: incrementally verifiable computation over the nox machine
//! (`specs/recursion.md`).
//!
//! The step relation of step `i` proves its nox segment *and* that the
//! verifier of step `i โ 1` (its AIR reduction and its accumulation step)
//! accepted: the verifier runs inside the step's trace as the recursion
//! circuit. A proof of any number of steps is the last step's proof, its
//! accumulation step and one decider โ constant in the number of steps.
//!
//! Everything the circuit re-checks is hashed field-natively: the
//! transcript is a duplex sponge over hemera's permutation ([`sponge`]),
//! the committed words are hemera Merkle trees over field elements
//! ([`word`]).
Homonyms
cyb/evy/forks/naga/src/back/hlsl/mod.rs
struct Baz { m: mat3x2, } struct Baz { float2 m_0; float2 m_1; float2 m_2; }; float3x2 GetMatmOnBaz(Baz obj) { return float3x2(obj.m_0, obj.m_1, obj.m_2); }