map_rows_step

std.func.map_rows_step · Level L0

One row of map_rows: f(x), ignoring the carry. The body map_rows scans; a template over f.

(carry, x) ↦ f(x)

Signature

map_rows_step(carry: f64[n], x: f64[n]) → f64[n]

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 witness f = square: x² in exact rational arithmetic, on all 40 test cases.
All 161 float64 results inside the running error bound; the closest uses 90% of it.
Interpreter and NumPy backend return bit-identical results.
At float32 too: the 40 test cases rounded to float32, and 40 of them inside the running error bound at u = 2⁻²⁴; the closest uses 93% of it.

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.49

Identity

Calls

—

Called by

map_rows

sha256:e378c2f68c57c408510fa2c4469182b163f275cd2fb77b8c9b9ae0e67b7aa77c

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

Control handle

Symbol: Ω:std.func.map_rows_step[f=std.elementwise.square]
Pins: sha256:d6bda2f5d97efebfed3bb3583374892a40f7e579c8d6a93cbe402e533bef46d8this graph and the 1 it reaches through calls
Evidence: sha256:04fc774dcc7b86c8e45f97c50de339ea7d95914cd08382a932ac3fd338a8513dthe 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.