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}\).

Background

The paper studies randomized nonuniform pruning procedures that retain a subset of a circuit’s satisfying assignments and aim to retain exactly one witness. Affine hashing provides a general success guarantee of order Θ(1/n)\Theta(1/n), where nn is the witness length. The paper proves that success of order 1/log⁡L1/\log L, measured using the circuit-description length LL, already yields a complexity collapse NP⊆P\mathrm{NP}\subseteq\mathrm{P}.

Consequently, the authors leave unresolved the intermediate regime between these two scales, including success probabilities that grow asymptotically faster than $1/n$ but decay asymptotically faster than 1/log⁡n1/\log n. The open range concerns whether such guarantees can exist under the assumption NP⊈P\mathrm{NP}\not\subseteq\mathrm{P}.

References

The range between $\Theta(1/n)$, achieved by affine hashing, and $O(1/\log n)$ remains open.

— Constant-Probability Witness Isolation Implies $\mathrm{NP}\subseteq\mathrm{P/poly}$  (2609.29302 - Daniel, 24 Sep 2026) in Abstract; Section 1, paragraph “The remaining range and the length convention”

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.

— Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation  (2610.11432 - Daniel, 8 Oct 2026) in Section 6, Conclusion and open problems, item 1

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}).

— Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation  (2610.11432 - Daniel, 8 Oct 2026) in Section 6, Conclusion and open problems, item 2

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?

— Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation  (2610.11432 - Daniel, 8 Oct 2026) in Section 6, Conclusion and open problems, item 3