Grok 3 Beta

Grok 3 is xAI's most advanced model, trained on the Colossus supercluster with 10 times the computational power of previous state-of-the-art models. It boasts a 1M-token context window and advanced reasoning capabilities, enhanced through large-scale reinforcement learning, enabling deep thought processes ranging from seconds to minutes for solving complex problems. The model achieves top-tier performance across academic benchmarks and real-world user evaluations, earning an Elo score of 1402 in the Chatbot Arena. It was released alongside Grok 3 Mini, a cost-efficient variant optimized for streamlined reasoning.

Gemini 2.0 Flash Thinking

Gemini 2.0 Flash Thinking is an advanced reasoning model designed to enhance performance and explainability by making its thought process visible. It excels in complex problem-solving, coding challenges, and mathematical reasoning, demonstrating step-by-step solutions. Optimized for tasks that demand detailed explanations and logical analysis, the model also features native tool integration, including code execution and Google Search capabilities.

Grok 3 BetaGemini 2.0 Flash Thinking
Web Site ?
Provider ?
Chat ?
Release Date ?
Modalities ?
text ?
images ?
video ?
text ?
images ?
API Providers ?
xAI
Google AI Studio, Vertex AI, Gemini API
Knowledge Cut-off Date ?
2025-01
04.2024
Open Source ?
No
No
Pricing Input ?
Not available
Not available
Pricing Output ?
Not available
Not available
MMLU ?
Not available
Not available
MMLU-Pro ?
79.9%
Base model
Source
Not available
MMMU ?
78%
With Think mode
Source
75.4%
Source
HellaSwag ?
Not available
Not available
HumanEval ?
Not available
Not available
MATH ?
Not available
Not available
GPQA ?
84.6%
With Think mode, Diamond
Source
74.2%
Diamond Science
Source
IFEval ?
Not available
Not available
SimpleQA ?
-
-
AIME 2024
-
-
AIME 2025
-
-
Aider Polyglot ?
-
-
LiveCodeBench v5 ?
-
-
Global MMLU (Lite) ?
-
-
MathVista ?
-
-
Mobile Application

Compare LLMs

Add a Comment


10%
Our site uses cookies.

Privacy and Cookie Policy: This site uses cookies. By continuing to use the site, you agree to their use.