poisson_bracket_open

std.stats.poisson_bracket_open · Level L2

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

[ max(lo < hi) ]

Signature

poisson_bracket_open(lohi: i64[2, n], p: f64[n], lam: 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

poisson_quantile

sha256:8aede0e24e4244189b1d4b8685c188071ec95c431dc8583c3a85b6abf424e84e

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

Control handle

Symbol: Ω:std.stats.poisson_bracket_open · Ω:poisson_bracket_open
Pins: sha256:9b8b73886080b8eedfde6c0ccd94d7fa7b680c6e21ffc31be93afdf6ba8b77f4this graph alone
Evidence: sha256:e3f90fe95e951e41c85a634acc6f6baf9bf1837d3b5b110bba257888be453857the 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.