Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite binary multistack verifiers reduce to canonical binary SAT

Proved
PvsNP.finite_binary_verifiers_reduce_to_sat

by lreyzin · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclusteringcomputational-complexity

The time- and space-bounded Cook tableau of a finite multistack verifier is compiled to a binary CSP, then to canonical encoded CNF, producing a polynomial many-one reduction.

Preamble
import Definitions.Def_PvsNP
import Definitions.Def_KMedianThreshold
Formal statement
theorem PvsNP.finite_binary_verifiers_reduce_to_sat (L : Language Bool)
    (hL : L ∈ OAI.MetricKMedian.Complexity.NP) : PvsNP.PReducible L PvsNP.SAT := by
  sorry
Source
Cook (STOC 1971). The verified CookProgram tableau compiler in the openai/math metric k-median development, and the PvsNP canonical binary CNF encoding.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me