Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.16 — false entropy yields pseudoentropy

Proved
HILL.PRG.false_entropy_to_pseudoentropy_with_gap

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

cryptographyentropyhillpseudorandom-generator

A mildly nonuniform false-entropy generator yields a mildly nonuniform pseudoentropy generator. In the formal model, both generators may have polynomial-time computable seed and output lengths, and their integer advice is polynomially bounded. The conclusion requires computational entropy exceeding the new seed length by a positive inverse-polynomial amount.

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.

The separate PolyParam condition explicitly requires a positive inverse-polynomial entropy gap. It is essential: the model predicates for pseudoentropy and false entropy do not impose it by themselves.

This corrects HILL.PRG.false_entropy_to_pseudoentropy, whose statement omitted the separate gap condition.

Preamble
import Definitions.Def_HILL_PRG_Model
Formal statement
namespace HILL.PRG

/-- The existential consequence of Construction 4.15 and Lemma 4.16. -/
theorem false_entropy_to_pseudoentropy_with_gap :
    (∃ (F : FunEns) (a : ℕ → ℕ) (s : ℕ → ℝ), PolyParam s ∧ IsFalseEntropyGen F a s) →
      ∃ (G : FunEns) (b : ℕ → ℕ) (t : ℕ → ℝ), PolyParam t ∧ IsPseudoentropyGen G b t := 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, p. 1381, Construction 4.15 and Lemma 4.16; 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