pow_mod_running
std.elementwise.pow_mod_running · Level L1Whether binary exponentiation still has an exponent bit to use: some k above 0, as 1 or 0. The condition pow_mod loops on.
[max k > 0]
Signature
pow_mod_running(base: i64[n], k: i64[n], acc: i64[n], m: i64[n]) → 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 > 0))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:463249546ad29d6694aa7c5072de2faefa73bdba1f1c0661663d8f8bab2e8524The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.
Control handle
- Symbol
- Ω:std.elementwise.pow_mod_running · Ω:pow_mod_running
- Pins
sha256:7a557210793c2475d43f81837a77917a68082452ff06d33f8e53930d58e6fa69this graph alone- Evidence
sha256:f2df1f3f93c80f63c7eb0d8a90ae4e40c9003fb17205f86ae65c8ae9c84af46bthe 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.