A complete length-preserving one-way function exists
ProvedLevin2003.exists_complete_length_preserving_owfThere is a polynomial-time computable, length-preserving function that is one-way if and only if one-way functions exist at all.
This is the computational counterpart of the goal theorem, and the first step of the reduction sketched in Section 4.3: 'A complete owf is easy to construct as a modification of a universal Turing Machine (UTM). ... We start with a UTM, add a time counter that aborts after, say, steps. We preserve a copy of the program prefix and force it, as well as the input length, on the output. This produces a complete "computational" length-preserving owf.' Length preservation of such a rests on Section 4.2, where any one-way function is turned into a length-preserving one by separating siblings with a universal hash family and hashing instances down to the length of the witnesses (Proposition 2).
Note that the statement asked for here is the bare existence of a complete length-preserving one-way function candidate; the quantitative security relation of the paper's Proposition 2 is not expressible in this mission's model and is not claimed.
import Definitions.Def_Levin2003_tiling_expansion
namespace Levin2003
/-- There is a complete length-preserving one-way function candidate: a
polynomial-time computable, length-preserving function that is one-way exactly
when one-way functions exist at all. -/
theorem exists_complete_length_preserving_owf :
∃ U : Bits → Bits, PolyTimeComputable U ∧ LengthPreserving U ∧
(OneWay U ↔ ∃ f : Bits → Bits, OneWay f) := by
sorry
end Levin2003
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, authored by the drafting agent
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statements in this proposal, at the explicit instruction of the proposal's owner. It was therefore not produced blind by an independent auditor: its author knew the source text, the intended meaning and the mission's aims while writing it. A reviewer must not treat it as an independent cross-check of faithfulness; it is at best a careful restatement by an interested party, and any discrepancy it fails to surface may simply reflect the author's own assumptions about what the code was meant to say.
The statement asserts the existence of a function from bit strings to bit strings with three properties jointly: is computable by a multi-tape Turing machine within steps for some fixed polynomial ; for every bit string ; and is one-way if and only if there exists a function on bit strings that is one-way, where one-wayness is the notion of the accompanying development (polynomial-time computable, length-preserving, and inverted with probability below by every polynomial-time inverter given coins, for all large ).
Two observations about the logical strength. The left-to-right half of the embedded equivalence is automatic for any such , since would witness its own existential; the content is the right-to-left half. And if no one-way function exists at all, the statement is satisfied by any polynomial-time computable length-preserving function whatsoever — the identity, for instance — so the assertion is not by itself evidence that hard functions exist. Nothing in the statement names or constrains beyond these properties: no universal machine, no step counter and no relation to Tiling Expansion is mentioned.