Amanda H

1/ Since February, 8 papers across algebraic geometry, representation theory, number theory, combinatorics have been quietly appearing on arXiv. Proofs by AxiomProver. 5 papers are now accepted at solid peer-reviewed math journals. To our knowledge, a first for the literature.

Logical Intelligence introduces first energy-based reasoning AI Model, and brings Yann LeCun to leadership as founding chair of their Technical Research Board The 6-month-old Silicon Valley start-up, unveiled an “energy based” model called Kona and says it is more accurate and uses less power than large language models like OpenAI’s GPT-5 and Google’s Gemini. It is also starting a funding round that targets a $1bn-$2bn valuation and has named LeCun chair of its technical research board. Most large language models answer by predicting the next token, which can sound fluent while still drifting into confident mistakes. Kona is an "energy-based reasoning model" (EBRM) that verifies and optimizes solutions by scoring against constraints, finding the lowest "energy" (most consistent) outcome. It's non-autoregressive, producing complete traces without sequential generation, reducing hallucinations. Focuses on trustworthy, math-grounded reasoning for high-stakes applications where LLMs fail, emphasizing safety, efficiency, and constraint enforcement in logic-heavy tasks like puzzles or proofs. How Kona operates Its a non-autoregressive "energy-based reasoning model" (EBRM) model, meaning it doesn't generate outputs sequentially (like LLMs do token-by-token) but instead produces complete reasoning traces simultaneously. Here's how it works step-by-step: - Input Conditioning: It takes a problem, constraints, and optional targets (e.g., a desired outcome like a proof goal or spec) as inputs. These condition the model directly, unlike LLMs which rely on probabilistic sampling. - Energy Function Scoring: Kona learns an energy function that assigns a scalar "energy" score to entire reasoning traces (partial or complete). Low energy indicates high consistency with constraints and objectives; high energy flags inconsistencies, violations, or errors. This global scoring evaluates end-to-end quality, allowing the model to assess long-horizon coherence without degrading over extended traces. - Optimization as Reasoning: Reasoning is reframed as an optimization problem. The model searches for the lowest-energy solution by minimizing the energy function, often through iterative refinement. It can revise any part of a trace mid-process, using dense feedback to localize failures (e.g., "this step violates constraint X") and guide corrections. - Continuous Latent Space: Unlike discrete token-based LLMs, Kona works in a continuous space with dense vector representations. This enables precise, gradient-based edits and efficient local refinements without regenerating entire sequences. - Output: The final low-energy trace represents a valid, constraint-satisfying solution. For example, in Sudoku, it maps allowable moves and finds a puzzle completion that minimizes energy (i.e., maximizes rule adherence). This mechanism draws from physics-inspired principles, where energy minimization finds stable states, similar to how natural systems settle into low-energy configurations. Overall, Logical Intelligence views EBMs as a path beyond LLM limitations, enabling AI that "knows" rather than guesses, with applications in verifiable, efficient reasoning. This aligns with LeCun's long-standing advocacy for objective-driven AI via energy minimization, as opposed to autoregressive prediction.