DeepSeek Speciale
DeepSeek
★ Free Tier Available🌐 Specialized & Science📊 3+ Use Cases
Overview
A high-compute variant of V3.2 designed specifically for Competitive Mathematics. It performs extensive 'internal search' to solve problems that trip up GPT-5.2. It is the gold standard for Putnam and IMO level problems.
How DeepSeek Speciale works:
- 1
Input AIME/IMO level problems
- 2
Allow it to think for 5 minutes
📋 Quick Specs
Pricing
API: $5/1M tokens
Context Window
32K tokens
API Access
✅ Yes
Released
January 2026
Supports:
text
🚀 Try This Prompt
Prove that for every integer n > 1, the sum of the first n prime numbers is never a square.
💡 Paste this into DeepSeek Speciale to see it in action.
Details
Best For
Competitive MathAbstract LogicProof Checking
Limitations
- ! Extremely high latency
- ! High token cost
Developer Resources
Listing Info
PublisherDeepSeek
CategorySpecialized & Science
UpdatedJan 2026