rnn

std.nn.rnn · Level L2

Run an Elman recurrent network over a sequence of inputs; returns every hidden state. A Scan of rnn_cell, differentiable end to end.

hₜ = tanh(W·hₜ₋₁ + U·xₜ + b)

Signature

rnn(h0: f64[k], X: f64[n, m], W: f64[k, k], U: f64[k, m], b: f64[k]) → f64[n, k]

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.

h0f64[k]Xf64[n, m]Wf64[k, k]Uf64[k, m]bf64[k]Scan·rnn_cellHHf64[n, k]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference h = h0; for each x in X: h = np.tanh(W @ h + U @ x + b) to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 618 float64 results inside the running error bound; the closest uses 15% 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 12% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
82%
largest error, in units in the last place
155

Large ulp counts appear where a result is tiny next to the numbers it is computed from (after cancellation, for example), so one unit in the last place is tiny too; the absolute error is still inside the bound. Results within their own error of zero are not counted.

Identity

Calls
Called by
—
sha256:a6d078c36678c99c773bddd11dc46ccd38d9c481ae49502d7062b9016e8be7b1

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

Control handle

Symbol
Ω:std.nn.rnn · Ω:rnn
Pins
sha256:82ccda9654d9d0db4293b006eaacf1b645e1ceb35b47fa326f488141b7f3e1f6this graph and the 1 it reaches through calls
Evidence
sha256:9c9b60ca5e45e0a9e293afe0dea350cb09b32c3c87c8e175764ca6d7fdfbb86athe 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.

ΣEML 2026

Efficient New Language — a high-density semantic overlay for humans and AI agents.

This site’s demos run on the real EML toolchain, in your browser.

© 2026 EveMissLab (一言諾科技有限公司) / Neo.K. All rights reserved.