Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fine-bit exposure at every admissible round-six parameter record

Proved
IntMul.Kappa.R6.Leaf.fineNeed6_all

by marwahaha · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryinteger-multiplicationturing-machines

For every admissible round-six parameter record PPP, the fine-bit exposure interface FineNeed6 P of xuanji's round-six machine holds.

Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs16

set_option autoImplicit false
set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R6.Leaf

theorem fineNeed6_all (P : Prm) (hP : P.Ok) : FineNeed6 P := by
  sorry

end IntMul.Kappa.R6.Leaf
Source
xuanji's round-six development on Prove2me (Def_IntMul_Kappa_R6_Defs1, Defs16), Jain round seven data (Def_IntMul_KappaJainData).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me