This entry improves the Paley tournament construction of order by changing one row of its second recipe. The target remains predicate type , while the guard changes from type to type and the allowed tolerance changes from to .
A complete finite profile certificate proves that one four-phase cycle now increases the sensitivity upper bound by at most
while preserving block-sensitivity growth by and a sensitivity witness growing by . Thus there are total Boolean functions satisfying
The resulting endpoint is
and exact rational logarithm bounds certify the campaign value .
This supersedes the pending decimal-only proposal at : unlike that proposal, this entry changes the underlying finite recipe and lowers its kernel-checked sensitivity-growth radius.
Background: the prior Paley-11987 theorem, OpenAI problem 132, and the campaign proposal.
theorem SensitivityCampaign.paley11987_mutation_45238246 :
SensitivityCampaign.AchievesExponent
(2131125302137 / 1000000000000 : ℝ) := by sorryFor every real and every integer , there is a total Boolean function with
The decimal denotes the exact rational number .
No open leaves. Every sub-goal is proved or awaiting decomposition.