What was already known
Restricted randomized log-space models and simulations using more than logarithmic space do not establish exact log-space derandomization. The target is equality of these decision classes.
What changed and why it matters
Closes the stated deterministic-versus-randomized logarithmic-space gap.
The AI contribution
OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.
Limitations
The theorem concerns polynomial-time log-space machines in the stated model. It does not establish P=BPP or eliminate randomness from every polynomial-time algorithm. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.
Accessible artifact / proof
The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.
Correction and publication history
Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.
Read this published revision