matching_running
std.linalg.matching_running · Level L1Whether the matching search is still running: 0 ≤ p < n, as 1 or 0. The condition of max_matching's second loop.
[0 ≤ p < n]
Signature
matching_running(p: f64[], ch: f64[n], A: f64[n, n], nu: f64[]) → f64[]
Structure
The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.
- input
- operation
- constant
- call
- output
Verification
- Signature proven by NOVA’s shape solver, for every size.
- Equal to the reference
float(0 <= p < n)in exact rational arithmetic, on all 40 test cases. - All 40 float64 results are exact: the error is zero.
- Interpreter and NumPy backend return bit-identical results.
- At float32 too: the 40 test cases rounded to float32, and 40 of them exact, with zero error.
Accuracy in detail
- correctly rounded (the float64 nearest the exact value)
- 100%
- bit-equal to the NumPy formula in float64
- 100%
- largest error, in units in the last place
- 0
Identity
sha256:806f7befec34a52d8cea63df20cdc3cdd37279f67d92227fd922395a03825f3bThe semantic hash of the graph. It changes when the program changes, and never when only its documentation does.
Control handle
- Symbol
- Ω:std.linalg.matching_running · Ω:matching_running
- Pins
sha256:edc92bba4b04ad43c96212d9793afb386d9e7bb0c9ab83cc0a25e4f621afaf9dthis graph alone- Evidence
sha256:2e490c028b1358ec11ec4526817ca1ed513757f5881d03de6c26c2f117341e59the hash of its verification record- Needs
- no capability: a pure function
Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.