Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational correctness of the native recursive independent-set core

Proved
Lax263307Proofs.NativeCoreExecution.command_spec

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitygraph-theory

Fix the core configuration and uniform resource invariants for its LP and flow backends. For a graph GGG and valid initialized recursive state, assume the eligibility, workspace and word-width bounds. The fixed core command terminates and returns the answer of the specified recursive target search. Writing NS,NTN_S,N_TNS​,NT​ for the recursive work bounds, its operational clock is

((NT+26+68(NS+3))n+98).((N_T+26+68(N_S+3))n+98).((NT​+26+68(NS​+3))n+98).

The conclusion includes the full root protocol and answer representation.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax263307Proofs.NativeCoreExecution.command_spec : ∀ {n : ℕ} (D fuel S v w localSteps localTime branches : ℕ) (cfg : Lax263307Proofs.NativeCoreMachine.Config)
  (G : SimpleGraph (Fin n)) [inst : DecidableRel G.Adj] (lp flow : List ℕ → List ℕ) (extent : String → ℕ)
  (eligible : Lax263307Proofs.NativeNodeProtocol.Eligible)
  (resources :
    Lax263307Proofs.NativeNodeExecution.Resources D S v w localSteps localTime branches cfg lp flow extent eligible),
  (∀ (k : ℕ), 0 < k → k ≤ n → eligible fuel n G k 0) →
    S * (Lax263307Proofs.NativeCoreMachine.frameArrays cfg).length +
                (Lax263307Proofs.NativeCoreMachine.frameScalars cfg).length +
              S +
            (Lax263307Proofs.NativeCoreMachine.frameArrays cfg).length +
          10 <
        2 ^ w →
      n + fuel + 20 < 2 ^ w →
        2 ^ n < 2 ^ w →
          have NS := Lax263307Proofs.NativeRecursionBudget.work localSteps branches fuel;
          have NT := Lax263307Proofs.NativeRecursionBudget.work localTime branches fuel;
          Lax808846Proofs.Reasoning.Spec (2 ^ w) (Lax263307Proofs.NativeCoreExecution.Input (2 ^ w) D fuel S v G extent)
            (Lax263307Proofs.NativeCoreMachine.command cfg)
            (fun (x τ : Lax808846Proofs.Imp.Env) =>
              Lax263307Proofs.NativeCoreExecution.Root (2 ^ w) D S v cfg G extent τ ∧
                Lax263307Proofs.NativeRootTrace.Answer
                  (Lax263307.TargetSearch.search
                    (Lax263307.RecursiveAlgorithm.attempt lp flow cfg.a cfg.K cfg.b D fuel G) n)
                  τ)
            ((NT + 26 + 68 * (NS + 3)) * n + 98) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeCoreExecution.lean, theorem command_spec

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