Interactive Proofs for General Distribution Properties

Researchers presented interactive proof systems for checking properties of an unknown distribution with sublinear resources.

The verifier can confirm claims for properties decidable by bounded-depth circuits or bounded-depth Turing machines.

The protocol is doubly efficient, with near-O(D+N^0.99) sample, time, and communication costs and O(D log N) rounds.

This could make statistical analysis easier to verify without repeating expensive computations on large datasets.