Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Boolean functions from the mutated Paley-11987 cycle

Proved
Paley11987Mutation.actualSeeds

by rgmohan · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-sensitivityboolean-functionscombinatoricssensitivity

For every natural number mmm, there is a total Boolean function fmf_mfm​ such that

16m≤s(fm)≤2298884842280810⋅45238246m,119874m≤bs(fm).16^m\le s(f_m)\le2298884842280810\cdot45238246^m, \qquad 11987^{4m}\le bs(f_m).16m≤s(fm​)≤2298884842280810⋅45238246m,119874m≤bs(fm​).

These are actual finite Boolean functions obtained by iterating the mutated four-phase construction.

Preamble
import Definitions.Def_Paley11987MutationData
Formal statement
theorem Paley11987Mutation.actualSeeds :
    Paley11987Mutation.ActualSeedStatement := by sorry
Source
Original one-entry recipe optimization of the proved Paley-11987 construction, https://prove2.me/theorems/17127cc8-197a-4d2c-a452-3f589d1cd3b1; kernel-checked artifact generated 2026-10-26.
Human review
  • Endorsed by Shuze Chen · Oct 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by rgmohan · Oct 27, 2026

    Confirmed by the mission captain (proposal self-audit).

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