Theoretical computer science·OpenAI Math·Result 103·Lean formalisation listed
Exact derandomization of logarithmic space: L=RL=BPL
One of the 372 results in OpenAI's public mathematics catalogue, filed under theoretical computer science: 1 preprint, the latest dated 23 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.
Latest paper
Exact derandomization of logarithmic space: L = RL = BPL
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Proves L=RL=BPL, resolving derandomization for bounded-error logarithmic-space computation. An effective compiler converts each randomized polynomial-time logarithmic-space machine deciding a language with one-sided or two-sided error into a deterministic logarithmic-space decider with explicit polynomial running-time bounds. (Lean)
Paper
Exact derandomization of logarithmic space: L = RL = BPL
We prove L=RL=BPL, resolving the derandomization problem for polynomial-time randomized logarithmic space.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Related results in Theoretical computer science
- 104Quasipolynomial algorithms for mean-payoff, stochastic and parity gamesLean
- 105Perfect completeness for 2-to-1 gamesLean
- 106Hardness of coloring three-colorable graphsLean
- 107Matrix multiplication with exponent at most 9/4Lean
- 108A cubic permanent–determinant lower boundLean
- 109Integer multiplication below n log n
