gamma_cdf

std.stats.gamma_cdf · Level L5

The gamma distribution's cumulative probability with shape a and rate b: P(a, b·x).

F(x; a, b) = P(a, b·x)

Signature

gamma_cdf(x: f64[n], shape: f64[], rate: 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]ratef64[]shapef64[]MultiplytGammaIncppf64[n]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference scipy.special.gammainc(a, b·x) to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 154 float64 results inside the running error bound; the closest uses 6% 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)
44%
largest error, in units in the last place
16

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:9aa3479c9766840949f259af79dda0a36da84ec1130ce86c5cc69f988d528987

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

Control handle

Symbol
Ω:std.stats.gamma_cdf · Ω:gamma_cdf
Pins
sha256:1373a99020dbeef30b4de856da3319d36a3bc78c283f98dcbdd68567d3a4f756this graph alone
Evidence
sha256:c14b43c1f5ce797f22aba49c154518b42500df8bd0b1cdd245137d039ded53bbthe 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.