Infinitely divisible privacy and beyond I: resolution of the s2=2k conjecture

Differential privacy is increasingly formalized through the lens of hypothesis testing via the robust and interpretable f-DP framework, where privacy guarantees are encoded by a baseline Blackwell trade-off function f∞ = T(P∞, Q∞) involving a pair of distributions (P∞, Q∞). The problem of choosing the right privacy metric in practice leads to a central question: what is a statistically appropriate baseline f∞ given some prior modeling assumptions? The special case of Gaussian differential privacy (GDP) showed that, under compositions of nearly perfect mechanisms, these trade-off functions exhibit a central limit behavior with a Gaussian limit experiment. Inspired by Le Cam's theory of limits of statistical experiments, we answer this question in full generality in an infinitely divisible setting. We show that suitable composition experiments (Pnotimes n, Qnotimes n) converge to a binary limit experiment (P∞, Q∞) whose log-likelihood ratio L = log(dQ∞ / dP∞) is infinitely divisible under P∞. Thus any limiting trade-off function f∞ is determined by an infinitely divisible law P∞, characterized by its Levy--Khintchine triplet, and its Esscher tilt defined by dQ∞(x) = ex dP∞(x). This characterizes all limiting baseline trade-off functions f∞ arising from compositions of nearly perfect differentially private mechanisms. Our framework recovers GDP as the purely Gaussian case and yields explicit non-Gaussian limits, including Poisson examples. It also positively resolves the empirical s2 = 2k phenomenon observed in the GDP paper and provides an optimal mechanism for count statistics achieving asymmetric Poisson differential privacy.