binomial_bracket_open

std.stats.binomial_bracket_open · Level L2

Whether any binomial-quantile bracket is still open (lo < hi somewhere), as 1 or 0. The condition binomial_quantile loops on; it takes the loop's operands, of which only the bracket matters.

[ max(lo < hi) ]

Signature

binomial_bracket_open(lohi: i64[2, n], p: f64[n], trials: i64[], prob: 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 1.0 if any(lo < hi) else 0.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.

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

binomial_quantile

sha256:82eef73554add33a5c021e28ae46cc42c3b67866ce262bf8cf78c8451d176cc1

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

Control handle

Symbol: Ω:std.stats.binomial_bracket_open · Ω:binomial_bracket_open
Pins: sha256:19eff5cbf145decbff86a90758d57f6a2d8abd29358570a65d90ed06531efc58this graph alone
Evidence: sha256:d415988be8ed8c2eea781dbf305b4ea1060c96bc81fc3e9a3c125e0037ceccb7the 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.