Intermediate witness-isolation success scales
Determine whether randomized nonuniform polynomial-size pruning transformations can achieve witness-isolation success probabilities strictly between the affine-hashing scale \(\Theta(1/n)\) and the inverse-logarithmic scale \(O(1/\log n)\), specifically in the regime \(p_{\mathrm{wit}}(n)=\omega(1/n)\) and \(p_{\mathrm{wit}}(n)=o(1/\log n)\), without implying \(\mathrm{NP}\subseteq\mathrm{P}\).
References
The range between $\Theta(1/n)$, achieved by affine hashing, and $O(1/\log n)$ remains open.
The endpoint. Does success $C/n$ for a constant $C$ have any consequence? With one $q$-bit block per source the threshold is at least $2q/n$ (Corollary~\ref{cor:blockbarrier}), so the present method cannot reach it.
Implicit filters and many components. Do the results extend to isolators that output a circuit computing an affine predicate, without its coefficients? Our test needs the coefficients. For explicit unions, the flag bound is trivial once the number of components reaches $m/2$ (Lemma~\ref{lem:union}).
Arbitrary outputs. For isolators whose output is an arbitrary circuit, the known collapses are far from $1/n$. Does any inverse-polynomial success probability have a consequence there?