An internal model at OpenAI has produced a claimed refutation of ETH! Russell Impagliazzo, Mohan Paturi, and I have been asked to help organize an open and independent examination of this claim. 1/4
We’re sharing a solution to the Navier-Stokes Millennium Prize Problem, one of the deepest problems at the frontier of mathematics.
The proof was produced by a group of agents, using an OpenAI next-generation model significantly more capable than GPT-6 Astra.
The problem concerns whether the description of smooth three-dimensional fluid motion modeled by the Navier-Stokes equations can break down. It has remained unresolved for roughly 90 years.
@kartik1507 @soubhik_deb @ittaia btw will you be turning this into a paper? It seems neat to make catching-up in simplex more communication-efficient.
philosophically it's a tradeoff between simplicity of liveness<->complexity of dealing with lost messages.
The protocol is dear to me; it's so elegant, fast, easy.
I maintain that one day Simplex Consensus will be the byzantine protocol of choice everywhere (industry, in distributed systems classes).
https://t.co/vKXA0BEFvp
Introducing Exa 2.1
We scaled our pre-training and test-time compute by an order of magnitude, unlocking frontier search API performance for both fast and agentic search.
Deep dive below:
Introducing Exa 2.0
Breakthroughs in our AI research and engineering have enabled us to build both the fastest search API (<350ms) and the highest quality search on the market.
Product and technical deep dive below:
@yupi_asa@_patrickogrady@AndrewLewisPye@Tim_Roughgarden We can also deploy Simplex in an Algorand-like setting, it is essentially a drop-in replacement for their underlying permissioned protocol (https://t.co/34GHD7oNpd)
Unlike other “off-the-shelf” consensus implementations, consensus::simplex is refreshingly minimal.
It delivers simple agreement over opaque “blobs”. Functions that have historically motivated developers to create forks, like block broadcast, are abstracted as interfaces:
Today, we are excited to share our biggest release yet: consensus::simplex (our first of many upcoming consensus dialects).
consensus::simplex provides BFT agreement via a new, optimistically responsive construction inspired by Simplex Consensus:
https://t.co/SwSYfEfsWW
@nickthehabsfan how much of the increased offense is due to increased time on ice? He's seems like he's always on the ice (and do the OHL and NCAA even track TOI?)
@yoavgo@BlancheMinerva Not super sure I understand, because we can always run a randomized verifier many times to amplify its success probability; or are you looking for problems where, with some probability over some distribution of instances, there is no “good” verifier at all?
@yoavgo@discobordism Concretely this most reminds me of verifiers for zero-knowledge for 3-coloring/etc, or as another example the pcp theorem via gap amplification