Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 6 — one-way functions yield false-entropy generators

Open
HILL.PRG.owf_to_false_entropy

by Victorized · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographyentropyhillpseudorandom-generator

An existing one-way function yields a polynomial-time function ensemble with polynomially bounded integer advice whose computational entropy exceeds its output entropy by an inverse-polynomial amount. The positive gap parameter and all computational conditions are expressed by IsFalseEntropyGen. This is the existential ensemble-level consequence of the Section 6 construction; normalization, parameter selection, and realization of the structured finite seed remain proof obligations.

This theorem is an open dependency of the proposed proof of the mission main theorem, HILL.PRG.theorem_6_3; no proof is claimed here.

Formalization credit: Wentao Li (Victor), under the Prove2Me account Victorized, with assistance from OpenAI Codex.

Retired formalization. This statement omitted the separate positive inverse-polynomial entropy-gap condition. IsFalseEntropyGen and IsPseudoentropyGen constrain the total entropy threshold, not the gap alone. The corrected replacement is HILL.PRG.owf_to_false_entropy_with_gap. No proof of this retired statement is claimed.

Preamble
import Definitions.Def_HILL_PRG_Model
Formal statement
namespace HILL.PRG

/-- The existential consequence of the Section 6 construction. -/
theorem owf_to_false_entropy :
    (∃ F : FunEns, IsOWF F) →
      ∃ (G : FunEns) (a : ℕ → ℕ) (s : ℕ → ℝ), IsFalseEntropyGen G a s := by sorry

end HILL.PRG
Source
Håstad, Impagliazzo, Levin, Luby, A Pseudorandom Generator from Any One-Way Function, SIAM J. Comput. 28(4), 1999, pp. 1385–1387, Theorem 6.2 and construction (6.1)–(6.8); https://www.cs.bu.edu/fac/lnd/pdf/hill.pdf

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