Theorem 8 — Generic hardness of planted search
OpenAddXnor.Supplement.theorem_8add-xnorlower-boundsp2o-gran-per-chapterp2o-plan-paperp2o-v1query-complexity
Let , , and . In the planted ideal-chain experiment, every randomized adaptive adversary making at most forward or inverse oracle queries succeeds with probability at most
Consequently, there is an absolute constant such that success probability at least requires
When , including the balanced case , this gives .
Differences from the source:
- encoding: randomized adversary with oracle access → an arbitrary finite probability law over adaptive oracle trees of depth at most ; reason: all query, answer, and output spaces are finite, so this represents the same randomized strategies
- encoding: independent uniform permutations and planted values → exact nested finite averages over permutation families, initial states, and planted operator strings; reason: finite-type encoding with the same product distribution
Preamble
import Mathlib import Definitions.Def_AddXnor_Supplement_ideal set_option autoImplicit false
Formal statement
namespace AddXnor.Supplement
/-- **Theorem 8 (Generic hardness of planted search)** (Wang, Lv, Shen, Zhang,
*Add/XNOR Chains*, manuscript, sha256 405d6dda..., Theorem 8, p.25 (PDF p.25)).
The first clause is the explicit success bound for every randomized adaptive adversary with at
most `T` forward/inverse permutation queries. The remaining clauses state the absolute-constant
square-root consequence, including its `m ≥ q` specialization. This theorem is only about the
independent ideal-permutation planted experiment encoded by `plantedSuccess`. -/
theorem theorem_8 :
(∀ (q m T : ℕ), 3 ≤ q → max q 4 ≤ T → T ≤ 2 ^ (m - 3) →
∀ (R : Type*) [Fintype R] [Nonempty R] (law : FiniteLaw R)
(adv : R → BitVec m → BitVec m → OracleTree q m T),
plantedSuccess law adv ≤
3 * T / (2 : ℝ) ^ ((q + 1) / 2) +
10 * T ^ 2 / (2 : ℝ) ^ m + 1 / (2 : ℝ) ^ q) ∧
∃ c : ℝ, 0 < c ∧
∀ (q m T : ℕ), 3 ≤ q → max q 4 ≤ T → T ≤ 2 ^ (m - 3) →
∀ (R : Type*) [Fintype R] [Nonempty R] (law : FiniteLaw R)
(adv : R → BitVec m → BitVec m → OracleTree q m T),
1 / 2 ≤ plantedSuccess law adv →
(T : ℝ) ≥ c * min ((2 : ℝ) ^ ((q + 1) / 2))
(Real.rpow 2 ((m : ℝ) / 2)) ∧
(m ≥ q → (T : ℝ) ≥ c * Real.rpow 2 ((q : ℝ) / 2)) := by sorry
end AddXnor.Supplement
Source
Wang, Lv, Shen, Zhang, manuscript (sha256 405d6dda…), Theorem 8, p.25 (PDF p.25)