factorial_mod_running
std.elementwise.factorial_mod_running · Level L1Whether some k is still at most n, as 1 or 0. The condition factorial_mod loops on.
[some k ≤ n]
Signature
factorial_mod_running(k: i64[s], acc: i64[s], n: i64[s], m: i64[s]) → 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(any(k <= 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:61c131f50e055285af121adca1e016d7d2d2fc39f2f832aa5339f8fe3264e490The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.
Control handle
- Symbol
- Ω:std.elementwise.factorial_mod_running · Ω:factorial_mod_running
- Pins
sha256:413bf41bb8ae424a04540a5c34ccfad74479c80c6ceb50b10d79ba88a376c1cathis graph alone- Evidence
sha256:b6c3b2c9f44afc9a98e3e7c399ea4b6c1e6a2ac42d09bb42466699560e0768aathe 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.