ipow_running

std.elementwise.ipow_running · Level L1

Whether binary exponentiation still has an exponent bit to use, as 1 or 0. The condition ipow loops on.

[max k > 0]

Signature

ipow_running(base: f64[n], k: i64[n], acc: f64[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

Calls

—

Called by

ipow

sha256:6fa91b2a96d1043caaca5a6c16c6e6164e6649b8967c2a0f50d8b296d8bb2afc

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol: Ω:std.elementwise.ipow_running · Ω:ipow_running
Pins: sha256:53dc531a8999bd78f75a15918121e22a05280bb8b8dd610beb463401ffbf5fa3this graph alone
Evidence: sha256:b50264409ff635f03ed5c452017b86c612066f60d545f0b11427cc3c9fbd9f2ethe 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.