What does Differential Privacy for Business Statistics conclude, in numbers, about “A Noisy Release Procedure for the Public Statistics of a Pay-per-Use Service, and a Plan for Refutation”?
Answer: Chapter 8 gives a seven-step noisy release procedure for the public statistics of a pay-per-use service, the distilled tool, the Privacy Budget Accountant, an audit method (100 trials catch an implementation with halved noise scale with probability 0.869) and a pre-registered plan for refutation. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Scope of the numbers: Chapter 3 deals with sensitivity: revenue clipped per person has a root mean square error of 6545 yuan in the illustrative data, 4.09 % of revenue, and a customer profile spends the budget only once by parallel composition. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.869, 100
| audit of a claimed eps = 1.0 count mechanism | ||||
| real eps | trials M | thresh t | power | alarm if ok |
| 4.0 | 100 | 40.20 | 0.891 | 0.000 |
| 3.0 | 100 | 40.30 | 0.916 | 0.000 |
| 2.0 | 100 | 40.60 | 0.869 | 0.006 |
| 1.5 | 268 | 40.85 | 0.870 | 0.022 |
| 1.2 | 1609 | 40.90 | 0.850 | 0.013 |
Show the full program
# Chapter 8. p82: how many trials an audit needs to catch a weak eps.
# The release code claims eps = 1 for a count. A bug (say, noise scale
# divided by 2) makes the real eps larger. The audit runs the mechanism
# M times on a neighbour pair (true counts 40 and 41), thresholds at t,
# and computes a one-sided lower bound
# eps_lo = ln((TPR - z s1) / (FPR + z s0)), s = sqrt(P (1 - P) / M).
# The bug is caught when eps_lo > 1. Planning uses the expected rates
# with z = 1.645 + 0.842 (5% one-sided, 80% power); a fixed-seed run of
# 2000 audits checks power and the false-alarm rate at the planned M
# (M starts at 100 so that normal approximations are reasonable).
import math
import random
CLAIM = 1.0
Z_PLAN, Z_TEST = 1.645 + 0.842, 1.645
def tail(t, mu, b):
z = (t - mu) / b
return 0.5 * math.exp(-z) if z >= 0 else 1.0 - 0.5 * math.exp(z)
def eps_lo(tpr, fpr, m, z):
lo = tpr - z * math.sqrt(tpr * (1 - tpr) / m)
hi = fpr + z * math.sqrt(fpr * (1 - fpr) / m)
return math.log(lo / hi) if lo > 0 and hi < 1 else 0.0
def plan(eps_true):
b = 1.0 / eps_true
grid = [40.0 + k / 20.0 for k in range(0, 61)]
m = 100
while m < 10 ** 7:
for t in grid:
if eps_lo(tail(t, 41, b), tail(t, 40, b), m, Z_PLAN) > CLAIM:
return m, t
m = int(m * 1.05) + 1
return None, None
rng = random.Random(20261113)
def run_audits(eps_true, m, t, reps=2000):
b = 1.0 / eps_true
p1, p0 = tail(t, 41, b), tail(t, 40, b)
caught = 0
for _ in range(reps):
k1 = rng.gauss(m * p1, math.sqrt(m * p1 * (1 - p1)))
k0 = rng.gauss(m * p0, math.sqrt(m * p0 * (1 - p0)))
tpr = min(max(k1 / m, 1e-9), 1 - 1e-9)
fpr = min(max(k0 / m, 1e-9), 1 - 1e-9)
if eps_lo(tpr, fpr, m, Z_TEST) > CLAIM:
caught += 1
return caught / reps
print("audit of a claimed eps = %.1f count mechanism" % CLAIM)
print("%9s %10s %9s %10s %12s" % (
"real eps", "trials M", "thresh t", "power", "alarm if ok"))
for eps_true in (4.0, 3.0, 2.0, 1.5, 1.2):
m, t = plan(eps_true)
print("%9.1f %10d %9.2f %10.3f %12.3f" % (
eps_true, m, t, run_audits(eps_true, m, t),
run_audits(CLAIM, m, t)))Single source and citation
Fan, Y. (2026). Differential Privacy, the Laplace Mechanism and Privacy-Budget Accounting: Publishing Business Statistics without Exposing Any Individual (Version 1.0.0), Chapter 8: A Noisy Release Procedure for the Public Statistics of a Pay-per-Use Service, and a Plan for Refutation. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-296 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026296,
author = {Fan, Yafu},
title = {Differential Privacy, the Laplace Mechanism and Privacy-Budget Accounting: Publishing Business Statistics without Exposing Any Individual},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · "Anonymous" Is Not Anonymous: Quasi-Identifiers, Differencing and Reconstruction
- Chapter 2 · The Laplace Mechanism: Epsilon Is a Ceiling on the Likelihood Ratio
- Chapter 3 · Sensitivity: Clip Revenue First, and Spend the Budget Once on a Customer Profile
- Chapter 4 · Composition and Budget Accounting: Basic, Advanced and Optimal Books
- Chapter 5 · Randomized Response and the Local Model: Letting Customers Add the Noise
- Chapter 6 · How Large Should Epsilon Be: the Dispute over the 2020 United States Census and the Price of Small Numbers
- Chapter 7 · Classical Sources East and West: Han Feizi on the Difficulty of Persuasion and Warner's Randomized Response