beta_cdf

std.stats.beta_cdf · Level L5

The beta distribution's cumulative probability: I_x(a, b), the regularized incomplete beta function.

F(x; a, b) = I_x(a, b)

Signature

beta_cdf(x: f64[n], a: f64[], b: f64[]) → 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]af64[]bf64[]BetaIncppf64[n]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference scipy.special.betainc(a, b, x) to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 122 float64 results inside the running error bound; the closest uses 4% 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 <1% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
30%
largest error, in units in the last place
17

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:6c3bb29edd6013b920bdb3b110692ae3e7236712c657f86f3aa44c0307fa254c

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

Control handle

Symbol
Ω:std.stats.beta_cdf · Ω:beta_cdf
Pins
sha256:283e75fdd36953f69a345039674b455605b5bab101cb695fd9cb49e053f28f75this graph alone
Evidence
sha256:35a2aa5a464906560b5ee911f09c444d098bafb55a921d9a3b5993d52cb32b28the 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.