_xjdr releases Lean4-verified formal solution to open k-deck observation problem
_xjdr · x · 2026-09-04
AI researcher xjdr published a result drawn from his research journal and git logs, tackling the question: how much information about a system's execution history survives a restricted observer?
- A system can have enormously many execution histories but far fewer distinguishable outcomes; the k-deck model lets the observer see only how often each length-k subsequence pattern occurs
- With m^n possible words, the question is how many distinct observations they can produce
- The author says this proposes a general solution to an open problem posed by Chrisnata et al., proven, formalized, and machine-verified in Lean4
- He stresses the conclusions stand independently of any claims about intelligence or transformers
Related event: Researcher Accidentally Solves Open Problem, Verified in Lean4(2 posts)→
More from Research
- SPACE cuts agent LLM calls by 78.9% while raising success rate on long-horizon tasks — dair_ai · 2026-09-04
- CoRL 2026 hosts first workshop on imperfect robotics data: failures, OOD, human surprises — RobobertoMM · 2026-09-04
- Baseten launches Base Labs, a research org for open-source AI with fully shared recipes — baseten · 2026-09-04
- Study: AI companions rival human friendship, users mourn forced separations — EricTopol · 2026-09-04
- MazeBench: New 3D Spatial Reasoning Benchmark Where Prior SOTA Agents Score Just 1% — patience_cave · 2026-09-04
- "World Models from Scratch": a hands-on open-source book launches its first release — Cohere_Labs · 2026-09-04