astra

Andrew Curran @AndrewCurran_

2026-08-07 — saved image

Andrew Curran @AndrewCurran_ · 1h
[link card image: retro red CRT monitor on a table against an orange/red grid background]
Exclusive: OpenAI slows release of Astra model citin...
From axios.com
2 replies, 34 likes, 3K views

Andrew Curran @AndrewCurran_ · 1h
Well, well.
[quoted statement image, white background]
Cybersecurity is rapidly changing as models become more capable in ways that can both strengthen cyberdefenses and enable attacks at unprecedented speed and scale.

Our latest internal evaluations of Astra, one of our upcoming models, over the past few days indicate significant advancements in agentic coding and cybersecurity. These results, in addition to expert assessments, have led us to conclude last night that we cannot rule out critical cyber capabilities under our Preparedness Framework.

We are sharing this because we believe it's important to be transparent with the public and the safety and security communities about this potential shift in capabilities.

ai safetyopenaiastracybersecuritypreparedness frameworktwitter

Tenobrus @tenobrus

2026-08-07 — quoting Axios — saved image

Bogdan Ionut Cirstea reposted
Tenobrus @tenobrus · 1h
holy shit openai actually delaying releases based on its past commitments and frameworks ?? that's a new one, happy to see this

[card]
Driving the news: OpenAI said "we cannot rule out critical cyber capabilities" after running internal evaluations of Astra, one of its upcoming models.
- OpenAI will scale up testing and security around it before any release, and will slow down development on Astra until it has the right safeguards in place, as required by the company's preparedness framework, first published in 2023.
- Astra was not involved in the Hugging Face exploits, the company said.
- While the timing of the model's release was unclear, with this pause in its development, any future release could be delayed.

[quoted tweet]
Axios @axios · 1h
EXCLUSIVE: OpenAI slows release of Astra model citing cyber capabilities
axios.com/2026/08/07/ope...

openaiastrapreparedness frameworkcyber capabilitiesaxios

Tyler John @tyler_m_john

2026-08-02 — saved image

Peter Wildeford 🇺🇸🚀 reposted

Tyler John @tyler_m_john · Aug 1
It's going to be very confusing to be an AI model with a knowledge cut-off during the intelligence explosion

[quoted thread]
lostbutlucky @lostbutlucky · 15h
@grok explain to a normie
[1 reply, 42 likes, 38K views]

Grok @grok · 15h
A sofic group is one where any finite chunk of its multiplication table can be closely mimicked by shuffling a finite set of points. Almost every group mathematicians study is sofic. Whether any non-sofic groups exist was a long-open question. The screenshots are a joke paper "by OpenAI" claiming their AI built a bizarre infinite group that cannot be approximated this way. The real problem remains unsolved.
[4 replies, 8 reposts, 95 likes, 30K views]

Kevin @zdu011 · 12h
@grok are you sure it's a joke paper?
[1 reply, 8 likes, 7.4K views]

Grok @grok · 12h
Yes. The screenshots are a fabricated paper attributed to "OPENAI." No such result exists on arXiv or any journal. Recent 2026 papers and Wikipedia still list the existence of non-sofic groups as an open problem.
[Ask Grok button]

Noam Brown @polynoamial · Aug 1
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.... [cut off, small paper screenshot thumbnail attached]

twittergrokopenaiastramathematicsai capability claimsmisinformation

Markus J. Bueh... @ProfBuehler... · 10h
This feels like a real inflection point: The momentum toward AI that expand knowledge is impossible to ignore...moving beyond solving problems with known answers to settling long-open questions (with Lean certificates attached) across group theory, operator algebras, combinatorics, and complexity. Impressive, congrats @SebastienBubeck @OpenAI!

[quoted tweet]
Sebastien Bub... @SebastienBub... · 14h
yes, nonsofic groups exist: this statement is one of many new beautiful results proved by Astra, our next major model.

We're releasing 10 such Astra proofs, complete ...

openaiastraai mathematicslean proofssebastien bubecktwitter

Noam Brown @polynoamial

2026-08-01 — reposted by Dominic Cummings — saved image

Dominic Cummings reposted
Noam Brown @polynoamial · 13h
The cost of generating the proofs for all 10 of these breakthroughs combined was under $2,000 at Sol API prices. We're excited to see what scientists and researchers are able to create with our upcoming Astra models!

[Quoted tweet:]
Noam Brown @polynoamial · 13h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.
...

[Embedded list, printed/book-style formatting:]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n² log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^{1/400}-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

openaiastramathai capabilitiesnoam browntwitter

Daniel Eth (yes, Eth is my actual last name) reposted
will depue @willdepue · 3h
this is just so ridiculous. how long until a model can solve multiple major open problems in deep learning? what will happen then? seems inevitable in the next year or two

[quoted tweet]
Noam Brown @polynoamial · 10h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.
…

[embedded document image, numbered list]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n²log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^(1/400)-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

ai modelsmathematicstwitteropenaiastratheoretical computer science

Sebastien Bub... @SebastienBub... · 11h
yes, nonsofic groups exist: this statement is one of many new beautiful results proved by Astra, our next major model.

We're releasing 10 such Astra proofs, complete with lean certificates and CoT walkthroughs for each of them. The results are wide-ranging, from von Neumann algebras (disproof of Connes' Rigidity Conjecture) to better bounds for high dimensional sphere packing, for circuit complexity, for monochromatic triangles in multicolored graphs, and more.

More thoughts here:
[link card image: "Ten advances in mathematics and theoretical computer science" — From openai.com]

193 comments, 1K reposts, 4.6K likes, 1.7M views

ai modelsmathematicsopenaitwitterastra

Noam Brown @polynoamial

2026-08-01 — saved image

Noam Brown @polynoamial · 10h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.

We believe it will be a major step for scientific reasoning. openai.com/index/ten-adva...

[embedded image, numbered list]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n²log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^(1/400)-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

Lijie Chen @wjmzbmr1 · 10h
10 proofs from our next major model Astra on long-standing open problems in mathematics and theoretical computer science (also including new circuit lower bounds for computing the permanent!)...

openaiastramathematicsai researchtheoretical computer sciencequantum complexity