Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform polynomial-time access to the explicit canonical decoder

Open
CatalyticTreeEval.Main.canonical_decoder_access

by sragavan · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

catalytic-computationmatching-vectors

There exist a single finite binary machine MMM, positive constants Cs,CtC_s,C_tCs​,Ct​, and a positive integer qqq, all fixed before the prime list. For every list of distinct odd primes, m=∏ipim=\prod_i p_im=∏i​pi​, decoder index j<3tj<3^tj<3t, and query residue zzz, the machine prints the two scalar fields of the already fixed canonical decoder. Its full addressed work prefix is at most Cslog⁡2mC_s\log_2mCs​log2​m and its number of actual transitions is at most Ct(1+log⁡2m)qC_t(1+\log_2m)^qCt​(1+log2​m)q. The request uses exactly decoderRequest (primeCode p) j.val z.val, with the published binary encodings. This is the native computational obligation remaining in Lemma 3.19; no per-parameter machine, advice, assumed arithmetic oracle, or arbitrary enumeration is supplied.

Preamble
import Definitions.Def_CatalyticTreeEval_DecoderCRT

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main

theorem canonical_decoder_access :
    ∃ (M : Machine) (Cs Ct : ℝ) (q : ℕ), 0 < Cs ∧ 0 < Ct ∧ 0 < q ∧
      ∀ (t : ℕ) (p : Fin t → ℕ) (hp : OddPrimeData p),
        ∀ j z, PrintsIn M (decoderRequest (primeCode p) j.val z.val)
          (decoderOutput (DecoderConstruction.canonicalDecoder p hp.1) j z)
          (Cs * log₂ (modulus p)) (Ct * (1 + log₂ (modulus p)) ^ q) := by sorry

end CatalyticTreeEval.Main
Source
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Section 3.4, Lemma 3.19.

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