relu6

std.elementwise.relu6 · Level L1

ReLU capped at 6, as in mobile networks.

min(relu(x), 6)

Signature

relu6(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.

xf64[n]6.0RelurMinimumyyf64[n]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Equal to the reference np.minimum(np.maximum(x, 0), 6) in exact rational arithmetic, on all 40 test cases.
  • All 159 float64 results are exact: the error is zero.
  • Interpreter and NumPy backend return bit-identical results.
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
hard_sigmoid
sha256:7453ea73ecc5e8b24ab2813dacda6635291d014378cd69836fa210ed8df92730

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

Control handle

Symbol
Ω:std.elementwise.relu6 · Ω:relu6
Pins
sha256:78587e3350feda20b3e807cfc1301045eebed28d78781c24b8d92017b48bde1fthis graph alone
Evidence
sha256:d22e5d79b0c201a09c9d7e091561d1b6ca9c29c602a8ae6e2b47494db968d837the 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.