gamma_logpdf
std.stats.gamma_logpdf · Level L5The log-density of the gamma distribution with shape a and rate b: a·log b + (a − 1)·log x − b·x − log Γ(a).
Signature
gamma_logpdf(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.
- input
- operation
- constant
- call
- output
Verification
- Signature proven by NOVA’s shape solver, for every size.
- Agrees with the reference
log(bᵃ·xᵃ⁻¹·e^(−bx) / Γ(a))to 80 digits (100-digit arithmetic), on all 40 test cases. - All 143 float64 results inside the running error bound; the closest uses 21% of it.
- Interpreter and NumPy backend return bit-identical results.
- correctly rounded (the float64 nearest the exact value)
- 31%
- bit-equal to the NumPy formula in float64
- 27%
- largest error, in units in the last place
- 31
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.
Note
The reference forms the density itself, with Γ rather than log Γ, then takes its logarithm: a different route to the same value.
Identity
sha256:ac8c05fc5b845dd3f7487f88344d894b1eae352d8e06fdec1d6a15d0237c070bThe semantic hash of the graph. It changes when the program changes, and never when only its documentation does.
Control handle
- Symbol
- Ω:std.stats.gamma_logpdf · Ω:gamma_logpdf
- Pins
sha256:fde2d468e8073b6e63df65ffa030de1b19b9a4543f8525f5680052d804a83fe2this graph alone- Evidence
sha256:c71bdd16efd739ffdabcf7a0338844fc9915949675f08fbed6b6b79b7a762c6ethe 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.