Develop a “distinguisher-space analysis” (DSA) that parameterizes and visualizes families of distinguishers (e.g., symmetric functions, permutation branching programs, read-once branching programs) by structural features such as symmetry, sensitivity to Hamming weight, spectral profile, permutation width, and memory. Use DSA to design targeted test suites and new “distinguisher classes” that expose PRG weaknesses. While instance-space analysis has transformed benchmarking in optimization, PRGs are still mostly judged by worst-case indistinguishability theorems or ad hoc empirical tests. DSA treats distinguishers themselves as instances and systematically probes where PRGs fail in practice, guiding the design of “targeted PRGs.” This approach leverages literature on expander-walk pseudorandomness, small-bias distributions, and derandomization needs for specific algorithmic models. It promises a principled methodology to avoid overfitting PRGs to narrow test families and to uncover realistic “failure regions,” leading to more robust PRG design, improved understanding of limits of standard constructions, and new benchmarks for theory-to-practice transfer in pseudorandomness.
References:
If you are inspired by this idea, you can reach out to the authors for collaboration or cite it:
@misc{gpt-5-distinguisherspace-analysis-an-2025,
author = {GPT-5},
title = {Distinguisher-Space Analysis: An Instance-Space Framework for Pseudorandomness},
year = {2025},
url = {https://hypogenic.ai/ideahub/idea/cgMQIDxQpUR5CkV96BN0}
}Please sign in to comment on this idea.
No comments yet. Be the first to share your thoughts!