<meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>HF Demo</title> <style> body { margin: 0; font-family: Arial, sans-serif; } header { background-color: #2c3e50; color: white; text-align: center; padding: 20px; font-size: 28px; font-weight: bold; } </style>

Poolside releases Laguna S 2.1, the open-weight coding model pitched as the West’s answer to DeepSeek and Qwen

Poolside Releases Laguna S 2.1: The West's Answer to Chinese AI Dominance

Poolside has released Laguna S 2.1, a groundbreaking 118-billion-parameter open-weight coding model designed for agentic coding. This powerful system rivals larger models in performance and runs efficiently on a single Nvidia DGX Spark desktop, making it accessible under the Linux Foundation's OpenMDW license.

Key Features:

  • Compact and Efficient: Laguna S 2.1 boasts a mixture-of-experts architecture with eight billion active parameters per token, allowing it to run locally on standard hardware.
  • Competitive Performance: On Terminal-Bench and SWE-Bench Pro, the model achieves over 70% and nearly 60%, respectively, matching or surpassing models from DeepSeek, Nvidia, and Thinking Machines.
  • Open-Source and Accessible: The weights are available on Hugging Face, promoting transparency and enabling self-hosting without data leakage to foreign providers.

Addressing a Critical Need:

Poolside's release comes as a response to the dominance of Chinese AI labs in the open-weight category. For over a year, models like DeepSeek, Qwen (Alibaba), and Kimi (Moonshot) have set benchmarks. This launch aims to provide Western enterprises and governments with a self-hosted alternative, ensuring data sovereignty.

Behind the Scenes:

Developed using Poolside's internal Model Factory platform, training was completed in under four weeks on 4,000 Nvidia H200 GPUs. The company emphasizes its ability to deliver new models rapidly, with a five-week cadence.

To showcase its capabilities, Poolside published a trajectory of the model solving a complex combinatorics problem—a feat previously achieved only by the largest frontier models.

Leave a Reply