High Reasoning

R1 Distill Llama 70B

DeepSeek R1 Distill Llama 70B is a powerful 70B-parameter AI model that distills advanced reasoning from DeepSeek's massive 671B MoE powerhouse into the efficient Llama architecture, excelling in math, coding, and logical tasks with near-frontier performance. Experience blazing-fast inference up to 57x faster than GPUs, enabling instant, real-world applications on U.S.-based infrastructure.

128k Context

High Intelligence

Jul '24 Knowledge

Available for Chat, Vision, and File Uploads.

Performance Benchmarks

MMLU

86.5%

HumanEval

85.0%

Artificial Analysis Intelligence Index

How do you want to interact?

Start a Conversation

Ask anything.
Have a natural conversation, brainstorm ideas, draft emails, or ask for advice.

Start Chatting

Use a Persona

Specialized Experts.
Instruct the AI to act as a Coding Tutor, Marketing Expert, or Travel Guide.

Pick a Persona

Why use R1 Distill Llama 70B?

Advanced Reasoning

Distilled from DeepSeek-R1 for sophisticated multi-step reasoning and logical inference across domains

Mathematical Problem-Solving

Top performance on MATH-500 (94.5%) and AIME 2024 (86.7%), outperforming models like GPT-4o

Code Generation

Excels in coding benchmarks like GPQA Diamond (65.2%) and LiveCodeBench (57.5%), surpassing o1-mini

Capability Examples

Math Reasoning Challenge

Solve this AIME-level problem: Find the number of positive integers n ≤ 1000 such that the equation x^2 + n x + (n+1) = 0 has integer roots.

The quadratic equation x² + n x + (n+1) = 0 has discriminant D = n² - 4(n+1) = n² - 4n - 4 = (n-2)² - 8. For integer roots, D must be a perfect square k² ≥ 0, so (n-2)² - k² = 8, or ((n-2)-k)((n-2)+k) = 8. Factor pairs of 8: (1,8), (2,4), (4,2), (8,1), and negatives, but since n>0 and k≥0, positive pairs. Solving: for d1=1,d2=8: n-2=(9/2) invalid integer; d1=2,d2=4: n-2=3, k=1, n=5; d1=4,d2=2 invalid order. Only n=5 works under n≤1000? Wait, also check negatives but yield n<0. Thus, only 1 such n.

Coding Task

Write a Python function to find the longest palindromic substring in a given string, optimized for efficiency.

python

Efficient O(n²) time via expand-around-centers, beats naive O(n³).

fas fa-code

How to use

Go to Chat

Navigate to the "AI Chat" page.

Select Model

Ensure R1 Distill Llama 70B is selected.

Type Prompt

Ask a question or paste code.

Interact

Refine the answer by replying to the AI.

Made with ❤ by AI4Chat

Upgrade to Premium

You're out of free credits