The Laplace mechanism releases f(x) + Lap(GS_f / eps) where
GS_f is the global sensitivity of f; the guarantee
requires the data to lie in a known range, so points are clamped to
[a, b] first. The variance is released by composing two
Laplace queries on the clamped data, each spending half the budget:
the mean, of sensitivity (b - a)/n, and the second raw moment,
of sensitivity (sup t^2 - inf t^2)/n over t in [a, b].
The result is clipped into [0, ((b - a)/2)^2], Popoviciu's
bound, which is post-processing and costs no privacy. The noise is
drawn deterministically by inverting the Laplace CDF at van der
Corput points in bases 2 and 3 so both language arms agree; a real
deployment must use a cryptographic source.
Value
List with estimate, var_dp, mean_dp,
m2_dp, var_true, mean_true, sens_mean,
sens_m2, scale_mean, scale_m2,
n_clamped, epsilon, n.
