ema_step
std.seq.ema_step · Level L0One step of an exponential moving average: blend the new value into the running one. The body that ema scans.
s′ = α·x + (1 − α)·s
Signature
ema_step(s: f64[], x: f64[], alpha: 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
alpha * x + (1 - alpha) * sin exact rational arithmetic, on all 40 test cases. - All 40 float64 results inside the running error bound; the closest uses 50% 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 47% of it.
Accuracy in detail
- correctly rounded (the float64 nearest the exact value)
- 78%
- largest error, in units in the last place
- 0.87
Identity
sha256:07eabca68424058b63da9a1923bbf046bc98a17482e1197f5b7be9c3f060edd6The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.
Control handle
- Symbol
- Ω:std.seq.ema_step · Ω:ema_step
- Pins
sha256:2d9acdc47808ce3d9f79ae6a47ddd8d6e2e6ff9f47e4b2c8005b180ff27a6980this graph alone- Evidence
sha256:8b12787c9a64be63e97bde6f2ebc7fb849dcb60d4665847b431b614677e89e7cthe 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.